becopyilp: Do not advertise the switch to dump the solution, because this is not...
[libfirm] / ir / be / beutil.c
index 10745a2..0e7d7b5 100644 (file)
@@ -1,62 +1,85 @@
+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
+ */
+
+/**
+ * @file
+ * @brief       Contains some useful function for the backend.
+ * @author      Sebastian Hack
+ */
+#include "config.h"
 
 #include <stdio.h>
 
+#include "pset.h"
+
 #include "irgraph.h"
 #include "irgwalk.h"
+#include "irdump_t.h"
+#include "irdom_t.h"
+#include "ircons.h"
+#include "iropt.h"
+#include "irgopt.h"
+#include "irtools.h"
 #include "irprintf.h"
+#include "iredges_t.h"
 
 #include "beutil.h"
-#include "besched_t.h"
-#include "bera_t.h"
+#include "besched.h"
+#include "bearch.h"
 
-static void dump_allocated_block(ir_node *block, void *env)
+void be_clear_links(ir_graph *irg)
 {
-       int i, n;
-       const ir_node *irn;
-       FILE *f = env;
-
-       ir_fprintf(f, "node:{title:\"b%N\"\nlabel:\"%n\n", block, block);
-       sched_foreach(block, irn) {
-               const char *prefix = "";
-
-               ir_fprintf(f, "\n");
-               if(is_color(get_irn_color(irn)))
-                       ir_fprintf(f, "r%d = ", get_irn_color(irn));
-               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(is_allocatable_irn(op)) {
-                                       ir_fprintf(f, "%sr%d", prefix, get_irn_color(op));
-                                       prefix = ", ";
-                               }
-                       }
-               }
-
-               ir_fprintf(f, ")");
-       }
-       ir_fprintf(f, "\"}\n");
+       irg_walk_graph(irg, firm_clear_link, NULL, NULL);
+}
 
-       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", pred_bl, block);
-               }
+/**
+ * Gets the Proj with number pn from irn.
+ */
+ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn)
+{
+       ir_node *proj;
+       assert(get_irn_mode(irn) == mode_T && "need mode_T");
+
+       foreach_out_edge(irn, edge) {
+               proj = get_edge_src_irn(edge);
+
+               if (is_Proj(proj) && get_Proj_proj(proj) == pn)
+                       return proj;
        }
+
+       return NULL;
 }
 
-void dump_allocated_irg(ir_graph *irg)
+/**
+ * Block-walker: adds the visited block to a flexible array.
+ */
+static void add_to_postorder(ir_node *block, void *data)
 {
-       char buf[1024];
-       FILE *f;
+       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);
 
-       snprintf(buf, sizeof(buf), "%s-alloc.vcg", get_entity_name(get_irg_entity(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);
 
-       if((f = fopen(buf, "wt")) != NULL) {
-               fprintf(f, "graph:{title:\"prg\"\n");
-               irg_block_walk_graph(irg, dump_allocated_block, NULL, f);
-               fprintf(f, "}\n");
-               fclose(f);
-       }
+       /* walk blocks */
+       irg_block_edges_walk(get_irg_start_block(irg), NULL, add_to_postorder,
+                            &list);
+
+       return list;
+}
+
+ir_node *get_first_block_succ(const ir_node *block)
+{
+       const ir_edge_t *edge = get_irn_out_edge_first_kind(block, EDGE_KIND_BLOCK);
+       assert(edge != NULL);
+       return get_edge_src_irn(edge);
 }