Searched defs:pRtree (Results 1 - 3 of 3) sorted by relevance

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/sqlite/
H A Dsqlite3.c116297 nodeZero(Rtree *pRtree, RtreeNode *p) argument
116319 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
116329 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
116342 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
116358 nodeNew(Rtree *pRtree, RtreeNode *pParent, int zero) argument
116376 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
116439 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
116457 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
116473 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
116499 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
116525 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
116552 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
116564 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
116578 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
116628 rtreeReference(Rtree *pRtree) argument
116636 rtreeRelease(Rtree *pRtree) argument
116664 Rtree *pRtree = (Rtree *)pVtab; local
116709 Rtree *pRtree = (Rtree *)(cur->pVtab); local
116735 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor) argument
116769 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor) argument
116801 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
116861 nodeRowidIndex(Rtree *pRtree, RtreeNode *pNode, i64 iRowid) argument
116873 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode) argument
116885 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
116923 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
116936 Rtree *pRtree = (Rtree *)cur->pVtab; local
116963 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
116986 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
117179 cellArea(Rtree *pRtree, RtreeCell *p) argument
117192 cellMargin(Rtree *pRtree, RtreeCell *p) argument
117204 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
117223 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
117241 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
117251 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
117286 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
117308 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
117392 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
117416 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
117426 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
117440 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
117458 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
117520 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
117552 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
117668 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
117728 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
117830 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
117882 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
117901 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118026 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
118046 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
118089 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
118112 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
118143 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118246 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118283 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
118312 newRowid(Rtree *pRtree, i64 *piRowid) argument
118323 hashIsEmpty(Rtree *pRtree) argument
118341 Rtree *pRtree = (Rtree *)pVtab; local
118499 Rtree *pRtree = (Rtree *)pVtab; local
118539 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
118648 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
118695 Rtree *pRtree; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/sqlite/
H A Dsqlite3.c116297 nodeZero(Rtree *pRtree, RtreeNode *p) argument
116319 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
116329 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
116342 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
116358 nodeNew(Rtree *pRtree, RtreeNode *pParent, int zero) argument
116376 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
116439 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
116457 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
116473 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
116499 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
116525 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
116552 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
116564 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
116578 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
116628 rtreeReference(Rtree *pRtree) argument
116636 rtreeRelease(Rtree *pRtree) argument
116664 Rtree *pRtree = (Rtree *)pVtab; local
116709 Rtree *pRtree = (Rtree *)(cur->pVtab); local
116735 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor) argument
116769 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor) argument
116801 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
116861 nodeRowidIndex(Rtree *pRtree, RtreeNode *pNode, i64 iRowid) argument
116873 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode) argument
116885 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
116923 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
116936 Rtree *pRtree = (Rtree *)cur->pVtab; local
116963 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
116986 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
117179 cellArea(Rtree *pRtree, RtreeCell *p) argument
117192 cellMargin(Rtree *pRtree, RtreeCell *p) argument
117204 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
117223 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
117241 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
117251 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
117286 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
117308 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
117392 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
117416 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
117426 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
117440 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
117458 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
117520 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
117552 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
117668 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
117728 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
117830 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
117882 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
117901 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118026 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
118046 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
118089 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
118112 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
118143 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118246 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118283 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
118312 newRowid(Rtree *pRtree, i64 *piRowid) argument
118323 hashIsEmpty(Rtree *pRtree) argument
118341 Rtree *pRtree = (Rtree *)pVtab; local
118499 Rtree *pRtree = (Rtree *)pVtab; local
118539 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
118648 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
118695 Rtree *pRtree; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/sqlite/
H A Dsqlite3.c116297 nodeZero(Rtree *pRtree, RtreeNode *p) argument
116319 nodeHashLookup(Rtree *pRtree, i64 iNode) argument
116329 nodeHashInsert(Rtree *pRtree, RtreeNode *pNode) argument
116342 nodeHashDelete(Rtree *pRtree, RtreeNode *pNode) argument
116358 nodeNew(Rtree *pRtree, RtreeNode *pParent, int zero) argument
116376 nodeAcquire( Rtree *pRtree, i64 iNode, RtreeNode *pParent, RtreeNode **ppNode ) argument
116439 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
116457 nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell) argument
116473 nodeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
116499 nodeWrite(Rtree *pRtree, RtreeNode *pNode) argument
116525 nodeRelease(Rtree *pRtree, RtreeNode *pNode) argument
116552 nodeGetRowid( Rtree *pRtree, RtreeNode *pNode, int iCell ) argument
116564 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
116578 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
116628 rtreeReference(Rtree *pRtree) argument
116636 rtreeRelease(Rtree *pRtree) argument
116664 Rtree *pRtree = (Rtree *)pVtab; local
116709 Rtree *pRtree = (Rtree *)(cur->pVtab); local
116735 testRtreeCell(Rtree *pRtree, RtreeCursor *pCursor) argument
116769 testRtreeEntry(Rtree *pRtree, RtreeCursor *pCursor) argument
116801 descendToCell( Rtree *pRtree, RtreeCursor *pCursor, int iHeight, int *pEof ) argument
116861 nodeRowidIndex(Rtree *pRtree, RtreeNode *pNode, i64 iRowid) argument
116873 nodeParentIndex(Rtree *pRtree, RtreeNode *pNode) argument
116885 Rtree *pRtree = (Rtree *)(pVtabCursor->pVtab); local
116923 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
116936 Rtree *pRtree = (Rtree *)cur->pVtab; local
116963 findLeafNode(Rtree *pRtree, i64 iRowid, RtreeNode **ppLeaf) argument
116986 Rtree *pRtree = (Rtree *)pVtabCursor->pVtab; local
117179 cellArea(Rtree *pRtree, RtreeCell *p) argument
117192 cellMargin(Rtree *pRtree, RtreeCell *p) argument
117204 cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
117223 cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2) argument
117241 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
117251 cellOverlap( Rtree *pRtree, RtreeCell *p, RtreeCell *aCell, int nCell, int iExclude ) argument
117286 cellOverlapEnlargement( Rtree *pRtree, RtreeCell *p, RtreeCell *pInsert, RtreeCell *aCell, int nCell, int iExclude ) argument
117308 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
117392 AdjustTree( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell ) argument
117416 rowidWrite(Rtree *pRtree, sqlite3_int64 iRowid, sqlite3_int64 iNode) argument
117426 parentWrite(Rtree *pRtree, sqlite3_int64 iNode, sqlite3_int64 iPar) argument
117440 LinearPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
117458 LinearPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
117520 QuadraticPickNext( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeCell *pLeftBox, RtreeCell *pRightBox, int *aiUsed ) argument
117552 QuadraticPickSeeds( Rtree *pRtree, RtreeCell *aCell, int nCell, int *piLeftSeed, int *piRightSeed ) argument
117668 SortByDimension( Rtree *pRtree, int *aIdx, int nIdx, int iDim, RtreeCell *aCell, int *aSpare ) argument
117728 splitNodeStartree( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
117830 splitNodeGuttman( Rtree *pRtree, RtreeCell *aCell, int nCell, RtreeNode *pLeft, RtreeNode *pRight, RtreeCell *pBboxLeft, RtreeCell *pBboxRight ) argument
117882 updateMapping( Rtree *pRtree, i64 iRowid, RtreeNode *pNode, int iHeight ) argument
117901 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118026 fixLeafParent(Rtree *pRtree, RtreeNode *pLeaf) argument
118046 removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight) argument
118089 fixBoundingBox(Rtree *pRtree, RtreeNode *pNode) argument
118112 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
118143 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118246 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
118283 reinsertNodeContent(Rtree *pRtree, RtreeNode *pNode) argument
118312 newRowid(Rtree *pRtree, i64 *piRowid) argument
118323 hashIsEmpty(Rtree *pRtree) argument
118341 Rtree *pRtree = (Rtree *)pVtab; local
118499 Rtree *pRtree = (Rtree *)pVtab; local
118539 rtreeSqlInit( Rtree *pRtree, sqlite3 *db, const char *zDb, const char *zPrefix, int isCreate ) argument
118648 getNodeSize( sqlite3 *db, Rtree *pRtree, int isCreate ) argument
118695 Rtree *pRtree; local
[all...]

Completed in 762 milliseconds