4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
19 #include "irgraph_t.h"
25 #include "bechordal_t.h"
27 #define MAX(x, y) ((x) > (y) ? (x) : (y))
29 typedef struct _ifg_std_t ifg_std_t;
32 const be_ifg_impl_t *impl;
33 const be_chordal_env_t *env;
36 static void ifg_std_free(void *self)
41 static int ifg_std_connected(const void *self, const ir_node *a, const ir_node *b)
43 return values_interfere(a, b);
46 typedef struct _nodes_iter_t {
47 const be_chordal_env_t *env;
54 static void nodes_walker(ir_node *bl, void *data)
56 nodes_iter_t *it = data;
57 struct list_head *head = get_block_border_head(it->env, bl);
61 foreach_border_head(head, b) {
62 if(b->is_def && b->is_real) {
63 obstack_ptr_grow(&it->obst, b->irn);
69 static void find_nodes(const void *self, void *iter) {
70 const ifg_std_t *ifg = self;
71 nodes_iter_t *it = iter;
73 obstack_init(&it->obst);
77 irg_block_walk_graph(ifg->env->irg, nodes_walker, NULL, iter);
78 it->nodes = obstack_finish(&it->obst);
81 static INLINE void node_break(nodes_iter_t *it, int force)
83 if((it->curr >= it->n || force) && it->nodes) {
84 obstack_free(&it->obst, NULL);
89 static ir_node *get_next_node(void *iter)
91 nodes_iter_t *it = iter;
95 res = it->nodes[it->curr++];
102 static ir_node *ifg_std_nodes_begin(const void *self, void *iter)
104 find_nodes(self, iter);
105 return get_next_node(iter);
108 static ir_node *ifg_std_nodes_next(const void *self, void *iter)
110 return get_next_node(iter);
113 static void ifg_std_nodes_end(const void *self, void *iter)
118 typedef struct _adj_iter_t {
119 const be_chordal_env_t *env;
124 unsigned build_list : 1;
127 ir_node **neighbours;
130 static void find_neighbour_walker(ir_node *block, void *data)
132 adj_iter_t *it = data;
133 unsigned visited = it->visited_nr;
134 struct list_head *head = get_block_border_head(it->env, block);
139 foreach_border_head(head, b) {
140 ir_node *irn = b->irn;
143 has_started = b->is_def;
146 * If the def/use of the node is inside the live range
147 * of the node in question, they interfere.
148 * To avoid that a node is added twice, we record the
149 * visit in the visited number provided by core firm.
151 else if(has_started && get_irn_visited(irn) < visited) {
153 obstack_ptr_grow(&it->obst, irn);
155 set_irn_visited(irn, visited);
161 static void find_neighbours(const ifg_std_t *ifg, adj_iter_t *it, const ir_node *irn, int build_list)
164 obstack_init(&it->obst);
169 it->visited_nr = get_irg_visited(ifg->env->irg) + 1;
170 it->build_list = build_list;
171 it->neighbours = NULL;
174 set_irg_visited(ifg->env->irg, it->visited_nr);
175 dom_tree_walk(get_nodes_block(irn), find_neighbour_walker, NULL, it);
178 it->neighbours = obstack_finish(&it->obst);
181 static INLINE void neighbours_break(adj_iter_t *it, int force)
183 if((it->curr >= it->degree || force) && it->neighbours) {
184 obstack_free(&it->obst, NULL);
185 it->neighbours = NULL;
189 static ir_node *get_next_neighbour(adj_iter_t *it) {
192 if(it->curr < it->degree)
193 res = it->neighbours[it->curr++];
195 neighbours_break(it, 0);
200 static ir_node *ifg_std_neighbours_begin(const void *self, void *iter, const ir_node *irn)
202 find_neighbours(self, iter, irn, 1);
203 return get_next_neighbour(iter);
206 static ir_node *ifg_std_neighbours_next(const void *self, void *iter)
208 return get_next_neighbour(iter);
211 static void ifg_std_neighbours_end(const void *self, void *iter)
213 neighbours_break(iter, 1);
216 static int ifg_std_degree(const void *self, const ir_node *irn)
219 find_neighbours(self, &it, irn, 0);
223 static const be_ifg_impl_t ifg_std_impl = {
224 sizeof(nodes_iter_t),
229 ifg_std_neighbours_begin,
230 ifg_std_neighbours_next,
231 ifg_std_neighbours_break,
238 be_ifg_t *be_ifg_std_new(const be_chordal_env_t *env)
240 ifg_std_t *ifg = malloc(sizeof(*ifg));
242 ifg->impl = &ifg_std_impl;
245 return (be_ifg_t *) ifg;