Lines Matching refs: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 */
39698 ** in the list, pLeft points to the tree, and v is unused. The
39704 struct RowSetEntry *pLeft; /* Left subtree (smaller entries) */
39919 if( pIn->pLeft ){
39921 rowSetTreeToList(pIn->pLeft, ppFirst, &p);
39953 struct RowSetEntry *pLeft; /* Left subtree */
39960 p->pLeft = p->pRight = 0;
39963 pLeft = rowSetNDeepTree(ppList, iDepth-1);
39966 return pLeft;
39968 p->pLeft = pLeft;
39981 struct RowSetEntry *pLeft; /* Left subtree */
39986 p->pLeft = p->pRight = 0;
39988 pLeft = p;
39991 p->pLeft = pLeft;
40019 struct RowSetEntry *pTree = p->pForest->pLeft;
40083 if( pTree->pLeft==0 ){
40084 pTree->pLeft = rowSetListToTree(p);
40088 rowSetTreeToList(pTree->pLeft, &pAux, &pTail);
40089 pTree->pLeft = 0;
40098 pTree->pLeft = rowSetListToTree(p);
40112 p = pTree->pLeft;
40117 p = p->pLeft;
61842 && (pExpr->pLeft->op==TK_INTEGER || pExpr->pLeft->op==TK_FLOAT) ){
61843 pExpr = pExpr->pLeft;
61870 if( SQLITE_OK==sqlite3ValueFromExpr(db,pExpr->pLeft,enc,affinity,&pVal)
76678 if( sqlite3WalkExpr(pWalker, pExpr->pLeft) ) return WRC_Abort;
76986 ** pExpr->pLeft Any expression this points to is deleted
77205 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
77283 sqlite3ExprDelete(db, pExpr->pLeft);
77284 pExpr->pLeft = 0;
77448 zTable = pExpr->pLeft->u.zToken;
77452 zDb = pExpr->pLeft->u.zToken;
77453 zTable = pRight->pLeft->u.zToken;
77770 assert( pItem->pExpr->pLeft==pE );
77771 pItem->pExpr->pLeft = pNew;
78323 pNew->pLeft = pExpr;
78351 pExpr = pExpr->pLeft;
78374 p = p->pLeft;
78395 if( ALWAYS(p->pLeft) && (p->pLeft->flags & EP_Collate)!=0 ){
78396 p = p->pLeft;
78447 assert( pExpr->pLeft );
78448 aff = sqlite3ExprAffinity(pExpr->pLeft);
78489 ** a binary comparison operator comparing pLeft and pRight.
78496 ** Argument pRight (but not pLeft) may be a null pointer. In this case,
78501 Expr *pLeft,
78505 assert( pLeft );
78506 if( pLeft->flags & EP_Collate ){
78507 pColl = sqlite3ExprCollSeq(pParse, pLeft);
78511 pColl = sqlite3ExprCollSeq(pParse, pLeft);
78524 Expr *pLeft, /* The left operand */
78535 p4 = sqlite3BinaryCompareCollSeq(pParse, pLeft, pRight);
78536 p5 = binaryCompareP5(pLeft, pRight, jumpIfNull);
78607 heightOfExpr(p->pLeft, &nHeight);
78721 ** Attach subtrees pLeft and pRight to the Expr node pRoot.
78724 ** In that case, delete the subtrees pLeft and pRight.
78729 Expr *pLeft,
78734 sqlite3ExprDelete(db, pLeft);
78741 if( pLeft ){
78742 pRoot->pLeft = pLeft;
78743 pRoot->flags |= EP_Collate & pLeft->flags;
78759 Expr *pLeft, /* Left operand */
78764 if( op==TK_AND && pLeft && pRight ){
78766 p = sqlite3ExprAnd(pParse->db, pLeft, pRight);
78769 sqlite3ExprAttachSubtrees(pParse->db, p, pLeft, pRight);
78812 SQLITE_PRIVATE Expr *sqlite3ExprAnd(sqlite3 *db, Expr *pLeft, Expr *pRight){
78813 if( pLeft==0 ){
78816 return pLeft;
78817 }else if( exprAlwaysFalse(pLeft) || exprAlwaysFalse(pRight) ){
78818 sqlite3ExprDelete(db, pLeft);
78823 sqlite3ExprAttachSubtrees(db, pNew, pLeft, pRight);
78941 sqlite3ExprDelete(db, p->pLeft);
79012 if( p->pLeft || p->x.pList ){
79044 ** space to duplicate all Expr nodes in the tree formed by Expr.pLeft
79053 nByte += dupedExprSize(p->pLeft, flags) + dupedExprSize(p->pRight, flags);
79063 ** (if applicable), and the copies of the p->pLeft and p->pRight expressions,
79128 /* Fill in pNew->pLeft and pNew->pRight. */
79132 pNew->pLeft = exprDup(db, p->pLeft, EXPRDUP_REDUCE, &zAlloc);
79140 pNew->pLeft = sqlite3ExprDup(db, p->pLeft, 0);
79575 rc = sqlite3ExprIsInteger(p->pLeft, pValue);
79580 if( sqlite3ExprIsInteger(p->pLeft, &v) ){
79608 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
79638 while( p->op==TK_UPLUS || p->op==TK_UMINUS ){ p = p->pLeft; }
79753 pLHS = pIn->pLeft;
79754 pIn->pLeft = 0;
79756 pIn->pLeft = pLHS;
79886 CollSeq *pReq = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pExpr);
79941 if( pX->pLeft->iColumn<0 && !ExprHasProperty(pX, EP_xIsSelect) ){
80024 Expr *pLeft = pExpr->pLeft; /* the LHS of the IN operator */
80027 affinity = sqlite3ExprAffinity(pLeft);
80073 pKeyInfo->aColl[0] = sqlite3BinaryCompareCollSeq(pParse, pExpr->pLeft,
80093 pKeyInfo->aColl[0] = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
80244 sqlite3ExprCode(pParse, pExpr->pLeft, r1);
80252 CollSeq *pColl = sqlite3ExprCollSeq(pParse, pExpr->pLeft);
80292 if( sqlite3ExprCanBeNull(pExpr->pLeft) ){
80838 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
80843 /* Expressions of the form: CAST(pLeft AS token) */
80845 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
80875 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
80877 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
80893 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
80896 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
80927 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
80935 Expr *pLeft = pExpr->pLeft;
80936 assert( pLeft );
80937 if( pLeft->op==TK_INTEGER ){
80938 codeInteger(pParse, pLeft, 1, target);
80940 }else if( pLeft->op==TK_FLOAT ){
80942 codeReal(v, pLeft->u.zToken, 1, target);
80949 r2 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free2);
80960 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
80972 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
81150 ** X is stored in pExpr->pLeft.
81155 Expr *pLeft = pExpr->pLeft;
81159 r1 = sqlite3ExprCodeTemp(pParse, pLeft, ®Free1);
81165 codeCompare(pParse, pLeft, pRight, OP_Ge,
81172 codeCompare(pParse, pLeft, pRight, OP_Le, r1, r2, r4, SQLITE_STOREP2);
81181 inReg = sqlite3ExprCodeTarget(pParse, pExpr->pLeft, target);
81250 ** X (if it exists) is in pExpr->pLeft.
81278 if( (pX = pExpr->pLeft)!=0 ){
81284 opCompare.pLeft = &tempX;
81548 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81553 /* Expressions of the form: CAST(pLeft AS token) */
81563 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81597 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81637 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81656 ** X is stored in pExpr->pLeft.
81661 Expr *pX = pExpr->pLeft;
81687 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81708 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81714 sqlite3ExplainExpr(pOut, pExpr->pLeft);
81829 exprX = *pExpr->pLeft;
81831 exprAnd.pLeft = &compLeft;
81834 compLeft.pLeft = &exprX;
81837 compRight.pLeft = &exprX;
81887 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2,jumpIfNull^SQLITE_JUMPIFNULL);
81896 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
81904 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
81914 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
81916 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
81932 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
81935 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
81947 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
82042 sqlite3ExprIfFalse(pParse, pExpr->pLeft, dest, jumpIfNull);
82051 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, jumpIfNull^SQLITE_JUMPIFNULL);
82060 sqlite3ExprIfTrue(pParse, pExpr->pLeft, dest, jumpIfNull);
82070 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
82072 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
82088 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
82091 codeCompare(pParse, pExpr->pLeft, pExpr->pRight, op,
82101 r1 = sqlite3ExprCodeTemp(pParse, pExpr->pLeft, ®Free1);
82179 if( pA->op==TK_COLLATE && sqlite3ExprCompare(pA->pLeft, pB, iTab)<2 ){
82182 if( pB->op==TK_COLLATE && sqlite3ExprCompare(pA, pB->pLeft, iTab)<2 ){
82195 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft, iTab) ) return 2;
82261 && (sqlite3ExprImpliesExpr(pE1, pE2->pLeft, iTab)
82267 && sqlite3ExprCompare(pE1->pLeft, pE2->pLeft, iTab)==0
85819 pExpr = pExpr->pLeft;
94010 Expr *pLeft; /* Value from parent table row */
94012 Expr *pEq; /* Expression (pLeft = pRight) */
94017 pLeft = exprTableRegister(pParse, pTab, regData, iCol);
94022 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
94038 Expr *pNe; /* Expression (pLeft != pRight) */
94039 Expr *pLeft; /* Value from parent table row */
94042 pLeft = exprTableRegister(pParse, pTab, regData, -1);
94044 pNe = sqlite3PExpr(pParse, TK_NE, pLeft, pRight, 0);
94051 pLeft = exprTableRegister(pParse, pTab, regData, iCol);
94053 pEq = sqlite3PExpr(pParse, TK_EQ, pLeft, pRight, 0);
101811 setJoinExpr(p->pLeft, iTable);
101833 struct SrcList_item *pLeft; /* Left table being joined */
101837 pLeft = &pSrc->a[0];
101838 pRight = &pLeft[1];
101839 for(i=0; i<pSrc->nSrc-1; i++, pRight++, pLeft++){
101840 Table *pLeftTab = pLeft->pTab;
104462 assert( pExpr->pLeft==0 && pExpr->pRight==0 );
104468 pExpr->pLeft = substExpr(db, pExpr->pLeft, iTable, pEList);
105276 Select *pLeft; /* Left-most SELECT statement */
105335 for(pLeft=pSel; pLeft->pPrior; pLeft=pLeft->pPrior);
105336 pEList = pLeft->pEList;
105523 assert( pE->op!=TK_DOT || (pE->pLeft!=0 && pE->pLeft->op==TK_ID) );
105566 assert( pE->pLeft!=0 );
105567 assert( !ExprHasProperty(pE->pLeft, EP_IntValue) );
105568 zTName = pE->pLeft->u.zToken;
105629 Expr *pLeft;
105630 pLeft = sqlite3Expr(db, TK_ID, zTabName);
105631 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
105633 pLeft = sqlite3Expr(db, TK_ID, zSchemaName);
105634 pExpr = sqlite3PExpr(pParse, TK_DOT, pLeft, pExpr, 0);
111176 whereSplit(pWC, pExpr->pLeft, op);
111229 mask |= exprTableUsage(pMaskSet, p->pLeft);
111300 u16 expLeft = (pExpr->pLeft->flags & EP_Collate);
111308 }else if( sqlite3ExprCollSeq(pParse, pExpr->pLeft)!=0 ){
111312 pExpr->pLeft->flags |= EP_Collate;
111315 SWAP(Expr*,pExpr->pRight,pExpr->pLeft);
111399 assert(pX->pLeft);
111401 pX->pLeft, pX->pRight);
111558 Expr *pRight, *pLeft; /* Right and left size of LIKE operator */
111574 pLeft = pList->a[1].pExpr;
111575 if( pLeft->op!=TK_COLUMN
111576 || sqlite3ExprAffinity(pLeft)!=SQLITE_AFF_TEXT
111577 || IsVirtual(pLeft->pTab)
111583 assert( pLeft->iColumn!=(-1) ); /* Because IPK never has AFF_TEXT */
111934 affLeft = sqlite3ExprAffinity(pOrTerm->pExpr->pLeft);
111951 Expr *pLeft = 0; /* The LHS of the IN operator */
111961 pLeft = pOrTerm->pExpr->pLeft;
111963 assert( pLeft!=0 );
111964 pDup = sqlite3ExprDup(db, pLeft, 0);
112013 Bitmask prereqLeft; /* Prerequesites of the pExpr->pLeft */
112030 prereqLeft = exprTableUsage(pMaskSet, pExpr->pLeft);
112056 Expr *pLeft = sqlite3ExprSkipCollate(pExpr->pLeft);
112059 if( pLeft->op==TK_COLUMN ){
112060 pTerm->leftCursor = pLeft->iTable;
112061 pTerm->u.leftColumn = pLeft->iColumn;
112094 pLeft = sqlite3ExprSkipCollate(pDup->pLeft);
112095 pNew->leftCursor = pLeft->iTable;
112096 pNew->u.leftColumn = pLeft->iColumn;
112130 sqlite3ExprDup(db, pExpr->pLeft, 0),
112168 Expr *pLeft; /* LHS of LIKE/GLOB operator */
112176 pLeft = pExpr->x.pList->a[1].pExpr;
112196 pNewExpr1 = sqlite3ExprDup(db, pLeft, 0);
112204 pNewExpr2 = sqlite3ExprDup(db, pLeft, 0);
112230 Expr *pRight, *pLeft;
112235 pLeft = pExpr->x.pList->a[1].pExpr;
112237 prereqColumn = exprTableUsage(pMaskSet, pLeft);
112246 pNewTerm->leftCursor = pLeft->iTable;
112247 pNewTerm->u.leftColumn = pLeft->iColumn;
112270 && pExpr->pLeft->op==TK_COLUMN
112271 && pExpr->pLeft->iColumn>=0
112275 Expr *pLeft = pExpr->pLeft;
112280 sqlite3ExprDup(db, pLeft, 0),
112288 pNewTerm->leftCursor = pLeft->iTable;
112289 pNewTerm->u.leftColumn = pLeft->iColumn;
112589 pColl = sqlite3BinaryCompareCollSeq(pParse, pX->pLeft, pX->pRight);
114445 pAndExpr->pLeft = pOrExpr;
114554 pAndExpr->pLeft = 0;
114637 pEAlt->pLeft = pE->pLeft;
117556 ExprSpan *pLeft, /* The left operand */
117559 pOut->pExpr = sqlite3PExpr(pParse, op, pLeft->pExpr, pRight->pExpr, 0);
117560 pOut->zStart = pLeft->zStart;
119953 Expr *pLeft = sqlite3PExpr(pParse, TK_ID, 0, 0, &yymsp[-2].minor.yy0);
119954 Expr *pDot = sqlite3PExpr(pParse, TK_DOT, pLeft, pRight, 0);
126958 Fts3Expr *pParent; /* pParent->pLeft==this or pParent->pRight==this */
126959 Fts3Expr *pLeft; /* Left operand */
130767 fts3EvalAllocateReaders(pCsr, pExpr->pLeft, pnToken, pnOr, pRc);
130806 char *pLeft;
130813 pLeft = p->doclist.aAll;
130821 pLeft = pList;
130826 fts3DoclistPhraseMerge(pTab->bDescIdx, nDiff, pLeft, nLeft, pRight,&nRight);
130827 sqlite3_free(pLeft);
131408 fts3EvalStartReaders(pCsr, pExpr->pLeft, pRc);
131410 pExpr->bDeferred = (pExpr->pLeft->bDeferred && pExpr->pRight->bDeferred);
131470 assert( pExpr->pLeft && pExpr->pRight );
131472 pRoot = pExpr->pLeft;
131476 fts3EvalTokenCosts(pCsr, pRoot, pExpr->pLeft, ppTC, ppOr, pRc);
131856 Fts3Expr *pLeft = pExpr->pLeft;
131858 assert( !pLeft->bDeferred || !pRight->bDeferred );
131860 if( pLeft->bDeferred ){
131869 fts3EvalNextRow(pCsr, pLeft, pRc);
131870 pExpr->iDocid = pLeft->iDocid;
131871 pExpr->bEof = pLeft->bEof;
131874 fts3EvalNextRow(pCsr, pLeft, pRc);
131876 while( !pLeft->bEof && !pRight->bEof && *pRc==SQLITE_OK ){
131877 sqlite3_int64 iDiff = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
131880 fts3EvalNextRow(pCsr, pLeft, pRc);
131885 pExpr->iDocid = pLeft->iDocid;
131886 pExpr->bEof = (pLeft->bEof || pRight->bEof);
131892 Fts3Expr *pLeft = pExpr->pLeft;
131894 sqlite3_int64 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
131896 assert( pLeft->bStart || pLeft->iDocid==pRight->iDocid );
131897 assert( pRight->bStart || pLeft->iDocid==pRight->iDocid );
131899 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
131900 fts3EvalNextRow(pCsr, pLeft, pRc);
131901 }else if( pLeft->bEof || (pRight->bEof==0 && iCmp>0) ){
131904 fts3EvalNextRow(pCsr, pLeft, pRc);
131908 pExpr->bEof = (pLeft->bEof && pRight->bEof);
131909 iCmp = DOCID_CMP(pLeft->iDocid, pRight->iDocid);
131910 if( pRight->bEof || (pLeft->bEof==0 && iCmp<0) ){
131911 pExpr->iDocid = pLeft->iDocid;
131920 Fts3Expr *pLeft = pExpr->pLeft;
131928 fts3EvalNextRow(pCsr, pLeft, pRc);
131929 if( pLeft->bEof==0 ){
131932 && DOCID_CMP(pLeft->iDocid, pRight->iDocid)>0
131937 pExpr->iDocid = pLeft->iDocid;
131938 pExpr->bEof = pLeft->bEof;
132001 for(p=pExpr; p->pLeft; p=p->pLeft){
132024 for(p=pExpr->pLeft; p && res; p=p->pLeft){
132027 assert( p->pParent && p->pParent->pLeft==p );
132065 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
132090 for(p=pExpr; p->pPhrase==0; p=p->pLeft){
132103 int bHit1 = fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc);
132111 fts3EvalTestExpr(pCsr, pExpr->pLeft, pRc)
132265 fts3EvalRestart(pCsr, pExpr->pLeft, pRc);
132305 fts3EvalUpdateCounts(pExpr->pLeft);
132347 for(p=pRoot; p; p=p->pLeft){
133815 pNew->pLeft = pSplit;
133867 pNot->pLeft = pNotBranch;
133874 isPhrase = (eType==FTSQUERY_PHRASE || p->pLeft);
133922 assert( pPrev && pPrev->pLeft && pPrev->pRight==0 );
133953 while( pIter->pLeft ){
133954 pIter = pIter->pLeft;
133956 pIter->pLeft = pRet;
133984 rc = fts3ExprCheckDepth(p->pLeft, nMaxDepth-1);
134028 for(p=pRoot; p->eType==eType; p=p->pLeft){
134029 assert( p->pParent==0 || p->pParent->pLeft==p );
134030 assert( p->pLeft && p->pRight );
134038 assert( pParent==0 || pParent->pLeft==p );
134041 pParent->pLeft = 0;
134054 pFree->pLeft = apLeaf[iLvl];
134056 pFree->pLeft->pParent = pFree;
134075 for(p=pParent->pRight; p->eType==eType; p=p->pLeft);
134078 assert( pParent->pParent==0 || pParent->pParent->pLeft==pParent );
134081 pParent->pParent->pLeft = pParent->pRight;
134103 pFree->pLeft = apLeaf[i];
134104 pFree->pLeft->pParent = pFree;
134276 for(p=pDel; p && (p->pLeft||p->pRight); p=(p->pLeft ? p->pLeft : p->pRight)){
134277 assert( p->pParent==0 || p==p->pParent->pRight || p==p->pParent->pLeft );
134282 if( pParent && p==pParent->pLeft && pParent->pRight ){
134284 while( p && (p->pLeft || p->pRight) ){
134285 assert( p==p->pParent->pRight || p==p->pParent->pLeft );
134286 p = (p->pLeft ? p->pLeft : p->pRight);
134375 if( zBuf ) zBuf = exprToString(pExpr->pLeft, zBuf);
142541 assert( pExpr->pLeft && pExpr->pRight );
142542 rc = fts3ExprIterate2(pExpr->pLeft, piPhrase, x, pCtx);
146777 RtreeNode *pLeft,
146859 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
146904 RtreeNode *pLeft = 0;
146911 ** all cells from node pLeft. Then zero the original node.
146929 pLeft = nodeNew(pRtree, pNode);
146934 pLeft = pNode;
146935 pRight = nodeNew(pRtree, pLeft->pParent);
146936 nodeReference(pLeft);
146939 if( !pLeft || !pRight ){
146944 memset(pLeft->zData, 0, pRtree->iNodeSize);
146947 rc = splitNodeStartree(pRtree, aCell, nCell, pLeft, pRight,
146955 ** by nodeNew() above. But node pLeft sometimes already has a node number.
146959 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
146965 leftbbox.iRowid = pLeft->iNode;
146968 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
146973 RtreeNode *pParent = pLeft->pParent;
146975 rc = nodeParentIndex(pRtree, pLeft, &iCell);
146999 for(i=0; i<NCELL(pLeft); i++){
147000 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
147001 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
147007 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
147015 rc = nodeRelease(pRtree, pLeft);
147016 pLeft = 0;
147021 nodeRelease(pRtree, pLeft);