112 typedef struct RtreeNode RtreeNode;  typedef
175   RtreeNode *pDeleted;
198   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */ 
293   RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */
359 struct RtreeNode {  struct
360   RtreeNode *pParent;         /* Parent node */  argument
365   RtreeNode *pNext;           /* Next node in this hash collision chain */  argument
604 static void nodeReference(RtreeNode *p){  in nodeReference()
614 static void nodeZero(Rtree *pRtree, RtreeNode *p){  in nodeZero()
631 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){  in nodeHashLookup()
632   RtreeNode *p;  in nodeHashLookup()
640 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){  in nodeHashInsert()
651 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){  in nodeHashDelete()
652   RtreeNode **pp;  in nodeHashDelete()
667 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){  in nodeNew()
668   RtreeNode *pNode;  in nodeNew()
669   pNode = (RtreeNode *)sqlite3_malloc64(sizeof(RtreeNode) + pRtree->iNodeSize);  in nodeNew()
671     memset(pNode, 0, sizeof(RtreeNode) + pRtree->iNodeSize);  in nodeNew()
699   RtreeNode *pParent,        /* Either the parent node or NULL */  in nodeAcquire()
700   RtreeNode **ppNode         /* OUT: Acquired node */  in nodeAcquire()
703   RtreeNode *pNode = 0;  in nodeAcquire()
745     pNode = (RtreeNode *)sqlite3_malloc64(sizeof(RtreeNode)+pRtree->iNodeSize);  in nodeAcquire()
811   RtreeNode *pNode,          /* The node into which the cell is to be written */  in nodeOverwriteCell()
827 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){  in nodeDeleteCell()
844   RtreeNode *pNode,             /* Write new cell into this node */  in nodeInsertCell()
866 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){  in nodeWrite()
892 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){  in nodeRelease()
923   RtreeNode *pNode,    /* The node from which to extract the ID */  in nodeGetRowid()
935   RtreeNode *pNode,            /* The node from which to extract a coordinate */  in nodeGetCoord()
949   RtreeNode *pNode,            /* The node containing the cell to be read */  in nodeGetCell()
1359   RtreeNode *pNode,   in nodeRowidIndex()
1380 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){  in nodeParentIndex()
1381   RtreeNode *pParent = pNode->pParent;  in nodeParentIndex()
1425       RtreeNode *pTemp = p->aNode[i];  in rtreeSearchPointSwap()
1442 static RtreeNode *rtreeNodeOfFirstSearchPoint(RtreeCursor *pCur, int *pRC){  in rtreeNodeOfFirstSearchPoint()
1612   RtreeNode *pNode;  in rtreeStepToLeaf()
1712   RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc);  in rtreeRowid()
1728   RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc);  in rtreeColumn()
1779   RtreeNode **ppLeaf,         /* Write the node here */  in findLeafNode()
1839   RtreeNode *pRoot = 0;  in rtreeFilter()
1852     RtreeNode *pLeaf;        /* Leaf on which the required cell resides */  in rtreeFilter()
2201   RtreeNode **ppLeaf           /* OUT: Selected leaf page */  in ChooseLeaf()
2205   RtreeNode *pNode = 0;  in ChooseLeaf()
2217     RtreeNode *pChild = 0;  in ChooseLeaf()
2259   RtreeNode *pNode,                 /* Adjust ancestry of this node. */  in AdjustTree()
2262   RtreeNode *p = pNode;  in AdjustTree()
2266     RtreeNode *pParent = p->pParent;  in AdjustTree()
2312 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
2461   RtreeNode *pLeft,  in splitNodeStartree()
2462   RtreeNode *pRight,  in splitNodeStartree()
2543     RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;  in splitNodeStartree()
2558   RtreeNode *pNode,   in updateMapping()
2564     RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);  in updateMapping()
2565     RtreeNode *p;  in updateMapping()
2581   RtreeNode *pNode,  in SplitNode()
2593   RtreeNode *pLeft = 0;  in SplitNode()
2594   RtreeNode *pRight = 0;  in SplitNode()
2662     RtreeNode *pParent = pLeft->pParent;  in SplitNode()
2727 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){  in fixLeafParent()
2729   RtreeNode *pChild = pLeaf;  in fixLeafParent()
2735       RtreeNode *pTest;           /* Used to test for reference loops */  in fixLeafParent()
2760 static int deleteCell(Rtree *, RtreeNode *, int, int);
2762 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){  in removeNode()
2765   RtreeNode *pParent = 0;  in removeNode()
2812 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){  in fixBoundingBox()
2813   RtreeNode *pParent = pNode->pParent;  in fixBoundingBox()
2839 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){  in deleteCell()
2840   RtreeNode *pParent;  in deleteCell()
2872   RtreeNode *pNode,   in Reinsert()
2954     RtreeNode *pInsert;  in Reinsert()
2977   RtreeNode *pNode,  in rtreeInsertCell()
2983     RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);  in rtreeInsertCell()
3010 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){  in reinsertNodeContent()
3016     RtreeNode *pInsert;  in reinsertNodeContent()
3054   RtreeNode *pLeaf = 0;           /* Leaf node containing record iDelete */  in rtreeDeleteRowid()
3056   RtreeNode *pRoot = 0;           /* Root node of rtree structure */  in rtreeDeleteRowid()
3103     RtreeNode *pChild = 0;  in rtreeDeleteRowid()
3326     RtreeNode *pLeaf = 0;  in rtreeUpdate()
3865   RtreeNode node;  in rtreenode()
3873   memset(&node, 0, sizeof(RtreeNode));  in rtreenode()