Lines Matching refs:usableSize
43968 u32 usableSize; /* Number of usable bytes on each page */
45275 nPagesPerMapPage = (pBt->usableSize/5)+1;
45477 surplus = minLocal + (nPayload - minLocal)%(pPage->pBt->usableSize - 4);
45539 nSize = minLocal + (nSize - minLocal) % (pPage->pBt->usableSize - 4);
45597 int usableSize; /* Number of usable bytes on a page */
45609 assert( pPage->pBt->usableSize <= SQLITE_MAX_PAGE_SIZE );
45618 usableSize = pPage->pBt->usableSize;
45620 memcpy(&temp[cbrk], &data[cbrk], usableSize - cbrk);
45621 cbrk = usableSize;
45623 iCellLast = usableSize - 4;
45646 if( cbrk<iCellFirst || pc+size>usableSize ){
45650 assert( cbrk+size<=usableSize && cbrk>=iCellFirst );
45651 testcase( cbrk+size==usableSize );
45652 testcase( pc+size==usableSize );
45689 int usableSize; /* Usable size of the page */
45697 usableSize = pPage->pBt->usableSize;
45698 assert( nByte < usableSize-8 );
45722 if( pc>usableSize-4 || pc<addr+4 ){
45735 }else if( size+pc > usableSize ){
45768 assert( top+nByte <= pPage->pBt->usableSize );
45789 assert( (start + size)<=pPage->pBt->usableSize );
45810 iLast = pPage->pBt->usableSize - 4;
45832 assert( pbegin<=pPage->pBt->usableSize-4 );
45921 int usableSize; /* Amount of usable space on each page */
45936 usableSize = pBt->usableSize;
45954 iCellLast = usableSize - 4;
45969 testcase( pc+sz==usableSize );
45970 if( pc+sz>usableSize ){
45989 if( (next>0 && next<=pc+size+3) || pc+size>usableSize ){
46005 if( nFree>usableSize ){
46030 memset(&data[hdr], 0, pBt->usableSize - hdr);
46036 put2byte(&data[hdr+5], pBt->usableSize);
46037 pPage->nFree = (u16)(pBt->usableSize - first);
46378 pBt->usableSize = pBt->pageSize - nReserve;
46658 nReserve = pBt->pageSize - pBt->usableSize;
46669 pBt->usableSize = pBt->pageSize - (u16)nReserve;
46690 n = p->pBt->pageSize - p->pBt->usableSize;
46806 u32 usableSize;
46865 usableSize = pageSize - page1[20];
46874 pBt->usableSize = usableSize;
46878 pageSize-usableSize);
46885 if( usableSize<480 ){
46889 pBt->usableSize = usableSize;
46909 pBt->maxLocal = (u16)((pBt->usableSize-12)*64/255 - 23);
46910 pBt->minLocal = (u16)((pBt->usableSize-12)*32/255 - 23);
46911 pBt->maxLeaf = (u16)(pBt->usableSize - 35);
46912 pBt->minLeaf = (u16)((pBt->usableSize-12)*32/255 - 23);
46969 assert( pBt->usableSize<=pBt->pageSize && pBt->usableSize+255>=pBt->pageSize);
46970 data[20] = (u8)(pBt->pageSize - pBt->usableSize);
47530 nEntry = pBt->usableSize/5;
48330 || &aPayload[pCur->info.nLocal] > &pPage->aData[pBt->usableSize]
48351 const u32 ovflSize = pBt->usableSize - 4; /* Bytes content per ovfl page */
49322 }else if( k>(u32)(pBt->usableSize/4 - 2) ){
49577 assert( pBt->usableSize>32 );
49578 if( nLeaf > (u32)pBt->usableSize/4 - 2 ){
49582 if( nLeaf < (u32)pBt->usableSize/4 - 8 ){
49587 ** usableSize/4 - 2 entries, not usableSize/4 - 8 entries as we have
49590 ** usableSize/4 - 8 entries will be reported as corrupt. In order
49592 ** we will continue to restrict the number of entries to usableSize/4 - 8
49595 ** to read "usableSize/4-2" instead of "usableSize/4-8".
49660 assert( pBt->usableSize > 4 );
49661 ovflPageSize = pBt->usableSize - 4;
49832 spaceLeft = pBt->usableSize - 4;
49894 testcase( pc+sz==pPage->pBt->usableSize );
49895 if( pc < (u32)get2byte(&data[hdr+5]) || pc+sz > pPage->pBt->usableSize ){
49989 assert( idx+sz <= pPage->pBt->usableSize );
50028 const int nUsable = pPage->pBt->usableSize; /* Usable size of page */
50246 assert( get2byte(&aFrom[iFromHdr+5])<=pBt->usableSize );
50250 memcpy(&aTo[iData], &aFrom[iData], pBt->usableSize-iData);
50433 if( (iOff+szNew[i])>(int)pBt->usableSize ){
50551 usableSpace = pBt->usableSize - 12 + leafCorrection;
50997 const int nMin = pCur->pBt->usableSize * 2 / 3;
52002 if( n>(int)pCheck->pBt->usableSize/4-2 ){
52069 int usableSize;
52080 usableSize = pBt->usableSize;
52128 && (&pCell[info.iOverflow]<=&pPage->aData[pBt->usableSize])
52130 int nPage = (sz - info.nLocal + usableSize - 5)/(usableSize - 4);
52214 assert( contentOffset<=usableSize ); /* Enforced by btreeInitPage() */
52215 memset(hit+contentOffset, 0, usableSize-contentOffset);
52223 if( pc<=usableSize-4 ){
52226 if( (int)(pc+size-1)>=usableSize ){
52236 assert( i<=usableSize-4 ); /* Enforced by btreeInitPage() */
52238 assert( i+size<=usableSize ); /* Enforced by btreeInitPage() */
52242 assert( j<=usableSize-4 ); /* Enforced by btreeInitPage() */
52245 for(i=cnt=0; i<usableSize; i++){