2 * @file beifg_pointer.c
4 * @author Sebastian Hack
6 * Copyright (C) 2005 Universitaet Karlsruhe
7 * Released under the GPL
19 #include "irphase_t.h"
22 #include "irgraph_t.h"
29 #include "bechordal_t.h"
31 typedef struct _ptr_element_t ptr_element_t;
33 typedef union element_content {
35 ptr_element_t *element;
38 struct _ptr_element_t {
39 int kind; /* kind = 8888 ..> both are ir_nodes, = 3101 ..> first is another element, second an ir_node */
40 element_content content_first; /* could be a ptr_element or ir_node */
41 element_content content_second; /* could be a ptr_element or ir_node */
44 typedef struct _ptr_head_t {
45 struct list_head list;
46 ptr_element_t *element;
49 typedef struct _ifg_pointer_t {
50 const be_ifg_impl_t *impl;
51 const be_chordal_env_t *env;
54 ptr_head_t *curr_ptr_head;
55 ptr_element_t *curr_element;
59 typedef struct _ptr_iter_t {
60 const ifg_pointer_t *ifg;
62 ptr_head_t *curr_ptr_head;
63 ptr_head_t *first_head;
64 ptr_element_t *curr_element_t;
68 bitset_t *visited_neighbours;
71 /* PRIVATE FUNCTIONS */
73 static void *ptr_irn_data_init(phase_t *ph, const ir_node *irn, void *data)
75 ptr_head_t *head = phase_alloc(ph, sizeof(*head));
76 INIT_LIST_HEAD(&head->list);
80 static ptr_element_t *ptr_get_new_element(ifg_pointer_t *ifg)
82 ptr_element_t *new_element = obstack_alloc(&ifg->obst, sizeof(ptr_element_t));
83 memset(new_element, 0, sizeof(*new_element));
87 static ptr_head_t *ptr_get_new_head(ifg_pointer_t *ifg)
89 ptr_head_t *new_element = obstack_alloc(&ifg->obst, sizeof(*new_element));
90 INIT_LIST_HEAD(&new_element->list);
94 static void write_pointers(bitset_t *live, ifg_pointer_t *ifg)
99 bitset_foreach_irn(ifg->env->irg, live, elm, live_irn)
101 ptr_head_t *head = phase_get_or_set_irn_data(&ifg->ph, live_irn);
102 ptr_head_t *element = ptr_get_new_head(ifg);
105 if (live_irn->node_nr == 1883 || live_irn->node_nr == 1858)
108 element->element = ifg->curr_element; /* write current highest sub-clique for each node */
109 list_add(&element->list, &head->list);
111 /* the following code is to find all nodes, it should be replaced by a "keywalker" of irphase */
112 irn = pmap_get(ifg->node_map, live_irn);
114 pmap_insert(ifg->node_map, live_irn, live_irn);
118 static ptr_element_t *get_last_sub_clique(ifg_pointer_t *ifg, bitset_t *live, bitset_t *my_live, ir_node *irn)
120 ptr_element_t *element = ifg->curr_element;
121 ptr_element_t *res = NULL;
123 /* search the last sub-clique before the sub-clique that contains the node irn */
124 if (element && element->kind == 8888
125 && (element->content_first.irn == irn
126 || element->content_second.irn == irn)) /* contains the node we search and there is no other sub-clique before */
128 if (bitset_is_set(live, get_irn_idx(element->content_first.irn)) && element->content_first.irn != irn) /* irn is still alive and not the node we search a sub-clique for */
130 bitset_set(my_live, get_irn_idx(element->content_first.irn));
133 if (bitset_is_set(live, get_irn_idx(element->content_second.irn))&& element->content_second.irn != irn) /* irn is still alive and not the node we search a sub-clique for */
135 bitset_set(my_live, get_irn_idx(element->content_second.irn));
141 if (element && element->kind == 8889)
142 { /* this was a "single-node-clique" */
146 if (element && (element->kind == 3101)
147 && (element->content_second.irn == irn)) /* sub-clique contains node, return previous sub-clique */
149 res = element->content_first.element;
153 if (element && element->kind == 3101) /* look at previous sub-cliques if the contain the node you are searching for*/
155 if (bitset_is_set(live, get_irn_idx(element->content_second.irn))) /* irn is still alive */
157 bitset_set(my_live, get_irn_idx(element->content_second.irn));
159 ifg->curr_element = element->content_first.element;
160 res = get_last_sub_clique(ifg, live, my_live, irn);
171 static void find_neighbour_walker(ir_node *bl, void *data)
173 ifg_pointer_t *ifg = data;
174 struct list_head *head = get_block_border_head(ifg->env, bl);
176 bitset_t *live = bitset_malloc(get_irg_last_idx(ifg->env->irg));
180 element_content last_irn;
181 element_content last_element;
183 ir_node *first = NULL;
187 last_element.element = NULL;
189 assert(is_Block(bl) && "There is no block to work on.");
191 foreach_border_head(head, b) /* follow the borders of the block */
193 ir_node *irn = b->irn;
194 ptr_element_t *element = NULL;
197 if (irn->node_nr == 1883 || irn->node_nr == 1858)
200 if (b->is_def) /* b is a new node */
202 bitset_set(live, get_irn_idx(irn));
203 if (last_element.element)
205 element = ptr_get_new_element(ifg);
206 element->content_first.element = last_element.element;
207 element->content_second.irn = b->irn;
208 element->kind = 3101; /* first is an element, second an ir_node */
210 last_element.element = element;
211 ifg->curr_element = element;
215 if (last_irn.irn) /* create new sub-clique */
217 element = ptr_get_new_element(ifg);
218 element->content_first.irn = last_irn.irn;
219 element->content_second.irn = b->irn;
220 element->kind = 8888; /* both are ir_nodes */
222 if (irn->node_nr == 1883 || irn->node_nr == 1858 || irn->node_nr == 1936)
226 last_element.element = element;
227 ifg->curr_element = element;
232 last_irn.irn = b->irn; /* needed to create first sub-clique */
233 last_element.element = NULL;
241 if (was_def == 1) /* if there is a USE after a DEF... */
243 if (!last_element.element)
244 { /* there was only one element in the clique */
245 element = ptr_get_new_element(ifg);
246 element->kind = 8889; /* first is a node, second is NULL, because this is a "single-node-clique" */
247 element->content_first.irn = last_irn.irn;
250 ifg->curr_element = NULL;
254 write_pointers(live, ifg); /* ...write a pointer to the highest sub-clique for each living node. */
258 my_live = bitset_malloc(get_irg_last_idx(ifg->env->irg));
259 last_element.element = get_last_sub_clique(ifg, live, my_live, irn);
261 /* check and add still living nodes */
262 //bitset_remv_irn(my_live, irn);
263 if (bitset_popcnt(my_live) > 1)
265 if (last_element.element)
267 bitset_foreach_irn(ifg->env->irg, my_live, my_elm, my_irn)
269 ptr_element_t *my_element = ptr_get_new_element(ifg);
270 my_element->content_first.element = last_element.element;
271 my_element->content_second.irn = my_irn;
272 my_element->kind = 3101; /* first is an element, second an ir_node */
274 last_element.element = my_element;
275 ifg->curr_element = my_element;
280 bitset_foreach_irn(ifg->env->irg, my_live, my_elm, my_irn)
282 ptr_element_t *my_element = NULL;
283 if (!first && !was_first)
290 if (first && was_first)
292 my_element = ptr_get_new_element(ifg);
293 my_element->content_first.irn = first;
294 my_element->content_second.irn = my_irn;
295 my_element->kind = 8888; /* both are ir_nodes */
296 last_element.element = my_element;
297 ifg->curr_element = my_element;
299 if (my_irn->node_nr == 1883 || my_irn->node_nr == 1858 || my_irn->node_nr == 1936)
307 my_element = ptr_get_new_element(ifg);
308 my_element->content_first.element = last_element.element;
309 my_element->content_second.irn = my_irn;
310 my_element->kind = 3101; /* first is an element, second an ir_node */
311 last_element.element = my_element;
312 ifg->curr_element = my_element;
321 if (bitset_popcnt(my_live) == 1) /* there is only one node left */
323 if (last_element.element)
325 bitset_foreach_irn(ifg->env->irg, my_live, my_elm, my_irn)
327 ptr_element_t *my_element = ptr_get_new_element(ifg);
328 my_element->content_first.element = last_element.element;
329 my_element->content_second.irn = my_irn;
330 my_element->kind = 3101; /* first is an element, second an ir_node */
332 last_element.element = my_element;
333 ifg->curr_element = my_element;
338 bitset_foreach_irn(ifg->env->irg, my_live, my_elm, my_irn);
340 ptr_element_t *my_element = ptr_get_new_element(ifg);
341 my_element->content_first.irn = my_irn;
342 my_element->content_second.irn = NULL;
343 my_element->kind = 8889;
344 last_element.element = my_element;
345 ifg->curr_element = my_element;
350 bitset_free(my_live);
351 bitset_remv_irn(live, irn);
357 static ir_node *get_first_irn(const ifg_pointer_t *ifg, ptr_iter_t *it)
359 /* this should be replaced using a keywalker of the irphase &ifg.ph */
364 entry = pmap_first(ifg->node_map);
375 static ir_node *get_next_irn(ptr_iter_t *it)
377 /* this should be replaced using a keywalker of the irphase &ifg.ph */
382 entry = pmap_next(it->ifg->node_map);
387 it->curr_irn = entry->value;
392 static ir_node *get_next_neighbour(ptr_iter_t *it)
396 ptr_element_t *element;
399 element = it->curr_element_t;
403 if (it->irn->node_nr == 1883 || it->irn->node_nr == 1858)
406 if (it->curr_ptr_head->list.next != &it->first_head->list)
408 head = list_entry(it->curr_ptr_head->list.next, ptr_head_t, list);
409 it->curr_ptr_head = head;
410 element = head->element;
413 return NULL; /* there are no more neighbours */
416 if (element && element->kind == 8889) /* node has no neighbours */
418 res = element->content_first.irn;
419 it->curr_element_t = NULL;
423 if (element && element->kind == 8888) /* node has only one more neighbour */
427 if (element->content_first.irn != it->irn)
429 res = element->content_first.irn;
431 it->curr_element_t = NULL;
436 it->curr_element_t = NULL;
438 res = get_next_neighbour(it);
444 if (element->content_second.irn != it->irn)
446 res = element->content_second.irn;
448 it->curr_element_t = element;
453 it->curr_element_t = element;
455 res = get_next_neighbour(it);
462 if (element && element->kind == 3101)
464 it->curr_element_t = element->content_first.element;
465 res = element->content_second.irn;
468 { /* element is only an ir_node */// TODO
469 it->curr_element_t = NULL;
475 if (res && !it->sub_call)
477 if (bitset_contains_irn(it->visited_neighbours, res) || res == it->irn)
479 res = get_next_neighbour(it);
483 bitset_set(it->visited_neighbours, get_irn_idx(res));
490 static ir_node *get_first_neighbour(const ifg_pointer_t *ifg, ptr_iter_t *it, const ir_node *irn)
494 ptr_element_t *element;
495 bitset_t *bitsetvisited_neighbours = bitset_malloc(get_irg_last_idx(ifg->env->irg));
502 it->visited_neighbours = bitsetvisited_neighbours;
504 head = phase_get_irn_data(&ifg->ph, irn);
509 it->first_head = head;
510 head = list_entry(it->first_head->list.next, ptr_head_t, list); /* because first element is NULL */
511 it->curr_ptr_head = head;
512 element = head->element;
515 if (element && element->kind == 8889) /* node has no neighbours */
517 res = element->content_first.irn;
518 it->curr_element_t = NULL;
522 if (element && element->kind == 8888) /* node has only one neighbour */
526 if (element->content_first.irn != it->irn)
528 res = element->content_first.irn;
530 it->curr_element_t = NULL;
535 it->curr_element_t = NULL;
537 res = get_next_neighbour(it);
543 if (element->content_second.irn != it->irn)
545 res = element->content_second.irn;
546 it->curr_element_t = element;
552 it->curr_element_t = element;
554 res = get_next_neighbour(it);
560 if (element && element->kind == 3101)
562 it->curr_element_t = element->content_first.element;
563 res = element->content_second.irn;
566 { /* element is only an ir_node */
567 it->curr_element_t = NULL;
572 if (res && !it->sub_call)
574 if (bitset_contains_irn(it->visited_neighbours, res) || res == it->irn)
576 res = get_next_neighbour(it);
580 bitset_set(it->visited_neighbours, get_irn_idx(res));
589 /* PUBLIC FUNCTIONS */
591 static void ifg_pointer_free(void *self)
593 ifg_pointer_t *ifg = self;
594 obstack_free(&ifg->obst, NULL);
595 phase_free(&ifg->ph);
600 static int ifg_pointer_connected(const ifg_pointer_t *ifg, const ir_node *a, const ir_node *b)
606 irn = get_first_neighbour(ifg, &it, a);
615 irn = get_next_neighbour(&it);
621 static ir_node *ifg_pointer_neighbours_begin(const void *self, void *iter, const ir_node *irn)
623 return get_first_neighbour(self, iter, irn);
626 static ir_node *ifg_pointer_neighbours_next(const void *self, void *iter)
628 return get_next_neighbour(iter);
631 static void ifg_pointer_neighbours_break(const void *self, void *iter)
633 ptr_iter_t *it = iter;
635 bitset_free(it->visited_neighbours);
640 static ir_node *ifg_pointer_nodes_begin(const void *self, void *iter)
642 return get_first_irn(self, iter);
645 static ir_node *ifg_pointer_nodes_next(const void *self, void *iter)
647 return get_next_irn(iter);
650 static void ifg_pointer_nodes_break(const void *self, void *iter)
655 static int ifg_pointer_degree(const void *self, const ir_node *irn)
660 irn = get_first_neighbour(self, &it, irn);
665 irn = get_next_neighbour(&it);
671 static const be_ifg_impl_t ifg_pointer_impl = {
676 ifg_pointer_connected,
677 ifg_pointer_neighbours_begin,
678 ifg_pointer_neighbours_next,
679 ifg_pointer_neighbours_break,
680 ifg_pointer_nodes_begin,
681 ifg_pointer_nodes_next,
682 ifg_pointer_nodes_break,
689 be_ifg_t *be_ifg_pointer_new(const be_chordal_env_t *env)
691 ifg_pointer_t *ifg = xmalloc(sizeof(*ifg));
692 ifg->impl = &ifg_pointer_impl;
695 ifg->node_map = pmap_create(); /* to find all nodes, should be replaced by a "keywalker" of irphase */
697 phase_init(&ifg->ph, "ptr_map", env->irg, PHASE_DEFAULT_GROWTH, ptr_irn_data_init);
698 obstack_init(&ifg->obst);
700 dom_tree_walk_irg(env->irg, find_neighbour_walker, NULL, ifg);
702 obstack_finish(&ifg->obst);
703 return (be_ifg_t *) ifg;