4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
13 #include "becopyopt.h"
16 #include <libcore/lc_opts.h>
17 #include <libcore/lc_opts_enum.h>
18 #include <libcore/lc_timing.h>
19 #endif /* WITH_LIBCORE */
21 #include "firm_types.h"
23 typedef struct _be_ifg_impl_t be_ifg_impl_t;
24 typedef struct _be_ifg_t be_ifg_t;
26 #define be_ifg_nodes_iter_alloca(self) (alloca(be_ifg_nodes_iter_size(self)))
27 #define be_ifg_neighbours_iter_alloca(self) (alloca(be_ifg_neighbours_iter_size(self)))
28 #define be_ifg_cliques_iter_alloca(self) (alloca(be_ifg_cliques_iter_size(self)))
30 size_t (be_ifg_nodes_iter_size)(const void *self);
31 size_t (be_ifg_neighbours_iter_size)(const void *self);
32 size_t (be_ifg_cliques_iter_size)(const void *self);
33 void (be_ifg_free)(void *self);
34 int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b);
35 ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn);
36 ir_node *(be_ifg_neighbours_next)(const void *self, void *iter);
37 void (be_ifg_neighbours_break)(const void *self, void *iter);
38 ir_node *(be_ifg_nodes_begin)(const void *self, void *iter);
39 ir_node *(be_ifg_nodes_next)(const void *self, void *iter);
40 void (be_ifg_nodes_break)(const void *self, void *iter);
41 int (be_ifg_cliques_begin)(const void *self, void *iter, ir_node **buf);
42 int (be_ifg_cliques_next)(const void *self, void *iter);
43 void (be_ifg_cliques_break)(const void *self, void *iter);
44 int (be_ifg_degree)(const void *self, const ir_node *irn);
46 #define be_ifg_foreach_neighbour(self, iter, irn, pos) \
47 for(pos = be_ifg_neighbours_begin(self, iter, irn); (pos); pos = be_ifg_neighbours_next(self, iter))
49 #define be_ifg_foreach_node(self, iter, pos) \
50 for(pos = be_ifg_nodes_begin(self, iter); (pos); pos = be_ifg_nodes_next(self, iter))
52 #define be_ifg_foreach_clique(self, iter, buf, count) \
53 for(*(count) = be_ifg_cliques_begin(self, iter, buf); \
55 *(count) = be_ifg_cliques_next(self, iter))
59 | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
60 | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
61 | |_| | |_| | | | | | | |_) | | | | | (_| |
62 |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
66 typedef struct _be_ifg_dump_dot_cb_t {
67 int (*is_dump_node)(void *self, ir_node *irn);
68 void (*graph_attr)(FILE *f, void *self);
69 void (*node_attr)(FILE *f, void *self, ir_node *irn);
70 void (*edge_attr)(FILE *f, void *self, ir_node *from, ir_node *to);
71 void (*at_begin)(FILE *file, void *self);
72 void (*at_end)(FILE *file, void *self);
73 } be_ifg_dump_dot_cb_t;
75 void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self);
76 void be_ifg_check_sorted(const be_ifg_t *ifg);
77 void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f);
78 void be_ifg_check_performance(be_chordal_env_t *chordal_env);