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"
47 #include "iredgeset.h"
52 #define HashSet ir_edgeset_t
53 #define HashSetIterator ir_edgeset_iterator_t
54 #define ValueType ir_edge_t*
55 #define NullValue NULL
56 #define DeletedValue ((ir_edge_t*)-1)
57 #define Hash(this,key) (HASH_PTR(key->src) ^ (key->pos * 40013))
58 #define KeysEqual(this,key1,key2) ((key1->src) == (key2->src) && (key1->pos == key2->pos))
59 #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
61 #define hashset_init ir_edgeset_init
62 #define hashset_init_size ir_edgeset_init_size
63 #define hashset_destroy ir_edgeset_destroy
64 #define hashset_insert ir_edgeset_insert
65 #define hashset_remove ir_edgeset_remove
66 #define hashset_find ir_edgeset_find
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);
81 typedef int (get_edge_src_arity_func_t)(const ir_node *src);
83 typedef ir_node *(get_edge_src_n_func_t)(const ir_node *src, int pos);
86 * Additional data for an edge kind.
89 const char *name; /**< name of this edge kind */
90 set_edge_func_t *set_edge; /**< the set_edge function */
91 int first_idx; /**< index of the first possible edge */
92 get_edge_src_arity_func_t *get_arity; /**< the get_arity function */
93 get_edge_src_n_func_t *get_n; /**< the get_n function */
94 } ir_edge_kind_info_t;
97 * Get the predecessor block.
99 static ir_node *get_block_n(const ir_node *irn, int pos) {
101 return get_Block_cfgpred_block(irn, pos);
106 static const ir_edge_kind_info_t edge_kind_info[EDGE_KIND_LAST] = {
107 { "normal" , set_irn_n, -1, get_irn_arity, get_irn_n },
108 { "block succs", NULL, 0, get_irn_arity, get_block_n },
109 { "dependency", set_irn_dep, 0, get_irn_deps, get_irn_dep }
112 #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)
113 #define get_n(irn, pos, kind) (edge_kind_info[kind].get_n(irn, pos))
114 #define get_kind_str(kind) (edge_kind_info[kind].name)
116 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
119 * This flag is set to 1, if the edges get initialized for an irg.
120 * Then register additional data is forbidden.
122 static int edges_used = 0;
125 * Summed size of all users private data
128 static int edges_private_size = 0;
129 #define EDGE_SIZE (sizeof(ir_edge_t) + edges_private_size)
132 * If set to 1, the list heads are checked every time an edge is changed.
134 static int edges_dbg = 0;
137 /* a static variable holding the last number assigned to a new edge */
138 static long last_edge_num = -1;
141 static INLINE long edge_get_id(const ir_edge_t *e) {
144 #else /* DEBUG_libfirm */
146 #endif /* DEBUG_libfirm */
150 * Announce to reserve extra space for each edge to be allocated.
152 * @param n: Size of the space to reserve
154 * @return Offset at which the private data will begin
156 * Several users can reserve extra space for private usage.
157 * Each user has to remember his given offset and the size of his private data.
158 * To be called before FIRM is initialized.
160 int edges_register_private_data(size_t n) {
161 int res = edges_private_size;
163 assert(!edges_used && "you cannot register private edge data, if edges have been initialized");
165 edges_private_size += n;
170 * Reset the user's private data at offset 'offset'
171 * The user has to remember his offset and the size of his data!
172 * Caution: Using wrong values here can destroy other users private data!
174 void edges_reset_private_data(ir_graph *irg, int offset, size_t size) {
175 irg_edge_info_t *info = _get_irg_edge_info(irg, EDGE_KIND_NORMAL);
177 ir_edgeset_iterator_t iter;
179 foreach_ir_edgeset(&info->edges, edge, iter) {
180 memset(edge + sizeof(*edge) + offset, 0, size);
184 #define TIMES37(x) (((x) << 5) + ((x) << 2) + (x))
186 #define get_irn_out_list_head(irn) (&get_irn_out_info(irn)->outs)
188 #define edge_hash(edge) (TIMES37((edge)->pos) + HASH_PTR((edge)->src))
191 * Initialize the out information for a graph.
192 * @note Dead node elimination can call this on an already initialized graph.
194 void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind) {
195 if (edges_activated_kind(irg, kind)) {
196 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
197 size_t amount = irg->estimated_node_count * 2;
200 if(info->allocated) {
201 amount = ir_edgeset_size(&info->edges);
202 ir_edgeset_destroy(&info->edges);
203 obstack_free(&info->edges_obst, NULL);
205 obstack_init(&info->edges_obst);
206 ir_edgeset_init_size(&info->edges, amount);
212 * Get the edge object of an outgoing edge at a node.
213 * @param irg The graph, the node is in.
214 * @param src The node at which the edge originates.
215 * @param pos The position of the edge.
216 * @return The corresponding edge object or NULL,
217 * if no such edge exists.
219 const ir_edge_t *get_irn_edge_kind(ir_graph *irg, const ir_node *src, int pos, ir_edge_kind_t kind)
221 if (edges_activated_kind(irg, kind)) {
222 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
225 key.src = (ir_node *)src;
228 return ir_edgeset_find(&info->edges, &key);
235 * Get the edge object of an outgoing edge at a node.
236 * Looks for an edge for all kinds.
238 const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos) {
239 const ir_edge_t *edge;
240 if((edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_NORMAL)) == NULL)
241 edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_BLOCK);
246 * Change the out count
248 * @param tgt the edge target
249 * @param kind the kind of the edge
251 static INLINE void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs) {
252 irn_edge_info_t *info = _get_irn_edge_info(tgt, kind);
253 info->out_count += ofs;
256 assert(info->out_count >= 0);
257 if (info->out_count == 0 && kind == EDGE_KIND_NORMAL) {
258 /* tgt lost it's last user */
261 for (i = get_irn_arity(tgt) - 1; i >= -1; --i) {
262 ir_node *prev = get_irn_n(tgt, i);
264 edges_notify_edge(tgt, i, NULL, prev, current_ir_graph);
266 for (i = get_irn_deps(tgt) - 1; i >= 0; --i) {
267 ir_node *prev = get_irn_dep(tgt, i);
269 edges_notify_edge_kind(tgt, i, NULL, prev, EDGE_KIND_DEP, current_ir_graph);
277 * Verify the edge list of a node, ie. ensure it's a loop:
278 * head -> e_1 -> ... -> e_n -> head
280 static INLINE void vrfy_list_head(ir_node *irn, ir_edge_kind_t kind) {
283 pset *lh_set = pset_new_ptr(16);
284 const struct list_head *head = _get_irn_outs_head(irn, kind);
285 const struct list_head *pos;
287 list_for_each(pos, head) {
288 if (pset_find_ptr(lh_set, pos)) {
289 const ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
291 ir_fprintf(stderr, "EDGE Verifier: edge list broken (self loop not to head) for %+F:\n", irn);
292 fprintf(stderr, "- at list entry %d\n", num);
294 fprintf(stderr, "- edge(%ld) is invalid\n", edge_get_id(edge));
296 ir_fprintf(stderr, "- edge(%ld) %+F(%d)\n", edge_get_id(edge), edge->src, edge->pos);
301 pset_insert_ptr(lh_set, pos);
309 /* The edge from (src, pos) -> old_tgt is redirected to tgt */
310 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
311 ir_node *old_tgt, ir_edge_kind_t kind,
314 const char *msg = "";
315 irg_edge_info_t *info;
320 assert(edges_activated_kind(irg, kind));
323 * Only do something, if the old and new target differ.
328 info = _get_irg_edge_info(irg, kind);
329 edges = &info->edges;
331 /* Initialize the edge template to search in the set. */
336 * If the target is NULL, the edge shall be deleted.
339 /* search the edge in the set. */
340 edge = ir_edgeset_find(edges, &templ);
342 /* mark the edge invalid if it was found */
345 list_del(&edge->list);
351 #endif /* DEBUG_libfirm */
352 edge_change_cnt(old_tgt, kind, -1);
355 /* If the edge was not found issue a warning on the debug stream */
357 msg = "edge to delete not found!\n";
362 * The target is not NULL and the old target differs
363 * from the new target, the edge shall be moved (if the
364 * old target was != NULL) or added (if the old target was
368 struct list_head *head = _get_irn_outs_head(tgt, kind);
370 assert(head->next && head->prev &&
371 "target list head must have been initialized");
373 /* If the old target is not null, the edge is moved. */
375 edge = ir_edgeset_find(edges, &templ);
376 assert(edge && "edge to redirect not found!");
377 assert(! edge->invalid && "Invalid edge encountered");
381 list_move(&edge->list, head);
382 edge_change_cnt(old_tgt, kind, -1);
385 /* The old target was null, thus, the edge is newly created. */
389 = obstack_alloc(&info->edges_obst, EDGE_SIZE);
390 memset(edge, 0, EDGE_SIZE);
394 DEBUG_ONLY(edge->src_nr = get_irn_node_nr(src));
396 new_edge = ir_edgeset_insert(edges, edge);
397 if(new_edge != edge) {
398 obstack_free(&info->edges_obst, edge);
401 assert(! edge->invalid && "Freshly inserted edge is invalid?!?");
402 assert(edge->list.next == NULL && edge->list.prev == NULL &&
403 "New edge must not have list head initialized");
406 list_add(&edge->list, head);
408 edge->edge_nr = ++last_edge_num;
409 #endif /* DEBUG_libfirm */
412 edge_change_cnt(tgt, kind, +1);
415 #ifndef DEBUG_libfirm
416 /* verify list heads */
419 vrfy_list_head(tgt, kind);
421 vrfy_list_head(old_tgt, kind);
425 DBG((dbg, LEVEL_5, "announce out edge: %+F %d-> %+F(%+F): %s\n", src, pos, tgt, old_tgt, msg));
428 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_graph *irg)
430 if (edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
431 edges_notify_edge_kind(src, pos, tgt, old_tgt, EDGE_KIND_NORMAL, irg);
434 if (edges_activated_kind(irg, EDGE_KIND_BLOCK) && is_Block(src)) {
436 /* a MacroBlock edge: ignore it here */
438 ir_node *bl_old = old_tgt ? get_nodes_block(skip_Proj(old_tgt)) : NULL;
439 ir_node *bl_tgt = NULL;
442 bl_tgt = is_Bad(tgt) ? tgt : get_nodes_block(skip_Proj(tgt));
444 edges_notify_edge_kind(src, pos, bl_tgt, bl_old, EDGE_KIND_BLOCK, irg);
450 * Delete all in edges of a given kind from the node old.
452 * @param old the node
453 * @param kind the kind of edges to remove
454 * @param irg the irg of the old node
456 static void edges_node_deleted_kind(ir_node *old, ir_edge_kind_t kind, ir_graph *irg)
460 if (!edges_activated_kind(irg, kind))
463 DBG((dbg, LEVEL_5, "node deleted (kind: %s): %+F\n", get_kind_str(kind), old));
465 foreach_tgt(old, i, n, kind) {
466 ir_node *old_tgt = get_n(old, i, kind);
467 edges_notify_edge_kind(old, i, NULL, old_tgt, kind, irg);
471 struct build_walker {
475 unsigned problem_found;
479 * Post-Walker: notify all edges
481 static void build_edges_walker(ir_node *irn, void *data) {
482 struct build_walker *w = data;
484 ir_edge_kind_t kind = w->kind;
485 ir_graph *irg = w->irg;
486 get_edge_src_n_func_t *get_n;
488 get_n = edge_kind_info[kind].get_n;
489 foreach_tgt(irn, i, n, kind) {
490 ir_node *pred = get_n(irn, i, kind);
491 edges_notify_edge_kind(irn, i, pred, NULL, kind, irg);
496 * Pre-Walker: initializes the list-heads and set the out-count
499 static void init_lh_walker(ir_node *irn, void *data) {
500 struct build_walker *w = data;
501 ir_edge_kind_t kind = w->kind;
502 list_head *head = _get_irn_outs_head(irn, kind);
503 INIT_LIST_HEAD(head);
504 _get_irn_edge_info(irn, kind)->out_count = 0;
508 * Pre-Walker: initializes the list-heads and set the out-count
511 * Additionally touches DEP nodes, as they might be DEAD.
512 * THIS IS UGLY, but I don't find a better way until we
514 * a) ensure that dead nodes are not used as input
515 * b) it might be sufficient to add those stupid NO_REG nodes
518 static void init_lh_walker_dep(ir_node *irn, void *data) {
519 struct build_walker *w = data;
520 ir_edge_kind_t kind = w->kind;
521 list_head *head = _get_irn_outs_head(irn, kind);
524 INIT_LIST_HEAD(head);
525 _get_irn_edge_info(irn, kind)->out_count = 0;
527 for (i = get_irn_deps(irn) - 1; i >= 0; --i) {
528 ir_node *dep = get_irn_dep(irn, i);
530 head = _get_irn_outs_head(dep, kind);
532 INIT_LIST_HEAD(head);
533 _get_irn_edge_info(dep, kind)->out_count = 0;
537 typedef struct visitor_info_t {
538 irg_walk_func *visit;
543 * Visitor: initializes the list-heads and set the out-count
544 * of all nodes to 0 of nodes that are not seen so far.
546 static void visitor(ir_node *irn, void *data) {
547 visitor_info_t *info = data;
549 if (irn_not_visited(irn)) {
550 mark_irn_visited(irn);
551 info->visit(irn, info->data);
556 * Build the initial edge set.
557 * Beware, this is not a simple task because it suffers from two
559 * - the anchor set allows access to Nodes that may not be reachable from
561 * - the identities add nodes to the "root set" that are not yet reachable
562 * from End. However, after some transformations, the CSE may revival these
565 * These problems can be fixed using different strategies:
566 * - Add an age flag to every node. Whenever the edge of a node is older
567 * then the current edge, invalidate the edges of this node.
568 * While this would help for revivaled nodes, it increases memory and runtime.
569 * - Delete the identities set.
570 * Solves the revival problem, but may increase the memory consumption, as
571 * nodes cannot be revivaled at all.
572 * - Manually iterate over the identities root set. This did not consume more memory
573 * but increase the computation time because the |identities| >= |V|
575 * Currently, we use the last option.
577 void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind)
579 struct build_walker w;
580 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
581 visitor_info_t visit;
589 edges_init_graph_kind(irg, kind);
590 if (kind == EDGE_KIND_DEP) {
591 irg_walk_anchors(irg, init_lh_walker_dep, NULL, &w);
592 /* Argh: Dep nodes might be dead, so we MUST visit identities first */
593 visit.visit = init_lh_walker_dep;
594 visit_all_identities(irg, visitor, &visit);
595 irg_walk_anchors(irg, NULL, build_edges_walker, &w);
597 irg_walk_anchors(irg, init_lh_walker, build_edges_walker, &w);
598 visit.visit = init_lh_walker;
599 visit_all_identities(irg, visitor, &visit);
603 void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind)
605 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
608 if (info->allocated) {
609 obstack_free(&info->edges_obst, NULL);
610 ir_edgeset_destroy(&info->edges);
615 int (edges_activated_kind)(const ir_graph *irg, ir_edge_kind_t kind)
617 return _edges_activated_kind(irg, kind);
622 * Reroute all use-edges from a node to another.
623 * @param from The node whose use-edges shall be withdrawn.
624 * @param to The node to which all the use-edges of @p from shall be
626 * @param irg The graph.
628 void edges_reroute_kind(ir_node *from, ir_node *to, ir_edge_kind_t kind, ir_graph *irg)
630 set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
632 if(set_edge && edges_activated_kind(irg, kind)) {
633 struct list_head *head = _get_irn_outs_head(from, kind);
635 DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
637 while (head != head->next) {
638 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
639 assert(edge->pos >= -1);
640 set_edge(edge->src, edge->pos, to);
645 static void verify_set_presence(ir_node *irn, void *data)
647 struct build_walker *w = data;
648 ir_edgeset_t *edges = &_get_irg_edge_info(w->irg, w->kind)->edges;
651 foreach_tgt(irn, i, n, w->kind) {
657 e = ir_edgeset_find(edges, &templ);
661 w->problem_found = 1;
663 ir_fprintf(stderr, "Edge Verifier: edge %+F,%d -> %+F (kind: \"%s\") is missing\n",
664 irn, i, get_n(irn, i, w->kind), get_kind_str(w->kind));
670 static void verify_list_presence(ir_node *irn, void *data)
672 struct build_walker *w = data;
675 bitset_set(w->reachable, get_irn_idx(irn));
677 /* check list heads */
678 vrfy_list_head(irn, w->kind);
680 foreach_out_edge_kind(irn, e, w->kind) {
683 if (w->kind == EDGE_KIND_NORMAL && get_irn_arity(e->src) <= e->pos) {
684 w->problem_found = 1;
686 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F -> %+F recorded at src position %d, but src has arity %d\n",
687 edge_get_id(e), e->src, irn, e->pos, get_irn_arity(e->src));
692 tgt = get_n(e->src, e->pos, w->kind);
695 w->problem_found = 1;
697 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d (kind \"%s\") is no out edge of %+F but of %+F\n",
698 edge_get_id(e), e->src, e->pos, get_kind_str(w->kind), irn, tgt);
704 int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind)
706 struct build_walker w;
707 ir_edgeset_t *edges = &_get_irg_edge_info(irg, kind)->edges;
709 ir_edgeset_iterator_t iter;
713 w.reachable = bitset_alloca(get_irg_last_idx(irg));
716 /* Clear the present bit in all edges available. */
717 foreach_ir_edgeset(edges, e, iter) {
721 irg_walk_graph(irg, verify_set_presence, verify_list_presence, &w);
724 * Dump all edges which are not invalid and not present.
725 * These edges are superfluous and their presence in the
728 foreach_ir_edgeset(edges, e, iter) {
729 if (! e->invalid && ! e->present && bitset_is_set(w.reachable, get_irn_idx(e->src))) {
731 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d is superfluous\n", edge_get_id(e), e->src, e->pos);
735 return w.problem_found;
738 #define IGNORE_NODE(irn) (is_Bad((irn)) || is_Block((irn)))
741 * Clear link field of all nodes.
743 static void clear_links(ir_node *irn, void *env) {
744 struct build_walker *w = env;
747 if (IGNORE_NODE(irn)) {
748 set_irn_link(irn, NULL);
752 bs = bitset_malloc(get_irg_last_idx(w->irg));
753 set_irn_link(irn, bs);
757 * Increases count (stored in link field) for all operands of a node.
759 static void count_user(ir_node *irn, void *env) {
765 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
766 ir_node *op = get_irn_n(irn, i);
767 bitset_t *bs = get_irn_link(op);
770 bitset_set(bs, get_irn_idx(irn));
775 * Verifies if collected count, number of edges in list and stored edge count are in sync.
777 static void verify_edge_counter(ir_node *irn, void *env) {
778 struct build_walker *w = env;
784 const struct list_head *head;
785 const struct list_head *pos;
787 if (IGNORE_NODE(irn))
790 bs = get_irn_link(irn);
793 edge_cnt = _get_irn_edge_info(irn, EDGE_KIND_NORMAL)->out_count;
794 head = _get_irn_outs_head(irn, EDGE_KIND_NORMAL);
796 /* We can iterate safely here, list heads have already been verified. */
797 list_for_each(pos, head) {
801 /* check all nodes that reference us and count edges that point number
802 * of ins that actually point to us */
804 bitset_foreach(bs, idx) {
806 ir_node *src = get_idx_irn(w->irg, idx);
808 arity = get_irn_arity(src);
809 for (i = 0; i < arity; ++i) {
810 ir_node *in = get_irn_n(src, i);
816 if (edge_cnt != list_cnt) {
817 w->problem_found = 1;
818 ir_fprintf(stderr, "Edge Verifier: edge count is %d, but %d edge(s) are recorded in list at %+F\n",
819 edge_cnt, list_cnt, irn);
822 if (ref_cnt != list_cnt) {
823 w->problem_found = 1;
824 ir_fprintf(stderr, "Edge Verifier: %+F reachable by %d node(s), but the list contains %d edge(s)\n",
825 irn, ref_cnt, list_cnt);
827 /* Matze: buggy if a node has multiple ins pointing at irn */
829 list_for_each(pos, head) {
830 ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
831 bitset_flip(bs, get_irn_idx(edge->src));
834 if (ref_cnt < list_cnt)
835 fprintf(stderr," following nodes are recorded in list, but not as user:\n");
837 fprintf(stderr," following nodes are user, but not recorded in list:\n");
840 bitset_foreach(bs, idx) {
841 ir_node *src = get_idx_irn(w->irg, idx);
842 ir_fprintf(stderr, " %+F", src);
844 fprintf(stderr, "\n");
852 * Verifies the out edges of an irg.
854 int edges_verify(ir_graph *irg) {
855 struct build_walker w;
856 int problem_found = 0;
858 /* verify normal edges only */
859 problem_found = edges_verify_kind(irg, EDGE_KIND_NORMAL);
862 w.kind = EDGE_KIND_NORMAL;
866 irg_walk_anchors(irg, clear_links, count_user, &w);
867 irg_walk_anchors(irg, NULL, verify_edge_counter, &w);
869 return problem_found ? 1 : w.problem_found;
872 void init_edges(void) {
873 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
874 /* firm_dbg_set_mask(dbg, -1); */
877 void edges_init_dbg(int do_dbg) {
881 void edges_activate(ir_graph *irg) {
882 edges_activate_kind(irg, EDGE_KIND_NORMAL);
883 edges_activate_kind(irg, EDGE_KIND_BLOCK);
884 if (get_irg_phase_state(irg) == phase_backend)
885 edges_activate_kind(irg, EDGE_KIND_DEP);
888 void edges_deactivate(ir_graph *irg) {
889 if (get_irg_phase_state(irg) == phase_backend)
890 edges_deactivate_kind(irg, EDGE_KIND_DEP);
891 edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
892 edges_deactivate_kind(irg, EDGE_KIND_NORMAL);
895 int edges_assure(ir_graph *irg) {
896 int activated = edges_activated(irg);
904 int edges_assure_kind(ir_graph *irg, ir_edge_kind_t kind) {
905 int activated = edges_activated_kind(irg, kind);
908 edges_activate_kind(irg, kind);
913 void edges_node_deleted(ir_node *irn, ir_graph *irg) {
914 edges_node_deleted_kind(irn, EDGE_KIND_NORMAL, irg);
915 edges_node_deleted_kind(irn, EDGE_KIND_BLOCK, irg);
919 const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind) {
920 return _get_irn_out_edge_first_kind(irn, kind);
923 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last) {
924 return _get_irn_out_edge_next(irn, last);
927 ir_node *(get_edge_src_irn)(const ir_edge_t *edge) {
928 return _get_edge_src_irn(edge);
931 int (get_edge_src_pos)(const ir_edge_t *edge) {
932 return _get_edge_src_pos(edge);
935 int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind) {
936 return _get_irn_n_edges_kind(irn, kind);
939 void dump_all_out_edges(ir_node *irn) {
941 for (i = 0; i < EDGE_KIND_LAST; ++i) {
942 const ir_edge_t *edge;
944 printf("kind \"%s\"\n", get_kind_str(i));
945 foreach_out_edge_kind(irn, edge, i) {
946 ir_printf("\t%+F(%d)\n", edge->src, edge->pos);
951 static void irg_block_edges_walk2(ir_node *bl,
952 irg_walk_func *pre, irg_walk_func *post,
954 const ir_edge_t *edge, *next;
956 if (Block_not_block_visited(bl)) {
957 mark_Block_block_visited(bl);
962 foreach_out_edge_kind_safe(bl, edge, next, EDGE_KIND_BLOCK) {
963 /* find the corresponding successor block. */
964 ir_node *pred = get_edge_src_irn(edge);
965 irg_block_edges_walk2(pred, pre, post, env);
973 void irg_block_edges_walk(ir_node *node,
974 irg_walk_func *pre, irg_walk_func *post,
977 assert(edges_activated(current_ir_graph));
978 assert(is_Block(node));
980 set_using_block_visited(current_ir_graph);
982 inc_irg_block_visited(current_ir_graph);
983 irg_block_edges_walk2(node, pre, post, env);
985 clear_using_block_visited(current_ir_graph);