2168   RtreeCell *aCell,   in cellOverlap()  argument
2178       x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj]));  in cellOverlap()
2179       x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1]));  in cellOverlap()
2219     RtreeCell *aCell = 0;  in ChooseLeaf()  local
2242     sqlite3_free(aCell);  in ChooseLeaf()
2403   RtreeCell *aCell,   in SortByDimension()  argument
2416     SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);  in SortByDimension()
2417     SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);  in SortByDimension()
2422       RtreeDValue xleft1 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2]);  in SortByDimension()
2423       RtreeDValue xleft2 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2+1]);  in SortByDimension()
2424       RtreeDValue xright1 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2]);  in SortByDimension()
2425       RtreeDValue xright2 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2+1]);  in SortByDimension()
2443         RtreeDValue xleft1 = aCell[aIdx[jj-1]].aCoord[iDim*2];  in SortByDimension()
2444         RtreeDValue xleft2 = aCell[aIdx[jj-1]].aCoord[iDim*2+1];  in SortByDimension()
2445         RtreeDValue xright1 = aCell[aIdx[jj]].aCoord[iDim*2];  in SortByDimension()
2446         RtreeDValue xright2 = aCell[aIdx[jj]].aCoord[iDim*2+1];  in SortByDimension()
2459   RtreeCell *aCell,  in splitNodeStartree()  argument
2489     SortByDimension(pRtree, aaSorted[ii], nCell, ii, aCell, aSpare);  in splitNodeStartree()
2510       memcpy(&left, &aCell[aaSorted[ii][0]], sizeof(RtreeCell));  in splitNodeStartree()
2511       memcpy(&right, &aCell[aaSorted[ii][nCell-1]], sizeof(RtreeCell));  in splitNodeStartree()
2514           cellUnion(pRtree, &left, &aCell[aaSorted[ii][kk]]);  in splitNodeStartree()
2516           cellUnion(pRtree, &right, &aCell[aaSorted[ii][kk]]);  in splitNodeStartree()
2540   memcpy(pBboxLeft, &aCell[aaSorted[iBestDim][0]], sizeof(RtreeCell));  in splitNodeStartree()
2541   memcpy(pBboxRight, &aCell[aaSorted[iBestDim][iBestSplit]], sizeof(RtreeCell));  in splitNodeStartree()
2545     RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]];  in splitNodeStartree()
2590   RtreeCell *aCell;  in SplitNode()  local
2602   aCell = sqlite3_malloc64((sizeof(RtreeCell)+sizeof(int))*(nCell+1));  in SplitNode()
2603   if( !aCell ){  in SplitNode()
2607   aiUsed = (int *)&aCell[nCell+1];  in SplitNode()
2610     nodeGetCell(pRtree, pNode, i, &aCell[i]);  in SplitNode()
2613   memcpy(&aCell[nCell], pCell, sizeof(RtreeCell));  in SplitNode()
2636   rc = splitNodeStartree(pRtree, aCell, nCell, pLeft, pRight,  in SplitNode()
2712   sqlite3_free(aCell);  in SplitNode()
2878   RtreeCell *aCell;  in Reinsert()  local
2895   aCell = (RtreeCell *)sqlite3_malloc64(n * (  in Reinsert()
2901   if( !aCell ){  in Reinsert()
2904   aOrder    = (int *)&aCell[n];  in Reinsert()
2910       memcpy(&aCell[ii], pCell, sizeof(RtreeCell));  in Reinsert()
2912       nodeGetCell(pRtree, pNode, ii, &aCell[ii]);  in Reinsert()
2916       aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2]);  in Reinsert()
2917       aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2+1]);  in Reinsert()
2927       RtreeDValue coord = (DCOORD(aCell[ii].aCoord[iDim*2+1]) -   in Reinsert()
2928                                DCOORD(aCell[ii].aCoord[iDim*2]));  in Reinsert()
2937     RtreeCell *p = &aCell[aOrder[ii]];  in Reinsert()
2955     RtreeCell *p = &aCell[aOrder[ii]];  in Reinsert()
2967   sqlite3_free(aCell);  in Reinsert()