Lines Matching refs:pLeft
10499 ** Expr.pRight and Expr.pLeft are the left and right subexpressions of a
10541 ** the child Expr objects in the Expr.pLeft and Expr.pRight subtrees
10560 Expr *pLeft; /* Left subnode */
10643 #define EXPR_TOKENONLYSIZE offsetof(Expr,pLeft) /* Fewer features */
37974 struct RowSetEntry *pLeft; /* Left subtree (smaller entries) */
38170 if( pIn->pLeft ){
38172 rowSetTreeToList(pIn->pLeft, ppFirst, &p);
38204 struct RowSetEntry *pLeft; /* Left subtree */
38211 p->pLeft = p->pRight = 0;
38214 pLeft = rowSetNDeepTree(ppList, iDepth-1);
38217 return pLeft;
38219 p->pLeft = pLeft;
38232 struct RowSetEntry *pLeft; /* Left subtree */
38237 p->pLeft = p->pRight = 0;
38239 pLeft = p;
38242 p->pLeft = pLeft;
38307 p = p->pLeft;
59427 && (pExpr->pLeft->op==TK_INTEGER || pExpr->pLeft->op==TK_FLOAT) ){
59428 pExpr = pExpr->pLeft;
59456 if( SQLITE_OK==sqlite3ValueFromExpr(db,pExpr->pLeft,enc,affinity,&pVal) ){
73111 if( sqlite3WalkExpr(pWalker, pExpr->pLeft) ) return WRC_Abort;
73335 ** pExpr->pLeft Any expression this points to is deleted
73512 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
73589 sqlite3ExprDelete(db, pExpr->pLeft);
73590 pExpr->pLeft = 0;
73706 zTable = pExpr->pLeft->u.zToken;
73710 zDb = pExpr->pLeft->u.zToken;
73711 zTable = pRight->pLeft->u.zToken;
74545 p = p->pLeft;
74590 assert( pExpr->pLeft );
74591 aff = sqlite3ExprAffinity(pExpr->pLeft);
74632 ** a binary comparison operator comparing pLeft and pRight.
74639 ** Argument pRight (but not pLeft) may be a null pointer. In this case,
74644 Expr *pLeft,
74648 assert( pLeft );
74649 if( pLeft->flags & EP_ExpCollate ){
74650 assert( pLeft->pColl );
74651 pColl = pLeft->pColl;
74656 pColl = sqlite3ExprCollSeq(pParse, pLeft);
74669 Expr *pLeft, /* The left operand */
74680 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
74681 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
74752 heightOfExpr(p->pLeft, &nHeight);
74866 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
74869 ** In that case, delete the subtrees pLeft and pRight.
74874 Expr *pLeft,
74879 sqlite3ExprDelete(db, pLeft);
74889 if( pLeft ){
74890 pRoot->pLeft = pLeft;
74891 if( pLeft->flags & EP_ExpCollate ){
74893 pRoot->pColl = pLeft->pColl;
74910 Expr *pLeft, /* Left operand */
74915 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
74926 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
74927 if( pLeft==0 ){
74930 return pLeft;
74933 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
75049 sqlite3ExprDelete(db, p->pLeft);
75120 if( p->pLeft || p->pRight || p->pColl || p->x.pList ){
75151 ** space to duplicate all Expr nodes in the tree formed by Expr.pLeft
75160 nByte += dupedExprSize(p->pLeft, flags) + dupedExprSize(p->pRight, flags);
75170 ** (if applicable), and the copies of the p->pLeft and p->pRight expressions,
75235 /* Fill in pNew->pLeft and pNew->pRight. */
75239 pNew->pLeft = exprDup(db, p->pLeft, EXPRDUP_REDUCE, &zAlloc);
75248 pNew->pLeft = sqlite3ExprDup(db, p->pLeft, 0);
75650 rc = sqlite3ExprIsInteger(p->pLeft, pValue);
75655 if( sqlite3ExprIsInteger(p->pLeft, &v) ){
75682 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
75727 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
75925 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
75973 if( pX->pLeft->iColumn<0 && !ExprHasAnyProperty(pX, EP_xIsSelect) ){
76061 Expr *pLeft = pExpr->pLeft; /* the LHS of the IN operator */
76067 affinity = sqlite3ExprAffinity(pLeft);
76107 keyInfo.aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft,
76126 keyInfo.aColl[0] = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
76269 sqlite3ExprCode(pParse, pExpr->pLeft, r1);
76805 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
76810 /* Expressions of the form: CAST(pLeft AS token) */
76812 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
76854 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
76856 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
76866 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
76869 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
76909 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
76917 Expr *pLeft = pExpr->pLeft;
76918 assert( pLeft );
76919 if( pLeft->op==TK_INTEGER ){
76920 codeInteger(pParse, pLeft, 1, target);
76922 }else if( pLeft->op==TK_FLOAT ){
76924 codeReal(v, pLeft->u.zToken, 1, target);
76929 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free2);
76942 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
76956 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
77099 ** X is stored in pExpr->pLeft.
77104 Expr *pLeft = pExpr->pLeft;
77108 r1 = sqlite3ExprCodeTemp(pParse, pLeft, ®Free1);
77114 codeCompare(pParse, pLeft, pRight, OP_Ge,
77121 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
77128 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
77197 ** X (if it exists) is in pExpr->pLeft.
77227 if( (pX = pExpr->pLeft)!=0 ){
77235 opCompare.pLeft = &cacheX;
77448 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77453 /* Expressions of the form: CAST(pLeft AS token) */
77463 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77529 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77548 ** X is stored in pExpr->pLeft.
77553 Expr *pX = pExpr->pLeft;
77579 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77600 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77606 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77663 while( p->op==TK_UPLUS ) p = p->pLeft;
77686 if( p->pLeft->op==TK_FLOAT || p->pLeft->op==TK_INTEGER ){
77825 exprX = *pExpr->pLeft;
77827 exprAnd.pLeft = &compLeft;
77830 compLeft.pLeft = &exprX;
77833 compRight.pLeft = &exprX;
77885 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2,jumpIfNull^SQLITE_JUMPIFNULL);
77893 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
77899 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
77921 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
77923 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
77933 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
77936 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
77948 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
78034 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
78042 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, jumpIfNull^SQLITE_JUMPIFNULL);
78050 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
78066 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
78068 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78078 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
78081 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78091 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
78152 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft) ) return 2;
80940 pExpr = pExpr->pLeft;
88279 Expr *pLeft; /* Value from parent table row */
88281 Expr *pEq; /* Expression (pLeft = pRight) */
88285 pLeft = sqlite3Expr(db, TK_REGISTER, 0);
88286 if( pLeft ){
88294 pLeft->iTable = regData+iCol+1;
88295 pLeft->affinity = pCol->affinity;
88296 pLeft->pColl = sqlite3LocateCollSeq(pParse, pCol->zColl);
88298 pLeft->iTable = regData;
88299 pLeft->affinity = SQLITE_AFF_INTEGER;
88306 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
88315 Expr *pEq; /* Expression (pLeft = pRight) */
88316 Expr *pLeft; /* Value from parent table row */
88318 pLeft = sqlite3Expr(db, TK_REGISTER, 0);
88320 if( pLeft && pRight ){
88321 pLeft->iTable = regData;
88322 pLeft->affinity = SQLITE_AFF_INTEGER;
88326 pEq = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
94843 setJoinExpr(p->pLeft, iTable);
94865 struct SrcList_item *pLeft; /* Left table being joined */
94869 pLeft = &pSrc->a[0];
94870 pRight = &pLeft[1];
94871 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
94872 Table *pLeftTab = pLeft->pTab;
97074 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
97083 pExpr->pLeft = substExpr(db, pExpr->pLeft, iTable, pEList);
97832 assert( pE->op!=TK_DOT || (pE->pLeft!=0 && pE->pLeft->op==TK_ID) );
97867 assert( pE->pLeft!=0 );
97868 assert( !ExprHasProperty(pE->pLeft, EP_IntValue) );
97869 zTName = pE->pLeft->u.zToken;
97918 Expr *pLeft;
97919 pLeft = sqlite3Expr(db, TK_ID, zTabName);
97920 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
102968 whereSplit(pWC, pExpr->pLeft, op);
103030 mask |= exprTableUsage(pMaskSet, p->pLeft);
103108 u16 expLeft = (pExpr->pLeft->flags & EP_ExpCollate);
103111 pExpr->pLeft->pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
103112 SWAP(CollSeq*,pExpr->pRight->pColl,pExpr->pLeft->pColl);
103114 pExpr->pLeft->flags = (pExpr->pLeft->flags & ~EP_ExpCollate) | expRight;
103115 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
103189 assert(pX->pLeft);
103190 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
103240 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
103256 pLeft = pList->a[1].pExpr;
103257 if( pLeft->op!=TK_COLUMN || sqlite3ExprAffinity(pLeft)!=SQLITE_AFF_TEXT ){
103262 assert( pLeft->iColumn!=(-1) ); /* Because IPK never has AFF_TEXT */
103615 affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft);
103634 Expr *pLeft = 0; /* The LHS of the IN operator */
103644 pLeft = pOrTerm->pExpr->pLeft;
103646 assert( pLeft!=0 );
103647 pLeft, 0);
103696 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
103712 prereqLeft = exprTableUsage(pMaskSet, pExpr->pLeft);
103738 Expr *pLeft = pExpr->pLeft;
103740 if( pLeft->op==TK_COLUMN ){
103741 pTerm->leftCursor = pLeft->iTable;
103742 pTerm->u.leftColumn = pLeft->iColumn;
103767 pLeft = pDup->pLeft;
103768 pNew->leftCursor = pLeft->iTable;
103769 pNew->u.leftColumn = pLeft->iColumn;
103803 sqlite3ExprDup(db, pExpr->pLeft, 0),
103840 Expr *pLeft; /* LHS of LIKE/GLOB operator */
103848 pLeft = pExpr->x.pList->a[1].pExpr;
103870 sqlite3ExprSetColl(sqlite3ExprDup(db,pLeft,0), pColl),
103876 sqlite3ExprSetColl(sqlite3ExprDup(db,pLeft,0), pColl),
103899 Expr *pRight, *pLeft;
103904 pLeft = pExpr->x.pList->a[1].pExpr;
103906 prereqColumn = exprTableUsage(pMaskSet, pLeft);
103915 pNewTerm->leftCursor = pLeft->iTable;
103916 pNewTerm->u.leftColumn = pLeft->iColumn;
103939 && pExpr->pLeft->op==TK_COLUMN
103940 && pExpr->pLeft->iColumn>=0
103943 Expr *pLeft = pExpr->pLeft;
103948 sqlite3ExprDup(db, pLeft, 0),
103956 pNewTerm->leftCursor = pLeft->iTable;
103957 pNewTerm->u.leftColumn = pLeft->iColumn;
104070 CollSeq *p1 = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104659 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
106939 pAndExpr->pLeft = pOrExpr;
106973 pAndExpr->pLeft = 0;
107921 ExprSpan *pLeft, /* The left operand */
107924 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
107925 pOut->zStart = pLeft->zStart;
110255 Expr *pLeft = sqlite3PExpr(pParse, TK_ID, 0, 0, &yymsp[-2].minor.yy0);
110256 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
116801 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
116802 Fts3Expr *pLeft; /* Left operand */
120313 fts3EvalAllocateReaders(pCsr, pExpr->pLeft, pnToken, pnOr, pRc);
120352 char *pLeft;
120359 pLeft = p->doclist.aAll;
120367 pLeft = pList;
120372 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
120373 sqlite3_free(pLeft);
120725 fts3EvalStartReaders(pCsr, pExpr->pLeft, bOptOk, pRc);
120727 pExpr->bDeferred = (pExpr->pLeft->bDeferred && pExpr->pRight->bDeferred);
120787 assert( pExpr->pLeft && pExpr->pRight );
120789 pRoot = pExpr->pLeft;
120793 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pLeft, ppTC, ppOr, pRc);
121171 Fts3Expr *pLeft = pExpr->pLeft;
121173 assert( !pLeft->bDeferred || !pRight->bDeferred );
121175 if( pLeft->bDeferred ){
121184 fts3EvalNextRow(pCsr, pLeft, pRc);
121185 pExpr->iDocid = pLeft->iDocid;
121186 pExpr->bEof = pLeft->bEof;
121189 fts3EvalNextRow(pCsr, pLeft, pRc);
121191 while( !pLeft->bEof && !pRight->bEof && *pRc==SQLITE_OK ){
121192 sqlite3_int64 iDiff = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
121195 fts3EvalNextRow(pCsr, pLeft, pRc);
121200 pExpr->iDocid = pLeft->iDocid;
121201 pExpr->bEof = (pLeft->bEof || pRight->bEof);
121207 Fts3Expr *pLeft = pExpr->pLeft;
121209 sqlite3_int64 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
121211 assert( pLeft->bStart || pLeft->iDocid==pRight->iDocid );
121212 assert( pRight->bStart || pLeft->iDocid==pRight->iDocid );
121214 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
121215 fts3EvalNextRow(pCsr, pLeft, pRc);
121216 }else if( pLeft->bEof || (pRight->bEof==0 && iCmp>0) ){
121219 fts3EvalNextRow(pCsr, pLeft, pRc);
121223 pExpr->bEof = (pLeft->bEof && pRight->bEof);
121224 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
121225 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
121226 pExpr->iDocid = pLeft->iDocid;
121235 Fts3Expr *pLeft = pExpr->pLeft;
121243 fts3EvalNextRow(pCsr, pLeft, pRc);
121244 if( pLeft->bEof==0 ){
121247 && DOCID_CMP(pLeft->iDocid, pRight->iDocid)>0
121252 pExpr->iDocid = pLeft->iDocid;
121253 pExpr->bEof = pLeft->bEof;
121316 for(p=pExpr; p->pLeft; p=p->pLeft){
121336 for(p=pExpr->pLeft; p && res; p=p->pLeft){
121339 assert( p->pParent && p->pParent->pLeft==p );
121376 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
121401 for(p=pExpr; p->pPhrase==0; p=p->pLeft){
121414 int bHit1 = fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc);
121422 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
121559 fts3EvalRestart(pCsr, pExpr->pLeft, pRc);
121599 fts3EvalUpdateCounts(pExpr->pLeft);
121641 for(p=pRoot; p; p=p->pLeft){
122928 pNew->pLeft = pSplit;
122976 pNot->pLeft = pNotBranch;
122982 isPhrase = (eType==FTSQUERY_PHRASE || p->pLeft);
123030 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
123060 while( pIter->pLeft ){
123061 pIter = pIter->pLeft;
123063 pIter->pLeft = pRet;
123150 sqlite3Fts3ExprFree(p->pLeft);
123236 if( zBuf ) zBuf = exprToString(pExpr->pLeft, zBuf);
128804 assert( pExpr->pLeft && pExpr->pRight );
128805 rc = fts3ExprIterate2(pExpr->pLeft, piPhrase, x, pCtx);
132157 RtreeNode *pLeft,
132239 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
132259 RtreeNode *pLeft,
132279 nodeInsertCell(pRtree, pLeft, &aCell[iLeftSeed]);
132292 || (diff>0.0 && (RTREE_MINCELLS(pRtree)-NCELL(pLeft)!=i))
132297 nodeInsertCell(pRtree, pLeft, pNext);
132340 RtreeNode *pLeft = 0;
132347 ** all cells from node pLeft. Then zero the original node.
132365 pLeft = nodeNew(pRtree, pNode);
132370 pLeft = pNode;
132371 pRight = nodeNew(pRtree, pLeft->pParent);
132372 nodeReference(pLeft);
132375 if( !pLeft || !pRight ){
132380 memset(pLeft->zData, 0, pRtree->iNodeSize);
132383 rc = AssignCells(pRtree, aCell, nCell, pLeft, pRight, &leftbbox, &rightbbox);
132390 ** by nodeNew() above. But node pLeft sometimes already has a node number.
132394 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
132400 leftbbox.iRowid = pLeft->iNode;
132403 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
132408 RtreeNode *pParent = pLeft->pParent;
132410 rc = nodeParentIndex(pRtree, pLeft, &iCell);
132434 for(i=0; i<NCELL(pLeft); i++){
132435 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
132436 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
132442 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
132450 rc = nodeRelease(pRtree, pLeft);
132451 pLeft = 0;
132456 nodeRelease(pRtree, pLeft);
