Lines Matching defs:cost
68 * up front and stored in a 2-dimensional array, so that the cost of
1035 * Returns a node number to be spilled according to the cost/benefit using
1051 float cost = g->nodes[n].spill_cost;
1054 if (cost <= 0.0f)
1062 if (benefit / cost > best_benefit) {
1063 best_benefit = benefit / cost;
1072 * Only nodes with a spill cost set (cost != 0.0) will be considered
1076 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost)
1078 g->nodes[n].spill_cost = cost;