RtreeNode 151054 ext/sqlite3/libsqlite/sqlite3.c typedef struct RtreeNode RtreeNode; RtreeNode 151102 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pDeleted; RtreeNode 151120 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */ RtreeNode 151204 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */ RtreeNode 151265 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent; /* Parent node */ RtreeNode 151270 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNext; /* Next node in this hash collision chain */ RtreeNode 151398 ext/sqlite3/libsqlite/sqlite3.c static void nodeReference(RtreeNode *p){ RtreeNode 151407 ext/sqlite3/libsqlite/sqlite3.c static void nodeZero(Rtree *pRtree, RtreeNode *p){ RtreeNode 151424 ext/sqlite3/libsqlite/sqlite3.c static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){ RtreeNode 151425 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *p; RtreeNode 151433 ext/sqlite3/libsqlite/sqlite3.c static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 151444 ext/sqlite3/libsqlite/sqlite3.c static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 151445 ext/sqlite3/libsqlite/sqlite3.c RtreeNode **pp; RtreeNode 151460 ext/sqlite3/libsqlite/sqlite3.c static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){ RtreeNode 151461 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode; RtreeNode 151462 ext/sqlite3/libsqlite/sqlite3.c pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode) + pRtree->iNodeSize); RtreeNode 151464 ext/sqlite3/libsqlite/sqlite3.c memset(pNode, 0, sizeof(RtreeNode) + pRtree->iNodeSize); RtreeNode 151480 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent, /* Either the parent node or NULL */ RtreeNode 151481 ext/sqlite3/libsqlite/sqlite3.c RtreeNode **ppNode /* OUT: Acquired node */ RtreeNode 151485 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode; RtreeNode 151506 ext/sqlite3/libsqlite/sqlite3.c pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode)+pRtree->iNodeSize); RtreeNode 151567 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, /* The node into which the cell is to be written */ RtreeNode 151583 ext/sqlite3/libsqlite/sqlite3.c static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){ RtreeNode 151600 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, /* Write new cell into this node */ RtreeNode 151622 ext/sqlite3/libsqlite/sqlite3.c static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 151647 ext/sqlite3/libsqlite/sqlite3.c static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 151676 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, /* The node from which to extract the ID */ RtreeNode 151688 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, /* The node from which to extract a coordinate */ RtreeNode 151702 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, /* The node containing the cell to be read */ RtreeNode 152038 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, RtreeNode 152058 ext/sqlite3/libsqlite/sqlite3.c static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){ RtreeNode 152059 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent = pNode->pParent; RtreeNode 152102 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pTemp = p->aNode[i]; RtreeNode 152119 ext/sqlite3/libsqlite/sqlite3.c static RtreeNode *rtreeNodeOfFirstSearchPoint(RtreeCursor *pCur, int *pRC){ RtreeNode 152288 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode; RtreeNode 152373 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc); RtreeNode 152389 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc); RtreeNode 152421 ext/sqlite3/libsqlite/sqlite3.c RtreeNode **ppLeaf, /* Write the node here */ RtreeNode 152497 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pRoot = 0; RtreeNode 152513 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pLeaf; /* Leaf on which the required cell resides */ RtreeNode 152817 ext/sqlite3/libsqlite/sqlite3.c RtreeNode **ppLeaf /* OUT: Selected leaf page */ RtreeNode 152821 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode; RtreeNode 152833 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pChild; RtreeNode 152875 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, /* Adjust ancestry of this node. */ RtreeNode 152878 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *p = pNode; RtreeNode 152880 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent = p->pParent; RtreeNode 152919 ext/sqlite3/libsqlite/sqlite3.c static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int); RtreeNode 153068 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pLeft, RtreeNode 153069 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pRight, RtreeNode 153150 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight; RtreeNode 153165 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, RtreeNode 153171 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pChild = nodeHashLookup(pRtree, iRowid); RtreeNode 153183 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, RtreeNode 153195 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pLeft = 0; RtreeNode 153196 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pRight = 0; RtreeNode 153264 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent = pLeft->pParent; RtreeNode 153328 ext/sqlite3/libsqlite/sqlite3.c static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){ RtreeNode 153330 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pChild = pLeaf; RtreeNode 153336 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pTest; /* Used to test for reference loops */ RtreeNode 153358 ext/sqlite3/libsqlite/sqlite3.c static int deleteCell(Rtree *, RtreeNode *, int, int); RtreeNode 153360 ext/sqlite3/libsqlite/sqlite3.c static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){ RtreeNode 153363 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent = 0; RtreeNode 153409 ext/sqlite3/libsqlite/sqlite3.c static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 153410 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent = pNode->pParent; RtreeNode 153436 ext/sqlite3/libsqlite/sqlite3.c static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){ RtreeNode 153437 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent; RtreeNode 153469 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, RtreeNode 153551 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pInsert; RtreeNode 153574 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode, RtreeNode 153580 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid); RtreeNode 153607 ext/sqlite3/libsqlite/sqlite3.c static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){ RtreeNode 153613 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pInsert; RtreeNode 153651 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pLeaf = 0; /* Leaf node containing record iDelete */ RtreeNode 153653 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pRoot; /* Root node of rtree structure */ RtreeNode 153696 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pChild; RtreeNode 153864 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pLeaf = 0; RtreeNode 154239 ext/sqlite3/libsqlite/sqlite3.c RtreeNode node; RtreeNode 154244 ext/sqlite3/libsqlite/sqlite3.c memset(&node, 0, sizeof(RtreeNode));