RtreeNode        124507 sqlite3/libsqlite/sqlite3.c typedef struct RtreeNode RtreeNode;
RtreeNode        124535 sqlite3/libsqlite/sqlite3.c   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */ 
RtreeNode        124543 sqlite3/libsqlite/sqlite3.c   RtreeNode *pDeleted;
RtreeNode        124595 sqlite3/libsqlite/sqlite3.c   RtreeNode *pNode;                 /* Node cursor is currently pointing at */
RtreeNode        124641 sqlite3/libsqlite/sqlite3.c   RtreeNode *pParent;               /* Parent node */
RtreeNode        124646 sqlite3/libsqlite/sqlite3.c   RtreeNode *pNext;                 /* Next node in this hash chain */
RtreeNode        124793 sqlite3/libsqlite/sqlite3.c static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
RtreeNode        124794 sqlite3/libsqlite/sqlite3.c   RtreeNode *p;
RtreeNode        124814 sqlite3/libsqlite/sqlite3.c   RtreeNode **pp;
RtreeNode        124829 sqlite3/libsqlite/sqlite3.c static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
RtreeNode        124830 sqlite3/libsqlite/sqlite3.c   RtreeNode *pNode;
RtreeNode        124831 sqlite3/libsqlite/sqlite3.c   pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode) + pRtree->iNodeSize);
RtreeNode        124833 sqlite3/libsqlite/sqlite3.c     memset(pNode, 0, sizeof(RtreeNode) + pRtree->iNodeSize);
RtreeNode        124855 sqlite3/libsqlite/sqlite3.c   RtreeNode *pNode;
RtreeNode        124876 sqlite3/libsqlite/sqlite3.c       pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode)+pRtree->iNodeSize);
RtreeNode        125383 sqlite3/libsqlite/sqlite3.c   RtreeNode *pChild;
RtreeNode        125386 sqlite3/libsqlite/sqlite3.c   RtreeNode *pSavedNode = pCursor->pNode;
RtreeNode        125456 sqlite3/libsqlite/sqlite3.c   RtreeNode *pParent = pNode->pParent;
RtreeNode        125486 sqlite3/libsqlite/sqlite3.c       RtreeNode *pNode = pCsr->pNode;
RtreeNode        125624 sqlite3/libsqlite/sqlite3.c   RtreeNode *pRoot = 0;
RtreeNode        125635 sqlite3/libsqlite/sqlite3.c     RtreeNode *pLeaf;        /* Leaf on which the required cell resides */
RtreeNode        125946 sqlite3/libsqlite/sqlite3.c   RtreeNode *pNode;
RtreeNode        125959 sqlite3/libsqlite/sqlite3.c     RtreeNode *pChild;
RtreeNode        126036 sqlite3/libsqlite/sqlite3.c   RtreeNode *p = pNode;
RtreeNode        126038 sqlite3/libsqlite/sqlite3.c     RtreeNode *pParent = p->pParent;
RtreeNode        126458 sqlite3/libsqlite/sqlite3.c     RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
RtreeNode        126535 sqlite3/libsqlite/sqlite3.c     RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);
RtreeNode        126559 sqlite3/libsqlite/sqlite3.c   RtreeNode *pLeft = 0;
RtreeNode        126560 sqlite3/libsqlite/sqlite3.c   RtreeNode *pRight = 0;
RtreeNode        126627 sqlite3/libsqlite/sqlite3.c     RtreeNode *pParent = pLeft->pParent;
RtreeNode        126693 sqlite3/libsqlite/sqlite3.c   RtreeNode *pChild = pLeaf;
RtreeNode        126699 sqlite3/libsqlite/sqlite3.c       RtreeNode *pTest;           /* Used to test for reference loops */
RtreeNode        126726 sqlite3/libsqlite/sqlite3.c   RtreeNode *pParent = 0;
RtreeNode        126773 sqlite3/libsqlite/sqlite3.c   RtreeNode *pParent = pNode->pParent;
RtreeNode        126800 sqlite3/libsqlite/sqlite3.c   RtreeNode *pParent;
RtreeNode        126912 sqlite3/libsqlite/sqlite3.c     RtreeNode *pInsert;
RtreeNode        126941 sqlite3/libsqlite/sqlite3.c     RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);
RtreeNode        126978 sqlite3/libsqlite/sqlite3.c     RtreeNode *pInsert;
RtreeNode        127016 sqlite3/libsqlite/sqlite3.c   RtreeNode *pLeaf;               /* Leaf node containing record iDelete */
RtreeNode        127018 sqlite3/libsqlite/sqlite3.c   RtreeNode *pRoot;               /* Root node of rtree structure */
RtreeNode        127061 sqlite3/libsqlite/sqlite3.c     RtreeNode *pChild;
RtreeNode        127186 sqlite3/libsqlite/sqlite3.c     RtreeNode *pLeaf;
RtreeNode        127514 sqlite3/libsqlite/sqlite3.c   RtreeNode node;
RtreeNode        127519 sqlite3/libsqlite/sqlite3.c   memset(&node, 0, sizeof(RtreeNode));