H A D | sqlite3.c | 127419 nodeZero(Rtree *pRtree, RtreeNode *p) argument 127439 nodeHashLookup(Rtree *pRtree, i64 iNode) argument 127448 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument 127459 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument 127475 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument 127493 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument 127581 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument 127599 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument 127615 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument 127640 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument 127666 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument 127693 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument 127705 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument 127719 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument 127769 rtreeReference(Rtree *pRtree) argument 127777 rtreeRelease(Rtree *pRtree) argument 127805 Rtree *pRtree = (Rtree *)pVtab; local 127869 Rtree *pRtree = (Rtree *)(cur->pVtab); local 127893 testRtreeGeom( Rtree *pRtree, RtreeConstraint *pConstraint, RtreeCell *pCell, int *pbRes ) argument 127921 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument 127975 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor, int *pbEof) argument 128020 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument 128080 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument 128101 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument 128114 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local 128159 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local 128172 Rtree *pRtree = (Rtree *)cur->pVtab; local 128199 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument 128267 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local 128449 cellArea(Rtree *pRtree, RtreeCell *p) argument 128462 cellMargin(Rtree *pRtree, RtreeCell *p) argument 128474 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument 128493 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument 128511 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument 128521 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument 128562 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument 128584 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument 128677 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument 128706 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument 128716 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument 128730 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument 128748 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument 128810 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument 128842 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument 128958 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument 129018 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument 129120 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument 129172 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument 129191 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument 129337 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument 129369 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument 129418 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument 129445 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument 129476 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument 129579 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument 129618 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument 129647 newRowid(Rtree *pRtree, i64 *piRowid) argument 129660 rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete) argument 129750 Rtree *pRtree = (Rtree *)pVtab; local 129863 Rtree *pRtree = (Rtree *)pVtab; local 129906 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument 130015 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument 130062 Rtree *pRtree; local [all...] |
H A D | sqlite3.c | 191786 nodeZero(Rtree *pRtree, RtreeNode *p) argument 191803 nodeHashLookup(Rtree *pRtree, i64 iNode) argument 191812 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument 191823 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument 191839 nodeNew(Rtree *pRtree, RtreeNode *pParent) argument 191857 nodeBlobReset(Rtree *pRtree) argument 191880 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument 192000 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument 192018 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument 192033 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument 192057 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument 192083 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument 192112 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument 192124 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument 192138 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument 192195 rtreeReference(Rtree *pRtree) argument 192203 rtreeRelease(Rtree *pRtree) argument 192236 Rtree *pRtree = (Rtree *)pVtab; local 192265 Rtree *pRtree = (Rtree *)pVTab; local 192285 Rtree *pRtree = (Rtree *)(pCsr->base.pVtab); local 192313 Rtree *pRtree = (Rtree *)(cur->pVtab); local 192539 nodeRowidIndex( Rtree *pRtree, RtreeNode *pNode, i64 iRowid, int *piIndex ) argument 192562 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode, int *piIndex) argument 192791 Rtree *pRtree = RTREE_OF_CURSOR(pCur); local 192903 Rtree *pRtree = (Rtree *)cur->pVtab; local 192956 findLeafNode( Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf, sqlite3_int64 *piNode ) argument 193017 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local 193163 Rtree *pRtree = (Rtree*)tab; local 193251 cellArea(Rtree *pRtree, RtreeCell *p) argument 193281 cellMargin(Rtree *pRtree, RtreeCell *p) argument 193294 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument 193315 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument 193333 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument 193342 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell ) argument 193374 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument 193434 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument 193465 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument 193475 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument 193568 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument 193627 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument 193725 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument 193744 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument 193891 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument 193926 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument 193975 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument 194002 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument 194033 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument 194138 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument 194173 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument 194202 rtreeNewRowid(Rtree *pRtree, i64 *piRowid) argument 194215 rtreeDeleteRowid(Rtree *pRtree, sqlite3_int64 iDelete) argument 194343 rtreeConstraintError(Rtree *pRtree, int iCol) argument 194387 Rtree *pRtree = (Rtree *)pVtab; local 194530 Rtree *pRtree = (Rtree *)pVtab; local 194541 Rtree *pRtree = (Rtree *)pVtab; local 194551 Rtree *pRtree = (Rtree *)pVtab; local 194584 Rtree *pRtree = (Rtree *)pVtab; local 194598 rtreeQueryStat1(sqlite3 *db, Rtree *pRtree) argument 194680 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument 194840 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate, char **pzErr ) argument 194906 Rtree *pRtree; local 196794 Rtree *pRtree; local 196911 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local 197089 Rtree *pRtree = (Rtree *)cur->pVtab; local 197149 Rtree *pRtree = (Rtree *)pVtab; local [all...] |