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 */
37945 struct RowSetEntry *pRight; /* Right subtree (larger entries) or list */
37968 struct RowSetEntry *pEntry; /* List of entries using pRight */
38048 pEntry->pRight = 0;
38054 pLast->pRight = pEntry;
38065 ** The input lists are connected via pRight pointers and are
38077 assert( pA->pRight==0 || pA->v<=pA->pRight->v );
38078 assert( pB->pRight==0 || pB->v<=pB->pRight->v );
38080 pTail->pRight = pA;
38081 pA = pA->pRight;
38082 pTail = pTail->pRight;
38084 pTail->pRight = pB;
38085 pB = pB->pRight;
38086 pTail = pTail->pRight;
38088 pA = pA->pRight;
38092 assert( pA->pRight==0 || pA->v<=pA->pRight->v );
38093 pTail->pRight = pA;
38095 assert( pB==0 || pB->pRight==0 || pB->v<=pB->pRight->v );
38096 pTail->pRight = pB;
38098 return head.pRight;
38113 p->pEntry = pEntry->pRight;
38114 pEntry->pRight = 0;
38133 ** Convert this tree into a linked list connected by the pRight pointers
38145 p->pRight = pIn;
38149 if( pIn->pRight ){
38150 rowSetTreeToList(pIn->pRight, &pIn->pRight, ppLast);
38154 assert( (*ppLast)->pRight==0 );
38159 ** Convert a sorted list of elements (connected by pRight) into a binary
38182 *ppList = p->pRight;
38183 p->pLeft = p->pRight = 0;
38192 *ppList = p->pRight;
38193 p->pRight = rowSetNDeepTree(ppList, iDepth-1);
38208 pList = p->pRight;
38209 p->pLeft = p->pRight = 0;
38213 pList = p->pRight;
38215 p->pRight = rowSetNDeepTree(&pList, iDepth);
38249 p->pEntry = p->pEntry->pRight;
38277 p = p->pRight;
55308 u8 *pRight; /* Location in parent of right-sibling pointer */
55364 pRight = &pParent->aData[pParent->hdrOffset+8];
55366 pRight = findCell(pParent, i+nxDiv-pParent->nOverflow);
55368 pgno = get4byte(pRight);
55681 put4byte(pRight, apNew[nNew-1]->pgno);
73076 if( sqlite3WalkExpr(pWalker, pExpr->pRight) ) return WRC_Abort;
73300 ** pExpr->pRight Any expression this points to is deleted.
73476 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
73555 sqlite3ExprDelete(db, pExpr->pRight);
73556 pExpr->pRight = 0;
73664 Expr *pRight;
73667 pRight = pExpr->pRight;
73668 if( pRight->op==TK_ID ){
73671 zColumn = pRight->u.zToken;
73673 assert( pRight->op==TK_DOT );
73675 zTable = pRight->pLeft->u.zToken;
73676 zColumn = pRight->pRight->u.zToken;
74556 if( pExpr->pRight ){
74557 aff = sqlite3CompareAffinity(pExpr->pRight, aff);
74596 ** a binary comparison operator comparing pLeft and pRight.
74603 ** Argument pRight (but not pLeft) may be a null pointer. In this case,
74609 Expr *pRight
74616 }else if( pRight && pRight->flags & EP_ExpCollate ){
74617 assert( pRight->pColl );
74618 pColl = pRight->pColl;
74622 pColl = sqlite3ExprCollSeq(pParse, pRight);
74634 Expr *pRight, /* The right operand */
74644 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
74645 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
74717 heightOfExpr(p->pRight, &nHeight);
74830 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
74833 ** In that case, delete the subtrees pLeft and pRight.
74839 Expr *pRight
74844 sqlite3ExprDelete(db, pRight);
74846 if( pRight ){
74847 pRoot->pRight = pRight;
74848 if( pRight->flags & EP_ExpCollate ){
74850 pRoot->pColl = pRight->pColl;
74875 Expr *pRight, /* Right operand */
74879 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
74890 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
74892 return pRight;
74893 }else if( pRight==0 ){
74897 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
75014 sqlite3ExprDelete(db, p->pRight);
75084 if( p->pLeft || p->pRight || p->pColl || p->x.pList ){
75116 ** and Expr.pRight variables (but not for any structures pointed to or
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. */
75204 pNew->pRight = exprDup(db, p->pRight, EXPRDUP_REDUCE, &zAlloc);
75213 pNew->pRight = sqlite3ExprDup(db, p->pRight, 0);
76819 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
76820 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
76831 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
76833 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
76874 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
77070 Expr *pRight = pLItem->pExpr;
77073 r2 = sqlite3ExprCodeTemp(pParse, pRight, ®Free2);
77078 codeCompare(pParse, pLeft, pRight, OP_Ge,
77081 pRight = pLItem->pExpr;
77083 r2 = sqlite3ExprCodeTemp(pParse, pRight, ®Free2);
77085 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
77162 ** Y is in pExpr->pRight. The Y is also optional. If there is no
77211 opCompare.pRight = aListelem[i].pExpr;
77225 if( pExpr->pRight ){
77227 sqlite3ExprCode(pParse, pExpr->pRight, target);
77566 sqlite3ExplainExpr(pOut, pExpr->pRight);
77792 exprAnd.pRight = &compRight;
77795 compLeft.pRight = pExpr->x.pList->a[0].pExpr;
77798 compRight.pRight = pExpr->x.pList->a[1].pExpr;
77850 sqlite3ExprIfTrue(pParse, pExpr->pRight, dest, jumpIfNull);
77858 sqlite3ExprIfTrue(pParse, pExpr->pRight, dest, jumpIfNull);
77886 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
77887 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
77898 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
77900 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
77999 sqlite3ExprIfFalse(pParse, pExpr->pRight, dest, jumpIfNull);
78007 sqlite3ExprIfFalse(pParse, pExpr->pRight, dest, jumpIfNull);
78031 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
78032 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78043 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pRight, ®Free2);
78045 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
78117 if( sqlite3ExprCompare(pA->pRight, pB->pRight) ) return 2;
80901 if( sqlite3FixExpr(pFix, pExpr->pRight) ){
88244 Expr *pRight; /* Column ref to child table */
88245 Expr *pEq; /* Expression (pLeft = pRight) */
88269 pRight = sqlite3Expr(db, TK_ID, zCol);
88270 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
88279 Expr *pEq; /* Expression (pLeft = pRight) */
88281 Expr *pRight; /* Column ref to child table */
88283 pRight = sqlite3Expr(db, TK_COLUMN, 0);
88284 if( pLeft && pRight ){
88287 pRight->iTable = pSrc->a[0].iCursor;
88288 pRight->iColumn = -1;
88290 pEq = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
94808 p = p->pRight;
94830 struct SrcList_item *pRight; /* Right table being joined */
94834 pRight = &pLeft[1];
94835 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
94837 Table *pRightTab = pRight->pTab;
94841 isOuter = (pRight->jointype & JT_OUTER)!=0;
94846 if( pRight->jointype & JT_NATURAL ){
94847 if( pRight->pOn || pRight->pUsing ){
94867 if( pRight->pOn && pRight->pUsing ){
94876 if( pRight->pOn ){
94877 if( isOuter ) setJoinExpr(pRight->pOn, pRight->iCursor);
94878 p->pWhere = sqlite3ExprAnd(pParse->db, p->pWhere, pRight->pOn);
94879 pRight->pOn = 0;
94889 if( pRight->pUsing ){
94890 IdList *pList = pRight->pUsing;
95769 assert( p->pRight==0 || ExprHasProperty(p->pRight, EP_IntValue)
95770 || p->pRight->u.zToken==0 || p->pRight->u.zToken[0]!=0 );
95778 pColExpr = pColExpr->pRight;
97038 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
97048 pExpr->pRight = substExpr(db, pExpr->pRight, iTable, pEList);
97795 assert( pE->op!=TK_DOT || pE->pRight!=0 );
97797 if( pE->op==TK_DOT && pE->pRight->op==TK_ALL ) break;
97813 assert( pE->op!=TK_DOT || pE->pRight!=0 );
97814 if( pE->op!=TK_ALL && (pE->op!=TK_DOT || pE->pRight->op!=TK_ALL) ){
97849 Expr *pExpr, *pRight;
97878 pRight = sqlite3Expr(db, TK_ID, zName);
97884 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
97890 pExpr = pRight;
98407 Select *pLoop, *pRight = 0;
98412 pLoop->pNext = pRight;
98413 pRight = pLoop;
102639 Bitmask prereqRight; /* Bitmask of tables used by pExpr->pRight */
102933 whereSplit(pWC, pExpr->pRight, op);
102993 mask = exprTableUsage(pMaskSet, p->pRight);
103071 u16 expRight = (pExpr->pRight->flags & EP_ExpCollate);
103074 pExpr->pRight->pColl = sqlite3ExprCollSeq(pParse, pExpr->pRight);
103076 SWAP(CollSeq*,pExpr->pRight->pColl,pExpr->pLeft->pColl);
103077 pExpr->pRight->flags = (pExpr->pRight->flags & ~EP_ExpCollate) | expLeft;
103079 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
103154 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
103204 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
103211 int op; /* Opcode of pRight */
103228 pRight = pList->a[0].pExpr;
103229 op = pRight->op;
103231 op = pRight->op2;
103235 int iCol = pRight->iColumn;
103241 assert( pRight->op==TK_VARIABLE || pRight->op==TK_REGISTER );
103243 z = pRight->u.zToken;
103258 sqlite3VdbeSetVarmask(v, pRight->iColumn);
103259 if( *pisComplete && pRight->u.zToken[1] ){
103267 sqlite3ExprCodeTarget(pParse, pRight, r1);
103578 affRight = sqlite3ExprAffinity(pOrTerm->pExpr->pRight);
103606 pDup = sqlite3ExprDup(db, pOrTerm->pExpr->pRight, 0);
103679 assert( pExpr->pRight==0 );
103688 pTerm->prereqRight = exprTableUsage(pMaskSet, pExpr->pRight);
103703 Expr *pRight = pExpr->pRight;
103709 if( pRight && pRight->op==TK_COLUMN ){
103863 Expr *pRight, *pLeft;
103867 pRight = pExpr->x.pList->a[0].pExpr;
103869 prereqExpr = exprTableUsage(pMaskSet, pRight);
103874 0, sqlite3ExprDup(db, pRight, 0), 0);
104034 CollSeq *p1 = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
104623 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
105237 Expr *pExpr = pLower->pExpr->pRight;
105249 Expr *pExpr = pUpper->pExpr->pRight;
105688 whereEqualScanEst(pParse, pProbe, pFirstTerm->pExpr->pRight, &nRow);
106018 iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget);
106156 Expr *pRight = pTerm->pExpr->pRight;
106157 sqlite3ExprCodeIsNullJump(v, pRight, regBase+j, pLevel->addrBrk);
106159 if( sqlite3CompareAffinity(pRight, zAff[j])==SQLITE_AFF_NONE ){
106162 if( sqlite3ExprNeedsNoAffinityChange(pRight, zAff[j]) ){
106407 sqlite3ExprCode(pParse, pWC->a[iTerm].pExpr->pRight, iReg+j+1);
106489 r1 = sqlite3ExprCodeTemp(pParse, pX->pRight, &rTemp);
106505 sqlite3ExprCode(pParse, pX->pRight, memEndValue);
106658 Expr *pRight = pRangeStart->pExpr->pRight;
106659 sqlite3ExprCode(pParse, pRight, regBase+nEq);
106661 sqlite3ExprCodeIsNullJump(v, pRight, regBase+nEq, addrNxt);
106664 if( sqlite3CompareAffinity(pRight, zStartAff[nEq])==SQLITE_AFF_NONE){
106666 ** applied to the operands, set the affinity to apply to pRight to
106670 if( sqlite3ExprNeedsNoAffinityChange(pRight, zStartAff[nEq]) ){
106698 Expr *pRight = pRangeEnd->pExpr->pRight;
106700 sqlite3ExprCode(pParse, pRight, regBase+nEq);
106702 sqlite3ExprCodeIsNullJump(v, pRight, regBase+nEq, addrNxt);
106705 if( sqlite3CompareAffinity(pRight, zEndAff[nEq])==SQLITE_AFF_NONE){
106707 ** applied to the operands, set the affinity to apply to pRight to
106711 if( sqlite3ExprNeedsNoAffinityChange(pRight, zEndAff[nEq]) ){
107886 ExprSpan *pRight /* The right operand */
107888 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
107890 pOut->zEnd = pRight->zEnd;
107913 sqlite3ExprDelete(db, pA->pRight);
107914 pA->pRight = 0;
110218 Expr *pRight = sqlite3PExpr(pParse, TK_ALL, 0, 0, &yymsp[0].minor.yy0);
110220 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
110396 Select *pRight = sqlite3SelectNew(pParse, yymsp[-1].minor.yy442, 0, 0, 0, 0, 0, 0, 0, 0);
110402 if( yymsp[-4].minor.yy487.pSelect==0 || pRight==0 ){
110403 sqlite3SelectDelete(pParse->db, pRight);
110407 pRight->op = TK_ALL;
110408 pRight->pPrior = yymsp[-4].minor.yy487.pSelect;
110409 pRight->selFlags |= SF_Values;
110410 pRight->pPrior->selFlags |= SF_Values;
110411 yygotominor.yy487.pSelect = pRight;
116765 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
116767 Fts3Expr *pRight; /* Right operand */
120268 fts3EvalAllocateReaders(pCsr, pExpr->pRight, pnToken, pnOr, pRc);
120307 char *pRight;
120315 pRight = pList;
120319 pRight = p->doclist.aAll;
120326 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
120328 p->doclist.aAll = pRight;
120680 fts3EvalStartReaders(pCsr, pExpr->pRight, bOptOk, pRc);
120681 pExpr->bDeferred = (pExpr->pLeft->bDeferred && pExpr->pRight->bDeferred);
120741 assert( pExpr->pLeft && pExpr->pRight );
120749 pRoot = pExpr->pRight;
120753 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pRight, ppTC, ppOr, pRc);
121126 Fts3Expr *pRight = pExpr->pRight;
121127 assert( !pLeft->bDeferred || !pRight->bDeferred );
121132 fts3EvalNextRow(pCsr, pRight, pRc);
121133 pExpr->iDocid = pRight->iDocid;
121134 pExpr->bEof = pRight->bEof;
121135 }else if( pRight->bDeferred ){
121144 fts3EvalNextRow(pCsr, pRight, pRc);
121145 while( !pLeft->bEof && !pRight->bEof && *pRc==SQLITE_OK ){
121146 sqlite3_int64 iDiff = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
121151 fts3EvalNextRow(pCsr, pRight, pRc);
121155 pExpr->bEof = (pLeft->bEof || pRight->bEof);
121162 Fts3Expr *pRight = pExpr->pRight;
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) ){
121170 }else if( pLeft->bEof || (pRight->bEof==0 && iCmp>0) ){
121171 fts3EvalNextRow(pCsr, pRight, pRc);
121174 fts3EvalNextRow(pCsr, pRight, 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) ){
121182 pExpr->iDocid = pRight->iDocid;
121190 Fts3Expr *pRight = pExpr->pRight;
121192 if( pRight->bStart==0 ){
121193 fts3EvalNextRow(pCsr, pRight, pRc);
121194 assert( *pRc!=SQLITE_OK || pRight->bStart );
121200 && !pRight->bEof
121201 && DOCID_CMP(pLeft->iDocid, pRight->iDocid)>0
121203 fts3EvalNextRow(pCsr, pRight, pRc);
121271 nTmp += p->pRight->pPhrase->doclist.nList;
121283 Fts3Phrase *pPhrase = p->pRight->pPhrase;
121288 aPoslist = pExpr->pRight->pPhrase->doclist.pList;
121289 nToken = pExpr->pRight->pPhrase->nToken;
121296 p->eType==FTSQUERY_NEAR ? p->pRight->pPhrase : p->pPhrase
121331 && fts3EvalTestExpr(pCsr, pExpr->pRight, pRc)
121356 if( p->pRight->iDocid==pCsr->iPrevId ){
121357 fts3EvalInvalidatePoslist(p->pRight->pPhrase);
121369 int bHit2 = fts3EvalTestExpr(pCsr, pExpr->pRight, pRc);
121377 && !fts3EvalTestExpr(pCsr, pExpr->pRight, pRc)
121514 fts3EvalRestart(pCsr, pExpr->pRight, pRc);
121554 pRight);
121596 Fts3Expr *pE = (p->eType==FTSQUERY_PHRASE?p:p->pRight);
122876 assert( pSplit->pParent->pRight==pSplit );
122877 pSplit->pParent->pRight = pNew;
122928 pNot->pRight = p;
122984 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
122985 pPrev->pRight = p;
123105 sqlite3Fts3ExprFree(p->pRight);
123193 if( zBuf ) zBuf = exprToString(pExpr->pRight, zBuf);
125248 SegmentNode *pRight; /* Pointer to right-sibling */
126989 pTree->pRight = pNew;
127055 for(pIter=pTree->pLeftmost; pIter && rc==SQLITE_OK; pIter=pIter->pRight){
127082 SegmentNode *pRight = p->pRight;
127086 assert( pRight==0 || p->zMalloc==0 );
127089 p = pRight;
128758 pRight );
128761 rc = fts3ExprIterate2(pExpr->pRight, piPhrase, x, pCtx);
132112 RtreeNode *pRight,
132193 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
132214 RtreeNode *pRight,
132234 nodeInsertCell(pRtree, pRight, &aCell[iRightSeed]);
132245 if( (RTREE_MINCELLS(pRtree)-NCELL(pRight)==i)
132248 nodeInsertCell(pRtree, pRight, pNext);
132295 RtreeNode *pRight = 0;
132318 pRight = nodeNew(pRtree, pNode);
132325 pRight = nodeNew(pRtree, pLeft->pParent);
132329 if( !pLeft || !pRight ){
132335 memset(pRight->zData, 0, pRtree->iNodeSize);
132337 rc = AssignCells(pRtree, aCell, nCell, pLeft, pRight, &leftbbox, &rightbbox);
132343 ** nodeWrite(). Node pRight always needs a node number, as it was created
132347 if( SQLITE_OK!=(rc = nodeWrite(pRtree, pRight))
132353 rightbbox.iRowid = pRight->iNode;
132373 if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){
132377 for(i=0; i<NCELL(pRight); i++){
132378 i64 iRowid = nodeGetRowid(pRtree, pRight, i);
132379 rc = updateMapping(pRtree, iRowid, pRight, iHeight);
132400 rc = nodeRelease(pRtree, pRight);
132401 pRight = 0;
132409 nodeRelease(pRtree, pRight);
