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 Always available outs.
23 * @author Sebastian Hack, Michael Beck, Andreas Schoesser
27 * This are out-edges (also called def-use edges) that are dynamically
28 * updated as the graph changes.
36 #include "iredgekinds.h"
37 #include "iredges_t.h"
48 * A function that allows for setting an edge.
49 * This abstraction is necessary since different edge kind have
50 * different methods of setting edges.
52 typedef void (set_edge_func_t)(ir_node *src, int pos, ir_node *tgt);
54 typedef int (get_edge_src_arity_func_t)(const ir_node *src);
56 typedef int (get_edge_src_first_func_t)(const ir_node *src);
58 typedef ir_node *(get_edge_src_n_func_t)(const ir_node *src, int pos);
61 * Additional data for an edge kind.
65 set_edge_func_t *set_edge;
66 get_edge_src_first_func_t *get_first;
67 get_edge_src_arity_func_t *get_arity;
68 get_edge_src_n_func_t *get_n;
69 } ir_edge_kind_info_t;
71 static int get_zero(const ir_node *irn)
77 static int get_irn_first(const ir_node *irn)
79 return 0 - !is_Block(irn);
82 static ir_node *get_block_n(const ir_node *irn, int pos)
84 return is_Block(irn) ? get_Block_cfgpred_block((ir_node *) irn, pos) : 0;
87 static const ir_edge_kind_info_t edge_kind_info[EDGE_KIND_LAST] = {
88 { "normal" , set_irn_n, get_irn_first, get_irn_arity, get_irn_n },
89 { "block succs", NULL, get_zero, get_irn_arity, get_block_n },
90 { "dependency", set_irn_dep, get_zero, get_irn_deps, get_irn_dep }
93 #define foreach_tgt(irn, i, n, kind) for(i = edge_kind_info[kind].get_first(irn), n = edge_kind_info[kind].get_arity(irn); i < n; ++i)
94 #define get_n(irn, pos, kind) (edge_kind_info[kind].get_n(irn, pos))
95 #define get_kind_str(kind) (edge_kind_info[kind].name)
97 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
100 * This flag is set to 1, if the edges get initialized for an irg.
101 * Then register additional data is forbidden.
103 static int edges_used = 0;
106 * Summed size of all users private data
109 static int edges_private_size = 0;
110 #define EDGE_SIZE (sizeof(ir_edge_t) + edges_private_size)
113 * If set to 1, the list heads are checked every time an edge is changed.
115 static int edges_dbg = 0;
118 /* a static variable holding the last number assigned to a new edge */
119 static long last_edge_num = -1;
122 static INLINE long edge_get_id(const ir_edge_t *e) {
125 #else /* DEBUG_libfirm */
127 #endif /* DEBUG_libfirm */
131 * Announce to reserve extra space for each edge to be allocated.
132 * @Param n: Size of the space to reserve
133 * @ Returns: Offset at which the private data will begin
134 * Several users can reserve extra space for private usage.
135 * Each user has to remember his given offset and the size of his private data.
136 * To be called before FIRM is initialized.
138 int edges_register_private_data(size_t n)
140 int res = edges_private_size;
142 assert(!edges_used && "you cannot register private edge data, if edges have been initialized");
144 edges_private_size += n;
149 * Reset the user's private data at offset 'offset'
150 * The user has to remember his offset and the size of his data!
151 * Caution: Using wrong values here can destroy other users private data!
154 void edges_reset_private_data(ir_graph *irg, int offset, size_t size)
156 irg_edge_info_t *info = _get_irg_edge_info(irg, EDGE_KIND_NORMAL);
159 foreach_set(info->edges, edge)
161 memset(edge + sizeof(*edge) + offset, 0, size);
165 #define TIMES37(x) (((x) << 5) + ((x) << 2) + (x))
167 #define get_irn_out_list_head(irn) (&get_irn_out_info(irn)->outs)
169 static int edge_cmp(const void *p1, const void *p2, size_t len)
171 const ir_edge_t *e1 = p1;
172 const ir_edge_t *e2 = p2;
175 if(e1->src != e2->src)
177 if(e1->pos != e1->pos)
183 #define edge_hash(edge) (TIMES37((edge)->pos) + HASH_PTR((edge)->src))
186 * Initialize the out information for a graph.
187 * @note Dead node elimination can call this on an already initialized graph.
189 void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind)
191 if(edges_activated_kind(irg, kind)) {
192 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
197 amount = set_count(info->edges);
198 del_set(info->edges);
200 info->edges = new_set(edge_cmp, amount);
205 * Get the edge object of an outgoing edge at a node.
206 * @param irg The graph, the node is in.
207 * @param src The node at which the edge originates.
208 * @param pos The position of the edge.
209 * @return The corresponding edge object or NULL,
210 * if no such edge exists.
212 const ir_edge_t *get_irn_edge_kind(ir_graph *irg, const ir_node *src, int pos, ir_edge_kind_t kind)
214 if (edges_activated_kind(irg, kind)) {
215 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
218 key.src = (ir_node *)src;
220 return set_find(info->edges, &key, EDGE_SIZE, edge_hash(&key));
227 * Get the edge object of an outgoing edge at a node.
228 * Looks for an edge for all kinds.
231 const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos)
233 const ir_edge_t *edge;
234 if((edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_NORMAL)) == NULL)
235 edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_BLOCK);
240 * Change the out count
242 * @param tgt the edge target
243 * @param kind the kind of the edge
245 static INLINE void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs) {
246 irn_edge_info_t *info = _get_irn_edge_info(tgt, kind);
247 info->out_count += ofs;
250 assert(info->out_count >= 0);
251 if (info->out_count == 0 && kind == EDGE_KIND_NORMAL) {
252 /* tgt lost it's last user */
255 for (i = get_irn_arity(tgt) - 1; i >= -1; --i) {
256 ir_node *prev = get_irn_n(tgt, i);
258 edges_notify_edge(tgt, i, NULL, prev, current_ir_graph);
260 for (i = get_irn_deps(tgt) - 1; i >= 0; --i) {
261 ir_node *prev = get_irn_dep(tgt, i);
263 edges_notify_edge_kind(tgt, i, NULL, prev, EDGE_KIND_DEP, current_ir_graph);
271 * Verify the edge list of a node, ie. ensure it's a loop:
272 * head -> e_1 -> ... -> e_n -> head
274 static INLINE void vrfy_list_head(ir_node *irn, ir_edge_kind_t kind) {
277 pset *lh_set = pset_new_ptr(16);
278 const struct list_head *head = _get_irn_outs_head(irn, kind);
279 const struct list_head *pos;
281 list_for_each(pos, head) {
282 if (pset_find_ptr(lh_set, pos)) {
283 const ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
285 ir_fprintf(stderr, "EDGE Verifier: edge list broken (self loop not to head) for %+F:\n", irn);
286 fprintf(stderr, "- at list entry %d\n", num);
288 fprintf(stderr, "- edge(%ld) is invalid\n", edge_get_id(edge));
290 ir_fprintf(stderr, "- edge(%ld) %+F(%d)\n", edge_get_id(edge), edge->src, edge->pos);
295 pset_insert_ptr(lh_set, pos);
303 /* The edge from (src, pos) -> old_tgt is redirected to tgt */
304 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
305 ir_node *old_tgt, ir_edge_kind_t kind,
308 const char *msg = "";
309 irg_edge_info_t *info;
314 assert(edges_activated_kind(irg, kind));
317 * Only do something, if the old and new target differ.
322 info = _get_irg_edge_info(irg, kind);
324 templ = alloca(EDGE_SIZE);
326 /* Initialize the edge template to search in the set. */
327 memset(templ, 0, EDGE_SIZE);
333 DEBUG_ONLY(templ->src_nr = get_irn_node_nr(src));
336 * If the target is NULL, the edge shall be deleted.
339 /* search the edge in the set. */
340 edge = set_find(edges, templ, EDGE_SIZE, edge_hash(templ));
342 /* mark the edge invalid if it was found */
345 list_del(&edge->list);
351 #endif /* DEBUG_libfirm */
352 edge_change_cnt(old_tgt, kind, -1);
355 /* If the edge was not found issue a warning on the debug stream */
357 msg = "edge to delete not found!\n";
362 * The target is not NULL and the old target differs
363 * from the new target, the edge shall be moved (if the
364 * old target was != NULL) or added (if the old target was
368 struct list_head *head = _get_irn_outs_head(tgt, kind);
370 assert(head->next && head->prev &&
371 "target list head must have been initialized");
373 /* If the old target is not null, the edge is moved. */
375 edge = set_find(edges, templ, EDGE_SIZE, edge_hash(templ));
376 assert(edge && "edge to redirect not found!");
377 assert(! edge->invalid && "Invalid edge encountered");
381 list_move(&edge->list, head);
382 edge_change_cnt(old_tgt, kind, -1);
385 /* The old target was null, thus, the edge is newly created. */
387 edge = set_insert(edges, templ, EDGE_SIZE, edge_hash(templ));
389 assert(! edge->invalid && "Freshly inserted edge is invalid?!?");
390 assert(edge->list.next == NULL && edge->list.prev == NULL &&
391 "New edge must not have list head initialized");
394 list_add(&edge->list, head);
396 edge->edge_nr = ++last_edge_num;
397 #endif /* DEBUG_libfirm */
400 edge_change_cnt(tgt, kind, +1);
403 #ifndef DEBUG_libfirm
404 /* verify list heads */
407 vrfy_list_head(tgt, kind);
409 vrfy_list_head(old_tgt, kind);
413 DBG((dbg, LEVEL_5, "announce out edge: %+F %d-> %+F(%+F): %s\n", src, pos, tgt, old_tgt, msg));
416 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_graph *irg)
418 if(edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
419 edges_notify_edge_kind(src, pos, tgt, old_tgt, EDGE_KIND_NORMAL, irg);
422 if (edges_activated_kind(irg, EDGE_KIND_BLOCK) && is_Block(src)) {
423 /* do not use get_nodes_block() here, it fails when running unpinned */
424 ir_node *bl_old = old_tgt ? get_irn_n(skip_Proj(old_tgt), -1) : NULL;
425 ir_node *bl_tgt = NULL;
428 bl_tgt = is_Bad(tgt) ? tgt : get_irn_n(skip_Proj(tgt), -1);
430 edges_notify_edge_kind(src, pos, bl_tgt, bl_old, EDGE_KIND_BLOCK, irg);
435 * Delete all in edges of a given kind from the node old.
437 * @param old the node
438 * @param kind the kind of edges to remove
439 * @param irg the irg of the old node
441 static void edges_node_deleted_kind(ir_node *old, ir_edge_kind_t kind, ir_graph *irg)
445 if(!edges_activated_kind(irg, kind))
448 DBG((dbg, LEVEL_5, "node deleted (kind: %s): %+F\n", get_kind_str(kind), old));
450 foreach_tgt(old, i, n, kind) {
451 ir_node *old_tgt = get_n(old, i, kind);
452 edges_notify_edge_kind(old, i, NULL, old_tgt, kind, irg);
456 struct build_walker {
460 unsigned problem_found;
464 * Post-Walker: notify all edges
466 static void build_edges_walker(ir_node *irn, void *data) {
467 struct build_walker *w = data;
470 if (! edges_activated_kind(w->irg, w->kind))
473 foreach_tgt(irn, i, n, w->kind)
474 edges_notify_edge_kind(irn, i, get_n(irn, i, w->kind), NULL, w->kind, w->irg);
478 * Pre-Walker: initializes the list-heads and set the out-count
481 static void init_lh_walker(ir_node *irn, void *data) {
482 struct build_walker *w = data;
483 INIT_LIST_HEAD(_get_irn_outs_head(irn, w->kind));
484 _get_irn_edge_info(irn, w->kind)->out_count = 0;
488 * Visitor: initializes the list-heads and set the out-count
489 * of all nodes to 0 of nodes that are not seen so far.
491 static void visitor(ir_node *irn, void *data) {
492 if (irn_not_visited(irn)) {
493 mark_irn_visited(irn);
494 init_lh_walker(irn, data);
499 * Build the initial edge set.
500 * Beware, this is not a simple task because it suffers from two
502 * - the anchor set allows access to Nodes that may not be reachable from
504 * - the identities add nodes to the "root set" that are not yet reachable
505 * from End. However, after some transformations, the CSE may revival these
508 * These problems can be fixed using different strategies:
509 * - Add an age flag to every node. Whenever the edge of a node is older
510 * then the current edge, invalidate the edges of this node.
511 * While this would help for revivaled nodes, it increases memory and runtime.
512 * - Delete the identities set.
513 * Solves the revival problem, but may increase the memory consumption, as
514 * nodes cannot be revivaled at all.
515 * - Manually iterate over the identities root set. This did not consume more memory
516 * but increase the computation time because the |identities| >= |V|
518 * Currently, we use the last option.
520 void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind)
522 struct build_walker w;
523 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
529 edges_init_graph_kind(irg, kind);
530 irg_walk_anchors(irg, init_lh_walker, build_edges_walker, &w);
531 visit_all_identities(irg, visitor, &w);
534 void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind)
536 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
540 del_set(info->edges);
545 int (edges_activated_kind)(const ir_graph *irg, ir_edge_kind_t kind)
547 return _edges_activated_kind(irg, kind);
552 * Reroute all use-edges from a node to another.
553 * @param from The node whose use-edges shall be withdrawn.
554 * @param to The node to which all the use-edges of @p from shall be
556 * @param irg The graph.
558 void edges_reroute_kind(ir_node *from, ir_node *to, ir_edge_kind_t kind, ir_graph *irg)
560 set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
562 if(set_edge && edges_activated_kind(irg, kind)) {
563 struct list_head *head = _get_irn_outs_head(from, kind);
565 DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
567 while(head != head->next) {
568 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
569 assert(edge->pos >= -1);
570 set_edge(edge->src, edge->pos, to);
575 static void verify_set_presence(ir_node *irn, void *data)
577 struct build_walker *w = data;
578 set *edges = _get_irg_edge_info(w->irg, w->kind)->edges;
581 foreach_tgt(irn, i, n, w->kind) {
587 e = set_find(edges, &templ, EDGE_SIZE, edge_hash(&templ));
591 w->problem_found = 1;
593 ir_fprintf(stderr, "Edge Verifier: edge %+F,%d -> %+F (kind: \"%s\") is missing\n",
594 irn, i, get_n(irn, i, w->kind), get_kind_str(w->kind));
600 static void verify_list_presence(ir_node *irn, void *data)
602 struct build_walker *w = data;
605 bitset_set(w->reachable, get_irn_idx(irn));
607 /* check list heads */
608 vrfy_list_head(irn, w->kind);
610 foreach_out_edge_kind(irn, e, w->kind) {
613 if (w->kind == EDGE_KIND_NORMAL && get_irn_arity(e->src) <= e->pos) {
614 w->problem_found = 1;
616 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F -> %+F recorded at src position %d, but src has arity %d\n",
617 edge_get_id(e), e->src, irn, e->pos, get_irn_arity(e->src));
622 tgt = get_n(e->src, e->pos, w->kind);
625 w->problem_found = 1;
627 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d (kind \"%s\") is no out edge of %+F but of %+F\n",
628 edge_get_id(e), e->src, e->pos, get_kind_str(w->kind), irn, tgt);
634 int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind)
636 struct build_walker w;
637 set *edges = _get_irg_edge_info(irg, kind)->edges;
642 w.reachable = bitset_alloca(get_irg_last_idx(irg));
645 /* Clear the present bit in all edges available. */
646 for (e = set_first(edges); e; e = set_next(edges))
649 irg_walk_graph(irg, verify_set_presence, verify_list_presence, &w);
652 * Dump all edges which are not invalid and not present.
653 * These edges are superfluous and their presence in the
656 for (e = set_first(edges); e; e = set_next(edges)) {
657 if (! e->invalid && ! e->present && bitset_is_set(w.reachable, get_irn_idx(e->src))) {
659 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d is superfluous\n", edge_get_id(e), e->src, e->pos);
663 return w.problem_found;
666 #define IGNORE_NODE(irn) (is_Bad((irn)) || is_Block((irn)))
669 * Clear link field of all nodes.
671 static void clear_links(ir_node *irn, void *env) {
672 struct build_walker *w = env;
675 if (IGNORE_NODE(irn)) {
676 set_irn_link(irn, NULL);
680 bs = bitset_malloc(get_irg_last_idx(w->irg));
681 set_irn_link(irn, bs);
685 * Increases count (stored in link field) for all operands of a node.
687 static void count_user(ir_node *irn, void *env) {
692 first = get_irn_first(irn);
693 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
694 ir_node *op = get_irn_n(irn, i);
695 bitset_t *bs = get_irn_link(op);
698 bitset_set(bs, get_irn_idx(irn));
703 * Verifies if collected count, number of edges in list and stored edge count are in sync.
705 static void verify_edge_counter(ir_node *irn, void *env) {
706 struct build_walker *w = env;
712 const struct list_head *head;
713 const struct list_head *pos;
715 if (IGNORE_NODE(irn))
718 bs = get_irn_link(irn);
721 edge_cnt = _get_irn_edge_info(irn, EDGE_KIND_NORMAL)->out_count;
722 head = _get_irn_outs_head(irn, EDGE_KIND_NORMAL);
724 /* We can iterate safely here, list heads have already been verified. */
725 list_for_each(pos, head) {
729 /* check all nodes that reference us and count edges that point number
730 * of ins that actually point to us */
732 bitset_foreach(bs, idx) {
734 ir_node *src = get_idx_irn(w->irg, idx);
736 arity = get_irn_arity(src);
737 for(i = 0; i < arity; ++i) {
738 ir_node *in = get_irn_n(src, i);
744 if (edge_cnt != list_cnt) {
745 w->problem_found = 1;
746 ir_fprintf(stderr, "Edge Verifier: edge count is %d, but %d edge(s) are recorded in list at %+F\n",
747 edge_cnt, list_cnt, irn);
750 if (ref_cnt != list_cnt) {
751 w->problem_found = 1;
752 ir_fprintf(stderr, "Edge Verifier: %+F reachable by %d node(s), but the list contains %d edge(s)\n",
753 irn, ref_cnt, list_cnt);
755 /* Matze: buggy if a node has multiple ins pointing at irn */
757 list_for_each(pos, head) {
758 ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
759 bitset_flip(bs, get_irn_idx(edge->src));
762 if (ref_cnt < list_cnt)
763 fprintf(stderr," following nodes are recorded in list, but not as user:\n");
765 fprintf(stderr," following nodes are user, but not recorded in list:\n");
768 bitset_foreach(bs, idx) {
769 ir_node *src = get_idx_irn(w->irg, idx);
770 ir_fprintf(stderr, " %+F", src);
772 fprintf(stderr, "\n");
780 * Verifies the out edges of an irg.
782 int edges_verify(ir_graph *irg) {
783 struct build_walker w;
784 int problem_found = 0;
786 /* verify normal edges only */
787 problem_found = edges_verify_kind(irg, EDGE_KIND_NORMAL);
790 w.kind = EDGE_KIND_NORMAL;
794 irg_walk_anchors(irg, clear_links, count_user, &w);
795 irg_walk_anchors(irg, NULL, verify_edge_counter, &w);
797 return problem_found ? 1 : w.problem_found;
800 void init_edges(void)
802 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
803 /* firm_dbg_set_mask(dbg, -1); */
806 void edges_init_dbg(int do_dbg) {
810 void edges_activate(ir_graph *irg)
812 edges_activate_kind(irg, EDGE_KIND_NORMAL);
813 edges_activate_kind(irg, EDGE_KIND_BLOCK);
816 void edges_deactivate(ir_graph *irg)
818 edges_deactivate_kind(irg, EDGE_KIND_NORMAL);
819 edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
822 int edges_assure(ir_graph *irg)
824 int activated = edges_activated(irg);
832 void edges_node_deleted(ir_node *irn, ir_graph *irg)
834 edges_node_deleted_kind(irn, EDGE_KIND_NORMAL, irg);
835 edges_node_deleted_kind(irn, EDGE_KIND_BLOCK, irg);
839 const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind)
841 return _get_irn_out_edge_first_kind(irn, kind);
844 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last)
846 return _get_irn_out_edge_next(irn, last);
849 ir_node *(get_edge_src_irn)(const ir_edge_t *edge)
851 return _get_edge_src_irn(edge);
854 int (get_edge_src_pos)(const ir_edge_t *edge)
856 return _get_edge_src_pos(edge);
859 int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind)
861 return _get_irn_n_edges_kind(irn, kind);
864 void dump_all_out_edges(ir_node *irn)
867 for(i = 0; i < EDGE_KIND_LAST; ++i) {
868 const ir_edge_t *edge;
870 printf("kind \"%s\"\n", get_kind_str(i));
871 foreach_out_edge_kind(irn, edge, i) {
872 ir_printf("\t%+F(%d)\n", edge->src, edge->pos);
877 static void irg_block_edges_walk2(ir_node *bl,
878 irg_walk_func *pre, irg_walk_func *post,
880 const ir_edge_t *edge, *next;
882 if (Block_not_block_visited(bl)) {
883 mark_Block_block_visited(bl);
888 foreach_out_edge_kind_safe(bl, edge, next, EDGE_KIND_BLOCK) {
889 /* find the corresponding successor block. */
890 ir_node *pred = get_edge_src_irn(edge);
891 irg_block_edges_walk2(pred, pre, post, env);
899 /* Walks only over Block nodes in the graph. Has it's own visited
900 flag, so that it can be interleaved with the other walker. */
901 void irg_block_edges_walk(ir_node *node,
902 irg_walk_func *pre, irg_walk_func *post,
905 assert(edges_activated(current_ir_graph));
906 assert(is_Block(node));
908 inc_irg_block_visited(current_ir_graph);
909 irg_block_edges_walk2(node, pre, post, env);