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