Implement binary emitter for Cmp8Bit.

[libfirm] / ir / be / beutil.c

diff --git a/ir/be/beutil.c b/ir/be/beutil.c
index d800315..2e884d0 100644 (file)
--- a/ir/be/beutil.c
+++ b/ir/be/beutil.c
@@ -23,9 +23,7 @@
  * @author      Sebastian Hack
  * @version     $Id$
  */
-#ifdef HAVE_CONFIG_H
 #include "config.h"
-#endif
 
 #include <stdio.h>
 
@@ -43,8 +41,8 @@
 #include "iredges.h"
 
 #include "beutil.h"
-#include "besched_t.h"
-#include "bearch_t.h"
+#include "besched.h"
+#include "bearch.h"
 
 /* Get an always empty set. */
 pset *be_empty_set(void)
@@ -58,71 +56,6 @@ pset *be_empty_set(void)
        return empty_set;
 }
 
-struct dump_env {
-       FILE *f;
-       arch_env_t *env;
-};
-
-static void dump_allocated_block(ir_node *block, void *data)
-{
-       int i, n;
-       const ir_node *irn;
-       struct dump_env *dump_env = data;
-       FILE *f = dump_env->f;
-       arch_env_t *env = dump_env->env;
-
-       ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"", block);
-       sched_foreach(block, irn) {
-               const char *prefix = "";
-
-               const arch_register_t *reg = arch_get_irn_register(env, irn);
-
-               ir_fprintf(f, "\n");
-               if(reg)
-                       ir_fprintf(f, "%s = ", arch_register_get_name(reg));
-
-               ir_fprintf(f, "%n(", irn);
-
-               if(block != get_irg_start_block(get_irn_irg(block))) {
-                       for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
-                               ir_node *op = get_irn_n(irn, i);
-                               if(arch_is_register_operand(dump_env->env, op, -1)) {
-                                       ir_fprintf(f, "%s%s", prefix,
-                                               arch_register_get_name(arch_get_irn_register(env, op)));
-                                       prefix = ", ";
-                               }
-                       }
-               }
-
-               ir_fprintf(f, ")");
-       }
-       ir_fprintf(f, "\"}\n");
-
-       if(get_irg_start_block(get_irn_irg(block)) != block) {
-               for(i = 0, n = get_irn_arity(block); i < n; ++i) {
-                       ir_node *pred_bl = get_nodes_block(get_irn_n(block, i));
-                       ir_fprintf(f, "edge:{sourcename:\"b%N\" targetname:\"b%N\"}\n", block, pred_bl);
-               }
-       }
-}
-
-void dump_allocated_irg(arch_env_t *arch_env, ir_graph *irg, char *suffix)
-{
-       char buf[1024];
-       struct dump_env env;
-
-       env.env = arch_env;
-
-       ir_snprintf(buf, sizeof(buf), "%F-alloc%s.vcg", irg, suffix);
-
-       if((env.f = fopen(buf, "wt")) != NULL) {
-               fprintf(env.f, "graph:{title:\"prg\"\n");
-               irg_block_walk_graph(irg, dump_allocated_block, NULL, &env);
-               fprintf(env.f, "}\n");
-               fclose(env.f);
-       }
-}
-
 /**
  * Edge hook to dump the schedule edges.
  */
@@ -182,28 +115,9 @@ void be_dump(ir_graph *irg, const char *suffix, void (*dumper)(ir_graph *, const
        dumper(irg, buf);
 }
 
-
-
-static void collect_phis(ir_node *irn, void *data)
-{
-       (void) data;
-       if(is_Phi(irn)) {
-               ir_node *bl = get_nodes_block(irn);
-               set_irn_link(irn, get_irn_link(bl));
-               set_irn_link(bl, irn);
-       }
-}
-
 void be_clear_links(ir_graph *irg)
 {
-       set_using_irn_link(irg);
        irg_walk_graph(irg, firm_clear_link, NULL, NULL);
-       clear_using_irn_link(irg);
-}
-
-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)
@@ -230,7 +144,7 @@ ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn) {
        foreach_out_edge(irn, edge) {
                proj = get_edge_src_irn(edge);
 
-               if (get_Proj_proj(proj) == pn)
+               if (is_Proj(proj) && get_Proj_proj(proj) == pn)
                        return proj;
        }
 
@@ -249,3 +163,25 @@ FILE *be_ffopen(const char *base, const char *ext, const char *mode) {
        }
        return out;
 }
+
+static void add_to_postorder(ir_node *block, void *data)
+{
+       ir_node ***list = (ir_node***) data;
+       ARR_APP1(ir_node*, *list, block);
+}
+
+ir_node **be_get_cfgpostorder(ir_graph *irg)
+{
+       ir_node **list      = NEW_ARR_F(ir_node*, 0);
+       ir_node  *end_block = get_irg_end_block(irg);
+
+       /* end block may be unreachable in case of endless loops */
+       if (get_Block_n_cfgpreds(end_block) == 0)
+               ARR_APP1(ir_node*, list, end_block);
+
+       /* walk blocks */
+       irg_block_edges_walk(get_irg_start_block(irg), NULL, add_to_postorder,
+                            &list);
+
+       return list;
+}