- new spillslots dump phase

[libfirm] / ir / be / beutil.c

diff --git a/ir/be/beutil.c b/ir/be/beutil.c
index 6dc2e4b..bcf3c28 100644 (file)
--- a/ir/be/beutil.c
+++ b/ir/be/beutil.c
@@ -1,3 +1,8 @@
+/**
+ * Contains some useful function for the backend.
+ * @author Sebastian Hack
+ * @cvsid  $Id$
+ */
 #ifdef HAVE_CONFIG_H
 #include "config.h"
 #endif
@@ -13,19 +18,22 @@
 #include "ircons.h"
 #include "iropt.h"
 #include "irgopt.h"
+#include "irtools.h"
 #include "irprintf.h"
 
 #include "beutil.h"
 #include "besched_t.h"
 #include "bearch.h"
 
+/* Get an always empty set. */
 pset *be_empty_set(void)
 {
        static pset *empty_set = NULL;
 
        if(!empty_set)
-               empty_set = pset_new_ptr_default();
+               empty_set = pset_new_ptr(1);
 
+       assert(pset_count(empty_set) == 0);
        return empty_set;
 }
 
@@ -128,26 +136,38 @@ void localize_consts(ir_graph *irg)
        dead_node_elimination(irg);
 }
 
+/**
+ * Edge hook to dump the schedule edges.
+ */
 static int sched_edge_hook(FILE *F, ir_node *irn)
 {
-    if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
-        ir_node *prev = sched_prev(irn);
-        fprintf(F, "edge:{sourcename:\"");
-        PRINT_NODEID(irn);
-        fprintf(F, "\" targetname:\"");
-        PRINT_NODEID(prev);
-        fprintf(F, "\" color:magenta}\n");
-    }
-    return 1;
+       if(sched_is_scheduled(irn) && sched_has_prev(irn)) {
+               ir_node *prev = sched_prev(irn);
+               fprintf(F, "edge:{sourcename:\"");
+               PRINT_NODEID(irn);
+               fprintf(F, "\" targetname:\"");
+               PRINT_NODEID(prev);
+               fprintf(F, "\" color:magenta}\n");
+       }
+       return 1;
 }
 
 void dump_ir_block_graph_sched(ir_graph *irg, const char *suffix) {
-    DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
+       DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
 
        dump_consts_local(0);
-    set_dump_node_edge_hook(sched_edge_hook);
-    dump_ir_block_graph(irg, suffix);
-    set_dump_node_edge_hook(old);
+       set_dump_node_edge_hook(sched_edge_hook);
+       dump_ir_block_graph(irg, suffix);
+       set_dump_node_edge_hook(old);
+}
+
+void dump_ir_extblock_graph_sched(ir_graph *irg, const char *suffix) {
+       DUMP_NODE_EDGE_FUNC old = get_dump_node_edge_hook();
+
+       dump_consts_local(0);
+       set_dump_node_edge_hook(sched_edge_hook);
+       dump_ir_extblock_graph(irg, suffix);
+       set_dump_node_edge_hook(old);
 }
 
 /**
@@ -167,16 +187,12 @@ void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const
        }
 
        snprintf(buf, sizeof(buf), "-%02d%s", nr++, suffix);
+       buf[sizeof(buf) - 1] = '\0';
        dumper(irg, buf);
 }
 
 
 
-static void clear_link(ir_node *irn, void *data)
-{
-  set_irn_link(irn, NULL);
-}
-
 static void collect_phis(ir_node *irn, void *data)
 {
   if(is_Phi(irn)) {
@@ -188,7 +204,7 @@ static void collect_phis(ir_node *irn, void *data)
 
 void be_clear_links(ir_graph *irg)
 {
-       irg_walk_graph(irg, clear_link, NULL, NULL);
+       irg_walk_graph(irg, firm_clear_link, NULL, NULL);
 }
 
 void be_collect_phis(ir_graph *irg)
@@ -196,7 +212,18 @@ void be_collect_phis(ir_graph *irg)
        irg_walk_graph(irg, collect_phis, NULL, NULL);
 }
 
+static void count_num_reachable_nodes(ir_node *irn, void *env) {
+       int *num = env;
+       (*num)++;
+}
+
+unsigned get_num_reachable_nodes(ir_graph *irg) {
+       int num = 0;
+       irg_walk_graph(irg, count_num_reachable_nodes, NULL, &num);
+       return num;
+}
 
+/* FIXME: not used. can be deleted? */
 ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
        ir_node *irn, *idom;
 
@@ -205,6 +232,9 @@ ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
                if (pset_find_ptr(accept, irn))
                        return irn;
 
+       /* FIXME: This is obviously buggy: after the first recursive call idom is a block
+          and get_nodes_block will fail.
+                Moreover, why not a simple iteration instead of recursion */
        idom = get_Block_idom(get_nodes_block(start_point_exclusive));
 
        if (idom)