2799   u16 saved_nEq;                  /* Original value of pNew->u.btree.nEq */  in whereLoopAddBtreeIndex()  local
2830   saved_nEq = pNew->u.btree.nEq;  in whereLoopAddBtreeIndex()
2838   pTerm = whereScanInit(&scan, pBuilder->pWC, pSrc->iCursor, saved_nEq,  in whereLoopAddBtreeIndex()
2852      && indexColumnNotNull(pProbe, saved_nEq)  in whereLoopAddBtreeIndex()
2867     if( IsUniqueIndex(pProbe) && saved_nEq==pProbe->nKeyCol-1 ){  in whereLoopAddBtreeIndex()
2873     pNew->u.btree.nEq = saved_nEq;  in whereLoopAddBtreeIndex()
2932         M = pProbe->aiRowLogEst[saved_nEq];  in whereLoopAddBtreeIndex()
2940              saved_nEq, M, logK, nIn, rLogSize, x));  in whereLoopAddBtreeIndex()
2945              saved_nEq, M, logK, nIn, rLogSize, x, nInMul));  in whereLoopAddBtreeIndex()
2951              saved_nEq, M, logK, nIn, rLogSize, x, nInMul));  in whereLoopAddBtreeIndex()
2957       int iCol = pProbe->aiColumn[saved_nEq];  in whereLoopAddBtreeIndex()
2959       assert( saved_nEq==pNew->u.btree.nEq );  in whereLoopAddBtreeIndex()
2961        || (iCol>=0 && nInMul==0 && saved_nEq==pProbe->nKeyCol-1)  in whereLoopAddBtreeIndex()
2976           pParse, pSrc->iCursor, pProbe, saved_nEq, pTerm  in whereLoopAddBtreeIndex()
3024       if( pTerm->truthProb<=0 && pProbe->aiColumn[saved_nEq]>=0 ){  in whereLoopAddBtreeIndex()
3127   pNew->u.btree.nEq = saved_nEq;  in whereLoopAddBtreeIndex()
3146   if( saved_nEq==saved_nSkip  in whereLoopAddBtreeIndex()
3147    && saved_nEq+1<pProbe->nKeyCol  in whereLoopAddBtreeIndex()
3148    && saved_nEq==pNew->nLTerm  in whereLoopAddBtreeIndex()
3152    && pProbe->aiRowLogEst[saved_nEq+1]>=42  /* TUNING: Minimum for skip-scan */  in whereLoopAddBtreeIndex()
3160     nIter = pProbe->aiRowLogEst[saved_nEq] - pProbe->aiRowLogEst[saved_nEq+1];  in whereLoopAddBtreeIndex()
3167     pNew->u.btree.nEq = saved_nEq;  in whereLoopAddBtreeIndex()
3173                       pProbe->pTable->zName, pProbe->zName, saved_nEq, rc));  in whereLoopAddBtreeIndex()