#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
*/
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;
const arch_env_t *arch_env = chordal_env->arch_env;
const arch_register_class_t *cls = chordal_env->cls;
- DBG((dbg, LEVEL_3, "\t %n \tcaused col(%n) \t%2d --> %2d\n", trigger, irn, qnode_get_new_color(qn, irn), col));
+ DBG((dbg, LEVEL_3, "\t %+F \tcaused col(%+F) \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);
- if (irn_col == col)
+ if (irn_col == col) {
+ DBG((dbg, LEVEL_4, "\t Already same color.\n"));
goto ret_save;
+ }
if (pset_find_ptr(pinned_global, irn) || qnode_is_pinned_local(qn, irn)) {
res = irn;
goto ret_confl;
{
ir_node *n;
pset *live_ins = put_live_in(irn_bl, pset_new_ptr_default());
- for (n = pset_first(live_ins); n; n = pset_next(live_ins))
+ for (n = pset_first(live_ins); n; n = pset_next(live_ins)) {
+ DBG((dbg, LEVEL_4, "Checking %+F which is live-in at the block\n", n));
if (arch_irn_has_reg_class(arch_env, n, arch_pos_make_out(0), cls)
- && n != trigger && qnode_get_new_color(qn, n) == col
- && nodes_interfere(chordal_env, irn, n)) {
+ && n != trigger && qnode_get_new_color(qn, n) == col
+ && nodes_interfere(chordal_env, irn, n)) {
- DBG((dbg, LEVEL_4, "\t %n\ttroubles\n", n));
+ DBG((dbg, LEVEL_4, "\t %+F\ttroubles\n", n));
obstack_ptr_grow(&confl_ob, n);
pset_break(live_ins);
break;
+ }
}
del_pset(live_ins);
}
* 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);
+ DBG((dbg, LEVEL_4, "Checking %+F defined in same block\n", n));
if (arch_irn_has_reg_class(arch_env, n, arch_pos_make_out(0), cls)
- && n != trigger && qnode_get_new_color(qn, n) == col
- && nodes_interfere(chordal_env, irn, n)) {
-
- DBG((dbg, LEVEL_4, "\t %n\ttroubles\n", n));
- obstack_ptr_grow(&confl_ob, n);
+ && n != trigger && qnode_get_new_color(qn, n) == col
+ && nodes_interfere(chordal_env, irn, n)) {
+ DBG((dbg, LEVEL_4, "\t %+F\ttroubles\n", n));
+ obstack_ptr_grow(&confl_ob, n);
}
}
/* 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));
+ DBG((dbg, LEVEL_3, "\t %+F save\n", irn));
obstack_free(&confl_ob, NULL);
qnode_set_new_color(qn, irn, col);
return CHANGE_SAVE;
ret_imposs:
- DBG((dbg, LEVEL_3, "\t %n impossible\n", irn));
+ DBG((dbg, LEVEL_3, "\t %+F impossible\n", irn));
obstack_free(&confl_ob, NULL);
return CHANGE_IMPOSSIBLE;
ret_confl:
- DBG((dbg, LEVEL_3, "\t %n conflicting\n", irn));
+ DBG((dbg, LEVEL_3, "\t %+F conflicting\n", irn));
obstack_free(&confl_ob, NULL);
return res;
}
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) {
}
/* transfer the best set into the qn */
- qn->mis_size = bitset_popcnt(best);
+ qn->mis_size = bitset_popcnt(best)+1;
qn->mis_costs = best_weight;
next = 0;
+ qn->mis[next++] = ou->nodes[0]; /* the root is alwazs in a max stable set */
bitset_foreach(best, pos)
qn->mis[next++] = ou->nodes[1+pos];
}
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);
/* apply the best found qnode */
if (curr->mis_size >= 2) {
node_stat_t *ns;
-
DBG((dbg, LEVEL_1, "\t Best color: %d Costs: %d/%d\n", curr->color, ou->complete_costs - curr->mis_costs, ou->complete_costs));
- /* globally pin root and eventually others */
+ /* 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];
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);
}
}
+ /*
+ * Enable for checking register allocation after each ou
+ * be_ra_chordal_check(ou->co->chordal_env);
+ */
}
/* free best qnode (curr) and queue */
void co_heur_opt(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, DEBUG_LVL_HEUR);
+ firm_dbg_set_mask(dbg, DEBUG_IRG_LVL_HEUR);
else
- firm_dbg_set_mask(dbg, DEBUG_LVL);
+ firm_dbg_set_mask(dbg, DEBUG_LVL_HEUR);
pinned_global = pset_new_ptr(SLOTS_PINNED_GLOBAL);
list_for_each_entry(unit_t, curr, &co->units, units)
#include "becopyopt.h"
#include "becopystat.h"
-#define DEBUG_LVL 0 //SET_LEVEL_1
static firm_dbg_module_t *dbg = NULL;
#define is_curr_reg_class(irn) (arch_get_irn_reg_class(co->chordal_env->arch_env, irn, arch_pos_make_out(0)) == co->chordal_env->cls)
copy_opt_t *co;
dbg = firm_dbg_register("ir.be.copyopt");
- firm_dbg_set_mask(dbg, DEBUG_LVL);
+ firm_dbg_set_mask(dbg, DEBUG_LVL_CO);
co = xcalloc(1, sizeof(*co));
co->chordal_env = chordal_env;
co->name = xmalloc(len);
snprintf(co->name, len, "%s__%s__%s", s1, s2, s3);
if (!strcmp(co->name, DEBUG_IRG))
- firm_dbg_set_mask(dbg, DEBUG_LVL_CO);
+ firm_dbg_set_mask(dbg, DEBUG_IRG_LVL_CO);
else
- firm_dbg_set_mask(dbg, DEBUG_LVL);
+ firm_dbg_set_mask(dbg, DEBUG_LVL_CO);
INIT_LIST_HEAD(&co->units);
co_collect_units(co);
unit_t *curr;
list_for_each_entry(unit_t, curr, &co->units, units) {
int root_col = get_irn_col(co, curr->nodes[0]);
- for (i=1; i<curr->node_count; ++i)
- if (root_col != get_irn_col(co, curr->nodes[i])) {
- DBG((dbg, LEVEL_1, " %n %N\n", curr->nodes[i], curr->nodes[i]));
+ DBG((dbg, LEVEL_1, " Adding costs for root %+F color %d\n", curr->nodes[0], root_col));
+ for (i=1; i<curr->node_count; ++i) {
+ int arg_col = get_irn_col(co, curr->nodes[i]);
+ if (root_col != arg_col) {
+ DBG((dbg, LEVEL_1, " Arg %+F color %d costs %d\n", curr->nodes[i], arg_col, curr->costs[i]));
res += curr->costs[i];
}
+ }
}
return res;
}
ir_graph *irg = get_irp_irg(i);
be_main_session_env_t session;
- DBG((env.dbg, LEVEL_1, "be irg: %F\n", irg));
+ DBG((env.dbg, LEVEL_1, "be irg: %F\n", irg));
/* Init the session. */
be_init_session_env(&session, &env, irg);
/* Verify the schedule */
sched_verify_irg(irg);
- /* Build liveness information */
- be_liveness(irg);
+ /* Build liveness information */
+ be_liveness(irg);
/* Remove all cases where a phi and one of its arguments interfere */
be_eliminate_phi_interferences(&session);
copystat_reset();
copystat_collect_irg(irg, env.arch_env);
- /*
- * Verifying the schedule once again cannot hurt.
- */
- sched_verify_irg(irg);
+ /*
+ * Verifying the schedule once again cannot hurt.
+ */
+ sched_verify_irg(irg);
/* Perform the following for each register class. */
for(j = 0, m = isa->get_n_reg_class(); j < m; ++j) {
be_chordal_env_t *chordal_env;
const arch_register_class_t *cls = isa->get_reg_class(j);
- DBG((env.dbg, LEVEL_1, "\treg class: %s\n", cls->name));
+ DBG((env.dbg, LEVEL_1, "\treg class: %s\n", cls->name));
- be_numbering(irg);
- be_liveness(irg);
+ be_numbering(irg);
+ be_liveness(irg);
chordal_env = be_ra_chordal(irg, env.arch_env, cls);
be_ssa_destruction_check(&session, chordal_env);
be_ra_chordal_check(chordal_env);
- be_ra_chordal_done(chordal_env);
- be_numbering_done(irg);
+ be_ra_chordal_done(chordal_env);
+ be_numbering_done(irg);
}
copystat_dump_pretty(irg);