lib/sqlite/sqlite3.c

127153 typedef struct RtreeNode RtreeNode;
127181   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
127186   ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
127187   ** headed by the node (leaf nodes have RtreeNode.iNode==0).
127189   RtreeNode *pDeleted;
127241   RtreeNode *pNode;                 /* Node cursor is currently pointing at */
127286 struct RtreeNode {
127287   RtreeNode *pParent;               /* Parent node */
127292   RtreeNode *pNext;                 /* Next node in this hash chain */
127410 static void nodeReference(RtreeNode *p){
127419 static void nodeZero(Rtree *pRtree, RtreeNode *p){
127439 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
127440   RtreeNode *p;
127448 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
127459 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
127460   RtreeNode **pp;
127470 ** Allocate and return new r-tree node. Initially, (RtreeNode.iNode==0),
127475 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
127476   RtreeNode *pNode;
127477   pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode) + pRtree->iNodeSize);
127479     memset(pNode, 0, sizeof(RtreeNode) + pRtree->iNodeSize);
127496   RtreeNode *pParent,        /* Either the parent node or NULL */
127497   RtreeNode **ppNode         /* OUT: Acquired node */
127501   RtreeNode *pNode;
127522       pNode = (RtreeNode *)sqlite3_malloc(sizeof(RtreeNode)+pRtree->iNodeSize);
127583   RtreeNode *pNode,
127599 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
127617   RtreeNode *pNode,
127640 nodeWrite(Rtree *pRtree, RtreeNode *pNode){
127666 nodeRelease(Rtree *pRtree, RtreeNode *pNode){
127695   RtreeNode *pNode,
127707   RtreeNode *pNode,
127721   RtreeNode *pNode,
128029   RtreeNode *pChild;
128032   RtreeNode *pSavedNode = pCursor->pNode;
128082   RtreeNode *pNode,
128101 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
128102   RtreeNode *pParent = pNode->pParent;
128132       RtreeNode *pNode = pCsr->pNode;
128199 static int findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf){
128270   RtreeNode *pRoot = 0;
128281     RtreeNode *pLeaf;        /* Leaf on which the required cell resides */
128588   RtreeNode **ppLeaf           /* OUT: Selected leaf page */
128592   RtreeNode *pNode;
128605     RtreeNode *pChild;
128679   RtreeNode *pNode,                 /* Adjust ancestry of this node. */
128682   RtreeNode *p = pNode;
128684     RtreeNode *pParent = p->pParent;
128723 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
129022   RtreeNode *pLeft,
129023   RtreeNode *pRight,
129104     RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
129124   RtreeNode *pLeft,
129125   RtreeNode *pRight,
129175   RtreeNode *pNode,
129181     RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);
129193   RtreeNode *pNode,
129205   RtreeNode *pLeft = 0;
129206   RtreeNode *pRight = 0;
129273     RtreeNode *pParent = pLeft->pParent;
129337 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
129339   RtreeNode *pChild = pLeaf;
129345       RtreeNode *pTest;           /* Used to test for reference loops */
129367 static int deleteCell(Rtree *, RtreeNode *, int, int);
129369 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
129372   RtreeNode *pParent = 0;
129418 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
129419   RtreeNode *pParent = pNode->pParent;
129445 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
129446   RtreeNode *pParent;
129478   RtreeNode *pNode,
129558     RtreeNode *pInsert;
129581   RtreeNode *pNode,
129587     RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);
129618 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
129624     RtreeNode *pInsert;
129662   RtreeNode *pLeaf;               /* Leaf node containing record iDelete */
129664   RtreeNode *pRoot;               /* Root node of rtree structure */
129707     RtreeNode *pChild;
129832     RtreeNode *pLeaf;
130160   RtreeNode node;
130165   memset(&node, 0, sizeof(RtreeNode));