Lines Matching defs:cost

152 // The flag adds instruction count to solutions cost comparison.
154   "lsr-insns-cost", cl::Hidden, cl::init(true),
155   cl::desc("Add instruction count to a LSR cost model"));
190     cl::desc("The limit on recursion depth for LSRs setup cost"));
1098 /// Check if expanding this expression is likely to incur significant cost. This
1167   // Fow now, consider any other type of expression (div/mul/min/max) high cost.
1185 /// accurate cost model.
1189 // Get the cost of the scaling factor used in F for LU.
1234     assert(isValid() && "invalid cost");
1563       // Incompatible immediate type, increase cost to avoid using
1568   // If we don't count instruction cost exit here.
1570     assert(isValid() && "invalid cost");
1607   assert(isValid() && "invalid cost");
1610 /// Set this cost to a losing value.
1622 /// Choose the lower cost.
1636     OS << ", with addrec cost " << C.AddRecCost;
1644     OS << ", plus " << C.ScaleCost << " scale cost";
1646     OS << ", plus " << C.ImmCost << " imm cost";
1648     OS << ", plus " << C.SetupCost << " setup cost";
1975   // pay an extra cost only for scale != 1.
1982     // Check the scaling factor cost with both the min and max offsets.
1999            "Legal addressing mode has an illegal cost!");
2169   /// The cost of the current SCEV, the best solution by LSR will be dropped if
3083   // The chain itself may require a register, so intialize cost to 1.
3084   int cost = 1;
3091     --cost;
3125     --cost;
3128   // the original code may cost a register. For example, sign-extended array
3131   cost += NumVarIncrements;
3135   cost -= NumReusedIncrements;
3137   LLVM_DEBUG(dbgs() << "Chain: " << *Chain.Incs[0].UserInst << " Cost: " << cost
3140   return cost < 0;
3524   // For calculating baseline cost
3628     // Create SCEV as Formula for calculating baseline cost
5435   //    - don't compute a cost, and then compare. compare while computing a cost
5457     // sub-optimial decisions. There it is best left to the cost modelling to
5476     // Evaluate the cost of the current formula. If it's already worse than
6106   // In our cost analysis above, we assume that each addrec consumes exactly
6110   // expectations.  Otherwise, our cost modeling results in us having a
6217   // If number of registers is not the major cost, we cannot benefit from the
6220   // FIXME: add profitable chain optimization for other kinds major cost, for
7122   // Inserting instructions in the preheader has a runtime cost, scale
7123   // the allowed cost with the loops trip count as best we can.