Let dfs() discover only memory nodes

[libfirm] / ir / be / beschedrss.c

diff --git a/ir/be/beschedrss.c b/ir/be/beschedrss.c
index 1bbfa39..26857cc 100644 (file)
--- a/ir/be/beschedrss.c
+++ b/ir/be/beschedrss.c
@@ -1729,8 +1729,8 @@ static serialization_t *compute_best_admissible_serialization(rss_t *rss, ir_nod
        int        j, k;
        ir_node    *irn;
        ir_nodeset_iterator_t iter;
-       rss_edge_t min_benefit_edge;
-       rss_edge_t min_omega20_edge;
+       rss_edge_t min_benefit_edge = {NULL, NULL, NULL};
+       rss_edge_t min_omega20_edge = {NULL, NULL, NULL};
        rss_irn_t  *ser_u_omega1 = NULL, *ser_v_omega1 = NULL;
        rss_irn_t  *ser_u_omega20 = NULL, *ser_v_omega20 = NULL;
 
@@ -1811,8 +1811,10 @@ static serialization_t *compute_best_admissible_serialization(rss_t *rss, ir_nod
                        /* v cannot be serialized with itself
                         * ignore nodes where serialization does not help */
                        if (i == j || IS_UNSERIALIZABLE_NODE(v)) {
+#ifdef DEBUG_libfirm
                                if (i != j)
                                        DBG((rss->dbg, LEVEL_3, "\t\t\t%+F considered unserializable\n", v->irn));
+#endif
                                continue;
                        }
 
@@ -2148,7 +2150,7 @@ BE_REGISTER_MODULE_CONSTRUCTOR(be_init_schedrss);
 /**
  * Preprocess the irg for scheduling.
  */
-void rss_schedule_preparation(const be_irg_t *birg) {
+void rss_schedule_preparation(be_irg_t *birg) {
        ir_graph *irg = be_get_birg_irg(birg);
        rss_t rss;
 
@@ -2164,7 +2166,7 @@ void rss_schedule_preparation(const be_irg_t *birg) {
        rss.h        = heights_new(irg);
        rss.nodes    = plist_new();
        rss.opts     = &rss_options;
-       rss.liveness = be_liveness(irg);
+       rss.liveness = be_liveness(birg);
        be_liveness_assure_sets(rss.liveness);
        irg_block_walk_graph(irg, NULL, process_block, &rss);
        heights_free(rss.h);