removed unitialized used vartiable

[libfirm] / ir / be / beifg.h

diff --git a/ir/be/beifg.h b/ir/be/beifg.h
index e80dd04..0e0eb8d 100644 (file)
--- a/ir/be/beifg.h
+++ b/ir/be/beifg.h
@@ -12,12 +12,6 @@
 
 #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;
@@ -27,21 +21,21 @@ typedef struct _be_ifg_t        be_ifg_t;
 #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);
-ir_node *(be_ifg_neighbours_next)(const void *self, void *iter);
-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);
+size_t   (be_ifg_nodes_iter_size)(const be_ifg_t *self);
+size_t   (be_ifg_neighbours_iter_size)(const be_ifg_t *self);
+size_t   (be_ifg_cliques_iter_size)(const be_ifg_t *self);
+void     (be_ifg_free)(be_ifg_t *self);
+int      (be_ifg_connected)(const be_ifg_t *self, const ir_node *a, const ir_node *b);
+ir_node *(be_ifg_neighbours_begin)(const be_ifg_t *self, void *iter, const ir_node *irn);
+ir_node *(be_ifg_neighbours_next)(const be_ifg_t *self, void *iter);
+void     (be_ifg_neighbours_break)(const be_ifg_t *self, void *iter);
+ir_node *(be_ifg_nodes_begin)(const be_ifg_t *self, void *iter);
+ir_node *(be_ifg_nodes_next)(const be_ifg_t *self, void *iter);
+void     (be_ifg_nodes_break)(const be_ifg_t *self, void *iter);
+int      (be_ifg_cliques_begin)(const be_ifg_t *self, void *iter, ir_node **buf);
+int      (be_ifg_cliques_next)(const be_ifg_t *self, void *iter);
+void     (be_ifg_cliques_break)(const be_ifg_t *self, void *iter);
+int      (be_ifg_degree)(const be_ifg_t *self, const ir_node *irn);
 
 #define be_ifg_foreach_neighbour(self, iter, irn, pos) \
        for(pos = be_ifg_neighbours_begin(self, iter, irn); (pos); pos = be_ifg_neighbours_next(self, iter))
@@ -54,6 +48,16 @@ int      (be_ifg_degree)(const void *self, const ir_node *irn);
         *(count) != -1 ; \
         *(count) = be_ifg_cliques_next(self, iter))
 
+typedef struct {
+       int n_nodes;
+       int n_edges;
+       int n_comps;
+} be_ifg_stat_t;
+
+void be_ifg_stat(be_irg_t *birg, be_ifg_t *ifg, be_ifg_stat_t *stat);
+
+be_ifg_t *be_create_ifg(const be_chordal_env_t *env);
+
 /*
         ____                        _
        |  _ \ _   _ _ __ ___  _ __ (_)_ __   __ _
@@ -73,7 +77,8 @@ typedef struct _be_ifg_dump_dot_cb_t {
 } 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, FILE *f);
+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);