Lines Matching refs:iLvl
145732 int iLvl;
145745 for(iLvl=0; p && iLvl<nMaxDepth; iLvl++){
145746 if( apLeaf[iLvl]==0 ){
145747 apLeaf[iLvl] = p;
145751 pFree->pLeft = apLeaf[iLvl];
145759 apLeaf[iLvl] = 0;
177226 int iLvl;
177252 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
177253 Fts5StructureLevel *pLvl = &pRet->aLevel[iLvl];
177321 int iLvl,
177326 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
177456 int iLvl; /* Used to iterate through levels */
177457 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
177458 nSegment += pStruct->aLevel[iLvl].nSeg;
177487 int iLvl; /* Used to iterate through levels */
177505 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
177507 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
177593 int iLvl, /* Index level just updated */
177602 int nSeg = pStruct->aLevel[iLvl].nSeg;
177605 pSeg = &pStruct->aLevel[iLvl].aSeg[pStruct->aLevel[iLvl].nSeg-1];
177609 for(iTst=iLvl-1; iTst>=0 && pStruct->aLevel[iTst].nSeg==0; iTst--);
177630 iPromote = iLvl;
177674 static int fts5DlidxIterNextR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){
177675 Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl];
177677 assert( iLvl<pIter->nLvl );
177679 if( (iLvl+1) < pIter->nLvl ){
177680 fts5DlidxIterNextR(p, pIter, iLvl+1);
177685 FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno)
177794 static int fts5DlidxIterPrevR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){
177795 Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl];
177797 assert( iLvl<pIter->nLvl );
177799 if( (iLvl+1) < pIter->nLvl ){
177800 fts5DlidxIterPrevR(p, pIter, iLvl+1);
177805 FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno)
179917 int iLvl, iSeg;
179921 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
179922 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
179923 int iId = pStruct->aLevel[iLvl].aSeg[iSeg].iSegid;
179936 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
179937 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
179938 assert( iSegid!=pStruct->aLevel[iLvl].aSeg[iSeg].iSegid );
180535 int iLvl, /* Level to read input from */
180539 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
180551 assert( iLvl<pStruct->nLevel );
180557 pLvlOut = &pStruct->aLevel[iLvl+1];
180570 if( iLvl==pStruct->nLevel-1 ){
180574 fts5StructureExtendLevel(&p->rc, pStruct, iLvl+1, 1, 0);
180576 pLvl = &pStruct->aLevel[iLvl];
180577 pLvlOut = &pStruct->aLevel[iLvl+1];
180591 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
180593 assert( iLvl>=0 );
180594 for(fts5MultiIterNew(p, pStruct, flags, 0, 0, 0, iLvl, nInput, &pIter);
180686 int iLvl; /* To iterate through levels */
180692 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
180693 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
180696 iBestLvl = iLvl;
180703 iBestLvl = iLvl;
180709 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
180710 assert( pStruct->aLevel[iLvl].nSeg==0 );
180762 int iLvl = 0;
180765 while( p->rc==SQLITE_OK && pStruct->aLevel[iLvl].nSeg>=nCrisis ){
180766 fts5IndexMergeLevel(p, &pStruct, iLvl, 0);
180767 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
180768 fts5StructurePromote(p, iLvl+1, pStruct);
180769 iLvl++;
181014 int iLvl, iSeg;
181019 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
181020 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
181021 pLvl->aSeg[iSegOut] = pStruct->aLevel[iLvl].aSeg[iSeg];
181051 int iLvl;
181052 for(iLvl=0; pNew->aLevel[iLvl].nSeg==0; iLvl++){}
181053 while( p->rc==SQLITE_OK && pNew->aLevel[iLvl].nSeg>0 ){
181055 fts5IndexMergeLevel(p, &pNew, iLvl, &nRem);
182316 int iLvl, iSeg;
182317 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
182318 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
182319 Fts5StructureSegment *pSeg = &pStruct->aLevel[iLvl].aSeg[iSeg];
182430 int iLvl, iSeg; /* Iterate through levels, segments */
182432 for(iLvl=0; iLvl<p->nLevel; iLvl++){
182433 Fts5StructureLevel *pLvl = &p->aLevel[iLvl];
182435 " {lvl=%d nMerge=%d nSeg=%d", iLvl, pLvl->nMerge, pLvl->nSeg