Lines Matching refs:usableSize
70961 u32 usableSize; /* Number of usable bytes on each page */ member
72594 nPagesPerMapPage = (pBt->usableSize/5)+1;
72649 assert( offset <= (int)pBt->usableSize-5 );
72693 assert( offset <= (int)pBt->usableSize-5 );
72751 surplus = minLocal + (pInfo->nPayload - minLocal)%(pPage->pBt->usableSize-4);
72776 surplus = (int)(minLocal +(nPayload - minLocal)%(pPage->pBt->usableSize-4));
72992 nSize = minLocal + (nSize - minLocal) % (pPage->pBt->usableSize - 4);
73034 nSize = minLocal + (nSize - minLocal) % (pPage->pBt->usableSize - 4);
73107 nSize = minLocal + (nSize - minLocal) % (pPage->pBt->usableSize - 4);
73171 int usableSize; /* Number of usable bytes on a page */ local
73184 assert( pPage->pBt->usableSize <= SQLITE_MAX_PAGE_SIZE );
73193 usableSize = pPage->pBt->usableSize;
73202 if( iFree>usableSize-4 ) return SQLITE_CORRUPT_PAGE(pPage);
73205 if( iFree2>usableSize-4 ) return SQLITE_CORRUPT_PAGE(pPage);
73218 if( iFree2+sz2 > usableSize ) return SQLITE_CORRUPT_PAGE(pPage);
73221 }else if( iFree+sz>usableSize ){
73226 assert( cbrk+(iFree-top) <= usableSize );
73238 cbrk = usableSize;
73239 iCellLast = usableSize - 4;
73243 memcpy(temp, data, usableSize);
73260 if( cbrk<iCellStart || pc+size>usableSize ){
73263 assert( cbrk+size<=usableSize && cbrk>=iCellStart );
73264 testcase( cbrk+size==usableSize );
73265 testcase( pc+size==usableSize );
73307 int maxPC = pPg->pBt->usableSize - nByte; /* Max address for a usable slot */
73386 assert( nByte < (int)(pPage->pBt->usableSize-8) );
73399 if( top==0 && pPage->pBt->usableSize==65536 ){
73404 }else if( top>(int)pPage->pBt->usableSize ){
73419 assert( pSpace+nByte<=data+pPage->pBt->usableSize );
73453 assert( top+nByte <= (int)pPage->pBt->usableSize );
73485 assert( CORRUPT_DB || iEnd <= pPage->pBt->usableSize );
73488 assert( CORRUPT_DB || iStart<=pPage->pBt->usableSize-4 );
73505 if( iFreeBlk>(int)pPage->pBt->usableSize-4 ){ /* TH3: corrupt081.100 */
73520 if( iEnd > (int)pPage->pBt->usableSize ){
73648 int usableSize; /* Amount of usable space on each page */ local
73663 usableSize = pPage->pBt->usableSize;
73671 iCellLast = usableSize - 4;
73702 if( pc+size>(unsigned int)usableSize ){
73715 if( nFree>usableSize || nFree<iCellFirst ){
73733 int usableSize; /* Maximum usable space on the page */ local
73737 usableSize = pPage->pBt->usableSize;
73738 iCellLast = usableSize - 4;
73750 testcase( pc+sz==usableSize );
73751 if( pc+sz>usableSize ){
73806 || get2byteNotZero(&data[5])==(int)pBt->usableSize
73832 memset(&data[hdr], 0, pBt->usableSize - hdr);
73838 put2byte(&data[hdr+5], pBt->usableSize);
73839 pPage->nFree = (u16)(pBt->usableSize - first);
74286 pBt->usableSize = pBt->pageSize - nReserve;
74628 x = pBt->pageSize - pBt->usableSize;
74644 pBt->usableSize = pBt->pageSize - (u16)nReserve;
74671 n = p->pBt->pageSize - p->pBt->usableSize;
74852 u32 usableSize; local
74932 usableSize = pageSize - page1[20];
74941 pBt->usableSize = usableSize;
74946 pageSize-usableSize);
74960 if( usableSize<480 ){
74965 pBt->usableSize = usableSize;
74985 pBt->maxLocal = (u16)((pBt->usableSize-12)*64/255 - 23);
74986 pBt->minLocal = (u16)((pBt->usableSize-12)*32/255 - 23);
74987 pBt->maxLeaf = (u16)(pBt->usableSize - 35);
74988 pBt->minLeaf = (u16)((pBt->usableSize-12)*32/255 - 23);
75074 assert( pBt->usableSize<=pBt->pageSize && pBt->usableSize+255>=pBt->pageSize);
75075 data[20] = (u8)(pBt->pageSize - pBt->usableSize);
75424 if( pCell+info.nSize > pPage->aData+pPage->pBt->usableSize ){
75433 if( pCell+4 > pPage->aData+pPage->pBt->usableSize ){
75664 nEntry = pBt->usableSize/5;
76674 if( (uptr)(aPayload - pPage->aData) > (pBt->usableSize - pCur->info.nLocal) ){
76699 const u32 ovflSize = pBt->usableSize - 4; /* Bytes content per ovfl page */
77665 if( nCell<2 || nCell/pCur->pBt->usableSize>pCur->pBt->nPage ){
78107 }else if( k>(u32)(pBt->usableSize/4 - 2) ){
78391 assert( pBt->usableSize>32 );
78392 if( nLeaf > (u32)pBt->usableSize/4 - 2 ){
78396 if( nLeaf < (u32)pBt->usableSize/4 - 8 ){
78486 assert( pBt->usableSize > 4 );
78487 ovflPageSize = pBt->usableSize - 4;
78624 n = mn + (nPayload - mn) % (pPage->pBt->usableSize - 4);
78738 spaceLeft = pBt->usableSize - 4;
78769 assert( pPage->pBt->usableSize > (u32)(ptr-data) );
78773 testcase( pc+sz==pPage->pBt->usableSize );
78774 if( pc+sz > pPage->pBt->usableSize ){
78787 put2byte(&data[hdr+5], pPage->pBt->usableSize);
78788 pPage->nFree = pPage->pBt->usableSize - pPage->hdrOffset
78874 assert( idx+sz <= (int)pPage->pBt->usableSize );
78964 assert( idx+sz <= (int)pPage->pBt->usableSize );
79138 const int usableSize = pPg->pBt->usableSize; local
79139 u8 * const pEnd = &aData[usableSize];
79152 if( j>(u32)usableSize ){ j = 0; }
79153 memcpy(&pTmp[j], &aData[j], usableSize - j);
79296 u8 * const pEnd = &aData[pPg->pBt->usableSize];
79378 memcpy(pTmp, aData, pPg->pBt->usableSize);
79452 if( SQLITE_WITHIN(pCell, aData, &aData[pPg->pBt->usableSize]) ){
79536 pNew->nFree = pBt->usableSize - pNew->cellOffset - 2 - szCell;
79662 assert( get2byte(&aFrom[iFromHdr+5]) <= (int)pBt->usableSize );
79666 memcpy(&aTo[iData], &aFrom[iData], pBt->usableSize-iData);
79864 if( (iOff+szNew[i])<=(int)pBt->usableSize ){
80026 usableSpace = pBt->usableSize - 12 + leafCorrection;
80624 if( pPage->nOverflow==0 && pPage->nFree*3<=(int)pCur->pBt->usableSize*2 ){
80814 ovflPageSize = pBt->usableSize - 4;
81275 nIn = pSrc->pBt->usableSize - 4;
81294 nOut = MIN(pBt->usableSize - 4, nRem);
81385 (int)(pBt->usableSize*2/3)
81483 if( pCur->pPage->nFree*3<=(int)pCur->pBt->usableSize*2 ){
82227 if( n>pCheck->pBt->usableSize/4-2 ){
82359 u32 usableSize; /* Usable size of the page */ local
82373 usableSize = pBt->usableSize;
82406 assert( contentOffset<=usableSize ); /* Enforced by btreeInitPage() */
82450 if( pc<contentOffset || pc>usableSize-4 ){
82452 pc, contentOffset, usableSize-4);
82458 if( pc+info.nSize>usableSize ){
82477 assert( pc + info.nSize - 4 <= usableSize );
82478 nPage = (info.nPayload - info.nLocal + usableSize - 5)/(usableSize - 4);
82536 assert( (u32)i<=usableSize-4 ); /* Enforced by btreeComputeFreeSpace() */
82538 assert( (u32)(i+size)<=usableSize ); /* due to btreeComputeFreeSpace() */
82548 assert( (u32)j<=usableSize-4 ); /* Enforced by btreeComputeFreeSpace() */
82576 nFrag += usableSize - (prev&0xffff) - 1;