163525   u8 nLevel;                /* Number of nested loop */  member
165087   while( ++iLevel < pWInfo->nLevel ){
165190        iLevel, pWInfo->nLevel, (u64)notReady, pLevel->iFrom);
165988     if( pWInfo->nLevel>1 || pTabItem->fg.fromExists ){
165991       nNotReady = pWInfo->nLevel - iLevel - 1;
168698   pInner = &pWInfo->a[pWInfo->nLevel-1];
168719   for(i=pWInfo->nLevel-1; i>=0; i--){
169958     while( ++iLevel < pWInfo->nLevel ){
169976   }while( iLevel < pWInfo->nLevel );
173534   SrcItem *pEnd = &pTabList->a[pWInfo->nLevel];
174242   int nLoop = pWInfo->nLevel;    /* Number of terms in the join */
174446   nLoop = pWInfo->nLevel;
174767   assert( pWInfo->nLevel==nLoop );
174896   for(i=0; i<pWInfo->nLevel; i++){
175129   assert( pWInfo->nLevel>=2 );
175142   for(i=pWInfo->nLevel-1; i>=1; i--){
175184     if( i!=pWInfo->nLevel-1 ){
175185       int nByte = (pWInfo->nLevel-1-i) * sizeof(WhereLevel);
175188     pWInfo->nLevel--;
175189     assert( pWInfo->nLevel>0 );
175218   assert( pWInfo->nLevel>=2 );
175220   for(i=0; i<pWInfo->nLevel; i++){
175502   pWInfo->nLevel = nTabList;
175744     for(ii=0; ii<pWInfo->nLevel; ii++){
175761   if( pWInfo->nLevel>=2       /* Must be a join, or this opt8n is pointless */
175767     nTabList = pWInfo->nLevel;
175774   if( pWInfo->nLevel>=2
175808   assert( (wctrlFlags & WHERE_ONEPASS_DESIRED)==0 || pWInfo->nLevel==1 );
176126   for(i=pWInfo->nLevel-1; i>=0; i--){
176149        && i==pWInfo->nLevel-1  /* Ticket [ef9318757b152e3] 2017-10-21 */
176305   assert( pWInfo->nLevel<=pTabList->nSrc );
176306   for(i=0, pLevel=pWInfo->a; i<pWInfo->nLevel; i++, pLevel++){
250510   int nLevel;                     /* Number of levels in this index */  member
251124     for(i=0; i<pStruct->nLevel; i++){
251160     i64 nByte = SZ_FTS5STRUCTURE(p->nLevel);
251166       for(i=0; i<p->nLevel; i++) pNew->aLevel[i].aSeg = 0;
251167       for(i=0; i<p->nLevel; i++){
251172           for(i=0; i<p->nLevel; i++){
251208   int nLevel = 0;  local
251227   i += fts5GetVarint32(&pData[i], nLevel);
251229   if( nLevel>FTS5_MAX_SEGMENT   || nLevel<0
251234   nByte = SZ_FTS5STRUCTURE(nLevel);
251239     pRet->nLevel = nLevel;
251243     for(iLvl=0; rc==SQLITE_OK && iLvl<nLevel; iLvl++){
251286         if( iLvl==nLevel-1 && pLvl->nMerge ) rc = FTS5_CORRUPT;
251313     int nLevel = pStruct->nLevel;  local
251314     sqlite3_int64 nByte = SZ_FTS5STRUCTURE(nLevel+2);
251318       memset(&pStruct->aLevel[nLevel], 0, sizeof(Fts5StructureLevel));
251319       pStruct->nLevel++;
251436       assert_nc( p->pStruct->nLevel==pTest->nLevel );
251437       for(i=0; i<pTest->nLevel; i++){
251476     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
251523       fts5BufferSafeAppendVarint(&buf, pStruct->nLevel);
251528     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
251589     for(il=iPromote+1; il<pStruct->nLevel; il++){
254062       Fts5StructureLevel *pEnd = &pStruct->aLevel[pStruct->nLevel];
254216       for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
254231       for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
254865   assert( iLvl<pStruct->nLevel );
254884     if( iLvl==pStruct->nLevel-1 ){
254911   bOldest = (pLvlOut->nSeg==1 && pStruct->nLevel==iLvl+2);
255014     for(ii=0; ii<pStruct->nLevel; ii++){
255062     assert( pStruct->nLevel>0 );
255063     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
255117     nRem = (int)(p->nWorkUnit * nWork * pStruct->nLevel);
255129   if( pStruct && pStruct->nLevel>0 ){
255133       assert( p->rc!=SQLITE_OK || pStruct->nLevel>(iLvl+1) );
255856         if( pStruct->nLevel==0 ){
255928   for(i=0; i<pStruct->nLevel; i++){
255941   nByte += (((i64)pStruct->nLevel)+1) * sizeof(Fts5StructureLevel);
255942   assert( nByte==(i64)SZ_FTS5STRUCTURE(pStruct->nLevel+2) );
255948     pNew->nLevel = MIN(pStruct->nLevel+1, FTS5_MAX_LEVEL);
255952     pLvl = &pNew->aLevel[pNew->nLevel-1];
255960       for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
256027     if( pStruct && pStruct->nLevel ){
257370     for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
258220     for(iLvl=pStruct->nLevel-1; iLvl>=0; iLvl--){
258734   for(iLvl=0; iLvl<pStruct->nLevel; iLvl++){
258872   for(iLvl=0; iLvl<p->nLevel; iLvl++){
259444   while( pCsr->iLevel<p->nLevel && pCsr->iSeg>=p->aLevel[pCsr->iLevel].nSeg ){
259448   if( pCsr->iLevel>=p->nLevel ){