Lines Matching refs:iCell
50260 static u8 *findOverflowCell(MemPage *pPage, int iCell){
50266 if( k<=iCell ){
50267 if( k==iCell ){
50270 iCell--;
50273 return findCell(pPage, iCell);
50351 #define parseCell(pPage, iCell, pInfo) \
50352 btreeParseCellPtr((pPage), findCell((pPage), (iCell)), (pInfo))
50355 int iCell, /* The cell index. First cell is 0 */
50358 parseCell(pPage, iCell, pInfo);
50423 static u16 cellSize(MemPage *pPage, int iCell){
50424 return cellSizePtr(pPage, findCell(pPage, iCell));
130374 int iCell; /* Index of current cell in pNode */
130711 ** Overwrite cell iCell of node pNode with the contents of pCell.
130717 int iCell
130720 u8 *p = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];
130729 ** Remove cell the cell with index iCell from node pNode.
130731 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
130732 u8 *pDst = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];
130734 int nByte = (NCELL(pNode) - iCell - 1) * pRtree->nBytesPerCell;
130821 ** Return the 64-bit integer value associated with cell iCell of
130828 int iCell
130830 assert( iCell<NCELL(pNode) );
130831 return readInt64(&pNode->zData[4 + pRtree->nBytesPerCell*iCell]);
130835 ** Return coordinate iCoord from cell iCell in node pNode.
130840 int iCell,
130844 readCoord(&pNode->zData[12 + pRtree->nBytesPerCell*iCell + 4*iCoord], pCoord);
130848 ** Deserialize cell iCell of node pNode. Populate the structure pointed
130854 int iCell,
130858 pCell->iRowid = nodeGetRowid(pRtree, pNode, iCell);
130860 nodeGetCoord(pRtree, pNode, iCell, ii, &pCell->aCoord[ii]);
131059 nodeGetCell(pRtree, pCursor->pNode, pCursor->iCell, &cell);
131112 nodeGetCell(pRtree, pCursor->pNode, pCursor->iCell, &cell);
131165 int iSavedCell = pCursor->iCell;
131178 iRowid = nodeGetRowid(pRtree, pCursor->pNode, pCursor->iCell);
131188 pCursor->iCell = ii;
131200 pCursor->iCell = iSavedCell;
131266 for(pCsr->iCell++; pCsr->iCell<nCell; pCsr->iCell++){
131274 rc = nodeParentIndex(pRtree, pNode, &pCsr->iCell);
131295 *pRowid = nodeGetRowid(pRtree, pCsr->pNode, pCsr->iCell);
131308 i64 iRowid = nodeGetRowid(pRtree, pCsr->pNode, pCsr->iCell);
131312 nodeGetCoord(pRtree, pCsr->pNode, pCsr->iCell, i-1, &c);
131419 rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &pCsr->iCell);
131462 for(pCsr->iCell=0; rc==SQLITE_OK && pCsr->iCell<nCell; pCsr->iCell++){
131474 assert( rc!=SQLITE_OK || !pCsr->pNode || pCsr->iCell<NCELL(pCsr->pNode) );
131729 int iCell;
131765 for(iCell=0; iCell<nCell; iCell++){
131769 nodeGetCell(pRtree, pNode, iCell, &cell);
131775 overlap = cellOverlapEnlargement(pRtree,&cell,pCell,aCell,nCell,iCell);
131779 if( (iCell==0)
131788 if( iCell==0||growth<fMinGrowth||(growth==fMinGrowth && area<fMinArea) ){
131823 int iCell;
131825 if( nodeParentIndex(pRtree, p, &iCell) ){
131829 nodeGetCell(pRtree, pParent, iCell, &cell);
131832 nodeOverwriteCell(pRtree, pParent, &cell, iCell);
132411 int iCell;
132412 rc = nodeParentIndex(pRtree, pLeft, &iCell);
132414 nodeOverwriteCell(pRtree, pParent, &leftbbox, iCell);
132510 int iCell;
132515 rc = nodeParentIndex(pRtree, pNode, &iCell);
132519 rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
132579 ** Delete the cell at index iCell of node pNode. After removing the
132582 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
132593 nodeDeleteCell(pRtree, pNode, iCell);
132800 int iCell; /* Index of iDelete cell in pLeaf */
132817 rc = nodeRowidIndex(pRtree, pLeaf, iDelete, &iCell);
132819 rc = deleteCell(pRtree, pLeaf, iCell, 0);
