Lines Matching defs:pLeft
11302 ** Expr.pRight and Expr.pLeft are the left and right subexpressions of a
11344 ** the child Expr objects in the Expr.pLeft and Expr.pRight subtrees
11363 Expr *pLeft; /* Left subnode */
11443 #define EXPR_TOKENONLYSIZE offsetof(Expr,pLeft) /* Fewer features */
39678 ** in the list, pLeft points to the tree, and v is unused. The
39684 struct RowSetEntry *pLeft; /* Left subtree (smaller entries) */
39899 if( pIn->pLeft ){
39901 rowSetTreeToList(pIn->pLeft, ppFirst, &p);
39933 struct RowSetEntry *pLeft; /* Left subtree */
39940 p->pLeft = p->pRight = 0;
39943 pLeft = rowSetNDeepTree(ppList, iDepth-1);
39946 return pLeft;
39948 p->pLeft = pLeft;
39961 struct RowSetEntry *pLeft; /* Left subtree */
39966 p->pLeft = p->pRight = 0;
39968 pLeft = p;
39971 p->pLeft = pLeft;
39999 struct RowSetEntry *pTree = p->pForest->pLeft;
40063 if( pTree->pLeft==0 ){
40064 pTree->pLeft = rowSetListToTree(p);
40068 rowSetTreeToList(pTree->pLeft, &pAux, &pTail);
40069 pTree->pLeft = 0;
40078 pTree->pLeft = rowSetListToTree(p);
40092 p = pTree->pLeft;
40097 p = p->pLeft;
61822 && (pExpr->pLeft->op==TK_INTEGER || pExpr->pLeft->op==TK_FLOAT) ){
61823 pExpr = pExpr->pLeft;
61850 if( SQLITE_OK==sqlite3ValueFromExpr(db,pExpr->pLeft,enc,affinity,&pVal)
76658 if( sqlite3WalkExpr(pWalker, pExpr->pLeft) ) return WRC_Abort;
76966 ** pExpr->pLeft Any expression this points to is deleted
77185 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
77263 sqlite3ExprDelete(db, pExpr->pLeft);
77264 pExpr->pLeft = 0;
77428 zTable = pExpr->pLeft->u.zToken;
77432 zDb = pExpr->pLeft->u.zToken;
77433 zTable = pRight->pLeft->u.zToken;
77750 assert( pItem->pExpr->pLeft==pE );
77751 pItem->pExpr->pLeft = pNew;
78303 pNew->pLeft = pExpr;
78331 pExpr = pExpr->pLeft;
78354 p = p->pLeft;
78375 if( ALWAYS(p->pLeft) && (p->pLeft->flags & EP_Collate)!=0 ){
78376 p = p->pLeft;
78427 assert( pExpr->pLeft );
78428 aff = sqlite3ExprAffinity(pExpr->pLeft);
78469 ** a binary comparison operator comparing pLeft and pRight.
78476 ** Argument pRight (but not pLeft) may be a null pointer. In this case,
78481 Expr *pLeft,
78485 assert( pLeft );
78486 if( pLeft->flags & EP_Collate ){
78487 pColl = sqlite3ExprCollSeq(pParse, pLeft);
78491 pColl = sqlite3ExprCollSeq(pParse, pLeft);
78504 Expr *pLeft, /* The left operand */
78515 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
78516 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
78587 heightOfExpr(p->pLeft, &nHeight);
78701 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
78704 ** In that case, delete the subtrees pLeft and pRight.
78709 Expr *pLeft,
78714 sqlite3ExprDelete(db, pLeft);
78721 if( pLeft ){
78722 pRoot->pLeft = pLeft;
78723 pRoot->flags |= EP_Collate & pLeft->flags;
78739 Expr *pLeft, /* Left operand */
78744 if( op==TK_AND && pLeft && pRight ){
78746 p = sqlite3ExprAnd(pParse->db, pLeft, pRight);
78749 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
78792 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
78793 if( pLeft==0 ){
78796 return pLeft;
78797 }else if( exprAlwaysFalse(pLeft) || exprAlwaysFalse(pRight) ){
78798 sqlite3ExprDelete(db, pLeft);
78803 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
78921 sqlite3ExprDelete(db, p->pLeft);
78992 if( p->pLeft || p->x.pList ){
79024 ** space to duplicate all Expr nodes in the tree formed by Expr.pLeft
79033 nByte += dupedExprSize(p->pLeft, flags) + dupedExprSize(p->pRight, flags);
79043 ** (if applicable), and the copies of the p->pLeft and p->pRight expressions,
79108 /* Fill in pNew->pLeft and pNew->pRight. */
79112 pNew->pLeft = exprDup(db, p->pLeft, EXPRDUP_REDUCE, &zAlloc);
79120 pNew->pLeft = sqlite3ExprDup(db, p->pLeft, 0);
79555 rc = sqlite3ExprIsInteger(p->pLeft, pValue);
79560 if( sqlite3ExprIsInteger(p->pLeft, &v) ){
79588 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
79618 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
79733 pLHS = pIn->pLeft;
79734 pIn->pLeft = 0;
79736 pIn->pLeft = pLHS;
79866 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
79921 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
80004 Expr *pLeft = pExpr->pLeft; /* the LHS of the IN operator */
80007 affinity = sqlite3ExprAffinity(pLeft);
80053 pKeyInfo->aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft,
80073 pKeyInfo->aColl[0] = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
80224 sqlite3ExprCode(pParse, pExpr->pLeft, r1);
80232 CollSeq *pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
80272 if( sqlite3ExprCanBeNull(pExpr->pLeft) ){
80818 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
80823 /* Expressions of the form: CAST(pLeft AS token) */
80825 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
80855 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
80857 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
80873 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
80876 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
80907 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
80915 Expr *pLeft = pExpr->pLeft;
80916 assert( pLeft );
80917 if( pLeft->op==TK_INTEGER ){
80918 codeInteger(pParse, pLeft, 1, target);
80920 }else if( pLeft->op==TK_FLOAT ){
80922 codeReal(v, pLeft->u.zToken, 1, target);
80929 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free2);
80940 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
80952 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
81130 ** X is stored in pExpr->pLeft.
81135 Expr *pLeft = pExpr->pLeft;
81139 r1 = sqlite3ExprCodeTemp(pParse, pLeft, ®Free1);
81145 codeCompare(pParse, pLeft, pRight, OP_Ge,
81152 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
81161 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
81230 ** X (if it exists) is in pExpr->pLeft.
81258 if( (pX = pExpr->pLeft)!=0 ){
81264 opCompare.pLeft = &tempX;
81528 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81533 /* Expressions of the form: CAST(pLeft AS token) */
81543 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81577 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81617 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81636 ** X is stored in pExpr->pLeft.
81641 Expr *pX = pExpr->pLeft;
81667 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81688 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81694 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81809 exprX = *pExpr->pLeft;
81811 exprAnd.pLeft = &compLeft;
81814 compLeft.pLeft = &exprX;
81817 compRight.pLeft = &exprX;
81867 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2,jumpIfNull^SQLITE_JUMPIFNULL);
81876 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
81884 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
81894 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
81896 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
81912 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
81915 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
81927 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
82022 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
82031 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, jumpIfNull^SQLITE_JUMPIFNULL);
82040 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
82050 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
82052 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
82068 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
82071 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
82081 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
82159 if( pA->op==TK_COLLATE && sqlite3ExprCompare(pA->pLeft, pB, iTab)<2 ){
82162 if( pB->op==TK_COLLATE && sqlite3ExprCompare(pA, pB->pLeft, iTab)<2 ){
82175 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft, iTab) ) return 2;
82241 && (sqlite3ExprImpliesExpr(pE1, pE2->pLeft, iTab)
82247 && sqlite3ExprCompare(pE1->pLeft, pE2->pLeft, iTab)==0
85799 pExpr = pExpr->pLeft;
93990 Expr *pLeft; /* Value from parent table row */
93992 Expr *pEq; /* Expression (pLeft = pRight) */
93997 pLeft = exprTableRegister(pParse, pTab, regData, iCol);
94002 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
94018 Expr *pNe; /* Expression (pLeft != pRight) */
94019 Expr *pLeft; /* Value from parent table row */
94022 pLeft = exprTableRegister(pParse, pTab, regData, -1);
94024 pNe = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
94031 pLeft = exprTableRegister(pParse, pTab, regData, iCol);
94033 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
101791 setJoinExpr(p->pLeft, iTable);
101813 struct SrcList_item *pLeft; /* Left table being joined */
101817 pLeft = &pSrc->a[0];
101818 pRight = &pLeft[1];
101819 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
101820 Table *pLeftTab = pLeft->pTab;
104442 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
104448 pExpr->pLeft = substExpr(db, pExpr->pLeft, iTable, pEList);
105256 Select *pLeft; /* Left-most SELECT statement */
105315 for(pLeft=pSel; pLeft->pPrior; pLeft=pLeft->pPrior);
105316 pEList = pLeft->pEList;
105503 assert( pE->op!=TK_DOT || (pE->pLeft!=0 && pE->pLeft->op==TK_ID) );
105546 assert( pE->pLeft!=0 );
105547 assert( !ExprHasProperty(pE->pLeft, EP_IntValue) );
105548 zTName = pE->pLeft->u.zToken;
105609 Expr *pLeft;
105610 pLeft = sqlite3Expr(db, TK_ID, zTabName);
105611 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
105613 pLeft = sqlite3Expr(db, TK_ID, zSchemaName);
105614 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pExpr, 0);
111156 whereSplit(pWC, pExpr->pLeft, op);
111209 mask |= exprTableUsage(pMaskSet, p->pLeft);
111280 u16 expLeft = (pExpr->pLeft->flags & EP_Collate);
111288 }else if( sqlite3ExprCollSeq(pParse, pExpr->pLeft)!=0 ){
111292 pExpr->pLeft->flags |= EP_Collate;
111295 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
111379 assert(pX->pLeft);
111381 pX->pLeft, pX->pRight);
111538 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
111554 pLeft = pList->a[1].pExpr;
111555 if( pLeft->op!=TK_COLUMN
111556 || sqlite3ExprAffinity(pLeft)!=SQLITE_AFF_TEXT
111557 || IsVirtual(pLeft->pTab)
111563 assert( pLeft->iColumn!=(-1) ); /* Because IPK never has AFF_TEXT */
111914 affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft);
111931 Expr *pLeft = 0; /* The LHS of the IN operator */
111941 pLeft = pOrTerm->pExpr->pLeft;
111943 assert( pLeft!=0 );
111944 pDup = sqlite3ExprDup(db, pLeft, 0);
111993 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
112010 prereqLeft = exprTableUsage(pMaskSet, pExpr->pLeft);
112036 Expr *pLeft = sqlite3ExprSkipCollate(pExpr->pLeft);
112039 if( pLeft->op==TK_COLUMN ){
112040 pTerm->leftCursor = pLeft->iTable;
112041 pTerm->u.leftColumn = pLeft->iColumn;
112074 pLeft = sqlite3ExprSkipCollate(pDup->pLeft);
112075 pNew->leftCursor = pLeft->iTable;
112076 pNew->u.leftColumn = pLeft->iColumn;
112110 sqlite3ExprDup(db, pExpr->pLeft, 0),
112148 Expr *pLeft; /* LHS of LIKE/GLOB operator */
112156 pLeft = pExpr->x.pList->a[1].pExpr;
112176 pNewExpr1 = sqlite3ExprDup(db, pLeft, 0);
112184 pNewExpr2 = sqlite3ExprDup(db, pLeft, 0);
112210 Expr *pRight, *pLeft;
112215 pLeft = pExpr->x.pList->a[1].pExpr;
112217 prereqColumn = exprTableUsage(pMaskSet, pLeft);
112226 pNewTerm->leftCursor = pLeft->iTable;
112227 pNewTerm->u.leftColumn = pLeft->iColumn;
112250 pLeft->op==TK_COLUMN
112251 && pExpr->pLeft->iColumn>=0
112255 Expr *pLeft = pExpr->pLeft;
112260 sqlite3ExprDup(db, pLeft, 0),
112268 pNewTerm->leftCursor = pLeft->iTable;
112269 pNewTerm->u.leftColumn = pLeft->iColumn;
112569 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
114425 pAndExpr->pLeft = pOrExpr;
114534 pAndExpr->pLeft = 0;
114617 pEAlt->pLeft = pE->pLeft;
117536 ExprSpan *pLeft, /* The left operand */
117539 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
117540 pOut->zStart = pLeft->zStart;
119933 Expr *pLeft = sqlite3PExpr(pParse, TK_ID, 0, 0, &yymsp[-2].minor.yy0);
119934 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
126938 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
126939 Fts3Expr *pLeft; /* Left operand */
130735 fts3EvalAllocateReaders(pCsr, pExpr->pLeft, pnToken, pnOr, pRc);
130774 char *pLeft;
130781 pLeft = p->doclist.aAll;
130789 pLeft = pList;
130794 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
130795 sqlite3_free(pLeft);
131376 fts3EvalStartReaders(pCsr, pExpr->pLeft, pRc);
131378 pExpr->bDeferred = (pExpr->pLeft->bDeferred && pExpr->pRight->bDeferred);
131438 assert( pExpr->pLeft && pExpr->pRight );
131440 pRoot = pExpr->pLeft;
131444 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pLeft, ppTC, ppOr, pRc);
131824 Fts3Expr *pLeft = pExpr->pLeft;
131826 assert( !pLeft->bDeferred || !pRight->bDeferred );
131828 if( pLeft->bDeferred ){
131837 fts3EvalNextRow(pCsr, pLeft, pRc);
131838 pExpr->iDocid = pLeft->iDocid;
131839 pExpr->bEof = pLeft->bEof;
131842 fts3EvalNextRow(pCsr, pLeft, pRc);
131844 while( !pLeft->bEof && !pRight->bEof && *pRc==SQLITE_OK ){
131845 sqlite3_int64 iDiff = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
131848 fts3EvalNextRow(pCsr, pLeft, pRc);
131853 pExpr->iDocid = pLeft->iDocid;
131854 pExpr->bEof = (pLeft->bEof || pRight->bEof);
131860 Fts3Expr *pLeft = pExpr->pLeft;
131862 sqlite3_int64 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
131864 assert( pLeft->bStart || pLeft->iDocid==pRight->iDocid );
131865 assert( pRight->bStart || pLeft->iDocid==pRight->iDocid );
131867 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
131868 fts3EvalNextRow(pCsr, pLeft, pRc);
131869 }else if( pLeft->bEof || (pRight->bEof==0 && iCmp>0) ){
131872 fts3EvalNextRow(pCsr, pLeft, pRc);
131876 pExpr->bEof = (pLeft->bEof && pRight->bEof);
131877 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
131878 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
131879 pExpr->iDocid = pLeft->iDocid;
131888 Fts3Expr *pLeft = pExpr->pLeft;
131896 fts3EvalNextRow(pCsr, pLeft, pRc);
131897 if( pLeft->bEof==0 ){
131900 && DOCID_CMP(pLeft->iDocid, pRight->iDocid)>0
131905 pExpr->iDocid = pLeft->iDocid;
131906 pExpr->bEof = pLeft->bEof;
131969 for(p=pExpr; p->pLeft; p=p->pLeft){
131992 for(p=pExpr->pLeft; p && res; p=p->pLeft){
131995 assert( p->pParent && p->pParent->pLeft==p );
132033 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
132058 for(p=pExpr; p->pPhrase==0; p=p->pLeft){
132071 int bHit1 = fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc);
132079 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
132233 fts3EvalRestart(pCsr, pExpr->pLeft, pRc);
132273 fts3EvalUpdateCounts(pExpr->pLeft);
132315 for(p=pRoot; p; p=p->pLeft){
133783 pNew->pLeft = pSplit;
133835 pNot->pLeft = pNotBranch;
133842 isPhrase = (eType==FTSQUERY_PHRASE || p->pLeft);
133890 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
133921 while( pIter->pLeft ){
133922 pIter = pIter->pLeft;
133924 pIter->pLeft = pRet;
133952 rc = fts3ExprCheckDepth(p->pLeft, nMaxDepth-1);
133996 for(p=pRoot; p->eType==eType; p=p->pLeft){
133997 assert( p->pParent==0 || p->pParent->pLeft==p );
133998 assert( p->pLeft && p->pRight );
134006 assert( pParent==0 || pParent->pLeft==p );
134009 pParent->pLeft = 0;
134022 pFree->pLeft = apLeaf[iLvl];
134024 pFree->pLeft->pParent = pFree;
134043 for(p=pParent->pRight; p->eType==eType; p=p->pLeft);
134046 assert( pParent->pParent==0 || pParent->pParent->pLeft==pParent );
134049 pParent->pParent->pLeft = pParent->pRight;
134071 pFree->pLeft = apLeaf[i];
134072 pFree->pLeft->pParent = pFree;
134244 for(p=pDel; p && (p->pLeft||p->pRight); p=(p->pLeft ? p->pLeft : p->pRight)){
134245 assert( p->pParent==0 || p==p->pParent->pRight || p==p->pParent->pLeft );
134250 if( pParent && p==pParent->pLeft && pParent->pRight ){
134252 while( p && (p->pLeft || p->pRight) ){
134253 assert( p==p->pParent->pRight || p==p->pParent->pLeft );
134254 p = (p->pLeft ? p->pLeft : p->pRight);
134343 if( zBuf ) zBuf = exprToString(pExpr->pLeft, zBuf);
142509 assert( pExpr->pLeft && pExpr->pRight );
142510 rc = fts3ExprIterate2(pExpr->pLeft, piPhrase, x, pCtx);
146745 RtreeNode *pLeft,
146827 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
146872 RtreeNode *pLeft = 0;
146879 ** all cells from node pLeft. Then zero the original node.
146897 pLeft = nodeNew(pRtree, pNode);
146902 pLeft = pNode;
146903 pRight = nodeNew(pRtree, pLeft->pParent);
146904 nodeReference(pLeft);
146907 if( !pLeft || !pRight ){
146912 memset(pLeft->zData, 0, pRtree->iNodeSize);
146915 rc = splitNodeStartree(pRtree, aCell, nCell, pLeft, pRight,
146923 ** by nodeNew() above. But node pLeft sometimes already has a node number.
146927 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
146933 leftbbox.iRowid = pLeft->iNode;
146936 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
146941 RtreeNode *pParent = pLeft->pParent;
146943 rc = nodeParentIndex(pRtree, pLeft, &iCell);
146967 for(i=0; i<NCELL(pLeft); i++){
146968 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
146969 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
146975 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
146983 rc = nodeRelease(pRtree, pLeft);
146984 pLeft = 0;
146989 nodeRelease(pRtree, pLeft);
