contrib/sqlite3/sqlite3.c

191289 typedef struct Rtree Rtree;
191305 /* Size of hash table Rtree.aHash. This hash table is not expected to
191324 struct Rtree {
191378 /* Possible values for Rtree.eCoordType: */
191398 ** Set the Rtree.bCorrupt flag
191470   RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */
191474 /* Return the Rtree of a RtreeCursor */
191475 #define RTREE_OF_CURSOR(X)   ((Rtree*)((X)->base.pVtab))
191490 ** variable pRtree points to the Rtree structure associated with the
191786 static void nodeZero(Rtree *pRtree, RtreeNode *p){
191793 ** in the Rtree.aHash table.
191803 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){
191812 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){
191823 static void nodeHashDelete(Rtree *pRtree, RtreeNode *pNode){
191839 static RtreeNode *nodeNew(Rtree *pRtree, RtreeNode *pParent){
191855 ** Clear the Rtree.pNodeBlob object
191857 static void nodeBlobReset(Rtree *pRtree){
191881   Rtree *pRtree,             /* R-tree structure */
192001   Rtree *pRtree,             /* The overall R-Tree */
192018 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
192034   Rtree *pRtree,                /* The overall R-Tree */
192057 static int nodeWrite(Rtree *pRtree, RtreeNode *pNode){
192083 static int nodeRelease(Rtree *pRtree, RtreeNode *pNode){
192113   Rtree *pRtree,       /* The overall R-Tree */
192125   Rtree *pRtree,               /* The overall R-Tree */
192139   Rtree *pRtree,               /* The overall R-Tree */
192167 ** Rtree virtual table module xCreate method.
192180 ** Rtree virtual table module xConnect method.
192195 static void rtreeReference(Rtree *pRtree){
192203 static void rtreeRelease(Rtree *pRtree){
192225 ** Rtree virtual table module xDisconnect method.
192228   rtreeRelease((Rtree *)pVtab);
192233 ** Rtree virtual table module xDestroy method.
192236   Rtree *pRtree = (Rtree *)pVtab;
192261 ** Rtree virtual table module xOpen method.
192265   Rtree *pRtree = (Rtree *)pVTab;
192285   Rtree *pRtree = (Rtree *)(pCsr->base.pVtab);
192310 ** Rtree virtual table module xClose method.
192313   Rtree *pRtree = (Rtree *)(cur->pVtab);
192325 ** Rtree virtual table module xEof method.
192540   Rtree *pRtree,
192562 static int nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex){
192791   Rtree *pRtree = RTREE_OF_CURSOR(pCur);
192868 ** Rtree virtual table module xNext method.
192886 ** Rtree virtual table module xRowid method.
192900 ** Rtree virtual table module xColumn method.
192903   Rtree *pRtree = (Rtree *)cur->pVtab;
192957   Rtree *pRtree,              /* RTree to search */
193010 ** Rtree virtual table module xFilter method.
193017   Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
193129 ** Rtree virtual table module xBestIndex method. There are three
193163   Rtree *pRtree = (Rtree*)tab;
193251 static RtreeDValue cellArea(Rtree *pRtree, RtreeCell *p){
193281 static RtreeDValue cellMargin(Rtree *pRtree, RtreeCell *p){
193294 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
193315 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){
193333 static RtreeDValue cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){
193343   Rtree *pRtree,
193375   Rtree *pRtree,               /* Rtree table */
193435   Rtree *pRtree,                    /* Rtree table */
193465 static int rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode){
193475 static int parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar){
193482 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
193569   Rtree *pRtree,
193628   Rtree *pRtree,
193726   Rtree *pRtree,
193731   int (*xSetMapping)(Rtree *, sqlite3_int64, sqlite3_int64);
193745   Rtree *pRtree,
193891 static int fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf){
193924 static int deleteCell(Rtree *, RtreeNode *, int, int);
193926 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){
193964   ** the Rtree.pDeleted list. Its contents will be re-inserted later on.
193975 static int fixBoundingBox(Rtree *pRtree, RtreeNode *pNode){
194002 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
194034   Rtree *pRtree,
194139   Rtree *pRtree,
194173 static int reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode){
194202 static int rtreeNewRowid(Rtree *pRtree, i64 *piRowid){
194215 static int rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete){
194222   /* Obtain a reference to the root node to initialize Rtree.iDepth */
194343 static int rtreeConstraintError(Rtree *pRtree, int iCol){
194387   Rtree *pRtree = (Rtree *)pVtab;
194530   Rtree *pRtree = (Rtree *)pVtab;
194541   Rtree *pRtree = (Rtree *)pVtab;
194551   Rtree *pRtree = (Rtree *)pVtab;
194584   Rtree *pRtree = (Rtree *)pVtab;
194598 static int rtreeQueryStat1(sqlite3 *db, Rtree *pRtree){
194681   Rtree *pRtree,
194842   Rtree *pRtree,                  /* Rtree handle */
194906   Rtree *pRtree;
194934   pRtree = (Rtree *)sqlite3_malloc64(sizeof(Rtree)+nDb+nName+2);
194938   memset(pRtree, 0, sizeof(Rtree)+nDb+nName+2);
195036   Rtree tree;
195044   memset(&tree, 0, sizeof(Rtree));
195365           rtreeCheckAppendMsg(pCheck, "Rtree depth out of range (%d)", iDepth);
196794   Rtree *pRtree;
196806   pRtree = (Rtree *)sqlite3_malloc64(sizeof(Rtree)+nDb+nName+2);
196810   memset(pRtree, 0, sizeof(Rtree)+nDb+nName+2);
196911   Rtree *pRtree = (Rtree *)pVtabCursor->pVtab;
197024 ** Rtree virtual table module xBestIndex method. There are three
197089   Rtree *pRtree = (Rtree *)cur->pVtab;
197149   Rtree *pRtree = (Rtree *)pVtab;