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.
36 #include "iredgekinds.h"
37 #include "iredges_t.h"
46 #include "iredgeset.h"
51 #define HashSet ir_edgeset_t
52 #define HashSetIterator ir_edgeset_iterator_t
53 #define ValueType ir_edge_t*
54 #define NullValue NULL
55 #define DeletedValue ((ir_edge_t*)-1)
56 #define Hash(this,key) (HASH_PTR(key->src) ^ (key->pos * 40013))
57 #define KeysEqual(this,key1,key2) ((key1->src) == (key2->src) && (key1->pos == key2->pos))
58 #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
60 #define hashset_init ir_edgeset_init
61 #define hashset_init_size ir_edgeset_init_size
62 #define hashset_destroy ir_edgeset_destroy
63 #define hashset_insert ir_edgeset_insert
64 #define hashset_remove ir_edgeset_remove
65 #define hashset_find ir_edgeset_find
66 #define hashset_size ir_edgeset_size
67 #define hashset_iterator_init ir_edgeset_iterator_init
68 #define hashset_iterator_next ir_edgeset_iterator_next
69 #define hashset_remove_iterator ir_edgeset_remove_iterator
74 * A function that allows for setting an edge.
75 * This abstraction is necessary since different edge kind have
76 * different methods of setting edges.
78 typedef void (set_edge_func_t)(ir_node *src, int pos, ir_node *tgt);
80 typedef int (get_edge_src_arity_func_t)(const ir_node *src);
82 typedef ir_node *(get_edge_src_n_func_t)(const ir_node *src, int pos);
85 * Additional data for an edge kind.
88 const char *name; /**< name of this edge kind */
89 set_edge_func_t *set_edge; /**< the set_edge function */
90 int first_idx; /**< index of the first possible edge */
91 get_edge_src_arity_func_t *get_arity; /**< the get_arity function */
92 get_edge_src_n_func_t *get_n; /**< the get_n function */
93 } ir_edge_kind_info_t;
96 * Get the predecessor block.
98 static ir_node *get_block_n(const ir_node *irn, int pos) {
100 return get_Block_cfgpred_block(irn, pos);
105 static const ir_edge_kind_info_t edge_kind_info[EDGE_KIND_LAST] = {
106 { "normal" , set_irn_n, -1, get_irn_arity, get_irn_n },
107 { "block succs", NULL, 0, get_irn_arity, get_block_n },
108 { "dependency", set_irn_dep, 0, get_irn_deps, get_irn_dep }
111 #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)
112 #define get_n(irn, pos, kind) (edge_kind_info[kind].get_n(irn, pos))
113 #define get_kind_str(kind) (edge_kind_info[kind].name)
115 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
118 * This flag is set to 1, if the edges get initialized for an irg.
119 * Then register additional data is forbidden.
121 static int edges_used = 0;
124 * Summed size of all users private data
127 static int edges_private_size = 0;
128 #define EDGE_SIZE (sizeof(ir_edge_t) + edges_private_size)
131 * If set to 1, the list heads are checked every time an edge is changed.
133 static int edges_dbg = 0;
136 /* a static variable holding the last number assigned to a new edge */
137 static long last_edge_num = -1;
140 static INLINE long edge_get_id(const ir_edge_t *e) {
143 #else /* DEBUG_libfirm */
145 #endif /* DEBUG_libfirm */
149 * Announce to reserve extra space for each edge to be allocated.
151 * @param n: Size of the space to reserve
153 * @return Offset at which the private data will begin
155 * Several users can reserve extra space for private usage.
156 * Each user has to remember his given offset and the size of his private data.
157 * To be called before FIRM is initialized.
159 int edges_register_private_data(size_t n) {
160 int res = edges_private_size;
162 assert(!edges_used && "you cannot register private edge data, if edges have been initialized");
164 edges_private_size += n;
169 * Reset the user's private data at offset 'offset'
170 * The user has to remember his offset and the size of his data!
171 * Caution: Using wrong values here can destroy other users private data!
173 void edges_reset_private_data(ir_graph *irg, int offset, size_t size) {
174 irg_edge_info_t *info = _get_irg_edge_info(irg, EDGE_KIND_NORMAL);
176 ir_edgeset_iterator_t iter;
178 foreach_ir_edgeset(&info->edges, edge, iter) {
179 memset(edge + sizeof(*edge) + offset, 0, size);
183 #define TIMES37(x) (((x) << 5) + ((x) << 2) + (x))
185 #define get_irn_out_list_head(irn) (&get_irn_out_info(irn)->outs)
187 #define edge_hash(edge) (TIMES37((edge)->pos) + HASH_PTR((edge)->src))
190 * Initialize the out information for a graph.
191 * @note Dead node elimination can call this on an already initialized graph.
193 void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind) {
194 if (edges_activated_kind(irg, kind)) {
195 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
196 size_t amount = irg->estimated_node_count * 2;
199 if(info->allocated) {
200 amount = ir_edgeset_size(&info->edges);
201 ir_edgeset_destroy(&info->edges);
202 obstack_free(&info->edges_obst, NULL);
204 obstack_init(&info->edges_obst);
205 ir_edgeset_init_size(&info->edges, amount);
211 * Get the edge object of an outgoing edge at a node.
212 * @param irg The graph, the node is in.
213 * @param src The node at which the edge originates.
214 * @param pos The position of the edge.
215 * @return The corresponding edge object or NULL,
216 * if no such edge exists.
218 const ir_edge_t *get_irn_edge_kind(ir_graph *irg, const ir_node *src, int pos, ir_edge_kind_t kind)
220 if (edges_activated_kind(irg, kind)) {
221 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
224 key.src = (ir_node *)src;
227 return ir_edgeset_find(&info->edges, &key);
234 * Get the edge object of an outgoing edge at a node.
235 * Looks for an edge for all kinds.
237 const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos) {
238 const ir_edge_t *edge;
239 if((edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_NORMAL)) == NULL)
240 edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_BLOCK);
245 * Change the out count
247 * @param tgt the edge target
248 * @param kind the kind of the edge
250 static INLINE void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs) {
251 irn_edge_info_t *info = _get_irn_edge_info(tgt, kind);
252 info->out_count += ofs;
255 assert(info->out_count >= 0);
256 if (info->out_count == 0 && kind == EDGE_KIND_NORMAL) {
257 /* tgt lost it's last user */
260 for (i = get_irn_arity(tgt) - 1; i >= -1; --i) {
261 ir_node *prev = get_irn_n(tgt, i);
263 edges_notify_edge(tgt, i, NULL, prev, current_ir_graph);
265 for (i = get_irn_deps(tgt) - 1; i >= 0; --i) {
266 ir_node *prev = get_irn_dep(tgt, i);
268 edges_notify_edge_kind(tgt, i, NULL, prev, EDGE_KIND_DEP, current_ir_graph);
276 * Verify the edge list of a node, ie. ensure it's a loop:
277 * head -> e_1 -> ... -> e_n -> head
279 static INLINE void vrfy_list_head(ir_node *irn, ir_edge_kind_t kind) {
282 pset *lh_set = pset_new_ptr(16);
283 const struct list_head *head = _get_irn_outs_head(irn, kind);
284 const struct list_head *pos;
286 list_for_each(pos, head) {
287 if (pset_find_ptr(lh_set, pos)) {
288 const ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
290 ir_fprintf(stderr, "EDGE Verifier: edge list broken (self loop not to head) for %+F:\n", irn);
291 fprintf(stderr, "- at list entry %d\n", num);
293 fprintf(stderr, "- edge(%ld) is invalid\n", edge_get_id(edge));
295 ir_fprintf(stderr, "- edge(%ld) %+F(%d)\n", edge_get_id(edge), edge->src, edge->pos);
300 pset_insert_ptr(lh_set, pos);
308 /* The edge from (src, pos) -> old_tgt is redirected to tgt */
309 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
310 ir_node *old_tgt, ir_edge_kind_t kind,
313 const char *msg = "";
314 irg_edge_info_t *info;
319 assert(edges_activated_kind(irg, kind));
322 * Only do something, if the old and new target differ.
327 info = _get_irg_edge_info(irg, kind);
328 edges = &info->edges;
330 /* Initialize the edge template to search in the set. */
335 * If the target is NULL, the edge shall be deleted.
338 /* search the edge in the set. */
339 edge = ir_edgeset_find(edges, &templ);
341 /* mark the edge invalid if it was found */
344 list_del(&edge->list);
350 #endif /* DEBUG_libfirm */
351 edge_change_cnt(old_tgt, kind, -1);
354 /* If the edge was not found issue a warning on the debug stream */
356 msg = "edge to delete not found!\n";
361 * The target is not NULL and the old target differs
362 * from the new target, the edge shall be moved (if the
363 * old target was != NULL) or added (if the old target was
367 struct list_head *head = _get_irn_outs_head(tgt, kind);
369 assert(head->next && head->prev &&
370 "target list head must have been initialized");
372 /* If the old target is not null, the edge is moved. */
374 edge = ir_edgeset_find(edges, &templ);
375 assert(edge && "edge to redirect not found!");
376 assert(! edge->invalid && "Invalid edge encountered");
380 list_move(&edge->list, head);
381 edge_change_cnt(old_tgt, kind, -1);
384 /* The old target was null, thus, the edge is newly created. */
388 = obstack_alloc(&info->edges_obst, EDGE_SIZE);
389 memset(edge, 0, EDGE_SIZE);
393 DEBUG_ONLY(edge->src_nr = get_irn_node_nr(src));
395 new_edge = ir_edgeset_insert(edges, edge);
396 if(new_edge != edge) {
397 obstack_free(&info->edges_obst, edge);
400 assert(! edge->invalid && "Freshly inserted edge is invalid?!?");
401 assert(edge->list.next == NULL && edge->list.prev == NULL &&
402 "New edge must not have list head initialized");
405 list_add(&edge->list, head);
407 edge->edge_nr = ++last_edge_num;
408 #endif /* DEBUG_libfirm */
411 edge_change_cnt(tgt, kind, +1);
414 #ifndef DEBUG_libfirm
415 /* verify list heads */
418 vrfy_list_head(tgt, kind);
420 vrfy_list_head(old_tgt, kind);
424 DBG((dbg, LEVEL_5, "announce out edge: %+F %d-> %+F(%+F): %s\n", src, pos, tgt, old_tgt, msg));
427 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_graph *irg)
429 if (edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
430 edges_notify_edge_kind(src, pos, tgt, old_tgt, EDGE_KIND_NORMAL, irg);
433 if (edges_activated_kind(irg, EDGE_KIND_BLOCK) && is_Block(src)) {
435 /* a MacroBlock edge: ignore it here */
437 ir_node *bl_old = old_tgt ? get_nodes_block(skip_Proj(old_tgt)) : NULL;
438 ir_node *bl_tgt = NULL;
441 bl_tgt = is_Bad(tgt) ? tgt : get_nodes_block(skip_Proj(tgt));
443 edges_notify_edge_kind(src, pos, bl_tgt, bl_old, EDGE_KIND_BLOCK, irg);
449 * Delete all in edges of a given kind from the node old.
451 * @param old the node
452 * @param kind the kind of edges to remove
453 * @param irg the irg of the old node
455 static void edges_node_deleted_kind(ir_node *old, ir_edge_kind_t kind, ir_graph *irg)
459 if (!edges_activated_kind(irg, kind))
462 DBG((dbg, LEVEL_5, "node deleted (kind: %s): %+F\n", get_kind_str(kind), old));
464 foreach_tgt(old, i, n, kind) {
465 ir_node *old_tgt = get_n(old, i, kind);
466 edges_notify_edge_kind(old, i, NULL, old_tgt, kind, irg);
470 struct build_walker {
474 unsigned problem_found;
478 * Post-Walker: notify all edges
480 static void build_edges_walker(ir_node *irn, void *data) {
481 struct build_walker *w = data;
483 ir_edge_kind_t kind = w->kind;
484 ir_graph *irg = w->irg;
485 get_edge_src_n_func_t *get_n;
487 get_n = edge_kind_info[kind].get_n;
488 foreach_tgt(irn, i, n, kind) {
489 ir_node *pred = get_n(irn, i, kind);
490 edges_notify_edge_kind(irn, i, pred, NULL, kind, irg);
495 * Pre-Walker: initializes the list-heads and set the out-count
498 static void init_lh_walker(ir_node *irn, void *data) {
499 struct build_walker *w = data;
500 ir_edge_kind_t kind = w->kind;
501 list_head *head = _get_irn_outs_head(irn, kind);
502 INIT_LIST_HEAD(head);
503 _get_irn_edge_info(irn, kind)->out_count = 0;
507 * Pre-Walker: initializes the list-heads and set the out-count
510 * Additionally touches DEP nodes, as they might be DEAD.
511 * THIS IS UGLY, but I don't find a better way until we
513 * a) ensure that dead nodes are not used as input
514 * b) it might be sufficient to add those stupid NO_REG nodes
517 static void init_lh_walker_dep(ir_node *irn, void *data) {
518 struct build_walker *w = data;
519 ir_edge_kind_t kind = w->kind;
520 list_head *head = _get_irn_outs_head(irn, kind);
523 INIT_LIST_HEAD(head);
524 _get_irn_edge_info(irn, kind)->out_count = 0;
526 for (i = get_irn_deps(irn) - 1; i >= 0; --i) {
527 ir_node *dep = get_irn_dep(irn, i);
529 head = _get_irn_outs_head(dep, kind);
531 INIT_LIST_HEAD(head);
532 _get_irn_edge_info(dep, kind)->out_count = 0;
536 typedef struct visitor_info_t {
537 irg_walk_func *visit;
542 * Visitor: initializes the list-heads and set the out-count
543 * of all nodes to 0 of nodes that are not seen so far.
545 static void visitor(ir_node *irn, void *data) {
546 visitor_info_t *info = data;
548 if (!irn_visited(irn)) {
549 mark_irn_visited(irn);
550 info->visit(irn, info->data);
555 * Build the initial edge set.
556 * Beware, this is not a simple task because it suffers from two
558 * - the anchor set allows access to Nodes that may not be reachable from
560 * - the identities add nodes to the "root set" that are not yet reachable
561 * from End. However, after some transformations, the CSE may revival these
564 * These problems can be fixed using different strategies:
565 * - Add an age flag to every node. Whenever the edge of a node is older
566 * then the current edge, invalidate the edges of this node.
567 * While this would help for revivaled nodes, it increases memory and runtime.
568 * - Delete the identities set.
569 * Solves the revival problem, but may increase the memory consumption, as
570 * nodes cannot be revivaled at all.
571 * - Manually iterate over the identities root set. This did not consume more memory
572 * but increase the computation time because the |identities| >= |V|
574 * Currently, we use the last option.
576 void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind)
578 struct build_walker w;
579 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
580 visitor_info_t visit;
588 edges_init_graph_kind(irg, kind);
589 if (kind == EDGE_KIND_DEP) {
590 irg_walk_anchors(irg, init_lh_walker_dep, NULL, &w);
591 /* Argh: Dep nodes might be dead, so we MUST visit identities first */
592 visit.visit = init_lh_walker_dep;
593 visit_all_identities(irg, visitor, &visit);
594 irg_walk_anchors(irg, NULL, build_edges_walker, &w);
596 irg_walk_anchors(irg, init_lh_walker, build_edges_walker, &w);
597 visit.visit = init_lh_walker;
598 visit_all_identities(irg, visitor, &visit);
602 void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind)
604 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
607 if (info->allocated) {
608 obstack_free(&info->edges_obst, NULL);
609 ir_edgeset_destroy(&info->edges);
614 int (edges_activated_kind)(const ir_graph *irg, ir_edge_kind_t kind)
616 return _edges_activated_kind(irg, kind);
621 * Reroute all use-edges from a node to another.
622 * @param from The node whose use-edges shall be withdrawn.
623 * @param to The node to which all the use-edges of @p from shall be
625 * @param irg The graph.
627 void edges_reroute_kind(ir_node *from, ir_node *to, ir_edge_kind_t kind, ir_graph *irg)
629 set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
631 if(set_edge && edges_activated_kind(irg, kind)) {
632 struct list_head *head = _get_irn_outs_head(from, kind);
634 DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
636 while (head != head->next) {
637 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
638 assert(edge->pos >= -1);
639 set_edge(edge->src, edge->pos, to);
644 static void verify_set_presence(ir_node *irn, void *data)
646 struct build_walker *w = data;
647 ir_edgeset_t *edges = &_get_irg_edge_info(w->irg, w->kind)->edges;
650 foreach_tgt(irn, i, n, w->kind) {
656 e = ir_edgeset_find(edges, &templ);
660 w->problem_found = 1;
662 ir_fprintf(stderr, "Edge Verifier: edge %+F,%d -> %+F (kind: \"%s\") is missing\n",
663 irn, i, get_n(irn, i, w->kind), get_kind_str(w->kind));
669 static void verify_list_presence(ir_node *irn, void *data)
671 struct build_walker *w = data;
674 bitset_set(w->reachable, get_irn_idx(irn));
676 /* check list heads */
677 vrfy_list_head(irn, w->kind);
679 foreach_out_edge_kind(irn, e, w->kind) {
682 if (w->kind == EDGE_KIND_NORMAL && get_irn_arity(e->src) <= e->pos) {
683 w->problem_found = 1;
685 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F -> %+F recorded at src position %d, but src has arity %d\n",
686 edge_get_id(e), e->src, irn, e->pos, get_irn_arity(e->src));
691 tgt = get_n(e->src, e->pos, w->kind);
694 w->problem_found = 1;
696 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d (kind \"%s\") is no out edge of %+F but of %+F\n",
697 edge_get_id(e), e->src, e->pos, get_kind_str(w->kind), irn, tgt);
703 int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind)
705 struct build_walker w;
706 ir_edgeset_t *edges = &_get_irg_edge_info(irg, kind)->edges;
708 ir_edgeset_iterator_t iter;
712 w.reachable = bitset_alloca(get_irg_last_idx(irg));
715 /* Clear the present bit in all edges available. */
716 foreach_ir_edgeset(edges, e, iter) {
720 irg_walk_graph(irg, verify_set_presence, verify_list_presence, &w);
723 * Dump all edges which are not invalid and not present.
724 * These edges are superfluous and their presence in the
727 foreach_ir_edgeset(edges, e, iter) {
728 if (! e->invalid && ! e->present && bitset_is_set(w.reachable, get_irn_idx(e->src))) {
730 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d is superfluous\n", edge_get_id(e), e->src, e->pos);
734 return w.problem_found;
737 #define IGNORE_NODE(irn) (is_Bad((irn)) || is_Block((irn)))
740 * Clear link field of all nodes.
742 static void clear_links(ir_node *irn, void *env) {
743 struct build_walker *w = env;
746 if (IGNORE_NODE(irn)) {
747 set_irn_link(irn, NULL);
751 bs = bitset_malloc(get_irg_last_idx(w->irg));
752 set_irn_link(irn, bs);
756 * Increases count (stored in link field) for all operands of a node.
758 static void count_user(ir_node *irn, void *env) {
764 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
765 ir_node *op = get_irn_n(irn, i);
766 bitset_t *bs = get_irn_link(op);
769 bitset_set(bs, get_irn_idx(irn));
774 * Verifies if collected count, number of edges in list and stored edge count are in sync.
776 static void verify_edge_counter(ir_node *irn, void *env) {
777 struct build_walker *w = env;
783 const struct list_head *head;
784 const struct list_head *pos;
786 if (IGNORE_NODE(irn))
789 bs = get_irn_link(irn);
792 edge_cnt = _get_irn_edge_info(irn, EDGE_KIND_NORMAL)->out_count;
793 head = _get_irn_outs_head(irn, EDGE_KIND_NORMAL);
795 /* We can iterate safely here, list heads have already been verified. */
796 list_for_each(pos, head) {
800 /* check all nodes that reference us and count edges that point number
801 * of ins that actually point to us */
803 bitset_foreach(bs, idx) {
805 ir_node *src = get_idx_irn(w->irg, idx);
807 arity = get_irn_arity(src);
808 for (i = 0; i < arity; ++i) {
809 ir_node *in = get_irn_n(src, i);
815 if (edge_cnt != list_cnt) {
816 w->problem_found = 1;
817 ir_fprintf(stderr, "Edge Verifier: edge count is %d, but %d edge(s) are recorded in list at %+F\n",
818 edge_cnt, list_cnt, irn);
821 if (ref_cnt != list_cnt) {
822 w->problem_found = 1;
823 ir_fprintf(stderr, "Edge Verifier: %+F reachable by %d node(s), but the list contains %d edge(s)\n",
824 irn, ref_cnt, list_cnt);
826 /* Matze: buggy if a node has multiple ins pointing at irn */
828 list_for_each(pos, head) {
829 ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
830 bitset_flip(bs, get_irn_idx(edge->src));
833 if (ref_cnt < list_cnt)
834 fprintf(stderr," following nodes are recorded in list, but not as user:\n");
836 fprintf(stderr," following nodes are user, but not recorded in list:\n");
839 bitset_foreach(bs, idx) {
840 ir_node *src = get_idx_irn(w->irg, idx);
841 ir_fprintf(stderr, " %+F", src);
843 fprintf(stderr, "\n");
851 * Verifies the out edges of an irg.
853 int edges_verify(ir_graph *irg) {
854 struct build_walker w;
855 int problem_found = 0;
857 /* verify normal edges only */
858 problem_found = edges_verify_kind(irg, EDGE_KIND_NORMAL);
861 w.kind = EDGE_KIND_NORMAL;
865 irg_walk_anchors(irg, clear_links, count_user, &w);
866 irg_walk_anchors(irg, NULL, verify_edge_counter, &w);
868 return problem_found ? 1 : w.problem_found;
871 void init_edges(void) {
872 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
873 /* firm_dbg_set_mask(dbg, -1); */
876 void edges_init_dbg(int do_dbg) {
880 void edges_activate(ir_graph *irg) {
881 edges_activate_kind(irg, EDGE_KIND_NORMAL);
882 edges_activate_kind(irg, EDGE_KIND_BLOCK);
883 if (get_irg_phase_state(irg) == phase_backend)
884 edges_activate_kind(irg, EDGE_KIND_DEP);
887 void edges_deactivate(ir_graph *irg) {
888 if (get_irg_phase_state(irg) == phase_backend)
889 edges_deactivate_kind(irg, EDGE_KIND_DEP);
890 edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
891 edges_deactivate_kind(irg, EDGE_KIND_NORMAL);
894 int edges_assure(ir_graph *irg) {
895 int activated = edges_activated(irg);
903 int edges_assure_kind(ir_graph *irg, ir_edge_kind_t kind) {
904 int activated = edges_activated_kind(irg, kind);
907 edges_activate_kind(irg, kind);
912 void edges_node_deleted(ir_node *irn, ir_graph *irg) {
913 edges_node_deleted_kind(irn, EDGE_KIND_NORMAL, irg);
914 edges_node_deleted_kind(irn, EDGE_KIND_BLOCK, irg);
918 const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind) {
919 return _get_irn_out_edge_first_kind(irn, kind);
922 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last) {
923 return _get_irn_out_edge_next(irn, last);
926 ir_node *(get_edge_src_irn)(const ir_edge_t *edge) {
927 return _get_edge_src_irn(edge);
930 int (get_edge_src_pos)(const ir_edge_t *edge) {
931 return _get_edge_src_pos(edge);
934 int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind) {
935 return _get_irn_n_edges_kind(irn, kind);
938 void dump_all_out_edges(ir_node *irn) {
940 for (i = 0; i < EDGE_KIND_LAST; ++i) {
941 const ir_edge_t *edge;
943 printf("kind \"%s\"\n", get_kind_str(i));
944 foreach_out_edge_kind(irn, edge, i) {
945 ir_printf("\t%+F(%d)\n", edge->src, edge->pos);
950 static void irg_block_edges_walk2(ir_node *bl,
951 irg_walk_func *pre, irg_walk_func *post,
953 const ir_edge_t *edge, *next;
955 if (!Block_block_visited(bl)) {
956 mark_Block_block_visited(bl);
961 foreach_out_edge_kind_safe(bl, edge, next, EDGE_KIND_BLOCK) {
962 /* find the corresponding successor block. */
963 ir_node *pred = get_edge_src_irn(edge);
964 irg_block_edges_walk2(pred, pre, post, env);
972 void irg_block_edges_walk(ir_node *node,
973 irg_walk_func *pre, irg_walk_func *post,
976 assert(edges_activated(current_ir_graph));
977 assert(is_Block(node));
979 ir_reserve_resources(current_ir_graph, IR_RESOURCE_BLOCK_VISITED);
981 inc_irg_block_visited(current_ir_graph);
982 irg_block_edges_walk2(node, pre, post, env);
984 ir_free_resources(current_ir_graph, IR_RESOURCE_BLOCK_VISITED);