899   pLoop->u.btree.nEq = pLoop->nLTerm = nKeyCol;  in constructAutomaticIndex()
2175     sqlite3DebugPrintf(" f %06x %d-%d", p->wsFlags, p->nLTerm,p->nSkip);  in sqlite3WhereLoopPrint()
2177     sqlite3DebugPrintf(" f %06x N %d", p->wsFlags, p->nLTerm);  in sqlite3WhereLoopPrint()
2180   if( p->nLTerm && (sqlite3WhereTrace & 0x100)!=0 ){  in sqlite3WhereLoopPrint()
2182     for(i=0; i<p->nLTerm; i++){  in sqlite3WhereLoopPrint()
2195   p->nLTerm = 0;  in whereLoopInit()
2228   p->nLTerm = 0;  in whereLoopClear()
2253   if( pFrom->nLTerm > pTo->nLSlot  in whereLoopXfer()
2254    && whereLoopResize(db, pTo, pFrom->nLTerm)  in whereLoopXfer()
2260   memcpy(pTo->aLTerm, pFrom->aLTerm, pTo->nLTerm*sizeof(pTo->aLTerm[0]));  in whereLoopXfer()
2322   if( pX->nLTerm-pX->nSkip >= pY->nLTerm-pY->nSkip ){  in whereLoopCheaperProperSubset()
2327   for(i=pX->nLTerm-1; i>=0; i--){  in whereLoopCheaperProperSubset()
2329     for(j=pY->nLTerm-1; j>=0; j--){  in whereLoopCheaperProperSubset()
2504     if( pTemplate->nLTerm ){  in whereLoopInsert()
2637     for(j=pLoop->nLTerm-1; j>=0; j--){  in whereLoopOutputAdjust()
2834   saved_nLTerm = pNew->nLTerm;  in whereLoopAddBtreeIndex()
2876     pNew->nLTerm = saved_nLTerm;  in whereLoopAddBtreeIndex()
2877     if( pNew->nLTerm>=pNew->nLSlot  in whereLoopAddBtreeIndex()
2878      && whereLoopResize(db, pNew, pNew->nLTerm+1)  in whereLoopAddBtreeIndex()
2882     pNew->aLTerm[pNew->nLTerm++] = pTerm;  in whereLoopAddBtreeIndex()
2903         for(i=0; i<pNew->nLTerm-1; i++){  in whereLoopAddBtreeIndex()
2992           if( whereLoopResize(db, pNew, pNew->nLTerm+1) ) break; /* OOM */  in whereLoopAddBtreeIndex()
2993           pNew->aLTerm[pNew->nLTerm++] = pTop;  in whereLoopAddBtreeIndex()
3005                        pNew->aLTerm[pNew->nLTerm-2] : 0;  in whereLoopAddBtreeIndex()
3133   pNew->nLTerm = saved_nLTerm;  in whereLoopAddBtreeIndex()
3148    && saved_nEq==pNew->nLTerm  in whereLoopAddBtreeIndex()
3153    && (rc = whereLoopResize(db, pNew, pNew->nLTerm+1))==SQLITE_OK  in whereLoopAddBtreeIndex()
3158     pNew->aLTerm[pNew->nLTerm++] = 0;  in whereLoopAddBtreeIndex()
3457         pNew->nLTerm = 1;  in whereLoopAddBtree()
3507     pNew->nLTerm = 0;  in whereLoopAddBtree()
3809   pNew->nLTerm = mxTerm+1;  in whereLoopAddVirtualOne()
3819   assert( pNew->nLTerm<=pNew->nLSlot );  in whereLoopAddVirtualOne()
4024   pNew->nLTerm = 0;  in whereLoopAddVirtual()
4222       pNew->nLTerm = 1;  in whereLoopAddOr()
4274   assert( pNew->nLTerm==0 );  in whereLoopAddAll()
4464         for(j=0; j<pLoop->nLTerm && pTerm!=pLoop->aLTerm[j]; j++){}  in wherePathSatisfiesOrderBy()
4465         if( j>=pLoop->nLTerm ) continue;  in wherePathSatisfiesOrderBy()
5212     pLoop->nLTerm = 1;  in whereShortCut()
5237       pLoop->nLTerm = j;  in whereShortCut()