Lines Matching refs:usableSize
37210 u16 usableSize; /* Number of usable bytes on each page */
38510 nPagesPerMapPage = (pBt->usableSize/5)+1;
38712 surplus = minLocal + (nPayload - minLocal)%(pPage->pBt->usableSize - 4);
38774 nSize = minLocal + (nSize - minLocal) % (pPage->pBt->usableSize - 4);
38832 int usableSize; /* Number of usable bytes on a page */
38844 assert( pPage->pBt->usableSize <= SQLITE_MAX_PAGE_SIZE );
38853 usableSize = pPage->pBt->usableSize;
38855 memcpy(&temp[cbrk], &data[cbrk], usableSize - cbrk);
38856 cbrk = usableSize;
38858 iCellLast = usableSize - 4;
38881 if( cbrk<iCellFirst || pc+size>usableSize ){
38885 assert( cbrk+size<=usableSize && cbrk>=iCellFirst );
38886 testcase( cbrk+size==usableSize );
38887 testcase( pc+size==usableSize );
38924 int usableSize; /* Usable size of the page */
38932 usableSize = pPage->pBt->usableSize;
38933 assert( nByte < usableSize-8 );
38957 if( pc>usableSize-4 || pc<addr+4 ){
38970 }else if( size+pc > usableSize ){
39003 assert( top+nByte <= pPage->pBt->usableSize );
39024 assert( (start + size)<=pPage->pBt->usableSize );
39045 iLast = pPage->pBt->usableSize - 4;
39067 assert( pbegin<=pPage->pBt->usableSize-4 );
39156 u16 usableSize; /* Amount of usable space on each page */
39171 usableSize = pBt->usableSize;
39189 iCellLast = usableSize - 4;
39204 testcase( pc+sz==usableSize );
39205 if( pc+sz>usableSize ){
39224 if( (next>0 && next<=pc+size+3) || pc+size>usableSize ){
39240 if( nFree>usableSize ){
39265 memset(&data[hdr], 0, pBt->usableSize - hdr);
39271 put2byte(&data[hdr+5], pBt->usableSize);
39272 pPage->nFree = pBt->usableSize - first;
39613 pBt->usableSize = pBt->pageSize - nReserve;
39893 nReserve = pBt->pageSize - pBt->usableSize;
39904 pBt->usableSize = pBt->pageSize - (u16)nReserve;
39925 n = p->pBt->pageSize - p->pBt->usableSize;
40020 int usableSize;
40048 usableSize = pageSize - page1[20];
40057 pBt->usableSize = (u16)usableSize;
40061 pageSize-usableSize);
40064 if( usableSize<480 ){
40068 pBt->usableSize = (u16)usableSize;
40088 pBt->maxLocal = (pBt->usableSize-12)*64/255 - 23;
40089 pBt->minLocal = (pBt->usableSize-12)*32/255 - 23;
40090 pBt->maxLeaf = pBt->usableSize - 35;
40091 pBt->minLeaf = (pBt->usableSize-12)*32/255 - 23;
40148 assert( pBt->usableSize<=pBt->pageSize && pBt->usableSize+255>=pBt->pageSize);
40149 data[20] = (u8)(pBt->pageSize - pBt->usableSize);
40687 nEntry = pBt->usableSize/5;
41478 || &aPayload[pCur->info.nLocal] > &pPage->aData[pBt->usableSize]
41499 const u32 ovflSize = pBt->usableSize - 4; /* Bytes content per ovfl page */
42471 }else if( k>(u32)(pBt->usableSize/4 - 2) ){
42722 assert( pBt->usableSize>32 );
42723 if( nLeaf > (u32)pBt->usableSize/4 - 2 ){
42727 if( nLeaf < (u32)pBt->usableSize/4 - 8 ){
42732 ** usableSize/4 - 2 entries, not usableSize/4 - 8 entries as we have
42735 ** usableSize/4 - 8 entries will be reported as corrupt. In order
42737 ** we will continue to restrict the number of entries to usableSize/4 - 8
42740 ** to read "usableSize/4-2" instead of "usableSize/4-8".
42807 assert( pBt->usableSize > 4 );
42808 ovflPageSize = pBt->usableSize - 4;
42961 spaceLeft = pBt->usableSize - 4;
43023 testcase( pc+sz==pPage->pBt->usableSize );
43024 if( pc < get2byte(&data[hdr+5]) || pc+sz > pPage->pBt->usableSize ){
43118 assert( idx+sz <= pPage->pBt->usableSize );
43157 const int nUsable = pPage->pBt->usableSize; /* Usable size of page */
43374 assert( get2byte(&aFrom[iFromHdr+5])<=pBt->usableSize );
43378 memcpy(&aTo[iData], &aFrom[iData], pBt->usableSize-iData);
43672 usableSpace = pBt->usableSize - 12 + leafCorrection;
44118 const int nMin = pCur->pBt->usableSize * 2 / 3;
45117 if( n>pCheck->pBt->usableSize/4-2 ){
45184 int usableSize;
45195 usableSize = pBt->usableSize;
45243 && (&pCell[info.iOverflow]<=&pPage->aData[pBt->usableSize])
45245 int nPage = (sz - info.nLocal + usableSize - 5)/(usableSize - 4);
45329 assert( contentOffset<=usableSize ); /* Enforced by btreeInitPage() */
45330 memset(hit+contentOffset, 0, usableSize-contentOffset);
45338 if( pc<=usableSize-4 ){
45341 if( (pc+size-1)>=usableSize ){
45351 assert( i<=usableSize-4 ); /* Enforced by btreeInitPage() */
45353 assert( i+size<=usableSize ); /* Enforced by btreeInitPage() */
45357 assert( j<=usableSize-4 ); /* Enforced by btreeInitPage() */
45360 for(i=cnt=0; i<usableSize; i++){
