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
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 #define TIMES37(x) (((x) << 5) + ((x) << 2) + (x))
182 #define get_irn_out_list_head(irn) (&get_irn_out_info(irn)->outs)
184 #define edge_hash(edge) (TIMES37((edge)->pos) + hash_ptr((edge)->src))
186 void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind)
188 if (edges_activated_kind(irg, kind)) {
189 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
190 size_t amount = irg->estimated_node_count * 2;
193 if (info->allocated) {
194 amount = ir_edgeset_size(&info->edges);
195 ir_edgeset_destroy(&info->edges);
196 obstack_free(&info->edges_obst, NULL);
198 obstack_init(&info->edges_obst);
199 INIT_LIST_HEAD(&info->free_edges);
200 ir_edgeset_init_size(&info->edges, amount);
205 const ir_edge_t *get_irn_edge_kind(const ir_node *src, int pos, ir_edge_kind_t kind)
207 ir_graph *irg = get_irn_irg(src);
208 if (edges_activated_kind(irg, kind)) {
209 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
212 key.src = (ir_node *)src;
215 return ir_edgeset_find(&info->edges, &key);
222 * Change the out count
224 * @param tgt the edge target
225 * @param kind the kind of the edge
227 static inline void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs)
229 irn_edge_info_t *info = get_irn_edge_info(tgt, kind);
230 info->out_count += ofs;
234 * Verify the edge list of a node, ie. ensure it's a loop:
235 * head -> e_1 -> ... -> e_n -> head
237 static inline void verify_list_head(ir_node *irn, ir_edge_kind_t kind)
241 pset *lh_set = pset_new_ptr(16);
242 const struct list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
243 const struct list_head *pos;
245 list_for_each(pos, head) {
246 if (pset_find_ptr(lh_set, pos)) {
247 const ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
249 ir_fprintf(stderr, "EDGE Verifier: edge list broken (self loop not to head) for %+F:\n", irn);
250 fprintf(stderr, "- at list entry %d\n", num);
252 fprintf(stderr, "- edge(%ld) is invalid\n", edge_get_id(edge));
254 ir_fprintf(stderr, "- edge(%ld) %+F(%d)\n", edge_get_id(edge), edge->src, edge->pos);
259 pset_insert_ptr(lh_set, pos);
267 void edges_dump_kind(ir_graph *irg, ir_edge_kind_t kind)
269 irg_edge_info_t *info;
271 ir_edgeset_iterator_t iter;
274 if (!edges_activated_kind(irg, kind))
277 info = get_irg_edge_info(irg, kind);
278 edges = &info->edges;
279 foreach_ir_edgeset(edges, e, iter) {
280 ir_printf("%+F %d %d\n", e->src, e->pos, e->invalid);
284 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
285 ir_node *old_tgt, ir_edge_kind_t kind,
288 const char *msg = "";
289 irg_edge_info_t *info;
293 assert(edges_activated_kind(irg, kind));
296 * Only do something, if the old and new target differ.
301 info = get_irg_edge_info(irg, kind);
302 edges = &info->edges;
304 /* Initialize the edge template to search in the set. */
309 * If the target is NULL, the edge shall be deleted.
312 /* search the edge in the set. */
313 ir_edge_t *edge = ir_edgeset_find(edges, &templ);
315 /* mark the edge invalid if it was found */
318 list_del(&edge->list);
319 ir_edgeset_remove(edges, edge);
320 list_add(&edge->list, &info->free_edges);
324 edge_change_cnt(old_tgt, kind, -1);
326 /* If the edge was not found issue a warning on the debug stream */
327 msg = "edge to delete not found!\n";
331 * The target is not NULL and the old target differs
332 * from the new target, the edge shall be moved (if the
333 * old target was != NULL) or added (if the old target was
336 struct list_head *head = &get_irn_edge_info(tgt, kind)->outs_head;
338 assert(head->next && head->prev &&
339 "target list head must have been initialized");
341 /* If the old target is not null, the edge is moved. */
343 ir_edge_t *edge = ir_edgeset_find(edges, &templ);
344 assert(edge && "edge to redirect not found!");
345 assert(! edge->invalid && "Invalid edge encountered");
349 list_move(&edge->list, head);
350 edge_change_cnt(old_tgt, kind, -1);
352 /* The old target was NULL, thus, the edge is newly created. */
356 if (list_empty(&info->free_edges)) {
357 edge = (ir_edge_t*)obstack_alloc(&info->edges_obst, EDGE_SIZE);
359 edge = list_entry(info->free_edges.next, ir_edge_t, list);
360 list_del(&edge->list);
368 edge->list.next = NULL;
369 edge->list.prev = NULL;
370 memset(edge + 1, 0, edges_private_size);
372 new_edge = ir_edgeset_insert(edges, edge);
373 if (new_edge != edge) {
374 panic("new edge exists already");
378 list_add(&edge->list, head);
381 edge_change_cnt(tgt, kind, +1);
384 #ifndef DEBUG_libfirm
385 /* verify list heads */
388 verify_list_head(tgt, kind);
390 verify_list_head(old_tgt, kind);
394 DBG((dbg, LEVEL_5, "announce out edge: %+F %d-> %+F(%+F): %s\n", src, pos, tgt, old_tgt, msg));
397 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt,
400 if (edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
401 edges_notify_edge_kind(src, pos, tgt, old_tgt, EDGE_KIND_NORMAL, irg);
404 if (edges_activated_kind(irg, EDGE_KIND_BLOCK)) {
406 ir_node *bl_old = old_tgt ? get_nodes_block(old_tgt) : NULL;
407 ir_node *bl_tgt = NULL;
410 bl_tgt = is_Bad(tgt) ? tgt : get_nodes_block(tgt);
412 edges_notify_edge_kind(src, pos, bl_tgt, bl_old, EDGE_KIND_BLOCK, irg);
413 } else if (get_irn_mode(src) == mode_X && old_tgt != NULL && is_Block(old_tgt)) {
414 /* moving a jump node from one block to another */
415 const ir_edge_t *edge;
416 const ir_edge_t *next;
417 foreach_out_edge_kind_safe(old_tgt, edge, next, EDGE_KIND_BLOCK) {
418 ir_node *succ = get_edge_src_irn(edge);
419 int succ_pos = get_edge_src_pos(edge);
420 ir_node *block_pred = get_Block_cfgpred(succ, succ_pos);
421 if (block_pred != src)
423 edges_notify_edge_kind(succ, succ_pos, tgt, old_tgt,
424 EDGE_KIND_BLOCK, irg);
431 * Delete all in edges of a given kind from the node old.
433 * @param old the node
434 * @param kind the kind of edges to remove
435 * @param irg the irg of the old node
437 static void edges_node_deleted_kind(ir_node *old, ir_edge_kind_t kind)
440 ir_graph *irg = get_irn_irg(old);
442 if (!edges_activated_kind(irg, kind))
445 DBG((dbg, LEVEL_5, "node deleted (kind: %s): %+F\n", get_kind_str(kind), old));
447 foreach_tgt(old, i, n, kind) {
448 ir_node *old_tgt = get_n(old, i, kind);
449 edges_notify_edge_kind(old, i, NULL, old_tgt, kind, irg);
454 * A node might be revivaled by CSE. Assure its edges.
456 * @param irn the node
457 * @param kind the kind of edges to remove
458 * @param irg the irg of the old node
460 static void edges_node_revival_kind(ir_node *irn, ir_edge_kind_t kind)
462 irn_edge_info_t *info;
464 ir_graph *irg = get_irn_irg(irn);
466 if (!edges_activated_kind(irg, kind))
469 info = get_irn_edge_info(irn, kind);
470 if (info->edges_built)
473 DBG((dbg, LEVEL_5, "node revivaled (kind: %s): %+F\n", get_kind_str(kind), irn));
475 foreach_tgt(irn, i, n, kind) {
476 ir_node *tgt = get_n(irn, i, kind);
477 edges_notify_edge_kind(irn, i, tgt, NULL, kind, irg);
479 info->edges_built = 1;
482 typedef struct build_walker {
485 unsigned problem_found;
489 * Post-Walker: notify all edges
491 static void build_edges_walker(ir_node *irn, void *data)
493 build_walker *w = (build_walker*)data;
495 ir_edge_kind_t kind = w->kind;
496 ir_graph *irg = get_irn_irg(irn);
498 foreach_tgt(irn, i, n, kind) {
499 ir_node *pred = get_n(irn, i, kind);
500 edges_notify_edge_kind(irn, i, pred, NULL, kind, irg);
502 get_irn_edge_info(irn, kind)->edges_built = 1;
506 * Pre-Walker: initializes the list-heads and set the out-count
509 static void init_lh_walker(ir_node *irn, void *data)
511 build_walker *w = (build_walker*)data;
512 ir_edge_kind_t kind = w->kind;
513 list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
514 INIT_LIST_HEAD(head);
515 get_irn_edge_info(irn, kind)->edges_built = 0;
516 get_irn_edge_info(irn, kind)->out_count = 0;
520 * Pre-Walker: initializes the list-heads and set the out-count
523 * Additionally touches DEP nodes, as they might be DEAD.
524 * THIS IS UGLY, but I don't find a better way until we
526 * a) ensure that dead nodes are not used as input
527 * b) it might be sufficient to add those stupid NO_REG nodes
530 static void init_lh_walker_dep(ir_node *irn, void *data)
532 build_walker *w = (build_walker*)data;
533 ir_edge_kind_t kind = w->kind;
534 list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
537 INIT_LIST_HEAD(head);
538 get_irn_edge_info(irn, kind)->edges_built = 0;
539 get_irn_edge_info(irn, kind)->out_count = 0;
541 for (i = get_irn_deps(irn) - 1; i >= 0; --i) {
542 ir_node *dep = get_irn_dep(irn, i);
544 head = &get_irn_edge_info(dep, kind)->outs_head;
546 INIT_LIST_HEAD(head);
547 get_irn_edge_info(dep, kind)->edges_built = 0;
548 get_irn_edge_info(dep, kind)->out_count = 0;
552 typedef struct visitor_info_t {
553 irg_walk_func *visit;
558 * Visitor: initializes the list-heads and set the out-count
559 * of all nodes to 0 of nodes that are not seen so far.
561 static void visitor(ir_node *irn, void *data)
563 visitor_info_t *info = (visitor_info_t*)data;
567 if (!is_Block(irn) && is_Deleted(get_nodes_block(irn)))
570 if (!irn_visited_else_mark(irn)) {
571 info->visit(irn, info->data);
575 void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind)
578 * Build the initial edge set.
579 * Beware, this is not a simple task because it suffers from two
581 * - the anchor set allows access to Nodes that may not be reachable from
583 * - the identities add nodes to the "root set" that are not yet reachable
584 * from End. However, after some transformations, the CSE may revival these
587 * These problems can be fixed using different strategies:
588 * - Add an age flag to every node. Whenever the edge of a node is older
589 * then the current edge, invalidate the edges of this node.
590 * While this would help for revivaled nodes, it increases memory and runtime.
591 * - Delete the identities set.
592 * Solves the revival problem, but may increase the memory consumption, as
593 * nodes cannot be revivaled at all.
594 * - Manually iterate over the identities root set. This did not consume more memory
595 * but increase the computation time because the |identities| >= |V|
597 * Currently, we use the last option.
599 struct build_walker w;
600 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
601 visitor_info_t visit;
607 assert(!info->activated);
610 edges_init_graph_kind(irg, kind);
611 if (kind == EDGE_KIND_DEP) {
612 irg_walk_anchors(irg, init_lh_walker_dep, NULL, &w);
613 /* Argh: Dep nodes might be dead, so we MUST visit identities first */
614 visit.visit = init_lh_walker_dep;
615 visit_all_identities(irg, visitor, &visit);
616 irg_walk_anchors(irg, NULL, build_edges_walker, &w);
618 visit.visit = init_lh_walker;
619 visit_all_identities(irg, visitor, &visit);
620 irg_walk_anchors(irg, init_lh_walker, build_edges_walker, &w);
624 void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind)
626 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
629 if (info->allocated) {
630 obstack_free(&info->edges_obst, NULL);
631 ir_edgeset_destroy(&info->edges);
634 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES);
637 int (edges_activated_kind)(const ir_graph *irg, ir_edge_kind_t kind)
639 return edges_activated_kind_(irg, kind);
642 void edges_reroute_kind(ir_node *from, ir_node *to, ir_edge_kind_t kind)
644 ir_graph *irg = get_irn_irg(from);
645 set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
647 if (set_edge && edges_activated_kind(irg, kind)) {
648 struct list_head *head = &get_irn_edge_info(from, kind)->outs_head;
650 DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
652 while (head != head->next) {
653 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
654 assert(edge->pos >= -1);
655 set_edge(edge->src, edge->pos, to);
660 static void verify_set_presence(ir_node *irn, void *data)
662 build_walker *w = (build_walker*)data;
663 ir_graph *irg = get_irn_irg(irn);
664 ir_edgeset_t *edges = &get_irg_edge_info(irg, w->kind)->edges;
667 foreach_tgt(irn, i, n, w->kind) {
673 e = ir_edgeset_find(edges, &templ);
677 w->problem_found = 1;
682 static void verify_list_presence(ir_node *irn, void *data)
684 build_walker *w = (build_walker*)data;
687 bitset_set(w->reachable, get_irn_idx(irn));
689 /* check list heads */
690 verify_list_head(irn, w->kind);
692 foreach_out_edge_kind(irn, e, w->kind) {
695 if (w->kind == EDGE_KIND_NORMAL && get_irn_arity(e->src) <= e->pos) {
696 w->problem_found = 1;
700 tgt = get_n(e->src, e->pos, w->kind);
703 w->problem_found = 1;
708 int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind)
710 struct build_walker w;
711 ir_edgeset_t *edges = &get_irg_edge_info(irg, kind)->edges;
713 ir_edgeset_iterator_t iter;
716 w.reachable = bitset_alloca(get_irg_last_idx(irg));
719 /* Clear the present bit in all edges available. */
720 foreach_ir_edgeset(edges, e, iter) {
724 irg_walk_graph(irg, verify_set_presence, verify_list_presence, &w);
727 * Dump all edges which are not invalid and not present.
728 * These edges are superfluous and their presence in the
731 foreach_ir_edgeset(edges, e, iter) {
732 if (! e->invalid && ! e->present && bitset_is_set(w.reachable, get_irn_idx(e->src))) {
734 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d is superfluous\n", edge_get_id(e), e->src, e->pos);
738 return w.problem_found;
741 #define IGNORE_NODE(irn) (is_Bad((irn)) || is_Block((irn)))
744 * Clear link field of all nodes.
746 static void clear_links(ir_node *irn, void *env)
752 if (IGNORE_NODE(irn)) {
753 set_irn_link(irn, NULL);
757 irg = get_irn_irg(irn);
758 bs = bitset_malloc(get_irg_last_idx(irg));
759 set_irn_link(irn, bs);
763 * Increases count (stored in link field) for all operands of a node.
765 static void count_user(ir_node *irn, void *env)
771 first = is_Block(irn) ? 0 : -1;
772 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
773 ir_node *op = get_irn_n(irn, i);
774 bitset_t *bs = (bitset_t*)get_irn_link(op);
777 bitset_set(bs, get_irn_idx(irn));
782 * Verifies if collected count, number of edges in list and stored edge count are in sync.
784 static void verify_edge_counter(ir_node *irn, void *env)
786 build_walker *w = (build_walker*)env;
792 const struct list_head *head;
793 const struct list_head *pos;
796 if (IGNORE_NODE(irn))
799 bs = (bitset_t*)get_irn_link(irn);
802 edge_cnt = get_irn_edge_info(irn, EDGE_KIND_NORMAL)->out_count;
803 head = &get_irn_edge_info(irn, EDGE_KIND_NORMAL)->outs_head;
805 /* We can iterate safely here, list heads have already been verified. */
806 list_for_each(pos, head) {
810 /* check all nodes that reference us and count edges that point number
811 * of ins that actually point to us */
812 irg = get_irn_irg(irn);
814 bitset_foreach(bs, idx) {
816 ir_node *src = get_idx_irn(irg, idx);
818 arity = get_irn_arity(src);
819 for (i = 0; i < arity; ++i) {
820 ir_node *in = get_irn_n(src, i);
826 if (edge_cnt != list_cnt) {
827 w->problem_found = 1;
828 ir_fprintf(stderr, "Edge Verifier: edge count is %d, but %d edge(s) are recorded in list at %+F\n",
829 edge_cnt, list_cnt, irn);
832 if (ref_cnt != list_cnt) {
833 w->problem_found = 1;
834 ir_fprintf(stderr, "Edge Verifier: %+F reachable by %d node(s), but the list contains %d edge(s)\n",
835 irn, ref_cnt, list_cnt);
841 int edges_verify(ir_graph *irg)
843 struct build_walker w;
844 int problem_found = 0;
846 /* verify normal edges only */
847 problem_found = edges_verify_kind(irg, EDGE_KIND_NORMAL);
849 w.kind = EDGE_KIND_NORMAL;
853 irg_walk_anchors(irg, clear_links, count_user, &w);
854 irg_walk_anchors(irg, NULL, verify_edge_counter, &w);
856 return problem_found ? 1 : w.problem_found;
859 typedef struct pass_t {
860 ir_graph_pass_t pass;
861 unsigned assert_on_problem;
865 * Wrapper to edges_verify to be run as an ir_graph pass.
867 static int edges_verify_wrapper(ir_graph *irg, void *context)
869 pass_t *pass = (pass_t*)context;
870 int problems_found = edges_verify(irg);
871 /* do NOT rerun the pass if verify is ok :-) */
872 assert(problems_found && pass->assert_on_problem);
876 ir_graph_pass_t *irg_verify_edges_pass(const char *name, unsigned assert_on_problem)
878 pass_t *pass = XMALLOCZ(pass_t);
880 def_graph_pass_constructor(
881 &pass->pass, name ? name : "edges_verify", edges_verify_wrapper);
883 /* neither dump nor verify */
884 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
885 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
887 pass->assert_on_problem = assert_on_problem;
891 void init_edges(void)
893 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
896 void edges_init_dbg(int do_dbg)
901 void edges_activate(ir_graph *irg)
903 edges_activate_kind(irg, EDGE_KIND_NORMAL);
904 edges_activate_kind(irg, EDGE_KIND_BLOCK);
905 if (get_irg_phase_state(irg) == phase_backend)
906 edges_activate_kind(irg, EDGE_KIND_DEP);
909 void edges_deactivate(ir_graph *irg)
911 if (get_irg_phase_state(irg) == phase_backend)
912 edges_deactivate_kind(irg, EDGE_KIND_DEP);
913 edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
914 edges_deactivate_kind(irg, EDGE_KIND_NORMAL);
917 void assure_edges(ir_graph *irg)
919 assure_edges_kind(irg, EDGE_KIND_BLOCK);
920 assure_edges_kind(irg, EDGE_KIND_NORMAL);
921 add_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES);
924 void assure_edges_kind(ir_graph *irg, ir_edge_kind_t kind)
926 if (!edges_activated_kind(irg, kind))
927 edges_activate_kind(irg, kind);
930 void edges_node_deleted(ir_node *irn)
932 edges_node_deleted_kind(irn, EDGE_KIND_NORMAL);
933 edges_node_deleted_kind(irn, EDGE_KIND_BLOCK);
936 void edges_node_revival(ir_node *irn)
938 edges_node_revival_kind(irn, EDGE_KIND_NORMAL);
939 edges_node_revival_kind(irn, EDGE_KIND_BLOCK);
942 const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind)
944 return get_irn_out_edge_first_kind_(irn, kind);
947 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last)
949 return get_irn_out_edge_next_(irn, last);
952 ir_node *(get_edge_src_irn)(const ir_edge_t *edge)
954 return get_edge_src_irn_(edge);
957 int (get_edge_src_pos)(const ir_edge_t *edge)
959 return get_edge_src_pos_(edge);
962 int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind)
964 return get_irn_n_edges_kind_(irn, kind);
967 static void irg_walk_edges2(ir_node *node, irg_walk_func *pre,
968 irg_walk_func *post, void *env)
970 const ir_edge_t *edge, *next;
972 if (irn_visited_else_mark(node))
978 foreach_out_edge_kind_safe(node, edge, next, EDGE_KIND_NORMAL) {
979 /* find the corresponding successor block. */
980 ir_node *pred = get_edge_src_irn(edge);
981 irg_walk_edges2(pred, pre, post, env);
988 void irg_walk_edges(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
991 ir_graph *irg = get_irn_irg(node);
993 assert(edges_activated(irg));
994 assert(is_Block(node));
996 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
998 inc_irg_visited(irg);
999 irg_walk_edges2(node, pre, post, env);
1001 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
1004 static void irg_block_edges_walk2(ir_node *bl, irg_walk_func *pre,
1005 irg_walk_func *post, void *env)
1007 const ir_edge_t *edge, *next;
1009 if (!Block_block_visited(bl)) {
1010 mark_Block_block_visited(bl);
1015 foreach_out_edge_kind_safe(bl, edge, next, EDGE_KIND_BLOCK) {
1016 /* find the corresponding successor block. */
1017 ir_node *pred = get_edge_src_irn(edge);
1018 irg_block_edges_walk2(pred, pre, post, env);
1026 void irg_block_edges_walk(ir_node *node, irg_walk_func *pre,
1027 irg_walk_func *post, void *env)
1029 ir_graph *irg = get_irn_irg(node);
1031 assert(edges_activated(irg));
1032 assert(is_Block(node));
1034 ir_reserve_resources(irg, IR_RESOURCE_BLOCK_VISITED);
1036 inc_irg_block_visited(irg);
1037 irg_block_edges_walk2(node, pre, post, env);
1039 ir_free_resources(irg, IR_RESOURCE_BLOCK_VISITED);