2 * Copyright (C) 1995-2008 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.
34 #include "iredgekinds.h"
35 #include "iredges_t.h"
45 #include "iredgeset.h"
50 #define HashSet ir_edgeset_t
51 #define HashSetIterator ir_edgeset_iterator_t
52 #define ValueType ir_edge_t*
53 #define NullValue NULL
54 #define DeletedValue ((ir_edge_t*)-1)
55 #define Hash(this,key) (HASH_PTR(key->src) ^ (key->pos * 40013))
56 #define KeysEqual(this,key1,key2) ((key1->src) == (key2->src) && (key1->pos == key2->pos))
57 #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
59 #define hashset_init ir_edgeset_init
60 #define hashset_init_size ir_edgeset_init_size
61 #define hashset_destroy ir_edgeset_destroy
62 #define hashset_insert ir_edgeset_insert
63 #define hashset_remove ir_edgeset_remove
64 #define hashset_find ir_edgeset_find
65 #define hashset_size ir_edgeset_size
66 #define hashset_iterator_init ir_edgeset_iterator_init
67 #define hashset_iterator_next ir_edgeset_iterator_next
68 #define hashset_remove_iterator ir_edgeset_remove_iterator
73 * A function that allows for setting an edge.
74 * This abstraction is necessary since different edge kind have
75 * different methods of setting edges.
77 typedef void (set_edge_func_t)(ir_node *src, int pos, ir_node *tgt);
80 * A function that returns the "arity" of a given edge kind
83 typedef int (get_edge_src_arity_func_t)(const ir_node *src);
86 * A function that returns the pos'th edge of a given edge kind for a node.
88 typedef ir_node *(get_edge_src_n_func_t)(const ir_node *src, int pos);
91 * Additional data for an edge kind.
94 const char *name; /**< name of this edge kind */
95 set_edge_func_t *set_edge; /**< the set_edge function */
96 int first_idx; /**< index of the first possible edge */
97 get_edge_src_arity_func_t *get_arity; /**< the get_arity function */
98 get_edge_src_n_func_t *get_n; /**< the get_n function */
99 } ir_edge_kind_info_t;
102 * Get the predecessor block.
104 static ir_node *get_block_n(const ir_node *block, int pos)
107 return get_Block_cfgpred_block(block, pos);
112 static const ir_edge_kind_info_t edge_kind_info[EDGE_KIND_LAST] = {
113 { "normal" , set_irn_n, -1, get_irn_arity, get_irn_n },
114 { "block succs", NULL, 0, get_irn_arity, get_block_n },
115 { "dependency", set_irn_dep, 0, get_irn_deps, get_irn_dep }
118 #define foreach_tgt(irn, i, n, kind) for (i = edge_kind_info[kind].first_idx, n = edge_kind_info[kind].get_arity(irn); i < n; ++i)
119 #define get_n(irn, pos, kind) (edge_kind_info[kind].get_n(irn, pos))
120 #define get_kind_str(kind) (edge_kind_info[kind].name)
122 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
125 * This flag is set to 1, if the edges get initialized for an irg.
126 * Then register additional data is forbidden.
128 static int edges_used = 0;
131 * Summed size of all users private data
134 static int edges_private_size = 0;
135 #define EDGE_SIZE (sizeof(ir_edge_t) + edges_private_size)
138 * If set to 1, the list heads are checked every time an edge is changed.
140 static int edges_dbg = 0;
143 /* a static variable holding the last number assigned to a new edge */
144 static long last_edge_num = -1;
148 * Returns an ID for the given edge.
150 static inline long edge_get_id(const ir_edge_t *e)
154 #else /* DEBUG_libfirm */
156 #endif /* DEBUG_libfirm */
160 * Announce to reserve extra space for each edge to be allocated.
162 * @param n: Size of the space to reserve
164 * @return Offset at which the private data will begin
166 * Several users can reserve extra space for private usage.
167 * Each user has to remember his given offset and the size of his private data.
168 * To be called before FIRM is initialized.
170 int edges_register_private_data(size_t n)
172 int res = edges_private_size;
174 assert(!edges_used && "you cannot register private edge data, if edges have been initialized");
176 edges_private_size += n;
181 * Reset the user's private data at offset 'offset'
182 * The user has to remember his offset and the size of his data!
183 * Caution: Using wrong values here can destroy other users private data!
185 void edges_reset_private_data(ir_graph *irg, int offset, unsigned size)
187 irg_edge_info_t *info = _get_irg_edge_info(irg, EDGE_KIND_NORMAL);
189 ir_edgeset_iterator_t iter;
191 foreach_ir_edgeset(&info->edges, edge, iter) {
192 memset(edge + sizeof(*edge) + offset, 0, size);
196 #define TIMES37(x) (((x) << 5) + ((x) << 2) + (x))
198 #define get_irn_out_list_head(irn) (&get_irn_out_info(irn)->outs)
200 #define edge_hash(edge) (TIMES37((edge)->pos) + HASH_PTR((edge)->src))
203 * Initialize the out information for a graph.
204 * @note Dead node elimination can call this on an already initialized graph.
206 void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind)
208 if (edges_activated_kind(irg, kind)) {
209 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
210 size_t amount = irg->estimated_node_count * 2;
213 if (info->allocated) {
214 amount = ir_edgeset_size(&info->edges);
215 ir_edgeset_destroy(&info->edges);
216 obstack_free(&info->edges_obst, NULL);
218 obstack_init(&info->edges_obst);
219 INIT_LIST_HEAD(&info->free_edges);
220 ir_edgeset_init_size(&info->edges, amount);
226 * Get the edge object of an outgoing edge at a node.
227 * @param irg The graph, the node is in.
228 * @param src The node at which the edge originates.
229 * @param pos The position of the edge.
230 * @param kind The kind of the edge.
231 * @return The corresponding edge object or NULL,
232 * if no such edge exists.
234 const ir_edge_t *get_irn_edge_kind(ir_graph *irg, const ir_node *src, int pos, ir_edge_kind_t kind)
236 if (edges_activated_kind(irg, kind)) {
237 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
240 key.src = (ir_node *)src;
243 return ir_edgeset_find(&info->edges, &key);
250 * Get the edge object of an outgoing edge at a node.
251 * Looks for an edge for all kinds.
253 const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos)
255 const ir_edge_t *edge;
256 if ((edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_NORMAL)) == NULL)
257 edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_BLOCK);
262 * Change the out count
264 * @param tgt the edge target
265 * @param kind the kind of the edge
267 static inline void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs)
269 irn_edge_info_t *info = _get_irn_edge_info(tgt, kind);
270 info->out_count += ofs;
273 assert(info->out_count >= 0);
274 if (info->out_count == 0 && kind == EDGE_KIND_NORMAL) {
275 /* tgt lost it's last user */
278 for (i = get_irn_arity(tgt) - 1; i >= -1; --i) {
279 ir_node *prev = get_irn_n(tgt, i);
281 edges_notify_edge(tgt, i, NULL, prev, current_ir_graph);
283 for (i = get_irn_deps(tgt) - 1; i >= 0; --i) {
284 ir_node *prev = get_irn_dep(tgt, i);
286 edges_notify_edge_kind(tgt, i, NULL, prev, EDGE_KIND_DEP, current_ir_graph);
294 * Verify the edge list of a node, ie. ensure it's a loop:
295 * head -> e_1 -> ... -> e_n -> head
297 static inline void vrfy_list_head(ir_node *irn, ir_edge_kind_t kind)
301 pset *lh_set = pset_new_ptr(16);
302 const struct list_head *head = _get_irn_outs_head(irn, kind);
303 const struct list_head *pos;
305 list_for_each(pos, head) {
306 if (pset_find_ptr(lh_set, pos)) {
307 const ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
309 ir_fprintf(stderr, "EDGE Verifier: edge list broken (self loop not to head) for %+F:\n", irn);
310 fprintf(stderr, "- at list entry %d\n", num);
312 fprintf(stderr, "- edge(%ld) is invalid\n", edge_get_id(edge));
314 ir_fprintf(stderr, "- edge(%ld) %+F(%d)\n", edge_get_id(edge), edge->src, edge->pos);
319 pset_insert_ptr(lh_set, pos);
329 * Helper function to dump the edge set of a graph,
330 * unused in normal code.
332 void edges_dump_kind(ir_graph *irg, ir_edge_kind_t kind)
334 irg_edge_info_t *info;
336 ir_edgeset_iterator_t iter;
339 if (!edges_activated_kind(irg, kind))
342 info = _get_irg_edge_info(irg, kind);
343 edges = &info->edges;
344 foreach_ir_edgeset(edges, e, iter) {
345 ir_printf("%+F %d %d\n", e->src, e->pos, e->invalid);
350 /* The edge from (src, pos) -> old_tgt is redirected to tgt */
351 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
352 ir_node *old_tgt, ir_edge_kind_t kind,
355 const char *msg = "";
356 irg_edge_info_t *info;
361 assert(edges_activated_kind(irg, kind));
364 * Only do something, if the old and new target differ.
369 info = _get_irg_edge_info(irg, kind);
370 edges = &info->edges;
372 /* Initialize the edge template to search in the set. */
377 * If the target is NULL, the edge shall be deleted.
380 /* search the edge in the set. */
381 edge = ir_edgeset_find(edges, &templ);
383 /* mark the edge invalid if it was found */
386 list_del(&edge->list);
387 ir_edgeset_remove(edges, edge);
388 list_add(&edge->list, &info->free_edges);
394 #endif /* DEBUG_libfirm */
395 edge_change_cnt(old_tgt, kind, -1);
397 /* If the edge was not found issue a warning on the debug stream */
398 msg = "edge to delete not found!\n";
402 * The target is not NULL and the old target differs
403 * from the new target, the edge shall be moved (if the
404 * old target was != NULL) or added (if the old target was
407 struct list_head *head = _get_irn_outs_head(tgt, kind);
409 assert(head->next && head->prev &&
410 "target list head must have been initialized");
412 /* If the old target is not null, the edge is moved. */
414 edge = ir_edgeset_find(edges, &templ);
415 assert(edge && "edge to redirect not found!");
416 assert(! edge->invalid && "Invalid edge encountered");
420 list_move(&edge->list, head);
421 edge_change_cnt(old_tgt, kind, -1);
423 /* The old target was NULL, thus, the edge is newly created. */
427 if (list_empty(&info->free_edges)) {
428 edge = obstack_alloc(&info->edges_obst, EDGE_SIZE);
430 edge = list_entry(info->free_edges.next, ir_edge_t, list);
431 list_del(&edge->list);
439 edge->list.next = NULL;
440 edge->list.prev = NULL;
441 memset(edge + 1, 0, edges_private_size);
442 DEBUG_ONLY(edge->src_nr = get_irn_node_nr(src));
444 new_edge = ir_edgeset_insert(edges, edge);
445 if (new_edge != edge) {
446 panic("new edge exists already");
450 list_add(&edge->list, head);
451 DEBUG_ONLY(edge->edge_nr = ++last_edge_num);
454 edge_change_cnt(tgt, kind, +1);
457 #ifndef DEBUG_libfirm
458 /* verify list heads */
461 vrfy_list_head(tgt, kind);
463 vrfy_list_head(old_tgt, kind);
467 DBG((dbg, LEVEL_5, "announce out edge: %+F %d-> %+F(%+F): %s\n", src, pos, tgt, old_tgt, msg));
470 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_graph *irg)
472 if (edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
473 edges_notify_edge_kind(src, pos, tgt, old_tgt, EDGE_KIND_NORMAL, irg);
476 if (edges_activated_kind(irg, EDGE_KIND_BLOCK) && is_Block(src)) {
478 /* a MacroBlock edge: ignore it here */
480 ir_node *bl_old = old_tgt ? get_nodes_block(skip_Proj(old_tgt)) : NULL;
481 ir_node *bl_tgt = NULL;
484 bl_tgt = is_Bad(tgt) ? tgt : get_nodes_block(skip_Proj(tgt));
486 edges_notify_edge_kind(src, pos, bl_tgt, bl_old, EDGE_KIND_BLOCK, irg);
492 * Delete all in edges of a given kind from the node old.
494 * @param old the node
495 * @param kind the kind of edges to remove
496 * @param irg the irg of the old node
498 static void edges_node_deleted_kind(ir_node *old, ir_edge_kind_t kind, ir_graph *irg)
502 if (!edges_activated_kind(irg, kind))
505 DBG((dbg, LEVEL_5, "node deleted (kind: %s): %+F\n", get_kind_str(kind), old));
507 foreach_tgt(old, i, n, kind) {
508 ir_node *old_tgt = get_n(old, i, kind);
509 edges_notify_edge_kind(old, i, NULL, old_tgt, kind, irg);
514 * A node might be revivaled by CSE. Assure its edges.
516 * @param irn the node
517 * @param kind the kind of edges to remove
518 * @param irg the irg of the old node
520 static void edges_node_revival_kind(ir_node *irn, ir_edge_kind_t kind, ir_graph *irg)
522 irn_edge_info_t *info;
525 if (!edges_activated_kind(irg, kind))
528 info = _get_irn_edge_info(irn, kind);
529 if (info->edges_built)
532 DBG((dbg, LEVEL_5, "node revivaled (kind: %s): %+F\n", get_kind_str(kind), irn));
534 foreach_tgt(irn, i, n, kind) {
535 ir_node *tgt = get_n(irn, i, kind);
536 edges_notify_edge_kind(irn, i, tgt, NULL, kind, irg);
538 info->edges_built = 1;
541 struct build_walker {
545 unsigned problem_found;
549 * Post-Walker: notify all edges
551 static void build_edges_walker(ir_node *irn, void *data)
553 struct build_walker *w = data;
555 ir_edge_kind_t kind = w->kind;
556 ir_graph *irg = w->irg;
557 get_edge_src_n_func_t *get_n;
559 get_n = edge_kind_info[kind].get_n;
560 foreach_tgt(irn, i, n, kind) {
561 ir_node *pred = get_n(irn, i, kind);
562 edges_notify_edge_kind(irn, i, pred, NULL, kind, irg);
564 _get_irn_edge_info(irn, kind)->edges_built = 1;
568 * Pre-Walker: initializes the list-heads and set the out-count
571 static void init_lh_walker(ir_node *irn, void *data)
573 struct build_walker *w = data;
574 ir_edge_kind_t kind = w->kind;
575 list_head *head = _get_irn_outs_head(irn, kind);
576 INIT_LIST_HEAD(head);
577 _get_irn_edge_info(irn, kind)->edges_built = 0;
578 _get_irn_edge_info(irn, kind)->out_count = 0;
582 * Pre-Walker: initializes the list-heads and set the out-count
585 * Additionally touches DEP nodes, as they might be DEAD.
586 * THIS IS UGLY, but I don't find a better way until we
588 * a) ensure that dead nodes are not used as input
589 * b) it might be sufficient to add those stupid NO_REG nodes
592 static void init_lh_walker_dep(ir_node *irn, void *data)
594 struct build_walker *w = data;
595 ir_edge_kind_t kind = w->kind;
596 list_head *head = _get_irn_outs_head(irn, kind);
599 INIT_LIST_HEAD(head);
600 _get_irn_edge_info(irn, kind)->edges_built = 0;
601 _get_irn_edge_info(irn, kind)->out_count = 0;
603 for (i = get_irn_deps(irn) - 1; i >= 0; --i) {
604 ir_node *dep = get_irn_dep(irn, i);
606 head = _get_irn_outs_head(dep, kind);
608 INIT_LIST_HEAD(head);
609 _get_irn_edge_info(dep, kind)->edges_built = 0;
610 _get_irn_edge_info(dep, kind)->out_count = 0;
614 typedef struct visitor_info_t {
615 irg_walk_func *visit;
620 * Visitor: initializes the list-heads and set the out-count
621 * of all nodes to 0 of nodes that are not seen so far.
623 static void visitor(ir_node *irn, void *data)
625 visitor_info_t *info = data;
627 if (!irn_visited_else_mark(irn)) {
628 info->visit(irn, info->data);
633 * Build the initial edge set.
634 * Beware, this is not a simple task because it suffers from two
636 * - the anchor set allows access to Nodes that may not be reachable from
638 * - the identities add nodes to the "root set" that are not yet reachable
639 * from End. However, after some transformations, the CSE may revival these
642 * These problems can be fixed using different strategies:
643 * - Add an age flag to every node. Whenever the edge of a node is older
644 * then the current edge, invalidate the edges of this node.
645 * While this would help for revivaled nodes, it increases memory and runtime.
646 * - Delete the identities set.
647 * Solves the revival problem, but may increase the memory consumption, as
648 * nodes cannot be revivaled at all.
649 * - Manually iterate over the identities root set. This did not consume more memory
650 * but increase the computation time because the |identities| >= |V|
652 * Currently, we use the last option.
654 void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind)
656 struct build_walker w;
657 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
658 visitor_info_t visit;
665 assert(!info->activated);
668 edges_init_graph_kind(irg, kind);
669 if (kind == EDGE_KIND_DEP) {
670 irg_walk_anchors(irg, init_lh_walker_dep, NULL, &w);
671 /* Argh: Dep nodes might be dead, so we MUST visit identities first */
672 visit.visit = init_lh_walker_dep;
673 visit_all_identities(irg, visitor, &visit);
674 irg_walk_anchors(irg, NULL, build_edges_walker, &w);
676 irg_walk_anchors(irg, init_lh_walker, build_edges_walker, &w);
677 visit.visit = init_lh_walker;
678 visit_all_identities(irg, visitor, &visit);
682 void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind)
684 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
687 if (info->allocated) {
688 obstack_free(&info->edges_obst, NULL);
689 ir_edgeset_destroy(&info->edges);
694 int (edges_activated_kind)(const ir_graph *irg, ir_edge_kind_t kind)
696 return _edges_activated_kind(irg, kind);
701 * Reroute all use-edges from a node to another.
702 * @param from The node whose use-edges shall be withdrawn.
703 * @param to The node to which all the use-edges of @p from shall be
705 * @param irg The graph.
707 void edges_reroute_kind(ir_node *from, ir_node *to, ir_edge_kind_t kind, ir_graph *irg)
709 set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
711 if (set_edge && edges_activated_kind(irg, kind)) {
712 struct list_head *head = _get_irn_outs_head(from, kind);
714 DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
716 while (head != head->next) {
717 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
718 assert(edge->pos >= -1);
719 set_edge(edge->src, edge->pos, to);
724 static void verify_set_presence(ir_node *irn, void *data)
726 struct build_walker *w = data;
727 ir_edgeset_t *edges = &_get_irg_edge_info(w->irg, w->kind)->edges;
730 foreach_tgt(irn, i, n, w->kind) {
736 e = ir_edgeset_find(edges, &templ);
740 w->problem_found = 1;
742 ir_fprintf(stderr, "Edge Verifier: edge %+F,%d -> %+F (kind: \"%s\") is missing\n",
743 irn, i, get_n(irn, i, w->kind), get_kind_str(w->kind));
749 static void verify_list_presence(ir_node *irn, void *data)
751 struct build_walker *w = data;
754 bitset_set(w->reachable, get_irn_idx(irn));
756 /* check list heads */
757 vrfy_list_head(irn, w->kind);
759 foreach_out_edge_kind(irn, e, w->kind) {
762 if (w->kind == EDGE_KIND_NORMAL && get_irn_arity(e->src) <= e->pos) {
763 w->problem_found = 1;
765 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F -> %+F recorded at src position %d, but src has arity %d\n",
766 edge_get_id(e), e->src, irn, e->pos, get_irn_arity(e->src));
771 tgt = get_n(e->src, e->pos, w->kind);
774 w->problem_found = 1;
776 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d (kind \"%s\") is no out edge of %+F but of %+F\n",
777 edge_get_id(e), e->src, e->pos, get_kind_str(w->kind), irn, tgt);
783 int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind)
785 struct build_walker w;
786 ir_edgeset_t *edges = &_get_irg_edge_info(irg, kind)->edges;
788 ir_edgeset_iterator_t iter;
792 w.reachable = bitset_alloca(get_irg_last_idx(irg));
795 /* Clear the present bit in all edges available. */
796 foreach_ir_edgeset(edges, e, iter) {
800 irg_walk_graph(irg, verify_set_presence, verify_list_presence, &w);
803 * Dump all edges which are not invalid and not present.
804 * These edges are superfluous and their presence in the
807 foreach_ir_edgeset(edges, e, iter) {
808 if (! e->invalid && ! e->present && bitset_is_set(w.reachable, get_irn_idx(e->src))) {
810 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d is superfluous\n", edge_get_id(e), e->src, e->pos);
814 return w.problem_found;
817 #define IGNORE_NODE(irn) (is_Bad((irn)) || is_Block((irn)))
820 * Clear link field of all nodes.
822 static void clear_links(ir_node *irn, void *env)
824 struct build_walker *w = env;
827 if (IGNORE_NODE(irn)) {
828 set_irn_link(irn, NULL);
832 bs = bitset_malloc(get_irg_last_idx(w->irg));
833 set_irn_link(irn, bs);
837 * Increases count (stored in link field) for all operands of a node.
839 static void count_user(ir_node *irn, void *env)
846 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
847 ir_node *op = get_irn_n(irn, i);
848 bitset_t *bs = get_irn_link(op);
851 bitset_set(bs, get_irn_idx(irn));
856 * Verifies if collected count, number of edges in list and stored edge count are in sync.
858 static void verify_edge_counter(ir_node *irn, void *env)
860 struct build_walker *w = env;
866 const struct list_head *head;
867 const struct list_head *pos;
869 if (IGNORE_NODE(irn))
872 bs = get_irn_link(irn);
875 edge_cnt = _get_irn_edge_info(irn, EDGE_KIND_NORMAL)->out_count;
876 head = _get_irn_outs_head(irn, EDGE_KIND_NORMAL);
878 /* We can iterate safely here, list heads have already been verified. */
879 list_for_each(pos, head) {
883 /* check all nodes that reference us and count edges that point number
884 * of ins that actually point to us */
886 bitset_foreach(bs, idx) {
888 ir_node *src = get_idx_irn(w->irg, idx);
890 arity = get_irn_arity(src);
891 for (i = 0; i < arity; ++i) {
892 ir_node *in = get_irn_n(src, i);
898 if (edge_cnt != list_cnt) {
899 w->problem_found = 1;
900 ir_fprintf(stderr, "Edge Verifier: edge count is %d, but %d edge(s) are recorded in list at %+F\n",
901 edge_cnt, list_cnt, irn);
904 if (ref_cnt != list_cnt) {
905 w->problem_found = 1;
906 ir_fprintf(stderr, "Edge Verifier: %+F reachable by %d node(s), but the list contains %d edge(s)\n",
907 irn, ref_cnt, list_cnt);
909 /* Matze: buggy if a node has multiple ins pointing at irn */
911 list_for_each(pos, head) {
912 ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
913 bitset_flip(bs, get_irn_idx(edge->src));
916 if (ref_cnt < list_cnt)
917 fprintf(stderr," following nodes are recorded in list, but not as user:\n");
919 fprintf(stderr," following nodes are user, but not recorded in list:\n");
922 bitset_foreach(bs, idx) {
923 ir_node *src = get_idx_irn(w->irg, idx);
924 ir_fprintf(stderr, " %+F", src);
926 fprintf(stderr, "\n");
934 * Verifies the out edges of an irg.
936 int edges_verify(ir_graph *irg)
938 struct build_walker w;
939 int problem_found = 0;
941 /* verify normal edges only */
942 problem_found = edges_verify_kind(irg, EDGE_KIND_NORMAL);
945 w.kind = EDGE_KIND_NORMAL;
949 irg_walk_anchors(irg, clear_links, count_user, &w);
950 irg_walk_anchors(irg, NULL, verify_edge_counter, &w);
952 return problem_found ? 1 : w.problem_found;
956 ir_graph_pass_t pass;
957 unsigned assert_on_problem;
961 * Wrapper to edges_verify to be run as an ir_graph pass.
963 static int edges_verify_wrapper(ir_graph *irg, void *context)
965 struct pass_t *pass = context;
966 int problems_found = edges_verify(irg);
967 /* do NOT rerun the pass if verify is ok :-) */
968 assert(problems_found && pass->assert_on_problem);
972 /* Creates an ir_graph pass for edges_verify(). */
973 ir_graph_pass_t *irg_verify_edges_pass(const char *name, unsigned assert_on_problem)
975 struct pass_t *pass = XMALLOCZ(struct pass_t);
977 def_graph_pass_constructor(
978 &pass->pass, name ? name : "edges_verify", edges_verify_wrapper);
980 /* neither dump nor verify */
981 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
982 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
984 pass->assert_on_problem = assert_on_problem;
988 void init_edges(void)
990 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
991 /* firm_dbg_set_mask(dbg, -1); */
994 void edges_init_dbg(int do_dbg)
999 void edges_activate(ir_graph *irg)
1001 edges_activate_kind(irg, EDGE_KIND_NORMAL);
1002 edges_activate_kind(irg, EDGE_KIND_BLOCK);
1003 if (get_irg_phase_state(irg) == phase_backend)
1004 edges_activate_kind(irg, EDGE_KIND_DEP);
1007 void edges_deactivate(ir_graph *irg)
1009 if (get_irg_phase_state(irg) == phase_backend)
1010 edges_deactivate_kind(irg, EDGE_KIND_DEP);
1011 edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
1012 edges_deactivate_kind(irg, EDGE_KIND_NORMAL);
1015 int edges_assure(ir_graph *irg)
1019 if (edges_activated_kind(irg, EDGE_KIND_BLOCK)) {
1022 edges_activate_kind(irg, EDGE_KIND_BLOCK);
1024 if (edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
1027 edges_activate_kind(irg, EDGE_KIND_NORMAL);
1033 int edges_assure_kind(ir_graph *irg, ir_edge_kind_t kind)
1035 int activated = edges_activated_kind(irg, kind);
1038 edges_activate_kind(irg, kind);
1043 void edges_node_deleted(ir_node *irn, ir_graph *irg)
1045 edges_node_deleted_kind(irn, EDGE_KIND_NORMAL, irg);
1046 edges_node_deleted_kind(irn, EDGE_KIND_BLOCK, irg);
1049 void edges_node_revival(ir_node *irn, ir_graph *irg)
1051 edges_node_revival_kind(irn, EDGE_KIND_NORMAL, irg);
1052 edges_node_revival_kind(irn, EDGE_KIND_BLOCK, irg);
1055 const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind)
1057 return _get_irn_out_edge_first_kind(irn, kind);
1060 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last)
1062 return _get_irn_out_edge_next(irn, last);
1065 ir_node *(get_edge_src_irn)(const ir_edge_t *edge)
1067 return _get_edge_src_irn(edge);
1070 int (get_edge_src_pos)(const ir_edge_t *edge)
1072 return _get_edge_src_pos(edge);
1075 int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind)
1077 return _get_irn_n_edges_kind(irn, kind);
1080 void dump_all_out_edges(ir_node *irn)
1083 for (i = 0; i < EDGE_KIND_LAST; ++i) {
1084 const ir_edge_t *edge;
1086 printf("kind \"%s\"\n", get_kind_str(i));
1087 foreach_out_edge_kind(irn, edge, i) {
1088 ir_printf("\t%+F(%d)\n", edge->src, edge->pos);
1093 static void irg_block_edges_walk2(ir_node *bl,
1094 irg_walk_func *pre, irg_walk_func *post,
1096 const ir_edge_t *edge, *next;
1098 if (!Block_block_visited(bl)) {
1099 mark_Block_block_visited(bl);
1104 foreach_out_edge_kind_safe(bl, edge, next, EDGE_KIND_BLOCK) {
1105 /* find the corresponding successor block. */
1106 ir_node *pred = get_edge_src_irn(edge);
1107 irg_block_edges_walk2(pred, pre, post, env);
1115 void irg_block_edges_walk(ir_node *node,
1116 irg_walk_func *pre, irg_walk_func *post,
1119 assert(edges_activated(current_ir_graph));
1120 assert(is_Block(node));
1122 ir_reserve_resources(current_ir_graph, IR_RESOURCE_BLOCK_VISITED);
1124 inc_irg_block_visited(current_ir_graph);
1125 irg_block_edges_walk2(node, pre, post, env);
1127 ir_free_resources(current_ir_graph, IR_RESOURCE_BLOCK_VISITED);