Lines Matching refs:iCell

49129 static u8 *findOverflowCell(MemPage *pPage, int iCell){
49137     if( k<=iCell ){
49138       if( k==iCell ){
49141       iCell--;
49144   return findCell(pPage, iCell);
49222 #define parseCell(pPage, iCell, pInfo) \
49223   btreeParseCellPtr((pPage), findCell((pPage), (iCell)), (pInfo))
49226   int iCell,              /* The cell index.  First cell is 0 */
49229   parseCell(pPage, iCell, pInfo);
49294 static u16 cellSize(MemPage *pPage, int iCell){
49295   return cellSizePtr(pPage, findCell(pPage, iCell));
127242   int iCell;                        /* Index of current cell in pNode */
127585   int iCell
127588   u8 *p = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];
127599 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){
127600   u8 *pDst = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];
127602   int nByte = (NCELL(pNode) - iCell - 1) * pRtree->nBytesPerCell;
127696   int iCell
127698   assert( iCell<NCELL(pNode) );
127699   return readInt64(&pNode->zData[4 + pRtree->nBytesPerCell*iCell]);
127708   int iCell,
127712   readCoord(&pNode->zData[12 + pRtree->nBytesPerCell*iCell + 4*iCoord], pCoord);
127722   int iCell,
127726   pCell->iRowid = nodeGetRowid(pRtree, pNode, iCell);
127728     nodeGetCoord(pRtree, pNode, iCell, ii, &pCell->aCoord[ii]);
127927   nodeGetCell(pRtree, pCursor->pNode, pCursor->iCell, &cell);
127980   nodeGetCell(pRtree, pCursor->pNode, pCursor->iCell, &cell);
128033   int iSavedCell = pCursor->iCell;
128046   iRowid = nodeGetRowid(pRtree, pCursor->pNode, pCursor->iCell);
128056     pCursor->iCell = ii;
128068     pCursor->iCell = iSavedCell;
128134       for(pCsr->iCell++; pCsr->iCell<nCell; pCsr->iCell++){
128142       rc = nodeParentIndex(pRtree, pNode, &pCsr->iCell);
128163   *pRowid = nodeGetRowid(pRtree, pCsr->pNode, pCsr->iCell);
128176     i64 iRowid = nodeGetRowid(pRtree, pCsr->pNode, pCsr->iCell);
128180     nodeGetCoord(pRtree, pCsr->pNode, pCsr->iCell, i-1, &c);
128287       rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &pCsr->iCell);
128329       for(pCsr->iCell=0; rc==SQLITE_OK && pCsr->iCell<nCell; pCsr->iCell++){
128341       assert( rc!=SQLITE_OK || !pCsr->pNode || pCsr->iCell<NCELL(pCsr->pNode) );
128596     int iCell;
128629     for(iCell=0; iCell<nCell; iCell++){
128634       nodeGetCell(pRtree, pNode, iCell, &cell);
128640         overlap = cellOverlapEnlargement(pRtree,&cell,pCell,aCell,nCell,iCell);
128642       if( (iCell==0) 
128650       if( iCell==0||growth<fMinGrowth||(growth==fMinGrowth && area<fMinArea) ){
128686     int iCell;
128688     if( nodeParentIndex(pRtree, p, &iCell) ){
128692     nodeGetCell(pRtree, pParent, iCell, &cell);
128695       nodeOverwriteCell(pRtree, pParent, &cell, iCell);
129274     int iCell;
129275     rc = nodeParentIndex(pRtree, pLeft, &iCell);
129277       nodeOverwriteCell(pRtree, pParent, &leftbbox, iCell);
129373   int iCell;
129378   rc = nodeParentIndex(pRtree, pNode, &iCell);
129382     rc = deleteCell(pRtree, pParent, iCell, iHeight+1);
129445 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){
129456   nodeDeleteCell(pRtree, pNode, iCell);
129663   int iCell;                      /* Index of iDelete cell in pLeaf */
129680     rc = nodeRowidIndex(pRtree, pLeaf, iDelete, &iCell);
129682       rc = deleteCell(pRtree, pLeaf, iCell, 0);