RtreeNode 124381 third_party/sqlite/amalgamation/sqlite3.c typedef struct RtreeNode RtreeNode; RtreeNode 124409 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */ RtreeNode 124417 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pDeleted; RtreeNode 124469 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode; /* Node cursor is currently pointing at */ RtreeNode 124515 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pParent; /* Parent node */ RtreeNode 124520 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNext; /* Next node in this hash chain */ RtreeNode 124638 third_party/sqlite/amalgamation/sqlite3.c static void nodeReference(RtreeNode *p){ RtreeNode 124647 third_party/sqlite/amalgamation/sqlite3.c static void nodeZero(Rtree *pRtree, RtreeNode *p){ RtreeNode 124667 third_party/sqlite/amalgamation/sqlite3.c static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){ RtreeNode 124668 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *p; RtreeNode 124676 third_party/sqlite/amalgamation/sqlite3.c static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 124687 third_party/sqlite/amalgamation/sqlite3.c static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 124688 third_party/sqlite/amalgamation/sqlite3.c RtreeNode **pp; RtreeNode 124703 third_party/sqlite/amalgamation/sqlite3.c static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){ RtreeNode 124704 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode; RtreeNode 124705 third_party/sqlite/amalgamation/sqlite3.c pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode) + pRtree->iNodeSize); RtreeNode 124707 third_party/sqlite/amalgamation/sqlite3.c memset(pNode, 0, sizeof(RtreeNode) + pRtree->iNodeSize); RtreeNode 124724 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pParent, /* Either the parent node or NULL */ RtreeNode 124725 third_party/sqlite/amalgamation/sqlite3.c RtreeNode **ppNode /* OUT: Acquired node */ RtreeNode 124729 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode; RtreeNode 124750 third_party/sqlite/amalgamation/sqlite3.c pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode)+pRtree->iNodeSize); RtreeNode 124811 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 124827 third_party/sqlite/amalgamation/sqlite3.c static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){ RtreeNode 124845 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 124868 third_party/sqlite/amalgamation/sqlite3.c nodeWrite(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 124894 third_party/sqlite/amalgamation/sqlite3.c nodeRelease(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 124923 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 124935 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 124949 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 125257 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pChild; RtreeNode 125260 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pSavedNode = pCursor->pNode; RtreeNode 125310 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 125329 third_party/sqlite/amalgamation/sqlite3.c static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){ RtreeNode 125330 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pParent = pNode->pParent; RtreeNode 125360 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode = pCsr->pNode; RtreeNode 125427 third_party/sqlite/amalgamation/sqlite3.c static int findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf){ RtreeNode 125498 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pRoot = 0; RtreeNode 125509 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pLeaf; /* Leaf on which the required cell resides */ RtreeNode 125816 third_party/sqlite/amalgamation/sqlite3.c RtreeNode **ppLeaf /* OUT: Selected leaf page */ RtreeNode 125820 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode; RtreeNode 125833 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pChild; RtreeNode 125907 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, /* Adjust ancestry of this node. */ RtreeNode 125910 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *p = pNode; RtreeNode 125912 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pParent = p->pParent; RtreeNode 125951 third_party/sqlite/amalgamation/sqlite3.c static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int); RtreeNode 126250 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pLeft, RtreeNode 126251 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pRight, RtreeNode 126332 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight; RtreeNode 126352 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pLeft, RtreeNode 126353 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pRight, RtreeNode 126403 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 126409 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pChild = nodeHashLookup(pRtree, iRowid); RtreeNode 126421 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 126433 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pLeft = 0; RtreeNode 126434 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pRight = 0; RtreeNode 126501 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pParent = pLeft->pParent; RtreeNode 126565 third_party/sqlite/amalgamation/sqlite3.c static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){ RtreeNode 126567 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pChild = pLeaf; RtreeNode 126573 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pTest; /* Used to test for reference loops */ RtreeNode 126595 third_party/sqlite/amalgamation/sqlite3.c static int deleteCell(Rtree *, RtreeNode *, int, int); RtreeNode 126597 third_party/sqlite/amalgamation/sqlite3.c static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){ RtreeNode 126600 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pParent; RtreeNode 126646 third_party/sqlite/amalgamation/sqlite3.c static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 126647 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pParent = pNode->pParent; RtreeNode 126673 third_party/sqlite/amalgamation/sqlite3.c static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){ RtreeNode 126674 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pParent; RtreeNode 126706 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 126786 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pInsert; RtreeNode 126809 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pNode, RtreeNode 126815 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid); RtreeNode 126846 third_party/sqlite/amalgamation/sqlite3.c static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 126852 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pInsert; RtreeNode 126907 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pLeaf; /* Leaf node containing record iDelete */ RtreeNode 126909 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pRoot; RtreeNode 126952 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pChild; RtreeNode 126992 third_party/sqlite/amalgamation/sqlite3.c RtreeNode *pLeaf; RtreeNode 127346 third_party/sqlite/amalgamation/sqlite3.c RtreeNode node; RtreeNode 127351 third_party/sqlite/amalgamation/sqlite3.c memset(&node, 0, sizeof(RtreeNode)); RtreeNode 124 third_party/sqlite/src/ext/rtree/rtree.c typedef struct RtreeNode RtreeNode; RtreeNode 152 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */ RtreeNode 160 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pDeleted; RtreeNode 212 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode; /* Node cursor is currently pointing at */ RtreeNode 258 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pParent; /* Parent node */ RtreeNode 263 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNext; /* Next node in this hash chain */ RtreeNode 381 third_party/sqlite/src/ext/rtree/rtree.c static void nodeReference(RtreeNode *p){ RtreeNode 390 third_party/sqlite/src/ext/rtree/rtree.c static void nodeZero(Rtree *pRtree, RtreeNode *p){ RtreeNode 410 third_party/sqlite/src/ext/rtree/rtree.c static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){ RtreeNode 411 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *p; RtreeNode 419 third_party/sqlite/src/ext/rtree/rtree.c static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 430 third_party/sqlite/src/ext/rtree/rtree.c static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 431 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode **pp; RtreeNode 446 third_party/sqlite/src/ext/rtree/rtree.c static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){ RtreeNode 447 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode; RtreeNode 448 third_party/sqlite/src/ext/rtree/rtree.c pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode) + pRtree->iNodeSize); RtreeNode 450 third_party/sqlite/src/ext/rtree/rtree.c memset(pNode, 0, sizeof(RtreeNode) + pRtree->iNodeSize); RtreeNode 467 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pParent, /* Either the parent node or NULL */ RtreeNode 468 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode **ppNode /* OUT: Acquired node */ RtreeNode 472 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode; RtreeNode 493 third_party/sqlite/src/ext/rtree/rtree.c pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode)+pRtree->iNodeSize); RtreeNode 554 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 570 third_party/sqlite/src/ext/rtree/rtree.c static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){ RtreeNode 588 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 611 third_party/sqlite/src/ext/rtree/rtree.c nodeWrite(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 637 third_party/sqlite/src/ext/rtree/rtree.c nodeRelease(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 666 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 678 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 692 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 1000 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pChild; RtreeNode 1003 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pSavedNode = pCursor->pNode; RtreeNode 1053 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 1072 third_party/sqlite/src/ext/rtree/rtree.c static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){ RtreeNode 1073 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pParent = pNode->pParent; RtreeNode 1103 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode = pCsr->pNode; RtreeNode 1170 third_party/sqlite/src/ext/rtree/rtree.c static int findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf){ RtreeNode 1241 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pRoot = 0; RtreeNode 1252 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pLeaf; /* Leaf on which the required cell resides */ RtreeNode 1559 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode **ppLeaf /* OUT: Selected leaf page */ RtreeNode 1563 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode; RtreeNode 1576 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pChild; RtreeNode 1650 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, /* Adjust ancestry of this node. */ RtreeNode 1653 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *p = pNode; RtreeNode 1655 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pParent = p->pParent; RtreeNode 1694 third_party/sqlite/src/ext/rtree/rtree.c static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int); RtreeNode 1993 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pLeft, RtreeNode 1994 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pRight, RtreeNode 2075 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight; RtreeNode 2095 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pLeft, RtreeNode 2096 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pRight, RtreeNode 2146 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 2152 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pChild = nodeHashLookup(pRtree, iRowid); RtreeNode 2164 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 2176 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pLeft = 0; RtreeNode 2177 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pRight = 0; RtreeNode 2244 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pParent = pLeft->pParent; RtreeNode 2308 third_party/sqlite/src/ext/rtree/rtree.c static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){ RtreeNode 2310 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pChild = pLeaf; RtreeNode 2316 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pTest; /* Used to test for reference loops */ RtreeNode 2338 third_party/sqlite/src/ext/rtree/rtree.c static int deleteCell(Rtree *, RtreeNode *, int, int); RtreeNode 2340 third_party/sqlite/src/ext/rtree/rtree.c static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){ RtreeNode 2343 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pParent; RtreeNode 2389 third_party/sqlite/src/ext/rtree/rtree.c static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 2390 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pParent = pNode->pParent; RtreeNode 2416 third_party/sqlite/src/ext/rtree/rtree.c static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){ RtreeNode 2417 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pParent; RtreeNode 2449 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 2529 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pInsert; RtreeNode 2552 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pNode, RtreeNode 2558 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid); RtreeNode 2589 third_party/sqlite/src/ext/rtree/rtree.c static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 2595 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pInsert; RtreeNode 2650 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pLeaf; /* Leaf node containing record iDelete */ RtreeNode 2652 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pRoot; RtreeNode 2695 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pChild; RtreeNode 2735 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode *pLeaf; RtreeNode 3089 third_party/sqlite/src/ext/rtree/rtree.c RtreeNode node; RtreeNode 3094 third_party/sqlite/src/ext/rtree/rtree.c memset(&node, 0, sizeof(RtreeNode));