2 * Copyright (C) 1995-2011 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
26 * This are out-edges (also called def-use edges) that are dynamically
27 * updated as the graph changes.
33 #include "iredgekinds.h"
34 #include "iredges_t.h"
44 #include "iredgeset.h"
49 #define HashSet ir_edgeset_t
50 #define HashSetIterator ir_edgeset_iterator_t
51 #define ValueType ir_edge_t*
52 #define NullValue NULL
53 #define DeletedValue ((ir_edge_t*)-1)
54 #define Hash(this,key) (hash_ptr(key->src) ^ (key->pos * 40013))
55 #define KeysEqual(this,key1,key2) ((key1->src) == (key2->src) && (key1->pos == key2->pos))
56 #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
58 #define hashset_init ir_edgeset_init
59 void ir_edgeset_init_size(ir_edgeset_t *self, size_t size);
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 ir_edge_t *ir_edgeset_find(const ir_edgeset_t *self, const ir_edge_t*);
65 #define hashset_find ir_edgeset_find
66 size_t ir_edgeset_size(const ir_edgeset_t *self);
67 #define hashset_size ir_edgeset_size
68 #define hashset_iterator_init ir_edgeset_iterator_init
69 #define hashset_iterator_next ir_edgeset_iterator_next
70 #define hashset_remove_iterator ir_edgeset_remove_iterator
72 #include "hashset.c.inl"
75 * A function that allows for setting an edge.
76 * This abstraction is necessary since different edge kind have
77 * different methods of setting edges.
79 typedef void (set_edge_func_t)(ir_node *src, int pos, ir_node *tgt);
82 * A function that returns the "arity" of a given edge kind
85 typedef int (get_edge_src_arity_func_t)(const ir_node *src);
88 * A function that returns the pos'th edge of a given edge kind for a node.
90 typedef ir_node *(get_edge_src_n_func_t)(const ir_node *src, int pos);
93 * Additional data for an edge kind.
96 const char *name; /**< name of this edge kind */
97 set_edge_func_t *set_edge; /**< the set_edge function */
98 int first_idx; /**< index of the first possible edge */
99 get_edge_src_arity_func_t *get_arity; /**< the get_arity function */
100 get_edge_src_n_func_t *get_n; /**< the get_n function */
101 } ir_edge_kind_info_t;
104 * Get the predecessor block.
106 static ir_node *get_block_n(const ir_node *block, int pos)
109 return get_Block_cfgpred_block(block, pos);
114 static ir_node *get_irn_safe_n(const ir_node *node, int n)
116 if (n == -1 && is_Block(node))
118 return get_irn_n(node, n);
121 static const ir_edge_kind_info_t edge_kind_info[EDGE_KIND_LAST] = {
122 { "normal" , set_irn_n, -1, get_irn_arity, get_irn_safe_n },
123 { "block succs", NULL, 0, get_irn_arity, get_block_n },
124 { "dependency", set_irn_dep, 0, get_irn_deps, get_irn_dep }
127 #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)
128 #define get_n(irn, pos, kind) (edge_kind_info[kind].get_n(irn, pos))
129 #define get_kind_str(kind) (edge_kind_info[kind].name)
131 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
134 * This flag is set to 1, if the edges get initialized for an irg.
135 * Then register additional data is forbidden.
137 static int edges_used = 0;
140 * Summed size of all users private data
143 static size_t edges_private_size = 0;
144 #define EDGE_SIZE (sizeof(ir_edge_t) + edges_private_size)
147 * If set to 1, the list heads are checked every time an edge is changed.
149 static int edges_dbg = 0;
152 * Returns an ID for the given edge.
154 static inline long edge_get_id(const ir_edge_t *e)
159 size_t edges_register_private_data(size_t n)
161 size_t res = edges_private_size;
163 assert(!edges_used && "you cannot register private edge data, if edges have been initialized");
165 edges_private_size += n;
169 void edges_reset_private_data(ir_graph *irg, int offset, unsigned size)
171 irg_edge_info_t *info = get_irg_edge_info(irg, EDGE_KIND_NORMAL);
173 ir_edgeset_iterator_t iter;
175 foreach_ir_edgeset(&info->edges, edge, iter) {
176 memset(edge + sizeof(*edge) + offset, 0, size);
180 void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind)
182 if (edges_activated_kind(irg, kind)) {
183 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
184 size_t amount = irg->estimated_node_count * 2;
187 if (info->allocated) {
188 amount = ir_edgeset_size(&info->edges);
189 ir_edgeset_destroy(&info->edges);
190 obstack_free(&info->edges_obst, NULL);
192 obstack_init(&info->edges_obst);
193 INIT_LIST_HEAD(&info->free_edges);
194 ir_edgeset_init_size(&info->edges, amount);
199 const ir_edge_t *get_irn_edge_kind(const ir_node *src, int pos, ir_edge_kind_t kind)
201 ir_graph *irg = get_irn_irg(src);
202 if (edges_activated_kind(irg, kind)) {
203 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
206 key.src = (ir_node *)src;
209 return ir_edgeset_find(&info->edges, &key);
216 * Change the out count
218 * @param tgt the edge target
219 * @param kind the kind of the edge
221 static inline void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs)
223 irn_edge_info_t *info = get_irn_edge_info(tgt, kind);
224 info->out_count += ofs;
228 * Verify the edge list of a node, ie. ensure it's a loop:
229 * head -> e_1 -> ... -> e_n -> head
231 static inline void verify_list_head(ir_node *irn, ir_edge_kind_t kind)
235 pset *lh_set = pset_new_ptr(16);
236 const struct list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
237 const struct list_head *pos;
239 list_for_each(pos, head) {
240 if (pset_find_ptr(lh_set, pos)) {
241 const ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
243 ir_fprintf(stderr, "EDGE Verifier: edge list broken (self loop not to head) for %+F:\n", irn);
244 fprintf(stderr, "- at list entry %d\n", num);
246 fprintf(stderr, "- edge(%ld) is invalid\n", edge_get_id(edge));
248 ir_fprintf(stderr, "- edge(%ld) %+F(%d)\n", edge_get_id(edge), edge->src, edge->pos);
253 pset_insert_ptr(lh_set, pos);
261 void edges_dump_kind(ir_graph *irg, ir_edge_kind_t kind)
263 irg_edge_info_t *info;
265 ir_edgeset_iterator_t iter;
268 if (!edges_activated_kind(irg, kind))
271 info = get_irg_edge_info(irg, kind);
272 edges = &info->edges;
273 foreach_ir_edgeset(edges, e, iter) {
274 ir_printf("%+F %d %d\n", e->src, e->pos, e->invalid);
278 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
279 ir_node *old_tgt, ir_edge_kind_t kind,
282 const char *msg = "";
283 irg_edge_info_t *info;
287 assert(edges_activated_kind(irg, kind));
290 * Only do something, if the old and new target differ.
295 info = get_irg_edge_info(irg, kind);
296 edges = &info->edges;
298 /* Initialize the edge template to search in the set. */
303 * If the target is NULL, the edge shall be deleted.
306 /* search the edge in the set. */
307 ir_edge_t *edge = ir_edgeset_find(edges, &templ);
309 /* mark the edge invalid if it was found */
312 list_del(&edge->list);
313 ir_edgeset_remove(edges, edge);
314 list_add(&edge->list, &info->free_edges);
318 edge_change_cnt(old_tgt, kind, -1);
320 /* If the edge was not found issue a warning on the debug stream */
321 msg = "edge to delete not found!\n";
325 * The target is not NULL and the old target differs
326 * from the new target, the edge shall be moved (if the
327 * old target was != NULL) or added (if the old target was
330 struct list_head *head = &get_irn_edge_info(tgt, kind)->outs_head;
332 assert(head->next && head->prev &&
333 "target list head must have been initialized");
335 /* If the old target is not null, the edge is moved. */
337 ir_edge_t *edge = ir_edgeset_find(edges, &templ);
338 assert(edge && "edge to redirect not found!");
339 assert(! edge->invalid && "Invalid edge encountered");
343 list_move(&edge->list, head);
344 edge_change_cnt(old_tgt, kind, -1);
346 /* The old target was NULL, thus, the edge is newly created. */
350 if (list_empty(&info->free_edges)) {
351 edge = (ir_edge_t*)obstack_alloc(&info->edges_obst, EDGE_SIZE);
353 edge = list_entry(info->free_edges.next, ir_edge_t, list);
354 list_del(&edge->list);
362 edge->list.next = NULL;
363 edge->list.prev = NULL;
364 memset(edge + 1, 0, edges_private_size);
366 new_edge = ir_edgeset_insert(edges, edge);
367 if (new_edge != edge) {
368 panic("new edge exists already");
372 list_add(&edge->list, head);
375 edge_change_cnt(tgt, kind, +1);
378 #ifndef DEBUG_libfirm
379 /* verify list heads */
382 verify_list_head(tgt, kind);
384 verify_list_head(old_tgt, kind);
388 DBG((dbg, LEVEL_5, "announce out edge: %+F %d-> %+F(%+F): %s\n", src, pos, tgt, old_tgt, msg));
391 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt,
394 if (edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
395 edges_notify_edge_kind(src, pos, tgt, old_tgt, EDGE_KIND_NORMAL, irg);
398 if (edges_activated_kind(irg, EDGE_KIND_BLOCK)) {
400 ir_node *bl_old = old_tgt ? get_nodes_block(old_tgt) : NULL;
401 ir_node *bl_tgt = NULL;
404 bl_tgt = is_Bad(tgt) ? tgt : get_nodes_block(tgt);
406 edges_notify_edge_kind(src, pos, bl_tgt, bl_old, EDGE_KIND_BLOCK, irg);
407 } else if (get_irn_mode(src) == mode_X && old_tgt != NULL && is_Block(old_tgt)) {
408 /* moving a jump node from one block to another */
409 foreach_out_edge_kind_safe(old_tgt, edge, EDGE_KIND_BLOCK) {
410 ir_node *succ = get_edge_src_irn(edge);
411 int succ_pos = get_edge_src_pos(edge);
412 ir_node *block_pred = get_Block_cfgpred(succ, succ_pos);
413 if (block_pred != src)
415 edges_notify_edge_kind(succ, succ_pos, tgt, old_tgt,
416 EDGE_KIND_BLOCK, irg);
423 * Delete all in edges of a given kind from the node old.
425 * @param old the node
426 * @param kind the kind of edges to remove
427 * @param irg the irg of the old node
429 static void edges_node_deleted_kind(ir_node *old, ir_edge_kind_t kind)
432 ir_graph *irg = get_irn_irg(old);
434 if (!edges_activated_kind(irg, kind))
437 DBG((dbg, LEVEL_5, "node deleted (kind: %s): %+F\n", get_kind_str(kind), old));
439 foreach_tgt(old, i, n, kind) {
440 ir_node *old_tgt = get_n(old, i, kind);
441 edges_notify_edge_kind(old, i, NULL, old_tgt, kind, irg);
446 * A node might be revivaled by CSE. Assure its edges.
448 * @param irn the node
449 * @param kind the kind of edges to remove
450 * @param irg the irg of the old node
452 static void edges_node_revival_kind(ir_node *irn, ir_edge_kind_t kind)
454 irn_edge_info_t *info;
456 ir_graph *irg = get_irn_irg(irn);
458 if (!edges_activated_kind(irg, kind))
461 info = get_irn_edge_info(irn, kind);
462 if (info->edges_built)
465 DBG((dbg, LEVEL_5, "node revivaled (kind: %s): %+F\n", get_kind_str(kind), irn));
467 foreach_tgt(irn, i, n, kind) {
468 ir_node *tgt = get_n(irn, i, kind);
469 edges_notify_edge_kind(irn, i, tgt, NULL, kind, irg);
471 info->edges_built = 1;
474 typedef struct build_walker {
477 unsigned problem_found;
481 * Post-Walker: notify all edges
483 static void build_edges_walker(ir_node *irn, void *data)
485 build_walker *w = (build_walker*)data;
487 ir_edge_kind_t kind = w->kind;
488 ir_graph *irg = get_irn_irg(irn);
490 foreach_tgt(irn, i, n, kind) {
491 ir_node *pred = get_n(irn, i, kind);
492 edges_notify_edge_kind(irn, i, pred, NULL, kind, irg);
494 get_irn_edge_info(irn, kind)->edges_built = 1;
498 * Pre-Walker: initializes the list-heads and set the out-count
501 static void init_lh_walker(ir_node *irn, void *data)
503 build_walker *w = (build_walker*)data;
504 ir_edge_kind_t kind = w->kind;
505 list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
506 INIT_LIST_HEAD(head);
507 get_irn_edge_info(irn, kind)->edges_built = 0;
508 get_irn_edge_info(irn, kind)->out_count = 0;
512 * Pre-Walker: initializes the list-heads and set the out-count
515 * Additionally touches DEP nodes, as they might be DEAD.
516 * THIS IS UGLY, but I don't find a better way until we
518 * a) ensure that dead nodes are not used as input
519 * b) it might be sufficient to add those stupid NO_REG nodes
522 static void init_lh_walker_dep(ir_node *irn, void *data)
524 build_walker *w = (build_walker*)data;
525 ir_edge_kind_t kind = w->kind;
526 list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
529 INIT_LIST_HEAD(head);
530 get_irn_edge_info(irn, kind)->edges_built = 0;
531 get_irn_edge_info(irn, kind)->out_count = 0;
533 for (i = get_irn_deps(irn) - 1; i >= 0; --i) {
534 ir_node *dep = get_irn_dep(irn, i);
536 head = &get_irn_edge_info(dep, kind)->outs_head;
538 INIT_LIST_HEAD(head);
539 get_irn_edge_info(dep, kind)->edges_built = 0;
540 get_irn_edge_info(dep, kind)->out_count = 0;
544 typedef struct visitor_info_t {
545 irg_walk_func *visit;
550 * Visitor: initializes the list-heads and set the out-count
551 * of all nodes to 0 of nodes that are not seen so far.
553 static void visitor(ir_node *irn, void *data)
555 visitor_info_t *info = (visitor_info_t*)data;
559 if (!is_Block(irn) && is_Deleted(get_nodes_block(irn)))
562 if (!irn_visited_else_mark(irn)) {
563 info->visit(irn, info->data);
567 void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind)
570 * Build the initial edge set.
571 * Beware, this is not a simple task because it suffers from two
573 * - the anchor set allows access to Nodes that may not be reachable from
575 * - the identities add nodes to the "root set" that are not yet reachable
576 * from End. However, after some transformations, the CSE may revival these
579 * These problems can be fixed using different strategies:
580 * - Add an age flag to every node. Whenever the edge of a node is older
581 * then the current edge, invalidate the edges of this node.
582 * While this would help for revivaled nodes, it increases memory and runtime.
583 * - Delete the identities set.
584 * Solves the revival problem, but may increase the memory consumption, as
585 * nodes cannot be revivaled at all.
586 * - Manually iterate over the identities root set. This did not consume more memory
587 * but increase the computation time because the |identities| >= |V|
589 * Currently, we use the last option.
591 struct build_walker w;
592 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
593 visitor_info_t visit;
599 assert(!info->activated);
602 edges_init_graph_kind(irg, kind);
603 if (kind == EDGE_KIND_DEP) {
604 irg_walk_anchors(irg, init_lh_walker_dep, NULL, &w);
605 /* Argh: Dep nodes might be dead, so we MUST visit identities first */
606 visit.visit = init_lh_walker_dep;
607 visit_all_identities(irg, visitor, &visit);
608 irg_walk_anchors(irg, NULL, build_edges_walker, &w);
610 visit.visit = init_lh_walker;
611 visit_all_identities(irg, visitor, &visit);
612 irg_walk_anchors(irg, init_lh_walker, build_edges_walker, &w);
616 void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind)
618 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
621 if (info->allocated) {
622 obstack_free(&info->edges_obst, NULL);
623 ir_edgeset_destroy(&info->edges);
626 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES);
629 int (edges_activated_kind)(const ir_graph *irg, ir_edge_kind_t kind)
631 return edges_activated_kind_(irg, kind);
634 void edges_reroute_kind(ir_node *from, ir_node *to, ir_edge_kind_t kind)
636 ir_graph *irg = get_irn_irg(from);
637 set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
639 if (set_edge && edges_activated_kind(irg, kind)) {
640 struct list_head *head = &get_irn_edge_info(from, kind)->outs_head;
642 DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
644 while (head != head->next) {
645 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
646 assert(edge->pos >= -1);
647 set_edge(edge->src, edge->pos, to);
652 void edges_reroute_except(ir_node *from, ir_node *to, ir_node *exception)
654 foreach_out_edge_safe(from, edge) {
655 ir_node *src = get_edge_src_irn(edge);
656 if (src == exception)
658 set_irn_n(src, edge->pos, to);
662 static void verify_set_presence(ir_node *irn, void *data)
664 build_walker *w = (build_walker*)data;
665 ir_graph *irg = get_irn_irg(irn);
666 ir_edgeset_t *edges = &get_irg_edge_info(irg, w->kind)->edges;
669 foreach_tgt(irn, i, n, w->kind) {
675 e = ir_edgeset_find(edges, &templ);
679 w->problem_found = 1;
684 static void verify_list_presence(ir_node *irn, void *data)
686 build_walker *w = (build_walker*)data;
688 bitset_set(w->reachable, get_irn_idx(irn));
690 /* check list heads */
691 verify_list_head(irn, w->kind);
693 foreach_out_edge_kind(irn, e, w->kind) {
696 if (w->kind == EDGE_KIND_NORMAL && get_irn_arity(e->src) <= e->pos) {
697 w->problem_found = 1;
701 tgt = get_n(e->src, e->pos, w->kind);
704 w->problem_found = 1;
709 int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind)
711 struct build_walker w;
712 ir_edgeset_t *edges = &get_irg_edge_info(irg, kind)->edges;
714 ir_edgeset_iterator_t iter;
717 w.reachable = bitset_alloca(get_irg_last_idx(irg));
720 /* Clear the present bit in all edges available. */
721 foreach_ir_edgeset(edges, e, iter) {
725 irg_walk_graph(irg, verify_set_presence, verify_list_presence, &w);
728 * Dump all edges which are not invalid and not present.
729 * These edges are superfluous and their presence in the
732 foreach_ir_edgeset(edges, e, iter) {
733 if (! e->invalid && ! e->present && bitset_is_set(w.reachable, get_irn_idx(e->src))) {
735 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d is superfluous\n", edge_get_id(e), e->src, e->pos);
739 return w.problem_found;
742 #define IGNORE_NODE(irn) (is_Bad((irn)) || is_Block((irn)))
745 * Clear link field of all nodes.
747 static void clear_links(ir_node *irn, void *env)
753 if (IGNORE_NODE(irn)) {
754 set_irn_link(irn, NULL);
758 irg = get_irn_irg(irn);
759 bs = bitset_malloc(get_irg_last_idx(irg));
760 set_irn_link(irn, bs);
764 * Increases count (stored in link field) for all operands of a node.
766 static void count_user(ir_node *irn, void *env)
772 first = is_Block(irn) ? 0 : -1;
773 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
774 ir_node *op = get_irn_n(irn, i);
775 bitset_t *bs = (bitset_t*)get_irn_link(op);
778 bitset_set(bs, get_irn_idx(irn));
783 * Verifies if collected count, number of edges in list and stored edge count are in sync.
785 static void verify_edge_counter(ir_node *irn, void *env)
787 build_walker *w = (build_walker*)env;
788 if (IGNORE_NODE(irn))
791 bitset_t *bs = (bitset_t*)get_irn_link(irn);
793 int edge_cnt = get_irn_edge_info(irn, EDGE_KIND_NORMAL)->out_count;
794 const struct list_head *head
795 = &get_irn_edge_info(irn, EDGE_KIND_NORMAL)->outs_head;
797 /* We can iterate safely here, list heads have already been verified. */
798 const struct list_head *pos;
799 list_for_each(pos, head) {
803 /* check all nodes that reference us and count edges that point number
804 * of ins that actually point to us */
805 ir_graph *irg = get_irn_irg(irn);
807 bitset_foreach(bs, idx) {
809 ir_node *src = get_idx_irn(irg, idx);
811 arity = get_irn_arity(src);
812 for (i = 0; i < arity; ++i) {
813 ir_node *in = get_irn_n(src, i);
819 if (edge_cnt != list_cnt) {
820 w->problem_found = 1;
821 ir_fprintf(stderr, "Edge Verifier: edge count is %d, but %d edge(s) are recorded in list at %+F\n",
822 edge_cnt, list_cnt, irn);
825 if (ref_cnt != list_cnt) {
826 w->problem_found = 1;
827 ir_fprintf(stderr, "Edge Verifier: %+F reachable by %d node(s), but the list contains %d edge(s)\n",
828 irn, ref_cnt, list_cnt);
834 int edges_verify(ir_graph *irg)
836 struct build_walker w;
837 int problem_found = 0;
839 /* verify normal edges only */
840 problem_found = edges_verify_kind(irg, EDGE_KIND_NORMAL);
842 w.kind = EDGE_KIND_NORMAL;
846 irg_walk_anchors(irg, clear_links, count_user, &w);
847 irg_walk_anchors(irg, NULL, verify_edge_counter, &w);
849 return problem_found ? 1 : w.problem_found;
852 typedef struct pass_t {
853 ir_graph_pass_t pass;
854 unsigned assert_on_problem;
858 * Wrapper to edges_verify to be run as an ir_graph pass.
860 static int edges_verify_wrapper(ir_graph *irg, void *context)
862 pass_t *pass = (pass_t*)context;
863 int problems_found = edges_verify(irg);
864 /* do NOT rerun the pass if verify is ok :-) */
865 assert(problems_found && pass->assert_on_problem);
869 ir_graph_pass_t *irg_verify_edges_pass(const char *name, unsigned assert_on_problem)
871 pass_t *pass = XMALLOCZ(pass_t);
873 def_graph_pass_constructor(
874 &pass->pass, name ? name : "edges_verify", edges_verify_wrapper);
876 /* neither dump nor verify */
877 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
878 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
880 pass->assert_on_problem = assert_on_problem;
884 void init_edges(void)
886 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
889 void edges_init_dbg(int do_dbg)
894 void edges_activate(ir_graph *irg)
896 edges_activate_kind(irg, EDGE_KIND_NORMAL);
897 edges_activate_kind(irg, EDGE_KIND_BLOCK);
898 edges_activate_kind(irg, EDGE_KIND_DEP);
901 void edges_deactivate(ir_graph *irg)
903 edges_deactivate_kind(irg, EDGE_KIND_DEP);
904 edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
905 edges_deactivate_kind(irg, EDGE_KIND_NORMAL);
908 void assure_edges(ir_graph *irg)
910 assure_edges_kind(irg, EDGE_KIND_BLOCK);
911 assure_edges_kind(irg, EDGE_KIND_NORMAL);
912 assure_edges_kind(irg, EDGE_KIND_DEP);
913 add_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES);
916 void assure_edges_kind(ir_graph *irg, ir_edge_kind_t kind)
918 if (!edges_activated_kind(irg, kind))
919 edges_activate_kind(irg, kind);
922 void edges_node_deleted(ir_node *irn)
924 edges_node_deleted_kind(irn, EDGE_KIND_NORMAL);
925 edges_node_deleted_kind(irn, EDGE_KIND_BLOCK);
926 edges_node_deleted_kind(irn, EDGE_KIND_DEP);
929 void edges_node_revival(ir_node *irn)
931 edges_node_revival_kind(irn, EDGE_KIND_NORMAL);
932 edges_node_revival_kind(irn, EDGE_KIND_BLOCK);
935 const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind)
937 return get_irn_out_edge_first_kind_(irn, kind);
940 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last)
942 return get_irn_out_edge_next_(irn, last);
945 ir_node *(get_edge_src_irn)(const ir_edge_t *edge)
947 return get_edge_src_irn_(edge);
950 int (get_edge_src_pos)(const ir_edge_t *edge)
952 return get_edge_src_pos_(edge);
955 int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind)
957 return get_irn_n_edges_kind_(irn, kind);
960 static void irg_walk_edges2(ir_node *node, irg_walk_func *pre,
961 irg_walk_func *post, void *env)
963 if (irn_visited_else_mark(node))
969 foreach_out_edge_kind_safe(node, edge, EDGE_KIND_NORMAL) {
970 /* find the corresponding successor block. */
971 ir_node *pred = get_edge_src_irn(edge);
972 irg_walk_edges2(pred, pre, post, env);
979 void irg_walk_edges(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
982 ir_graph *irg = get_irn_irg(node);
984 assert(edges_activated(irg));
985 assert(is_Block(node));
987 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
989 inc_irg_visited(irg);
990 irg_walk_edges2(node, pre, post, env);
992 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
995 static void irg_block_edges_walk2(ir_node *bl, irg_walk_func *pre,
996 irg_walk_func *post, void *env)
998 if (!Block_block_visited(bl)) {
999 mark_Block_block_visited(bl);
1004 foreach_out_edge_kind_safe(bl, edge, EDGE_KIND_BLOCK) {
1005 /* find the corresponding successor block. */
1006 ir_node *pred = get_edge_src_irn(edge);
1007 irg_block_edges_walk2(pred, pre, post, env);
1015 void irg_block_edges_walk(ir_node *node, irg_walk_func *pre,
1016 irg_walk_func *post, void *env)
1018 ir_graph *irg = get_irn_irg(node);
1020 assert(edges_activated(irg));
1021 assert(is_Block(node));
1023 ir_reserve_resources(irg, IR_RESOURCE_BLOCK_VISITED);
1025 inc_irg_block_visited(irg);
1026 irg_block_edges_walk2(node, pre, post, env);
1028 ir_free_resources(irg, IR_RESOURCE_BLOCK_VISITED);