Lines Matching refs:nInMul
115154 LogEst nInMul /* log(Number of iterations due to IN) */
115226 whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nIter + nInMul);
115251 assert( nInMul==0
115272 if( iCol<0 || (nInMul==0 && pNew->u.btree.nEq==pProbe->nKeyCol-1) ){
115299 ** values of nIn and nInMul. In other words, assuming that all
115301 ** the value of pNew->nOut to account for pTerm (but not nIn/nInMul). */
115320 if( nInMul==0
115368 pNew->rRun += nInMul + nIn;
115369 pNew->nOut += nInMul + nIn;
115382 whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nInMul+nIn);