Home
last modified time | relevance | path

Searched refs:iFree (Results 1 – 7 of 7) sorted by relevance

/sqlite-3.40.0/ext/lsm1/
H A Dlsm_shared.c625 int iFree; member
642 while( (p->iFree < pFree->nEntry) && p->iFree>=0 ){ in walkFreelistCb()
643 FreelistEntry *pEntry = &pFree->aEntry[p->iFree]; in walkFreelistCb()
649 p->iFree += iDir; in walkFreelistCb()
695 ctx[0].iFree = ctx[0].pFreelist->nEntry-1; in lsmWalkFreelist()
697 ctx[0].iFree = 0; in lsmWalkFreelist()
707 ctx[1].iFree = ctx[1].pFreelist->nEntry-1; in lsmWalkFreelist()
709 ctx[1].iFree = 0; in lsmWalkFreelist()
721 for(i=p->iFree; in lsmWalkFreelist()
H A Dlsm_sorted.c2012 if( pCsr->iFree < (nEntry*2) ){ in multiCursorGetKey()
2014 int i = nEntry - 1 - (pCsr->iFree / 2); in multiCursorGetKey()
2017 if( (pCsr->iFree % 2) ){ in multiCursorGetKey()
2558 && (pCsr->iFree % 2)==0 in multiCursorGetVal()
2878 pCsr->iFree = 0; in multiCursorEnd()
3181 if( pCsr->iFree % 2 ){ in flCsrAdvance()
3182 pCsr->iFree++; in flCsrAdvance()
3187 int i = nEntry - 1 - (pCsr->iFree / 2); in flCsrAdvance()
3194 pCsr->iFree--; in flCsrAdvance()
3198 pCsr->iFree += 2; in flCsrAdvance()
[all …]
H A Dlsm_tree.c2351 u32 iFree = iNext; /* Current chunk being rollback-freed */ in lsmTreeRollback() local
2354 pFree = treeShmChunk(pDb, iFree); in lsmTreeRollback()
2357 if( iFree<pMark->nChunk ){ in lsmTreeRollback()
2360 pDb->treehdr.iFirst = iFree; in lsmTreeRollback()
/sqlite-3.40.0/ext/recover/
H A Dsqlite3recover.c2073 int iFree = 0; in recoverIsValidPage() local
2083 iFree = (int)recoverGetU16(&a[1]); in recoverIsValidPage()
2095 if( iFree && iFree<=iContent ) return 0; in recoverIsValidPage()
2096 while( iFree ){ in recoverIsValidPage()
2099 if( iFree>(n-4) ) return 0; in recoverIsValidPage()
2100 iNext = recoverGetU16(&a[iFree]); in recoverIsValidPage()
2101 nByte = recoverGetU16(&a[iFree+2]); in recoverIsValidPage()
2102 if( iFree+nByte>n ) return 0; in recoverIsValidPage()
2103 if( iNext && iNext<iFree+nByte ) return 0; in recoverIsValidPage()
2104 memset(&aUsed[iFree], 0xFF, nByte); in recoverIsValidPage()
[all …]
/sqlite-3.40.0/ext/fts3/
H A Dfts3_write.c188 sqlite3_int64 iFree; /* Next free slot in %_segments */ member
2180 *piLast = iFree-1; in fts3NodeWrite()
2185 sqlite3_int64 iNextFree = iFree; in fts3NodeWrite()
2196 assert( iNextLeaf==iFree ); in fts3NodeWrite()
2268 pWriter->iFree = sqlite3_column_int64(pStmt, 0); in fts3SegWriterAdd()
2269 pWriter->iFirst = pWriter->iFree; in fts3SegWriterAdd()
2295 if( pWriter->iFree==LARGEST_INT64 ) return FTS_CORRUPT_VTAB; in fts3SegWriterAdd()
2296 rc = fts3WriteSegment(p, pWriter->iFree++, pWriter->aData, nData); in fts3SegWriterAdd()
2398 iLastLeaf = pWriter->iFree; in fts3SegWriterFlush()
2399 rc = fts3WriteSegment(p, pWriter->iFree++, pWriter->aData, pWriter->nData); in fts3SegWriterFlush()
[all …]
/sqlite-3.40.0/src/
H A Dbtree.c1530 int iFree = get2byte(&data[hdr+1]); in defragmentPage() local
1532 if( iFree ){ in defragmentPage()
1533 int iFree2 = get2byte(&data[iFree]); in defragmentPage()
1539 int sz = get2byte(&data[iFree+2]); in defragmentPage()
1541 if( top>=iFree ){ in defragmentPage()
1548 memmove(&data[iFree+sz+sz2], &data[iFree+sz], iFree2-(iFree+sz)); in defragmentPage()
1550 }else if( iFree+sz>usableSize ){ in defragmentPage()
1555 assert( cbrk+(iFree-top) <= usableSize ); in defragmentPage()
1556 memmove(&data[cbrk], &data[top], iFree-top); in defragmentPage()
1559 if( pc<iFree ){ put2byte(pAddr, pc+sz); } in defragmentPage()
[all …]
/sqlite-3.40.0/ext/fts5/
H A Dfts5_index.c5308 int iFree; in fts5SetupPrefixIter() local
5312 for(iFree=i; iFree<i+nMerge; iFree++){ in fts5SetupPrefixIter()
5313 fts5BufferFree(&aBuf[iFree]); in fts5SetupPrefixIter()