Lines Matching refs:bestPlan
102171 WhereCost bestPlan; /* Most efficient plan seen so far */
102180 memset(&bestPlan, 0, sizeof(bestPlan));
102181 bestPlan.rCost = SQLITE_BIG_DBL;
102295 || (bestPlan.plan.wsFlags & WHERE_NOT_FULLSCAN)==0
102299 && (bestJ<0 || sCost.rCost<bestPlan.rCost /* (4) */
102300 || (sCost.rCost<=bestPlan.rCost
102301 && sCost.plan.nRow<bestPlan.plan.nRow))
102306 bestPlan = sCost;
102316 bestJ, pLevel-pWInfo->a, bestPlan.rCost, bestPlan.plan.nRow));
102317 if( (bestPlan.plan.wsFlags & WHERE_ORDERBY)!=0 ){
102320 andFlags &= bestPlan.plan.wsFlags;
102321 pLevel->plan = bestPlan.plan;
102322 testcase( bestPlan.plan.wsFlags & WHERE_INDEXED );
102323 testcase( bestPlan.plan.wsFlags & WHERE_TEMP_INDEX );
102324 if( bestPlan.plan.wsFlags & (WHERE_INDEXED|WHERE_TEMP_INDEX) ){
102331 if( bestPlan.plan.nRow>=(double)1 ){
102332 pParse->nQueryLoop *= bestPlan.plan.nRow;
102342 if( (bestPlan.plan.wsFlags & WHERE_INDEXED)==0 ){
102349 assert( bestPlan.plan.u.pIdx==pIdx );