2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
21 * Common use interference graph.
22 * Originally written by Sebastian Hack. Refactored into a seperate
23 * source file and header by Kimon Hoffmann.
24 * @author Sebastian Hack
32 struct _be_ifg_impl_t {
33 size_t nodes_iter_size;
34 size_t neighbours_iter_size;
35 size_t cliques_iter_size;
37 void (*free)(void *self);
38 int (*connected)(const void *self, const ir_node *a, const ir_node *b);
40 ir_node *(*neighbours_begin)(const void *self, void *iter, const ir_node *irn);
41 ir_node *(*neighbours_next)(const void *self, void *iter);
42 void (*neighbours_break)(const void *self, void *iter);
44 ir_node *(*nodes_begin)(const void *self, void *iter);
45 ir_node *(*nodes_next)(const void *self, void *iter);
46 void (*nodes_break)(const void *self, void *iter);
48 int (*cliques_begin)(const void *self, void *iter, ir_node **buf);
49 int (*cliques_next)(const void *self, void *iter);
50 void (*cliques_break)(const void *self, void *iter);
52 int (*degree)(const void *self, const ir_node *irn);
56 const be_ifg_impl_t *impl;
57 const be_chordal_env_t *env;
60 #ifdef _BE_IFG_USE_MACROS
62 #define be_ifg_nodes_iter_size(self) ((self)->impl->nodes_iter_size)
63 #define be_ifg_neighbours_iter_size(self) ((self)->impl->neighbours_iter_size)
64 #define be_ifg_cliques_iter_size(self) ((self)->impl->cliques_iter_size)
66 #define be_ifg_free(self) ((self)->impl->free(self))
67 #define be_ifg_connected(self,a,b) ((self)->impl->connected(self, a, b))
68 #define be_ifg_neighbours_begin(self, iter, irn) ((self)->impl->neighbours_begin(self, iter, irn))
69 #define be_ifg_neighbours_next(self, iter) ((self)->impl->neighbours_next(self, iter))
70 #define be_ifg_neighbours_break(self, iter) ((self)->impl->neighbours_break(self, iter))
71 #define be_ifg_nodes_begin(self, iter) ((self)->impl->nodes_begin(self, iter))
72 #define be_ifg_nodes_next(self, iter) ((self)->impl->nodes_next(self, iter))
73 #define be_ifg_nodes_break(self, iter) ((self)->impl->nodes_break(self, iter))
74 #define be_ifg_cliques_begin(self, iter, buf) ((self)->impl->cliques_begin(self, iter, buf))
75 #define be_ifg_cliques_next(self, iter) ((self)->impl->cliques_next(self, iter))
76 #define be_ifg_cliques_break(self, iter) ((self)->impl->cliques_break(self, iter))
77 #define be_ifg_degree(self,irn) ((self)->impl->degree(self, irn))
81 void be_ifg_check(const be_ifg_t *ifg);
83 #endif /*_BEIFG_T_H_*/