#include "bechordal_t.h"
#include "bechordal_draw.h"
+#define DBG_LEVEL 0
#define NO_COLOR (-1)
#undef DUMP_INTERVALS
#endif
-#ifdef DEBUG_libfirm
#include "fourcc.h"
/* Make a fourcc for border checking. */
#define BORDER_FOURCC FOURCC('B', 'O', 'R', 'D')
-#endif /* DEBUG_libfirm */
-
static firm_dbg_module_t *dbg;
#ifdef BUILD_GRAPH
#endif /* BUILD_GRAPH */
+static void check_border_list(struct list_head *head)
+{
+ border_t *x;
+ list_for_each_entry(border_t, x, head, list) {
+ assert(x->magic == BORDER_FOURCC);
+ }
+}
+
+static void check_heads(be_chordal_env_t *env)
+{
+ pmap_entry *ent;
+ for(ent = pmap_first(env->border_heads); ent; ent = pmap_next(env->border_heads)) {
+ /* ir_printf("checking border list of block %+F\n", ent->key); */
+ check_border_list(ent->value);
+ }
+}
+
/**
* Add an interval border to the list of a block's list
/* also allocate the def and tie it to the use. */
def = obstack_alloc(&env->obst, sizeof(*def));
+ memset(def, 0, sizeof(*def));
b->other_end = def;
def->other_end = b;
*/
set_irn_link(irn, def);
-#ifdef DEBUG_libfirm
b->magic = BORDER_FOURCC;
def->magic = BORDER_FOURCC;
-#endif
}
/*
else {
b = get_irn_link(irn);
-#ifdef DEBUG_libfirm
assert(b && b->magic == BORDER_FOURCC && "Illegal border encountered");
-#endif
}
b->pressure = pressure;
b->is_real = is_real;
b->irn = irn;
b->step = step;
+ check_heads(env);
list_add_tail(&b->list, head);
+ check_heads(env);
DBG((dbg, LEVEL_5, "\t\t%s adding %+F, step: %d\n",
is_def ? "def" : "use", irn, step));
+
return b;
}
+static INLINE int has_reg_class(const be_chordal_env_t *env, const ir_node *irn)
+{
+ return arch_irn_has_reg_class(env->arch_env, irn, arch_pos_make_out(0), env->cls);
+}
+
/**
* Annotate the register pressure to the nodes and compute
* the liveness intervals.
/* Set up the border list in the block info */
head = obstack_alloc(&env->obst, sizeof(*head));
INIT_LIST_HEAD(head);
+ assert(pmap_get(env->border_heads, block) == NULL);
pmap_insert(env->border_heads, block, head);
/*
for(irn = pset_first(live_end); irn; irn = pset_next(live_end)) {
DBG((dbg, LEVEL_3, "\tMaking live: %+F/%d\n", irn, get_irn_graph_nr(irn)));
bitset_set(live, get_irn_graph_nr(irn));
- if(arch_irn_has_reg_class(env->arch_env, irn, 0, cls))
+ if(has_reg_class(env, irn))
border_use(irn, step, 0);
}
++step;
* If the node defines some value, which can put into a
* register of the current class, make a border for it.
*/
- if(arch_irn_has_reg_class(env->arch_env, irn, 0, cls)) {
+ if(has_reg_class(env, irn)) {
bitset_pos_t elm;
int nr = get_irn_graph_nr(irn);
#ifdef BUILD_GRAPH
bitset_foreach(live, elm)
- add_if(env, nr, (int) elm);
+ add_if(env, nr, (int) elm);
#endif
}
for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
ir_node *op = get_irn_n(irn, i);
- if(arch_irn_has_reg_class(env->arch_env, op, 0, cls)) {
+ if(has_reg_class(env, op)) {
int nr = get_irn_graph_nr(op);
DBG((dbg, LEVEL_4, "\t\tpos: %d, use: %+F\n", i, op));
* Add initial defs for all values live in.
*/
for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) {
- if(arch_irn_has_reg_class(env->arch_env, irn, 0, cls)) {
+ if(has_reg_class(env, irn)) {
/* Mark the value live in. */
bitset_set(live, get_irn_graph_nr(irn));
}
}
- del_pset(live_in);
- del_pset(live_end);
+ check_heads(env);
+
+ del_pset(live_in);
+ del_pset(live_end);
}
static void assign(ir_node *block, void *env_ptr)
struct list_head *head = get_block_border_head(env, block);
pset *live_in = put_live_in(block, pset_new_ptr_default());
+ check_heads(env);
+
+
bitset_clear_all(live);
bitset_clear_all(colors);
bitset_clear_all(in_colors);
* allocated before), we have to mark their colors as used also.
*/
for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) {
- if(arch_irn_has_reg_class(env->arch_env, irn, 0, cls)) {
+ if(has_reg_class(env, irn)) {
const arch_register_t *reg = arch_get_irn_register(env->arch_env, irn, 0);
int col;
void be_ra_chordal_init(void)
{
dbg = firm_dbg_register(DBG_CHORDAL);
- firm_dbg_set_mask(dbg, 0);
+ firm_dbg_set_mask(dbg, DBG_LEVEL);
}
be_chordal_env_t *be_ra_chordal(ir_graph *irg,
return env;
}
+void be_ra_chordal_check(be_chordal_env_t *chordal_env) {
+ const arch_env_t *arch_env;
+ struct obstack ob;
+ pmap_entry *pme;
+ ir_node **nodes, *n1, *n2;
+ int i, o;
+
+ arch_env = chordal_env->arch_env;
+
+ /* Collect all irns */
+ obstack_init(&ob);
+ pmap_foreach(chordal_env->border_heads, pme) {
+ border_t *curr;
+ struct list_head *head = pme->value;
+ list_for_each_entry(border_t, curr, head, list)
+ if (curr->is_def && curr->is_real)
+ if (arch_get_irn_reg_class(arch_env, curr->irn, arch_pos_make_out(0)) == chordal_env->cls)
+ obstack_ptr_grow(&ob, curr->irn);
+ }
+ obstack_ptr_grow(&ob, NULL);
+ nodes = (ir_node **) obstack_finish(&ob);
+
+ /* Check them */
+ for (i = 0, n1 = nodes[i]; n1; n1 = nodes[++i]) {
+ const arch_register_t *n1_reg, *n2_reg;
+
+ n1_reg = arch_get_irn_register(arch_env, n1, 0);
+ if (!arch_reg_is_allocatable(arch_env, n1, arch_pos_make_out(0), n1_reg)) {
+ DBG((dbg, 0, "Register assigned to %+F is not allowed\n", n1));
+ assert(0 && "Register constraint does not hold");
+ }
+ for (o = i+1, n2 = nodes[o]; n2; n2 = nodes[++o]) {
+ n2_reg = arch_get_irn_register(arch_env, n2, 0);
+ if (nodes_interfere(chordal_env, n1, n2) && n1_reg == n2_reg) {
+ DBG((dbg, 0, "Values %+F and %+F interfere and have the same regiseter assigned\n", n1, n2));
+ assert(0 && "Interfering values have the same color!");
+ }
+ }
+ }
+ obstack_free(&ob, NULL);
+}
+
+/* BETTER #ifdef BUILD_GRAPH --> faster version of checker with edges */
+
void be_ra_chordal_done(be_chordal_env_t *env)
{
#ifdef BUILD_GRAPH
free(env);
}
+
+
int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b)
{
#ifdef BUILD_GRAPH
projects / libfirm / blobdiff