Lines Matching defs:pParent

258   RtreeNode *pParent;               /* Parent node */
446 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
453 pNode->pParent = pParent;
455 nodeReference(pParent);
467 RtreeNode *pParent, /* Either the parent node or NULL */
478 assert( !pParent || !pNode->pParent || pNode->pParent==pParent );
479 if( pParent && !pNode->pParent ){
480 nodeReference(pParent);
481 pNode->pParent = pParent;
497 pNode->pParent = pParent;
504 nodeReference(pParent);
646 if( pNode->pParent ){
647 rc = nodeRelease(pRtree, pNode->pParent);
1073 RtreeNode *pParent = pNode->pParent;
1074 if( pParent ){
1075 return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);
1112 pCsr->pNode = pNode->pParent;
1654 while( p->pParent ){
1655 RtreeNode *pParent = p->pParent;
1663 nodeGetCell(pRtree, pParent, iCell, &cell);
1666 nodeOverwriteCell(pRtree, pParent, &cell, iCell);
1669 p = pParent;
2154 nodeRelease(pRtree, pChild->pParent);
2156 pChild->pParent = pNode;
2207 pRight = nodeNew(pRtree, pLeft->pParent);
2239 rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);
2244 RtreeNode *pParent = pLeft->pParent;
2248 nodeOverwriteCell(pRtree, pParent, &leftbbox, iCell);
2249 rc = AdjustTree(pRtree, pParent, &leftbbox);
2255 if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){
2298 ** If node pLeaf is not the root of the r-tree and its pParent pointer is
2300 ** the pLeaf->pParent chain all the way up to the root node.
2311 while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){
2319 /* Before setting pChild->pParent, test that we are not creating a
2320 ** loop of references (as we would if, say, pChild==pParent). We don't
2325 for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);
2327 rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);
2332 if( rc==SQLITE_OK && !pChild->pParent ) rc = SQLITE_CORRUPT;
2333 pChild = pChild->pParent;
2343 RtreeNode *pParent;
2351 pParent = pNode->pParent;
2352 pNode->pParent = 0;
2353 rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
2355 rc2 = nodeRelease(pRtree, pParent);
2390 RtreeNode *pParent = pNode->pParent;
2392 if( pParent ){
2405 nodeOverwriteCell(pRtree, pParent, &box, ii);
2406 rc = fixBoundingBox(pRtree, pParent);
2417 RtreeNode *pParent;
2434 pParent = pNode->pParent;
2435 assert( pParent || pNode->iNode==1 );
2436 if( pParent ){
2560 nodeRelease(pRtree, pChild->pParent);
2562 pChild->pParent = pNode;