bescripts: Remove unused execution unit specification.

[libfirm] / ir / be / bechordal.c

diff --git a/ir/be/bechordal.c b/ir/be/bechordal.c
index ed88821..2a71e79 100644 (file)
--- a/ir/be/bechordal.c
+++ b/ir/be/bechordal.c
@@ -53,8 +53,6 @@ static int get_next_free_reg(bitset_t *const available)
 static unsigned const *get_decisive_partner_regs(be_operand_t const *const o1, size_t const n_regs)
 {
        be_operand_t const *const o2 = o1->partner;
-       assert(!o2 || o1->req->cls == o2->req->cls);
-
        if (!o2 || rbitset_contains(o1->regs, o2->regs, n_regs)) {
                return o1->regs;
        } else if (rbitset_contains(o2->regs, o1->regs, n_regs)) {
@@ -113,7 +111,7 @@ static bool list_contains_irn(ir_node *const *const list, size_t const n, ir_nod
 
 static void handle_constraints(be_chordal_env_t *const env, ir_node *const irn)
 {
-       void *const base = obstack_base(env->obst);
+       void *const base = obstack_base(&env->obst);
        be_insn_t  *insn = be_scan_insn(env, irn);
 
        /* Perms inserted before the constraint handling phase are considered to be
@@ -278,7 +276,7 @@ static void handle_constraints(be_chordal_env_t *const env, ir_node *const irn)
        pmap_destroy(partners);
 
 end:
-       obstack_free(env->obst, base);
+       obstack_free(&env->obst, base);
 }
 
 /**
@@ -317,16 +315,14 @@ static void assign(ir_node *const block, void *const env_ptr)
        /* Add initial defs for all values live in.
         * Since their colors have already been assigned (The dominators were
         * allocated before), we have to mark their colors as used also. */
-       be_lv_foreach(lv, block, be_lv_state_in, irn) {
-               if (arch_irn_consider_in_reg_alloc(env->cls, irn)) {
-                       arch_register_t const *const reg = arch_get_irn_register(irn);
+       be_lv_foreach_cls(lv, block, be_lv_state_in, env->cls, irn) {
+               arch_register_t const *const reg = arch_get_irn_register(irn);
 
-                       assert(reg && "Node must have been assigned a register");
-                       DBG((dbg, LEVEL_4, "%+F has reg %s\n", irn, reg->name));
+               assert(reg && "Node must have been assigned a register");
+               DBG((dbg, LEVEL_4, "%+F has reg %s\n", irn, reg->name));
 
-                       /* Mark the color of the live in value as used. */
-                       bitset_clear(available, reg->index);
-               }
+               /* Mark the color of the live in value as used. */
+               bitset_clear(available, reg->index);
        }
 
        /* Mind that the sequence of defs from back to front defines a perfect