Lines Matching refs:pLeft

12634   Expr *pLeft;           /* Left subnode */  member
12722 #define EXPR_TOKENONLYSIZE offsetof(Expr,pLeft) /* Fewer features */
23450 sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
23485 sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
23521 sqlite3TreeViewExpr(pView, pExpr->pLeft, 1);
23543 Expr *pX = pExpr->pLeft;
23566 sqlite3TreeViewExpr(pView, pExpr->pLeft, 1);
23590 sqlite3TreeViewExpr(pView, pExpr->pLeft, 1);
23594 sqlite3TreeViewExpr(pView, pExpr->pLeft, 0);
42462 struct RowSetEntry *pLeft; /* Left subtree (smaller entries) */
42677 if( pIn->pLeft ){
42679 rowSetTreeToList(pIn->pLeft, ppFirst, &p);
42711 struct RowSetEntry *pLeft; /* Left subtree */
42718 p->pLeft = p->pRight = 0;
42721 pLeft = rowSetNDeepTree(ppList, iDepth-1);
42724 return pLeft;
42726 p->pLeft = pLeft;
42739 struct RowSetEntry *pLeft; /* Left subtree */
42744 p->pLeft = p->pRight = 0;
42746 pLeft = p;
42749 p->pLeft = pLeft;
42777 struct RowSetEntry *pTree = p->pForest->pLeft;
42841 if( pTree->pLeft==0 ){
42842 pTree->pLeft = rowSetListToTree(p);
42846 rowSetTreeToList(pTree->pLeft, &pAux, &pTail);
42847 pTree->pLeft = 0;
42856 pTree->pLeft = rowSetListToTree(p);
42870 p = pTree->pLeft;
42875 p = p->pLeft;
66267 while( (op = pExpr->op)==TK_UPLUS ) pExpr = pExpr->pLeft;
66278 rc = valueFromExpr(db, pExpr->pLeft, enc, aff, ppVal, pCtx);
66291 && (pExpr->pLeft->op==TK_INTEGER || pExpr->pLeft->op==TK_FLOAT) ){
66292 pExpr = pExpr->pLeft;
66319 if( SQLITE_OK==sqlite3ValueFromExpr(db,pExpr->pLeft,enc,affinity,&pVal)
83388 if( sqlite3WalkExpr(pWalker, pExpr->pLeft) ) return WRC_Abort;
83899 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
83977 sqlite3ExprDelete(db, pExpr->pLeft);
83978 pExpr->pLeft = 0;
84134 zTable = pExpr->pLeft->u.zToken;
84138 zDb = pExpr->pLeft->u.zToken;
84139 zTable = pRight->pLeft->u.zToken;
84471 while( pParent->pLeft->op==TK_COLLATE ) pParent = pParent->pLeft;
84472 assert( pParent->pLeft==pE );
84473 pParent->pLeft = pNew;
85078 pNew->pLeft = pExpr;
85106 pExpr = pExpr->pLeft;
85129 p = p->pLeft;
85150 if( p->pLeft && (p->pLeft->flags & EP_Collate)!=0 ){
85151 p = p->pLeft;
85217 assert( pExpr->pLeft );
85218 aff = sqlite3ExprAffinity(pExpr->pLeft);
85271 Expr *pLeft,
85275 assert( pLeft );
85276 if( pLeft->flags & EP_Collate ){
85277 pColl = sqlite3ExprCollSeq(pParse, pLeft);
85281 pColl = sqlite3ExprCollSeq(pParse, pLeft);
85294 Expr *pLeft, /* The left operand */
85305 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
85306 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
85380 heightOfExpr(p->pLeft, &nHeight);
85516 Expr *pLeft,
85521 sqlite3ExprDelete(db, pLeft);
85528 if( pLeft ){
85529 pRoot->pLeft = pLeft;
85530 pRoot->flags |= EP_Propagate & pLeft->flags;
85546 Expr *pLeft, /* Left operand */
85551 if( op==TK_AND && pLeft && pRight && pParse->nErr==0 ){
85553 p = sqlite3ExprAnd(pParse->db, pLeft, pRight);
85556 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
85599 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
85600 if( pLeft==0 ){
85603 return pLeft;
85604 }else if( exprAlwaysFalse(pLeft) || exprAlwaysFalse(pRight) ){
85605 sqlite3ExprDelete(db, pLeft);
85610 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
85728 sqlite3ExprDelete(db, p->pLeft);
85799 if( p->pLeft || p->x.pList ){
85840 nByte += dupedExprSize(p->pLeft, flags) + dupedExprSize(p->pRight, flags);
85919 pNew->pLeft = exprDup(db, p->pLeft, EXPRDUP_REDUCE, &zAlloc);
85927 pNew->pLeft = sqlite3ExprDup(db, p->pLeft, 0);
86438 rc = sqlite3ExprIsInteger(p->pLeft, pValue);
86443 if( sqlite3ExprIsInteger(p->pLeft, &v) ){
86471 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
86502 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
86617 pLHS = pIn->pLeft;
86618 pIn->pLeft = 0;
86620 pIn->pLeft = pLHS;
86750 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
86805 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
86888 Expr *pLeft = pExpr->pLeft; /* the LHS of the IN operator */
86891 affinity = sqlite3ExprAffinity(pLeft);
86936 pKeyInfo->aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft,
86956 pKeyInfo->aColl[0] = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
87109 sqlite3ExprCode(pParse, pExpr->pLeft, r1);
87117 CollSeq *pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
87157 if( sqlite3ExprCanBeNull(pExpr->pLeft) ){
87707 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
87725 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
87727 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
87743 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
87746 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
87777 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
87785 Expr *pLeft = pExpr->pLeft;
87786 assert( pLeft );
87787 if( pLeft->op==TK_INTEGER ){
87788 codeInteger(pParse, pLeft, 1, target);
87790 }else if( pLeft->op==TK_FLOAT ){
87792 codeReal(v, pLeft->u.zToken, 1, target);
87799 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree2);
87810 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
87822 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
88005 Expr *pLeft = pExpr->pLeft;
88009 r1 = sqlite3ExprCodeTemp(pParse, pLeft, &regFree1);
88015 codeCompare(pParse, pLeft, pRight, OP_Ge,
88022 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
88031 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
88131 if( (pX = pExpr->pLeft)!=0 ){
88137 opCompare.pLeft = &tempX;
88413 exprX = *pExpr->pLeft;
88415 exprAnd.pLeft = &compLeft;
88418 compLeft.pLeft = &exprX;
88421 compRight.pLeft = &exprX;
88471 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2,jumpIfNull^SQLITE_JUMPIFNULL);
88480 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
88488 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
88498 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
88500 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
88516 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
88519 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
88531 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
88626 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
88635 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, jumpIfNull^SQLITE_JUMPIFNULL);
88644 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
88654 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
88656 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
88672 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
88675 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
88685 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, &regFree1);
88778 if( pA->op==TK_COLLATE && sqlite3ExprCompare(pA->pLeft, pB, iTab)<2 ){
88781 if( pB->op==TK_COLLATE && sqlite3ExprCompare(pA, pB->pLeft, iTab)<2 ){
88796 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft, iTab) ) return 2;
88862 && (sqlite3ExprImpliesExpr(pE1, pE2->pLeft, iTab)
88868 && sqlite3ExprCompare(pE1->pLeft, pE2->pLeft, iTab)==0
92477 pExpr = pExpr->pLeft;
94075 }else if( p->op==TK_COLLATE && p->pLeft->op==TK_STRING ){
94076 p->pLeft->op = TK_ID;
100966 Expr *pLeft; /* Value from parent table row */
100973 pLeft = exprTableRegister(pParse, pTab, regData, iCol);
100978 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
100995 Expr *pLeft; /* Value from parent table row */
100998 pLeft = exprTableRegister(pParse, pTab, regData, -1);
101000 pNe = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
101008 pLeft = exprTableRegister(pParse, pTab, regData, iCol);
101010 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
109030 setJoinExpr(p->pLeft, iTable);
109052 struct SrcList_item *pLeft; /* Left table being joined */
109056 pLeft = &pSrc->a[0];
109057 pRight = &pLeft[1];
109058 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
109059 Table *pLeftTab = pLeft->pTab;
111768 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
111774 pExpr->pLeft = substExpr(db, pExpr->pLeft, iTable, pEList);
112431 pWhere = pWhere->pLeft;
112700 Select *pLeft; /* Left-most SELECT statement */
112759 for(pLeft=pSel; pLeft->pPrior; pLeft=pLeft->pPrior);
112760 pEList = pLeft->pEList;
112949 assert( pE->op!=TK_DOT || (pE->pLeft!=0 && pE->pLeft->op==TK_ID) );
112985 assert( pE->pLeft!=0 );
112986 assert( !ExprHasProperty(pE->pLeft, EP_IntValue) );
112987 zTName = pE->pLeft->u.zToken;
113048 Expr *pLeft;
113049 pLeft = sqlite3Expr(db, TK_ID, zTabName);
113050 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
113052 pLeft = sqlite3Expr(db, TK_ID, zSchemaName);
113053 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pExpr, 0);
119807 pAndExpr->pLeft = pOrExpr;
119924 pAndExpr->pLeft = 0;
120021 pEAlt->pLeft = pE->pLeft;
120175 u16 expLeft = (pExpr->pLeft->flags & EP_Collate);
120183 }else if( sqlite3ExprCollSeq(pParse, pExpr->pLeft)!=0 ){
120187 pExpr->pLeft->flags |= EP_Collate;
120190 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
120250 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
120266 pLeft = pList->a[1].pExpr;
120267 if( pLeft->op!=TK_COLUMN
120268 || sqlite3ExprAffinity(pLeft)!=SQLITE_AFF_TEXT
120269 || IsVirtual(pLeft->pTab) /* Value might be numeric */
120275 assert( pLeft->iColumn!=(-1) ); /* Because IPK never has AFF_TEXT */
120430 assert( pOne->pExpr->pLeft!=0 && pOne->pExpr->pRight!=0 );
120431 assert( pTwo->pExpr->pLeft!=0 && pTwo->pExpr->pRight!=0 );
120432 if( sqlite3ExprCompare(pOne->pExpr->pLeft, pTwo->pExpr->pLeft, -1) ) return;
120734 affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft);
120751 Expr *pLeft = 0; /* The LHS of the IN operator */
120761 pLeft = pOrTerm->pExpr->pLeft;
120763 assert( pLeft!=0 );
120764 pDup = sqlite3ExprDup(db, pLeft, 0);
120807 aff1 = sqlite3ExprAffinity(pExpr->pLeft);
120814 pColl = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft, pExpr->pRight);
120816 pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
120940 prereqLeft = sqlite3WhereExprUsage(pMaskSet, pExpr->pLeft);
120967 Expr *pLeft = sqlite3ExprSkipCollate(pExpr->pLeft);
120970 if( exprMightBeIndexed(pSrc, prereqLeft, pLeft, &iCur, &iColumn) ){
121041 sqlite3ExprDup(db, pExpr->pLeft, 0),
121081 Expr *pLeft; /* LHS of LIKE/GLOB operator */
121090 pLeft = pExpr->x.pList->a[1].pExpr;
121124 pNewExpr1 = sqlite3ExprDup(db, pLeft, 0);
121132 pNewExpr2 = sqlite3ExprDup(db, pLeft, 0);
121157 Expr *pRight, *pLeft;
121162 pLeft = pExpr->x.pList->a[1].pExpr;
121164 prereqColumn = sqlite3WhereExprUsage(pMaskSet, pLeft);
121173 pNewTerm->leftCursor = pLeft->iTable;
121174 pNewTerm->u.leftColumn = pLeft->iColumn;
121193 && pExpr->pLeft->op==TK_COLUMN
121194 && pExpr->pLeft->iColumn>=0
121198 Expr *pLeft = pExpr->pLeft;
121203 sqlite3ExprDup(db, pLeft, 0),
121211 pNewTerm->leftCursor = pLeft->iTable;
121212 pNewTerm->u.leftColumn = pLeft->iColumn;
121257 sqlite3WhereSplit(pWC, pE2->pLeft, op);
121313 mask |= sqlite3WhereExprUsage(pMaskSet, p->pLeft);
121590 || sqlite3ExprCompare(pTerm->pExpr->pLeft,pScan->pIdxExpr,iCur)==0)
121619 assert(pX->pLeft);
121621 pX->pLeft, pX->pRight);
122112 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
123893 if( !whereUsablePartialIndex(iTab,pWC,pWhere->pLeft) ) return 0;
126113 ExprSpan *pLeft, /* The left operand */
126116 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
126117 pOut->zStart = pLeft->zStart;
128523 Select *pRight, *pLeft = yymsp[-4].minor.yy3;
128525 if( ALWAYS(pLeft) ) pLeft->selFlags &= ~SF_MultiValue;
128528 pLeft = yymsp[-4].minor.yy3;
128529 pRight->pPrior = pLeft;
128532 yygotominor.yy3 = pLeft;
128572 Expr *pLeft = sqlite3PExpr(pParse, TK_ID, 0, 0, &yymsp[-2].minor.yy0);
128573 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
135970 Fts3Expr *pLeft; /* Left operand */
139891 fts3EvalAllocateReaders(pCsr, pExpr->pLeft, pnToken, pnOr, pRc);
139933 char *pLeft;
139940 pLeft = p->doclist.aAll;
139948 pLeft = pList;
139954 pTab->bDescIdx, nDiff, pLeft, nLeft, &pRight, &nRight
139956 sqlite3_free(pLeft);
140540 fts3EvalStartReaders(pCsr, pExpr->pLeft, pRc);
140542 pExpr->bDeferred = (pExpr->pLeft->bDeferred && pExpr->pRight->bDeferred);
140602 assert( pExpr->pLeft && pExpr->pRight );
140604 pRoot = pExpr->pLeft;
140608 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pLeft, ppTC, ppOr, pRc);
140992 Fts3Expr *pLeft = pExpr->pLeft;
140994 assert( !pLeft->bDeferred || !pRight->bDeferred );
140996 if( pLeft->bDeferred ){
141005 fts3EvalNextRow(pCsr, pLeft, pRc);
141006 pExpr->iDocid = pLeft->iDocid;
141007 pExpr->bEof = pLeft->bEof;
141010 fts3EvalNextRow(pCsr, pLeft, pRc);
141012 while( !pLeft->bEof && !pRight->bEof && *pRc==SQLITE_OK ){
141013 sqlite3_int64 iDiff = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
141016 fts3EvalNextRow(pCsr, pLeft, pRc);
141021 pExpr->iDocid = pLeft->iDocid;
141022 pExpr->bEof = (pLeft->bEof || pRight->bEof);
141031 if( pLeft->pPhrase && pLeft->pPhrase->doclist.aAll ){
141032 Fts3Doclist *pDl = &pLeft->pPhrase->doclist;
141033 while( *pRc==SQLITE_OK && pLeft->bEof==0 ){
141035 fts3EvalNextRow(pCsr, pLeft, pRc);
141044 Fts3Expr *pLeft = pExpr->pLeft;
141046 sqlite3_int64 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
141048 assert( pLeft->bStart || pLeft->iDocid==pRight->iDocid );
141049 assert( pRight->bStart || pLeft->iDocid==pRight->iDocid );
141051 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
141052 fts3EvalNextRow(pCsr, pLeft, pRc);
141053 }else if( pLeft->bEof || (pRight->bEof==0 && iCmp>0) ){
141056 fts3EvalNextRow(pCsr, pLeft, pRc);
141060 pExpr->bEof = (pLeft->bEof && pRight->bEof);
141061 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
141062 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
141063 pExpr->iDocid = pLeft->iDocid;
141072 Fts3Expr *pLeft = pExpr->pLeft;
141080 fts3EvalNextRow(pCsr, pLeft, pRc);
141081 if( pLeft->bEof==0 ){
141084 && DOCID_CMP(pLeft->iDocid, pRight->iDocid)>0
141089 pExpr->iDocid = pLeft->iDocid;
141090 pExpr->bEof = pLeft->bEof;
141153 for(p=pExpr; p->pLeft; p=p->pLeft){
141176 for(p=pExpr->pLeft; p && res; p=p->pLeft){
141179 assert( p->pParent && p->pParent->pLeft==p );
141217 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
141242 for(p=pExpr; p->pPhrase==0; p=p->pLeft){
141255 int bHit1 = fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc);
141263 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
141418 fts3EvalRestart(pCsr, pExpr->pLeft, pRc);
141458 fts3EvalUpdateCounts(pExpr->pLeft);
141500 for(p=pRoot; p; p=p->pLeft){
141697 for(p=pNear; p; p=p->pLeft){
142960 pNew->pLeft = pSplit;
143012 pNot->pLeft = pNotBranch;
143019 isPhrase = (eType==FTSQUERY_PHRASE || p->pLeft);
143067 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
143098 while( pIter->pLeft ){
143099 pIter = pIter->pLeft;
143101 pIter->pLeft = pRet;
143129 rc = fts3ExprCheckDepth(p->pLeft, nMaxDepth-1);
143174 for(p=pRoot; p->eType==eType; p=p->pLeft){
143175 assert( p->pParent==0 || p->pParent->pLeft==p );
143176 assert( p->pLeft && p->pRight );
143184 assert( pParent==0 || pParent->pLeft==p );
143187 pParent->pLeft = 0;
143200 pFree->pLeft = apLeaf[iLvl];
143202 pFree->pLeft->pParent = pFree;
143221 for(p=pParent->pRight; p->eType==eType; p=p->pLeft);
143224 assert( pParent->pParent==0 || pParent->pParent->pLeft==pParent );
143227 pParent->pParent->pLeft = pParent->pRight;
143249 pFree->pLeft = apLeaf[i];
143250 pFree->pLeft->pParent = pFree;
143278 Fts3Expr *pLeft = pRoot->pLeft;
143281 pRoot->pLeft = 0;
143283 pLeft->pParent = 0;
143286 rc = fts3ExprBalance(&pLeft, nMaxDepth-1);
143293 sqlite3Fts3ExprFree(pLeft);
143295 assert( pLeft && pRight );
143296 pRoot->pLeft = pLeft;
143297 pLeft->pParent = pRoot;
143447 for(p=pDel; p && (p->pLeft||p->pRight); p=(p->pLeft ? p->pLeft : p->pRight)){
143448 assert( p->pParent==0 || p==p->pParent->pRight || p==p->pParent->pLeft );
143453 if( pParent && p==pParent->pLeft && pParent->pRight ){
143455 while( p && (p->pLeft || p->pRight) ){
143456 assert( p==p->pParent->pRight || p==p->pParent->pLeft );
143457 p = (p->pLeft ? p->pLeft : p->pRight);
143546 if( zBuf ) zBuf = exprToString(pExpr->pLeft, zBuf);
151850 assert( pExpr->pLeft && pExpr->pRight );
151851 rc = fts3ExprIterate2(pExpr->pLeft, piPhrase, x, pCtx);
152491 assert( (pExpr->pLeft==0)==(pExpr->pRight==0) );
152493 if( pExpr->pLeft ){
152494 fts3ExprLHitGather(pExpr->pLeft, p);
156181 RtreeNode *pLeft,
156263 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
156308 RtreeNode *pLeft = 0;
156333 pLeft = nodeNew(pRtree, pNode);
156338 pLeft = pNode;
156339 pRight = nodeNew(pRtree, pLeft->pParent);
156340 nodeReference(pLeft);
156343 if( !pLeft || !pRight ){
156348 memset(pLeft->zData, 0, pRtree->iNodeSize);
156351 rc = splitNodeStartree(pRtree, aCell, nCell, pLeft, pRight,
156363 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
156369 leftbbox.iRowid = pLeft->iNode;
156372 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
156377 RtreeNode *pParent = pLeft->pParent;
156379 rc = nodeParentIndex(pRtree, pLeft, &iCell);
156403 for(i=0; i<NCELL(pLeft); i++){
156404 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
156405 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
156411 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
156419 rc = nodeRelease(pRtree, pLeft);
156420 pLeft = 0;
156425 nodeRelease(pRtree, pLeft);
166811 Fts5ExprNode *pLeft,
170623 Fts5ExprPhrase *pLeft = pNear->apPhrase[0];
170640 if( pLeft->aTerm[0].pSynonym ){
170641 iLast = fts5ExprSynonymRowid(&pLeft->aTerm[0], bDesc, 0);
170643 iLast = sqlite3Fts5IterRowid(pLeft->aTerm[0].pIter);
170901 Fts5ExprNode *pLeft = pNode->apChild[0];
170902 rc = fts5ExprNodeNext(pExpr, pLeft, bFromValid, iFrom);
171566 Fts5ExprNode *pLeft, /* Left hand child expression */
171577 || (eType==FTS5_STRING && !pLeft && !pRight)
171580 if( eType!=FTS5_STRING && pLeft==0 ) return pRight;
171581 if( eType!=FTS5_STRING && pRight==0 ) return pLeft;
171587 if( pLeft->eType==eType ) nChild += pLeft->nChild-1;
171609 fts5ExprAddChildren(pRet, pLeft);
171617 sqlite3Fts5ParseNodeFree(pLeft);
172355 Fts5HashEntry *pLeft,
172358 Fts5HashEntry *p1 = pLeft;
173085 Fts5Buffer *pLeft, /* Left hand side of comparison */
173088 int nCmp = MIN(pLeft->n, nRight);
173089 int res = memcmp(pLeft->p, pRight, nCmp);
173090 return (res==0 ? (pLeft->n - nRight) : res);
173103 static int fts5BufferCompare(Fts5Buffer *pLeft, Fts5Buffer *pRight){
173104 int nCmp = MIN(pLeft->n, pRight->n);
173105 int res = memcmp(pLeft->p, pRight->p, nCmp);
173106 return (res==0 ? (pLeft->n - pRight->n) : res);
173111 const u8 *pLeft, int nLeft,
173115 int res = memcmp(pLeft, pRight, nCmp);