4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
28 size_t (be_ifg_iter_size)(const void *self)
30 const be_ifg_t *ifg = self;
31 return ifg->impl->iter_size;
34 void (be_ifg_free)(void *self)
37 ifg->impl->free(self);
40 int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b)
42 const be_ifg_t *ifg = self;
43 return ifg->impl->connected(self, a, b);
46 ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn)
48 const be_ifg_t *ifg = self;
49 return ifg->impl->neighbours_begin(self, iter, irn);
52 ir_node *(be_ifg_neighbours_next)(const void *self, void *iter)
54 const be_ifg_t *ifg = self;
55 return ifg->impl->neighbours_next(self, iter);
58 ir_node *(be_ifg_nodes_begin)(const void *self, void *iter)
60 const be_ifg_t *ifg = self;
61 return ifg->impl->nodes_begin(self, iter);
64 ir_node *(be_ifg_nodes_next)(const void *self, void *iter)
66 const be_ifg_t *ifg = self;
67 return ifg->impl->nodes_next(self, iter);
70 int (be_ifg_degree)(const void *self, const ir_node *irn)
72 const be_ifg_t *ifg = self;
73 return ifg->impl->degree(self, irn);
77 int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn)
79 int degree = be_ifg_degree(ifg, irn);
80 void *iter = be_ifg_iter_alloca(ifg);
82 ir_node **neighbours = malloc(degree * sizeof(neighbours[0]));
87 be_ifg_foreach_neighbour(ifg, iter, irn, curr)
88 neighbours[i++] = curr;
90 for(i = 0; i < degree; ++i) {
91 for(j = 0; j < i; ++j)
92 if(!be_ifg_connected(ifg, neighbours[i], neighbours[j])) {
103 void be_fg_check(const be_ifg_t *ifg)
105 void *iter1 = be_ifg_iter_alloca(ifg);
106 void *iter2 = be_ifg_iter_alloca(ifg);
110 /* Check, if all neighbours are indeed connected to the node. */
111 be_ifg_foreach_node(ifg, iter1, n) {
112 be_ifg_foreach_neighbour(ifg, iter2, n, m)
113 if(!be_ifg_connected(ifg, n, m))
114 ir_fprintf(stderr, "%+F is a neighbour of %+F but they are not connected!\n", n, m);