Lines Matching refs:cost
144 // The flag adds instruction count to solutions cost comparision.
146 "lsr-insns-cost", cl::Hidden, cl::init(true),
147 cl::desc("Add instruction count to a LSR cost model"));
173 cl::desc("The limit on recursion depth for LSRs setup cost"));
912 /// Check if expanding this expression is likely to incur significant cost. This
978 // Fow now, consider any other type of expression (div/mul/min/max) high cost.
996 /// accurate cost model.
1000 // Get the cost of the scaling factor used in F for LU.
1043 assert(isValid() && "invalid cost");
1372 // If we don't count instruction cost exit here.
1374 assert(isValid() && "invalid cost");
1411 assert(isValid() && "invalid cost");
1414 /// Set this cost to a losing value.
1426 /// Choose the lower cost.
1440 OS << ", with addrec cost " << C.AddRecCost;
1448 OS << ", plus " << C.ScaleCost << " scale cost";
1450 OS << ", plus " << C.ImmCost << " imm cost";
1452 OS << ", plus " << C.SetupCost << " setup cost";
1756 // pay an extra cost only for scale != 1.
1763 // Check the scaling factor cost with both the min and max offsets.
1772 "Legal addressing mode has an illegal cost!");
2843 // The chain itself may require a register, so intialize cost to 1.
2844 int cost = 1;
2851 --cost;
2886 --cost;
2889 // the original code may cost a register. For example, sign-extended array
2892 cost += NumVarIncrements;
2896 cost -= NumReusedIncrements;
2898 LLVM_DEBUG(dbgs() << "Chain: " << *Chain.Incs[0].UserInst << " Cost: " << cost
2901 return cost < 0;
4952 // - don't compute a cost, and then compare. compare while computing a cost
4974 // sub-optimial decisions. There it is best left to the cost modelling to
4993 // Evaluate the cost of the current formula. If it's already worse than