206   LogEst rRun,           /* Run-cost of the new entry */  in whereOrInsert()  argument
212     if( rRun<=p->rRun && (prereq & p->prereq)==prereq ){  in whereOrInsert()
215     if( p->rRun<=rRun && (p->prereq & prereq)==p->prereq ){  in whereOrInsert()
225       if( p->rRun>pSet->a[i].rRun ) p = pSet->a + i;  in whereOrInsert()
227     if( p->rRun<=rRun ) return 0;  in whereOrInsert()
231   p->rRun = rRun;  in whereOrInsert()
2179   sqlite3DebugPrintf(" cost %d,%d,%d\n", p->rSetup, p->rRun, p->nOut);  in sqlite3WhereLoopPrint()
2325   if( pX->rRun>pY->rRun && pX->nOut>pY->nOut ) return 0;  in whereLoopCheaperProperSubset()
2364                        pTemplate->rRun, pTemplate->nOut,   in whereLoopAdjustCost()
2365                        MIN(p->rRun, pTemplate->rRun),  in whereLoopAdjustCost()
2367       pTemplate->rRun = MIN(p->rRun, pTemplate->rRun);  in whereLoopAdjustCost()
2373                        pTemplate->rRun, pTemplate->nOut,   in whereLoopAdjustCost()
2374                        MAX(p->rRun, pTemplate->rRun),  in whereLoopAdjustCost()
2376       pTemplate->rRun = MAX(p->rRun, pTemplate->rRun);  in whereLoopAdjustCost()
2438      && p->rRun<=pTemplate->rRun                      /* (2b) */  in whereLoopFindLesser()
2450      && p->rRun>=pTemplate->rRun                             /* (2a) */  in whereLoopFindLesser()
2509       whereOrInsert(pBuilder->pOrSet, pTemplate->prereq, pTemplate->rRun,  in whereLoopInsert()
2814                      pNew->u.btree.nEq, pNew->nSkip, pNew->rRun));  in whereLoopAddBtreeIndex()
3096     pNew->rRun = sqlite3LogEstAdd(rLogSize, rCostIdx);  in whereLoopAddBtreeIndex()
3098       pNew->rRun = sqlite3LogEstAdd(pNew->rRun, pNew->nOut + 16);  in whereLoopAddBtreeIndex()
3100     ApplyCostMultiplier(pNew->rRun, pProbe->pTable->costMult);  in whereLoopAddBtreeIndex()
3103     pNew->rRun += nInMul + nIn;  in whereLoopAddBtreeIndex()
3480         pNew->rRun = sqlite3LogEstAdd(rLogSize,pNew->nOut);  in whereLoopAddBtree()
3536       pNew->rRun = rSize + 16 - 2*((pTab->tabFlags & TF_HasStat4)!=0);  in whereLoopAddBtree()
3538       pNew->rRun = rSize + 16;  in whereLoopAddBtree()
3543       ApplyCostMultiplier(pNew->rRun, pTab->costMult);  in whereLoopAddBtree()
3579         pNew->rRun = rSize + 1 + (15*pProbe->szIdxRow)/pTab->szTabRow;  in whereLoopAddBtree()
3605           pNew->rRun = sqlite3LogEstAdd(pNew->rRun, nLookup);  in whereLoopAddBtree()
3607         ApplyCostMultiplier(pNew->rRun, pTab->costMult);  in whereLoopAddBtree()
3827   pNew->rRun = sqlite3LogEstFromDouble(pIdxInfo->estimatedCost);  in whereLoopAddVirtualOne()
4216                             sqlite3LogEstAdd(sPrev.a[i].rRun, sCur.a[j].rRun),  in whereLoopAddOr()
4241         pNew->rRun = sSum.a[i].rRun + 1;  in whereLoopAddOr()
4890         rUnsorted = sqlite3LogEstAdd(pWLoop->rSetup,pWLoop->rRun + pFrom->nRow);  in wherePathSolver()
5215     pLoop->rRun = 33;  /* 33==sqlite3LogEst(10) */  in whereShortCut()
5241       pLoop->rRun = 39;  /* 39==sqlite3LogEst(15) */  in whereShortCut()