fixed debug output of unary x87 nodes

[libfirm] / ir / be / beifg.h

diff --git a/ir/be/beifg.h b/ir/be/beifg.h
index 482bf20..0f9be1a 100644 (file)
--- a/ir/be/beifg.h
+++ b/ir/be/beifg.h
@@ -10,16 +10,26 @@
 #ifndef _BEIFG_H
 #define _BEIFG_H
 
-#include "irnode.h"
+#include "becopyopt.h"
+
+#ifdef WITH_LIBCORE
+#include <libcore/lc_opts.h>
+#include <libcore/lc_opts_enum.h>
+#include <libcore/lc_timing.h>
+#endif /* WITH_LIBCORE */
+
+#include "firm_types.h"
 
 typedef struct _be_ifg_impl_t   be_ifg_impl_t;
 typedef struct _be_ifg_t        be_ifg_t;
 
 #define be_ifg_nodes_iter_alloca(self)          (alloca(be_ifg_nodes_iter_size(self)))
 #define be_ifg_neighbours_iter_alloca(self)     (alloca(be_ifg_neighbours_iter_size(self)))
+#define be_ifg_cliques_iter_alloca(self)        (alloca(be_ifg_cliques_iter_size(self)))
 
 size_t   (be_ifg_nodes_iter_size)(const void *self);
 size_t   (be_ifg_neighbours_iter_size)(const void *self);
+size_t   (be_ifg_cliques_iter_size)(const void *self);
 void     (be_ifg_free)(void *self);
 int      (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b);
 ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn);
@@ -28,6 +38,9 @@ void     (be_ifg_neighbours_break)(const void *self, void *iter);
 ir_node *(be_ifg_nodes_begin)(const void *self, void *iter);
 ir_node *(be_ifg_nodes_next)(const void *self, void *iter);
 void     (be_ifg_nodes_break)(const void *self, void *iter);
+int      (be_ifg_cliques_begin)(const void *self, void *iter, ir_node **buf);
+int      (be_ifg_cliques_next)(const void *self, void *iter);
+void     (be_ifg_cliques_break)(const void *self, void *iter);
 int      (be_ifg_degree)(const void *self, const ir_node *irn);
 
 #define be_ifg_foreach_neighbour(self, iter, irn, pos) \
@@ -36,4 +49,33 @@ int      (be_ifg_degree)(const void *self, const ir_node *irn);
 #define be_ifg_foreach_node(self, iter, pos) \
        for(pos = be_ifg_nodes_begin(self, iter); (pos); pos = be_ifg_nodes_next(self, iter))
 
+#define be_ifg_foreach_clique(self, iter, buf, count) \
+       for(*(count) = be_ifg_cliques_begin(self, iter, buf); \
+        *(count) != -1 ; \
+        *(count) = be_ifg_cliques_next(self, iter))
+
+/*
+        ____                        _
+       |  _ \ _   _ _ __ ___  _ __ (_)_ __   __ _
+       | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
+       | |_| | |_| | | | | | | |_) | | | | | (_| |
+       |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
+                          |_|            |___/
+*/
+
+typedef struct _be_ifg_dump_dot_cb_t {
+       int  (*is_dump_node)(void *self, ir_node *irn);
+       void (*graph_attr)(FILE *f, void *self);
+       void (*node_attr)(FILE *f, void *self, ir_node *irn);
+       void (*edge_attr)(FILE *f, void *self, ir_node *from, ir_node *to);
+       void (*at_begin)(FILE *file, void *self);
+       void (*at_end)(FILE *file, void *self);
+} be_ifg_dump_dot_cb_t;
+
+void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self);
+void be_ifg_check_sorted(const be_ifg_t *ifg);
+void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f);
+void be_ifg_check_performance(be_chordal_env_t *chordal_env);
+
+
 #endif /* _BEIFG_H */