1540         int top = get2byte(&data[hdr+5]);  in defragmentPage()  local
1541         if( top>=iFree ){  in defragmentPage()
1554         cbrk = top+sz;  in defragmentPage()
1555         assert( cbrk+(iFree-top) <= usableSize );  in defragmentPage()
1556         memmove(&data[cbrk], &data[top], iFree-top);  in defragmentPage()
1704   int top;                             /* First byte of cell content area */  in allocateSpace()  local
1726   top = get2byte(pTmp);  in allocateSpace()
1727   assert( top<=(int)pPage->pBt->usableSize ); /* by btreeComputeFreeSpace() */  in allocateSpace()
1728   if( gap>top ){  in allocateSpace()
1729     if( top==0 && pPage->pBt->usableSize==65536 ){  in allocateSpace()
1730       top = 65536;  in allocateSpace()
1740   testcase( gap+2==top );  in allocateSpace()
1741   testcase( gap+1==top );  in allocateSpace()
1742   testcase( gap==top );  in allocateSpace()
1743   if( (data[hdr+2] || data[hdr+1]) && gap+2<=top ){  in allocateSpace()
1762   testcase( gap+2+nByte==top );  in allocateSpace()
1763   if( gap+2+nByte>top ){  in allocateSpace()
1768     top = get2byteNotZero(&data[hdr+5]);  in allocateSpace()
1769     assert( gap+2+nByte<=top );  in allocateSpace()
1779   top -= nByte;  in allocateSpace()
1780   put2byte(&data[hdr+5], top);  in allocateSpace()
1781   assert( top+nByte <= (int)pPage->pBt->usableSize );  in allocateSpace()
1782   *pIdx = top;  in allocateSpace()
1972   int top;           /* First byte of the cell content area */  in btreeComputeFreeSpace()  local
1991   top = get2byteNotZero(&data[hdr+5]);  in btreeComputeFreeSpace()
2000   nFree = data[hdr+7] + top;  /* Init nFree to non-freeblock free space */  in btreeComputeFreeSpace()
2003     if( pc<top ){  in btreeComputeFreeSpace()