2 * Common use interference graph.
3 * Originally written by Sebastian Hack. Refactored into a seperate
4 * source file and header by Kimon Hoffmann.
5 * @author Sebastian Hack
13 struct _be_ifg_impl_t {
16 void (*free)(void *self);
17 int (*connected)(const void *self, const ir_node *a, const ir_node *b);
19 ir_node *(*neighbours_begin)(const void *self, void *iter, const ir_node *irn);
20 ir_node *(*neighbours_next)(const void *self, void *iter);
22 ir_node *(*nodes_begin)(const void *self, void *iter);
23 ir_node *(*nodes_next)(const void *self, void *iter);
25 int (*degree)(const void *self, const ir_node *irn);
29 const be_ifg_impl_t *impl;
32 #ifdef _BE_IFG_USE_MACROS
34 #define be_ifg_iter_size(self) ((self)->impl->iter_size)
35 #define be_ifg_free(self) ((self)->impl->free(self))
36 #define be_ifg_connected(self,a,b) ((self)->impl->connected(self, a, b))
37 #define be_ifg_neighbours_begin(self, iter, irn) ((self)->impl->neighbours_begin(self, iter, irn))
38 #define be_ifg_neighbours_next(self, iter) ((self)->impl->neighbours_next(self, iter))
39 #define be_ifg_nodes_begin(self, iter) ((self)->impl->nodes_begin(self, iter))
40 #define be_ifg_nodes_next(self, iter) ((self)->impl->nodes_next(self, iter))
41 #define be_ifg_degree(self,irn) ((self)->impl->degree(self, irn))
45 #endif /*_BEIFG_T_H_*/