Lines Matching defs:iLvl
187138 int iLvl;
187151 for(iLvl=0; p && iLvl<nMaxDepth; iLvl++){
187152 if( apLeaf[iLvl]==0 ){
187153 apLeaf[iLvl] = p;
187157 pFree->pLeft = apLeaf[iLvl];
187165 apLeaf[iLvl] = 0;
230905 int iLvl;
230936 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
230937 Fts5StructureLevel *pLvl = &pRet->aLevel[iLvl];
230969 if( iLvl>0 && pLvl[-1].nMerge && nTotal==0 ) rc = FTS5_CORRUPT;
230970 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
231011 ** Extend level iLvl so that there is room for at least nExtra more
231017 int iLvl,
231022 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
231152 int iLvl; /* Used to iterate through levels */
231153 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
231154 nSegment += pStruct->aLevel[iLvl].nSeg;
231183 int iLvl; /* Used to iterate through levels */
231201 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
231203 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
231271 ** A new segment has just been written to level iLvl of index structure
231289 int iLvl, /* Index level just updated */
231298 int nSeg = pStruct->aLevel[iLvl].nSeg;
231301 pSeg = &pStruct->aLevel[iLvl].aSeg[pStruct->aLevel[iLvl].nSeg-1];
231305 for(iTst=iLvl-1; iTst>=0 && pStruct->aLevel[iTst].nSeg==0; iTst--);
231317 ** iLvl to level iTst. */
231326 iPromote = iLvl;
231370 static int fts5DlidxIterNextR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){
231371 Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl];
231373 assert( iLvl<pIter->nLvl );
231375 if( (iLvl+1) < pIter->nLvl ){
231376 fts5DlidxIterNextR(p, pIter, iLvl+1);
231381 FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno)
231490 static int fts5DlidxIterPrevR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){
231491 Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl];
231493 assert( iLvl<pIter->nLvl );
231495 if( (iLvl+1) < pIter->nLvl ){
231496 fts5DlidxIterPrevR(p, pIter, iLvl+1);
231501 FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno)
233662 int iLvl, iSeg;
233666 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
233667 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
233668 int iId = pStruct->aLevel[iLvl].aSeg[iSeg].iSegid;
233681 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
233682 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
233683 assert_nc( iSegid!=pStruct->aLevel[iLvl].aSeg[iSeg].iSegid );
234295 int iLvl, /* Level to read input from */
234299 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
234312 assert( iLvl<pStruct->nLevel );
234318 pLvlOut = &pStruct->aLevel[iLvl+1];
234331 if( iLvl==pStruct->nLevel-1 ){
234335 fts5StructureExtendLevel(&p->rc, pStruct, iLvl+1, 1, 0);
234337 pLvl = &pStruct->aLevel[iLvl];
234338 pLvlOut = &pStruct->aLevel[iLvl+1];
234352 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
234354 assert( iLvl>=0 );
234355 for(fts5MultiIterNew(p, pStruct, flags, 0, 0, 0, iLvl, nInput, &pIter);
234452 int iLvl; /* To iterate through levels */
234458 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
234459 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
234462 iBestLvl = iLvl;
234469 iBestLvl = iLvl;
234475 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
234476 assert( pStruct->aLevel[iLvl].nSeg==0 );
234528 int iLvl = 0;
234531 while( p->rc==SQLITE_OK && pStruct->aLevel[iLvl].nSeg>=nCrisis ){
234532 fts5IndexMergeLevel(p, &pStruct, iLvl, 0);
234533 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
234534 fts5StructurePromote(p, iLvl+1, pStruct);
234535 iLvl++;
234782 int iLvl, iSeg;
234787 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
234788 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
234789 pLvl->aSeg[iSegOut] = pStruct->aLevel[iLvl].aSeg[iSeg];
234819 int iLvl;
234820 for(iLvl=0; pNew->aLevel[iLvl].nSeg==0; iLvl++){}
234821 while( p->rc==SQLITE_OK && pNew->aLevel[iLvl].nSeg>0 ){
234823 fts5IndexMergeLevel(p, &pNew, iLvl, &nRem);
236237 int iLvl, iSeg;
236254 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
236255 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
236256 Fts5StructureSegment *pSeg = &pStruct->aLevel[iLvl].aSeg[iSeg];
236373 int iLvl, iSeg; /* Iterate through levels, segments */
236375 for(iLvl=0; iLvl<p->nLevel; iLvl++){
236376 Fts5StructureLevel *pLvl = &p->aLevel[iLvl];
236378 " {lvl=%d nMerge=%d nSeg=%d", iLvl, pLvl->nMerge, pLvl->nSeg