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"
45 #include "iredgeset.h"
50 #define HashSet ir_edgeset_t
51 #define HashSetIterator ir_edgeset_iterator_t
52 #define ValueType ir_edge_t*
53 #define NullValue NULL
54 #define DeletedValue ((ir_edge_t*)-1)
55 #define Hash(this,key) (HASH_PTR(key->src) ^ (key->pos * 40013))
56 #define KeysEqual(this,key1,key2) ((key1->src) == (key2->src) && (key1->pos == key2->pos))
57 #define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
59 #define hashset_init ir_edgeset_init
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 #define hashset_find ir_edgeset_find
65 #define hashset_size ir_edgeset_size
66 #define hashset_iterator_init ir_edgeset_iterator_init
67 #define hashset_iterator_next ir_edgeset_iterator_next
68 #define hashset_remove_iterator ir_edgeset_remove_iterator
73 * A function that allows for setting an edge.
74 * This abstraction is necessary since different edge kind have
75 * different methods of setting edges.
77 typedef void (set_edge_func_t)(ir_node *src, int pos, ir_node *tgt);
79 typedef int (get_edge_src_arity_func_t)(const ir_node *src);
81 typedef ir_node *(get_edge_src_n_func_t)(const ir_node *src, int pos);
84 * Additional data for an edge kind.
87 const char *name; /**< name of this edge kind */
88 set_edge_func_t *set_edge; /**< the set_edge function */
89 int first_idx; /**< index of the first possible edge */
90 get_edge_src_arity_func_t *get_arity; /**< the get_arity function */
91 get_edge_src_n_func_t *get_n; /**< the get_n function */
92 } ir_edge_kind_info_t;
95 * Get the predecessor block.
97 static ir_node *get_block_n(const ir_node *irn, int pos) {
99 return get_Block_cfgpred_block(irn, pos);
104 static const ir_edge_kind_info_t edge_kind_info[EDGE_KIND_LAST] = {
105 { "normal" , set_irn_n, -1, get_irn_arity, get_irn_n },
106 { "block succs", NULL, 0, get_irn_arity, get_block_n },
107 { "dependency", set_irn_dep, 0, get_irn_deps, get_irn_dep }
110 #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)
111 #define get_n(irn, pos, kind) (edge_kind_info[kind].get_n(irn, pos))
112 #define get_kind_str(kind) (edge_kind_info[kind].name)
114 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
117 * This flag is set to 1, if the edges get initialized for an irg.
118 * Then register additional data is forbidden.
120 static int edges_used = 0;
123 * Summed size of all users private data
126 static int edges_private_size = 0;
127 #define EDGE_SIZE (sizeof(ir_edge_t) + edges_private_size)
130 * If set to 1, the list heads are checked every time an edge is changed.
132 static int edges_dbg = 0;
135 /* a static variable holding the last number assigned to a new edge */
136 static long last_edge_num = -1;
139 static INLINE long edge_get_id(const ir_edge_t *e) {
142 #else /* DEBUG_libfirm */
144 #endif /* DEBUG_libfirm */
148 * Announce to reserve extra space for each edge to be allocated.
150 * @param n: Size of the space to reserve
152 * @return Offset at which the private data will begin
154 * Several users can reserve extra space for private usage.
155 * Each user has to remember his given offset and the size of his private data.
156 * To be called before FIRM is initialized.
158 int edges_register_private_data(size_t n) {
159 int res = edges_private_size;
161 assert(!edges_used && "you cannot register private edge data, if edges have been initialized");
163 edges_private_size += n;
168 * Reset the user's private data at offset 'offset'
169 * The user has to remember his offset and the size of his data!
170 * Caution: Using wrong values here can destroy other users private data!
172 void edges_reset_private_data(ir_graph *irg, int offset, size_t size) {
173 irg_edge_info_t *info = _get_irg_edge_info(irg, EDGE_KIND_NORMAL);
175 ir_edgeset_iterator_t iter;
177 foreach_ir_edgeset(&info->edges, edge, iter) {
178 memset(edge + sizeof(*edge) + offset, 0, size);
182 #define TIMES37(x) (((x) << 5) + ((x) << 2) + (x))
184 #define get_irn_out_list_head(irn) (&get_irn_out_info(irn)->outs)
186 #define edge_hash(edge) (TIMES37((edge)->pos) + HASH_PTR((edge)->src))
189 * Initialize the out information for a graph.
190 * @note Dead node elimination can call this on an already initialized graph.
192 void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind) {
193 if (edges_activated_kind(irg, kind)) {
194 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
195 size_t amount = irg->estimated_node_count * 2;
198 if(info->allocated) {
199 amount = ir_edgeset_size(&info->edges);
200 ir_edgeset_destroy(&info->edges);
201 obstack_free(&info->edges_obst, NULL);
203 obstack_init(&info->edges_obst);
204 ir_edgeset_init_size(&info->edges, amount);
210 * Get the edge object of an outgoing edge at a node.
211 * @param irg The graph, the node is in.
212 * @param src The node at which the edge originates.
213 * @param pos The position of the edge.
214 * @return The corresponding edge object or NULL,
215 * if no such edge exists.
217 const ir_edge_t *get_irn_edge_kind(ir_graph *irg, const ir_node *src, int pos, ir_edge_kind_t kind)
219 if (edges_activated_kind(irg, kind)) {
220 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
223 key.src = (ir_node *)src;
226 return ir_edgeset_find(&info->edges, &key);
233 * Get the edge object of an outgoing edge at a node.
234 * Looks for an edge for all kinds.
236 const ir_edge_t *get_irn_edge(ir_graph *irg, const ir_node *src, int pos) {
237 const ir_edge_t *edge;
238 if((edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_NORMAL)) == NULL)
239 edge = get_irn_edge_kind(irg, src, pos, EDGE_KIND_BLOCK);
244 * Change the out count
246 * @param tgt the edge target
247 * @param kind the kind of the edge
249 static INLINE void edge_change_cnt(ir_node *tgt, ir_edge_kind_t kind, int ofs) {
250 irn_edge_info_t *info = _get_irn_edge_info(tgt, kind);
251 info->out_count += ofs;
254 assert(info->out_count >= 0);
255 if (info->out_count == 0 && kind == EDGE_KIND_NORMAL) {
256 /* tgt lost it's last user */
259 for (i = get_irn_arity(tgt) - 1; i >= -1; --i) {
260 ir_node *prev = get_irn_n(tgt, i);
262 edges_notify_edge(tgt, i, NULL, prev, current_ir_graph);
264 for (i = get_irn_deps(tgt) - 1; i >= 0; --i) {
265 ir_node *prev = get_irn_dep(tgt, i);
267 edges_notify_edge_kind(tgt, i, NULL, prev, EDGE_KIND_DEP, current_ir_graph);
275 * Verify the edge list of a node, ie. ensure it's a loop:
276 * head -> e_1 -> ... -> e_n -> head
278 static INLINE void vrfy_list_head(ir_node *irn, ir_edge_kind_t kind) {
281 pset *lh_set = pset_new_ptr(16);
282 const struct list_head *head = _get_irn_outs_head(irn, kind);
283 const struct list_head *pos;
285 list_for_each(pos, head) {
286 if (pset_find_ptr(lh_set, pos)) {
287 const ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
289 ir_fprintf(stderr, "EDGE Verifier: edge list broken (self loop not to head) for %+F:\n", irn);
290 fprintf(stderr, "- at list entry %d\n", num);
292 fprintf(stderr, "- edge(%ld) is invalid\n", edge_get_id(edge));
294 ir_fprintf(stderr, "- edge(%ld) %+F(%d)\n", edge_get_id(edge), edge->src, edge->pos);
299 pset_insert_ptr(lh_set, pos);
307 /* The edge from (src, pos) -> old_tgt is redirected to tgt */
308 void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt,
309 ir_node *old_tgt, ir_edge_kind_t kind,
312 const char *msg = "";
313 irg_edge_info_t *info;
318 assert(edges_activated_kind(irg, kind));
321 * Only do something, if the old and new target differ.
326 info = _get_irg_edge_info(irg, kind);
327 edges = &info->edges;
329 /* Initialize the edge template to search in the set. */
334 * If the target is NULL, the edge shall be deleted.
337 /* search the edge in the set. */
338 edge = ir_edgeset_find(edges, &templ);
340 /* mark the edge invalid if it was found */
343 list_del(&edge->list);
349 #endif /* DEBUG_libfirm */
350 edge_change_cnt(old_tgt, kind, -1);
353 /* If the edge was not found issue a warning on the debug stream */
355 msg = "edge to delete not found!\n";
360 * The target is not NULL and the old target differs
361 * from the new target, the edge shall be moved (if the
362 * old target was != NULL) or added (if the old target was
366 struct list_head *head = _get_irn_outs_head(tgt, kind);
368 assert(head->next && head->prev &&
369 "target list head must have been initialized");
371 /* If the old target is not null, the edge is moved. */
373 edge = ir_edgeset_find(edges, &templ);
374 assert(edge && "edge to redirect not found!");
375 assert(! edge->invalid && "Invalid edge encountered");
379 list_move(&edge->list, head);
380 edge_change_cnt(old_tgt, kind, -1);
383 /* The old target was null, thus, the edge is newly created. */
387 = obstack_alloc(&info->edges_obst, EDGE_SIZE);
388 memset(edge, 0, EDGE_SIZE);
392 DEBUG_ONLY(edge->src_nr = get_irn_node_nr(src));
394 new_edge = ir_edgeset_insert(edges, edge);
395 if(new_edge != edge) {
396 obstack_free(&info->edges_obst, edge);
399 assert(! edge->invalid && "Freshly inserted edge is invalid?!?");
400 assert(edge->list.next == NULL && edge->list.prev == NULL &&
401 "New edge must not have list head initialized");
404 list_add(&edge->list, head);
406 edge->edge_nr = ++last_edge_num;
407 #endif /* DEBUG_libfirm */
410 edge_change_cnt(tgt, kind, +1);
413 #ifndef DEBUG_libfirm
414 /* verify list heads */
417 vrfy_list_head(tgt, kind);
419 vrfy_list_head(old_tgt, kind);
423 DBG((dbg, LEVEL_5, "announce out edge: %+F %d-> %+F(%+F): %s\n", src, pos, tgt, old_tgt, msg));
426 void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_graph *irg)
428 if (edges_activated_kind(irg, EDGE_KIND_NORMAL)) {
429 edges_notify_edge_kind(src, pos, tgt, old_tgt, EDGE_KIND_NORMAL, irg);
432 if (edges_activated_kind(irg, EDGE_KIND_BLOCK) && is_Block(src)) {
434 /* a MacroBlock edge: ignore it here */
436 ir_node *bl_old = old_tgt ? get_nodes_block(skip_Proj(old_tgt)) : NULL;
437 ir_node *bl_tgt = NULL;
440 bl_tgt = is_Bad(tgt) ? tgt : get_nodes_block(skip_Proj(tgt));
442 edges_notify_edge_kind(src, pos, bl_tgt, bl_old, EDGE_KIND_BLOCK, irg);
448 * Delete all in edges of a given kind from the node old.
450 * @param old the node
451 * @param kind the kind of edges to remove
452 * @param irg the irg of the old node
454 static void edges_node_deleted_kind(ir_node *old, ir_edge_kind_t kind, ir_graph *irg)
458 if (!edges_activated_kind(irg, kind))
461 DBG((dbg, LEVEL_5, "node deleted (kind: %s): %+F\n", get_kind_str(kind), old));
463 foreach_tgt(old, i, n, kind) {
464 ir_node *old_tgt = get_n(old, i, kind);
465 edges_notify_edge_kind(old, i, NULL, old_tgt, kind, irg);
469 struct build_walker {
473 unsigned problem_found;
477 * Post-Walker: notify all edges
479 static void build_edges_walker(ir_node *irn, void *data) {
480 struct build_walker *w = data;
482 ir_edge_kind_t kind = w->kind;
483 ir_graph *irg = w->irg;
484 get_edge_src_n_func_t *get_n;
486 get_n = edge_kind_info[kind].get_n;
487 foreach_tgt(irn, i, n, kind) {
488 ir_node *pred = get_n(irn, i, kind);
489 edges_notify_edge_kind(irn, i, pred, NULL, kind, irg);
494 * Pre-Walker: initializes the list-heads and set the out-count
497 static void init_lh_walker(ir_node *irn, void *data) {
498 struct build_walker *w = data;
499 ir_edge_kind_t kind = w->kind;
500 list_head *head = _get_irn_outs_head(irn, kind);
501 INIT_LIST_HEAD(head);
502 _get_irn_edge_info(irn, kind)->out_count = 0;
506 * Pre-Walker: initializes the list-heads and set the out-count
509 * Additionally touches DEP nodes, as they might be DEAD.
510 * THIS IS UGLY, but I don't find a better way until we
512 * a) ensure that dead nodes are not used as input
513 * b) it might be sufficient to add those stupid NO_REG nodes
516 static void init_lh_walker_dep(ir_node *irn, void *data) {
517 struct build_walker *w = data;
518 ir_edge_kind_t kind = w->kind;
519 list_head *head = _get_irn_outs_head(irn, kind);
522 INIT_LIST_HEAD(head);
523 _get_irn_edge_info(irn, kind)->out_count = 0;
525 for (i = get_irn_deps(irn) - 1; i >= 0; --i) {
526 ir_node *dep = get_irn_dep(irn, i);
528 head = _get_irn_outs_head(dep, kind);
530 INIT_LIST_HEAD(head);
531 _get_irn_edge_info(dep, kind)->out_count = 0;
535 typedef struct visitor_info_t {
536 irg_walk_func *visit;
541 * Visitor: initializes the list-heads and set the out-count
542 * of all nodes to 0 of nodes that are not seen so far.
544 static void visitor(ir_node *irn, void *data) {
545 visitor_info_t *info = data;
547 if (!irn_visited(irn)) {
548 mark_irn_visited(irn);
549 info->visit(irn, info->data);
554 * Build the initial edge set.
555 * Beware, this is not a simple task because it suffers from two
557 * - the anchor set allows access to Nodes that may not be reachable from
559 * - the identities add nodes to the "root set" that are not yet reachable
560 * from End. However, after some transformations, the CSE may revival these
563 * These problems can be fixed using different strategies:
564 * - Add an age flag to every node. Whenever the edge of a node is older
565 * then the current edge, invalidate the edges of this node.
566 * While this would help for revivaled nodes, it increases memory and runtime.
567 * - Delete the identities set.
568 * Solves the revival problem, but may increase the memory consumption, as
569 * nodes cannot be revivaled at all.
570 * - Manually iterate over the identities root set. This did not consume more memory
571 * but increase the computation time because the |identities| >= |V|
573 * Currently, we use the last option.
575 void edges_activate_kind(ir_graph *irg, ir_edge_kind_t kind)
577 struct build_walker w;
578 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
579 visitor_info_t visit;
587 edges_init_graph_kind(irg, kind);
588 if (kind == EDGE_KIND_DEP) {
589 irg_walk_anchors(irg, init_lh_walker_dep, NULL, &w);
590 /* Argh: Dep nodes might be dead, so we MUST visit identities first */
591 visit.visit = init_lh_walker_dep;
592 visit_all_identities(irg, visitor, &visit);
593 irg_walk_anchors(irg, NULL, build_edges_walker, &w);
595 irg_walk_anchors(irg, init_lh_walker, build_edges_walker, &w);
596 visit.visit = init_lh_walker;
597 visit_all_identities(irg, visitor, &visit);
601 void edges_deactivate_kind(ir_graph *irg, ir_edge_kind_t kind)
603 irg_edge_info_t *info = _get_irg_edge_info(irg, kind);
606 if (info->allocated) {
607 obstack_free(&info->edges_obst, NULL);
608 ir_edgeset_destroy(&info->edges);
613 int (edges_activated_kind)(const ir_graph *irg, ir_edge_kind_t kind)
615 return _edges_activated_kind(irg, kind);
620 * Reroute all use-edges from a node to another.
621 * @param from The node whose use-edges shall be withdrawn.
622 * @param to The node to which all the use-edges of @p from shall be
624 * @param irg The graph.
626 void edges_reroute_kind(ir_node *from, ir_node *to, ir_edge_kind_t kind, ir_graph *irg)
628 set_edge_func_t *set_edge = edge_kind_info[kind].set_edge;
630 if(set_edge && edges_activated_kind(irg, kind)) {
631 struct list_head *head = _get_irn_outs_head(from, kind);
633 DBG((dbg, LEVEL_5, "reroute from %+F to %+F\n", from, to));
635 while (head != head->next) {
636 ir_edge_t *edge = list_entry(head->next, ir_edge_t, list);
637 assert(edge->pos >= -1);
638 set_edge(edge->src, edge->pos, to);
643 static void verify_set_presence(ir_node *irn, void *data)
645 struct build_walker *w = data;
646 ir_edgeset_t *edges = &_get_irg_edge_info(w->irg, w->kind)->edges;
649 foreach_tgt(irn, i, n, w->kind) {
655 e = ir_edgeset_find(edges, &templ);
659 w->problem_found = 1;
661 ir_fprintf(stderr, "Edge Verifier: edge %+F,%d -> %+F (kind: \"%s\") is missing\n",
662 irn, i, get_n(irn, i, w->kind), get_kind_str(w->kind));
668 static void verify_list_presence(ir_node *irn, void *data)
670 struct build_walker *w = data;
673 bitset_set(w->reachable, get_irn_idx(irn));
675 /* check list heads */
676 vrfy_list_head(irn, w->kind);
678 foreach_out_edge_kind(irn, e, w->kind) {
681 if (w->kind == EDGE_KIND_NORMAL && get_irn_arity(e->src) <= e->pos) {
682 w->problem_found = 1;
684 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F -> %+F recorded at src position %d, but src has arity %d\n",
685 edge_get_id(e), e->src, irn, e->pos, get_irn_arity(e->src));
690 tgt = get_n(e->src, e->pos, w->kind);
693 w->problem_found = 1;
695 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d (kind \"%s\") is no out edge of %+F but of %+F\n",
696 edge_get_id(e), e->src, e->pos, get_kind_str(w->kind), irn, tgt);
702 int edges_verify_kind(ir_graph *irg, ir_edge_kind_t kind)
704 struct build_walker w;
705 ir_edgeset_t *edges = &_get_irg_edge_info(irg, kind)->edges;
707 ir_edgeset_iterator_t iter;
711 w.reachable = bitset_alloca(get_irg_last_idx(irg));
714 /* Clear the present bit in all edges available. */
715 foreach_ir_edgeset(edges, e, iter) {
719 irg_walk_graph(irg, verify_set_presence, verify_list_presence, &w);
722 * Dump all edges which are not invalid and not present.
723 * These edges are superfluous and their presence in the
726 foreach_ir_edgeset(edges, e, iter) {
727 if (! e->invalid && ! e->present && bitset_is_set(w.reachable, get_irn_idx(e->src))) {
729 ir_fprintf(stderr, "Edge Verifier: edge(%ld) %+F,%d is superfluous\n", edge_get_id(e), e->src, e->pos);
733 return w.problem_found;
736 #define IGNORE_NODE(irn) (is_Bad((irn)) || is_Block((irn)))
739 * Clear link field of all nodes.
741 static void clear_links(ir_node *irn, void *env) {
742 struct build_walker *w = env;
745 if (IGNORE_NODE(irn)) {
746 set_irn_link(irn, NULL);
750 bs = bitset_malloc(get_irg_last_idx(w->irg));
751 set_irn_link(irn, bs);
755 * Increases count (stored in link field) for all operands of a node.
757 static void count_user(ir_node *irn, void *env) {
763 for (i = get_irn_arity(irn) - 1; i >= first; --i) {
764 ir_node *op = get_irn_n(irn, i);
765 bitset_t *bs = get_irn_link(op);
768 bitset_set(bs, get_irn_idx(irn));
773 * Verifies if collected count, number of edges in list and stored edge count are in sync.
775 static void verify_edge_counter(ir_node *irn, void *env) {
776 struct build_walker *w = env;
782 const struct list_head *head;
783 const struct list_head *pos;
785 if (IGNORE_NODE(irn))
788 bs = get_irn_link(irn);
791 edge_cnt = _get_irn_edge_info(irn, EDGE_KIND_NORMAL)->out_count;
792 head = _get_irn_outs_head(irn, EDGE_KIND_NORMAL);
794 /* We can iterate safely here, list heads have already been verified. */
795 list_for_each(pos, head) {
799 /* check all nodes that reference us and count edges that point number
800 * of ins that actually point to us */
802 bitset_foreach(bs, idx) {
804 ir_node *src = get_idx_irn(w->irg, idx);
806 arity = get_irn_arity(src);
807 for (i = 0; i < arity; ++i) {
808 ir_node *in = get_irn_n(src, i);
814 if (edge_cnt != list_cnt) {
815 w->problem_found = 1;
816 ir_fprintf(stderr, "Edge Verifier: edge count is %d, but %d edge(s) are recorded in list at %+F\n",
817 edge_cnt, list_cnt, irn);
820 if (ref_cnt != list_cnt) {
821 w->problem_found = 1;
822 ir_fprintf(stderr, "Edge Verifier: %+F reachable by %d node(s), but the list contains %d edge(s)\n",
823 irn, ref_cnt, list_cnt);
825 /* Matze: buggy if a node has multiple ins pointing at irn */
827 list_for_each(pos, head) {
828 ir_edge_t *edge = list_entry(pos, ir_edge_t, list);
829 bitset_flip(bs, get_irn_idx(edge->src));
832 if (ref_cnt < list_cnt)
833 fprintf(stderr," following nodes are recorded in list, but not as user:\n");
835 fprintf(stderr," following nodes are user, but not recorded in list:\n");
838 bitset_foreach(bs, idx) {
839 ir_node *src = get_idx_irn(w->irg, idx);
840 ir_fprintf(stderr, " %+F", src);
842 fprintf(stderr, "\n");
850 * Verifies the out edges of an irg.
852 int edges_verify(ir_graph *irg) {
853 struct build_walker w;
854 int problem_found = 0;
856 /* verify normal edges only */
857 problem_found = edges_verify_kind(irg, EDGE_KIND_NORMAL);
860 w.kind = EDGE_KIND_NORMAL;
864 irg_walk_anchors(irg, clear_links, count_user, &w);
865 irg_walk_anchors(irg, NULL, verify_edge_counter, &w);
867 return problem_found ? 1 : w.problem_found;
870 void init_edges(void) {
871 FIRM_DBG_REGISTER(dbg, DBG_EDGES);
872 /* firm_dbg_set_mask(dbg, -1); */
875 void edges_init_dbg(int do_dbg) {
879 void edges_activate(ir_graph *irg) {
880 edges_activate_kind(irg, EDGE_KIND_NORMAL);
881 edges_activate_kind(irg, EDGE_KIND_BLOCK);
882 if (get_irg_phase_state(irg) == phase_backend)
883 edges_activate_kind(irg, EDGE_KIND_DEP);
886 void edges_deactivate(ir_graph *irg) {
887 if (get_irg_phase_state(irg) == phase_backend)
888 edges_deactivate_kind(irg, EDGE_KIND_DEP);
889 edges_deactivate_kind(irg, EDGE_KIND_BLOCK);
890 edges_deactivate_kind(irg, EDGE_KIND_NORMAL);
893 int edges_assure(ir_graph *irg) {
894 int activated = edges_activated(irg);
902 int edges_assure_kind(ir_graph *irg, ir_edge_kind_t kind) {
903 int activated = edges_activated_kind(irg, kind);
906 edges_activate_kind(irg, kind);
911 void edges_node_deleted(ir_node *irn, ir_graph *irg) {
912 edges_node_deleted_kind(irn, EDGE_KIND_NORMAL, irg);
913 edges_node_deleted_kind(irn, EDGE_KIND_BLOCK, irg);
917 const ir_edge_t *(get_irn_out_edge_first_kind)(const ir_node *irn, ir_edge_kind_t kind) {
918 return _get_irn_out_edge_first_kind(irn, kind);
921 const ir_edge_t *(get_irn_out_edge_next)(const ir_node *irn, const ir_edge_t *last) {
922 return _get_irn_out_edge_next(irn, last);
925 ir_node *(get_edge_src_irn)(const ir_edge_t *edge) {
926 return _get_edge_src_irn(edge);
929 int (get_edge_src_pos)(const ir_edge_t *edge) {
930 return _get_edge_src_pos(edge);
933 int (get_irn_n_edges_kind)(const ir_node *irn, ir_edge_kind_t kind) {
934 return _get_irn_n_edges_kind(irn, kind);
937 void dump_all_out_edges(ir_node *irn) {
939 for (i = 0; i < EDGE_KIND_LAST; ++i) {
940 const ir_edge_t *edge;
942 printf("kind \"%s\"\n", get_kind_str(i));
943 foreach_out_edge_kind(irn, edge, i) {
944 ir_printf("\t%+F(%d)\n", edge->src, edge->pos);
949 static void irg_block_edges_walk2(ir_node *bl,
950 irg_walk_func *pre, irg_walk_func *post,
952 const ir_edge_t *edge, *next;
954 if (!Block_block_visited(bl)) {
955 mark_Block_block_visited(bl);
960 foreach_out_edge_kind_safe(bl, edge, next, EDGE_KIND_BLOCK) {
961 /* find the corresponding successor block. */
962 ir_node *pred = get_edge_src_irn(edge);
963 irg_block_edges_walk2(pred, pre, post, env);
971 void irg_block_edges_walk(ir_node *node,
972 irg_walk_func *pre, irg_walk_func *post,
975 assert(edges_activated(current_ir_graph));
976 assert(is_Block(node));
978 ir_reserve_resources(current_ir_graph, IR_RESOURCE_BLOCK_VISITED);
980 inc_irg_block_visited(current_ir_graph);
981 irg_block_edges_walk2(node, pre, post, env);
983 ir_free_resources(current_ir_graph, IR_RESOURCE_BLOCK_VISITED);