218221 typedef struct RtreeNode RtreeNode;  typedef
218285   RtreeNode *pDeleted;
218307   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
218402   RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */
218468 struct RtreeNode {  struct
218469   RtreeNode *pParent;         /* Parent node */  argument
218474   RtreeNode *pNext;           /* Next node in this hash collision chain */  argument
218723 static void nodeReference(RtreeNode *p){
218733 static void nodeZero(Rtree *pRtree, RtreeNode *p){
218750 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
218751   RtreeNode *p;
218759 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
218770 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
218771   RtreeNode **pp;
218786 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
218787   RtreeNode *pNode;
218788   pNode = (RtreeNode *)sqlite3_malloc64(sizeof(RtreeNode) + pRtree->iNodeSize);
218790     memset(pNode, 0, sizeof(RtreeNode) + pRtree->iNodeSize);
218816   RtreeNode *pParent,        /* Either the parent node or NULL */
218817   RtreeNode **ppNode         /* OUT: Acquired node */
218820   RtreeNode *pNode = 0;
218859     pNode = (RtreeNode *)sqlite3_malloc64(sizeof(RtreeNode)+pRtree->iNodeSize);
218926   RtreeNode *pNode,          /* The node into which the cell is to be written */
218942 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
218959   RtreeNode *pNode,             /* Write new cell into this node */
218981 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){
219007 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){
219038   RtreeNode *pNode,    /* The node from which to extract the ID */
219050   RtreeNode *pNode,            /* The node from which to extract a coordinate */
219065   RtreeNode *pNode,            /* The node containing the cell to be read */
219139           RtreeNode *pNext = pRtree->aHash[i]->pNext;
219493   RtreeNode *pNode,
219514 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
219515   RtreeNode *pParent = pNode->pParent;
219559       RtreeNode *pTemp = p->aNode[i];
219576 static RtreeNode *rtreeNodeOfFirstSearchPoint(RtreeCursor *pCur, int *pRC){
219746   RtreeNode *pNode;
219846   RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc);
219866   RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc);
219918   RtreeNode **ppLeaf,         /* Write the node here */
219980   RtreeNode *pRoot = 0;
219993     RtreeNode *pLeaf;        /* Leaf on which the required cell resides */
220352   RtreeNode **ppLeaf           /* OUT: Selected leaf page */
220356   RtreeNode *pNode = 0;
220366     RtreeNode *pChild = 0;
220424   RtreeNode *pNode,                 /* Adjust ancestry of this node. */
220427   RtreeNode *p = pNode;
220431     RtreeNode *pParent = p->pParent;
220477 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
220555   RtreeNode *pLeft,
220556   RtreeNode *pRight,
220637     RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
220652   RtreeNode *pNode,
220658     RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);
220659     RtreeNode *p;
220675   RtreeNode *pNode,
220687   RtreeNode *pLeft = 0;
220688   RtreeNode *pRight = 0;
220756     RtreeNode *pParent = pLeft->pParent;
220812 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
220814   RtreeNode *pChild = pLeaf;
220820       RtreeNode *pTest;           /* Used to test for reference loops */
220845 static int deleteCell(Rtree *, RtreeNode *, int, int);
220847 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
220850   RtreeNode *pParent = 0;
220897 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
220898   RtreeNode *pParent = pNode->pParent;
220924 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
220925   RtreeNode *pParent;
220961   RtreeNode *pNode,
220967     RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);
220989 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
220995     RtreeNode *pInsert;
221033   RtreeNode *pLeaf = 0;           /* Leaf node containing record iDelete */
221035   RtreeNode *pRoot = 0;           /* Root node of rtree structure */
221082     RtreeNode *pChild = 0;
221305     RtreeNode *pLeaf = 0;
221855   RtreeNode node;
221863   memset(&node, 0, sizeof(RtreeNode));
223773   RtreeNode *pRoot = 0;
223786     RtreeNode *pLeaf;        /* Leaf on which the required cell resides */
223956   RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc);
224083     RtreeNode *pLeaf = 0;