Lines Matching refs:iLvl
844 int iLvl; in fts5StructureDecode() local
875 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){ in fts5StructureDecode()
876 Fts5StructureLevel *pLvl = &pRet->aLevel[iLvl]; in fts5StructureDecode()
908 if( iLvl>0 && pLvl[-1].nMerge && nTotal==0 ) rc = FTS5_CORRUPT; in fts5StructureDecode()
909 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT; in fts5StructureDecode()
954 int iLvl, in fts5StructureExtendLevel() argument
959 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl]; in fts5StructureExtendLevel()
1089 int iLvl; /* Used to iterate through levels */ in fts5StructureCountSegments() local
1090 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){ in fts5StructureCountSegments()
1091 nSegment += pStruct->aLevel[iLvl].nSeg; in fts5StructureCountSegments()
1120 int iLvl; /* Used to iterate through levels */ in fts5StructureWrite() local
1138 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){ in fts5StructureWrite()
1140 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl]; in fts5StructureWrite()
1226 int iLvl, /* Index level just updated */ in fts5StructurePromote() argument
1235 int nSeg = pStruct->aLevel[iLvl].nSeg; in fts5StructurePromote()
1238 pSeg = &pStruct->aLevel[iLvl].aSeg[pStruct->aLevel[iLvl].nSeg-1]; in fts5StructurePromote()
1242 for(iTst=iLvl-1; iTst>=0 && pStruct->aLevel[iTst].nSeg==0; iTst--); in fts5StructurePromote()
1263 iPromote = iLvl; in fts5StructurePromote()
1307 static int fts5DlidxIterNextR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){ in fts5DlidxIterNextR() argument
1308 Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl]; in fts5DlidxIterNextR()
1310 assert( iLvl<pIter->nLvl ); in fts5DlidxIterNextR()
1312 if( (iLvl+1) < pIter->nLvl ){ in fts5DlidxIterNextR()
1313 fts5DlidxIterNextR(p, pIter, iLvl+1); in fts5DlidxIterNextR()
1318 FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno) in fts5DlidxIterNextR()
1427 static int fts5DlidxIterPrevR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){ in fts5DlidxIterPrevR() argument
1428 Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl]; in fts5DlidxIterPrevR()
1430 assert( iLvl<pIter->nLvl ); in fts5DlidxIterPrevR()
1432 if( (iLvl+1) < pIter->nLvl ){ in fts5DlidxIterPrevR()
1433 fts5DlidxIterPrevR(p, pIter, iLvl+1); in fts5DlidxIterPrevR()
1438 FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno) in fts5DlidxIterPrevR()
3580 int iLvl, iSeg; in fts5AllocateSegid() local
3584 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){ in fts5AllocateSegid()
3585 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){ in fts5AllocateSegid()
3586 int iId = pStruct->aLevel[iLvl].aSeg[iSeg].iSegid; in fts5AllocateSegid()
3599 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){ in fts5AllocateSegid()
3600 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){ in fts5AllocateSegid()
3601 assert_nc( iSegid!=pStruct->aLevel[iLvl].aSeg[iSeg].iSegid ); in fts5AllocateSegid()
4211 int iLvl, /* Level to read input from */ in fts5IndexMergeLevel() argument
4215 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl]; in fts5IndexMergeLevel()
4228 assert( iLvl<pStruct->nLevel ); in fts5IndexMergeLevel()
4234 pLvlOut = &pStruct->aLevel[iLvl+1]; in fts5IndexMergeLevel()
4247 if( iLvl==pStruct->nLevel-1 ){ in fts5IndexMergeLevel()
4251 fts5StructureExtendLevel(&p->rc, pStruct, iLvl+1, 1, 0); in fts5IndexMergeLevel()
4253 pLvl = &pStruct->aLevel[iLvl]; in fts5IndexMergeLevel()
4254 pLvlOut = &pStruct->aLevel[iLvl+1]; in fts5IndexMergeLevel()
4268 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2); in fts5IndexMergeLevel()
4270 assert( iLvl>=0 ); in fts5IndexMergeLevel()
4271 for(fts5MultiIterNew(p, pStruct, flags, 0, 0, 0, iLvl, nInput, &pIter); in fts5IndexMergeLevel()
4367 int iLvl; /* To iterate through levels */ in fts5IndexMerge() local
4373 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){ in fts5IndexMerge()
4374 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl]; in fts5IndexMerge()
4377 iBestLvl = iLvl; in fts5IndexMerge()
4384 iBestLvl = iLvl; in fts5IndexMerge()
4390 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){ in fts5IndexMerge()
4391 assert( pStruct->aLevel[iLvl].nSeg==0 ); in fts5IndexMerge()
4443 int iLvl = 0; in fts5IndexCrisismerge() local
4446 while( p->rc==SQLITE_OK && pStruct->aLevel[iLvl].nSeg>=nCrisis ){ in fts5IndexCrisismerge()
4447 fts5IndexMergeLevel(p, &pStruct, iLvl, 0); in fts5IndexCrisismerge()
4448 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) ); in fts5IndexCrisismerge()
4449 fts5StructurePromote(p, iLvl+1, pStruct); in fts5IndexCrisismerge()
4450 iLvl++; in fts5IndexCrisismerge()
4697 int iLvl, iSeg; in fts5IndexOptimizeStruct() local
4702 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){ in fts5IndexOptimizeStruct()
4703 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){ in fts5IndexOptimizeStruct()
4704 pLvl->aSeg[iSegOut] = pStruct->aLevel[iLvl].aSeg[iSeg]; in fts5IndexOptimizeStruct()
4734 int iLvl; in sqlite3Fts5IndexOptimize() local
4735 for(iLvl=0; pNew->aLevel[iLvl].nSeg==0; iLvl++){} in sqlite3Fts5IndexOptimize()
4736 while( p->rc==SQLITE_OK && pNew->aLevel[iLvl].nSeg>0 ){ in sqlite3Fts5IndexOptimize()
4738 fts5IndexMergeLevel(p, &pNew, iLvl, &nRem); in sqlite3Fts5IndexOptimize()
6160 int iLvl, iSeg; in sqlite3Fts5IndexIntegrityCheck() local
6161 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){ in sqlite3Fts5IndexIntegrityCheck()
6162 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){ in sqlite3Fts5IndexIntegrityCheck()
6163 Fts5StructureSegment *pSeg = &pStruct->aLevel[iLvl].aSeg[iSeg]; in sqlite3Fts5IndexIntegrityCheck()
6275 int iLvl, iSeg; /* Iterate through levels, segments */ in fts5DebugStructure() local
6277 for(iLvl=0; iLvl<p->nLevel; iLvl++){ in fts5DebugStructure()
6278 Fts5StructureLevel *pLvl = &p->aLevel[iLvl]; in fts5DebugStructure()
6280 " {lvl=%d nMerge=%d nSeg=%d", iLvl, pLvl->nMerge, pLvl->nSeg in fts5DebugStructure()