Lines Matching refs:pLeft
9935 ** Expr.pRight and Expr.pLeft are the left and right subexpressions of a
9977 ** the child Expr objects in the Expr.pLeft and Expr.pRight subtrees
9996 Expr *pLeft; /* Left subnode */
10079 #define EXPR_TOKENONLYSIZE offsetof(Expr,pLeft) /* Fewer features */
35968 struct RowSetEntry *pLeft; /* Left subtree (smaller entries) */
36164 if( pIn->pLeft ){
36166 rowSetTreeToList(pIn->pLeft, ppFirst, &p);
36198 struct RowSetEntry *pLeft; /* Left subtree */
36205 p->pLeft = p->pRight = 0;
36208 pLeft = rowSetNDeepTree(ppList, iDepth-1);
36211 return pLeft;
36213 p->pLeft = pLeft;
36226 struct RowSetEntry *pLeft; /* Left subtree */
36231 p->pLeft = p->pRight = 0;
36233 pLeft = p;
36236 p->pLeft = pLeft;
36301 p = p->pLeft;
57014 && (pExpr->pLeft->op==TK_INTEGER || pExpr->pLeft->op==TK_FLOAT) ){
57015 pExpr = pExpr->pLeft;
57043 if( SQLITE_OK==sqlite3ValueFromExpr(db,pExpr->pLeft,enc,affinity,&pVal) ){
69442 if( sqlite3WalkExpr(pWalker, pExpr->pLeft) ) return WRC_Abort;
69646 ** pExpr->pLeft Any expression this points to is deleted
69836 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
69913 sqlite3ExprDelete(db, pExpr->pLeft);
69914 pExpr->pLeft = 0;
70030 zTable = pExpr->pLeft->u.zToken;
70034 zDb = pExpr->pLeft->u.zToken;
70035 zTable = pRight->pLeft->u.zToken;
70855 p = p->pLeft;
70900 assert( pExpr->pLeft );
70901 aff = sqlite3ExprAffinity(pExpr->pLeft);
70942 ** a binary comparison operator comparing pLeft and pRight.
70949 ** Argument pRight (but not pLeft) may be a null pointer. In this case,
70954 Expr *pLeft,
70958 assert( pLeft );
70959 if( pLeft->flags & EP_ExpCollate ){
70960 assert( pLeft->pColl );
70961 pColl = pLeft->pColl;
70966 pColl = sqlite3ExprCollSeq(pParse, pLeft);
70979 Expr *pLeft, /* The left operand */
70990 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
70991 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
71062 heightOfExpr(p->pLeft, &nHeight);
71175 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
71178 ** In that case, delete the subtrees pLeft and pRight.
71183 Expr *pLeft,
71188 sqlite3ExprDelete(db, pLeft);
71198 if( pLeft ){
71199 pRoot->pLeft = pLeft;
71200 if( pLeft->flags & EP_ExpCollate ){
71202 pRoot->pColl = pLeft->pColl;
71219 Expr *pLeft, /* Left operand */
71224 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
71235 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
71236 if( pLeft==0 ){
71239 return pLeft;
71242 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
71356 sqlite3ExprDelete(db, p->pLeft);
71427 if( p->pLeft || p->pRight || p->pColl || p->x.pList ){
71458 ** space to duplicate all Expr nodes in the tree formed by Expr.pLeft
71467 nByte += dupedExprSize(p->pLeft, flags) + dupedExprSize(p->pRight, flags);
71477 ** (if applicable), and the copies of the p->pLeft and p->pRight expressions,
71544 /* Fill in pNew->pLeft and pNew->pRight. */
71548 pNew->pLeft = exprDup(db, p->pLeft, EXPRDUP_REDUCE, &zAlloc);
71557 pNew->pLeft = sqlite3ExprDup(db, p->pLeft, 0);
71953 rc = sqlite3ExprIsInteger(p->pLeft, pValue);
71958 if( sqlite3ExprIsInteger(p->pLeft, &v) ){
71985 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
72030 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
72213 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
72261 if( pX->pLeft->iColumn<0 && !ExprHasAnyProperty(pX, EP_xIsSelect) ){
72352 Expr *pLeft = pExpr->pLeft; /* the LHS of the IN operator */
72358 affinity = sqlite3ExprAffinity(pLeft);
72398 keyInfo.aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft,
72417 keyInfo.aColl[0] = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
72560 sqlite3ExprCode(pParse, pExpr->pLeft, r1);
73094 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
73099 /* Expressions of the form: CAST(pLeft AS token) */
73101 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
73143 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
73145 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
73155 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
73158 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
73198 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
73206 Expr *pLeft = pExpr->pLeft;
73207 assert( pLeft );
73208 if( pLeft->op==TK_INTEGER ){
73209 codeInteger(pParse, pLeft, 1, target);
73211 }else if( pLeft->op==TK_FLOAT ){
73213 codeReal(v, pLeft->u.zToken, 1, target);
73218 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free2);
73231 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
73245 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
73388 ** X is stored in pExpr->pLeft.
73393 Expr *pLeft = pExpr->pLeft;
73397 r1 = sqlite3ExprCodeTemp(pParse, pLeft, ®Free1);
73403 codeCompare(pParse, pLeft, pRight, OP_Ge,
73410 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
73417 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
73486 ** X (if it exists) is in pExpr->pLeft.
73516 if( (pX = pExpr->pLeft)!=0 ){
73524 opCompare.pLeft = &cacheX;
73694 while( p->op==TK_UPLUS ) p = p->pLeft;
73717 if( p->pLeft->op==TK_FLOAT || p->pLeft->op==TK_INTEGER ){
73856 exprX = *pExpr->pLeft;
73858 exprAnd.pLeft = &compLeft;
73861 compLeft.pLeft = &exprX;
73864 compRight.pLeft = &exprX;
73916 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2,jumpIfNull^SQLITE_JUMPIFNULL);
73924 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
73930 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
73952 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
73954 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
73964 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
73967 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
73979 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
74065 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
74073 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, jumpIfNull^SQLITE_JUMPIFNULL);
74081 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
74097 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
74099 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
74109 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
74112 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
74122 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
74183 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft) ) return 2;
76547 pExpr = pExpr->pLeft;
83782 Expr *pLeft; /* Value from parent table row */
83784 Expr *pEq; /* Expression (pLeft = pRight) */
83788 pLeft = sqlite3Expr(db, TK_REGISTER, 0);
83789 if( pLeft ){
83797 pLeft->iTable = regData+iCol+1;
83798 pLeft->affinity = pCol->affinity;
83799 pLeft->pColl = sqlite3LocateCollSeq(pParse, pCol->zColl);
83801 pLeft->iTable = regData;
83802 pLeft->affinity = SQLITE_AFF_INTEGER;
83809 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
83818 Expr *pEq; /* Expression (pLeft = pRight) */
83819 Expr *pLeft; /* Value from parent table row */
83821 pLeft = sqlite3Expr(db, TK_REGISTER, 0);
83823 if( pLeft && pRight ){
83824 pLeft->iTable = regData;
83825 pLeft->affinity = SQLITE_AFF_INTEGER;
83829 pEq = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
90223 setJoinExpr(p->pLeft, iTable);
90245 struct SrcList_item *pLeft; /* Left table being joined */
90249 pLeft = &pSrc->a[0];
90250 pRight = &pLeft[1];
90251 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
90252 Table *pLeftTab = pLeft->pTab;
92426 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
92435 pExpr->pLeft = substExpr(db, pExpr->pLeft, iTable, pEList);
93177 assert( pE->op!=TK_DOT || (pE->pLeft!=0 && pE->pLeft->op==TK_ID) );
93212 assert( pE->pLeft!=0 );
93213 assert( !ExprHasProperty(pE->pLeft, EP_IntValue) );
93214 zTName = pE->pLeft->u.zToken;
93263 Expr *pLeft;
93264 pLeft = sqlite3Expr(db, TK_ID, zTabName);
93265 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
94314 if( p->pLeft ){
94316 sqlite3PrintExpr(p->pLeft);
98040 whereSplit(pWC, pExpr->pLeft, op);
98102 mask |= exprTableUsage(pMaskSet, p->pLeft);
98172 u16 expLeft = (pExpr->pLeft->flags & EP_ExpCollate);
98175 pExpr->pLeft->pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
98176 SWAP(CollSeq*,pExpr->pRight->pColl,pExpr->pLeft->pColl);
98178 pExpr->pLeft->flags = (pExpr->pLeft->flags & ~EP_ExpCollate) | expRight;
98179 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
98252 assert(pX->pLeft);
98253 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
98302 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
98318 pLeft = pList->a[1].pExpr;
98319 if( pLeft->op!=TK_COLUMN || sqlite3ExprAffinity(pLeft)!=SQLITE_AFF_TEXT ){
98324 assert( pLeft->iColumn!=(-1) ); /* Because IPK never has AFF_TEXT */
98676 affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft);
98695 Expr *pLeft = 0; /* The LHS of the IN operator */
98705 pLeft = pOrTerm->pExpr->pLeft;
98707 assert( pLeft!=0 );
98708 pDup = sqlite3ExprDup(db, pLeft, 0);
98757 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
98773 prereqLeft = exprTableUsage(pMaskSet, pExpr->pLeft);
98799 Expr *pLeft = pExpr->pLeft;
98801 if( pLeft->op==TK_COLUMN ){
98802 pTerm->leftCursor = pLeft->iTable;
98803 pTerm->u.leftColumn = pLeft->iColumn;
98828 pLeft = pDup->pLeft;
98829 pNew->leftCursor = pLeft->iTable;
98830 pNew->u.leftColumn = pLeft->iColumn;
98864 sqlite3ExprDup(db, pExpr->pLeft, 0),
98901 Expr *pLeft; /* LHS of LIKE/GLOB operator */
98909 pLeft = pExpr->x.pList->a[1].pExpr;
98931 sqlite3ExprSetColl(sqlite3ExprDup(db,pLeft,0), pColl),
98937 sqlite3ExprSetColl(sqlite3ExprDup(db,pLeft,0), pColl),
98960 Expr *pRight, *pLeft;
98965 pLeft = pExpr->x.pList->a[1].pExpr;
98967 prereqColumn = exprTableUsage(pMaskSet, pLeft);
98976 pNewTerm->leftCursor = pLeft->iTable;
98977 pNewTerm->u.leftColumn = pLeft->iColumn;
99000 && pExpr->pLeft->op==TK_COLUMN
99001 && pExpr->pLeft->iColumn>=0
99004 Expr *pLeft = pExpr->pLeft;
99009 sqlite3ExprDup(db, pLeft, 0),
99017 pNewTerm->leftCursor = pLeft->iTable;
99018 pNewTerm->u.leftColumn = pLeft->iColumn;
99551 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
102728 ExprSpan *pLeft, /* The left operand */
102731 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
102732 pOut->zStart = pLeft->zStart;
105052 Expr *pLeft = sqlite3PExpr(pParse, TK_ID, 0, 0, &yymsp[-2].minor.yy0);
105053 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
113220 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
113221 Fts3Expr *pLeft; /* Left operand */
115385 rc = fts3DeferExpression(pCsr, pExpr->pLeft);
115637 ** Both pLeft and pRight are expression nodes of type FTSQUERY_PHRASE. Both
115643 SQLITE_PRIVATE int sqlite3Fts3ExprNearTrim(Fts3Expr *pLeft, Fts3Expr *pRight, int nNear){
115646 assert( pLeft->eType==FTSQUERY_PHRASE );
115648 assert( pLeft->isLoaded && pRight->isLoaded );
115650 if( pLeft->aDoclist==0 || pRight->aDoclist==0 ){
115651 sqlite3_free(pLeft->aDoclist);
115654 pLeft->aDoclist = 0;
115661 pLeft->pPhrase->nToken, pLeft->aDoclist, pLeft->nDoclist,
115672 pLeft->pPhrase->nToken, pLeft->aDoclist, pLeft->nDoclist,
115675 sqlite3_free(pLeft->aDoclist);
115676 pLeft->aDoclist = aOut;
115677 pLeft->nDoclist = nOut;
115714 rc = fts3ExprAllocateSegReaders(pCsr, pExpr->pLeft, pnExpr);
115737 fts3ExprFreeSegReaders(pExpr->pLeft);
115758 nCost = fts3ExprCost(pExpr->pLeft) + fts3ExprCost(pExpr->pRight);
115779 fts3ExprAssignCosts(pExpr->pLeft, ppExprCost);
115931 && 0==(rc = fts3EvalExpr(p, pExpr->pLeft, &aLeft, &nLeft, isReqPos))
115935 Fts3Expr *pLeft;
115941 pLeft = pExpr->pLeft;
115942 while( pLeft->eType==FTSQUERY_NEAR ){
115943 pLeft=pLeft->pRight;
115947 assert( pLeft->eType==FTSQUERY_PHRASE );
115950 pLeft->pPhrase->nToken, aLeft, nLeft,
117751 pNew->pLeft = pSplit;
117799 pNot->pLeft = pNotBranch;
117806 isPhrase = (eType==FTSQUERY_PHRASE || p->pLeft);
117854 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
117884 while( pIter->pLeft ){
117885 pIter = pIter->pLeft;
117887 pIter->pLeft = pRet;
117968 sqlite3Fts3ExprFree(p->pLeft);
118052 if( zBuf ) zBuf = exprToString(pExpr->pLeft, zBuf);
122403 fts3DeferredDoclistClear(pExpr->pLeft);
122781 assert( pExpr->pLeft && pExpr->pRight );
122782 rc = fts3ExprIterate2(pExpr->pLeft, piPhrase, x, pCtx);
122840 Fts3Expr *pLeft = pParent->pLeft;
122842 if( pLeft->eType!=FTSQUERY_PHRASE ){
122843 assert( pLeft->eType==FTSQUERY_NEAR );
122844 assert( pLeft->pRight->eType==FTSQUERY_PHRASE );
122845 pLeft = pLeft->pRight;
122848 rc = sqlite3Fts3ExprNearTrim(pLeft, pExpr, nNear);
122850 pExpr = pLeft;
126250 RtreeNode *pLeft,
126332 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
126352 RtreeNode *pLeft,
126372 nodeInsertCell(pRtree, pLeft, &aCell[iLeftSeed]);
126385 || (diff>0.0 && (RTREE_MINCELLS(pRtree)-NCELL(pLeft)!=i))
126390 nodeInsertCell(pRtree, pLeft, pNext);
126433 RtreeNode *pLeft = 0;
126440 ** all cells from node pLeft. Then zero the original node.
126458 pLeft = nodeNew(pRtree, pNode);
126463 pLeft = pNode;
126464 pRight = nodeNew(pRtree, pLeft->pParent);
126465 nodeReference(pLeft);
126468 if( !pLeft || !pRight ){
126473 memset(pLeft->zData, 0, pRtree->iNodeSize);
126476 rc = AssignCells(pRtree, aCell, nCell, pLeft, pRight, &leftbbox, &rightbbox);
126483 ** by nodeNew() above. But node pLeft sometimes already has a node number.
126487 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
126493 leftbbox.iRowid = pLeft->iNode;
126496 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
126501 RtreeNode *pParent = pLeft->pParent;
126503 rc = nodeParentIndex(pRtree, pLeft, &iCell);
126527 for(i=0; i<NCELL(pLeft); i++){
126528 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
126529 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
126535 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
126543 rc = nodeRelease(pRtree, pLeft);
126544 pLeft = 0;
126549 nodeRelease(pRtree, pLeft);