| /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 | 124837 nodeZero(Rtree *pRtree, RtreeNode *p) argument
124857 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
124866 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
124877 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
124893 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument
124911 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
124999 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
125017 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
125033 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
125058 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
125084 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
125111 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
125123 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
125137 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
125187 rtreeReference(Rtree *pRtree) argument
125195 rtreeRelease(Rtree *pRtree) argument
125223 Rtree *pRtree = (Rtree *)pVtab; local
125287 Rtree *pRtree = (Rtree *)(cur->pVtab); local
125311 testRtreeGeom( Rtree *pRtree, RtreeConstraint *pConstraint, RtreeCell *pCell, int *pbRes ) argument
125339 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
125393 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
125438 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
125498 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument
125519 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument
125532 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
125577 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
125590 Rtree *pRtree = (Rtree *)cur->pVtab; local
125617 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
125685 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
125867 cellArea(Rtree *pRtree, RtreeCell *p) argument
125880 cellMargin(Rtree *pRtree, RtreeCell *p) argument
125892 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
125911 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
125929 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
125939 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
125980 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
126002 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
126095 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
126124 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
126134 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
126148 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
126166 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
126228 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
126260 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
126376 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
126436 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
126538 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
126590 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
126609 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
126755 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
126787 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
126836 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
126863 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
126894 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
126997 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
127036 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
127065 newRowid(Rtree *pRtree, i64 *piRowid) argument
127084 Rtree *pRtree = (Rtree *)pVtab; local
127244 Rtree *pRtree = (Rtree *)pVtab; local
127284 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
127393 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
127440 Rtree *pRtree; local
[all...] |
| /external/sqlite/dist/orig/ |
| H A D | sqlite3.c | 130503 nodeZero(Rtree *pRtree, RtreeNode *p) argument
130523 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
130532 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
130543 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
130559 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument
130577 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
130665 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
130683 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
130699 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
130724 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
130750 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
130777 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
130789 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
130803 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
130853 rtreeReference(Rtree *pRtree) argument
130861 rtreeRelease(Rtree *pRtree) argument
130889 Rtree *pRtree = (Rtree *)pVtab; local
130953 Rtree *pRtree = (Rtree *)(cur->pVtab); local
130977 testRtreeGeom( Rtree *pRtree, RtreeConstraint *pConstraint, RtreeCell *pCell, int *pbRes ) argument
131005 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
131059 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
131104 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
131164 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument
131185 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument
131198 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
131243 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
131256 Rtree *pRtree = (Rtree *)cur->pVtab; local
131283 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
131351 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
131534 cellArea(Rtree *pRtree, RtreeCell *p) argument
131547 cellMargin(Rtree *pRtree, RtreeCell *p) argument
131559 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
131578 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
131596 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
131606 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
131647 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
131669 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
131766 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
131795 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
131805 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
131819 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
131837 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
131899 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
131931 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
132047 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
132107 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
132209 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
132261 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
132280 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
132426 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
132458 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
132507 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
132534 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
132565 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
132668 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
132707 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
132736 newRowid(Rtree *pRtree, i64 *piRowid) argument
132749 rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete) argument
132839 Rtree *pRtree = (Rtree *)pVtab; local
132952 Rtree *pRtree = (Rtree *)pVtab; local
132995 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
133104 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
133151 Rtree *pRtree; local
[all...] |
| /external/sqlite/dist/ |
| H A D | sqlite3.c | 130549 nodeZero(Rtree *pRtree, RtreeNode *p) argument
130569 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
130578 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
130589 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
130605 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument
130623 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
130711 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
130729 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
130745 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
130770 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
130796 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
130823 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
130835 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
130849 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
130899 rtreeReference(Rtree *pRtree) argument
130907 rtreeRelease(Rtree *pRtree) argument
130935 Rtree *pRtree = (Rtree *)pVtab; local
130999 Rtree *pRtree = (Rtree *)(cur->pVtab); local
131023 testRtreeGeom( Rtree *pRtree, RtreeConstraint *pConstraint, RtreeCell *pCell, int *pbRes ) argument
131051 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
131105 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
131150 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
131210 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument
131231 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument
131244 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
131289 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
131302 Rtree *pRtree = (Rtree *)cur->pVtab; local
131329 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
131397 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
131580 cellArea(Rtree *pRtree, RtreeCell *p) argument
131593 cellMargin(Rtree *pRtree, RtreeCell *p) argument
131605 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
131624 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
131642 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
131652 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
131693 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
131715 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
131812 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
131841 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
131851 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
131865 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
131883 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
131945 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
131977 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
132093 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
132153 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
132255 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
132307 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
132326 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
132472 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
132504 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
132553 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
132580 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
132611 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
132714 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
132753 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
132782 newRowid(Rtree *pRtree, i64 *piRowid) argument
132795 rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete) argument
132885 Rtree *pRtree = (Rtree *)pVtab; local
132998 Rtree *pRtree = (Rtree *)pVtab; local
133041 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
133150 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
133197 Rtree *pRtree; local
[all...] |