4359   u16 nLoop,            /* Number of entries in pPath->aLoop[] */  in wherePathSatisfiesOrderBy()  argument
4411   if( nLoop && OptimizationDisabled(db, SQLITE_OrderByIdxJoin) ) return 0;  in wherePathSatisfiesOrderBy()
4424   for(iLoop=0; isOrderDistinct && obSat<obDone && iLoop<=nLoop; iLoop++){  in wherePathSatisfiesOrderBy()
4426     if( iLoop<nLoop ){  in wherePathSatisfiesOrderBy()
4711 static const char *wherePathName(WherePath *pPath, int nLoop, WhereLoop *pLast){  in wherePathName()  argument
4714   for(i=0; i<nLoop; i++){ zName[i] = pPath->aLoop[i]->cId; }  in wherePathName()
4781   int nLoop;                /* Number of terms in the join */  in wherePathSolver()  local
4801   nLoop = pWInfo->nLevel;  in wherePathSolver()
4805   mxChoice = (nLoop<=1) ? 1 : (nLoop==2 ? 5 : 10);  in wherePathSolver()
4806   assert( nLoop<=pWInfo->pTabList->nSrc );  in wherePathSolver()
4821   nSpace = (sizeof(WherePath)+sizeof(WhereLoop*)*nLoop)*mxChoice*2;  in wherePathSolver()
4829   for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){  in wherePathSolver()
4860     aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;  in wherePathSolver()
4866   for(iLoop=0; iLoop<nLoop; iLoop++){  in wherePathSolver()
5090   assert( pWInfo->nLevel==nLoop );  in wherePathSolver()
5092   for(iLoop=0; iLoop<nLoop; iLoop++){  in wherePathSolver()
5105                  WHERE_DISTINCTBY, nLoop-1, pFrom->aLoop[nLoop-1], &notUsed);  in wherePathSolver()
5121         if( nLoop>0 ){  in wherePathSolver()
5122           u32 wsFlags = pFrom->aLoop[nLoop-1]->wsFlags;  in wherePathSolver()
5128                       WHERE_ORDERBY_LIMIT, nLoop-1, pFrom->aLoop[nLoop-1], &m);  in wherePathSolver()
5137       }else if( nLoop  in wherePathSolver()
5145         && pWInfo->nOBSat==pWInfo->pOrderBy->nExpr && nLoop>0  in wherePathSolver()
5149           pFrom, 0, nLoop-1, pFrom->aLoop[nLoop-1], &revMask  in wherePathSolver()