* Heuristic for minimizing copies using a queue which holds 'qnodes' not yet
* examined. A qnode has a 'target color', nodes out of the opt unit and
- * a 'conflict graph'. A 'max indep set' is determined form these. We try to
- * color this mis using a color-exchanging mechanism. Occuring conflicts are
- * modeled with 'conflict edges' and the qnode is reinserted in the queue. The
- * first qnode colored without conflicts is the best one.
+ * a 'conflict graph'. 'Conflict graph' = "Interference graph' + 'conflict edges'
+ * A 'max indep set' is determined form these. We try to color this mis using a
+ * color-exchanging mechanism. Occuring conflicts are modeled with 'conflict edges'
+ * and the qnode is reinserted in the queue. The first qnode colored without
+ * conflicts is the best one.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#include <malloc.h>
#endif
+#include "debug.h"
#include "xmalloc.h"
-#include "becopyopt.h"
+#include "becopyopt_t.h"
#include "becopystat.h"
+#include "bitset.h"
-#define DEBUG_LVL 0 //SET_LEVEL_1
static firm_dbg_module_t *dbg = NULL;
-#define SLOTS_PINNED_GLOBAL 256
+#define SEARCH_FREE_COLORS
+
+#define SLOTS_PINNED_GLOBAL 64
#define SLOTS_CONFLICTS 8
#define SLOTS_CHANGED_NODES 32
-#define MIN(a,b) ((a<b)?(a):(b))
#define list_entry_queue(lh) list_entry(lh, qnode_t, queue)
#define HASH_CONFLICT(c) (HASH_PTR(c.n1) ^ HASH_PTR(c.n2))
const unit_t *ou; /**< the opt unit this qnode belongs to */
int color; /**< target color */
set *conflicts; /**< contains conflict_t's. All internal conflicts */
- int mis_size; /**< number of nodes in the mis. */
+ int mis_costs; /**< costs of nodes/copies in the mis. */
+ int mis_size; /**< size of the array below */
ir_node **mis; /**< the nodes of unit_t->nodes[] being part of the max independent set */
set *changed_nodes; /**< contains node_stat_t's. */
} qnode_t;
-pset *pinned_global; /**< optimized nodes should not be altered any more */
+static pset *pinned_global; /**< optimized nodes should not be altered any more */
static int set_cmp_conflict_t(const void *x, const void *y, size_t size) {
const conflict_t *xx = x;
*/
static INLINE void qnode_add_conflict(const qnode_t *qn, const ir_node *n1, const ir_node *n2) {
conflict_t c;
- DBG((dbg, LEVEL_4, "\t %n -- %n\n", n1, n2));
+ DBG((dbg, LEVEL_4, "\t %+F -- %+F\n", n1, n2));
if ((int)n1 < (int)n2) {
c.n1 = n1;
static INLINE int qnode_are_conflicting(const qnode_t *qn, const ir_node *n1, const ir_node *n2) {
conflict_t c;
/* search for live range interference */
- if (n1!=n2 && values_interfere(n1, n2))
+ if (n1!=n2 && nodes_interfere(qn->ou->co->cenv, n1, n2))
return 1;
/* search for recoloring conflicts */
if ((int)n1 < (int)n2) {
static INLINE void qnode_set_new_color(const qnode_t *qn, ir_node *irn, int color) {
node_stat_t *found = qnode_find_or_insert_node(qn, irn);
found->new_color = color;
+ DBG((dbg, LEVEL_3, "\t col(%+F) := %d\n", irn, color));
}
/**
static INLINE void qnode_pin_local(const qnode_t *qn, ir_node *irn) {
node_stat_t *found = qnode_find_or_insert_node(qn, irn);
found->pinned_local = 1;
+ if (found->new_color == NO_COLOR)
+ found->new_color = get_irn_col(qn->ou->co, irn);
}
+
/**
* Possible return values of qnode_color_irn()
*/
* Performs virtual re-coloring of node @p n to color @p col. Virtual colors of
* other nodes are changed too, as required to preserve correctness. Function is
* aware of local and global pinning. Recursive.
- * @param irn The node to set the color for
- * @param col The color to set
+ *
+ * If irn == trigger the color @p col must be used. (the first recoloring)
+ * If irn != trigger an arbitrary free color may be used. If no color is free, @p col is used.
+ *
+ * @param irn The node to set the color for
+ * @param col The color to set
* @param trigger The irn that caused the wish to change the color of the irn
+ * External callers must call with trigger = irn
+ *
* @return CHANGE_SAVE iff setting the color is possible, with all transitive effects.
* CHANGE_IMPOSSIBLE iff conflicts with reg-constraintsis occured.
* Else the first conflicting ir_node encountered is returned.
*
- * ASSUMPTION: Assumes that a life range of a single value can't be split into
- * several smaller intervals where other values can live in between.
- * This should be true in SSA.
*/
static ir_node *qnode_color_irn(const qnode_t *qn, ir_node *irn, int col, const ir_node *trigger) {
- ir_node *res;
- struct obstack confl_ob;
- ir_node **confl, *cn;
- int i, irn_col;
-
- DBG((dbg, LEVEL_3, "\t %n \tcaused col(%n) \t%2d --> %2d\n", trigger, irn, qnode_get_new_color(qn, irn), col));
- obstack_init(&confl_ob);
- irn_col = qnode_get_new_color(qn, irn);
+ copy_opt_t *co = qn->ou->co;
+ const be_chordal_env_t *chordal_env = co->cenv;
+ const arch_register_class_t *cls = co->cls;
+ const arch_env_t *arch_env = co->aenv;
+ int irn_col = qnode_get_new_color(qn, irn);
+ ir_node *sub_res, *curr;
+ be_ifg_t *ifg = chordal_env->ifg;
+ void *iter = be_ifg_neighbours_iter_alloca(ifg);
+
+
+ DBG((dbg, LEVEL_3, "\t %+F \tcaused col(%+F) \t%2d --> %2d\n", trigger, irn, irn_col, col));
+
+ /* If the target color is already set do nothing */
+ if (irn_col == col) {
+ DBG((dbg, LEVEL_3, "\t %+F same color\n", irn));
+ return CHANGE_SAVE;
+ }
- if (irn_col == col)
- goto ret_save;
+ /* If the irn is pinned, changing color is impossible */
if (pset_find_ptr(pinned_global, irn) || qnode_is_pinned_local(qn, irn)) {
- res = irn;
- goto ret_confl;
+ DBG((dbg, LEVEL_3, "\t %+F conflicting\n", irn));
+ return irn;
}
- if (!arch_reg_is_allocatable(qn->ou->co->env,
- irn,
- arch_pos_make_out(0),
- arch_register_for_index(qn->ou->co->cls, col)))
- goto ret_imposs;
-
- /* get all nodes which would conflict with this change */
- {
- struct obstack q;
- int in, out;
- ir_node *irn_bl;
-
- irn_bl = get_nodes_block(irn);
-
- /* first check for a conflicting node which is 'living in' the irns block */
- {
- ir_node *n;
- pset *live_ins = get_live_in(irn_bl);
- for (n = pset_first(live_ins); n; n = pset_next(live_ins))
- if (is_allocatable_irn(n) && n != trigger && qnode_get_new_color(qn, n) == col && values_interfere(irn, n)) {
- DBG((dbg, LEVEL_4, "\t %n\ttroubles\n", n));
- obstack_ptr_grow(&confl_ob, n);
- pset_break(live_ins);
- break;
- }
+
+#ifdef SEARCH_FREE_COLORS
+ /* If we resolve conflicts (recursive calls) we can use any unused color.
+ * In case of the first call @p col must be used.
+ */
+ if (irn != trigger) {
+ bitset_t *free_cols = bitset_alloca(cls->n_regs);
+ arch_register_req_t req;
+ ir_node *curr;
+ int free_col;
+
+ /* Get all possible colors */
+ arch_put_non_ignore_regs(arch_env, cls, free_cols);
+
+ /* Exclude colors not assignable to the irn */
+ arch_get_register_req(arch_env, &req, irn, -1);
+ if (arch_register_req_is(&req, limited)) {
+ bitset_t *limited = bitset_alloca(cls->n_regs);
+ req.limited(req.limited_env, limited);
+ bitset_and(free_cols, limited);
}
- /* setup the queue of blocks. */
- obstack_init(&q);
- obstack_ptr_grow(&q, irn_bl);
- in = 1;
- out = 0;
-
- /* process the queue. The code below checks for every block dominated
- * by the irns one, and in which the irn is live, if there are
- * conflicting nodes */
- while (out < in) {
- ir_node *curr_bl, *sub_bl;
- int i, max;
-
- curr_bl = ((ir_node **)obstack_base(&q))[out++];
-
- /* Add to the result all nodes in the block, which have
- * the target color and interfere with the irn */
- for (i = 0, max = get_irn_n_outs(curr_bl); i < max; ++i) {
- ir_node *n = get_irn_out(curr_bl, i);
- if (is_allocatable_irn(n) && n != trigger && qnode_get_new_color(qn, n) == col && values_interfere(irn, n)) {
- DBG((dbg, LEVEL_4, "\t %n\ttroubles\n", n));
- obstack_ptr_grow(&confl_ob, n);
- }
- }
+ /* Exclude the color of the irn, because it must _change_ its color */
+ bitset_clear(free_cols, irn_col);
- /* If irn lives out check i-dominated blocks where the irn lives in */
- /* Fill the queue */
- if (is_live_out(curr_bl, irn)) {
- dominates_for_each(curr_bl, sub_bl)
- if (is_live_in(sub_bl, irn)) {
- obstack_ptr_grow(&q, sub_bl);
- in++;
- }
- }
+ /* Exclude all colors used by adjacent nodes */
+ be_ifg_foreach_neighbour(ifg, iter, irn, curr)
+ bitset_clear(free_cols, qnode_get_new_color(qn, curr));
+
+ free_col = bitset_next_set(free_cols, 0);
+
+ if (free_col != -1) {
+ qnode_set_new_color(qn, irn, free_col);
+ return CHANGE_SAVE;
}
- obstack_free(&q, NULL);
- obstack_ptr_grow(&confl_ob, NULL);
- confl = (ir_node **) obstack_finish(&confl_ob);
}
+#endif /* SEARCH_FREE_COLORS */
- /* process all nodes which would conflict with this change */
- for (i = 0, cn = confl[0]; cn; cn = confl[++i]) {
- ir_node *sub_res;
+ /* If target color is not allocatable changing color is impossible */
+ if (!arch_reg_is_allocatable(arch_env, irn, -1, arch_register_for_index(cls, col))) {
+ DBG((dbg, LEVEL_3, "\t %+F impossible\n", irn));
+ return CHANGE_IMPOSSIBLE;
+ }
- /* try to color the conflicting node cn with the color of the irn itself */
- sub_res = qnode_color_irn(qn, cn, irn_col, irn);
- if (sub_res != CHANGE_SAVE) {
- res = sub_res;
- goto ret_confl;
+ /*
+ * If we arrive here changing color may be possible, but there may be conflicts.
+ * Try to color all conflicting nodes 'curr' with the color of the irn itself.
+ */
+ be_ifg_foreach_neighbour(ifg, iter, irn, curr) {
+ DBG((dbg, LEVEL_3, "\t Confl %+F(%d)\n", curr, qnode_get_new_color(qn, curr)));
+ if (qnode_get_new_color(qn, curr) == col && curr != trigger) {
+ sub_res = qnode_color_irn(qn, curr, irn_col, irn);
+ if (sub_res != CHANGE_SAVE) {
+ be_ifg_neighbours_break(ifg, iter);
+ return sub_res;
+ }
}
}
- /* if we arrive here all sub changes can be applied, so it's save to change this irn */
-ret_save:
- DBG((dbg, LEVEL_3, "\t %n save\n", irn));
- obstack_free(&confl_ob, NULL);
+ /*
+ * If we arrive here, all conflicts were resolved.
+ * So it is save to change this irn
+ */
qnode_set_new_color(qn, irn, col);
return CHANGE_SAVE;
-
-ret_imposs:
- DBG((dbg, LEVEL_3, "\t %n impossible\n", irn));
- obstack_free(&confl_ob, NULL);
- return CHANGE_IMPOSSIBLE;
-
-ret_confl:
- DBG((dbg, LEVEL_3, "\t %n conflicting\n", irn));
- obstack_free(&confl_ob, NULL);
- return res;
}
+
/**
* Tries to set the colors for all members of this queue node;
* to the target color qn->color
ir_node *test_node, *confl_node;
test_node = qn->mis[i];
- DBG((dbg, LEVEL_3, "\t Testing %n\n", test_node));
+ DBG((dbg, LEVEL_3, "\t Testing %+F\n", test_node));
confl_node = qnode_color_irn(qn, test_node, qn->color, test_node);
if (confl_node == CHANGE_SAVE) {
} else {
if (qnode_is_pinned_local(qn, confl_node)) {
/* changing test_node would change back a node of current ou */
- DBG((dbg, LEVEL_3, "\t Conflicting local --> add conflict\n"));
- qnode_add_conflict(qn, confl_node, test_node);
+ if (confl_node == qn->ou->nodes[0]) {
+ /* Adding a conflict edge between testnode and conflnode
+ * would introduce a root -- arg interference.
+ * So remove the arg of the qn */
+ DBG((dbg, LEVEL_3, "\t Conflicting local with phi --> remove from qnode\n"));
+ qnode_add_conflict(qn, test_node, test_node);
+ } else {
+ DBG((dbg, LEVEL_3, "\t Conflicting local --> add conflict\n"));
+ qnode_add_conflict(qn, confl_node, test_node);
+ }
}
if (pset_find_ptr(pinned_global, confl_node)) {
/* changing test_node would change back a node of a prior ou */
}
/**
- * Determines a maximum independent set with respect to the interference and
- * conflict edges of all nodes in a qnode.
+ * Determines a maximum weighted independent set with respect to
+ * the interference and conflict edges of all nodes in a qnode.
*/
static INLINE void qnode_max_ind_set(qnode_t *qn, const unit_t *ou) {
- int all_size, curr_size, i, o;
- int *which;
- ir_node **curr, **all = alloca(ou->node_count * sizeof(*all));
+ ir_node **safe, **unsafe;
+ int i, o, safe_count, safe_costs, unsafe_count, *unsafe_costs;
+ bitset_t *curr, *best;
+ int max, next, pos, curr_weight, best_weight = 0;
+
+ /* assign the nodes into two groups.
+ * safe: node has no interference, hence it is in every max stable set.
+ * unsafe: node has an interference
+ */
+ safe = alloca((ou->node_count-1) * sizeof(*safe));
+ safe_costs = 0;
+ safe_count = 0;
+ unsafe = alloca((ou->node_count-1) * sizeof(*unsafe));
+ unsafe_costs = alloca((ou->node_count-1) * sizeof(*unsafe_costs));
+ unsafe_count = 0;
+ for(i=1; i<ou->node_count; ++i) {
+ int is_safe = 1;
+ for(o=1; o<ou->node_count; ++o) {
+ if (qnode_are_conflicting(qn, ou->nodes[i], ou->nodes[o])) {
+ if (i!=o) {
+ unsafe_costs[unsafe_count] = ou->costs[i];
+ unsafe[unsafe_count] = ou->nodes[i];
+ ++unsafe_count;
+ }
+ is_safe = 0;
+ break;
+ }
+ }
+ if (is_safe) {
+ safe_costs += ou->costs[i];
+ safe[safe_count++] = ou->nodes[i];
+ }
+ }
- /* all contains all nodes not removed in this qn */
- all_size = 0;
- for (i=0; i<ou->node_count; ++i)
- if (!qnode_are_conflicting(qn, ou->nodes[i], ou->nodes[i]))
- all[all_size++] = ou->nodes[i];
-
- /* which[i] says which element to take out of all[] and put into curr[i] */
- which = alloca(all_size*sizeof(*which));
- for (curr_size=0; curr_size<all_size; ++curr_size)
- which[curr_size] = curr_size;
-
- /* stores the currently examined set */
- curr = alloca(all_size*sizeof(*curr));
-
- while (1) { /* this loop will terminate because at least a single node will be a max indep. set */
- /* build current set */
- for (i=0; i<curr_size; ++i)
- curr[i] = all[which[all_size-curr_size+i]];
-
- /* check current set */
- for (i=0; i<curr_size; ++i)
- for (o=i+1; o<curr_size; ++o)
- if (qnode_are_conflicting(qn, curr[i], curr[o]))
- goto conflict_found;
-
- /* We had no conflict. This is the max indep. set */
- qn->mis_size = curr_size;
- for (i=0; i<curr_size; ++i)
- qn->mis[i] = curr[i];
- return;
-conflict_found:
- /* We had a conflict. Generate next set */
- if (which[all_size-curr_size+1] == all_size-curr_size+1) {
- curr_size--;
- for (i=0; i<curr_size; ++i)
- which[all_size-curr_size+i] = i;
- } else {
- int redo = 1;
- while (redo) {
- int pos = all_size;
- do {
- pos--;
- } while (!(which[pos] = (which[pos]+1) % all_size));
-
- for (i=pos+1; i<all_size; ++i)
- which[i] = MIN(which[i-1]+1, all_size-1);
-
- redo = 0;
- for (i=all_size-curr_size; i<all_size-1; ++i)
- if (which[i]>=which[i+1]) {
- redo = 1;
- break;
- }
+
+ /* now compute the best set out of the unsafe nodes*/
+ best = bitset_alloca(unsafe_count);
+
+ if (unsafe_count > MIS_HEUR_TRIGGER) {
+ /* Heuristic: Greedy trial and error form index 0 to unsafe_count-1 */
+ for (i=0; i<unsafe_count; ++i) {
+ bitset_set(best, i);
+ /* check if it is a stable set */
+ for (o=bitset_next_set(best, 0); o!=-1 && o<=i; o=bitset_next_set(best, o+1))
+ if (qnode_are_conflicting(qn, unsafe[i], unsafe[o])) {
+ bitset_clear(best, i); /* clear the bit and try next one */
+ break;
+ }
+ }
+ /* compute the weight */
+ bitset_foreach(best, pos)
+ best_weight += unsafe_costs[pos];
+ } else {
+ /* Exact Algorithm: Brute force */
+ curr = bitset_alloca(unsafe_count);
+ bitset_set_all(curr);
+ while ((max = bitset_popcnt(curr)) != 0) {
+ /* check if curr is a stable set */
+ for (i=bitset_next_set(curr, 0); i!=-1; i=bitset_next_set(curr, i+1))
+ for (o=bitset_next_set(curr, i); o!=-1; o=bitset_next_set(curr, o+1)) /* !!!!! difference to ou_max_ind_set_costs(): NOT (curr, i+1) */
+ if (qnode_are_conflicting(qn, unsafe[i], unsafe[o]))
+ goto no_stable_set;
+
+ /* if we arrive here, we have a stable set */
+ /* compute the weigth of the stable set*/
+ curr_weight = 0;
+ bitset_foreach(curr, pos)
+ curr_weight += unsafe_costs[pos];
+
+ /* any better ? */
+ if (curr_weight > best_weight) {
+ best_weight = curr_weight;
+ bitset_copy(best, curr);
}
+
+no_stable_set:
+ bitset_minus1(curr);
}
}
+
+ /* transfer the best set into the qn */
+ qn->mis_size = 1+safe_count+bitset_popcnt(best);
+ qn->mis_costs = safe_costs+best_weight;
+ qn->mis[0] = ou->nodes[0]; /* the root is always in a max stable set */
+ next = 1;
+ for (i=0; i<safe_count; ++i)
+ qn->mis[next++] = safe[i];
+ bitset_foreach(best, pos)
+ qn->mis[next++] = unsafe[pos];
}
/**
qnode_t *qn = xmalloc(sizeof(*qn));
qn->ou = ou;
qn->color = color;
- qn->mis = malloc(ou->node_count * sizeof(*qn->mis));
+ qn->mis = xmalloc(ou->node_count * sizeof(*qn->mis));
qn->conflicts = new_set(set_cmp_conflict_t, SLOTS_CONFLICTS);
qn->changed_nodes = new_set(set_cmp_node_stat_t, SLOTS_CHANGED_NODES);
return qn;
}
qnode_max_ind_set(qn, ou);
-
- /* set ou->mis_size for lower bound compution */
- if (ou->mis_size < qn->mis_size)
- ou->mis_size = qn->mis_size;
-
/* do the insertion */
- DBG((dbg, LEVEL_4, "\t Insert qnode color %d with size %d\n", qn->color, qn->mis_size));
+ DBG((dbg, LEVEL_4, "\t Insert qnode color %d with cost %d\n", qn->color, qn->mis_costs));
lh = &ou->queue;
while (lh->next != &ou->queue) {
qnode_t *curr = list_entry_queue(lh->next);
- if (curr->mis_size <= qn->mis_size)
+ if (curr->mis_costs <= qn->mis_costs)
break;
lh = lh->next;
}
}
/**
- * Tries to re-allocate colors of nodes in this opt unit, to achieve a lower
- * number of copy instructions placed during SSA-destruction and lowering.
+ * Tries to re-allocate colors of nodes in this opt unit, to achieve lower
+ * costs of copy instructions placed during SSA-destruction and lowering.
* Works only for opt units with exactly 1 root node, which is the
- * case for approximately 80% of all phi classes and all register constrained
+ * case for approximately 80% of all phi classes and 100% of register constrained
* nodes. (All other phi classes are reduced to this case.)
*/
static void ou_optimize(unit_t *ou) {
int i;
- qnode_t *curr, *tmp;
- bitset_t *pos_regs = bitset_alloca(ou->co->cls->n_regs);
+ qnode_t *curr = NULL, *tmp;
+ const arch_env_t *aenv = ou->co->aenv;
+ const arch_register_class_t *cls = ou->co->cls;
+ bitset_t *pos_regs = bitset_alloca(cls->n_regs);
+ bitset_t *ign_regs = bitset_alloca(cls->n_regs);
DBG((dbg, LEVEL_1, "\tOptimizing unit:\n"));
for (i=0; i<ou->node_count; ++i)
- DBG((dbg, LEVEL_1, "\t %n\n", ou->nodes[i]));
+ DBG((dbg, LEVEL_1, "\t %+F\n", ou->nodes[i]));
/* init queue */
INIT_LIST_HEAD(&ou->queue);
- arch_get_allocatable_regs(ou->co->env, ou->nodes[0], arch_pos_make_out(0), ou->co->cls, pos_regs);
+
+ arch_get_allocatable_regs(aenv, ou->nodes[0], -1, pos_regs);
+
+ /* exclude ingore colors */
+ arch_put_non_ignore_regs(aenv, cls, ign_regs);
+ bitset_and(pos_regs, ign_regs);
+
+ assert(bitset_popcnt(pos_regs) != 0 && "No register is allowed for this node !!?");
+
+ /* create new qnode */
bitset_foreach(pos_regs, i)
ou_insert_qnode(ou, new_qnode(ou, i));
/* get head of queue */
curr = list_entry_queue(ou->queue.next);
list_del(&curr->queue);
- DBG((dbg, LEVEL_2, "\t Examine qnode color %d with size %d\n", curr->color, curr->mis_size));
+ DBG((dbg, LEVEL_2, "\t Examine qnode color %d with cost %d\n", curr->color, curr->mis_costs));
/* try */
if (qnode_try_color(curr))
break;
+
/* no success, so re-insert */
del_set(curr->changed_nodes);
curr->changed_nodes = new_set(set_cmp_node_stat_t, SLOTS_CHANGED_NODES);
/* apply the best found qnode */
if (curr->mis_size >= 2) {
node_stat_t *ns;
-
- DBG((dbg, LEVEL_1, "\t Best color: %d Copies: %d/%d\n", curr->color, ou->interf+ou->node_count-curr->mis_size, ou->interf+ou->node_count-1));
- /* globally pin root and eventually others */
+ int root_col = qnode_get_new_color(curr, ou->nodes[0]);
+ DBG((dbg, LEVEL_1, "\t Best color: %d Costs: %d << %d << %d\n", curr->color, ou->min_nodes_costs, ou->all_nodes_costs - curr->mis_costs, ou->all_nodes_costs));
+ /* globally pin root and all args which have the same color */
pset_insert_ptr(pinned_global, ou->nodes[0]);
for (i=1; i<ou->node_count; ++i) {
ir_node *irn = ou->nodes[i];
int nc = qnode_get_new_color(curr, irn);
- if (nc != NO_COLOR && nc == qnode_get_new_color(curr, ou->nodes[0]))
+ if (nc != NO_COLOR && nc == root_col)
pset_insert_ptr(pinned_global, irn);
}
for (ns = set_first(curr->changed_nodes); ns; ns = set_next(curr->changed_nodes)) {
/* NO_COLOR is possible, if we had an undo */
if (ns->new_color != NO_COLOR) {
- DBG((dbg, LEVEL_2, "\t color(%n) := %d\n", ns->irn, ns->new_color));
+ DBG((dbg, LEVEL_1, "\t color(%+F) := %d\n", ns->irn, ns->new_color));
set_irn_col(ou->co, ns->irn, ns->new_color);
}
}
free_qnode(curr);
}
-void co_heur_opt(copy_opt_t *co) {
+int co_solve_heuristic(copy_opt_t *co) {
unit_t *curr;
dbg = firm_dbg_register("ir.be.copyoptheur");
- firm_dbg_set_mask(dbg, DEBUG_LVL);
- if (!strcmp(co->name, DEBUG_IRG))
- firm_dbg_set_mask(dbg, -1);
+
+ ASSERT_OU_AVAIL(co);
pinned_global = pset_new_ptr(SLOTS_PINNED_GLOBAL);
list_for_each_entry(unit_t, curr, &co->units, units)
ou_optimize(curr);
del_pset(pinned_global);
+
+ return 0;
}