Searched refs:cost2 (Results 1 – 3 of 3) sorted by relevance
217 unsigned cost2 = MAX_COST; in expand_ccmp_expr_1() local249 cost2 = seq_cost (prep_seq_2, speed_p); in expand_ccmp_expr_1()250 cost2 += seq_cost (gen_seq_2, speed_p); in expand_ccmp_expr_1()252 if (cost2 < cost1) in expand_ccmp_expr_1()
241 operator+ (comp_cost cost1, comp_cost cost2)246 cost1.cost += cost2.cost;247 cost1.complexity += cost2.complexity;253 operator- (comp_cost cost1, comp_cost cost2)258 gcc_assert (!cost2.infinite_cost_p ());260 cost1.cost -= cost2.cost;261 cost1.complexity -= cost2.complexity;327 if (cost1.cost == cost2.cost)330 return cost1.cost < cost2.cost;336 return cost1.cost == cost2.cost[all …]
2630 add_costs (comp_cost cost1, comp_cost cost2) in add_costs() argument2632 cost1.cost += cost2.cost; in add_costs()2633 cost1.complexity += cost2.complexity; in add_costs()2640 sub_costs (comp_cost cost1, comp_cost cost2) in sub_costs() argument2642 cost1.cost -= cost2.cost; in sub_costs()2643 cost1.complexity -= cost2.complexity; in sub_costs()2652 compare_costs (comp_cost cost1, comp_cost cost2) in compare_costs() argument2654 if (cost1.cost == cost2.cost) in compare_costs()2655 return cost1.complexity - cost2.complexity; in compare_costs()2657 return cost1.cost - cost2.cost; in compare_costs()