kill nodes only reachable via out edges after backend transformation

[libfirm] / ir / be / bechordal.c

diff --git a/ir/be/bechordal.c b/ir/be/bechordal.c
index 2c105fe..f5015e4 100644 (file)
--- a/ir/be/bechordal.c
+++ b/ir/be/bechordal.c
@@ -42,7 +42,6 @@
 
 #include "beutil.h"
 #include "besched.h"
-#include "benumb_t.h"
 #include "besched_t.h"
 #include "belive_t.h"
 #include "benode_t.h"
@@ -51,6 +50,7 @@
 #include "beifg.h"
 #include "beinsn_t.h"
 #include "bestatevent.h"
+#include "beirg_t.h"
 
 #include "bechordal_t.h"
 #include "bechordal_draw.h"
@@ -134,8 +134,8 @@ static INLINE border_t *border_add(be_chordal_env_t *env, struct list_head *head
                 */
                set_irn_link(irn, def);
 
-               b->magic = BORDER_FOURCC;
-               def->magic = BORDER_FOURCC;
+               DEBUG_ONLY(b->magic = BORDER_FOURCC);
+               DEBUG_ONLY(def->magic = BORDER_FOURCC);
        }
 
        /*
@@ -856,8 +856,7 @@ static void assign(ir_node *block, void *env_ptr)
        }
 
        /*
-        * Mind that the sequence
-        * of defs from back to front defines a perfect
+        * Mind that the sequence of defs from back to front defines a perfect
         * elimination order. So, coloring the definitions from first to last
         * will work.
         */
@@ -953,8 +952,6 @@ void be_ra_chordal_color(be_chordal_env_t *chordal_env)
        /* Assign the colors */
        dom_tree_walk_irg(irg, assign, NULL, &env);
 
-       be_numbering_done(irg);
-
        if(chordal_env->opts->dump_flags & BE_CH_DUMP_TREE_INTV) {
                plotter_t *plotter;
                ir_snprintf(buf, sizeof(buf), "ifg_%s_%F.eps", chordal_env->cls->name, irg);