| /external/chromium_org/third_party/sqlite/src/ext/rtree/ |
| H A D | rtree.c | 226 ** formatted as a double. This macro assumes that local variable pRtree points
230 (pRtree->eCoordType==RTREE_COORD_REAL32) ? \
390 static void nodeZero(Rtree *pRtree, RtreeNode *p){ argument
391 memset(&p->zData[2], 0, pRtree->iNodeSize-2);
410 static RtreeNode *nodeHashLookup(Rtree *pRtree, i64 iNode){ argument
412 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
419 static void nodeHashInsert(Rtree *pRtree, RtreeNode *pNode){ argument
423 pNode->pNext = pRtree->aHash[iHash];
424 pRtree->aHash[iHash] = pNode;
430 static void nodeHashDelete(Rtree *pRtree, RtreeNod argument
446 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument
464 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
552 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
570 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
586 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
611 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
637 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
664 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
676 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
690 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
740 rtreeReference(Rtree *pRtree) argument
748 rtreeRelease(Rtree *pRtree) argument
776 Rtree *pRtree = (Rtree *)pVtab; local
840 Rtree *pRtree = (Rtree *)(cur->pVtab); local
864 testRtreeGeom( Rtree *pRtree, RtreeConstraint *pConstraint, RtreeCell *pCell, int *pbRes ) argument
892 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
946 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
991 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
1051 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument
1072 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument
1085 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
1130 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
1143 Rtree *pRtree = (Rtree *)cur->pVtab; local
1170 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
1238 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
1420 cellArea(Rtree *pRtree, RtreeCell *p) argument
1433 cellMargin(Rtree *pRtree, RtreeCell *p) argument
1445 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
1464 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
1482 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
1492 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
1533 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
1555 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
1648 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
1677 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
1687 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
1701 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
1719 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
1781 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
1813 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
1929 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
1989 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
2091 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
2143 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
2162 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
2308 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
2340 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
2389 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
2416 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
2447 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
2550 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
2589 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
2618 newRowid(Rtree *pRtree, i64 *piRowid) argument
2637 Rtree *pRtree = (Rtree *)pVtab; local
2797 Rtree *pRtree = (Rtree *)pVtab; local
2837 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
2946 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
2993 Rtree *pRtree; local
[all...] |
| /external/chromium_org/third_party/sqlite/amalgamation/ |
| H A D | sqlite3.c | 124658 nodeZero(Rtree *pRtree, RtreeNode *p) argument
124678 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
124687 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
124698 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
124714 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument
124732 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
124820 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
124838 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
124854 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
124879 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
124905 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
124932 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
124944 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
124958 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
125008 rtreeReference(Rtree *pRtree) argument
125016 rtreeRelease(Rtree *pRtree) argument
125044 Rtree *pRtree = (Rtree *)pVtab; local
125108 Rtree *pRtree = (Rtree *)(cur->pVtab); local
125132 testRtreeGeom( Rtree *pRtree, RtreeConstraint *pConstraint, RtreeCell *pCell, int *pbRes ) argument
125160 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
125214 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
125259 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
125319 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument
125340 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument
125353 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
125398 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
125411 Rtree *pRtree = (Rtree *)cur->pVtab; local
125438 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
125506 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
125688 cellArea(Rtree *pRtree, RtreeCell *p) argument
125701 cellMargin(Rtree *pRtree, RtreeCell *p) argument
125713 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
125732 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
125750 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
125760 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
125801 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
125823 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
125916 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
125945 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
125955 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
125969 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
125987 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
126049 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
126081 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
126197 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
126257 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
126359 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
126411 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
126430 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
126576 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
126608 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
126657 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
126684 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
126715 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
126818 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
126857 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
126886 newRowid(Rtree *pRtree, i64 *piRowid) argument
126905 Rtree *pRtree = (Rtree *)pVtab; local
127065 Rtree *pRtree = (Rtree *)pVtab; local
127105 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
127214 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
127261 Rtree *pRtree; local
[all...] |
| /external/sqlite/dist/orig/ |
| H A D | sqlite3.c | 145083 nodeZero(Rtree *pRtree, RtreeNode *p) argument
145100 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
145109 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
145120 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
145136 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument
145153 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
145241 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
145259 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
145274 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
145298 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
145323 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
145350 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
145362 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
145376 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
145431 rtreeReference(Rtree *pRtree) argument
145439 rtreeRelease(Rtree *pRtree) argument
145467 Rtree *pRtree = (Rtree *)pVtab; local
145531 Rtree *pRtree = (Rtree *)(cur->pVtab); local
145713 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument
145735 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument
145964 Rtree *pRtree = RTREE_OF_CURSOR(pCur); local
146061 Rtree *pRtree = (Rtree *)cur->pVtab; local
146095 findLeafNode( Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf, sqlite3_int64 *piNode ) argument
146172 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
146316 Rtree *pRtree = (Rtree*)tab; local
146387 cellArea(Rtree *pRtree, RtreeCell *p) argument
146400 cellMargin(Rtree *pRtree, RtreeCell *p) argument
146412 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
146431 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
146449 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
146458 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell ) argument
146490 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
146550 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
146579 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
146589 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
146682 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
146741 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
146839 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
146858 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
147005 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
147037 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
147086 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
147113 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
147144 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
147249 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
147284 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
147313 newRowid(Rtree *pRtree, i64 *piRowid) argument
147326 rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete) argument
147446 Rtree *pRtree = (Rtree *)pVtab; local
147562 Rtree *pRtree = (Rtree *)pVtab; local
147584 rtreeQueryStat1(sqlite3 *db, Rtree *pRtree) argument
147642 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
147753 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate, char **pzErr ) argument
147806 Rtree *pRtree; local
[all...] |
| /external/sqlite/dist/ |
| H A D | sqlite3.c | 145115 nodeZero(Rtree *pRtree, RtreeNode *p) argument
145132 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
145141 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
145152 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
145168 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument
145185 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
145273 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
145291 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
145306 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
145330 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
145355 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
145382 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
145394 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
145408 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
145463 rtreeReference(Rtree *pRtree) argument
145471 rtreeRelease(Rtree *pRtree) argument
145499 Rtree *pRtree = (Rtree *)pVtab; local
145563 Rtree *pRtree = (Rtree *)(cur->pVtab); local
145745 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument
145767 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument
145996 Rtree *pRtree = RTREE_OF_CURSOR(pCur); local
146093 Rtree *pRtree = (Rtree *)cur->pVtab; local
146127 findLeafNode( Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf, sqlite3_int64 *piNode ) argument
146204 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
146348 Rtree *pRtree = (Rtree*)tab; local
146419 cellArea(Rtree *pRtree, RtreeCell *p) argument
146432 cellMargin(Rtree *pRtree, RtreeCell *p) argument
146444 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
146463 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
146481 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
146490 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell ) argument
146522 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
146582 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
146611 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
146621 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
146714 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
146773 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
146871 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
146890 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
147037 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
147069 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
147118 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
147145 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
147176 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
147281 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
147316 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
147345 newRowid(Rtree *pRtree, i64 *piRowid) argument
147358 rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete) argument
147478 Rtree *pRtree = (Rtree *)pVtab; local
147594 Rtree *pRtree = (Rtree *)pVtab; local
147616 rtreeQueryStat1(sqlite3 *db, Rtree *pRtree) argument
147674 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
147785 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate, char **pzErr ) argument
147838 Rtree *pRtree; local
[all...] |