113 typedef struct RtreeCell RtreeCell;  typedef
374 struct RtreeCell {  struct
812   RtreeCell *pCell,          /* The cell to write */  in nodeOverwriteCell()
845   RtreeCell *pCell              /* The cell to be inserted */  in nodeInsertCell()
951   RtreeCell *pCell             /* OUT: Write the cell contents here */  in nodeGetCell()
2074 static RtreeDValue cellArea(Rtree *pRtree, RtreeCell *p){  in cellArea()
2104 static RtreeDValue cellMargin(Rtree *pRtree, RtreeCell *p){  in cellMargin()
2117 static void cellUnion(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){  in cellUnion()
2138 static int cellContains(Rtree *pRtree, RtreeCell *p1, RtreeCell *p2){  in cellContains()
2156 static RtreeDValue cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){  in cellGrowth()
2158   RtreeCell cell;  in cellGrowth()
2159   memcpy(&cell, p, sizeof(RtreeCell));  in cellGrowth()
2167   RtreeCell *p,   in cellOverlap()
2168   RtreeCell *aCell,   in cellOverlap()
2199   RtreeCell *pCell,            /* Cell to insert into rtree */  in ChooseLeaf()
2216     RtreeCell cell;  in ChooseLeaf()
2219     RtreeCell *aCell = 0;  in ChooseLeaf()
2260   RtreeCell *pCell                  /* This cell was just inserted */  in AdjustTree()
2267     RtreeCell cell;  in AdjustTree()
2312 static int rtreeInsertCell(Rtree *, RtreeNode *, RtreeCell *, int);
2403   RtreeCell *aCell,   in SortByDimension()
2459   RtreeCell *aCell,  in splitNodeStartree()
2463   RtreeCell *pBboxLeft,  in splitNodeStartree()
2464   RtreeCell *pBboxRight  in splitNodeStartree()
2504       RtreeCell left;  in splitNodeStartree()
2505       RtreeCell right;  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()
2540   memcpy(pBboxLeft, &aCell[aaSorted[iBestDim][0]], sizeof(RtreeCell));  in splitNodeStartree()
2541   memcpy(pBboxRight, &aCell[aaSorted[iBestDim][iBestSplit]], sizeof(RtreeCell));  in splitNodeStartree()
2544     RtreeCell *pBbox = (ii<iBestSplit)?pBboxLeft:pBboxRight;  in splitNodeStartree()
2545     RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]];  in splitNodeStartree()
2582   RtreeCell *pCell,  in SplitNode()
2590   RtreeCell *aCell;  in SplitNode()
2596   RtreeCell leftbbox;  in SplitNode()
2597   RtreeCell rightbbox;  in SplitNode()
2602   aCell = sqlite3_malloc64((sizeof(RtreeCell)+sizeof(int))*(nCell+1));  in SplitNode()
2613   memcpy(&aCell[nCell], pCell, sizeof(RtreeCell));  in SplitNode()
2818     RtreeCell box;                            /* Bounding box for pNode */  in fixBoundingBox()
2821       RtreeCell cell;  in fixBoundingBox()
2873   RtreeCell *pCell,   in Reinsert()
2878   RtreeCell *aCell;  in Reinsert()
2895   aCell = (RtreeCell *)sqlite3_malloc64(n * (  in Reinsert()
2896     sizeof(RtreeCell)     +         /* aCell array */  in Reinsert()
2910       memcpy(&aCell[ii], pCell, sizeof(RtreeCell));  in Reinsert()
2937     RtreeCell *p = &aCell[aOrder[ii]];  in Reinsert()
2955     RtreeCell *p = &aCell[aOrder[ii]];  in Reinsert()
2978   RtreeCell *pCell,  in rtreeInsertCell()
3017     RtreeCell cell;  in reinsertNodeContent()
3226   RtreeCell cell;                 /* New cell to insert if nData>1 */  in rtreeUpdate()
3887     RtreeCell cell;  in rtreenode()