Lines Matching refs:Rtree
218219 typedef struct Rtree Rtree; typedef
218254 struct Rtree { struct
218407 #define RTREE_OF_CURSOR(X) ((Rtree*)((X)->base.pVtab))
218733 static void nodeZero(Rtree *pRtree, RtreeNode *p){
218750 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
218759 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
218770 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
218786 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
218804 static void nodeBlobReset(Rtree *pRtree){
218814 Rtree *pRtree, /* R-tree structure */
218925 Rtree *pRtree, /* The overall R-Tree */
218942 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
218958 Rtree *pRtree, /* The overall R-Tree */
218981 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){
219007 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){
219037 Rtree *pRtree, /* The overall R-Tree */
219049 Rtree *pRtree, /* The overall R-Tree */
219064 Rtree *pRtree, /* The overall R-Tree */
219120 static void rtreeReference(Rtree *pRtree){
219128 static void rtreeRelease(Rtree *pRtree){
219163 rtreeRelease((Rtree *)pVtab);
219171 Rtree *pRtree = (Rtree *)pVtab;
219200 Rtree *pRtree = (Rtree *)pVTab;
219220 Rtree *pRtree = (Rtree *)(pCsr->base.pVtab);
219254 Rtree *pRtree = (Rtree *)(cur->pVtab);
219492 Rtree *pRtree,
219514 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
219745 Rtree *pRtree = RTREE_OF_CURSOR(pCur);
219861 Rtree *pRtree = (Rtree *)cur->pVtab;
219916 Rtree *pRtree, /* RTree to search */
219978 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
220141 Rtree *pRtree = (Rtree*)tab;
220234 static RtreeDValue cellArea(Rtree *pRtree, RtreeCell *p){
220264 static RtreeDValue cellMargin(Rtree *pRtree, RtreeCell *p){
220277 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
220298 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
220317 Rtree *pRtree,
220349 Rtree *pRtree, /* Rtree table */
220423 Rtree *pRtree, /* Rtree table */
220460 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
220470 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
220477 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
220493 Rtree *pRtree,
220552 Rtree *pRtree,
220650 Rtree *pRtree,
220655 int (*xSetMapping)(Rtree *, sqlite3_int64, sqlite3_int64);
220674 Rtree *pRtree,
220812 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
220845 static int deleteCell(Rtree *, RtreeNode *, int, int);
220847 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
220897 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
220924 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
220960 Rtree *pRtree,
220989 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
221018 static int rtreeNewRowid(Rtree *pRtree, i64 *piRowid){
221031 static int rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete){
221159 static int rtreeConstraintError(Rtree *pRtree, int iCol){
221203 Rtree *pRtree = (Rtree *)pVtab;
221345 Rtree *pRtree = (Rtree *)pVtab;
221356 Rtree *pRtree = (Rtree *)pVtab;
221369 Rtree *pRtree = (Rtree *)pVtab;
221402 Rtree *pRtree = (Rtree *)pVtab;
221416 static int rtreeQueryStat1(sqlite3 *db, Rtree *pRtree){
221493 Rtree *pRtree,
221657 Rtree *pRtree, /* Rtree handle */
221721 Rtree *pRtree;
221751 pRtree = (Rtree *)sqlite3_malloc64(sizeof(Rtree)+nDb+nName*2+8);
221755 memset(pRtree, 0, sizeof(Rtree)+nDb+nName*2+8);
221856 Rtree tree;
221864 memset(&tree, 0, sizeof(Rtree));
222322 Rtree *pRtree = (Rtree*)pVtab;
223649 Rtree *pRtree;
223663 pRtree = (Rtree *)sqlite3_malloc64(sizeof(Rtree)+nDb+nName*2+8);
223667 memset(pRtree, 0, sizeof(Rtree)+nDb+nName*2+8);
223771 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
223952 Rtree *pRtree = (Rtree *)cur->pVtab;
224012 Rtree *pRtree = (Rtree *)pVtab;