Lines Matching refs:nFree

3628   int nFree;
4639   assert( pPage->nFree>=0 );
4640   if( data[hdr+7]+cbrk-iCellFirst!=pPage->nFree ){
4718   assert( pPage->nFree>=nByte );
4764     assert( pPage->nFree>=0 );
4765     rc = defragmentPage(pPage, ((4)<(pPage->nFree - (2+nByte))?(4):(pPage->nFree - (2+nByte))));
4868   pPage->nFree += iOrigSize;
4930   int nFree;
4942   assert( pPage->nFree<0 );
4959   nFree = data[hdr+7] + top;
4975       nFree = nFree + size;
4989   if( nFree>usableSize || nFree<iCellFirst ){
4992   pPage->nFree = (u16)(nFree - iCellFirst);
5073   pPage->nFree = -1;
5104   pPage->nFree = (u16)(pBt->usableSize - first);
6484 static Pgno finalDbSize(BtShared *pBt, Pgno nOrig, Pgno nFree){
6490   nPtrmap = (nFree-nOrig+ptrmapPageno(pBt, nOrig)+nEntry)/nEntry;
6491   nFin = nOrig - nFree - nPtrmap;
6512     Pgno nFree = sqlite3Get4byte(&pBt->pPage1->aData[36]);
6513     Pgno nFin = finalDbSize(pBt, nOrig, nFree);
6517     }else if( nFree>0 ){
6545     Pgno nFree;
6558     nFree = sqlite3Get4byte(&pBt->pPage1->aData[36]);
6559     nFin = finalDbSize(pBt, nOrig, nFree);
6567     if( (rc==101 || rc==0) && nFree>0 ){
8177   u32 nFree;
8196   nFree = sqlite3Get4byte(&pPage1->aData[36]);
8197   sqlite3Put4byte(&pPage1->aData[36], nFree+1);
8219   if( nFree!=0 ){
8508   assert( pPage->nFree>=0 );
8529     pPage->nFree = pPage->pBt->usableSize - pPage->hdrOffset
8534     pPage->nFree += 2;
8565   assert( pPage->nFree>=0 );
8566   if( pPage->nOverflow || sz+2>pPage->nFree ){
8605     pPage->nFree -= (u16)(2 + sz);
8947   assert( pPage->nFree>=0 );
8948   assert( pParent->nFree>=0 );
8978     pNew->nFree = pBt->usableSize - pNew->cellOffset - 2 - szCell;
9021     assert( pFrom->nFree>=iToHdr );
9105   assert( pParent->nFree>=0 );
9134     if( apOld[i]->nFree<0 ){
9288     assert( p->nFree>=0 );
9289     szNew[i] = usableSpace - p->nFree;
9572       apNew[iPg]->nFree = usableSpace-szNew[iPg];
9584   if( isRoot && pParent->nCell==0 && pParent->hdrOffset<=apNew[0]->nFree ){
9589     assert( apNew[0]->nFree ==
9688     if( (pPage->nFree<0) && btreeComputeFreeSpace(pPage) ) break;
9710     }else if( pPage->nOverflow==0 && pPage->nFree<=nMin ){
9717       if( rc==0 && pParent->nFree<0 ){
9980   if( pPage->nFree<0 ){
10092   if( pPage->nFree<0 && btreeComputeFreeSpace(pPage) ) return 11;
10096      || (pPage->nFree+cellSizePtr(pPage,pCell)+2)>(int)(pBt->usableSize*2/3)
10147     if( pLeaf->nFree<0 ){