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 151424 ext/sqlite3/libsqlite/sqlite3.c static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
RtreeNode 151425 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *p;
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 151485 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode;
RtreeNode 151506 ext/sqlite3/libsqlite/sqlite3.c pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode)+pRtree->iNodeSize);
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 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 152821 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pNode;
RtreeNode 152833 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pChild;
RtreeNode 152878 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *p = pNode;
RtreeNode 152880 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent = p->pParent;
RtreeNode 153150 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
RtreeNode 153171 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);
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 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 153363 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent = 0;
RtreeNode 153410 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent = pNode->pParent;
RtreeNode 153437 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pParent;
RtreeNode 153551 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pInsert;
RtreeNode 153580 ext/sqlite3/libsqlite/sqlite3.c RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);
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));