Searched refs:nInMul (Results 1 – 4 of 4) sorted by relevance
| /external/chromium_org/third_party/sqlite/src/src/ |
| D | where.c | 2829 int nInMul = 1; /* Number of distinct equalities to lookup */ in bestBtreeIndex() local
2850 nInMul *= 25; in bestBtreeIndex()
2854 nInMul *= pExpr->x.pList->nExpr; in bestBtreeIndex()
2934 nRow = (double)(aiRowEst[nEq] * nInMul); in bestBtreeIndex()
2937 nInMul = (int)(nRow / aiRowEst[nEq]); in bestBtreeIndex()
2997 cost += (nInMul + nRow)*log10N; in bestBtreeIndex()
3003 cost += nInMul*log10N; in bestBtreeIndex()
3010 cost += nInMul*log10N; in bestBtreeIndex()
3089 nEq, nInMul, estBound, bSort, bLookup, wsFlags, in bestBtreeIndex()
|
| /external/chromium_org/third_party/sqlite/amalgamation/ |
| D | sqlite3.c | 100483 int nInMul = 1; /* Number of distinct equalities to lookup */
100504 nInMul *= 25;
100508 nInMul *= pExpr->x.pList->nExpr;
100588 nRow = (double)(aiRowEst[nEq] * nInMul);
100591 nInMul = (int)(nRow / aiRowEst[nEq]);
100651 cost += (nInMul + nRow)*log10N;
100657 cost += nInMul*log10N;
100664 cost += nInMul*log10N;
100743 nEq, nInMul, estBound, bSort, bLookup, wsFlags,
|
| /external/sqlite/dist/ |
| D | sqlite3.c | 115174 LogEst nInMul /* log(Number of iterations due to IN) */
115246 whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nIter + nInMul);
115271 assert( nInMul==0
115292 if( iCol<0 || (nInMul==0 && pNew->u.btree.nEq==pProbe->nKeyCol-1) ){
115340 if( nInMul==0
115388 pNew->rRun += nInMul + nIn;
115389 pNew->nOut += nInMul + nIn;
115402 whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nInMul+nIn);
|
| /external/sqlite/dist/orig/ |
| D | sqlite3.c | 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) ){
115320 if( nInMul==0
115368 pNew->rRun += nInMul + nIn;
115369 pNew->nOut += nInMul + nIn;
115382 whereLoopAddBtreeIndex(pBuilder, pSrc, pProbe, nInMul+nIn);
|