Lines Matching refs:rRun

118140   LogEst rRun;          /* Cost of running each loop */
118172 LogEst rRun; /* Cost of running this subquery */
121510 LogEst rRun, /* Run-cost of the new entry */
121516 if( rRun<=p->rRun && (prereq & p->prereq)==prereq ){
121519 if( p->rRun<=rRun && (p->prereq & prereq)==p->prereq ){
121529 if( p->rRun>pSet->a[i].rRun ) p = pSet->a + i;
121531 if( p->rRun<=rRun ) return 0;
121535 p->rRun = rRun;
122742 WhereLoop *pLoop /* Modify the .nOut and maybe .rRun fields */
123073 sqlite3DebugPrintf(" cost %d,%d,%d\n", p->rSetup, p->rRun, p->nOut);
123211 if( pX->rRun >= pY->rRun ){
123212 if( pX->rRun > pY->rRun ) return 0; /* X costs more than Y */
123248 pTemplate->rRun, pTemplate->nOut, p->rRun, p->nOut-1));
123249 pTemplate->rRun = p->rRun;
123255 pTemplate->rRun, pTemplate->nOut, p->rRun, p->nOut+1));
123256 pTemplate->rRun = p->rRun;
123317 && p->rRun<=pTemplate->rRun /* (2b) */
123329 && p->rRun>=pTemplate->rRun /* (2a) */
123349 ** prerequisites and rRun and nOut costs of the N best loops. That
123377 whereOrInsert(pBuilder->pOrSet, pTemplate->prereq, pTemplate->rRun,
123754 ** it to pNew->rRun, which is currently set to the cost of the index
123758 pNew->rRun = sqlite3LogEstAdd(rLogSize, rCostIdx);
123760 pNew->rRun = sqlite3LogEstAdd(pNew->rRun, pNew->nOut + 16);
123762 ApplyCostMultiplier(pNew->rRun, pProbe->pTable->costMult);
123765 pNew->rRun += nInMul + nIn;
123912 ** The costs (WhereLoop.rRun) of the b-tree loops added by this function
124043 pNew->rRun = sqlite3LogEstAdd(rLogSize,pNew->nOut);
124079 pNew->rRun = rSize + 16;
124080 ApplyCostMultiplier(pNew->rRun, pTab->costMult);
124112 pNew->rRun = rSize + 1 + (15*pProbe->szIdxRow)/pTab->szTabRow;
124114 pNew->rRun = sqlite3LogEstAdd(pNew->rRun, rSize+16);
124116 ApplyCostMultiplier(pNew->rRun, pTab->costMult);
124315 pNew->rRun = sqlite3LogEstFromDouble(pIdxInfo->estimatedCost);
124430 sqlite3LogEstAdd(sPrev.a[i].rRun, sCur.a[j].rRun),
124443 /* TUNING: Currently sSum.a[i].rRun is set to the sum of the costs
124455 pNew->rRun = sSum.a[i].rRun + 1;
124978 rUnsorted = sqlite3LogEstAdd(pWLoop->rSetup,pWLoop->rRun + pFrom->nRow);
125249 pLoop->rRun = 33; /* 33==sqlite3LogEst(10) */
125274 pLoop->rRun = 39; /* 39==sqlite3LogEst(15) */