contrib/sqlite3/sqlite3.c

191291 typedef struct RtreeNode RtreeNode;
191349   ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree
191350   ** headed by the node (leaf nodes have RtreeNode.iNode==0).
191352   RtreeNode *pDeleted;
191375   RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
191447 ** Number of entries in the cursor RtreeNode cache.  The first entry is
191448 ** used to cache the RtreeNode for RtreeCursor.sPoint.  The remaining
191449 ** entries cache the RtreeNode for the first elements of the priority queue.
191470   RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */
191536 struct RtreeNode {
191537   RtreeNode *pParent;         /* Parent node */
191542   RtreeNode *pNext;           /* Next node in this hash collision chain */
191776 static void nodeReference(RtreeNode *p){
191786 static void nodeZero(Rtree *pRtree, RtreeNode *p){
191803 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
191804   RtreeNode *p;
191812 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
191823 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
191824   RtreeNode **pp;
191834 ** Allocate and return new r-tree node. Initially, (RtreeNode.iNode==0),
191839 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
191840   RtreeNode *pNode;
191841   pNode = (RtreeNode *)sqlite3_malloc64(sizeof(RtreeNode) + pRtree->iNodeSize);
191843     memset(pNode, 0, sizeof(RtreeNode) + pRtree->iNodeSize);
191869 static int nodeInParentChain(const RtreeNode *pNode, const RtreeNode *pParent){
191883   RtreeNode *pParent,        /* Either the parent node or NULL */
191884   RtreeNode **ppNode         /* OUT: Acquired node */
191887   RtreeNode *pNode = 0;
191936     pNode = (RtreeNode *)sqlite3_malloc64(sizeof(RtreeNode)+pRtree->iNodeSize);
192002   RtreeNode *pNode,          /* The node into which the cell is to be written */
192018 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
192035   RtreeNode *pNode,             /* Write new cell into this node */
192057 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){
192083 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){
192114   RtreeNode *pNode,    /* The node from which to extract the ID */
192126   RtreeNode *pNode,            /* The node from which to extract a coordinate */
192140   RtreeNode *pNode,            /* The node containing the cell to be read */
192541   RtreeNode *pNode,
192562 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
192563   RtreeNode *pParent = pNode->pParent;
192606       RtreeNode *pTemp = p->aNode[i];
192621 ** Get the RtreeNode for the search point with the lowest score.
192623 static RtreeNode *rtreeNodeOfFirstSearchPoint(RtreeCursor *pCur, int *pRC){
192792   RtreeNode *pNode;
192892   RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc);
192908   RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc);
192959   RtreeNode **ppLeaf,         /* Write the node here */
193019   RtreeNode *pRoot = 0;
193032     RtreeNode *pLeaf;        /* Leaf on which the required cell resides */
193378   RtreeNode **ppLeaf           /* OUT: Selected leaf page */
193382   RtreeNode *pNode = 0;
193394     RtreeNode *pChild;
193436   RtreeNode *pNode,                 /* Adjust ancestry of this node. */
193439   RtreeNode *p = pNode;
193442     RtreeNode *pParent = p->pParent;
193482 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
193631   RtreeNode *pLeft,
193632   RtreeNode *pRight,
193713     RtreeNode *pTarget = (ii<iBestSplit)?pLeft:pRight;
193728   RtreeNode *pNode,
193734     RtreeNode *pChild = nodeHashLookup(pRtree, iRowid);
193746   RtreeNode *pNode,
193758   RtreeNode *pLeft = 0;
193759   RtreeNode *pRight = 0;
193827     RtreeNode *pParent = pLeft->pParent;
193891 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
193893   RtreeNode *pChild = pLeaf;
193899       RtreeNode *pTest;           /* Used to test for reference loops */
193924 static int deleteCell(Rtree *, RtreeNode *, int, int);
193926 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
193929   RtreeNode *pParent = 0;
193975 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
193976   RtreeNode *pParent = pNode->pParent;
194002 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
194003   RtreeNode *pParent;
194035   RtreeNode *pNode,
194117     RtreeNode *pInsert;
194140   RtreeNode *pNode,
194146     RtreeNode *pChild = nodeHashLookup(pRtree, pCell->iRowid);
194173 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
194179     RtreeNode *pInsert;
194217   RtreeNode *pLeaf = 0;           /* Leaf node containing record iDelete */
194219   RtreeNode *pRoot = 0;           /* Root node of rtree structure */
194266     RtreeNode *pChild = 0;
194489     RtreeNode *pLeaf = 0;
195035   RtreeNode node;
195043   memset(&node, 0, sizeof(RtreeNode));
196913   RtreeNode *pRoot = 0;
196925     RtreeNode *pLeaf;        /* Leaf on which the required cell resides */
197093   RtreeNode *pNode = rtreeNodeOfFirstSearchPoint(pCsr, &rc);
197219     RtreeNode *pLeaf = 0;