1501   int cellOffset;            /* Offset to the cell pointer array */  in defragmentPage()  local
1518   cellOffset = pPage->cellOffset;  in defragmentPage()
1521   iCellFirst = cellOffset + 2*nCell;  in defragmentPage()
1536         u8 *pEnd = &data[cellOffset + nCell*2];  in defragmentPage()
1557         for(pAddr=&data[cellOffset]; pAddr<pEnd; pAddr+=2){  in defragmentPage()
1576       pAddr = &data[cellOffset + i*2];  in defragmentPage()
1717   assert( pPage->cellOffset == hdr + 12 - 4*pPage->leaf );  in allocateSpace()
1718   gap = pPage->cellOffset + 2*pPage->nCell;  in allocateSpace()
2056   int cellOffset;    /* Start of cell content area */  in btreeCellSizeCheck()  local
2058   iCellFirst = pPage->cellOffset + 2*pPage->nCell;  in btreeCellSizeCheck()
2062   cellOffset = pPage->cellOffset;  in btreeCellSizeCheck()
2065     pc = get2byteAligned(&data[cellOffset+i*2]);  in btreeCellSizeCheck()
2111   pPage->cellOffset = pPage->hdrOffset + 8 + pPage->childPtrSize;  in btreeInitPage()
2163   pPage->cellOffset = first;  in zeroPage()
7101     assert( &data[pPage->cellOffset]==pPage->aCellIdx );  in insertCell()
7107     assert( idx >= pPage->cellOffset+2*pPage->nCell+2 || CORRUPT_DB );  in insertCell()
7664     pNew->nFree = pBt->usableSize - pNew->cellOffset - 2 - szCell;  in balance_quick()
7795     memcpy(&aTo[iToHdr], &aFrom[iFromHdr], pFrom->cellOffset + 2*pFrom->nCell);  in copyNodeContent()
8045     u8 *piCell = aData + pOld->cellOffset;  in balance_nonroot()
8092     piEnd = aData + pOld->cellOffset + 2*pOld->nCell;  in balance_nonroot()
8579         (get2byteNotZero(&apNew[0]->aData[5]) - apNew[0]->cellOffset  in balance_nonroot()
8919    || pCur->info.pPayload < pPage->aData + pPage->cellOffset  in btreeOverwriteCell()