243   u8 iCell;              /* Cell index within the node */  member
813   int iCell                  /* Index into pNode into which pCell is written */  in nodeOverwriteCell()  argument
816   u8 *p = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];  in nodeOverwriteCell()
827 static void nodeDeleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell){  in nodeDeleteCell()  argument
828   u8 *pDst = &pNode->zData[4 + pRtree->nBytesPerCell*iCell];  in nodeDeleteCell()
830   int nByte = (NCELL(pNode) - iCell - 1) * pRtree->nBytesPerCell;  in nodeDeleteCell()
924   int iCell            /* The cell index from which to extract the ID */  in nodeGetRowid()  argument
926   assert( iCell<NCELL(pNode) );  in nodeGetRowid()
927   return readInt64(&pNode->zData[4 + pRtree->nBytesPerCell*iCell]);  in nodeGetRowid()
936   int iCell,                   /* The index of the cell within the node */  in nodeGetCoord()  argument
940   readCoord(&pNode->zData[12 + pRtree->nBytesPerCell*iCell + 4*iCoord], pCoord);  in nodeGetCoord()
950   int iCell,                   /* Index of the cell within the node */  in nodeGetCell()  argument
956   pCell->iRowid = nodeGetRowid(pRtree, pNode, iCell);  in nodeGetCell()
957   pData = pNode->zData + (12 + pRtree->nBytesPerCell*iCell);  in nodeGetCell()
1534     p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
1628     pCellData = pNode->zData + (4+pRtree->nBytesPerCell*p->iCell);  in rtreeStepToLeaf()
1629     while( p->iCell<nCell ){  in rtreeStepToLeaf()
1644           p->iCell++;  in rtreeStepToLeaf()
1650       p->iCell++;  in rtreeStepToLeaf()
1660         x.iCell = 0;  in rtreeStepToLeaf()
1663         x.iCell = p->iCell - 1;  in rtreeStepToLeaf()
1665       if( p->iCell>=nCell ){  in rtreeStepToLeaf()
1674       p->iCell = x.iCell;  in rtreeStepToLeaf()
1678     if( p->iCell>=nCell ){  in rtreeStepToLeaf()
1714     *pRowid = nodeGetRowid(RTREE_OF_CURSOR(pCsr), pNode, p->iCell);  in rtreeRowid()
1733     sqlite3_result_int64(ctx, nodeGetRowid(pRtree, pNode, p->iCell));  in rtreeColumn()
1735     nodeGetCoord(pRtree, pNode, p->iCell, i-1, &c);  in rtreeColumn()
1753           nodeGetRowid(pRtree, pNode, p->iCell));  in rtreeColumn()
1842   int iCell = 0;  in rtreeFilter()  local
1871       rc = nodeRowidIndex(pRtree, pLeaf, iRowid, &iCell);  in rtreeFilter()
1872       p->iCell = (u8)iCell;  in rtreeFilter()
1936       pNew->iCell = 0;  in rtreeFilter()
2209     int iCell;  in ChooseLeaf()  local
2225     for(iCell=0; iCell<nCell; iCell++){  in ChooseLeaf()
2229       nodeGetCell(pRtree, pNode, iCell, &cell);  in ChooseLeaf()
2232       if( iCell==0||growth<fMinGrowth||(growth==fMinGrowth && area<fMinArea) ){  in ChooseLeaf()
2268     int iCell;  in AdjustTree()  local
2275     rc = nodeParentIndex(pRtree, p, &iCell);  in AdjustTree()
2281     nodeGetCell(pRtree, pParent, iCell, &cell);  in AdjustTree()
2284       nodeOverwriteCell(pRtree, pParent, &cell, iCell);  in AdjustTree()
2663     int iCell;  in SplitNode()  local
2664     rc = nodeParentIndex(pRtree, pLeft, &iCell);  in SplitNode()
2666       nodeOverwriteCell(pRtree, pParent, &leftbbox, iCell);  in SplitNode()
2766   int iCell;  in removeNode()  local
2771   rc = nodeParentIndex(pRtree, pNode, &iCell);  in removeNode()
2775     rc = deleteCell(pRtree, pParent, iCell, iHeight+1);  in removeNode()
2839 static int deleteCell(Rtree *pRtree, RtreeNode *pNode, int iCell, int iHeight){  in deleteCell()  argument
2850   nodeDeleteCell(pRtree, pNode, iCell);  in deleteCell()
3055   int iCell;                      /* Index of iDelete cell in pLeaf */  in rtreeDeleteRowid()  local
3076     rc = nodeRowidIndex(pRtree, pLeaf, iDelete, &iCell);  in rtreeDeleteRowid()
3078       rc = deleteCell(pRtree, pLeaf, iCell, 0);  in rtreeDeleteRowid()
4134   int iCell,                      /* Cell number to use in error messages */  in rtreeCheckCellCoord()  argument
4149           "Dimension %d of cell %d on node %lld is corrupt", i, iCell, iNode  in rtreeCheckCellCoord()
4162             , i, iCell, iNode  in rtreeCheckCellCoord()