Lines Matching refs:nLoop
160019 int nLoop = 0;
160025 if( nLoop && (pTerm->wtFlags & TERM_LIKE)!=0 ){
160041 nLoop++;
169490 u16 nLoop, /* Number of entries in pPath->aLoop[] */
169542 if( nLoop && OptimizationDisabled(db, SQLITE_OrderByIdxJoin) ) return 0;
169555 for(iLoop=0; isOrderDistinct && obSat<obDone && iLoop<=nLoop; iLoop++){
169557 if( iLoop<nLoop ){
169849 static const char *wherePathName(WherePath *pPath, int nLoop, WhereLoop *pLast){
169852 for(i=0; i<nLoop; i++){ zName[i] = pPath->aLoop[i]->cId; }
169980 int nLoop = pWInfo->nLevel; /* Number of terms in the join */
169996 if( nLoop>=5
170015 for(iFromIdx=0, m=1; iFromIdx<nLoop; iFromIdx++, m<<=1){
170026 if( iFromIdx+4 > nLoop ) break; /* Impossible to reach nDep>=4 */
170148 int nLoop; /* Number of terms in the join */
170168 nLoop = pWInfo->nLevel;
170180 if( nLoop<=1 ){
170182 }else if( nLoop==2 ){
170189 assert( nLoop<=pWInfo->pTabList->nSrc );
170203 nSpace = (sizeof(WherePath)+sizeof(WhereLoop*)*nLoop)*mxChoice*2;
170211 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
170242 aFrom[0].isOrdered = nLoop>0 ? -1 : nOrderBy;
170248 for(iLoop=0; iLoop<nLoop; iLoop++){
170483 assert( pWInfo->nLevel==nLoop );
170485 for(iLoop=0; iLoop<nLoop; iLoop++){
170498 WHERE_DISTINCTBY, nLoop-1, pFrom->aLoop[nLoop-1], ¬Used);
170517 if( nLoop>0 ){
170518 u32 wsFlags = pFrom->aLoop[nLoop-1]->wsFlags;
170524 WHERE_ORDERBY_LIMIT, nLoop-1, pFrom->aLoop[nLoop-1], &m);
170533 }else if( nLoop
170541 && pWInfo->nOBSat==pWInfo->pOrderBy->nExpr && nLoop>0
170545 pFrom, 0, nLoop-1, pFrom->aLoop[nLoop-1], &revMask