Lines Matching refs:LogEst
12932 ** For example, quantities 16 and 17 are both represented by a LogEst
12933 ** of 40. However, since LogEst quantities are suppose to be estimates,
12936 ** "LogEst" is short for "Logarithmic Estimate".
12945 ** The LogEst can be negative to indicate fractional values.
12950 typedef INT16_TYPE LogEst;
14207 SQLITE_PRIVATE void sqlite3VdbeScanStatus(Vdbe*, int, int, int, LogEst, const char*);
15778 LogEst nRowLogEst; /* Estimated rows in table - from sqlite_stat1 table */
15779 LogEst szTabRow; /* Estimated size of each table row in bytes */
15781 LogEst costMult; /* Cost multiplier for using this table */
16039 LogEst *aiRowLogEst; /* From ANALYZE: Est. rows selected by each column */
16049 LogEst szIdxRow; /* Estimated average row size in bytes */
16612 LogEst nSelectRow; /* Estimated number of result rows */
17655 SQLITE_PRIVATE LogEst sqlite3WhereOutputRowCount(WhereInfo*);
17849 SQLITE_PRIVATE LogEst sqlite3LogEst(u64);
17850 SQLITE_PRIVATE LogEst sqlite3LogEstAdd(LogEst,LogEst);
17852 SQLITE_PRIVATE LogEst sqlite3LogEstFromDouble(double);
17857 SQLITE_PRIVATE u64 sqlite3LogEstToInt(LogEst);
18971 LogEst nEst; /* Estimated output rows per loop */
29886 ** Find (an approximate) sum of two LogEst values. This computation is
29887 ** not a simple "+" operator because LogEst is stored as a logarithmic
29891 SQLITE_PRIVATE LogEst sqlite3LogEstAdd(LogEst a, LogEst b){
29915 ** Convert an integer into a LogEst. In other words, compute an
29918 SQLITE_PRIVATE LogEst sqlite3LogEst(u64 x){
29919 static LogEst a[] = { 0, 2, 3, 5, 6, 7, 8, 9 };
29920 LogEst y = 40;
29939 ** Convert a double into a LogEst
29942 SQLITE_PRIVATE LogEst sqlite3LogEstFromDouble(double x){
29944 LogEst e;
29958 ** Convert a LogEst into an integer.
29963 SQLITE_PRIVATE u64 sqlite3LogEstToInt(LogEst x){
73747 LogEst nEst, /* Estimated number of output rows */
79649 LogEst x = pScan->nEst;
100289 LogEst *aLog, /* Or, if aOut==0, here */
104487 ROUND8(sizeof(LogEst)*(nCol+1) + /* Index.aiRowLogEst */
104494 p->aiRowLogEst = (LogEst*)pExtra; pExtra += sizeof(LogEst)*(nCol+1);
105076 LogEst aVal[] = { 33, 32, 30, 28, 26 };
105077 LogEst *a = pIdx->aiRowLogEst;
105093 memcpy(&a[1], aVal, nCopy*sizeof(LogEst));
117275 LogEst szThreshold; /* Size threshold above which reanalysis is needd */
128746 LogEst rSetup; /* One-time setup cost (ex: create transient index) */
128747 LogEst rRun; /* Cost of running each loop */
128748 LogEst nOut; /* Estimated number of output rows */
128782 LogEst rRun; /* Cost of running this subquery */
128783 LogEst nOut; /* Number of outputs for this subquery */
128817 LogEst nRow; /* Estimated number of rows generated by this path */
128818 LogEst rCost; /* Total cost of this path */
128819 LogEst rUnsorted; /* Total cost of this path ignoring sorting costs */
128878 LogEst truthProb; /* Probability of truth for this expression */
129051 LogEst iLimit; /* LIMIT if wctrlFlags has WHERE_USE_LIMIT */
129067 LogEst nRowOut; /* Estimated number of output rows */
132957 SQLITE_PRIVATE LogEst sqlite3WhereOutputRowCount(WhereInfo *pWInfo){
133053 LogEst rRun, /* Run-cost of the new entry */
133054 LogEst nOut /* Number of outputs for the new entry */
133426 static LogEst estLog(LogEst N){
134157 static LogEst whereRangeAdjust(WhereTerm *pTerm, LogEst nNew){
134158 LogEst nRet = nNew;
134341 LogEst nNew;
134489 pLoop->nOut = (LogEst)nOut;
135110 ** value corresponds to -1 in LogEst notation, so this means decrement
135125 LogEst nRow /* Number of rows in the entire table */
135130 LogEst iReduce = 0; /* pLoop->nOut should not exceed nRow-iReduce */
135260 LogEst nInMul /* log(Number of iterations due to IN) */
135276 LogEst saved_nOut; /* Original value of pNew->nOut */
135278 LogEst rSize; /* Number of rows in the table */
135279 LogEst rLogSize; /* Logarithm of table size */
135314 LogEst rCostIdx;
135315 LogEst nOutUnadjusted; /* nOut before IN() and WHERE adjustments */
135552 LogEst nIter;
135696 LogEst aiRowEstPk[2]; /* The aiRowLogEst[] value for the sPk index */
135704 LogEst rSize; /* number of rows in the table */
135705 LogEst rLogSize; /* Logarithm of the number of rows in the table */
135773 ** the table being indexed and where X is 7 (LogEst=28) for normal
135774 ** tables or 1.375 (LogEst=4) for views and subqueries. The value
135871 LogEst nLookup = rSize + 16; /* Base cost: N*3 */
136759 static LogEst whereSortingCost(
136761 LogEst nRow,
136778 LogEst rScale, rSortCost;
136804 static int wherePathSolver(WhereInfo *pWInfo, LogEst nRowEst){
136813 LogEst mxCost = 0; /* Maximum cost of a set of paths */
136814 LogEst mxUnsorted = 0; /* Maximum unsorted cost of a set of path */
136822 LogEst *aSortCost = 0; /* Sorting and partial sorting costs */
136849 nSpace += sizeof(LogEst) * nOrderBy;
136866 aSortCost = (LogEst*)pX;
136867 memset(aSortCost, 0, sizeof(LogEst) * nOrderBy);
136897 LogEst nOut; /* Rows visited by (pFrom+pWLoop) */
136898 LogEst rCost; /* Cost of path (pFrom+pWLoop) */
136899 LogEst rUnsorted; /* Unsorted cost of (pFrom+pWLoop) */
137244 pLoop->nOut = (LogEst)1;
