3 * File name: ir/ir/irgwalk.c
5 * Author: Boris Boesler
6 * Modified by: Goetz Lindenmaier
9 * Copyright: (c) 1999-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
14 * traverse an ir graph
15 * - execute the pre function before recursion
16 * - execute the post function after recursion
26 # include "irnode_t.h"
27 # include "irgraph_t.h" /* visited flag */
30 # include "typewalk.h"
35 /* walk over an interprocedural graph (callgraph). Visits only graphs in irg_set. */
36 static void irg_walk_cg(ir_node * node, int visited, eset * irg_set,
37 irg_walk_func *pre, irg_walk_func *post, void * env) {
39 ir_graph * rem = current_ir_graph;
42 assert(node && node->kind == k_ir_node);
43 if (get_irn_visited(node) >= visited) return;
45 set_irn_visited(node, visited);
47 pred = skip_Proj(node);
48 if (get_irn_op(pred) == op_CallBegin
49 || get_irn_op(pred) == op_EndReg
50 || get_irn_op(pred) == op_EndExcept) {
51 current_ir_graph = get_irn_irg(pred);
54 if (pre) pre(node, env);
56 if (is_no_Block(node))
57 irg_walk_cg(get_nodes_block(node), visited, irg_set, pre, post, env);
59 if (get_irn_op(node) == op_Block) { /* block */
60 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
61 ir_node * exec = get_irn_n(node, i);
62 ir_node * pred = skip_Proj(exec);
63 if ((get_irn_op(pred) != op_CallBegin
64 && get_irn_op(pred) != op_EndReg
65 && get_irn_op(pred) != op_EndExcept)
66 || eset_contains(irg_set, get_irn_irg(pred))) {
67 irg_walk_cg(exec, visited, irg_set, pre, post, env);
70 } else if (get_irn_op(node) == op_Filter) {
71 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
72 ir_node * pred = get_irn_n(node, i);
73 if (get_irn_op(pred) == op_Unknown || get_irn_op(pred) == op_Bad) {
74 irg_walk_cg(pred, visited, irg_set, pre, post, env);
77 exec = skip_Proj(get_Block_cfgpred(get_nodes_block(node), i));
78 assert(get_irn_op(exec) == op_CallBegin
79 || get_irn_op(exec) == op_EndReg
80 || get_irn_op(exec) == op_EndExcept);
81 if (eset_contains(irg_set, get_irn_irg(exec))) {
82 current_ir_graph = get_irn_irg(exec);
83 irg_walk_cg(pred, visited, irg_set, pre, post, env);
84 current_ir_graph = rem;
89 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
90 irg_walk_cg(get_irn_n(node, i), visited, irg_set, pre, post, env);
94 if (post) post(node, env);
96 current_ir_graph = rem;
100 /* Insert all ir_graphs in irg_set, that are (transitive) reachable. */
101 static void collect_irgs(ir_node * node, eset * irg_set) {
102 if (get_irn_op(node) == op_Call) {
104 for (i = get_Call_n_callees(node) - 1; i >= 0; --i) {
105 entity * ent = get_Call_callee(node, i);
106 ir_graph * irg = ent ? get_entity_irg(ent) : NULL;
107 if (irg && !eset_contains(irg_set, irg)) {
108 eset_insert(irg_set, irg);
109 irg_walk_graph(irg, (irg_walk_func *) collect_irgs, NULL, irg_set);
116 irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
119 assert(node && node->kind==k_ir_node);
121 if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
122 set_irn_visited(node, get_irg_visited(current_ir_graph));
124 if (pre) pre(node, env);
126 if (is_no_Block(node))
127 irg_walk_2(get_nodes_block(node), pre, post, env);
128 for (i = get_irn_arity(node) - 1; i >= 0; --i)
129 irg_walk_2(get_irn_n(node, i), pre, post, env);
131 if (post) post(node, env);
134 if (node->visited < current_ir_graph->visited) {
135 set_irn_visited(node, current_ir_graph->visited);
137 if (pre) pre(node, env);
139 if (node->op != op_Block)
140 irg_walk_2(get_irn_n(node, -1), pre, post, env);
141 for (i = get_irn_arity(node) - 1; i >= 0; --i)
142 irg_walk_2(get_irn_n(node, i), pre, post, env);
144 if (post) post(node, env);
150 void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
152 assert(node && node->kind==k_ir_node);
153 if (interprocedural_view) {
154 eset * irg_set = eset_create();
157 interprocedural_view = false;
158 eset_insert(irg_set, current_ir_graph);
159 irg_walk(node, (irg_walk_func *) collect_irgs, NULL, irg_set);
160 interprocedural_view = true;
161 visited = get_max_irg_visited() + 1;
162 for (irg = eset_first(irg_set); irg; irg = eset_next(irg_set)) {
163 set_irg_visited(irg, visited);
165 irg_walk_cg(node, visited, irg_set, pre, post, env);
166 eset_destroy(irg_set);
168 inc_irg_visited(current_ir_graph);
169 irg_walk_2(node, pre, post, env);
175 void irg_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
176 ir_graph * rem = current_ir_graph;
177 current_ir_graph = irg;
178 irg_walk(get_irg_end(irg), pre, post, env);
179 current_ir_graph = rem;
182 /* Executes irg_walk(end, pre, post, env) for all irgraphs in irprog.
183 Sets current_ir_graph properly for each walk. Conserves current
185 void all_irg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) {
189 rem = current_ir_graph;
191 for (i = 0; i < get_irp_n_irgs(); i++) {
192 irg = get_irp_irg(i);
193 current_ir_graph = irg;
194 irg_walk(get_irg_end(irg), pre, post, env);
196 current_ir_graph = rem;
199 /***************************************************************************/
201 /* Returns current_ir_graph and sets it to the irg of predecessor index
203 static INLINE ir_graph *
204 switch_irg (ir_node *n, int index) {
205 ir_graph *old_current = current_ir_graph;
207 if (interprocedural_view) {
208 /* Only Filter and Block nodes can have predecessors in other graphs. */
209 if (get_irn_op(n) == op_Filter)
210 n = get_nodes_block(n);
211 if (get_irn_op(n) == op_Block) {
212 ir_node *cfop = skip_Proj(get_Block_cfgpred(n, index));
213 if (is_ip_cfop(cfop)) {
214 current_ir_graph = get_irn_irg(cfop);
223 cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
226 ir_graph *rem = NULL;
229 if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
230 set_irn_visited(node, get_irg_visited(current_ir_graph));
232 if (pre) pre(node, env);
234 if (is_no_Block(node))
235 cg_walk_2(get_nodes_block(node), pre, post, env);
236 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
237 rem = switch_irg(node, i); /* @@@ AS: Is this wrong? We do have to
238 switch to the irg of the predecessor, don't we? */
239 cg_walk_2(get_irn_n(node, i), pre, post, env);
240 current_ir_graph = rem;
243 if (post) post(node, env);
249 /* Walks all irgs in interprocedural view. Visits each node only once. */
250 void cg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) {
252 ir_graph *rem = current_ir_graph;
253 int rem_view = interprocedural_view;
255 interprocedural_view = true;
257 inc_max_irg_visited();
258 /* Fix all irg_visited flags */
259 for (i = 0; i < get_irp_n_irgs(); i++)
260 set_irg_visited(get_irp_irg(i), get_max_irg_visited());
262 /* Walk starting at unreachable procedures. Only these
263 * have End blocks visible in interprocedural view. */
264 for (i = 0; i < get_irp_n_irgs(); i++) {
266 current_ir_graph = get_irp_irg(i);
268 sb = get_irg_start_block(current_ir_graph);
270 if ((get_Block_n_cfgpreds(sb) > 1) ||
271 (get_nodes_block(get_Block_cfgpred(sb, 0)) != sb)) continue;
273 cg_walk_2(get_irg_end(current_ir_graph), pre, post, env);
276 /* Check whether we walked all procedures: there could be procedures
277 with cyclic calls but no call from the outside. */
278 for (i = 0; i < get_irp_n_irgs(); i++) {
280 current_ir_graph = get_irp_irg(i);
282 /* Test start block: if inner procedure end and end block are not
283 * visible and therefore not marked. */
284 sb = get_irg_start_block(current_ir_graph);
285 if (get_irn_visited(sb) < get_irg_visited(current_ir_graph)) {
286 cg_walk_2(sb, pre, post, env);
290 /* Walk all endless loops in inner procedures.
291 * We recognize an inner procedure if the End node is not visited. */
292 for (i = 0; i < get_irp_n_irgs(); i++) {
294 current_ir_graph = get_irp_irg(i);
295 e = get_irg_end(current_ir_graph);
296 if (get_irn_visited(e) < get_irg_visited(current_ir_graph)) {
298 /* Don't visit the End node. */
299 for (j = 0; j < get_End_n_keepalives(e); j++)
300 cg_walk_2(get_End_keepalive(e, j), pre, post, env);
304 interprocedural_view = rem_view;
305 current_ir_graph = rem;
309 /***************************************************************************/
311 /* Walks back from n until it finds a real cf op. */
312 static ir_node *get_cf_op(ir_node *n) {
318 if (!(is_cfop(pred) || is_fragile_op(pred) ||
319 (get_irn_op(pred) == op_Bad)))
325 static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
328 assert(get_irn_opcode(node) == iro_Block);
330 if(get_Block_block_visited(node) < get_irg_block_visited(current_ir_graph)) {
331 set_Block_block_visited(node, get_irg_block_visited(current_ir_graph));
333 if(pre) pre(node, env);
335 for(i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
336 /* find the corresponding predecessor block. */
337 ir_node *pred = get_cf_op(get_Block_cfgpred(node, i));
338 pred = get_nodes_block(pred);
339 if(get_irn_opcode(pred) == iro_Block) {
341 irg_block_walk_2(pred, pre, post, env);
344 assert(get_irn_opcode(pred) == iro_Bad);
348 if(post) post(node, env);
354 /* walks only over Block nodes in the graph. Has it's own visited
355 flag, so that it can be interleaved with the other walker. */
356 void irg_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
358 ir_node *block, *pred;
362 assert(!interprocedural_view); /* interprocedural_view not implemented, because it
363 * interleaves with irg_walk */
364 inc_irg_block_visited(current_ir_graph);
365 if (is_no_Block(node)) block = get_nodes_block(node); else block = node;
366 assert(get_irn_opcode(block) == iro_Block);
367 irg_block_walk_2(block, pre, post, env);
368 /* keepalive: the endless loops ... */
369 if (get_irn_op(node) == op_End) {
370 int arity = get_irn_arity(node);
371 for (i = 0; i < arity; i++) {
372 pred = get_irn_n(node, i);
373 if (get_irn_op(pred) == op_Block)
374 irg_block_walk_2(pred, pre, post, env);
382 void irg_block_walk_graph(ir_graph *irg, irg_walk_func *pre,
383 irg_walk_func *post, void *env) {
384 ir_graph * rem = current_ir_graph;
385 current_ir_graph = irg;
386 irg_block_walk(get_irg_end(irg), pre, post, env);
387 current_ir_graph = rem;
390 /********************************************************************/
392 typedef struct walk_env {
398 /* Walk to all constant expressions in this entity. */
399 static void walk_entity(entity *ent, void *env)
401 walk_env *my_env = (walk_env *)env;
403 if (get_entity_variability(ent) != variability_uninitialized) {
404 if (is_atomic_entity(ent)) {
405 irg_walk(get_atomic_ent_value(ent), my_env->pre, my_env->post, my_env->env);
408 int i, n = get_compound_ent_n_values(ent);
410 for (i = 0; i < n; i++)
411 irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env);
416 /* Walks over all code in const_code_irg. */
417 void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) {
421 ir_graph *rem = current_ir_graph;
422 current_ir_graph = get_const_code_irg();
423 inc_irg_visited(current_ir_graph);
429 /* Walk all types that can contain constant entities. */
430 walk_types_entities(get_glob_type(), &walk_entity, &my_env);
431 for (i = 0; i < get_irp_n_types(); i++)
432 walk_types_entities(get_irp_type(i), &walk_entity, &my_env);
433 for (i = 0; i < get_irp_n_irgs(); i++)
434 walk_types_entities(get_irg_frame_type(get_irp_irg(i)), &walk_entity, &my_env);
436 /* Walk constant array bounds. */
437 for (i = 0; i < get_irp_n_types(); i++) {
438 type *tp = get_irp_type(i);
439 if (is_array_type(tp)) {
440 for (j = 0; j < get_array_n_dimensions(tp); j++) {
442 n = get_array_lower_bound(tp, j);
443 if (n) irg_walk(n, pre, post, env);
444 n = get_array_upper_bound(tp, j);
445 if (n) irg_walk(n, pre, post, env);
450 current_ir_graph = rem;
454 /********************************************************************/
455 /** Walking support for interprocedural analysis **/
457 /** @@@ Don't use, not operational yet, doesn't grok recursions!! **/
458 /** @@@ Header for irgwalk.h, here until it works. **/
460 /** Interprocedural walking should not walk all predecessors of **/
461 /** all nodes. When leaving a procedure the walker should only **/
462 /** follow the edge corresponding to the most recent entry of the **/
463 /** procedure. The following functions use an internal stack to **/
464 /** remember the current call site of a procedure. **/
465 /** They also set current_ir_graph correctly. **/
467 /** Usage example: **/
469 /** void init_ip_walk (); **/
470 /** work_on_graph(some_end_node); **/
471 /** void finish_ip_walk(); **/
473 /** work_on_graph(ir_node *n) { **/
474 /** for (i = 0; i < get_irn_arity(n); i++) { **/
475 /** if (...) continue; **/
476 /** ir_node *m = get_irn_ip_pred(n, i); **/
477 /** if !m continue; **/
478 /** work_on_graph(m); **/
479 /** return_recur(n, i); **/
482 /********************************************************************/
484 /* Call for i in {0|-1 ... get_irn_arity(n)}.
485 If n is a conventional node returns the same node as get_irn_n(n, i).
486 If the predecessors of n are in the callee of the procedure n belongs
487 to, returns get_irn_n(n, i) if this node is in the callee on the top
488 of the stack, else returns NULL.
489 If the predecessors of n are in a procedure called by the procedure n
490 belongs to pushes the caller on the caller stack in the callee.
491 Sets current_ir_graph to the graph the node returned is in. */
492 ir_node *get_irn_ip_pred(ir_node *n, int pos);
494 /* If get_irn_ip_pred() returned a node (not NULL) this must be
495 called to clear up the stacks.
496 Sets current_ir_graph to the graph n is in. */
497 void return_recur(ir_node *n, int pos);
500 /********************************************************************/
501 /** Walking support for interprocedural analysis **/
502 /********************************************************************/
504 #define MIN_STACK_SIZE 40
506 typedef struct callsite_stack {
511 /* Access the stack in the irg **************************************/
514 set_irg_callsite_stack(ir_graph *g, callsite_stack *s) {
518 static INLINE callsite_stack *
519 get_irg_callsite_stack(ir_graph *g) {
520 return (callsite_stack *) get_irg_link(g);
523 /* A stack of callsites *********************************************/
525 /* @@@ eventually change the implementation so the new_ only sets the field
526 to NULL, and the stack is only allocated if used. Saves Memory! */
527 static INLINE callsite_stack *
528 new_callsite_stack(ir_graph *g) {
529 callsite_stack *res = (callsite_stack *)malloc(sizeof(callsite_stack));
531 res->s = NEW_ARR_F (ir_node *, MIN_STACK_SIZE);
532 set_irg_callsite_stack(g, res);
537 free_callsite_stack(ir_graph *g) {
538 callsite_stack *s = get_irg_callsite_stack(g);
544 push_callsite(ir_graph *callee, ir_node *callsite) {
545 callsite_stack *s = get_irg_callsite_stack(callee);
546 if (s->tos == ARR_LEN(s->s)) {
547 int nlen = ARR_LEN (s->s) * 2;
548 ARR_RESIZE (ir_node *, s->s, nlen);
550 s->s[s->tos] = callsite;
554 static INLINE ir_node *
555 get_top_of_callsite_stack(ir_graph *callee) {
556 callsite_stack *s = get_irg_callsite_stack(callee);
557 return (s->s[s->tos-1]);
561 ir_node * pop_callsite(ir_graph *callee) {
562 callsite_stack *s = get_irg_callsite_stack(callee);
564 return (s->s[s->tos]);
568 /* Initialization routines ******************************************/
570 void init_ip_walk (void) {
572 for (i = 0; i < get_irp_n_irgs(); i++)
573 new_callsite_stack(get_irp_irg(i));
576 void finish_ip_walk(void) {
578 for (i = 0; i < get_irp_n_irgs(); i++)
579 free_callsite_stack(get_irp_irg(i));
580 set_irg_link(get_irp_irg(i), NULL);
583 /* walker routines **************************************************/
585 /* cf_pred is End* */
587 enter_procedure(ir_node *block, ir_node *cf_pred, int pos) {
589 ir_graph *irg = get_irn_irg(cf_pred);
591 assert(interprocedural_view);
593 interprocedural_view = 0;
594 callbegin = skip_Proj(get_irn_n(block, 0));
595 assert(get_irn_op(callbegin) == op_CallBegin);
596 interprocedural_view = 1;
598 push_callsite(irg, callbegin);
599 current_ir_graph = irg;
602 /* cf_pred is CallBegin */
604 leave_procedure(ir_node *block, ir_node *cf_pred, int pos) {
605 ir_node *tos = get_top_of_callsite_stack(current_ir_graph);
607 assert(get_irn_op(cf_pred) == op_CallBegin);
609 if (tos == cf_pred) {
610 /* We entered this procedure by the call pred pos refers to. */
611 pop_callsite(current_ir_graph);
612 current_ir_graph = get_CallBegin_irg(cf_pred);
620 ir_node *get_irn_ip_pred(ir_node *n, int pos) {
622 if (interprocedural_view) {
624 /* Find the cf_pred refering to pos. */
627 if (get_irn_opcode(n) == iro_Filter) block = get_nodes_block(n);
628 cf_pred = skip_Proj(get_irn_n(block, pos));
630 /* Check whether we enter or leave a procedure and act according. */
631 if ((get_irn_op(cf_pred) == op_EndReg) ||
632 (get_irn_op(cf_pred) == op_EndExcept))
633 enter_procedure(block, cf_pred, pos);
634 if (get_irn_op(cf_pred) == op_CallBegin)
635 if (!leave_procedure(block, cf_pred, pos)) return NULL;
638 return get_irn_n(n, pos);
642 re_enter_procedure(ir_node *block, ir_node *cf_pred, int pos) {
643 ir_node *callbegin = pop_callsite(current_ir_graph);
644 assert(interprocedural_view);
645 current_ir_graph = get_CallBegin_irg(callbegin);
649 re_leave_procedure(ir_node *block, ir_node *cf_pred, int pos) {
653 assert(get_irn_op(cf_pred) == op_CallBegin);
655 /* Find the irg block is in. */
656 proj = get_Block_cg_cfgpred(block, pos);
657 assert(is_Proj(proj));
658 callee = get_entity_irg(get_Call_callee(get_CallBegin_call(cf_pred),
659 get_Proj_proj(proj)));
660 current_ir_graph = callee;
661 push_callsite(callee, cf_pred);
665 return_recur(ir_node *n, int pos) {
669 if (!interprocedural_view) return;
671 /* Find the cf_pred refering to pos. */
673 if (get_irn_opcode(n) == iro_Filter) block = get_nodes_block(n);
674 cf_pred = skip_Proj(get_irn_n(block, pos));
676 /* Check whether we re_enter or re_leave a procedure and act according. */
677 if ((get_irn_op(cf_pred) == op_EndReg) ||
678 (get_irn_op(cf_pred) == op_EndExcept))
679 re_enter_procedure(block, cf_pred, pos);
680 if (get_irn_op(cf_pred) == op_CallBegin)
681 re_leave_procedure(block, cf_pred, pos);