4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
30 size_t (be_ifg_nodes_iter_size)(const void *self)
32 const be_ifg_t *ifg = self;
33 return ifg->impl->nodes_iter_size;
36 size_t (be_ifg_neighbours_iter_size)(const void *self)
38 const be_ifg_t *ifg = self;
39 return ifg->impl->neighbours_iter_size;
42 size_t (be_ifg_cliques_iter_size)(const void *self)
44 const be_ifg_t *ifg = self;
45 return ifg->impl->cliques_iter_size;
48 void (be_ifg_free)(void *self)
51 ifg->impl->free(self);
54 int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b)
56 const be_ifg_t *ifg = self;
57 return ifg->impl->connected(self, a, b);
60 ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn)
62 const be_ifg_t *ifg = self;
63 return ifg->impl->neighbours_begin(self, iter, irn);
66 ir_node *(be_ifg_neighbours_next)(const void *self, void *iter)
68 const be_ifg_t *ifg = self;
69 return ifg->impl->neighbours_next(self, iter);
72 void (be_ifg_neighbours_break)(const void *self, void *iter)
74 const be_ifg_t *ifg = self;
75 ifg->impl->neighbours_break(self, iter);
78 ir_node *(be_ifg_nodes_begin)(const void *self, void *iter)
80 const be_ifg_t *ifg = self;
81 return ifg->impl->nodes_begin(self, iter);
84 ir_node *(be_ifg_nodes_next)(const void *self, void *iter)
86 const be_ifg_t *ifg = self;
87 return ifg->impl->nodes_next(self, iter);
90 void (be_ifg_nodes_break)(const void *self, void *iter)
92 const be_ifg_t *ifg = self;
93 ifg->impl->nodes_break(self, iter);
96 int (be_ifg_cliques_begin)(const void *self, void *iter, ir_node **buf)
98 const be_ifg_t *ifg = self;
99 return ifg->impl->cliques_begin(self, iter, buf);
102 int (be_ifg_cliques_next)(const void *self, void *iter)
104 const be_ifg_t *ifg = self;
105 return ifg->impl->cliques_next(self, iter);
108 void (be_ifg_cliques_break)(const void *self, void *iter)
110 const be_ifg_t *ifg = self;
111 ifg->impl->cliques_break(self, iter);
114 int (be_ifg_degree)(const void *self, const ir_node *irn)
116 const be_ifg_t *ifg = self;
117 return ifg->impl->degree(self, irn);
121 int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn)
123 int degree = be_ifg_degree(ifg, irn);
124 void *iter = be_ifg_neighbours_iter_alloca(ifg);
126 ir_node **neighbours = xmalloc(degree * sizeof(neighbours[0]));
132 be_ifg_foreach_neighbour(ifg, iter, irn, curr)
133 neighbours[i++] = curr;
135 for(i = 0; i < degree; ++i) {
136 for(j = 0; j < i; ++j)
137 if(!be_ifg_connected(ifg, neighbours[i], neighbours[j])) {
148 void be_ifg_check(const be_ifg_t *ifg)
150 void *iter1 = be_ifg_nodes_iter_alloca(ifg);
151 void *iter2 = be_ifg_neighbours_iter_alloca(ifg);
155 /* Check, if all neighbours are indeed connected to the node. */
156 be_ifg_foreach_node(ifg, iter1, n) {
157 be_ifg_foreach_neighbour(ifg, iter2, n, m)
158 if(!be_ifg_connected(ifg, n, m))
159 ir_fprintf(stderr, "%+F is a neighbour of %+F but they are not connected!\n", n, m);
163 void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self)
165 void *nodes_it = be_ifg_nodes_iter_alloca(ifg);
166 void *neigh_it = be_ifg_neighbours_iter_alloca(ifg);
167 bitset_t *nodes = bitset_malloc(get_irg_last_idx(irg));
171 fprintf(file, "graph G {\n\tgraph [");
173 cb->graph_attr(file, self);
174 fprintf(file, "];\n");
177 cb->at_begin(file, self);
179 be_ifg_foreach_node(ifg, nodes_it, n) {
180 if(cb->is_dump_node && cb->is_dump_node(self, n)) {
181 int idx = get_irn_idx(n);
182 bitset_set(nodes, idx);
183 fprintf(file, "\tnode [");
185 cb->node_attr(file, self, n);
186 fprintf(file, "]; n%d;\n", idx);
190 /* Check, if all neighbours are indeed connected to the node. */
191 be_ifg_foreach_node(ifg, nodes_it, n) {
192 be_ifg_foreach_neighbour(ifg, neigh_it, n, m) {
193 int n_idx = get_irn_idx(n);
194 int m_idx = get_irn_idx(m);
196 if(n_idx < m_idx && bitset_is_set(nodes, n_idx) && bitset_is_set(nodes, m_idx)) {
197 fprintf(file, "\tn%d -- n%d [", n_idx, m_idx);
199 cb->edge_attr(file, self, n, m);
200 fprintf(file, "];\n");
206 cb->at_end(file, self);
208 fprintf(file, "}\n");