360   RtreeNode *pParent;         /* Parent node */  member
667 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){  in nodeNew()  argument
675     pNode->pParent = pParent;  in nodeNew()
677     nodeReference(pParent);  in nodeNew()
699   RtreeNode *pParent,        /* Either the parent node or NULL */  in nodeAcquire()  argument
709     if( pParent && pParent!=pNode->pParent ){  in nodeAcquire()
749       pNode->pParent = pParent;  in nodeAcquire()
788       nodeReference(pParent);  in nodeAcquire()
903       if( pNode->pParent ){  in nodeRelease()
904         rc = nodeRelease(pRtree, pNode->pParent);  in nodeRelease()
1381   RtreeNode *pParent = pNode->pParent;  in nodeParentIndex()  local
1382   if( ALWAYS(pParent) ){  in nodeParentIndex()
1383     return nodeRowidIndex(pRtree, pParent, pNode->iNode, piIndex);  in nodeParentIndex()
1478     RtreeSearchPoint *pParent;  in rtreeEnqueue()  local
1480     pParent = pCur->aPoint + j;  in rtreeEnqueue()
1481     if( rtreeSearchPointCompare(pNew, pParent)>=0 ) break;  in rtreeEnqueue()
1484     pNew = pParent;  in rtreeEnqueue()
2265   while( p->pParent ){  in AdjustTree()
2266     RtreeNode *pParent = p->pParent;  in AdjustTree()  local
2281     nodeGetCell(pRtree, pParent, iCell, &cell);  in AdjustTree()
2284       nodeOverwriteCell(pRtree, pParent, &cell, iCell);  in AdjustTree()
2287     p = pParent;  in AdjustTree()
2566     for(p=pNode; p; p=p->pParent){  in updateMapping()
2570       nodeRelease(pRtree, pChild->pParent);  in updateMapping()
2572       pChild->pParent = pNode;  in updateMapping()
2624     pRight = nodeNew(pRtree, pLeft->pParent);  in SplitNode()
2657     rc = rtreeInsertCell(pRtree, pLeft->pParent, &leftbbox, iHeight+1);  in SplitNode()
2662     RtreeNode *pParent = pLeft->pParent;  in SplitNode()  local
2666       nodeOverwriteCell(pRtree, pParent, &leftbbox, iCell);  in SplitNode()
2667       rc = AdjustTree(pRtree, pParent, &leftbbox);  in SplitNode()
2674   if( (rc = rtreeInsertCell(pRtree, pRight->pParent, &rightbbox, iHeight+1)) ){  in SplitNode()
2730   while( rc==SQLITE_OK && pChild->iNode!=1 && pChild->pParent==0 ){  in fixLeafParent()
2744       for(pTest=pLeaf; pTest && pTest->iNode!=iNode; pTest=pTest->pParent);  in fixLeafParent()
2746         rc2 = nodeAcquire(pRtree, iNode, 0, &pChild->pParent);  in fixLeafParent()
2751     if( rc==SQLITE_OK && !pChild->pParent ){  in fixLeafParent()
2755     pChild = pChild->pParent;  in fixLeafParent()
2765   RtreeNode *pParent = 0;  in removeNode()  local
2773     pParent = pNode->pParent;  in removeNode()
2774     pNode->pParent = 0;  in removeNode()
2775     rc = deleteCell(pRtree, pParent, iCell, iHeight+1);  in removeNode()
2778   rc2 = nodeRelease(pRtree, pParent);  in removeNode()
2813   RtreeNode *pParent = pNode->pParent;  in fixBoundingBox()  local
2815   if( pParent ){  in fixBoundingBox()
2828       nodeOverwriteCell(pRtree, pParent, &box, ii);  in fixBoundingBox()
2829       rc = fixBoundingBox(pRtree, pParent);  in fixBoundingBox()
2840   RtreeNode *pParent;  in deleteCell()  local
2857   pParent = pNode->pParent;  in deleteCell()
2858   assert( pParent || pNode->iNode==1 );  in deleteCell()
2859   if( pParent ){  in deleteCell()
2985       nodeRelease(pRtree, pChild->pParent);  in rtreeInsertCell()
2987       pChild->pParent = pNode;  in rtreeInsertCell()
4136   u8 *pParent                     /* Pointer to parent coordinates */  in rtreeCheckCellCoord()  argument
4153     if( pParent ){  in rtreeCheckCellCoord()
4154       readCoord(&pParent[4*2*i], &p1);  in rtreeCheckCellCoord()
4155       readCoord(&pParent[4*(2*i + 1)], &p2);  in rtreeCheckCellCoord()