4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
15 #include "irgraph_t.h"
21 #include "bechordal_t.h"
23 #define MAX(x, y) ((x) > (y) ? (x) : (y))
25 typedef struct _ifg_std_t ifg_std_t;
28 const be_ifg_impl_t *impl;
29 const be_chordal_env_t *env;
32 static void ifg_std_free(void *self)
37 static int ifg_std_connected(const void *self, const ir_node *a, const ir_node *b)
39 return values_interfere(a, b);
42 typedef struct _nodes_iter_t {
43 const be_chordal_env_t *env;
50 static void nodes_walker(ir_node *bl, void *data)
52 nodes_iter_t *it = data;
53 struct list_head *head = get_block_border_head(it->env, bl);
57 foreach_border_head(head, b) {
58 if(b->is_def && b->is_real) {
59 obstack_ptr_grow(&it->obst, b->irn);
65 static void find_nodes(const void *self, void *iter) {
66 const ifg_std_t *ifg = self;
67 nodes_iter_t *it = iter;
69 obstack_init(&it->obst);
73 irg_block_walk_graph(ifg->env->irg, nodes_walker, NULL, iter);
74 it->nodes = obstack_finish(&it->obst);
77 static ir_node *get_next_node(void *iter)
79 nodes_iter_t *it = iter;
83 res = it->nodes[it->curr++];
85 if(it->curr >= it-> n && it->nodes) {
86 obstack_free(&it->obst, NULL);
93 static ir_node *ifg_std_nodes_begin(const void *self, void *iter)
95 find_nodes(self, iter);
96 return get_next_node(iter);
99 static ir_node *ifg_std_nodes_next(const void *self, void *iter)
101 return get_next_node(iter);
104 typedef struct _adj_iter_t {
105 const be_chordal_env_t *env;
110 unsigned build_list : 1;
113 ir_node **neighbours;
116 static void find_neighbour_walker(ir_node *block, void *data)
118 adj_iter_t *it = data;
119 unsigned visited = it->visited_nr;
120 struct list_head *head = get_block_border_head(it->env, block);
125 foreach_border_head(head, b) {
126 ir_node *irn = b->irn;
129 has_started = b->is_def;
132 * If the def/use of the node is inside the live range
133 * of the node in question, they interfere.
134 * To avoid that a node is added twice, we record the
135 * visit in the visited number provided by core firm.
137 else if(has_started && get_irn_visited(irn) < visited) {
139 obstack_ptr_grow(&it->obst, irn);
141 set_irn_visited(irn, visited);
147 static void find_neighbours(const ifg_std_t *ifg, adj_iter_t *it, const ir_node *irn, int build_list)
150 obstack_init(&it->obst);
155 it->visited_nr = get_irg_visited(ifg->env->irg) + 1;
156 it->build_list = build_list;
157 it->neighbours = NULL;
160 set_irg_visited(ifg->env->irg, it->visited_nr);
161 dom_tree_walk(get_nodes_block(irn), find_neighbour_walker, NULL, it);
164 it->neighbours = obstack_finish(&it->obst);
167 static ir_node *get_next_neighbour(adj_iter_t *it) {
170 if(it->curr < it->degree)
171 res = it->neighbours[it->curr++];
173 if(it->curr >= it->degree && it->neighbours) {
174 obstack_free(&it->obst, NULL);
175 it->neighbours = NULL;
181 static ir_node *ifg_std_neighbours_begin(const void *self, void *iter, const ir_node *irn)
183 find_neighbours(self, iter, irn, 1);
184 return get_next_neighbour(iter);
187 static ir_node *ifg_std_neighbours_next(const void *self, void *iter)
189 return get_next_neighbour(iter);
192 static int ifg_std_degree(const void *self, const ir_node *irn)
195 find_neighbours(self, &it, irn, 0);
199 static const be_ifg_impl_t ifg_std_impl = {
200 MAX(sizeof(adj_iter_t), sizeof(nodes_iter_t)),
203 ifg_std_neighbours_begin,
204 ifg_std_neighbours_next,
210 be_ifg_t *be_ifg_std_new(const be_chordal_env_t *env)
212 ifg_std_t *ifg = malloc(sizeof(*ifg));
214 ifg->impl = &ifg_std_impl;
217 return (be_ifg_t *) ifg;