Lines Matching refs:Rtree
110 typedef struct Rtree Rtree; typedef
145 struct Rtree { struct
298 #define RTREE_OF_CURSOR(X) ((Rtree*)((X)->base.pVtab))
614 static void nodeZero(Rtree *pRtree, RtreeNode *p){ in nodeZero()
631 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){ in nodeHashLookup()
640 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){ in nodeHashInsert()
651 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){ in nodeHashDelete()
667 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){ in nodeNew()
685 static void nodeBlobReset(Rtree *pRtree){ in nodeBlobReset()
697 Rtree *pRtree, /* R-tree structure */ in nodeAcquire()
810 Rtree *pRtree, /* The overall R-Tree */ in nodeOverwriteCell()
827 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){ in nodeDeleteCell()
843 Rtree *pRtree, /* The overall R-Tree */ in nodeInsertCell()
866 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){ in nodeWrite()
892 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){ in nodeRelease()
922 Rtree *pRtree, /* The overall R-Tree */ in nodeGetRowid()
934 Rtree *pRtree, /* The overall R-Tree */ in nodeGetCoord()
948 Rtree *pRtree, /* The overall R-Tree */ in nodeGetCell()
1004 static void rtreeReference(Rtree *pRtree){ in rtreeReference()
1012 static void rtreeRelease(Rtree *pRtree){ in rtreeRelease()
1037 rtreeRelease((Rtree *)pVtab); in rtreeDisconnect()
1045 Rtree *pRtree = (Rtree *)pVtab; in rtreeDestroy()
1074 Rtree *pRtree = (Rtree *)pVTab; in rtreeOpen()
1094 Rtree *pRtree = (Rtree *)(pCsr->base.pVtab); in resetCursor()
1122 Rtree *pRtree = (Rtree *)(cur->pVtab); in rtreeClose()
1358 Rtree *pRtree, in nodeRowidIndex()
1380 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){ in nodeParentIndex()
1611 Rtree *pRtree = RTREE_OF_CURSOR(pCur); in rtreeStepToLeaf()
1723 Rtree *pRtree = (Rtree *)cur->pVtab; in rtreeColumn()
1777 Rtree *pRtree, /* RTree to search */ in findLeafNode()
1837 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; in rtreeFilter()
1986 Rtree *pRtree = (Rtree*)tab; in rtreeBestIndex()
2074 static RtreeDValue cellArea(Rtree *pRtree, RtreeCell *p){ in cellArea()
2104 static RtreeDValue cellMargin(Rtree *pRtree, RtreeCell *p){ in cellMargin()
2117 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){ in cellUnion()
2138 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){ in cellContains()
2156 static RtreeDValue cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){ in cellGrowth()
2166 Rtree *pRtree, in cellOverlap()
2198 Rtree *pRtree, /* Rtree table */ in ChooseLeaf()
2258 Rtree *pRtree, /* Rtree table */ in AdjustTree()
2295 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){ in rowidWrite()
2305 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){ in parentWrite()
2312 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
2399 Rtree *pRtree, in SortByDimension()
2458 Rtree *pRtree, in splitNodeStartree()
2556 Rtree *pRtree, in updateMapping()
2561 int (*xSetMapping)(Rtree *, sqlite3_int64, sqlite3_int64); in updateMapping()
2580 Rtree *pRtree, in SplitNode()
2727 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){ in fixLeafParent()
2760 static int deleteCell(Rtree *, RtreeNode *, int, int);
2762 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){ in removeNode()
2812 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){ in fixBoundingBox()
2839 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){ in deleteCell()
2871 Rtree *pRtree, in Reinsert()
2976 Rtree *pRtree, in rtreeInsertCell()
3010 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){ in reinsertNodeContent()
3039 static int rtreeNewRowid(Rtree *pRtree, i64 *piRowid){ in rtreeNewRowid()
3052 static int rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete){ in rtreeDeleteRowid()
3180 static int rtreeConstraintError(Rtree *pRtree, int iCol){ in rtreeConstraintError()
3224 Rtree *pRtree = (Rtree *)pVtab; in rtreeUpdate()
3367 Rtree *pRtree = (Rtree *)pVtab; in rtreeBeginTransaction()
3378 Rtree *pRtree = (Rtree *)pVtab; in rtreeEndTransaction()
3388 Rtree *pRtree = (Rtree *)pVtab; in rtreeRename()
3421 Rtree *pRtree = (Rtree *)pVtab; in rtreeSavepoint()
3435 static int rtreeQueryStat1(sqlite3 *db, Rtree *pRtree){ in rtreeQueryStat1()
3508 Rtree *pRtree, in rtreeSqlInit()
3672 Rtree *pRtree, /* Rtree handle */ in getNodeSize()
3736 Rtree *pRtree; in rtreeInit()
3764 pRtree = (Rtree *)sqlite3_malloc64(sizeof(Rtree)+nDb+nName+2); in rtreeInit()
3768 memset(pRtree, 0, sizeof(Rtree)+nDb+nName+2); in rtreeInit()
3866 Rtree tree; in rtreenode()
3874 memset(&tree, 0, sizeof(Rtree)); in rtreenode()