Cross Reference: /external/sqlite/dist/orig/sqlite3.c

Lines Matching refs:Rtree
144727 typedef struct Rtree Rtree;
144740 /* Size of hash table Rtree.aHash. This hash table is not expected to
144759 struct Rtree {
144798 /* Possible values for Rtree.eCoordType: */
144879   RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */
144883 /* Return the Rtree of a RtreeCursor */
144884 #define RTREE_OF_CURSOR(X)   ((Rtree*)((X)->base.pVtab))
144899 ** variable pRtree points to the Rtree structure associated with the
145083 static void nodeZero(Rtree *pRtree, RtreeNode *p){
145090 ** in the Rtree.aHash table.
145100 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
145109 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
145120 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
145136 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
145154   Rtree *pRtree,             /* R-tree structure */
145242   Rtree *pRtree,             /* The overall R-Tree */
145259 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
145275   Rtree *pRtree,                /* The overall R-Tree */
145298 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){
145323 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){
145351   Rtree *pRtree,       /* The overall R-Tree */
145363   Rtree *pRtree,               /* The overall R-Tree */
145377   Rtree *pRtree,               /* The overall R-Tree */
145403 ** Rtree virtual table module xCreate method.
145416 ** Rtree virtual table module xConnect method.
145431 static void rtreeReference(Rtree *pRtree){
145439 static void rtreeRelease(Rtree *pRtree){
145456 ** Rtree virtual table module xDisconnect method.
145459   rtreeRelease((Rtree *)pVtab);
145464 ** Rtree virtual table module xDestroy method.
145467   Rtree *pRtree = (Rtree *)pVtab;
145491 ** Rtree virtual table module xOpen method.
145528 ** Rtree virtual table module xClose method.
145531   Rtree *pRtree = (Rtree *)(cur->pVtab);
145542 ** Rtree virtual table module xEof method.
145714   Rtree *pRtree, 
145735 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
145964   Rtree *pRtree = RTREE_OF_CURSOR(pCur);
146030 ** Rtree virtual table module xNext method.
146044 ** Rtree virtual table module xRowid method.
146058 ** Rtree virtual table module xColumn method.
146061   Rtree *pRtree = (Rtree *)cur->pVtab;
146096   Rtree *pRtree,              /* RTree to search */
146165 ** Rtree virtual table module xFilter method.
146172   Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
146282 ** Rtree virtual table module xBestIndex method. There are three
146316   Rtree *pRtree = (Rtree*)tab;
146387 static RtreeDValue cellArea(Rtree *pRtree, RtreeCell *p){
146400 static RtreeDValue cellMargin(Rtree *pRtree, RtreeCell *p){
146412 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
146431 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
146449 static RtreeDValue cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){
146459   Rtree *pRtree, 
146491   Rtree *pRtree,               /* Rtree table */
146551   Rtree *pRtree,                    /* Rtree table */
146579 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
146589 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
146596 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
146683   Rtree *pRtree,
146742   Rtree *pRtree,
146840   Rtree *pRtree, 
146845   int (*xSetMapping)(Rtree *, sqlite3_int64, sqlite3_int64);
146859   Rtree *pRtree,
147005 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
147035 static int deleteCell(Rtree *, RtreeNode *, int, int);
147037 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
147075   ** the Rtree.pDeleted list. Its contents will be re-inserted later on.
147086 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
147113 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
147145   Rtree *pRtree, 
147250   Rtree *pRtree,
147284 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
147313 static int newRowid(Rtree *pRtree, i64 *piRowid){
147326 static int rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete){
147333   /* Obtain a reference to the root node to initialize Rtree.iDepth */
147446   Rtree *pRtree = (Rtree *)pVtab;
147562   Rtree *pRtree = (Rtree *)pVtab;
147584 static int rtreeQueryStat1(sqlite3 *db, Rtree *pRtree){
147643   Rtree *pRtree, 
147755   Rtree *pRtree,                  /* Rtree handle */
147806   Rtree *pRtree;
147829   pRtree = (Rtree *)sqlite3_malloc(sizeof(Rtree)+nDb+nName+2);
147833   memset(pRtree, 0, sizeof(Rtree)+nDb+nName+2);
147907   Rtree tree;
147912   memset(&tree, 0, sizeof(Rtree));