| H A D | sqlite3.c | 129965 nodeZero(Rtree *pRtree, RtreeNode *p) argument
129985 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
129994 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
130005 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
130021 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument
130039 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
130127 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
130145 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
130161 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
130186 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
130212 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
130239 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
130251 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
130265 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
130315 rtreeReference(Rtree *pRtree) argument
130323 rtreeRelease(Rtree *pRtree) argument
130351 Rtree *pRtree = (Rtree *)pVtab; local
130415 Rtree *pRtree = (Rtree *)(cur->pVtab); local
130439 testRtreeGeom( Rtree *pRtree, RtreeConstraint *pConstraint, RtreeCell *pCell, int *pbRes ) argument
130467 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
130521 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument
130566 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
130626 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument
130647 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument
130660 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
130705 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
130718 Rtree *pRtree = (Rtree *)cur->pVtab; local
130745 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
130813 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
130996 cellArea(Rtree *pRtree, RtreeCell *p) argument
131009 cellMargin(Rtree *pRtree, RtreeCell *p) argument
131021 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
131040 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
131058 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
131068 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
131109 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
131131 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
131228 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
131257 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
131267 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
131281 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
131299 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
131361 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
131393 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
131509 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
131569 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
131671 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
131723 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
131742 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
131888 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
131920 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
131969 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
131996 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
132027 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
132130 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
132169 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
132198 newRowid(Rtree *pRtree, i64 *piRowid) argument
132211 rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete) argument
132301 Rtree *pRtree = (Rtree *)pVtab; local
132414 Rtree *pRtree = (Rtree *)pVtab; local
132457 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
132566 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
132613 Rtree *pRtree; local
[all...] |