Lines Matching defs:Cost
2360 int Cost = std::accumulate(
2364 bool Inserted = DTCostMap.insert({&N, Cost}).second;
2367 return Cost;
2455 /// Cost multiplier is a way to limit potentially exponential behavior
2456 /// of loop-unswitch. Cost is multipied in proportion of 2^number of unswitch
2652 int Cost = 0;
2663 Cost += TTI.getUserCost(&I);
2665 assert(Cost >= 0 && "Must not have negative costs!");
2666 LoopCost += Cost;
2668 BBCostMap[BB] = Cost;
2693 int Cost = LoopCost;
2727 Cost -= computeDomSubtreeCost(*DT[SuccBB], BBCostMap, DTCostMap);
2728 assert(Cost >= 0 &&
2741 return Cost * (SuccessorsCount - 1);