847   int nCell;                    /* Current number of cells in pNode */  in nodeInsertCell()  local
851   nCell = NCELL(pNode);  in nodeInsertCell()
853   assert( nCell<=nMaxCell );  in nodeInsertCell()
854   if( nCell<nMaxCell ){  in nodeInsertCell()
855     nodeOverwriteCell(pRtree, pNode, pCell, nCell);  in nodeInsertCell()
856     writeInt16(&pNode->zData[2], nCell+1);  in nodeInsertCell()
860   return (nCell==nMaxCell);  in nodeInsertCell()
1364   int nCell = NCELL(pNode);  in nodeRowidIndex()  local
1365   assert( nCell<200 );  in nodeRowidIndex()
1366   for(ii=0; ii<nCell; ii++){  in nodeRowidIndex()
1615   int nCell;  in rtreeStepToLeaf()  local
1626     nCell = NCELL(pNode);  in rtreeStepToLeaf()
1627     assert( nCell<200 );  in rtreeStepToLeaf()
1629     while( p->iCell<nCell ){  in rtreeStepToLeaf()
1665       if( p->iCell>=nCell ){  in rtreeStepToLeaf()
1678     if( p->iCell>=nCell ){  in rtreeStepToLeaf()
2169   int nCell  in cellOverlap()  argument
2173   for(ii=0; ii<nCell; ii++){  in cellOverlap()
2215     int nCell = NCELL(pNode);  in ChooseLeaf()  local
2225     for(iCell=0; iCell<nCell; iCell++){  in ChooseLeaf()
2460   int nCell,  in splitNodeStartree()  argument
2474   sqlite3_int64 nByte = (pRtree->nDim+1)*(sizeof(int*)+nCell*sizeof(int));  in splitNodeStartree()
2481   aSpare = &((int *)&aaSorted[pRtree->nDim])[pRtree->nDim*nCell];  in splitNodeStartree()
2485     aaSorted[ii] = &((int *)&aaSorted[pRtree->nDim])[ii*nCell];  in splitNodeStartree()
2486     for(jj=0; jj<nCell; jj++){  in splitNodeStartree()
2489     SortByDimension(pRtree, aaSorted[ii], nCell, ii, aCell, aSpare);  in splitNodeStartree()
2501       nLeft<=(nCell-RTREE_MINCELLS(pRtree));   in splitNodeStartree()
2511       memcpy(&right, &aCell[aaSorted[ii][nCell-1]], sizeof(RtreeCell));  in splitNodeStartree()
2512       for(kk=1; kk<(nCell-1); kk++){  in splitNodeStartree()
2542   for(ii=0; ii<nCell; ii++){  in splitNodeStartree()
2589   int nCell = NCELL(pNode);  in SplitNode()  local
2602   aCell = sqlite3_malloc64((sizeof(RtreeCell)+sizeof(int))*(nCell+1));  in SplitNode()
2607   aiUsed = (int *)&aCell[nCell+1];  in SplitNode()
2608   memset(aiUsed, 0, sizeof(int)*(nCell+1));  in SplitNode()
2609   for(i=0; i<nCell; i++){  in SplitNode()
2613   memcpy(&aCell[nCell], pCell, sizeof(RtreeCell));  in SplitNode()
2614   nCell++;  in SplitNode()
2636   rc = splitNodeStartree(pRtree, aCell, nCell, pLeft, pRight,  in SplitNode()
2817     int nCell = NCELL(pNode);  in fixBoundingBox()  local
2820     for(ii=1; ii<nCell; ii++){  in fixBoundingBox()
2880   int nCell;  in Reinsert()  local
2889   nCell = NCELL(pNode)+1;  in Reinsert()
2890   n = (nCell+1)&(~1);  in Reinsert()
2908   for(ii=0; ii<nCell; ii++){  in Reinsert()
2909     if( ii==(nCell-1) ){  in Reinsert()
2921     aCenterCoord[iDim] = (aCenterCoord[iDim]/(nCell*(RtreeDValue)2));  in Reinsert()
2924   for(ii=0; ii<nCell; ii++){  in Reinsert()
2933   SortByDistance(aOrder, nCell, aDistance, aSpare);  in Reinsert()
2936   for(ii=0; rc==SQLITE_OK && ii<(nCell-(RTREE_MINCELLS(pRtree)+1)); ii++){  in Reinsert()
2950   for(; rc==SQLITE_OK && ii<nCell; ii++){  in Reinsert()
3013   int nCell = NCELL(pNode);  in reinsertNodeContent()  local
3015   for(ii=0; rc==SQLITE_OK && ii<nCell; ii++){  in reinsertNodeContent()
4196       int nCell;                  /* Number of cells on page */  in rtreeCheckNode()  local
4206       nCell = readInt16(&aNode[2]);  in rtreeCheckNode()
4207       if( (4 + nCell*(8 + pCheck->nDim*2*4))>nNode ){  in rtreeCheckNode()
4210             iNode, nCell, nNode  in rtreeCheckNode()
4213         for(i=0; i<nCell; i++){  in rtreeCheckNode()