1508   int iCellLast;             /* Last possible cell index */  in defragmentPage()  local
1568   iCellLast = usableSize - 4;  in defragmentPage()
1579       testcase( pc==iCellLast );  in defragmentPage()
1583       if( pc<iCellStart || pc>iCellLast ){  in defragmentPage()
1586       assert( pc>=iCellStart && pc<=iCellLast );  in defragmentPage()
1974   int iCellLast;     /* Last possible cell or freeblock offset */  in btreeComputeFreeSpace()  local
1993   iCellLast = usableSize - 4;  in btreeComputeFreeSpace()
2010       if( pc>iCellLast ){  in btreeComputeFreeSpace()
2050   int iCellLast;     /* Last possible cell or freeblock offset */  in btreeCellSizeCheck()  local
2060   iCellLast = usableSize - 4;  in btreeCellSizeCheck()
2063   if( !pPage->leaf ) iCellLast--;  in btreeCellSizeCheck()
2067     testcase( pc==iCellLast );  in btreeCellSizeCheck()
2068     if( pc<iCellFirst || pc>iCellLast ){  in btreeCellSizeCheck()