4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
18 #include "irgraph_t.h"
24 #include "bechordal_t.h"
26 #define MAX(x, y) ((x) > (y) ? (x) : (y))
28 typedef struct _ifg_std_t ifg_std_t;
31 const be_ifg_impl_t *impl;
32 const be_chordal_env_t *env;
35 static void ifg_std_free(void *self)
40 static int ifg_std_connected(const void *self, const ir_node *a, const ir_node *b)
42 return values_interfere(a, b);
45 typedef struct _nodes_iter_t {
46 const be_chordal_env_t *env;
53 static void nodes_walker(ir_node *bl, void *data)
55 nodes_iter_t *it = data;
56 struct list_head *head = get_block_border_head(it->env, bl);
60 foreach_border_head(head, b) {
61 if(b->is_def && b->is_real) {
62 obstack_ptr_grow(&it->obst, b->irn);
68 static void find_nodes(const void *self, void *iter) {
69 const ifg_std_t *ifg = self;
70 nodes_iter_t *it = iter;
72 obstack_init(&it->obst);
76 irg_block_walk_graph(ifg->env->irg, nodes_walker, NULL, iter);
77 it->nodes = obstack_finish(&it->obst);
80 static ir_node *get_next_node(void *iter)
82 nodes_iter_t *it = iter;
86 res = it->nodes[it->curr++];
88 if(it->curr >= it-> n && it->nodes) {
89 obstack_free(&it->obst, NULL);
96 static ir_node *ifg_std_nodes_begin(const void *self, void *iter)
98 find_nodes(self, iter);
99 return get_next_node(iter);
102 static ir_node *ifg_std_nodes_next(const void *self, void *iter)
104 return get_next_node(iter);
107 typedef struct _adj_iter_t {
108 const be_chordal_env_t *env;
113 unsigned build_list : 1;
116 ir_node **neighbours;
119 static void find_neighbour_walker(ir_node *block, void *data)
121 adj_iter_t *it = data;
122 unsigned visited = it->visited_nr;
123 struct list_head *head = get_block_border_head(it->env, block);
128 foreach_border_head(head, b) {
129 ir_node *irn = b->irn;
132 has_started = b->is_def;
135 * If the def/use of the node is inside the live range
136 * of the node in question, they interfere.
137 * To avoid that a node is added twice, we record the
138 * visit in the visited number provided by core firm.
140 else if(has_started && get_irn_visited(irn) < visited) {
142 obstack_ptr_grow(&it->obst, irn);
144 set_irn_visited(irn, visited);
150 static void find_neighbours(const ifg_std_t *ifg, adj_iter_t *it, const ir_node *irn, int build_list)
153 obstack_init(&it->obst);
158 it->visited_nr = get_irg_visited(ifg->env->irg) + 1;
159 it->build_list = build_list;
160 it->neighbours = NULL;
163 set_irg_visited(ifg->env->irg, it->visited_nr);
164 dom_tree_walk(get_nodes_block(irn), find_neighbour_walker, NULL, it);
167 it->neighbours = obstack_finish(&it->obst);
170 static ir_node *get_next_neighbour(adj_iter_t *it) {
173 if(it->curr < it->degree)
174 res = it->neighbours[it->curr++];
176 if(it->curr >= it->degree && it->neighbours) {
177 obstack_free(&it->obst, NULL);
178 it->neighbours = NULL;
184 static ir_node *ifg_std_neighbours_begin(const void *self, void *iter, const ir_node *irn)
186 find_neighbours(self, iter, irn, 1);
187 return get_next_neighbour(iter);
190 static ir_node *ifg_std_neighbours_next(const void *self, void *iter)
192 return get_next_neighbour(iter);
195 static int ifg_std_degree(const void *self, const ir_node *irn)
198 find_neighbours(self, &it, irn, 0);
202 static const be_ifg_impl_t ifg_std_impl = {
203 MAX(sizeof(adj_iter_t), sizeof(nodes_iter_t)),
206 ifg_std_neighbours_begin,
207 ifg_std_neighbours_next,
213 be_ifg_t *be_ifg_std_new(const be_chordal_env_t *env)
215 ifg_std_t *ifg = malloc(sizeof(*ifg));
217 ifg->impl = &ifg_std_impl;
220 return (be_ifg_t *) ifg;