Lines Matching refs:cost
54 int cost;
62 the same primary cost.
137 cost_one_pair *cost_one_list;/* Single use coalesces with cost 1. */
145 /* Return cost of execution of copy instruction with FREQUENCY. */
151 int cost = frequency;
153 if (!cost)
154 cost = 1;
157 cost = 1;
159 return cost;
163 /* Return the cost of executing a copy instruction in basic block BB. */
173 /* Return the cost of executing a copy instruction on edge E. */
234 2 elements via P1 and P2. Their calculated cost is returned by the function.
252 ret = node->cost;
335 pair->cost = 0;
357 /* Add a coalesce between P1 and P2 in list CL with a cost of VALUE. */
371 if (node->cost < MUST_COALESCE_COST - 1)
374 node->cost += value;
376 node->cost = value;
417 result = (* pp1)->cost - (* pp2)->cost;
512 fprintf (f, " (%1d, %1d), ", node->cost, node->conflict_count);
522 fprintf (f, "(%d, %d) ", node->cost, node->conflict_count);
1041 int v1, v2, cost;
1078 int cost = coalesce_cost_edge (e);
1079 if (cost == 1 && has_single_use (arg))
1082 add_coalesce (cl, ver, SSA_NAME_VERSION (arg), cost);
1109 cost = coalesce_cost_bb (bb);
1110 add_coalesce (cl, v1, v2, cost);
1133 cost = coalesce_cost_bb (bb);
1134 add_coalesce (cl, v1, v2, cost);
1183 cost = coalesce_cost (REG_BR_PROB_BASE,
1185 add_coalesce (cl, v1, v2, cost);
1232 int v1, v2, cost;
1256 cost = coalesce_cost_bb (EXIT_BLOCK_PTR_FOR_FN (cfun));
1257 add_coalesce (cl, v1, v2, cost);
1300 const int cost
1304 SSA_NAME_VERSION (*slot), cost);
1390 int cost;
1432 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE)
1605 /* We have to deal with cost one pairs too. */
Indexes created Mon Apr 20 00:23:12 UTC 2026