Lines Matching refs:pLeft
9718 ** Expr.pRight and Expr.pLeft are the left and right subexpressions of a
9760 ** the child Expr objects in the Expr.pLeft and Expr.pRight subtrees
9779 Expr *pLeft; /* Left subnode */
9862 #define EXPR_TOKENONLYSIZE offsetof(Expr,pLeft) /* Fewer features */
34354 struct RowSetEntry *pLeft; /* Left subtree (smaller entries) */
34550 if( pIn->pLeft ){
34552 rowSetTreeToList(pIn->pLeft, ppFirst, &p);
34584 struct RowSetEntry *pLeft; /* Left subtree */
34591 p->pLeft = p->pRight = 0;
34594 pLeft = rowSetNDeepTree(ppList, iDepth-1);
34597 return pLeft;
34599 p->pLeft = pLeft;
34612 struct RowSetEntry *pLeft; /* Left subtree */
34617 p->pLeft = p->pRight = 0;
34619 pLeft = p;
34622 p->pLeft = pLeft;
34687 p = p->pLeft;
55212 && (pExpr->pLeft->op==TK_INTEGER || pExpr->pLeft->op==TK_FLOAT) ){
55213 pExpr = pExpr->pLeft;
55241 if( SQLITE_OK==sqlite3ValueFromExpr(db,pExpr->pLeft,enc,affinity,&pVal) ){
67512 if( sqlite3WalkExpr(pWalker, pExpr->pLeft) ) return WRC_Abort;
67716 ** pExpr->pLeft Any expression this points to is deleted
67906 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
67983 sqlite3ExprDelete(db, pExpr->pLeft);
67984 pExpr->pLeft = 0;
68100 zTable = pExpr->pLeft->u.zToken;
68104 zDb = pExpr->pLeft->u.zToken;
68105 zTable = pRight->pLeft->u.zToken;
68925 p = p->pLeft;
68970 assert( pExpr->pLeft );
68971 aff = sqlite3ExprAffinity(pExpr->pLeft);
69012 ** a binary comparison operator comparing pLeft and pRight.
69019 ** Argument pRight (but not pLeft) may be a null pointer. In this case,
69024 Expr *pLeft,
69028 assert( pLeft );
69029 if( pLeft->flags & EP_ExpCollate ){
69030 assert( pLeft->pColl );
69031 pColl = pLeft->pColl;
69036 pColl = sqlite3ExprCollSeq(pParse, pLeft);
69049 Expr *pLeft, /* The left operand */
69060 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
69061 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
69132 heightOfExpr(p->pLeft, &nHeight);
69244 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
69247 ** In that case, delete the subtrees pLeft and pRight.
69252 Expr *pLeft,
69257 sqlite3ExprDelete(db, pLeft);
69267 if( pLeft ){
69268 pRoot->pLeft = pLeft;
69269 if( pLeft->flags & EP_ExpCollate ){
69271 pRoot->pColl = pLeft->pColl;
69288 Expr *pLeft, /* Left operand */
69293 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
69304 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
69305 if( pLeft==0 ){
69308 return pLeft;
69311 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
69425 sqlite3ExprDelete(db, p->pLeft);
69496 if( p->pLeft || p->pRight || p->pColl || p->x.pList ){
69527 ** space to duplicate all Expr nodes in the tree formed by Expr.pLeft
69536 nByte += dupedExprSize(p->pLeft, flags) + dupedExprSize(p->pRight, flags);
69546 ** (if applicable), and the copies of the p->pLeft and p->pRight expressions,
69611 /* Fill in pNew->pLeft and pNew->pRight. */
69615 pNew->pLeft = exprDup(db, p->pLeft, EXPRDUP_REDUCE, &zAlloc);
69624 pNew->pLeft = sqlite3ExprDup(db, p->pLeft, 0);
70019 rc = sqlite3ExprIsInteger(p->pLeft, pValue);
70024 if( sqlite3ExprIsInteger(p->pLeft, &v) ){
70058 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
70103 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
70286 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
70334 if( pX->pLeft->iColumn<0 && !ExprHasAnyProperty(pX, EP_xIsSelect) ){
70425 Expr *pLeft = pExpr->pLeft; /* the LHS of the IN operator */
70431 affinity = sqlite3ExprAffinity(pLeft);
70471 keyInfo.aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft,
70490 keyInfo.aColl[0] = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
70633 sqlite3ExprCode(pParse, pExpr->pLeft, r1);
71166 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
71171 /* Expressions of the form: CAST(pLeft AS token) */
71173 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
71215 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
71217 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
71227 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
71230 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
71270 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
71278 Expr *pLeft = pExpr->pLeft;
71279 assert( pLeft );
71280 if( pLeft->op==TK_INTEGER ){
71281 codeInteger(pParse, pLeft, 1, target);
71283 }else if( pLeft->op==TK_FLOAT ){
71285 codeReal(v, pLeft->u.zToken, 1, target);
71290 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free2);
71303 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
71317 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
71460 ** X is stored in pExpr->pLeft.
71465 Expr *pLeft = pExpr->pLeft;
71469 r1 = sqlite3ExprCodeTemp(pParse, pLeft, ®Free1);
71475 codeCompare(pParse, pLeft, pRight, OP_Ge,
71482 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
71489 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
71558 ** X (if it exists) is in pExpr->pLeft.
71588 if( (pX = pExpr->pLeft)!=0 ){
71596 opCompare.pLeft = &cacheX;
71766 while( p->op==TK_UPLUS ) p = p->pLeft;
71789 if( p->pLeft->op==TK_FLOAT || p->pLeft->op==TK_INTEGER ){
71928 exprX = *pExpr->pLeft;
71930 exprAnd.pLeft = &compLeft;
71933 compLeft.pLeft = &exprX;
71936 compRight.pLeft = &exprX;
71988 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2,jumpIfNull^SQLITE_JUMPIFNULL);
71996 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
72002 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
72024 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
72026 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
72036 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
72039 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
72051 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
72135 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
72143 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, jumpIfNull^SQLITE_JUMPIFNULL);
72151 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
72167 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
72169 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
72179 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
72182 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
72192 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
72251 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft) ) return 2;
74565 pExpr = pExpr->pLeft;
81726 Expr *pLeft; /* Value from parent table row */
81728 Expr *pEq; /* Expression (pLeft = pRight) */
81732 pLeft = sqlite3Expr(db, TK_REGISTER, 0);
81733 if( pLeft ){
81741 pLeft->iTable = regData+iCol+1;
81742 pLeft->affinity = pCol->affinity;
81743 pLeft->pColl = sqlite3LocateCollSeq(pParse, pCol->zColl);
81745 pLeft->iTable = regData;
81746 pLeft->affinity = SQLITE_AFF_INTEGER;
81753 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
81762 Expr *pEq; /* Expression (pLeft = pRight) */
81763 Expr *pLeft; /* Value from parent table row */
81765 pLeft = sqlite3Expr(db, TK_REGISTER, 0);
81767 if( pLeft && pRight ){
81768 pLeft->iTable = regData;
81769 pLeft->affinity = SQLITE_AFF_INTEGER;
81773 pEq = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
88148 setJoinExpr(p->pLeft, iTable);
88170 struct SrcList_item *pLeft; /* Left table being joined */
88174 pLeft = &pSrc->a[0];
88175 pRight = &pLeft[1];
88176 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
88177 Table *pLeftTab = pLeft->pTab;
90347 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
90356 pExpr->pLeft = substExpr(db, pExpr->pLeft, iTable, pEList);
91092 assert( pE->op!=TK_DOT || (pE->pLeft!=0 && pE->pLeft->op==TK_ID) );
91127 assert( pE->pLeft!=0 );
91128 assert( !ExprHasProperty(pE->pLeft, EP_IntValue) );
91129 zTName = pE->pLeft->u.zToken;
91178 Expr *pLeft;
91179 pLeft = sqlite3Expr(db, TK_ID, zTabName);
91180 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
92202 if( p->pLeft ){
92204 sqlite3PrintExpr(p->pLeft);
95904 whereSplit(pWC, pExpr->pLeft, op);
95966 mask |= exprTableUsage(pMaskSet, p->pLeft);
96036 u16 expLeft = (pExpr->pLeft->flags & EP_ExpCollate);
96039 pExpr->pLeft->pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
96040 SWAP(CollSeq*,pExpr->pRight->pColl,pExpr->pLeft->pColl);
96042 pExpr->pLeft->flags = (pExpr->pLeft->flags & ~EP_ExpCollate) | expRight;
96043 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
96116 assert(pX->pLeft);
96117 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
96166 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
96182 pLeft = pList->a[1].pExpr;
96183 if( pLeft->op!=TK_COLUMN || sqlite3ExprAffinity(pLeft)!=SQLITE_AFF_TEXT ){
96188 assert( pLeft->iColumn!=(-1) ); /* Because IPK never has AFF_TEXT */
96540 affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft);
96559 Expr *pLeft = 0; /* The LHS of the IN operator */
96569 pLeft = pOrTerm->pExpr->pLeft;
96571 assert( pLeft!=0 );
96572 pDup = sqlite3ExprDup(db, pLeft, 0);
96621 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
96637 prereqLeft = exprTableUsage(pMaskSet, pExpr->pLeft);
96663 Expr *pLeft = pExpr->pLeft;
96665 if( pLeft->op==TK_COLUMN ){
96666 pTerm->leftCursor = pLeft->iTable;
96667 pTerm->u.leftColumn = pLeft->iColumn;
96692 pLeft = pDup->pLeft;
96693 pNew->leftCursor = pLeft->iTable;
96694 pNew->u.leftColumn = pLeft->iColumn;
96728 sqlite3ExprDup(db, pExpr->pLeft, 0),
96765 Expr *pLeft; /* LHS of LIKE/GLOB operator */
96773 pLeft = pExpr->x.pList->a[1].pExpr;
96795 sqlite3ExprSetColl(sqlite3ExprDup(db,pLeft,0), pColl),
96801 sqlite3ExprSetColl(sqlite3ExprDup(db,pLeft,0), pColl),
96824 Expr *pRight, *pLeft;
96829 pLeft = pExpr->x.pList->a[1].pExpr;
96831 prereqColumn = exprTableUsage(pMaskSet, pLeft);
96840 pNewTerm->leftCursor = pLeft->iTable;
96841 pNewTerm->u.leftColumn = pLeft->iColumn;
97370 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
100297 ExprSpan *pLeft, /* The left operand */
100300 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
100301 pOut->zStart = pLeft->zStart;
102621 Expr *pLeft = sqlite3PExpr(pParse, TK_ID, 0, 0, &yymsp[-2].minor.yy0);
102622 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
108584 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
108585 Fts3Expr *pLeft; /* Left operand */
110549 rc = fts3DeferExpression(pCsr, pExpr->pLeft);
110801 ** Both pLeft and pRight are expression nodes of type FTSQUERY_PHRASE. Both
110807 SQLITE_PRIVATE int sqlite3Fts3ExprNearTrim(Fts3Expr *pLeft, Fts3Expr *pRight, int nNear){
110810 assert( pLeft->eType==FTSQUERY_PHRASE );
110812 assert( pLeft->isLoaded && pRight->isLoaded );
110814 if( pLeft->aDoclist==0 || pRight->aDoclist==0 ){
110815 sqlite3_free(pLeft->aDoclist);
110818 pLeft->aDoclist = 0;
110825 pLeft->pPhrase->nToken, pLeft->aDoclist, pLeft->nDoclist,
110836 pLeft->pPhrase->nToken, pLeft->aDoclist, pLeft->nDoclist,
110839 sqlite3_free(pLeft->aDoclist);
110840 pLeft->aDoclist = aOut;
110841 pLeft->nDoclist = nOut;
110878 rc = fts3ExprAllocateSegReaders(pCsr, pExpr->pLeft, pnExpr);
110901 fts3ExprFreeSegReaders(pExpr->pLeft);
110924 nCost = fts3ExprCost(pExpr->pLeft) + fts3ExprCost(pExpr->pRight);
110945 fts3ExprAssignCosts(pExpr->pLeft, ppExprCost);
111097 && 0==(rc = fts3EvalExpr(p, pExpr->pLeft, &aLeft, &nLeft, isReqPos))
111101 Fts3Expr *pLeft;
111107 pLeft = pExpr->pLeft;
111108 while( pLeft->eType==FTSQUERY_NEAR ){
111109 pLeft=pLeft->pRight;
111113 assert( pLeft->eType==FTSQUERY_PHRASE );
111116 pLeft->pPhrase->nToken, aLeft, nLeft,
112431 pNew->pLeft = pSplit;
112479 pNot->pLeft = pNotBranch;
112486 isPhrase = (eType==FTSQUERY_PHRASE || p->pLeft);
112534 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
112564 while( pIter->pLeft ){
112565 pIter = pIter->pLeft;
112567 pIter->pLeft = pRet;
112648 sqlite3Fts3ExprFree(p->pLeft);
112732 if( zBuf ) zBuf = exprToString(pExpr->pLeft, zBuf);
117247 fts3DeferredDoclistClear(pExpr->pLeft);
117625 assert( pExpr->pLeft && pExpr->pRight );
117626 rc = fts3ExprIterate2(pExpr->pLeft, piPhrase, x, pCtx);
117684 Fts3Expr *pLeft = pParent->pLeft;
117686 if( pLeft->eType!=FTSQUERY_PHRASE ){
117687 assert( pLeft->eType==FTSQUERY_NEAR );
117688 assert( pLeft->pRight->eType==FTSQUERY_PHRASE );
117689 pLeft = pLeft->pRight;
117692 rc = sqlite3Fts3ExprNearTrim(pLeft, pExpr, nNear);
117694 pExpr = pLeft;
121138 RtreeNode *pLeft,
121220 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
121240 RtreeNode *pLeft,
121260 nodeInsertCell(pRtree, pLeft, &aCell[iLeftSeed]);
121273 || (diff>0.0 && (RTREE_MINCELLS(pRtree)-NCELL(pLeft)!=i))
121278 nodeInsertCell(pRtree, pLeft, pNext);
121321 RtreeNode *pLeft = 0;
121328 ** all cells from node pLeft. Then zero the original node.
121346 pLeft = nodeNew(pRtree, pNode);
121351 pLeft = pNode;
121352 pRight = nodeNew(pRtree, pLeft->pParent);
121353 nodeReference(pLeft);
121356 if( !pLeft || !pRight ){
121361 memset(pLeft->zData, 0, pRtree->iNodeSize);
121364 rc = AssignCells(pRtree, aCell, nCell, pLeft, pRight, &leftbbox, &rightbbox);
121371 ** by nodeNew() above. But node pLeft sometimes already has a node number.
121375 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
121381 leftbbox.iRowid = pLeft->iNode;
121384 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
121389 RtreeNode *pParent = pLeft->pParent;
121391 rc = nodeParentIndex(pRtree, pLeft, &iCell);
121415 for(i=0; i<NCELL(pLeft); i++){
121416 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
121417 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
121423 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
121431 rc = nodeRelease(pRtree, pLeft);
121432 pLeft = 0;
121437 nodeRelease(pRtree, pLeft);
