Lines Matching refs:iLvl

156130           int iLvl;
156143           for(iLvl=0; p && iLvl<nMaxDepth; iLvl++){
156144             if( apLeaf[iLvl]==0 ){
156145               apLeaf[iLvl] = p;
156149               pFree->pLeft = apLeaf[iLvl];
156157               apLeaf[iLvl] = 0;
195116   int iLvl;
195142     for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
195143       Fts5StructureLevel *pLvl = &pRet->aLevel[iLvl];
195211   int iLvl, 
195216     Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
195346     int iLvl;                     /* Used to iterate through levels */
195347     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
195348       nSegment += pStruct->aLevel[iLvl].nSeg;
195377     int iLvl;                     /* Used to iterate through levels */
195395     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
195397       Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
195483   int iLvl,                       /* Index level just updated */
195492     int nSeg = pStruct->aLevel[iLvl].nSeg;
195495     pSeg = &pStruct->aLevel[iLvl].aSeg[pStruct->aLevel[iLvl].nSeg-1];
195499     for(iTst=iLvl-1; iTst>=0 && pStruct->aLevel[iTst].nSeg==0; iTst--);
195520       iPromote = iLvl;
195564 static int fts5DlidxIterNextR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){
195565   Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl];
195567   assert( iLvl<pIter->nLvl );
195569     if( (iLvl+1) < pIter->nLvl ){
195570       fts5DlidxIterNextR(p, pIter, iLvl+1);
195575             FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno)
195684 static int fts5DlidxIterPrevR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){
195685   Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl];
195687   assert( iLvl<pIter->nLvl );
195689     if( (iLvl+1) < pIter->nLvl ){
195690       fts5DlidxIterPrevR(p, pIter, iLvl+1);
195695             FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno)
197826       int iLvl, iSeg;
197830       for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
197831         for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
197832           int iId = pStruct->aLevel[iLvl].aSeg[iSeg].iSegid;
197845       for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
197846         for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
197847           assert( iSegid!=pStruct->aLevel[iLvl].aSeg[iSeg].iSegid );
198441   int iLvl,                       /* Level to read input from */
198445   Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
198458   assert( iLvl<pStruct->nLevel );
198464     pLvlOut = &pStruct->aLevel[iLvl+1];
198477     if( iLvl==pStruct->nLevel-1 ){
198481     fts5StructureExtendLevel(&p->rc, pStruct, iLvl+1, 1, 0);
198483     pLvl = &pStruct->aLevel[iLvl];
198484     pLvlOut = &pStruct->aLevel[iLvl+1];
198498   bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
198500   assert( iLvl>=0 );
198501   for(fts5MultiIterNew(p, pStruct, flags, 0, 0, 0, iLvl, nInput, &pIter);
198597     int iLvl;                   /* To iterate through levels */
198603     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
198604       Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
198607           iBestLvl = iLvl;
198614         iBestLvl = iLvl;
198620     for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){
198621       assert( pStruct->aLevel[iLvl].nSeg==0 );
198673   int iLvl = 0;
198676   while( p->rc==SQLITE_OK && pStruct->aLevel[iLvl].nSeg>=nCrisis ){
198677     fts5IndexMergeLevel(p, &pStruct, iLvl, 0);
198678     assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
198679     fts5StructurePromote(p, iLvl+1, pStruct);
198680     iLvl++;
198925       int iLvl, iSeg;
198930       for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
198931         for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
198932           pLvl->aSeg[iSegOut] = pStruct->aLevel[iLvl].aSeg[iSeg];
198962     int iLvl;
198963     for(iLvl=0; pNew->aLevel[iLvl].nSeg==0; iLvl++){}
198964     while( p->rc==SQLITE_OK && pNew->aLevel[iLvl].nSeg>0 ){
198966       fts5IndexMergeLevel(p, &pNew, iLvl, &nRem);
200234     int iLvl, iSeg;
200235     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
200236       for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
200237         Fts5StructureSegment *pSeg = &pStruct->aLevel[iLvl].aSeg[iSeg];
200348   int iLvl, iSeg;                 /* Iterate through levels, segments */
200350   for(iLvl=0; iLvl<p->nLevel; iLvl++){
200351     Fts5StructureLevel *pLvl = &p->aLevel[iLvl];
200353         " {lvl=%d nMerge=%d nSeg=%d", iLvl, pLvl->nMerge, pLvl->nSeg