Lines Matching refs:pRight
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
10561 Expr *pRight; /* Right subnode */
37973 struct RowSetEntry *pRight; /* Right subtree (larger entries) or list */
37996 struct RowSetEntry *pEntry; /* List of entries using pRight */
38076 pEntry->pRight = 0;
38082 pLast->pRight = pEntry;
38093 ** The input lists are connected via pRight pointers and are
38105 assert( pA->pRight==0 || pA->v<=pA->pRight->v );
38106 assert( pB->pRight==0 || pB->v<=pB->pRight->v );
38108 pTail->pRight = pA;
38109 pA = pA->pRight;
38110 pTail = pTail->pRight;
38112 pTail->pRight = pB;
38113 pB = pB->pRight;
38114 pTail = pTail->pRight;
38116 pA = pA->pRight;
38120 assert( pA->pRight==0 || pA->v<=pA->pRight->v );
38121 pTail->pRight = pA;
38123 assert( pB==0 || pB->pRight==0 || pB->v<=pB->pRight->v );
38124 pTail->pRight = pB;
38126 return head.pRight;
38141 p->pEntry = pEntry->pRight;
38142 pEntry->pRight = 0;
38161 ** Convert this tree into a linked list connected by the pRight pointers
38173 p->pRight = pIn;
38177 if( pIn->pRight ){
38178 rowSetTreeToList(pIn->pRight, &pIn->pRight, ppLast);
38182 assert( (*ppLast)->pRight==0 );
38187 ** Convert a sorted list of elements (connected by pRight) into a binary
38210 *ppList = p->pRight;
38211 p->pLeft = p->pRight = 0;
38220 *ppList = p->pRight;
38221 p->pRight = rowSetNDeepTree(ppList, iDepth-1);
38236 pList = p->pRight;
38237 p->pLeft = p->pRight = 0;
38241 pList = p->pRight;
38243 p->pRight = rowSetNDeepTree(&pList, iDepth);
38277 p->pEntry = p->pEntry->pRight;
38305 p = p->pRight;
55336 u8 *pRight; /* Location in parent of right-sibling pointer */
55392 pRight = &pParent->aData[pParent->hdrOffset+8];
55394 pRight = findCell(pParent, i+nxDiv-pParent->nOverflow);
55396 pgno = get4byte(pRight);
55709 put4byte(pRight, apNew[nNew-1]->pgno);
73112 if( sqlite3WalkExpr(pWalker, pExpr->pRight) ) return WRC_Abort;
73336 ** pExpr->pRight Any expression this points to is deleted.
73512 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
73591 sqlite3ExprDelete(db, pExpr->pRight);
73592 pExpr->pRight = 0;
73700 Expr *pRight;
73703 pRight = pExpr->pRight;
73704 if( pRight->op==TK_ID ){
73707 zColumn = pRight->u.zToken;
73709 assert( pRight->op==TK_DOT );
73711 zTable = pRight->pLeft->u.zToken;
73712 zColumn = pRight->pRight->u.zToken;
74592 if( pExpr->pRight ){
74593 aff = sqlite3CompareAffinity(pExpr->pRight, aff);
74632 ** a binary comparison operator comparing pLeft and pRight.
74639 ** Argument pRight (but not pLeft) may be a null pointer. In this case,
74645 Expr *pRight
74652 }else if( pRight && pRight->flags & EP_ExpCollate ){
74653 assert( pRight->pColl );
74654 pColl = pRight->pColl;
74658 pColl = sqlite3ExprCollSeq(pParse, pRight);
74670 Expr *pRight, /* The right operand */
74680 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
74681 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
74753 heightOfExpr(p->pRight, &nHeight);
74866 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
74869 ** In that case, delete the subtrees pLeft and pRight.
74875 Expr *pRight
74880 sqlite3ExprDelete(db, pRight);
74882 if( pRight ){
74883 pRoot->pRight = pRight;
74884 if( pRight->flags & EP_ExpCollate ){
74886 pRoot->pColl = pRight->pColl;
74911 Expr *pRight, /* Right operand */
74915 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
74926 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
74928 return pRight;
74929 }else if( pRight==0 ){
74933 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
75050 sqlite3ExprDelete(db, p->pRight);
75120 if( p->pLeft || p->pRight || p->pColl || p->x.pList ){
75152 ** and Expr.pRight variables (but not for any structures pointed to or
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. */
75240 pNew->pRight = exprDup(db, p->pRight, EXPRDUP_REDUCE, &zAlloc);
75249 pNew->pRight = sqlite3ExprDup(db, p->pRight, 0);
76855 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
76856 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
76867 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
76869 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
76910 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
77106 Expr *pRight = pLItem->pExpr;
77109 r2 = sqlite3ExprCodeTemp(pParse, pRight, ®Free2);
77114 codeCompare(pParse, pLeft, pRight, OP_Ge,
77117 pRight = pLItem->pExpr;
77119 r2 = sqlite3ExprCodeTemp(pParse, pRight, ®Free2);
77121 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
77198 ** Y is in pExpr->pRight. The Y is also optional. If there is no
77247 opCompare.pRight = aListelem[i].pExpr;
77261 if( pExpr->pRight ){
77263 sqlite3ExprCode(pParse, pExpr->pRight, target);
77602 sqlite3ExplainExpr(pOut, pExpr->pRight);
77828 exprAnd.pRight = &compRight;
77831 compLeft.pRight = pExpr->x.pList->a[0].pExpr;
77834 compRight.pRight = pExpr->x.pList->a[1].pExpr;
77886 sqlite3ExprIfTrue(pParse, pExpr->pRight, dest, jumpIfNull);
77894 sqlite3ExprIfTrue(pParse, pExpr->pRight, dest, jumpIfNull);
77922 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
77923 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
77934 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
77936 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78035 sqlite3ExprIfFalse(pParse, pExpr->pRight, dest, jumpIfNull);
78043 sqlite3ExprIfFalse(pParse, pExpr->pRight, dest, jumpIfNull);
78067 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
78068 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78079 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
78081 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78153 if( sqlite3ExprCompare(pA->pRight, pB->pRight) ) return 2;
80937 if( sqlite3FixExpr(pFix, pExpr->pRight) ){
88280 Expr *pRight; /* Column ref to child table */
88281 Expr *pEq; /* Expression (pLeft = pRight) */
88305 pRight = sqlite3Expr(db, TK_ID, zCol);
88306 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
88315 Expr *pEq; /* Expression (pLeft = pRight) */
88317 Expr *pRight; /* Column ref to child table */
88319 pRight = sqlite3Expr(db, TK_COLUMN, 0);
88320 if( pLeft && pRight ){
88323 pRight->iTable = pSrc->a[0].iCursor;
88324 pRight->iColumn = -1;
88326 pEq = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
94844 p = p->pRight;
94866 struct SrcList_item *pRight; /* Right table being joined */
94870 pRight = &pLeft[1];
94871 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
94873 Table *pRightTab = pRight->pTab;
94877 isOuter = (pRight->jointype & JT_OUTER)!=0;
94882 if( pRight->jointype & JT_NATURAL ){
94883 if( pRight->pOn || pRight->pUsing ){
94903 if( pRight->pOn && pRight->pUsing ){
94912 if( pRight->pOn ){
94913 if( isOuter ) setJoinExpr(pRight->pOn, pRight->iCursor);
94914 p->pWhere = sqlite3ExprAnd(pParse->db, p->pWhere, pRight->pOn);
94915 pRight->pOn = 0;
94925 if( pRight->pUsing ){
94926 IdList *pList = pRight->pUsing;
95805 assert( p->pRight==0 || ExprHasProperty(p->pRight, EP_IntValue)
95806 || p->pRight->u.zToken==0 || p->pRight->u.zToken[0]!=0 );
95814 pColExpr = pColExpr->pRight;
97074 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
97084 pExpr->pRight = substExpr(db, pExpr->pRight, iTable, pEList);
97831 assert( pE->op!=TK_DOT || pE->pRight!=0 );
97833 if( pE->op==TK_DOT && pE->pRight->op==TK_ALL ) break;
97849 assert( pE->op!=TK_DOT || pE->pRight!=0 );
97850 if( pE->op!=TK_ALL && (pE->op!=TK_DOT || pE->pRight->op!=TK_ALL) ){
97885 Expr *pExpr, *pRight;
97914 pRight = sqlite3Expr(db, TK_ID, zName);
97920 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
97926 pExpr = pRight;
98443 Select *pLoop, *pRight = 0;
98448 pLoop->pNext = pRight;
98449 pRight = pLoop;
102675 Bitmask prereqRight; /* Bitmask of tables used by pExpr->pRight */
102969 whereSplit(pWC, pExpr->pRight, op);
103029 mask = exprTableUsage(pMaskSet, p->pRight);
103107 u16 expRight = (pExpr->pRight->flags & EP_ExpCollate);
103110 pExpr->pRight->pColl = sqlite3ExprCollSeq(pParse, pExpr->pRight);
103112 SWAP(CollSeq*,pExpr->pRight->pColl,pExpr->pLeft->pColl);
103113 pExpr->pRight->flags = (pExpr->pRight->flags & ~EP_ExpCollate) | expLeft;
103115 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
103190 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
103240 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
103247 int op; /* Opcode of pRight */
103264 pRight = pList->a[0].pExpr;
103265 op = pRight->op;
103267 op = pRight->op2;
103271 int iCol = pRight->iColumn;
103277 assert( pRight->op==TK_VARIABLE || pRight->op==TK_REGISTER );
103279 z = pRight->u.zToken;
103294 sqlite3VdbeSetVarmask(v, pRight->iColumn);
103295 if( *pisComplete && pRight->u.zToken[1] ){
103303 sqlite3ExprCodeTarget(pParse, pRight, r1);
103614 affRight = sqlite3ExprAffinity(pOrTerm->pExpr->pRight);
103642 pDup = sqlite3ExprDup(db, pOrTerm->pExpr->pRight, 0);
103715 assert( pExpr->pRight==0 );
103724 pTerm->prereqRight = exprTableUsage(pMaskSet, pExpr->pRight);
103739 Expr *pRight = pExpr->pRight;
103745 if( pRight && pRight->op==TK_COLUMN ){
103899 Expr *pRight, *pLeft;
103903 pRight = pExpr->x.pList->a[0].pExpr;
103905 prereqExpr = exprTableUsage(pMaskSet, pRight);
103910 0, sqlite3ExprDup(db, pRight, 0), 0);
104070 CollSeq *p1 = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104659 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
105273 Expr *pExpr = pLower->pExpr->pRight;
105285 Expr *pExpr = pUpper->pExpr->pRight;
105724 whereEqualScanEst(pParse, pProbe, pFirstTerm->pExpr->pRight, &nRow);
106054 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
106192 Expr *pRight = pTerm->pExpr->pRight;
106193 sqlite3ExprCodeIsNullJump(v, pRight, regBase+j, pLevel->addrBrk);
106195 if( sqlite3CompareAffinity(pRight, zAff[j])==SQLITE_AFF_NONE ){
106198 if( sqlite3ExprNeedsNoAffinityChange(pRight, zAff[j]) ){
106443 sqlite3ExprCode(pParse, pWC->a[iTerm].pExpr->pRight, iReg+j+1);
106525 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
106541 sqlite3ExprCode(pParse, pX->pRight, memEndValue);
106694 Expr *pRight = pRangeStart->pExpr->pRight;
106695 sqlite3ExprCode(pParse, pRight, regBase+nEq);
106697 sqlite3ExprCodeIsNullJump(v, pRight, regBase+nEq, addrNxt);
106700 if( sqlite3CompareAffinity(pRight, zStartAff[nEq])==SQLITE_AFF_NONE){
106702 ** applied to the operands, set the affinity to apply to pRight to
106706 if( sqlite3ExprNeedsNoAffinityChange(pRight, zStartAff[nEq]) ){
106734 Expr *pRight = pRangeEnd->pExpr->pRight;
106736 sqlite3ExprCode(pParse, pRight, regBase+nEq);
106738 sqlite3ExprCodeIsNullJump(v, pRight, regBase+nEq, addrNxt);
106741 if( sqlite3CompareAffinity(pRight, zEndAff[nEq])==SQLITE_AFF_NONE){
106743 ** applied to the operands, set the affinity to apply to pRight to
106747 if( sqlite3ExprNeedsNoAffinityChange(pRight, zEndAff[nEq]) ){
107922 ExprSpan *pRight /* The right operand */
107924 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
107926 pOut->zEnd = pRight->zEnd;
107949 sqlite3ExprDelete(db, pA->pRight);
107950 pA->pRight = 0;
110254 Expr *pRight = sqlite3PExpr(pParse, TK_ALL, 0, 0, &yymsp[0].minor.yy0);
110256 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
110432 Select *pRight = sqlite3SelectNew(pParse, yymsp[-1].minor.yy442, 0, 0, 0, 0, 0, 0, 0, 0);
110438 if( yymsp[-4].minor.yy487.pSelect==0 || pRight==0 ){
110439 sqlite3SelectDelete(pParse->db, pRight);
110443 pRight->op = TK_ALL;
110444 pRight->pPrior = yymsp[-4].minor.yy487.pSelect;
110445 pRight->selFlags |= SF_Values;
110446 pRight->pPrior->selFlags |= SF_Values;
110447 yygotominor.yy487.pSelect = pRight;
116801 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
116803 Fts3Expr *pRight; /* Right operand */
120314 fts3EvalAllocateReaders(pCsr, pExpr->pRight, pnToken, pnOr, pRc);
120353 char *pRight;
120361 pRight = pList;
120365 pRight = p->doclist.aAll;
120372 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
120374 p->doclist.aAll = pRight;
120726 fts3EvalStartReaders(pCsr, pExpr->pRight, bOptOk, pRc);
120727 pExpr->bDeferred = (pExpr->pLeft->bDeferred && pExpr->pRight->bDeferred);
120787 assert( pExpr->pLeft && pExpr->pRight );
120795 pRoot = pExpr->pRight;
120799 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pRight, ppTC, ppOr, pRc);
121172 Fts3Expr *pRight = pExpr->pRight;
121173 assert( !pLeft->bDeferred || !pRight->bDeferred );
121178 fts3EvalNextRow(pCsr, pRight, pRc);
121179 pExpr->iDocid = pRight->iDocid;
121180 pExpr->bEof = pRight->bEof;
121181 }else if( pRight->bDeferred ){
121190 fts3EvalNextRow(pCsr, pRight, pRc);
121191 while( !pLeft->bEof && !pRight->bEof && *pRc==SQLITE_OK ){
121192 sqlite3_int64 iDiff = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
121197 fts3EvalNextRow(pCsr, pRight, pRc);
121201 pExpr->bEof = (pLeft->bEof || pRight->bEof);
121208 Fts3Expr *pRight = pExpr->pRight;
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) ){
121216 }else if( pLeft->bEof || (pRight->bEof==0 && iCmp>0) ){
121217 fts3EvalNextRow(pCsr, pRight, pRc);
121220 fts3EvalNextRow(pCsr, pRight, 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) ){
121228 pExpr->iDocid = pRight->iDocid;
121236 Fts3Expr *pRight = pExpr->pRight;
121238 if( pRight->bStart==0 ){
121239 fts3EvalNextRow(pCsr, pRight, pRc);
121240 assert( *pRc!=SQLITE_OK || pRight->bStart );
121246 && !pRight->bEof
121247 && DOCID_CMP(pLeft->iDocid, pRight->iDocid)>0
121249 fts3EvalNextRow(pCsr, pRight, pRc);
121317 nTmp += p->pRight->pPhrase->doclist.nList;
121329 Fts3Phrase *pPhrase = p->pRight->pPhrase;
121334 aPoslist = pExpr->pRight->pPhrase->doclist.pList;
121335 nToken = pExpr->pRight->pPhrase->nToken;
121342 p->eType==FTSQUERY_NEAR ? p->pRight->pPhrase : p->pPhrase
121377 && fts3EvalTestExpr(pCsr, pExpr->pRight, pRc)
121402 if( p->pRight->iDocid==pCsr->iPrevId ){
121403 fts3EvalInvalidatePoslist(p->pRight->pPhrase);
121415 int bHit2 = fts3EvalTestExpr(pCsr, pExpr->pRight, pRc);
121423 && !fts3EvalTestExpr(pCsr, pExpr->pRight, pRc)
121560 fts3EvalRestart(pCsr, pExpr->pRight, pRc);
121600 fts3EvalUpdateCounts(pExpr->pRight);
121642 Fts3Expr *pE = (p->eType==FTSQUERY_PHRASE?p:p->pRight);
122922 assert( pSplit->pParent->pRight==pSplit );
122923 pSplit->pParent->pRight = pNew;
122974 pNot->pRight = p;
123030 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
123031 pPrev->pRight = p;
123151 sqlite3Fts3ExprFree(p->pRight);
123239 if( zBuf ) zBuf = exprToString(pExpr->pRight, zBuf);
125294 SegmentNode *pRight; /* Pointer to right-sibling */
127035 pTree->pRight = pNew;
127101 for(pIter=pTree->pLeftmost; pIter && rc==SQLITE_OK; pIter=pIter->pRight){
127128 SegmentNode *pRight = p->pRight;
127132 assert( pRight==0 || p->zMalloc==0 );
127135 p = pRight;
128804 assert( pExpr->pLeft && pExpr->pRight );
128807 rc = fts3ExprIterate2(pExpr->pRight, piPhrase, x, pCtx);
132158 RtreeNode *pRight,
132239 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
132260 RtreeNode *pRight,
132280 nodeInsertCell(pRtree, pRight, &aCell[iRightSeed]);
132291 if( (RTREE_MINCELLS(pRtree)-NCELL(pRight)==i)
132294 nodeInsertCell(pRtree, pRight, pNext);
132341 RtreeNode *pRight = 0;
132364 pRight = nodeNew(pRtree, pNode);
132371 pRight = nodeNew(pRtree, pLeft->pParent);
132375 if( !pLeft || !pRight ){
132381 memset(pRight->zData, 0, pRtree->iNodeSize);
132383 rc = AssignCells(pRtree, aCell, nCell, pLeft, pRight, &leftbbox, &rightbbox);
132389 ** nodeWrite(). Node pRight always needs a node number, as it was created
132393 if( SQLITE_OK!=(rc = nodeWrite(pRtree, pRight))
132399 rightbbox.iRowid = pRight->iNode;
132419 if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){
132423 for(i=0; i<NCELL(pRight); i++){
132424 i64 iRowid = nodeGetRowid(pRtree, pRight, i);
132425 rc = updateMapping(pRtree, iRowid, pRight, iHeight);
132446 rc = nodeRelease(pRtree, pRight);
132447 pRight = 0;
132455 nodeRelease(pRtree, pRight);