Lines Matching defs:cost

151 // The flag adds instruction count to solutions cost comparison.
153   "lsr-insns-cost", cl::Hidden, cl::init(true),
154   cl::desc("Add instruction count to a LSR cost model"));
189     cl::desc("The limit on recursion depth for LSRs setup cost"));
1093 /// Check if expanding this expression is likely to incur significant cost. This
1162   // Fow now, consider any other type of expression (div/mul/min/max) high cost.
1180 /// accurate cost model.
1184 // Get the cost of the scaling factor used in F for LU.
1229     assert(isValid() && "invalid cost");
1558       // Incompatible immediate type, increase cost to avoid using
1563   // If we don't count instruction cost exit here.
1565     assert(isValid() && "invalid cost");
1602   assert(isValid() && "invalid cost");
1605 /// Set this cost to a losing value.
1617 /// Choose the lower cost.
1631     OS << ", with addrec cost " << C.AddRecCost;
1639     OS << ", plus " << C.ScaleCost << " scale cost";
1641     OS << ", plus " << C.ImmCost << " imm cost";
1643     OS << ", plus " << C.SetupCost << " setup cost";
1970   // pay an extra cost only for scale != 1.
1977     // Check the scaling factor cost with both the min and max offsets.
1994            "Legal addressing mode has an illegal cost!");
2164   /// The cost of the current SCEV, the best solution by LSR will be dropped if
3084   // The chain itself may require a register, so intialize cost to 1.
3085   int cost = 1;
3092     --cost;
3126     --cost;
3129   // the original code may cost a register. For example, sign-extended array
3132   cost += NumVarIncrements;
3136   cost -= NumReusedIncrements;
3138   LLVM_DEBUG(dbgs() << "Chain: " << *Chain.Incs[0].UserInst << " Cost: " << cost
3141   return cost < 0;
3525   // For calculating baseline cost
3629     // Create SCEV as Formula for calculating baseline cost
5437   //    - don't compute a cost, and then compare. compare while computing a cost
5459     // sub-optimial decisions. There it is best left to the cost modelling to
5478     // Evaluate the cost of the current formula. If it's already worse than
6103   // In our cost analysis above, we assume that each addrec consumes exactly
6107   // expectations.  Otherwise, our cost modeling results in us having a
6214   // If number of registers is not the major cost, we cannot benefit from the
6217   // FIXME: add profitable chain optimization for other kinds major cost, for