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 */
37946 struct RowSetEntry *pLeft; /* Left subtree (smaller entries) */
38142 if( pIn->pLeft ){
38144 rowSetTreeToList(pIn->pLeft, ppFirst, &p);
38176 struct RowSetEntry *pLeft; /* Left subtree */
38183 p->pLeft = p->pRight = 0;
38186 pLeft = rowSetNDeepTree(ppList, iDepth-1);
38189 return pLeft;
38191 p->pLeft = pLeft;
38204 struct RowSetEntry *pLeft; /* Left subtree */
38209 p->pLeft = p->pRight = 0;
38211 pLeft = p;
38214 p->pLeft = pLeft;
38279 p = p->pLeft;
59399 && (pExpr->pLeft->op==TK_INTEGER || pExpr->pLeft->op==TK_FLOAT) ){
59400 pExpr = pExpr->pLeft;
59428 if( SQLITE_OK==sqlite3ValueFromExpr(db,pExpr->pLeft,enc,affinity,&pVal) ){
73075 if( sqlite3WalkExpr(pWalker, pExpr->pLeft) ) return WRC_Abort;
73299 ** pExpr->pLeft Any expression this points to is deleted
73476 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
73553 sqlite3ExprDelete(db, pExpr->pLeft);
73554 pExpr->pLeft = 0;
73670 zTable = pExpr->pLeft->u.zToken;
73674 zDb = pExpr->pLeft->u.zToken;
73675 zTable = pRight->pLeft->u.zToken;
74509 p = p->pLeft;
74554 assert( pExpr->pLeft );
74555 aff = sqlite3ExprAffinity(pExpr->pLeft);
74596 ** a binary comparison operator comparing pLeft and pRight.
74603 ** Argument pRight (but not pLeft) may be a null pointer. In this case,
74608 Expr *pLeft,
74612 assert( pLeft );
74613 if( pLeft->flags & EP_ExpCollate ){
74614 assert( pLeft->pColl );
74615 pColl = pLeft->pColl;
74620 pColl = sqlite3ExprCollSeq(pParse, pLeft);
74633 Expr *pLeft, /* The left operand */
74644 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
74645 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
74716 heightOfExpr(p->pLeft, &nHeight);
74830 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
74833 ** In that case, delete the subtrees pLeft and pRight.
74838 Expr *pLeft,
74843 sqlite3ExprDelete(db, pLeft);
74853 if( pLeft ){
74854 pRoot->pLeft = pLeft;
74855 if( pLeft->flags & EP_ExpCollate ){
74857 pRoot->pColl = pLeft->pColl;
74874 Expr *pLeft, /* Left operand */
74879 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
74890 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
74891 if( pLeft==0 ){
74894 return pLeft;
74897 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
75013 sqlite3ExprDelete(db, p->pLeft);
75084 if( p->pLeft || p->pRight || p->pColl || p->x.pList ){
75115 ** space to duplicate all Expr nodes in the tree formed by Expr.pLeft
75124 nByte += dupedExprSize(p->pLeft, flags) + dupedExprSize(p->pRight, flags);
75134 ** (if applicable), and the copies of the p->pLeft and p->pRight expressions,
75199 /* Fill in pNew->pLeft and pNew->pRight. */
75203 pNew->pLeft = exprDup(db, p->pLeft, EXPRDUP_REDUCE, &zAlloc);
75212 pNew->pLeft = sqlite3ExprDup(db, p->pLeft, 0);
75614 rc = sqlite3ExprIsInteger(p->pLeft, pValue);
75619 if( sqlite3ExprIsInteger(p->pLeft, &v) ){
75646 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
75691 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
75889 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
75937 if( pX->pLeft->iColumn<0 && !ExprHasAnyProperty(pX, EP_xIsSelect) ){
76025 Expr *pLeft = pExpr->pLeft; /* the LHS of the IN operator */
76031 affinity = sqlite3ExprAffinity(pLeft);
76071 keyInfo.aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft,
76090 keyInfo.aColl[0] = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
76233 sqlite3ExprCode(pParse, pExpr->pLeft, r1);
76769 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
76774 /* Expressions of the form: CAST(pLeft AS token) */
76776 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
76818 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
76820 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
76830 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
76833 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
76873 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
76881 Expr *pLeft = pExpr->pLeft;
76882 assert( pLeft );
76883 if( pLeft->op==TK_INTEGER ){
76884 codeInteger(pParse, pLeft, 1, target);
76886 }else if( pLeft->op==TK_FLOAT ){
76888 codeReal(v, pLeft->u.zToken, 1, target);
76893 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free2);
76906 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
76920 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
77063 ** X is stored in pExpr->pLeft.
77068 Expr *pLeft = pExpr->pLeft;
77072 r1 = sqlite3ExprCodeTemp(pParse, pLeft, ®Free1);
77078 codeCompare(pParse, pLeft, pRight, OP_Ge,
77085 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
77092 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
77161 ** X (if it exists) is in pExpr->pLeft.
77191 if( (pX = pExpr->pLeft)!=0 ){
77199 opCompare.pLeft = &cacheX;
77412 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77417 /* Expressions of the form: CAST(pLeft AS token) */
77427 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77493 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77512 ** X is stored in pExpr->pLeft.
77517 Expr *pX = pExpr->pLeft;
77543 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77564 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77570 sqlite3ExplainExpr(pOut, pExpr->pLeft);
77627 while( p->op==TK_UPLUS ) p = p->pLeft;
77650 if( p->pLeft->op==TK_FLOAT || p->pLeft->op==TK_INTEGER ){
77789 exprX = *pExpr->pLeft;
77791 exprAnd.pLeft = &compLeft;
77794 compLeft.pLeft = &exprX;
77797 compRight.pLeft = &exprX;
77849 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2,jumpIfNull^SQLITE_JUMPIFNULL);
77857 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
77863 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
77885 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
77887 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
77897 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
77900 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
77912 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
77998 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
78006 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, jumpIfNull^SQLITE_JUMPIFNULL);
78014 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
78030 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
78032 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78042 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
78045 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78055 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
78116 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft) ) return 2;
80904 pExpr = pExpr->pLeft;
88243 Expr *pLeft; /* Value from parent table row */
88245 Expr *pEq; /* Expression (pLeft = pRight) */
88249 pLeft = sqlite3Expr(db, TK_REGISTER, 0);
88250 if( pLeft ){
88258 pLeft->iTable = regData+iCol+1;
88259 pLeft->affinity = pCol->affinity;
88260 pLeft->pColl = sqlite3LocateCollSeq(pParse, pCol->zColl);
88262 pLeft->iTable = regData;
88263 pLeft->affinity = SQLITE_AFF_INTEGER;
88270 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
88279 Expr *pEq; /* Expression (pLeft = pRight) */
88280 Expr *pLeft; /* Value from parent table row */
88282 pLeft = sqlite3Expr(db, TK_REGISTER, 0);
88284 if( pLeft && pRight ){
88285 pLeft->iTable = regData;
88286 pLeft->affinity = SQLITE_AFF_INTEGER;
88290 pEq = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
94807 setJoinExpr(p->pLeft, iTable);
94829 struct SrcList_item *pLeft; /* Left table being joined */
94833 pLeft = &pSrc->a[0];
94834 pRight = &pLeft[1];
94835 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
94836 Table *pLeftTab = pLeft->pTab;
97038 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
97047 pExpr->pLeft = substExpr(db, pExpr->pLeft, iTable, pEList);
97796 assert( pE->op!=TK_DOT || (pE->pLeft!=0 && pE->pLeft->op==TK_ID) );
97831 assert( pE->pLeft!=0 );
97832 assert( !ExprHasProperty(pE->pLeft, EP_IntValue) );
97833 zTName = pE->pLeft->u.zToken;
97882 Expr *pLeft;
97883 pLeft = sqlite3Expr(db, TK_ID, zTabName);
97884 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
102932 whereSplit(pWC, pExpr->pLeft, op);
102994 mask |= exprTableUsage(pMaskSet, p->pLeft);
103072 u16 expLeft = (pExpr->pLeft->flags & EP_ExpCollate);
103075 pExpr->pLeft->pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
103076 SWAP(CollSeq*,pExpr->pRight->pColl,pExpr->pLeft->pColl);
103078 pExpr->pLeft->flags = (pExpr->pLeft->flags & ~EP_ExpCollate) | expRight;
103079 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
103153 assert(pX->pLeft);
103154 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
103204 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
103220 pLeft = pList->a[1].pExpr;
103221 if( pLeft->op!=TK_COLUMN || sqlite3ExprAffinity(pLeft)!=SQLITE_AFF_TEXT ){
103226 assert( pLeft->iColumn!=(-1) ); /* Because IPK never has AFF_TEXT */
103579 affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft);
103598 Expr *pLeft = 0; /* The LHS of the IN operator */
103608 pLeft = pOrTerm->pExpr->pLeft;
103610 assert( pLeft!=0 );
103611 pDup = sqlite3ExprDup(db, pLeft, 0);
103660 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
103676 prereqLeft = exprTableUsage(pMaskSet, pExpr->pLeft);
103702 Expr *pLeft = pExpr->pLeft;
103704 if( pLeft->op==TK_COLUMN ){
103705 pTerm->leftCursor = pLeft->iTable;
103706 pTerm->u.leftColumn = pLeft->iColumn;
103731 pLeft = pDup->pLeft;
103732 pNew->leftCursor = pLeft->iTable;
103733 pNew->u.leftColumn = pLeft->iColumn;
103767 sqlite3ExprDup(db, pExpr->pLeft, 0),
103804 Expr *pLeft; /* LHS of LIKE/GLOB operator */
103812 pLeft = pExpr->x.pList->a[1].pExpr;
103834 sqlite3ExprSetColl(sqlite3ExprDup(db,pLeft,0), pColl),
103840 sqlite3ExprSetColl(sqlite3ExprDup(db,pLeft,0), pColl),
103863 Expr *pRight, *pLeft;
103868 pLeft = pExpr->x.pList->a[1].pExpr;
103870 prereqColumn = exprTableUsage(pMaskSet, pLeft);
103879 pNewTerm->leftCursor = pLeft->iTable;
103880 pNewTerm->u.leftColumn = pLeft->iColumn;
103903 && pExpr->pLeft->op==TK_COLUMN
103904 && pExpr->pLeft->iColumn>=0
103907 Expr *pLeft = pExpr->pLeft;
103912 sqlite3ExprDup(db, pLeft, 0),
103920 pNewTerm->leftCursor = pLeft->iTable;
103921 pNewTerm->u.leftColumn = pLeft->iColumn;
104034 CollSeq *p1 = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104623 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
106903 pAndExpr->pLeft = pOrExpr;
106937 pAndExpr->pLeft = 0;
107885 ExprSpan *pLeft, /* The left operand */
107888 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
107889 pOut->zStart = pLeft->zStart;
110219 Expr *pLeft = sqlite3PExpr(pParse, TK_ID, 0, 0, &yymsp[-2].minor.yy0);
110220 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
116765 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
116766 Fts3Expr *pLeft; /* Left operand */
120267 fts3EvalAllocateReaders(pCsr, pExpr->pLeft, pnToken, pnOr, pRc);
120306 char *pLeft;
120313 pLeft = p->doclist.aAll;
120321 pLeft = pList;
120326 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
120327 sqlite3_free(pLeft);
120679 fts3EvalStartReaders(pCsr, pExpr->pLeft, bOptOk, pRc);
120681 pExpr->bDeferred = (pExpr->pLeft->bDeferred && pExpr->pRight->bDeferred);
120741 assert( pExpr->pLeft && pExpr->pRight );
120743 pRoot = pExpr->pLeft;
120747 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pLeft, ppTC, ppOr, pRc);
121125 Fts3Expr *pLeft = pExpr->pLeft;
121127 assert( !pLeft->bDeferred || !pRight->bDeferred );
121129 if( pLeft->bDeferred ){
121138 fts3EvalNextRow(pCsr, pLeft, pRc);
121139 pExpr->iDocid = pLeft->iDocid;
121140 pExpr->bEof = pLeft->bEof;
121143 fts3EvalNextRow(pCsr, pLeft, pRc);
121145 while( !pLeft->bEof && !pRight->bEof && *pRc==SQLITE_OK ){
121146 sqlite3_int64 iDiff = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
121149 fts3EvalNextRow(pCsr, pLeft, pRc);
121154 pExpr->iDocid = pLeft->iDocid;
121155 pExpr->bEof = (pLeft->bEof || pRight->bEof);
121161 Fts3Expr *pLeft = pExpr->pLeft;
121163 sqlite3_int64 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
121165 assert( pLeft->bStart || pLeft->iDocid==pRight->iDocid );
121166 assert( pRight->bStart || pLeft->iDocid==pRight->iDocid );
121168 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
121169 fts3EvalNextRow(pCsr, pLeft, pRc);
121170 }else if( pLeft->bEof || (pRight->bEof==0 && iCmp>0) ){
121173 fts3EvalNextRow(pCsr, pLeft, pRc);
121177 pExpr->bEof = (pLeft->bEof && pRight->bEof);
121178 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
121179 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
121180 pExpr->iDocid = pLeft->iDocid;
121189 Fts3Expr *pLeft = pExpr->pLeft;
121197 fts3EvalNextRow(pCsr, pLeft, pRc);
121198 if( pLeft->bEof==0 ){
121201 && DOCID_CMP(pLeft->iDocid, pRight->iDocid)>0
121206 pExpr->iDocid = pLeft->iDocid;
121207 pExpr->bEof = pLeft->bEof;
121270 for(p=pExpr; p->pLeft; p=p->pLeft){
121290 for(p=pExpr->pLeft; p && res; p=p->pLeft){
121293 assert( p->pParent && p->pParent->pLeft==p );
121330 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
121355 for(p=pExpr; p->pPhrase==0; p=p->pLeft){
121368 int bHit1 = fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc);
121376 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
121513 fts3EvalRestart(pCsr, pExpr->pLeft, pRc);
121553 fts3EvalUpdateCounts(pExpr->pLeft);
121595 for(p=pRoot; p; p=p->pLeft){
122882 pNew->pLeft = pSplit;
122930 pNot->pLeft = pNotBranch;
122936 isPhrase = (eType==FTSQUERY_PHRASE || p->pLeft);
122984 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
123014 while( pIter->pLeft ){
123015 pIter = pIter->pLeft;
123017 pIter->pLeft = pRet;
123104 sqlite3Fts3ExprFree(p->pLeft);
123190 if( zBuf ) zBuf = exprToString(pExpr->pLeft, zBuf);
128758 pLeft && pExpr->pRight );
128759 rc = fts3ExprIterate2(pExpr->pLeft, piPhrase, x, pCtx);
132111 RtreeNode *pLeft,
132193 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
132213 RtreeNode *pLeft,
132233 nodeInsertCell(pRtree, pLeft, &aCell[iLeftSeed]);
132246 || (diff>0.0 && (RTREE_MINCELLS(pRtree)-NCELL(pLeft)!=i))
132251 nodeInsertCell(pRtree, pLeft, pNext);
132294 RtreeNode *pLeft = 0;
132301 ** all cells from node pLeft. Then zero the original node.
132319 pLeft = nodeNew(pRtree, pNode);
132324 pLeft = pNode;
132325 pRight = nodeNew(pRtree, pLeft->pParent);
132326 nodeReference(pLeft);
132329 if( !pLeft || !pRight ){
132334 memset(pLeft->zData, 0, pRtree->iNodeSize);
132337 rc = AssignCells(pRtree, aCell, nCell, pLeft, pRight, &leftbbox, &rightbbox);
132344 ** by nodeNew() above. But node pLeft sometimes already has a node number.
132348 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
132354 leftbbox.iRowid = pLeft->iNode;
132357 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
132362 RtreeNode *pParent = pLeft->pParent;
132364 rc = nodeParentIndex(pRtree, pLeft, &iCell);
132388 for(i=0; i<NCELL(pLeft); i++){
132389 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
132390 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
132396 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
132404 rc = nodeRelease(pRtree, pLeft);
132405 pLeft = 0;
132410 nodeRelease(pRtree, pLeft);
