49 LogEst sqlite3WhereOutputRowCount(WhereInfo *pWInfo){  in sqlite3WhereOutputRowCount()
206   LogEst rRun,           /* Run-cost of the new entry */  in whereOrInsert()
207   LogEst nOut            /* Number of outputs for the new entry */  in whereOrInsert()
651 static LogEst estLog(LogEst N){  in estLog()
1625 static LogEst whereRangeAdjust(WhereTerm *pTerm, LogEst nNew){  in whereRangeAdjust()
1626   LogEst nRet = nNew;  in whereRangeAdjust()
1810   LogEst nNew;  in whereRangeScanEst()
1960   pLoop->nOut = (LogEst)nOut;  in whereRangeScanEst()
2624   LogEst nRow            /* Number of rows in the entire table */  in whereLoopOutputAdjust()
2629   LogEst iReduce = 0;    /* pLoop->nOut should not exceed nRow-iReduce */  in whereLoopOutputAdjust()
2788   LogEst nInMul                   /* log(Number of iterations due to IN) */  in whereLoopAddBtreeIndex()
2804   LogEst saved_nOut;              /* Original value of pNew->nOut */  in whereLoopAddBtreeIndex()
2806   LogEst rSize;                   /* Number of rows in the table */  in whereLoopAddBtreeIndex()
2807   LogEst rLogSize;                /* Logarithm of table size */  in whereLoopAddBtreeIndex()
2845     LogEst rCostIdx;  in whereLoopAddBtreeIndex()
2846     LogEst nOutUnadjusted;        /* nOut before IN() and WHERE adjustments */  in whereLoopAddBtreeIndex()
2911         LogEst M, logK, x;  in whereLoopAddBtreeIndex()
3155     LogEst nIter;  in whereLoopAddBtreeIndex()
3381   LogEst aiRowEstPk[2];       /* The aiRowLogEst[] value for the sPk index */  in whereLoopAddBtree()
3389   LogEst rSize;               /* number of rows in the table */  in whereLoopAddBtree()
3447     LogEst rLogSize;         /* Logarithm of the number of rows in the table */  in whereLoopAddBtree()
3586           LogEst nLookup = rSize + 16;  /* Base cost:  N*3 */  in whereLoopAddBtree()
4726 static LogEst whereSortingCost(  in whereSortingCost()
4728   LogEst nRow,  in whereSortingCost()
4746   LogEst rScale, rSortCost;  in whereSortingCost()
4779 static int wherePathSolver(WhereInfo *pWInfo, LogEst nRowEst){  in wherePathSolver()
4787   LogEst mxCost = 0;        /* Maximum cost of a set of paths */  in wherePathSolver()
4788   LogEst mxUnsorted = 0;    /* Maximum unsorted cost of a set of path */  in wherePathSolver()
4796   LogEst *aSortCost = 0;    /* Sorting and partial sorting costs */  in wherePathSolver()
4822   nSpace += sizeof(LogEst) * nOrderBy;  in wherePathSolver()
4839     aSortCost = (LogEst*)pX;  in wherePathSolver()
4840     memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);  in wherePathSolver()
4870         LogEst nOut;                      /* Rows visited by (pFrom+pWLoop) */  in wherePathSolver()
4871         LogEst rCost;                     /* Cost of path (pFrom+pWLoop) */  in wherePathSolver()
4872         LogEst rUnsorted;                 /* Unsorted cost of (pFrom+pWLoop) */  in wherePathSolver()
5246     pLoop->nOut = (LogEst)1;  in whereShortCut()
5430   LogEst nSearch;  in whereCheckIfBloomFilterIsUseful()