Lines Matching refs:usableSize
976 nPagesPerMapPage = (pBt->usableSize/5)+1; in ptrmapPageno()
1031 assert( offset <= (int)pBt->usableSize-5 ); in ptrmapPut()
1075 assert( offset <= (int)pBt->usableSize-5 ); in ptrmapGet()
1133 surplus = minLocal + (pInfo->nPayload - minLocal)%(pPage->pBt->usableSize-4); in btreeParseCellAdjustSizeForOverflow()
1157 surplus = minLocal + (nPayload - minLocal)%(pPage->pBt->usableSize-4); in btreePayloadToLocal()
1363 nSize = minLocal + (nSize - minLocal) % (pPage->pBt->usableSize - 4); in cellSizePtr()
1436 nSize = minLocal + (nSize - minLocal) % (pPage->pBt->usableSize - 4); in cellSizePtrTableLeaf()
1500 int usableSize; /* Number of usable bytes on a page */ in defragmentPage() local
1513 assert( pPage->pBt->usableSize <= SQLITE_MAX_PAGE_SIZE ); in defragmentPage()
1522 usableSize = pPage->pBt->usableSize; in defragmentPage()
1531 if( iFree>usableSize-4 ) return SQLITE_CORRUPT_PAGE(pPage); in defragmentPage()
1534 if( iFree2>usableSize-4 ) return SQLITE_CORRUPT_PAGE(pPage); in defragmentPage()
1547 if( iFree2+sz2 > usableSize ) return SQLITE_CORRUPT_PAGE(pPage); in defragmentPage()
1550 }else if( iFree+sz>usableSize ){ in defragmentPage()
1555 assert( cbrk+(iFree-top) <= usableSize ); in defragmentPage()
1567 cbrk = usableSize; in defragmentPage()
1568 iCellLast = usableSize - 4; in defragmentPage()
1572 memcpy(&temp[iCellStart], &data[iCellStart], usableSize - iCellStart); in defragmentPage()
1589 if( cbrk<iCellStart || pc+size>usableSize ){ in defragmentPage()
1592 assert( cbrk+size<=usableSize && cbrk>=iCellStart ); in defragmentPage()
1593 testcase( cbrk+size==usableSize ); in defragmentPage()
1594 testcase( pc+size==usableSize ); in defragmentPage()
1636 int maxPC = pPg->pBt->usableSize - nByte; /* Max address for a usable slot */ in pageFindSlot()
1715 assert( nByte < (int)(pPage->pBt->usableSize-8) ); in allocateSpace()
1727 assert( top<=(int)pPage->pBt->usableSize ); /* by btreeComputeFreeSpace() */ in allocateSpace()
1729 if( top==0 && pPage->pBt->usableSize==65536 ){ in allocateSpace()
1747 assert( pSpace+nByte<=data+pPage->pBt->usableSize ); in allocateSpace()
1781 assert( top+nByte <= (int)pPage->pBt->usableSize ); in allocateSpace()
1813 assert( CORRUPT_DB || iEnd <= pPage->pBt->usableSize ); in freeSpace()
1816 assert( iStart<=pPage->pBt->usableSize-4 ); in freeSpace()
1833 if( iFreeBlk>pPage->pBt->usableSize-4 ){ /* TH3: corrupt081.100 */ in freeSpace()
1848 if( iEnd > pPage->pBt->usableSize ){ in freeSpace()
1970 int usableSize; /* Amount of usable space on each page */ in btreeComputeFreeSpace() local
1985 usableSize = pPage->pBt->usableSize; in btreeComputeFreeSpace()
1993 iCellLast = usableSize - 4; in btreeComputeFreeSpace()
2024 if( pc+size>(unsigned int)usableSize ){ in btreeComputeFreeSpace()
2037 if( nFree>usableSize || nFree<iCellFirst ){ in btreeComputeFreeSpace()
2055 int usableSize; /* Maximum usable space on the page */ in btreeCellSizeCheck() local
2059 usableSize = pPage->pBt->usableSize; in btreeCellSizeCheck()
2060 iCellLast = usableSize - 4; in btreeCellSizeCheck()
2072 testcase( pc+sz==usableSize ); in btreeCellSizeCheck()
2073 if( pc+sz>usableSize ){ in btreeCellSizeCheck()
2128 || get2byteNotZero(&data[5])==(int)pBt->usableSize in btreeInitPage()
2154 memset(&data[hdr], 0, pBt->usableSize - hdr); in zeroPage()
2160 put2byte(&data[hdr+5], pBt->usableSize); in zeroPage()
2161 pPage->nFree = (u16)(pBt->usableSize - first); in zeroPage()
2632 pBt->usableSize = pBt->pageSize - nReserve; in sqlite3BtreeOpen()
2974 x = pBt->pageSize - pBt->usableSize; in sqlite3BtreeSetPageSize()
2990 pBt->usableSize = pBt->pageSize - (u16)nReserve; in sqlite3BtreeSetPageSize()
3017 n = p->pBt->pageSize - p->pBt->usableSize; in sqlite3BtreeGetReserveNoMutex()
3198 u32 usableSize; in lockBtree() local
3279 usableSize = pageSize - page1[20]; in lockBtree()
3288 pBt->usableSize = usableSize; in lockBtree()
3292 pageSize-usableSize); in lockBtree()
3306 if( usableSize<480 ){ in lockBtree()
3310 pBt->usableSize = usableSize; in lockBtree()
3330 pBt->maxLocal = (u16)((pBt->usableSize-12)*64/255 - 23); in lockBtree()
3331 pBt->minLocal = (u16)((pBt->usableSize-12)*32/255 - 23); in lockBtree()
3332 pBt->maxLeaf = (u16)(pBt->usableSize - 35); in lockBtree()
3333 pBt->minLeaf = (u16)((pBt->usableSize-12)*32/255 - 23); in lockBtree()
3419 assert( pBt->usableSize<=pBt->pageSize && pBt->usableSize+255>=pBt->pageSize); in newDatabase()
3420 data[20] = (u8)(pBt->pageSize - pBt->usableSize); in newDatabase()
3736 if( pCell+info.nSize > pPage->aData+pPage->pBt->usableSize ){ in modifyPagePointer()
3745 if( pCell+4 > pPage->aData+pPage->pBt->usableSize ){ in modifyPagePointer()
3976 nEntry = pBt->usableSize/5; in finalDbSize()
4969 if( (uptr)(aPayload - pPage->aData) > (pBt->usableSize - pCur->info.nLocal) ){ in accessPayload()
4994 const u32 ovflSize = pBt->usableSize - 4; /* Bytes content per ovfl page */ in accessPayload()
5934 if( nCell<2 || nCell/pCur->pBt->usableSize>pCur->pBt->nPage ){ in sqlite3BtreeIndexMoveto()
6346 }else if( k>(u32)(pBt->usableSize/4 - 2) ){ in allocateBtreePage()
6630 assert( pBt->usableSize>32 ); in freePage2()
6631 if( nLeaf > (u32)pBt->usableSize/4 - 2 ){ in freePage2()
6635 if( nLeaf < (u32)pBt->usableSize/4 - 8 ){ in freePage2()
6725 assert( pBt->usableSize > 4 ); in clearCellOverflow()
6726 ovflPageSize = pBt->usableSize - 4; in clearCellOverflow()
6860 n = mn + (nPayload - mn) % (pPage->pBt->usableSize - 4); in fillInCell()
6974 spaceLeft = pBt->usableSize - 4; in fillInCell()
7005 assert( pPage->pBt->usableSize > (u32)(ptr-data) ); in dropCell()
7009 testcase( pc+sz==pPage->pBt->usableSize ); in dropCell()
7010 if( pc+sz > pPage->pBt->usableSize ){ in dropCell()
7023 put2byte(&data[hdr+5], pPage->pBt->usableSize); in dropCell()
7024 pPage->nFree = pPage->pBt->usableSize - pPage->hdrOffset in dropCell()
7108 assert( idx+sz <= (int)pPage->pBt->usableSize ); in insertCell()
7287 const int usableSize = pPg->pBt->usableSize; in rebuildPage() local
7288 u8 * const pEnd = &aData[usableSize]; in rebuildPage()
7300 if( j>(u32)usableSize ){ j = 0; } in rebuildPage()
7301 memcpy(&pTmp[j], &aData[j], usableSize - j); in rebuildPage()
7441 u8 * const pEnd = &aData[pPg->pBt->usableSize]; in pageFreeArray()
7512 memcpy(pTmp, aData, pPg->pBt->usableSize); in editPage()
7582 if( SQLITE_WITHIN(pCell, aData, &aData[pPg->pBt->usableSize]) ){ in editPage()
7664 pNew->nFree = pBt->usableSize - pNew->cellOffset - 2 - szCell; in balance_quick()
7790 assert( get2byte(&aFrom[iFromHdr+5]) <= (int)pBt->usableSize ); in copyNodeContent()
7794 memcpy(&aTo[iData], &aFrom[iData], pBt->usableSize-iData); in copyNodeContent()
7990 if( (iOff+szNew[i])<=(int)pBt->usableSize ){ in balance_nonroot()
8152 usableSpace = pBt->usableSize - 12 + leafCorrection; in balance_nonroot()
8745 if( pPage->nOverflow==0 && pPage->nFree*3<=(int)pCur->pBt->usableSize*2 ){ in balance()
8935 ovflPageSize = pBt->usableSize - 4; in btreeOverwriteCell()
9368 nIn = pSrc->pBt->usableSize - 4; in sqlite3BtreeTransferRow()
9387 nOut = MIN(pBt->usableSize - 4, nRem); in sqlite3BtreeTransferRow()
9476 (int)(pBt->usableSize*2/3) in sqlite3BtreeDelete()
9574 if( pCur->pPage->nFree*3<=(int)pCur->pBt->usableSize*2 ){ in sqlite3BtreeDelete()
10280 if( n>pCheck->pBt->usableSize/4-2 ){ in checkList()
10410 u32 usableSize; /* Usable size of the page */ in checkTreePage() local
10422 usableSize = pBt->usableSize; in checkTreePage()
10454 assert( contentOffset<=usableSize ); /* Enforced by btreeInitPage() */ in checkTreePage()
10495 if( pc<contentOffset || pc>usableSize-4 ){ in checkTreePage()
10497 pc, contentOffset, usableSize-4); in checkTreePage()
10503 if( pc+info.nSize>usableSize ){ in checkTreePage()
10522 assert( pc + info.nSize - 4 <= usableSize ); in checkTreePage()
10523 nPage = (info.nPayload - info.nLocal + usableSize - 5)/(usableSize - 4); in checkTreePage()
10580 assert( (u32)i<=usableSize-4 ); /* Enforced by btreeComputeFreeSpace() */ in checkTreePage()
10582 assert( (u32)(i+size)<=usableSize ); /* due to btreeComputeFreeSpace() */ in checkTreePage()
10592 assert( (u32)j<=usableSize-4 ); /* Enforced by btreeComputeFreeSpace() */ in checkTreePage()
10620 nFrag += usableSize - (prev&0xffff) - 1; in checkTreePage()