Added some statistics events

[libfirm] / ir / be / beifg.h

diff --git a/ir/be/beifg.h b/ir/be/beifg.h
index 1e6caf3..eb61955 100644 (file)
--- a/ir/be/beifg.h
+++ b/ir/be/beifg.h
@@ -10,31 +10,79 @@
 #ifndef _BEIFG_H
 #define _BEIFG_H
 
-#include "obst.h"
-#include "bechordal_t.h"
+#include "becopyopt.h"
 
-typedef struct _be_ifg_impl_t  be_ifg_impl_t;
-typedef struct _be_ifg_t                               be_ifg_t;
+#ifdef WITH_LIBCORE
+#include <libcore/lc_opts.h>
+#include <libcore/lc_opts_enum.h>
+#include <libcore/lc_timing.h>
+#endif /* WITH_LIBCORE */
 
-struct _be_ifg_impl_t {
-       void (*free)(void *self);
+#include "firm_types.h"
 
-       int (*connected)(void *self, const ir_node *a, const ir_node *b);
-       int (*neighbours_arr)(void *self, const ir_node *irn, ir_node **arr, size_t n);
-       int (*neighbours_obst)(void *self, const ir_node *irn, struct obstack *obst);
-       int (*degree)(void *self, const ir_node *irn);
-};
+typedef struct _be_ifg_impl_t   be_ifg_impl_t;
+typedef struct _be_ifg_t        be_ifg_t;
 
-struct _be_ifg_t {
-       const be_ifg_impl_t *impl;
-};
+#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)))
 
-#define be_ifg_free(self)                                                                              ((self)->impl->free(self))
-#define be_ifg_connected(self,a,b)                                             ((self)->impl->connected(self, a, b))
-#define be_ifg_neighbours_arr(self,irn,arr,n)  ((self)->impl->neighbours_arr(self, irn, arr, n))
-#define be_ifg_neighbours_obst(self,irn,obst)  ((self)->impl->neighbours_arr(self, irn, obst))
-#define be_ifg_degree(self,irn)                                                                ((self)->impl->degree(self, irn))
+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);
+
+#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))
+
+#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 {
+       int n_nodes;
+       int n_edges;
+} be_ifg_stat_t;
+
+void be_ifg_stat(const be_ifg_t *ifg, ir_graph *irg, be_ifg_stat_t *stat);
+
+/*
+        ____                        _
+       |  _ \ _   _ _ __ ___  _ __ (_)_ __   __ _
+       | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
+       | |_| | |_| | | | | | | |_) | | | | | (_| |
+       |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
+                          |_|            |___/
+*/
+
+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);
 
-be_ifg_t *be_ifg_std_new(const be_chordal_env_t *env);
 
 #endif /* _BEIFG_H */