4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
28 size_t (be_ifg_nodes_iter_size)(const void *self)
30 const be_ifg_t *ifg = self;
31 return ifg->impl->nodes_iter_size;
34 size_t (be_ifg_neighbours_iter_size)(const void *self)
36 const be_ifg_t *ifg = self;
37 return ifg->impl->neighbours_iter_size;
40 void (be_ifg_free)(void *self)
43 ifg->impl->free(self);
46 int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b)
48 const be_ifg_t *ifg = self;
49 return ifg->impl->connected(self, a, b);
52 ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn)
54 const be_ifg_t *ifg = self;
55 return ifg->impl->neighbours_begin(self, iter, irn);
58 ir_node *(be_ifg_neighbours_next)(const void *self, void *iter)
60 const be_ifg_t *ifg = self;
61 return ifg->impl->neighbours_next(self, iter);
64 void (be_ifg_neighbours_break)(const void *self, void *iter)
66 const be_ifg_t *ifg = self;
67 ifg->impl->neighbours_break(self, iter);
70 ir_node *(be_ifg_nodes_begin)(const void *self, void *iter)
72 const be_ifg_t *ifg = self;
73 return ifg->impl->nodes_begin(self, iter);
76 ir_node *(be_ifg_nodes_next)(const void *self, void *iter)
78 const be_ifg_t *ifg = self;
79 return ifg->impl->nodes_next(self, iter);
82 void (be_ifg_nodes_break)(const void *self, void *iter)
84 const be_ifg_t *ifg = self;
85 ifg->impl->nodes_break(self, iter);
88 int (be_ifg_degree)(const void *self, const ir_node *irn)
90 const be_ifg_t *ifg = self;
91 return ifg->impl->degree(self, irn);
95 int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn)
97 int degree = be_ifg_degree(ifg, irn);
98 void *iter = be_ifg_neighbours_iter_alloca(ifg);
100 ir_node **neighbours = malloc(degree * sizeof(neighbours[0]));
105 be_ifg_foreach_neighbour(ifg, iter, irn, curr)
106 neighbours[i++] = curr;
108 for(i = 0; i < degree; ++i) {
109 for(j = 0; j < i; ++j)
110 if(!be_ifg_connected(ifg, neighbours[i], neighbours[j])) {
121 void be_ifg_check(const be_ifg_t *ifg)
123 void *iter1 = be_ifg_nodes_iter_alloca(ifg);
124 void *iter2 = be_ifg_neighbours_iter_alloca(ifg);
128 /* Check, if all neighbours are indeed connected to the node. */
129 be_ifg_foreach_node(ifg, iter1, n) {
130 be_ifg_foreach_neighbour(ifg, iter2, n, m)
131 if(!be_ifg_connected(ifg, n, m))
132 ir_fprintf(stderr, "%+F is a neighbour of %+F but they are not connected!\n", n, m);