Searched defs:iCell (Results 1 - 7 of 7) sorted by relevance

/external/chromium_org/third_party/sqlite/src/src/
H A Dtest_stat.c97 int iCell; member in struct:StatPage
388 pCsr->aPage[0].iCell = 0;
400 while( p->iCell<p->nCell ){
401 StatCell *pCell = &p->aCell[p->iCell];
410 "%s%.3x+%.6x", p->zPath, p->iCell, pCell->iOvfl
423 p->iCell++;
426 while( !p->iRightChildPg || p->iCell>p->nCell ){
435 if( p->iCell==p->nCell ){
438 p[1].iPgno = p->aCell[p->iCell].iChildPg;
441 p[1].iCell
[all...]
H A Drecover.c1088 unsigned iCell; /* Current cell. */ member in struct:RecoverLeafCursor
1090 /* Info parsed from data in iCell. */
1127 pCursor->iCell = pCursor->nCells = 0;
1153 pCursor->iCell = 0;
1275 /* Setup the cursor for reading the information from cell iCell. */
1279 unsigned iCellOffset; /* Offset of current cell (iCell). */
1281 unsigned nCellMaxBytes; /* Maximum local size of iCell. */
1282 unsigned iEndOffset; /* End of iCell's in-page data. */
1284 u64 iRowid; /* iCell's rowid (in table). */
1293 assert( pCursor->iCell<pCurso
[all...]
H A Dbtree.c859 static u8 *findOverflowCell(MemPage *pPage, int iCell){ argument
867 if( k<=iCell ){
868 if( k==iCell ){
871 iCell--;
874 return findCell(pPage, iCell);
952 #define parseCell(pPage, iCell, pInfo) \
953 btreeParseCellPtr((pPage), findCell((pPage), (iCell)), (pInfo))
956 int iCell, /* The cell index. First cell is 0 */
959 parseCell(pPage, iCell, pInfo);
1024 static u16 cellSize(MemPage *pPage, int iCell){ argument
954 btreeParseCell( MemPage *pPage, int iCell, CellInfo *pInfo ) argument
[all...]
/external/chromium_org/third_party/sqlite/src/ext/rtree/
H A Drtree.c213 int iCell; /* Index of current cell in pNode */ member in struct:RtreeCursor
550 ** Overwrite cell iCell of node pNode with the contents of pCell.
556 int iCell
559 u8 *p = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];
568 ** Remove cell the cell with index iCell from node pNode.
570 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){ argument
571 u8 *pDst = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];
573 int nByte = (NCELL(pNode) - iCell - 1) * pRtree->nBytesPerCell;
660 ** Return the 64-bit integer value associated with cell iCell of
667 int iCell
676 nodeGetCoord( Rtree *pRtree, RtreeNode *pNode, int iCell, int iCoord, RtreeCoord *pCoord ) argument
690 nodeGetCell( Rtree *pRtree, RtreeNode *pNode, int iCell, RtreeCell *pCell ) argument
1567 int iCell; local
1657 int iCell; local
2245 int iCell; local
2344 int iCell; local
2416 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
2651 int iCell; /* Index of iDelete cell in pLeaf */ local
[all...]
/external/chromium_org/third_party/sqlite/amalgamation/
H A Dsqlite3.c48157 findOverflowCell(MemPage *pPage, int iCell) argument
48252 btreeParseCell( MemPage *pPage, int iCell, CellInfo *pInfo ) argument
48322 cellSize(MemPage *pPage, int iCell) argument
111541 unsigned iCell; /* Current cell. */ member in struct:RecoverLeafCursor
124660 int iCell; /* Index of current cell in pNode */ member in struct:RtreeCursor
125017 nodeDeleteCell(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
126014 int iCell; local
126104 int iCell; local
126692 int iCell; local
126791 int iCell; local
126863 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
127098 int iCell; /* Index of iDelete cell in pLeaf */ local
[all...]
/external/sqlite/dist/orig/
H A Dsqlite3.c50232 findOverflowCell(MemPage *pPage, int iCell) argument
50325 btreeParseCell( MemPage *pPage, int iCell, CellInfo *pInfo ) argument
50395 cellSize(MemPage *pPage, int iCell) argument
130326 int iCell; /* Index of current cell in pNode */ member in struct:RtreeCursor
130683 nodeDeleteCell(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
131681 int iCell; local
131775 int iCell; local
132363 int iCell; local
132462 int iCell; local
132534 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
132752 int iCell; /* Index of iDelete cell in pLeaf */ local
[all...]
/external/sqlite/dist/
H A Dsqlite3.c50260 findOverflowCell(MemPage *pPage, int iCell) argument
50353 btreeParseCell( MemPage *pPage, int iCell, CellInfo *pInfo ) argument
50423 cellSize(MemPage *pPage, int iCell) argument
130372 int iCell; /* Index of current cell in pNode */ member in struct:RtreeCursor
130729 nodeDeleteCell(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
131727 int iCell; local
131821 int iCell; local
132409 int iCell; local
132508 int iCell; local
132580 deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight) argument
132798 int iCell; /* Index of iDelete cell in pLeaf */ local
[all...]

Completed in 424 milliseconds