Lines Matching refs:iLvl
193721 int iLvl;
193734 for(iLvl=0; p && iLvl<nMaxDepth; iLvl++){
193735 if( apLeaf[iLvl]==0 ){
193736 apLeaf[iLvl] = p;
193740 pFree->pLeft = apLeaf[iLvl];
193748 apLeaf[iLvl] = 0;
241592 int iLvl;
241631 for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
241632 Fts5StructureLevel *pLvl = &pRet->aLevel[iLvl];
241673 if( iLvl>0 && pLvl[-1].nMerge && nTotal==0 ) rc = FTS5_CORRUPT;
241674 if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
241725 int iLvl,
241730 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
241860 int iLvl; /* Used to iterate through levels */
241861 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
241862 nSegment += pStruct->aLevel[iLvl].nSeg;
241891 int iLvl; /* Used to iterate through levels */
241913 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
241915 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
242009 int iLvl, /* Index level just updated */
242018 int nSeg = pStruct->aLevel[iLvl].nSeg;
242021 pSeg = &pStruct->aLevel[iLvl].aSeg[pStruct->aLevel[iLvl].nSeg-1];
242025 for(iTst=iLvl-1; iTst>=0 && pStruct->aLevel[iTst].nSeg==0; iTst--);
242046 iPromote = iLvl;
242090 static int fts5DlidxIterNextR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){
242091 Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl];
242093 assert( iLvl<pIter->nLvl );
242095 if( (iLvl+1) < pIter->nLvl ){
242096 fts5DlidxIterNextR(p, pIter, iLvl+1);
242101 FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno)
242193 static int fts5DlidxIterPrevR(Fts5Index *p, Fts5DlidxIter *pIter, int iLvl){
242194 Fts5DlidxLvl *pLvl = &pIter->aLvl[iLvl];
242196 assert( iLvl<pIter->nLvl );
242198 if( (iLvl+1) < pIter->nLvl ){
242199 fts5DlidxIterPrevR(p, pIter, iLvl+1);
242204 FTS5_DLIDX_ROWID(pIter->iSegid, iLvl, pLvl[1].iLeafPgno)
244595 int iLvl, iSeg;
244599 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
244600 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
244601 int iId = pStruct->aLevel[iLvl].aSeg[iSeg].iSegid;
244614 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
244615 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
244616 assert_nc( iSegid!=pStruct->aLevel[iLvl].aSeg[iSeg].iSegid );
245231 int iLvl, /* Level to read input from */
245235 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
245248 assert( iLvl<pStruct->nLevel );
245254 pLvlOut = &pStruct->aLevel[iLvl+1];
245267 if( iLvl==pStruct->nLevel-1 ){
245271 fts5StructureExtendLevel(&p->rc, pStruct, iLvl+1, 1, 0);
245273 pLvl = &pStruct->aLevel[iLvl];
245274 pLvlOut = &pStruct->aLevel[iLvl+1];
245294 bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
245296 assert( iLvl>=0 );
245297 for(fts5MultiIterNew(p, pStruct, flags, 0, 0, 0, iLvl, nInput, &pIter);
245434 int iLvl; /* To iterate through levels */
245441 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
245442 Fts5StructureLevel *pLvl = &pStruct->aLevel[iLvl];
245445 iBestLvl = iLvl;
245452 iBestLvl = iLvl;
245508 int iLvl = 0;
245509 while( p->rc==SQLITE_OK && pStruct->aLevel[iLvl].nSeg>=nCrisis ){
245510 fts5IndexMergeLevel(p, &pStruct, iLvl, 0);
245511 assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
245512 fts5StructurePromote(p, iLvl+1, pStruct);
245513 iLvl++;
246295 int iLvl, iSeg;
246300 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
246301 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
246302 pLvl->aSeg[iSegOut] = pStruct->aLevel[iLvl].aSeg[iSeg];
246334 int iLvl;
246335 for(iLvl=0; pNew->aLevel[iLvl].nSeg==0; iLvl++){}
246336 while( p->rc==SQLITE_OK && pNew->aLevel[iLvl].nSeg>0 ){
246338 fts5IndexMergeLevel(p, &pNew, iLvl, &nRem);
247423 int iLvl, iSeg, ii;
247439 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
247440 for(iSeg=pStruct->aLevel[iLvl].nSeg-1; iSeg>=0; iSeg--){
247441 Fts5StructureSegment *pSeg = &pStruct->aLevel[iLvl].aSeg[iSeg];
248204 int iLvl;
248205 for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
248207 for(iSeg=pStruct->aLevel[iLvl].nSeg-1; iSeg>=0; iSeg--){
248208 Fts5StructureSegment *pSeg = &pStruct->aLevel[iLvl].aSeg[iSeg];
248690 int iLvl, iSeg;
248707 for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
248708 for(iSeg=0; iSeg<pStruct->aLevel[iLvl].nSeg; iSeg++){
248709 Fts5StructureSegment *pSeg = &pStruct->aLevel[iLvl].aSeg[iSeg];
248832 int iLvl, iSeg; /* Iterate through levels, segments */
248834 for(iLvl=0; iLvl<p->nLevel; iLvl++){
248835 Fts5StructureLevel *pLvl = &p->aLevel[iLvl];
248837 " {lvl=%d nMerge=%d nSeg=%d", iLvl, pLvl->nMerge, pLvl->nSeg