1507   int iCellFirst;            /* First allowable cell index */  in defragmentPage()  local
1521   iCellFirst = cellOffset + 2*nCell;  in defragmentPage()
1578       testcase( pc==iCellFirst );  in defragmentPage()
1603   if( data[hdr+7]+cbrk-iCellFirst!=pPage->nFree ){  in defragmentPage()
1606   assert( cbrk>=iCellFirst );  in defragmentPage()
1610   memset(&data[iCellFirst], 0, cbrk-iCellFirst);  in defragmentPage()
1973   int iCellFirst;    /* First allowable cell or freeblock offset */  in btreeComputeFreeSpace()  local
1992   iCellFirst = hdr + 8 + pPage->childPtrSize + 2*pPage->nCell;  in btreeComputeFreeSpace()
2037   if( nFree>usableSize || nFree<iCellFirst ){  in btreeComputeFreeSpace()
2040   pPage->nFree = (u16)(nFree - iCellFirst);  in btreeComputeFreeSpace()
2049   int iCellFirst;    /* First allowable cell or freeblock offset */  in btreeCellSizeCheck()  local
2058   iCellFirst = pPage->cellOffset + 2*pPage->nCell;  in btreeCellSizeCheck()
2066     testcase( pc==iCellFirst );  in btreeCellSizeCheck()
2068     if( pc<iCellFirst || pc>iCellLast ){  in btreeCellSizeCheck()