3 * File name: ir/ir/irgwalk.c
5 * Author: Boris Boesler
6 * Modified by: Goetz Lindenmaier, Michael Beck
9 * Copyright: (c) 1999-20036Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
16 * traverse an ir graph
17 * - execute the pre function before recursion
18 * - execute the post function after recursion
31 #include "irgraph_t.h" /* visited flag */
42 * Walk over an interprocedural graph (callgraph).
43 * Visits only graphs in irg_set.
45 static void irg_walk_cg(ir_node * node, unsigned long visited, eset * irg_set,
46 irg_walk_func *pre, irg_walk_func *post, void * env) {
48 ir_graph * rem = current_ir_graph;
51 assert(node && node->kind == k_ir_node);
52 if (get_irn_visited(node) >= visited) return;
54 set_irn_visited(node, visited);
56 if (pre) pre(node, env);
58 pred = skip_Proj(node);
59 if (get_irn_op(pred) == op_CallBegin
60 || get_irn_op(pred) == op_EndReg
61 || get_irn_op(pred) == op_EndExcept) {
62 current_ir_graph = get_irn_irg(pred);
65 if (is_no_Block(node)) { /* not block */
66 irg_walk_cg(get_nodes_block(node), visited, irg_set, pre, post, env);
69 if (get_irn_op(node) == op_Block) { /* block */
70 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
71 ir_node * exec = get_irn_n(node, i);
72 ir_node * pred = skip_Proj(exec);
73 if ((get_irn_op(pred) != op_CallBegin
74 && get_irn_op(pred) != op_EndReg
75 && get_irn_op(pred) != op_EndExcept)
76 || eset_contains(irg_set, get_irn_irg(pred))) {
77 irg_walk_cg(exec, visited, irg_set, pre, post, env);
80 } else if (get_irn_op(node) == op_Filter) { /* filter */
81 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
82 ir_node * pred = get_irn_n(node, i);
83 if (get_irn_op(pred) == op_Unknown || get_irn_op(pred) == op_Bad) {
84 irg_walk_cg(pred, visited, irg_set, pre, post, env);
87 exec = skip_Proj(get_Block_cfgpred(get_nodes_block(node), i));
89 if (op_Bad == get_irn_op (exec)) {
93 assert(get_irn_op(exec) == op_CallBegin
94 || get_irn_op(exec) == op_EndReg
95 || get_irn_op(exec) == op_EndExcept);
96 if (eset_contains(irg_set, get_irn_irg(exec))) {
97 current_ir_graph = get_irn_irg(exec);
98 irg_walk_cg(pred, visited, irg_set, pre, post, env);
99 current_ir_graph = rem;
103 } else { /* everything else */
104 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
105 irg_walk_cg(get_irn_n(node, i), visited, irg_set, pre, post, env);
109 if (post) post(node, env);
111 current_ir_graph = rem;
116 * Insert all ir_graphs in irg_set, that are (transitive) reachable.
118 static void collect_irgs(ir_node * node, eset * irg_set) {
121 for (i = get_Call_n_callees(node) - 1; i >= 0; --i) {
122 ir_entity * ent = get_Call_callee(node, i);
123 ir_graph * irg = get_entity_irg(ent);
124 if (irg && !eset_contains(irg_set, irg)) {
125 eset_insert(irg_set, irg);
126 irg_walk_graph(irg, (irg_walk_func *) collect_irgs, NULL, irg_set);
133 * specialized version of irg_walk_2, called if only pre callback exists
135 * @return number of visited nodes
138 irg_walk_2_pre(ir_node *node, irg_walk_func *pre, void * env) {
141 ir_graph *irg = current_ir_graph;
143 set_irn_visited(node, irg->visited);
147 if (node->op != op_Block) {
148 ir_node *pred = get_irn_n(node, -1);
149 if (pred->visited < irg->visited)
150 cnt += irg_walk_2_pre(pred, pre, env);
152 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
153 ir_node *pred = get_irn_n(node, i);
154 if (pred->visited < irg->visited)
155 cnt += irg_walk_2_pre(pred, pre, env);
161 * specialized version of irg_walk_2, called if only post callback exists
163 * @return number of visited nodes
166 irg_walk_2_post(ir_node *node, irg_walk_func *post, void * env) {
169 ir_graph *irg = current_ir_graph;
171 set_irn_visited(node, irg->visited);
173 if (node->op != op_Block) {
174 ir_node *pred = get_irn_n(node, -1);
175 if (pred->visited < irg->visited)
176 cnt += irg_walk_2_post(pred, post, env);
178 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
179 ir_node *pred = get_irn_n(node, i);
180 if (pred->visited < irg->visited)
181 cnt += irg_walk_2_post(pred, post, env);
190 * specialized version of irg_walk_2, called if pre and post callbacks exist
192 * @return number of visited nodes
195 irg_walk_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env) {
198 ir_graph *irg = current_ir_graph;
200 set_irn_visited(node, irg->visited);
204 if (node->op != op_Block) {
205 ir_node *pred = get_irn_n(node, -1);
206 if (pred->visited < irg->visited)
207 cnt += irg_walk_2_both(pred, pre, post, env);
209 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
210 ir_node *pred = get_irn_n(node, i);
211 if (pred->visited < irg->visited)
212 cnt += irg_walk_2_both(pred, pre, post, env);
221 * Intraprozedural graph walker.
223 * @return number of visited nodes
226 irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
228 if (node->visited < current_ir_graph->visited) {
229 if (!post) return irg_walk_2_pre (node, pre, env);
230 else if (!pre) return irg_walk_2_post(node, post, env);
231 else return irg_walk_2_both(node, pre, post, env);
237 static unsigned nodes_touched = 0;
240 * generic graph walker
242 void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
244 assert(is_ir_node(node));
246 if (get_interprocedural_view()) {
247 eset * irg_set = eset_create();
248 unsigned long visited;
250 assert(get_irp_ip_view_state() == ip_view_valid);
252 set_interprocedural_view(0);
253 eset_insert(irg_set, current_ir_graph);
254 irg_walk(node, (irg_walk_func *) collect_irgs, NULL, irg_set);
255 set_interprocedural_view(1);
256 visited = get_max_irg_visited() + 1;
257 for (irg = eset_first(irg_set); irg; irg = eset_next(irg_set)) {
258 set_irg_visited(irg, visited);
260 irg_walk_cg(node, visited, irg_set, pre, post, env);
261 eset_destroy(irg_set);
263 set_using_visited(current_ir_graph);
264 inc_irg_visited(current_ir_graph);
265 nodes_touched = irg_walk_2(node, pre, post, env);
266 clear_using_visited(current_ir_graph);
274 void irg_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
275 ir_graph * rem = current_ir_graph;
277 hook_irg_walk(irg, (generic_func *)pre, (generic_func *)post);
278 current_ir_graph = irg;
279 irg_walk(get_irg_end(irg), pre, post, env);
280 irg->estimated_node_count = nodes_touched;
281 current_ir_graph = rem;
284 /* Executes irg_walk(end, pre, post, env) for all irgraphs in irprog.
285 Sets current_ir_graph properly for each walk. Conserves current
287 void all_irg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) {
291 rem = current_ir_graph;
293 for (i = 0; i < get_irp_n_irgs(); i++) {
294 irg = get_irp_irg(i);
295 current_ir_graph = irg;
296 irg_walk(get_irg_end(irg), pre, post, env);
298 current_ir_graph = rem;
301 /***************************************************************************/
304 * specialized version of irg_walk_in_or_dep_2, called if only pre callback exists
306 * @return number of visited nodes
309 irg_walk_in_or_dep_2_pre(ir_node *node, irg_walk_func *pre, void *env) {
312 ir_graph *irg = current_ir_graph;
314 set_irn_visited(node, irg->visited);
318 if (node->op != op_Block) {
319 ir_node *pred = get_irn_n(node, -1);
320 if (pred->visited < irg->visited)
321 cnt += irg_walk_in_or_dep_2_pre(pred, pre, env);
323 for (i = get_irn_ins_or_deps(node) - 1; i >= 0; --i) {
324 ir_node *pred = get_irn_in_or_dep(node, i);
325 if (pred->visited < irg->visited)
326 cnt += irg_walk_in_or_dep_2_pre(pred, pre, env);
332 * specialized version of irg_walk_in_or_dep_2, called if only post callback exists
334 * @return number of visited nodes
337 irg_walk_in_or_dep_2_post(ir_node *node, irg_walk_func *post, void *env) {
340 ir_graph *irg = current_ir_graph;
342 set_irn_visited(node, irg->visited);
344 if (node->op != op_Block) {
345 ir_node *pred = get_irn_n(node, -1);
346 if (pred->visited < irg->visited)
347 cnt += irg_walk_in_or_dep_2_post(pred, post, env);
349 for (i = get_irn_ins_or_deps(node) - 1; i >= 0; --i) {
350 ir_node *pred = get_irn_in_or_dep(node, i);
351 if (pred->visited < irg->visited)
352 cnt += irg_walk_in_or_dep_2_post(pred, post, env);
361 * specialized version of irg_walk_in_or_dep_2, called if pre and post callbacks exist
363 * @return number of visited nodes
366 irg_walk_in_or_dep_2_both(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env) {
369 ir_graph *irg = current_ir_graph;
371 set_irn_visited(node, irg->visited);
375 if (node->op != op_Block) {
376 ir_node *pred = get_irn_n(node, -1);
377 if (pred->visited < irg->visited)
378 cnt += irg_walk_in_or_dep_2_both(pred, pre, post, env);
380 for (i = get_irn_ins_or_deps(node) - 1; i >= 0; --i) {
381 ir_node *pred = get_irn_in_or_dep(node, i);
382 if (pred->visited < irg->visited)
383 cnt += irg_walk_in_or_dep_2_both(pred, pre, post, env);
392 * Intraprozedural graph walker. Follows dependency edges as well.
394 * @return number of visited nodes
397 irg_walk_in_or_dep_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
399 if (node->visited < current_ir_graph->visited) {
400 if (! post) return irg_walk_in_or_dep_2_pre (node, pre, env);
401 else if (! pre) return irg_walk_in_or_dep_2_post(node, post, env);
402 else return irg_walk_in_or_dep_2_both(node, pre, post, env);
408 * Generic graph walker. Follows dependency edges as well.
410 void irg_walk_in_or_dep(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
412 assert(is_ir_node(node));
414 if (get_interprocedural_view()) {
415 assert(0 && "This is not yet implemented.");
417 set_using_visited(current_ir_graph);
418 inc_irg_visited(current_ir_graph);
419 nodes_touched = irg_walk_in_or_dep_2(node, pre, post, env);
420 clear_using_visited(current_ir_graph);
426 * Walk over a graph. Follow all edges (including dependencies)
428 void irg_walk_in_or_dep_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
429 ir_graph * rem = current_ir_graph;
431 hook_irg_walk(irg, (generic_func *)pre, (generic_func *)post);
432 current_ir_graph = irg;
433 irg_walk_in_or_dep(get_irg_end(irg), pre, post, env);
434 irg->estimated_node_count = nodes_touched;
435 current_ir_graph = rem;
438 /***************************************************************************/
441 * Returns current_ir_graph and sets it to the irg of predecessor index
444 static INLINE ir_graph *
445 switch_irg (ir_node *n, int index) {
446 ir_graph *old_current = current_ir_graph;
448 if (get_interprocedural_view()) {
449 /* Only Filter and Block nodes can have predecessors in other graphs. */
450 if (get_irn_op(n) == op_Filter)
451 n = get_nodes_block(n);
452 if (get_irn_op(n) == op_Block) {
453 ir_node *cfop = skip_Proj(get_Block_cfgpred(n, index));
454 if (is_ip_cfop(cfop)) {
455 current_ir_graph = get_irn_irg(cfop);
464 cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
467 ir_graph *rem = NULL;
470 if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
471 set_irn_visited(node, get_irg_visited(current_ir_graph));
473 if (pre) pre(node, env);
475 if (is_no_Block(node))
476 cg_walk_2(get_nodes_block(node), pre, post, env);
477 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
478 rem = switch_irg(node, i); /* @@@ AS: Is this wrong? We do have to
479 switch to the irg of the predecessor, don't we? */
480 cg_walk_2(get_irn_n(node, i), pre, post, env);
481 current_ir_graph = rem;
484 if (post) post(node, env);
490 /* Walks all irgs in interprocedural view. Visits each node only once. */
491 void cg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) {
493 ir_graph *rem = current_ir_graph;
494 int rem_view = get_interprocedural_view();
496 set_interprocedural_view(1);
498 inc_max_irg_visited();
499 /* Fix all irg_visited flags */
500 for (i = 0; i < get_irp_n_irgs(); i++)
501 set_irg_visited(get_irp_irg(i), get_max_irg_visited());
503 /* Walk starting at unreachable procedures. Only these
504 * have End blocks visible in interprocedural view. */
505 for (i = 0; i < get_irp_n_irgs(); i++) {
507 current_ir_graph = get_irp_irg(i);
509 sb = get_irg_start_block(current_ir_graph);
511 if ((get_Block_n_cfgpreds(sb) > 1) ||
512 (get_nodes_block(get_Block_cfgpred(sb, 0)) != sb)) continue;
514 cg_walk_2(get_irg_end(current_ir_graph), pre, post, env);
517 /* Check whether we walked all procedures: there could be procedures
518 with cyclic calls but no call from the outside. */
519 for (i = 0; i < get_irp_n_irgs(); i++) {
521 current_ir_graph = get_irp_irg(i);
523 /* Test start block: if inner procedure end and end block are not
524 * visible and therefore not marked. */
525 sb = get_irg_start_block(current_ir_graph);
526 if (get_irn_visited(sb) < get_irg_visited(current_ir_graph)) {
527 cg_walk_2(sb, pre, post, env);
531 /* Walk all endless loops in inner procedures.
532 * We recognize an inner procedure if the End node is not visited. */
533 for (i = 0; i < get_irp_n_irgs(); i++) {
535 current_ir_graph = get_irp_irg(i);
536 e = get_irg_end(current_ir_graph);
537 if (get_irn_visited(e) < get_irg_visited(current_ir_graph)) {
539 /* Don't visit the End node. */
540 for (j = 0; j < get_End_n_keepalives(e); j++)
541 cg_walk_2(get_End_keepalive(e, j), pre, post, env);
545 set_interprocedural_view(rem_view);
546 current_ir_graph = rem;
550 /***************************************************************************/
552 /* Walks back from n until it finds a real cf op. */
553 static ir_node *get_cf_op(ir_node *n) {
559 if (!(is_cfop(pred) || is_fragile_op(pred) || is_Bad(pred)))
565 static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
569 if (Block_not_block_visited(node)) {
570 mark_Block_block_visited(node);
572 if(pre) pre(node, env);
574 for(i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
575 /* find the corresponding predecessor block. */
576 ir_node *pred = get_cf_op(get_Block_cfgpred(node, i));
577 pred = get_nodes_block(pred);
578 if(get_irn_opcode(pred) == iro_Block) {
580 irg_block_walk_2(pred, pre, post, env);
583 assert(get_irn_opcode(pred) == iro_Bad);
587 if(post) post(node, env);
593 /* walks only over Block nodes in the graph. Has it's own visited
594 flag, so that it can be interleaved with the other walker. */
595 void irg_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
597 ir_node *block, *pred;
600 hook_irg_block_walk(current_ir_graph, node, (generic_func *)pre, (generic_func *)post);
603 assert(!get_interprocedural_view()); /* interprocedural_view not implemented, because it
604 * interleaves with irg_walk */
605 set_using_block_visited(current_ir_graph);
606 inc_irg_block_visited(current_ir_graph);
607 block = is_Block(node) ? node : get_nodes_block(node);
608 assert(get_irn_op(block) == op_Block);
609 irg_block_walk_2(block, pre, post, env);
611 /* keepalive: the endless loops ... */
612 if (get_irn_op(node) == op_End) {
613 int arity = get_irn_arity(node);
614 for (i = 0; i < arity; i++) {
615 pred = get_irn_n(node, i);
616 if (get_irn_op(pred) == op_Block)
617 irg_block_walk_2(pred, pre, post, env);
619 /* Sometimes the blocks died, but are still reachable through Phis.
620 * Make sure the algorithms that try to remove these reach them. */
621 for (i = 0; i < arity; i++) {
622 pred = get_irn_n(node, i);
623 if (get_irn_op(pred) == op_Phi) {
624 ir_node *block = get_nodes_block(pred);
627 irg_block_walk_2(block, pre, post, env);
632 clear_using_block_visited(current_ir_graph);
636 * walk over a graph block wise
638 void irg_block_walk_graph(ir_graph *irg, irg_walk_func *pre,
639 irg_walk_func *post, void *env) {
640 ir_graph * rem = current_ir_graph;
641 current_ir_graph = irg;
642 irg_block_walk(get_irg_end(irg), pre, post, env);
643 current_ir_graph = rem;
647 * Additionally walk over all anchors. Do NOT increase the visit flag.
649 void irg_walk_anchors(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
651 ir_graph * rem = current_ir_graph;
652 current_ir_graph = irg;
654 for (i = 0; i < anchor_max; ++i) {
655 ir_node *anchor = irg->anchors[i];
657 irg_walk_2(anchor, pre, post, env);
659 current_ir_graph = rem;
662 /********************************************************************/
664 typedef struct walk_env {
671 * Walk to all constant expressions in this entity.
673 static void walk_entity(ir_entity *ent, void *env)
675 walk_env *my_env = (walk_env *)env;
677 if (get_entity_variability(ent) != variability_uninitialized) {
678 if (is_atomic_entity(ent)) {
679 irg_walk(get_atomic_ent_value(ent), my_env->pre, my_env->post, my_env->env);
682 int i, n_vals = get_compound_ent_n_values(ent);
684 for (i = 0; i < n_vals; i++)
685 irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env);
690 /* Walks over all code in const_code_irg. */
691 void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) {
695 ir_graph *rem = current_ir_graph;
696 current_ir_graph = get_const_code_irg();
697 inc_irg_visited(current_ir_graph);
703 /* Walk all types that can contain constant entities. */
704 walk_types_entities(get_glob_type(), &walk_entity, &my_env);
705 for (i = 0; i < get_irp_n_types(); i++)
706 walk_types_entities(get_irp_type(i), &walk_entity, &my_env);
707 for (i = 0; i < get_irp_n_irgs(); i++)
708 walk_types_entities(get_irg_frame_type(get_irp_irg(i)), &walk_entity, &my_env);
710 /* Walk constant array bounds. */
711 for (i = 0; i < get_irp_n_types(); i++) {
712 ir_type *tp = get_irp_type(i);
713 if (is_Array_type(tp)) {
714 for (j = 0; j < get_array_n_dimensions(tp); j++) {
715 ir_node *n = get_array_lower_bound(tp, j);
716 if (n) irg_walk(n, pre, post, env);
717 n = get_array_upper_bound(tp, j);
718 if (n) irg_walk(n, pre, post, env);
723 current_ir_graph = rem;