4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
13 #include "becopyopt.h"
15 #include "firm_types.h"
17 typedef struct _be_ifg_impl_t be_ifg_impl_t;
18 typedef struct _be_ifg_t be_ifg_t;
20 #define be_ifg_nodes_iter_alloca(self) (alloca(be_ifg_nodes_iter_size(self)))
21 #define be_ifg_neighbours_iter_alloca(self) (alloca(be_ifg_neighbours_iter_size(self)))
22 #define be_ifg_cliques_iter_alloca(self) (alloca(be_ifg_cliques_iter_size(self)))
24 size_t (be_ifg_nodes_iter_size)(const be_ifg_t *self);
25 size_t (be_ifg_neighbours_iter_size)(const be_ifg_t *self);
26 size_t (be_ifg_cliques_iter_size)(const be_ifg_t *self);
27 void (be_ifg_free)(be_ifg_t *self);
28 int (be_ifg_connected)(const be_ifg_t *self, const ir_node *a, const ir_node *b);
29 ir_node *(be_ifg_neighbours_begin)(const be_ifg_t *self, void *iter, const ir_node *irn);
30 ir_node *(be_ifg_neighbours_next)(const be_ifg_t *self, void *iter);
31 void (be_ifg_neighbours_break)(const be_ifg_t *self, void *iter);
32 ir_node *(be_ifg_nodes_begin)(const be_ifg_t *self, void *iter);
33 ir_node *(be_ifg_nodes_next)(const be_ifg_t *self, void *iter);
34 void (be_ifg_nodes_break)(const be_ifg_t *self, void *iter);
35 int (be_ifg_cliques_begin)(const be_ifg_t *self, void *iter, ir_node **buf);
36 int (be_ifg_cliques_next)(const be_ifg_t *self, void *iter);
37 void (be_ifg_cliques_break)(const be_ifg_t *self, void *iter);
38 int (be_ifg_degree)(const be_ifg_t *self, const ir_node *irn);
40 #define be_ifg_foreach_neighbour(self, iter, irn, pos) \
41 for(pos = be_ifg_neighbours_begin(self, iter, irn); (pos); pos = be_ifg_neighbours_next(self, iter))
43 #define be_ifg_foreach_node(self, iter, pos) \
44 for(pos = be_ifg_nodes_begin(self, iter); (pos); pos = be_ifg_nodes_next(self, iter))
46 #define be_ifg_foreach_clique(self, iter, buf, count) \
47 for(*(count) = be_ifg_cliques_begin(self, iter, buf); \
49 *(count) = be_ifg_cliques_next(self, iter))
57 void be_ifg_stat(be_irg_t *birg, be_ifg_t *ifg, be_ifg_stat_t *stat);
59 be_ifg_t *be_create_ifg(const be_chordal_env_t *env);
63 | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
64 | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
65 | |_| | |_| | | | | | | |_) | | | | | (_| |
66 |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
70 typedef struct _be_ifg_dump_dot_cb_t {
71 int (*is_dump_node)(void *self, ir_node *irn);
72 void (*graph_attr)(FILE *f, void *self);
73 void (*node_attr)(FILE *f, void *self, ir_node *irn);
74 void (*edge_attr)(FILE *f, void *self, ir_node *from, ir_node *to);
75 void (*at_begin)(FILE *file, void *self);
76 void (*at_end)(FILE *file, void *self);
77 } be_ifg_dump_dot_cb_t;
79 void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self);
80 void be_ifg_check_sorted(const be_ifg_t *ifg);
81 void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f);
82 void be_ifg_check_performance(be_chordal_env_t *chordal_env);