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
22 * @brief Pointer based implementation of chordal interference graphs.
23 * @author Sebastian Hack
35 #include "irphase_t.h"
38 #include "irgraph_t.h"
45 #include "bechordal_t.h"
47 typedef struct _ptr_element_t ptr_element_t;
49 typedef union element_content {
51 ptr_element_t *element;
54 struct _ptr_element_t {
55 int kind; /* kind = 8888 ..> both are ir_nodes, = 3101 ..> first is another element, second an ir_node */
56 element_content content_first; /* could be a ptr_element or ir_node */
57 element_content content_second; /* could be a ptr_element or ir_node */
60 typedef struct _ptr_head_t {
61 struct list_head list;
62 ptr_element_t *element;
65 typedef struct _ifg_pointer_t {
66 const be_ifg_impl_t *impl;
67 const be_chordal_env_t *env;
70 ptr_head_t *curr_ptr_head;
71 ptr_element_t *curr_element;
74 typedef struct _ptr_iter_t {
75 const ifg_pointer_t *ifg;
77 ptr_head_t *curr_ptr_head;
78 ptr_head_t *first_head;
79 ptr_element_t *curr_element_t;
83 bitset_t *visited_neighbours;
86 /* PRIVATE FUNCTIONS */
88 static void *ptr_irn_data_init(ir_phase *ph, ir_node *irn, void *data)
90 ptr_head_t *head = phase_alloc(ph, sizeof(*head));
91 INIT_LIST_HEAD(&head->list);
95 static ptr_element_t *ptr_get_new_element(ifg_pointer_t *ifg)
97 ptr_element_t *new_element = obstack_alloc(&ifg->obst, sizeof(ptr_element_t));
98 memset(new_element, 0, sizeof(*new_element));
102 static ptr_head_t *ptr_get_new_head(ifg_pointer_t *ifg)
104 ptr_head_t *new_element = obstack_alloc(&ifg->obst, sizeof(*new_element));
105 INIT_LIST_HEAD(&new_element->list);
109 static void write_pointers(bitset_t *live, ifg_pointer_t *ifg)
114 bitset_foreach_irn(ifg->env->irg, live, elm, live_irn)
116 ptr_head_t *head = phase_get_or_set_irn_data(&ifg->ph, live_irn);
117 ptr_head_t *element = ptr_get_new_head(ifg);
119 element->element = ifg->curr_element; /* write current highest sub-clique for each node */
120 list_add(&element->list, &head->list);
124 static ptr_element_t *get_last_sub_clique(ifg_pointer_t *ifg, bitset_t *live, bitset_t *my_live, ir_node *irn)
126 ptr_element_t *element = ifg->curr_element;
127 ptr_element_t *res = NULL;
129 /* search the last sub-clique before the sub-clique that contains the node irn */
130 if (element && element->kind == 8888
131 && (element->content_first.irn == irn
132 || element->content_second.irn == irn)) /* contains the node we search and there is no other sub-clique before */
134 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 */
136 bitset_set(my_live, get_irn_idx(element->content_first.irn));
139 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 */
141 bitset_set(my_live, get_irn_idx(element->content_second.irn));
147 if (element && element->kind == 8889)
148 { /* this was a "single-node-clique" */
152 if (element && (element->kind == 3101)
153 && (element->content_second.irn == irn)) /* sub-clique contains node, return previous sub-clique */
155 res = element->content_first.element;
159 if (element && element->kind == 3101) /* look at previous sub-cliques if the contain the node you are searching for*/
161 if (bitset_is_set(live, get_irn_idx(element->content_second.irn))) /* irn is still alive */
163 bitset_set(my_live, get_irn_idx(element->content_second.irn));
165 ifg->curr_element = element->content_first.element;
166 res = get_last_sub_clique(ifg, live, my_live, irn);
177 static void find_neighbour_walker(ir_node *bl, void *data)
179 ifg_pointer_t *ifg = data;
180 struct list_head *head = get_block_border_head(ifg->env, bl);
183 ir_node *first = NULL;
184 bitset_t *live = bitset_malloc(get_irg_last_idx(ifg->env->irg));
189 element_content last_irn;
190 element_content last_element;
193 last_element.element = NULL;
195 assert(is_Block(bl) && "There is no block to work on.");
197 foreach_border_head(head, b) /* follow the borders of the block */
199 ir_node *irn = b->irn;
200 ptr_element_t *element = NULL;
202 if (b->is_def) /* b is a new node */
204 bitset_set(live, get_irn_idx(irn));
205 if (last_element.element)
207 element = ptr_get_new_element(ifg);
208 element->content_first.element = last_element.element;
209 element->content_second.irn = b->irn;
210 element->kind = 3101; /* first is an element, second an ir_node */
212 last_element.element = element;
213 ifg->curr_element = element;
217 if (last_irn.irn) /* create new sub-clique */
219 element = ptr_get_new_element(ifg);
220 element->content_first.irn = last_irn.irn;
221 element->content_second.irn = b->irn;
222 element->kind = 8888; /* both are ir_nodes */
224 last_element.element = element;
225 ifg->curr_element = element;
230 last_irn.irn = b->irn; /* needed to create first sub-clique */
231 last_element.element = NULL;
239 if (was_def == 1) /* if there is a USE after a DEF... */
241 if (!last_element.element)
242 { /* there was only one element in the clique */
243 element = ptr_get_new_element(ifg);
244 element->kind = 8889; /* first is a node, second is NULL, because this is a "single-node-clique" */
245 element->content_first.irn = last_irn.irn;
248 ifg->curr_element = NULL;
252 write_pointers(live, ifg); /* ...write a pointer to the highest sub-clique for each living node. */
256 my_live = bitset_malloc(get_irg_last_idx(ifg->env->irg));
257 last_element.element = get_last_sub_clique(ifg, live, my_live, irn);
259 /* check and add still living nodes */
260 if (bitset_popcnt(my_live) > 1)
262 if (last_element.element)
264 bitset_foreach_irn(ifg->env->irg, my_live, my_elm, my_irn)
266 ptr_element_t *my_element = ptr_get_new_element(ifg);
267 my_element->content_first.element = last_element.element;
268 my_element->content_second.irn = my_irn;
269 my_element->kind = 3101; /* first is an element, second an ir_node */
271 last_element.element = my_element;
272 ifg->curr_element = my_element;
277 bitset_foreach_irn(ifg->env->irg, my_live, my_elm, my_irn)
279 ptr_element_t *my_element = NULL;
280 if (!first && !was_first)
287 if (first && was_first)
289 my_element = ptr_get_new_element(ifg);
290 my_element->content_first.irn = first;
291 my_element->content_second.irn = my_irn;
292 my_element->kind = 8888; /* both are ir_nodes */
293 last_element.element = my_element;
294 ifg->curr_element = my_element;
299 my_element = ptr_get_new_element(ifg);
300 my_element->content_first.element = last_element.element;
301 my_element->content_second.irn = my_irn;
302 my_element->kind = 3101; /* first is an element, second an ir_node */
303 last_element.element = my_element;
304 ifg->curr_element = my_element;
313 if (bitset_popcnt(my_live) == 1) /* there is only one node left */
315 if (last_element.element)
317 bitset_foreach_irn(ifg->env->irg, my_live, my_elm, my_irn)
319 ptr_element_t *my_element = ptr_get_new_element(ifg);
320 my_element->content_first.element = last_element.element;
321 my_element->content_second.irn = my_irn;
322 my_element->kind = 3101; /* first is an element, second an ir_node */
324 last_element.element = my_element;
325 ifg->curr_element = my_element;
330 bitset_foreach_irn(ifg->env->irg, my_live, my_elm, my_irn);
332 ptr_element_t *my_element = ptr_get_new_element(ifg);
333 my_element->content_first.irn = my_irn;
334 my_element->content_second.irn = NULL;
335 my_element->kind = 8889;
336 last_element.element = my_element;
337 ifg->curr_element = my_element;
342 bitset_free(my_live);
343 bitset_remv_irn(live, irn);
349 static ir_node *get_first_irn(const ifg_pointer_t *ifg, ptr_iter_t *it)
351 ir_node *irn = phase_get_first_node(&ifg->ph);
361 static ir_node *get_next_irn(ptr_iter_t *it)
363 ir_node *irn = phase_get_next_node(&it->ifg->ph, it->curr_irn);
373 static ir_node *get_next_neighbour(ptr_iter_t *it)
377 ptr_element_t *element;
379 element = it->curr_element_t;
383 if (it->curr_ptr_head->list.next != &it->first_head->list)
385 head = list_entry(it->curr_ptr_head->list.next, ptr_head_t, list);
386 it->curr_ptr_head = head;
387 element = head->element;
390 return NULL; /* there are no more neighbours */
393 if (element && element->kind == 8889) /* node has no neighbours */
395 res = element->content_first.irn;
396 it->curr_element_t = NULL;
400 if (element && element->kind == 8888) /* node has only one more neighbour */
404 if (element->content_first.irn != it->irn)
406 res = element->content_first.irn;
408 it->curr_element_t = NULL;
413 it->curr_element_t = NULL;
415 res = get_next_neighbour(it);
421 if (element->content_second.irn != it->irn)
423 res = element->content_second.irn;
425 it->curr_element_t = element;
430 it->curr_element_t = element;
432 res = get_next_neighbour(it);
439 if (element && element->kind == 3101)
441 it->curr_element_t = element->content_first.element;
442 res = element->content_second.irn;
445 { /* element is only an ir_node */// TODO
446 it->curr_element_t = NULL;
452 if (res && !it->sub_call)
454 if (bitset_contains_irn(it->visited_neighbours, res) || res == it->irn)
456 res = get_next_neighbour(it);
460 bitset_set(it->visited_neighbours, get_irn_idx(res));
467 static ir_node *get_first_neighbour(const ifg_pointer_t *ifg, ptr_iter_t *it, const ir_node *irn)
471 ptr_element_t *element;
472 bitset_t *bitsetvisited_neighbours = bitset_malloc(get_irg_last_idx(ifg->env->irg));
479 it->visited_neighbours = bitsetvisited_neighbours;
481 head = phase_get_irn_data(&ifg->ph, irn);
486 it->first_head = head;
487 head = list_entry(it->first_head->list.next, ptr_head_t, list); /* because first element is NULL */
488 it->curr_ptr_head = head;
489 element = head->element;
492 if (element && element->kind == 8889) /* node has no neighbours */
494 res = element->content_first.irn;
495 it->curr_element_t = NULL;
499 if (element && element->kind == 8888) /* node has only one neighbour */
503 if (element->content_first.irn != it->irn)
505 res = element->content_first.irn;
507 it->curr_element_t = NULL;
512 it->curr_element_t = NULL;
514 res = get_next_neighbour(it);
520 if (element->content_second.irn != it->irn)
522 res = element->content_second.irn;
523 it->curr_element_t = element;
529 it->curr_element_t = element;
531 res = get_next_neighbour(it);
537 if (element && element->kind == 3101)
539 it->curr_element_t = element->content_first.element;
540 res = element->content_second.irn;
543 { /* element is only an ir_node */
544 it->curr_element_t = NULL;
549 if (res && !it->sub_call)
551 if (bitset_contains_irn(it->visited_neighbours, res) || res == it->irn)
553 res = get_next_neighbour(it);
557 bitset_set(it->visited_neighbours, get_irn_idx(res));
566 /* PUBLIC FUNCTIONS */
568 static void ifg_pointer_free(void *self)
570 ifg_pointer_t *ifg = self;
571 obstack_free(&ifg->obst, NULL);
572 phase_free(&ifg->ph);
577 static int ifg_pointer_connected(const void *self, const ir_node *a, const ir_node *b)
579 const ifg_pointer_t *ifg = self;
584 irn = get_first_neighbour(ifg, &it, a);
593 irn = get_next_neighbour(&it);
599 static ir_node *ifg_pointer_neighbours_begin(const void *self, void *iter, const ir_node *irn)
601 return get_first_neighbour(self, iter, irn);
604 static ir_node *ifg_pointer_neighbours_next(const void *self, void *iter)
606 return get_next_neighbour(iter);
609 static void ifg_pointer_neighbours_break(const void *self, void *iter)
611 ptr_iter_t *it = iter;
613 bitset_free(it->visited_neighbours);
618 static ir_node *ifg_pointer_nodes_begin(const void *self, void *iter)
620 return get_first_irn(self, iter);
623 static ir_node *ifg_pointer_nodes_next(const void *self, void *iter)
625 return get_next_irn(iter);
628 static void ifg_pointer_nodes_break(const void *self, void *iter)
633 static int ifg_pointer_degree(const void *self, const ir_node *irn)
638 irn = get_first_neighbour(self, &it, irn);
643 irn = get_next_neighbour(&it);
649 static const be_ifg_impl_t ifg_pointer_impl = {
654 ifg_pointer_connected,
655 ifg_pointer_neighbours_begin,
656 ifg_pointer_neighbours_next,
657 ifg_pointer_neighbours_break,
658 ifg_pointer_nodes_begin,
659 ifg_pointer_nodes_next,
660 ifg_pointer_nodes_break,
667 be_ifg_t *be_ifg_pointer_new(const be_chordal_env_t *env)
669 ifg_pointer_t *ifg = xmalloc(sizeof(*ifg));
670 ifg->impl = &ifg_pointer_impl;
673 phase_init(&ifg->ph, "ptr_map", env->irg, PHASE_DEFAULT_GROWTH, ptr_irn_data_init, NULL);
674 obstack_init(&ifg->obst);
676 dom_tree_walk_irg(env->irg, find_neighbour_walker, NULL, ifg);
678 obstack_finish(&ifg->obst);
679 return (be_ifg_t *) ifg;