Lines Matching refs:pLeft
1993 RtreeNode *pLeft,
2075 RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
2095 RtreeNode *pLeft,
2115 nodeInsertCell(pRtree, pLeft, &aCell[iLeftSeed]);
2128 || (diff>0.0 && (RTREE_MINCELLS(pRtree)-NCELL(pLeft)!=i))
2133 nodeInsertCell(pRtree, pLeft, pNext);
2176 RtreeNode *pLeft = 0;
2183 ** all cells from node pLeft. Then zero the original node.
2201 pLeft = nodeNew(pRtree, pNode);
2206 pLeft = pNode;
2207 pRight = nodeNew(pRtree, pLeft->pParent);
2208 nodeReference(pLeft);
2211 if( !pLeft || !pRight ){
2216 memset(pLeft->zData, 0, pRtree->iNodeSize);
2219 rc = AssignCells(pRtree, aCell, nCell, pLeft, pRight, &leftbbox, &rightbbox);
2226 ** by nodeNew() above. But node pLeft sometimes already has a node number.
2230 || (0==pLeft->iNode && SQLITE_OK!=(rc = nodeWrite(pRtree, pLeft)))
2236 leftbbox.iRowid = pLeft->iNode;
2239 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
2244 RtreeNode *pParent = pLeft->pParent;
2246 rc = nodeParentIndex(pRtree, pLeft, &iCell);
2270 for(i=0; i<NCELL(pLeft); i++){
2271 i64 iRowid = nodeGetRowid(pRtree, pLeft, i);
2272 rc = updateMapping(pRtree, iRowid, pLeft, iHeight);
2278 rc = updateMapping(pRtree, pCell->iRowid, pLeft, iHeight);
2286 rc = nodeRelease(pRtree, pLeft);
2287 pLeft = 0;
2292 nodeRelease(pRtree, pLeft);
