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 * If set to 1, the list heads are checked every time an edge is changed.
142 static int edges_dbg = 0;
145 * Returns an ID for the given edge.
147 static inline long edge_get_id(const ir_edge_t *e)
152 void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind)
154 if (edges_activated_kind(irg, kind)) {
155 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
156 size_t amount = irg->estimated_node_count * 2;
159 if (info->allocated) {
160 amount = ir_edgeset_size(&info->edges);
161 ir_edgeset_destroy(&info->edges);
162 obstack_free(&info->edges_obst, NULL);
164 obstack_init(&info->edges_obst);
165 INIT_LIST_HEAD(&info->free_edges);
166 ir_edgeset_init_size(&info->edges, amount);
171 const ir_edge_t *get_irn_edge_kind(const ir_node *src, int pos, ir_edge_kind_t kind)
173 ir_graph *irg = get_irn_irg(src);
174 if (edges_activated_kind(irg, kind)) {
175 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
178 key.src = (ir_node *)src;
181 return ir_edgeset_find(&info->edges, &key);
188 * Change the out count
190 * @param tgt the edge target
191 * @param kind the kind of the edge
193 static inline void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs)
195 irn_edge_info_t *info = get_irn_edge_info(tgt, kind);
196 info->out_count += ofs;
200 * Verify the edge list of a node, ie. ensure it's a loop:
201 * head -> e_1 -> ... -> e_n -> head
203 static inline void verify_list_head(ir_node *irn, ir_edge_kind_t kind)
207 pset *lh_set = pset_new_ptr(16);
208 const struct list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
209 const struct list_head *pos;
211 list_for_each(pos, head) {
212 if (pset_find_ptr(lh_set, pos)) {
213 const ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
215 ir_fprintf(stderr, "EDGE Verifier: edge list broken (self loop not to head) for %+F:\n", irn);
216 fprintf(stderr, "- at list entry %d\n", num);
218 fprintf(stderr, "- edge(%ld) is invalid\n", edge_get_id(edge));
220 ir_fprintf(stderr, "- edge(%ld) %+F(%d)\n", edge_get_id(edge), edge->src, edge->pos);
225 pset_insert_ptr(lh_set, pos);
233 void edges_dump_kind(ir_graph *irg, ir_edge_kind_t kind)
235 irg_edge_info_t *info;
237 ir_edgeset_iterator_t iter;
240 if (!edges_activated_kind(irg, kind))
243 info = get_irg_edge_info(irg, kind);
244 edges = &info->edges;
245 foreach_ir_edgeset(edges, e, iter) {
246 ir_printf("%+F %d %d\n", e->src, e->pos, e->invalid);
250 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
251 ir_node *old_tgt, ir_edge_kind_t kind,
254 const char *msg = "";
255 irg_edge_info_t *info;
259 assert(edges_activated_kind(irg, kind));
262 * Only do something, if the old and new target differ.
267 info = get_irg_edge_info(irg, kind);
268 edges = &info->edges;
270 /* Initialize the edge template to search in the set. */
275 * If the target is NULL, the edge shall be deleted.
278 /* search the edge in the set. */
279 ir_edge_t *edge = ir_edgeset_find(edges, &templ);
281 /* mark the edge invalid if it was found */
284 list_del(&edge->list);
285 ir_edgeset_remove(edges, edge);
286 list_add(&edge->list, &info->free_edges);
290 edge_change_cnt(old_tgt, kind, -1);
292 /* If the edge was not found issue a warning on the debug stream */
293 msg = "edge to delete not found!\n";
297 * The target is not NULL and the old target differs
298 * from the new target, the edge shall be moved (if the
299 * old target was != NULL) or added (if the old target was
302 struct list_head *head = &get_irn_edge_info(tgt, kind)->outs_head;
304 assert(head->next && head->prev &&
305 "target list head must have been initialized");
307 /* If the old target is not null, the edge is moved. */
309 ir_edge_t *edge = ir_edgeset_find(edges, &templ);
310 assert(edge && "edge to redirect not found!");
311 assert(! edge->invalid && "Invalid edge encountered");
315 list_move(&edge->list, head);
316 edge_change_cnt(old_tgt, kind, -1);
318 /* The old target was NULL, thus, the edge is newly created. */
322 if (list_empty(&info->free_edges)) {
323 edge = OALLOC(&info->edges_obst, ir_edge_t);
325 edge = list_entry(info->free_edges.next, ir_edge_t, list);
326 list_del(&edge->list);
334 edge->list.next = NULL;
335 edge->list.prev = NULL;
337 new_edge = ir_edgeset_insert(edges, edge);
338 if (new_edge != edge) {
339 panic("new edge exists already");
343 list_add(&edge->list, head);
346 edge_change_cnt(tgt, kind, +1);
349 #ifndef DEBUG_libfirm
350 /* verify list heads */
353 verify_list_head(tgt, kind);
355 verify_list_head(old_tgt, kind);
359 DBG((dbg, LEVEL_5, "announce out edge: %+F %d-> %+F(%+F): %s\n", src, pos, tgt, old_tgt, msg));
362 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt,
365 if (edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
366 edges_notify_edge_kind(src, pos, tgt, old_tgt, EDGE_KIND_NORMAL, irg);
369 if (edges_activated_kind(irg, EDGE_KIND_BLOCK)) {
371 ir_node *bl_old = old_tgt ? get_nodes_block(old_tgt) : NULL;
372 ir_node *bl_tgt = NULL;
375 bl_tgt = is_Bad(tgt) ? tgt : get_nodes_block(tgt);
377 edges_notify_edge_kind(src, pos, bl_tgt, bl_old, EDGE_KIND_BLOCK, irg);
378 } else if (get_irn_mode(src) == mode_X && old_tgt != NULL && is_Block(old_tgt)) {
379 /* moving a jump node from one block to another */
380 foreach_out_edge_kind_safe(old_tgt, edge, EDGE_KIND_BLOCK) {
381 ir_node *succ = get_edge_src_irn(edge);
382 int succ_pos = get_edge_src_pos(edge);
383 ir_node *block_pred = get_Block_cfgpred(succ, succ_pos);
384 if (block_pred != src)
386 edges_notify_edge_kind(succ, succ_pos, tgt, old_tgt,
387 EDGE_KIND_BLOCK, irg);
394 * Delete all in edges of a given kind from the node old.
396 * @param old the node
397 * @param kind the kind of edges to remove
398 * @param irg the irg of the old node
400 static void edges_node_deleted_kind(ir_node *old, ir_edge_kind_t kind)
403 ir_graph *irg = get_irn_irg(old);
405 if (!edges_activated_kind(irg, kind))
408 DBG((dbg, LEVEL_5, "node deleted (kind: %s): %+F\n", get_kind_str(kind), old));
410 foreach_tgt(old, i, n, kind) {
411 ir_node *old_tgt = get_n(old, i, kind);
412 edges_notify_edge_kind(old, i, NULL, old_tgt, kind, irg);
417 * A node might be revivaled by CSE. Assure its edges.
419 * @param irn the node
420 * @param kind the kind of edges to remove
421 * @param irg the irg of the old node
423 static void edges_node_revival_kind(ir_node *irn, ir_edge_kind_t kind)
425 irn_edge_info_t *info;
427 ir_graph *irg = get_irn_irg(irn);
429 if (!edges_activated_kind(irg, kind))
432 info = get_irn_edge_info(irn, kind);
433 if (info->edges_built)
436 DBG((dbg, LEVEL_5, "node revivaled (kind: %s): %+F\n", get_kind_str(kind), irn));
438 foreach_tgt(irn, i, n, kind) {
439 ir_node *tgt = get_n(irn, i, kind);
440 edges_notify_edge_kind(irn, i, tgt, NULL, kind, irg);
442 info->edges_built = 1;
445 typedef struct build_walker {
448 unsigned problem_found;
452 * Post-Walker: notify all edges
454 static void build_edges_walker(ir_node *irn, void *data)
456 build_walker *w = (build_walker*)data;
458 ir_edge_kind_t kind = w->kind;
459 ir_graph *irg = get_irn_irg(irn);
461 foreach_tgt(irn, i, n, kind) {
462 ir_node *pred = get_n(irn, i, kind);
463 edges_notify_edge_kind(irn, i, pred, NULL, kind, irg);
465 get_irn_edge_info(irn, kind)->edges_built = 1;
469 * Pre-Walker: initializes the list-heads and set the out-count
472 static void init_lh_walker(ir_node *irn, void *data)
474 build_walker *w = (build_walker*)data;
475 ir_edge_kind_t kind = w->kind;
476 list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
477 INIT_LIST_HEAD(head);
478 get_irn_edge_info(irn, kind)->edges_built = 0;
479 get_irn_edge_info(irn, kind)->out_count = 0;
483 * Pre-Walker: initializes the list-heads and set the out-count
486 * Additionally touches DEP nodes, as they might be DEAD.
487 * THIS IS UGLY, but I don't find a better way until we
489 * a) ensure that dead nodes are not used as input
490 * b) it might be sufficient to add those stupid NO_REG nodes
493 static void init_lh_walker_dep(ir_node *irn, void *data)
495 build_walker *w = (build_walker*)data;
496 ir_edge_kind_t kind = w->kind;
497 list_head *head = &get_irn_edge_info(irn, kind)->outs_head;
500 INIT_LIST_HEAD(head);
501 get_irn_edge_info(irn, kind)->edges_built = 0;
502 get_irn_edge_info(irn, kind)->out_count = 0;
504 for (i = get_irn_deps(irn) - 1; i >= 0; --i) {
505 ir_node *dep = get_irn_dep(irn, i);
507 head = &get_irn_edge_info(dep, kind)->outs_head;
509 INIT_LIST_HEAD(head);
510 get_irn_edge_info(dep, kind)->edges_built = 0;
511 get_irn_edge_info(dep, kind)->out_count = 0;
515 typedef struct visitor_info_t {
516 irg_walk_func *visit;
521 * Visitor: initializes the list-heads and set the out-count
522 * of all nodes to 0 of nodes that are not seen so far.
524 static void visitor(ir_node *irn, void *data)
526 visitor_info_t *info = (visitor_info_t*)data;
530 if (!is_Block(irn) && is_Deleted(get_nodes_block(irn)))
533 if (!irn_visited_else_mark(irn)) {
534 info->visit(irn, info->data);
538 void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind)
541 * Build the initial edge set.
542 * Beware, this is not a simple task because it suffers from two
544 * - the anchor set allows access to Nodes that may not be reachable from
546 * - the identities add nodes to the "root set" that are not yet reachable
547 * from End. However, after some transformations, the CSE may revival these
550 * These problems can be fixed using different strategies:
551 * - Add an age flag to every node. Whenever the edge of a node is older
552 * then the current edge, invalidate the edges of this node.
553 * While this would help for revivaled nodes, it increases memory and runtime.
554 * - Delete the identities set.
555 * Solves the revival problem, but may increase the memory consumption, as
556 * nodes cannot be revivaled at all.
557 * - Manually iterate over the identities root set. This did not consume more memory
558 * but increase the computation time because the |identities| >= |V|
560 * Currently, we use the last option.
562 struct build_walker w;
563 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
564 visitor_info_t visit;
570 assert(!info->activated);
573 edges_init_graph_kind(irg, kind);
574 if (kind == EDGE_KIND_DEP) {
575 irg_walk_anchors(irg, init_lh_walker_dep, NULL, &w);
576 /* Argh: Dep nodes might be dead, so we MUST visit identities first */
577 visit.visit = init_lh_walker_dep;
578 visit_all_identities(irg, visitor, &visit);
579 irg_walk_anchors(irg, NULL, build_edges_walker, &w);
581 visit.visit = init_lh_walker;
582 visit_all_identities(irg, visitor, &visit);
583 irg_walk_anchors(irg, init_lh_walker, build_edges_walker, &w);
587 void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind)
589 irg_edge_info_t *info = get_irg_edge_info(irg, kind);
592 if (info->allocated) {
593 obstack_free(&info->edges_obst, NULL);
594 ir_edgeset_destroy(&info->edges);
597 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES);
600 int (edges_activated_kind)(const ir_graph *irg, ir_edge_kind_t kind)
602 return edges_activated_kind_(irg, kind);
605 void edges_reroute_kind(ir_node *from, ir_node *to, ir_edge_kind_t kind)
607 ir_graph *irg = get_irn_irg(from);
608 set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
610 if (set_edge && edges_activated_kind(irg, kind)) {
611 struct list_head *head = &get_irn_edge_info(from, kind)->outs_head;
613 DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
615 while (head != head->next) {
616 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
617 assert(edge->pos >= -1);
618 set_edge(edge->src, edge->pos, to);
623 void edges_reroute_except(ir_node *from, ir_node *to, ir_node *exception)
625 foreach_out_edge_safe(from, edge) {
626 ir_node *src = get_edge_src_irn(edge);
627 if (src == exception)
629 set_irn_n(src, edge->pos, to);
633 static void verify_set_presence(ir_node *irn, void *data)
635 build_walker *w = (build_walker*)data;
636 ir_graph *irg = get_irn_irg(irn);
637 ir_edgeset_t *edges = &get_irg_edge_info(irg, w->kind)->edges;
640 foreach_tgt(irn, i, n, w->kind) {
646 e = ir_edgeset_find(edges, &templ);
650 w->problem_found = 1;
655 static void verify_list_presence(ir_node *irn, void *data)
657 build_walker *w = (build_walker*)data;
659 bitset_set(w->reachable, get_irn_idx(irn));
661 /* check list heads */
662 verify_list_head(irn, w->kind);
664 foreach_out_edge_kind(irn, e, w->kind) {
667 if (w->kind == EDGE_KIND_NORMAL && get_irn_arity(e->src) <= e->pos) {
668 w->problem_found = 1;
672 tgt = get_n(e->src, e->pos, w->kind);
675 w->problem_found = 1;
680 int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind)
682 struct build_walker w;
683 ir_edgeset_t *edges = &get_irg_edge_info(irg, kind)->edges;
685 ir_edgeset_iterator_t iter;
688 w.reachable = bitset_alloca(get_irg_last_idx(irg));
691 /* Clear the present bit in all edges available. */
692 foreach_ir_edgeset(edges, e, iter) {
696 irg_walk_graph(irg, verify_set_presence, verify_list_presence, &w);
699 * Dump all edges which are not invalid and not present.
700 * These edges are superfluous and their presence in the
703 foreach_ir_edgeset(edges, e, iter) {
704 if (! e->invalid && ! e->present && bitset_is_set(w.reachable, get_irn_idx(e->src))) {
706 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d is superfluous\n", edge_get_id(e), e->src, e->pos);
710 return w.problem_found;
713 #define IGNORE_NODE(irn) (is_Bad((irn)) || is_Block((irn)))
716 * Clear link field of all nodes.
718 static void clear_links(ir_node *irn, void *env)
724 if (IGNORE_NODE(irn)) {
725 set_irn_link(irn, NULL);
729 irg = get_irn_irg(irn);
730 bs = bitset_malloc(get_irg_last_idx(irg));
731 set_irn_link(irn, bs);
735 * Increases count (stored in link field) for all operands of a node.
737 static void count_user(ir_node *irn, void *env)
743 first = is_Block(irn) ? 0 : -1;
744 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
745 ir_node *op = get_irn_n(irn, i);
746 bitset_t *bs = (bitset_t*)get_irn_link(op);
749 bitset_set(bs, get_irn_idx(irn));
754 * Verifies if collected count, number of edges in list and stored edge count are in sync.
756 static void verify_edge_counter(ir_node *irn, void *env)
758 build_walker *w = (build_walker*)env;
759 if (IGNORE_NODE(irn))
762 bitset_t *bs = (bitset_t*)get_irn_link(irn);
764 int edge_cnt = get_irn_edge_info(irn, EDGE_KIND_NORMAL)->out_count;
765 const struct list_head *head
766 = &get_irn_edge_info(irn, EDGE_KIND_NORMAL)->outs_head;
768 /* We can iterate safely here, list heads have already been verified. */
769 const struct list_head *pos;
770 list_for_each(pos, head) {
774 /* check all nodes that reference us and count edges that point number
775 * of ins that actually point to us */
776 ir_graph *irg = get_irn_irg(irn);
778 bitset_foreach(bs, idx) {
780 ir_node *src = get_idx_irn(irg, idx);
782 arity = get_irn_arity(src);
783 for (i = 0; i < arity; ++i) {
784 ir_node *in = get_irn_n(src, i);
790 if (edge_cnt != list_cnt) {
791 w->problem_found = 1;
792 ir_fprintf(stderr, "Edge Verifier: edge count is %d, but %d edge(s) are recorded in list at %+F\n",
793 edge_cnt, list_cnt, irn);
796 if (ref_cnt != list_cnt) {
797 w->problem_found = 1;
798 ir_fprintf(stderr, "Edge Verifier: %+F reachable by %d node(s), but the list contains %d edge(s)\n",
799 irn, ref_cnt, list_cnt);
805 int edges_verify(ir_graph *irg)
807 struct build_walker w;
808 int problem_found = 0;
810 /* verify normal edges only */
811 problem_found = edges_verify_kind(irg, EDGE_KIND_NORMAL);
813 w.kind = EDGE_KIND_NORMAL;
817 irg_walk_anchors(irg, clear_links, count_user, &w);
818 irg_walk_anchors(irg, NULL, verify_edge_counter, &w);
820 return problem_found ? 1 : w.problem_found;
823 typedef struct pass_t {
824 ir_graph_pass_t pass;
825 unsigned assert_on_problem;
829 * Wrapper to edges_verify to be run as an ir_graph pass.
831 static int edges_verify_wrapper(ir_graph *irg, void *context)
833 pass_t *pass = (pass_t*)context;
834 int problems_found = edges_verify(irg);
835 /* do NOT rerun the pass if verify is ok :-) */
836 assert(problems_found && pass->assert_on_problem);
840 ir_graph_pass_t *irg_verify_edges_pass(const char *name, unsigned assert_on_problem)
842 pass_t *pass = XMALLOCZ(pass_t);
844 def_graph_pass_constructor(
845 &pass->pass, name ? name : "edges_verify", edges_verify_wrapper);
847 /* neither dump nor verify */
848 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
849 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
851 pass->assert_on_problem = assert_on_problem;
855 void init_edges(void)
857 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
860 void edges_init_dbg(int do_dbg)
865 void edges_activate(ir_graph *irg)
867 edges_activate_kind(irg, EDGE_KIND_NORMAL);
868 edges_activate_kind(irg, EDGE_KIND_BLOCK);
869 edges_activate_kind(irg, EDGE_KIND_DEP);
872 void edges_deactivate(ir_graph *irg)
874 edges_deactivate_kind(irg, EDGE_KIND_DEP);
875 edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
876 edges_deactivate_kind(irg, EDGE_KIND_NORMAL);
879 void assure_edges(ir_graph *irg)
881 assure_edges_kind(irg, EDGE_KIND_BLOCK);
882 assure_edges_kind(irg, EDGE_KIND_NORMAL);
883 assure_edges_kind(irg, EDGE_KIND_DEP);
884 add_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES);
887 void assure_edges_kind(ir_graph *irg, ir_edge_kind_t kind)
889 if (!edges_activated_kind(irg, kind))
890 edges_activate_kind(irg, kind);
893 void edges_node_deleted(ir_node *irn)
895 edges_node_deleted_kind(irn, EDGE_KIND_NORMAL);
896 edges_node_deleted_kind(irn, EDGE_KIND_BLOCK);
897 edges_node_deleted_kind(irn, EDGE_KIND_DEP);
900 void edges_node_revival(ir_node *irn)
902 edges_node_revival_kind(irn, EDGE_KIND_NORMAL);
903 edges_node_revival_kind(irn, EDGE_KIND_BLOCK);
906 const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind)
908 return get_irn_out_edge_first_kind_(irn, kind);
911 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last)
913 return get_irn_out_edge_next_(irn, last);
916 ir_node *(get_edge_src_irn)(const ir_edge_t *edge)
918 return get_edge_src_irn_(edge);
921 int (get_edge_src_pos)(const ir_edge_t *edge)
923 return get_edge_src_pos_(edge);
926 int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind)
928 return get_irn_n_edges_kind_(irn, kind);
931 static void irg_walk_edges2(ir_node *node, irg_walk_func *pre,
932 irg_walk_func *post, void *env)
934 if (irn_visited_else_mark(node))
940 foreach_out_edge_kind_safe(node, edge, EDGE_KIND_NORMAL) {
941 /* find the corresponding successor block. */
942 ir_node *pred = get_edge_src_irn(edge);
943 irg_walk_edges2(pred, pre, post, env);
950 void irg_walk_edges(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
953 ir_graph *irg = get_irn_irg(node);
955 assert(edges_activated(irg));
956 assert(is_Block(node));
958 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
960 inc_irg_visited(irg);
961 irg_walk_edges2(node, pre, post, env);
963 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
966 static void irg_block_edges_walk2(ir_node *bl, irg_walk_func *pre,
967 irg_walk_func *post, void *env)
969 if (!Block_block_visited(bl)) {
970 mark_Block_block_visited(bl);
975 foreach_out_edge_kind_safe(bl, edge, EDGE_KIND_BLOCK) {
976 /* find the corresponding successor block. */
977 ir_node *pred = get_edge_src_irn(edge);
978 irg_block_edges_walk2(pred, pre, post, env);
986 void irg_block_edges_walk(ir_node *node, irg_walk_func *pre,
987 irg_walk_func *post, void *env)
989 ir_graph *irg = get_irn_irg(node);
991 assert(edges_activated(irg));
992 assert(is_Block(node));
994 ir_reserve_resources(irg, IR_RESOURCE_BLOCK_VISITED);
996 inc_irg_block_visited(irg);
997 irg_block_edges_walk2(node, pre, post, env);
999 ir_free_resources(irg, IR_RESOURCE_BLOCK_VISITED);