1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
4 * Author: Boris Boesler
7 * - execute the pre function before recursion
8 * - execute the post function after recursion
19 # include "irnode_t.h"
20 # include "irgraph.h" /* visited flag */
23 # include "typewalk.h"
28 /* walk over an interprocedural graph (callgraph). Visits only graphs in irg_set. */
29 static void irg_walk_cg(ir_node * node, int visited, eset * irg_set,
30 irg_walk_func *pre, irg_walk_func *post, void * env) {
32 ir_graph * rem = current_ir_graph;
35 assert(node && node->kind==k_ir_node);
36 if (get_irn_visited(node) >= visited) return;
38 set_irn_visited(node, visited);
40 pred = skip_Proj(node);
41 if (get_irn_op(pred) == op_CallBegin
42 || get_irn_op(pred) == op_EndReg
43 || get_irn_op(pred) == op_EndExcept) {
44 current_ir_graph = get_irn_irg(pred);
47 if (pre) pre(node, env);
49 if (is_no_Block(node))
50 irg_walk_cg(get_nodes_Block(node), visited, irg_set, pre, post, env);
52 if (get_irn_op(node) == op_Block) { /* block */
53 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
54 ir_node * exec = get_irn_n(node, i);
55 ir_node * pred = skip_Proj(exec);
56 if ((get_irn_op(pred) != op_CallBegin
57 && get_irn_op(pred) != op_EndReg
58 && get_irn_op(pred) != op_EndExcept)
59 || eset_contains(irg_set, get_irn_irg(pred))) {
60 irg_walk_cg(exec, visited, irg_set, pre, post, env);
63 } else if (get_irn_op(node) == op_Filter) {
64 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
65 ir_node * pred = get_irn_n(node, i);
66 if (get_irn_op(pred) == op_Unknown || get_irn_op(pred) == op_Bad) {
67 irg_walk_cg(pred, visited, irg_set, pre, post, env);
70 exec = skip_Proj(get_Block_cfgpred(get_nodes_Block(node), i));
71 assert(get_irn_op(exec) == op_CallBegin
72 || get_irn_op(exec) == op_EndReg
73 || get_irn_op(exec) == op_EndExcept);
74 if (eset_contains(irg_set, get_irn_irg(exec))) {
75 current_ir_graph = get_irn_irg(exec);
76 irg_walk_cg(pred, visited, irg_set, pre, post, env);
77 current_ir_graph = rem;
82 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
83 irg_walk_cg(get_irn_n(node, i), visited, irg_set, pre, post, env);
87 if (post) post(node, env);
89 current_ir_graph = rem;
93 /* Insert all ir_graphs in irg_set, that are (transitive) reachable. */
94 static void collect_irgs(ir_node * node, eset * irg_set) {
95 if (get_irn_op(node) == op_Call) {
97 for (i = get_Call_n_callees(node) - 1; i >= 0; --i) {
98 entity * ent = get_Call_callee(node, i);
99 ir_graph * irg = ent ? get_entity_irg(ent) : NULL;
100 if (irg && !eset_contains(irg_set, irg)) {
101 eset_insert(irg_set, irg);
102 irg_walk_graph(irg, (irg_walk_func *) collect_irgs, NULL, irg_set);
109 irg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
112 assert(node && node->kind==k_ir_node);
114 if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
115 set_irn_visited(node, get_irg_visited(current_ir_graph));
117 if (pre) pre(node, env);
119 if (is_no_Block(node))
120 irg_walk_2(get_nodes_Block(node), pre, post, env);
121 for (i = get_irn_arity(node) - 1; i >= 0; --i)
122 irg_walk_2(get_irn_n(node, i), pre, post, env);
124 if (post) post(node, env);
130 void irg_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
132 assert(node && node->kind==k_ir_node);
133 if (interprocedural_view) {
134 eset * irg_set = eset_create();
137 interprocedural_view = false;
138 eset_insert(irg_set, current_ir_graph);
139 irg_walk(node, (irg_walk_func *) collect_irgs, NULL, irg_set);
140 interprocedural_view = true;
141 visited = get_max_irg_visited() + 1;
142 irg_walk_cg(node, visited, irg_set, pre, post, env);
143 for (irg = eset_first(irg_set); irg; irg = eset_next(irg_set)) {
144 set_irg_visited(irg, visited);
146 eset_destroy(irg_set);
148 inc_irg_visited(current_ir_graph);
149 irg_walk_2(node, pre, post, env);
155 void irg_walk_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env) {
156 ir_graph * rem = current_ir_graph;
157 current_ir_graph = irg;
158 irg_walk(get_irg_end(irg), pre, post, env);
159 current_ir_graph = rem;
162 /* Executes irg_walk(end, pre, post, env) for all irgraphs in irprog.
163 Sets current_ir_graph properly for each walk. Conserves current
165 void all_irg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) {
169 rem = current_ir_graph;
171 for (i = 0; i < get_irp_n_irgs(); i++) {
172 irg = get_irp_irg(i);
173 current_ir_graph = irg;
174 irg_walk(get_irg_end(irg), pre, post, env);
176 current_ir_graph = rem;
179 /***************************************************************************/
181 /* Returns current_ir_graph and sets it to the irg of predecessor index
183 static INLINE ir_graph *
184 switch_irg (ir_node *n, int index) {
185 ir_graph *old_current = current_ir_graph;
187 if (interprocedural_view) {
188 /* Only Filter and Block nodes can have predecessors in other graphs. */
189 if (get_irn_op(n) == op_Filter)
190 n = get_nodes_Block(n);
191 if (get_irn_op(n) == op_Block) {
192 ir_node *cfop = skip_Proj(get_Block_cfgpred(n, index));
193 if (is_ip_cfop(cfop)) {
194 current_ir_graph = get_irn_irg(cfop);
203 cg_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void * env)
206 ir_graph *rem = NULL;
209 if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
210 set_irn_visited(node, get_irg_visited(current_ir_graph));
212 if (pre) pre(node, env);
214 if (is_no_Block(node))
215 cg_walk_2(get_nodes_Block(node), pre, post, env);
216 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
217 rem = switch_irg(node, i);
218 cg_walk_2(get_irn_n(node, i), pre, post, env);
219 current_ir_graph = rem;
222 if (post) post(node, env);
228 /* Walks all irgs in interprocedural view. Visits each node only once. */
229 void cg_walk(irg_walk_func *pre, irg_walk_func *post, void *env) {
231 ir_graph *rem = current_ir_graph;
232 int rem_view = interprocedural_view;
234 interprocedural_view = true;
236 inc_max_irg_visited();
237 /* Fix all irg_visited flags */
238 for (i = 0; i < get_irp_n_irgs(); i++)
239 set_irg_visited(get_irp_irg(i), get_max_irg_visited());
241 /* Walk starting at unreachable procedures. */
242 for (i = 0; i < get_irp_n_irgs(); i++) {
244 current_ir_graph = get_irp_irg(i);
246 sb = get_irg_start_block(current_ir_graph);
247 if ((get_Block_n_cfgpreds(sb) > 1) ||
248 (get_nodes_Block(get_Block_cfgpred(sb, 0)) != sb)) continue;
250 cg_walk_2(get_irg_end(current_ir_graph), pre, post, env);
253 interprocedural_view = rem_view;
254 current_ir_graph = rem;
258 /***************************************************************************/
260 /* Walks back from n until it finds a real cf op. */
261 static ir_node *get_cf_op(ir_node *n) {
267 if (!(is_cfop(pred) || is_fragile_op(pred) ||
268 (get_irn_op(pred) == op_Bad)))
274 static void irg_block_walk_2(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
277 assert(get_irn_opcode(node) == iro_Block);
279 if(get_Block_block_visited(node) < get_irg_block_visited(current_ir_graph)) {
280 set_Block_block_visited(node, get_irg_block_visited(current_ir_graph));
282 if(pre) pre(node, env);
284 for(i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
285 /* find the corresponding predecessor block. */
286 ir_node *pred = get_cf_op(get_Block_cfgpred(node, i));
287 pred = get_nodes_Block(pred);
288 if(get_irn_opcode(pred) == iro_Block) {
290 irg_block_walk_2(pred, pre, post, env);
293 assert(get_irn_opcode(pred) == iro_Bad);
297 if(post) post(node, env);
303 /* walks only over Block nodes in the graph. Has it's own visited
304 flag, so that it can be interleaved with the other walker. */
305 void irg_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post, void *env)
307 ir_node *block, *pred;
311 assert(!interprocedural_view); /* interprocedural_view not implemented, because it
312 * interleaves with irg_walk */
313 inc_irg_block_visited(current_ir_graph);
314 if (is_no_Block(node)) block = get_nodes_Block(node); else block = node;
315 assert(get_irn_opcode(block) == iro_Block);
316 irg_block_walk_2(block, pre, post, env);
317 /* keepalive: the endless loops ... */
318 if (get_irn_op(node) == op_End)
319 for (i = 0; i < get_irn_arity(node); i++) {
320 pred = get_irn_n(node, i);
321 if (get_irn_op(pred) == op_Block)
322 irg_block_walk_2(pred, pre, post, env);
329 void irg_block_walk_graph(ir_graph *irg, irg_walk_func *pre,
330 irg_walk_func *post, void *env) {
331 ir_graph * rem = current_ir_graph;
332 current_ir_graph = irg;
333 irg_block_walk(get_irg_end(irg), pre, post, env);
334 current_ir_graph = rem;
337 /********************************************************************/
339 typedef struct walk_env {
345 /* Walk to all constant expressions in this entity. */
346 static void walk_entity(entity *ent, void *env) {
347 walk_env *my_env = (walk_env *)env;
348 if (get_entity_variability(ent) != uninitialized) {
349 if (is_atomic_entity(ent)) {
350 irg_walk(get_atomic_ent_value(ent), my_env->pre, my_env->post, my_env->env);
353 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
354 irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env);
360 /* Walks over all code in const_code_irg. */
361 void walk_const_code(irg_walk_func *pre, irg_walk_func *post, void *env) {
365 ir_graph *rem = current_ir_graph;
366 current_ir_graph = get_const_code_irg();
367 inc_irg_visited(current_ir_graph);
373 /* Walk all types that can contain constant entities. */
374 walk_types_entities(get_glob_type(), &walk_entity, &my_env);
375 for (i = 0; i < get_irp_n_types(); i++)
376 walk_types_entities(get_irp_type(i), &walk_entity, &my_env);
377 for (i = 0; i < get_irp_n_irgs(); i++)
378 walk_types_entities(get_irg_frame_type(get_irp_irg(i)), &walk_entity, &my_env);
380 /* Walk constant array bounds. */
381 for (i = 0; i < get_irp_n_types(); i++) {
382 type *tp = get_irp_type(i);
383 if (is_array_type(tp)) {
384 for (j = 0; j < get_array_n_dimensions(tp); j++) {
386 n = get_array_lower_bound(tp, j);
387 if (n) irg_walk(n, pre, post, env);
388 n = get_array_upper_bound(tp, j);
389 if (n) irg_walk(n, pre, post, env);
394 current_ir_graph = rem;
398 /********************************************************************/
399 /** Walking support for interprocedural analysis **/
401 /** @@@ Don't use, not operational yet, doesn't grok recursions!! **/
402 /** @@@ Header for irgwalk.h, here until it works. **/
404 /** Interprocedural walking should not walk all predecessors of **/
405 /** all nodes. When leaving a procedure the walker should only **/
406 /** follow the edge corresponding to the most recent entry of the **/
407 /** procedure. The following functions use an internal stack to **/
408 /** remember the current call site of a procedure. **/
409 /** They also set current_ir_graph correctly. **/
411 /** Usage example: **/
413 /** void init_ip_walk (); **/
414 /** work_on_graph(some_end_node); **/
415 /** void finish_ip_walk(); **/
417 /** work_on_graph(ir_node *n) { **/
418 /** for (i = 0; i < get_irn_arity(n); i++) { **/
419 /** if (...) continue; **/
420 /** ir_node *m = get_irn_ip_pred(n, i); **/
421 /** if !m continue; **/
422 /** work_on_graph(m); **/
423 /** return_recur(n, i); **/
426 /********************************************************************/
428 /* Call for i in {0|-1 ... get_irn_arity(n)}.
429 If n is a conventional node returns the same node as get_irn_n(n, i).
430 If the predecessors of n are in the callee of the procedure n belongs
431 to, returns get_irn_n(n, i) if this node is in the callee on the top
432 of the stack, else returns NULL.
433 If the predecessors of n are in a procedure called by the procedure n
434 belongs to pushes the caller on the caller stack in the callee.
435 Sets current_ir_graph to the graph the node returned is in. */
436 ir_node *get_irn_ip_pred(ir_node *n, int pos);
438 /* If get_irn_ip_pred() returned a node (not NULL) this must be
439 called to clear up the stacks.
440 Sets current_ir_graph to the graph n is in. */
441 void return_recur(ir_node *n, int pos);
444 /********************************************************************/
445 /** Walking support for interprocedural analysis **/
446 /********************************************************************/
448 #define MIN_STACK_SIZE 40
450 typedef struct callsite_stack {
455 /* Access the stack in the irg **************************************/
458 set_irg_callsite_stack(ir_graph *g, callsite_stack *s) {
462 static INLINE callsite_stack *
463 get_irg_callsite_stack(ir_graph *g) {
464 return (callsite_stack *) get_irg_link(g);
467 /* A stack of callsites *********************************************/
469 /* @@@ eventually change the implementation so the new_ only sets the field
470 to NULL, and the stack is only allocated if used. Saves Memory! */
471 static INLINE callsite_stack *
472 new_callsite_stack(ir_graph *g) {
473 callsite_stack *res = (callsite_stack *)malloc(sizeof(callsite_stack));
475 res->s = NEW_ARR_F (ir_node *, MIN_STACK_SIZE);
476 set_irg_callsite_stack(g, res);
481 free_callsite_stack(ir_graph *g) {
482 callsite_stack *s = get_irg_callsite_stack(g);
488 push_callsite(ir_graph *callee, ir_node *callsite) {
489 callsite_stack *s = get_irg_callsite_stack(callee);
490 if (s->tos == ARR_LEN(s->s)) {
491 int nlen = ARR_LEN (s->s) * 2;
492 ARR_RESIZE (ir_node *, s->s, nlen);
494 s->s[s->tos] = callsite;
498 static INLINE ir_node *
499 get_top_of_callsite_stack(ir_graph *callee) {
500 callsite_stack *s = get_irg_callsite_stack(callee);
501 return (s->s[s->tos-1]);
505 ir_node * pop_callsite(ir_graph *callee) {
506 callsite_stack *s = get_irg_callsite_stack(callee);
508 return (s->s[s->tos]);
512 /* Initialization routines ******************************************/
514 void init_ip_walk (void) {
516 for (i = 0; i < get_irp_n_irgs(); i++)
517 new_callsite_stack(get_irp_irg(i));
520 void finish_ip_walk(void) {
522 for (i = 0; i < get_irp_n_irgs(); i++)
523 free_callsite_stack(get_irp_irg(i));
524 set_irg_link(get_irp_irg(i), NULL);
527 /* walker routines **************************************************/
529 /* cf_pred is End* */
531 enter_procedure(ir_node *block, ir_node *cf_pred, int pos) {
533 ir_graph *irg = get_irn_irg(cf_pred);
535 assert(interprocedural_view);
537 interprocedural_view = 0;
538 callbegin = skip_Proj(get_irn_n(block, 0));
539 assert(get_irn_op(callbegin) == op_CallBegin);
540 interprocedural_view = 1;
542 push_callsite(irg, callbegin);
543 current_ir_graph = irg;
546 /* cf_pred is CallBegin */
548 leave_procedure(ir_node *block, ir_node *cf_pred, int pos) {
549 ir_node *tos = get_top_of_callsite_stack(current_ir_graph);
551 assert(get_irn_op(cf_pred) == op_CallBegin);
553 if (tos == cf_pred) {
554 /* We entered this procedure by the call pred pos refers to. */
555 pop_callsite(current_ir_graph);
556 current_ir_graph = get_CallBegin_irg(cf_pred);
564 ir_node *get_irn_ip_pred(ir_node *n, int pos) {
566 if (interprocedural_view) {
568 /* Find the cf_pred refering to pos. */
571 if (get_irn_opcode(n) == iro_Filter) block = get_nodes_Block(n);
572 cf_pred = skip_Proj(get_irn_n(block, pos));
574 /* Check whether we enter or leave a procedure and act according. */
575 if ((get_irn_op(cf_pred) == op_EndReg) ||
576 (get_irn_op(cf_pred) == op_EndExcept))
577 enter_procedure(block, cf_pred, pos);
578 if (get_irn_op(cf_pred) == op_CallBegin)
579 if (!leave_procedure(block, cf_pred, pos)) return NULL;
582 return get_irn_n(n, pos);
586 re_enter_procedure(ir_node *block, ir_node *cf_pred, int pos) {
587 ir_node *callbegin = pop_callsite(current_ir_graph);
588 assert(interprocedural_view);
589 current_ir_graph = get_CallBegin_irg(callbegin);
593 re_leave_procedure(ir_node *block, ir_node *cf_pred, int pos) {
597 assert(get_irn_op(cf_pred) == op_CallBegin);
599 /* Find the irg block is in. */
600 proj = get_Block_cg_cfgpred(block, pos);
601 assert(is_Proj(proj));
602 callee = get_entity_irg(get_Call_callee(get_CallBegin_call(cf_pred),
603 get_Proj_proj(proj)));
604 current_ir_graph = callee;
605 push_callsite(callee, cf_pred);
609 return_recur(ir_node *n, int pos) {
613 if (!interprocedural_view) return;
615 /* Find the cf_pred refering to pos. */
617 if (get_irn_opcode(n) == iro_Filter) block = get_nodes_Block(n);
618 cf_pred = skip_Proj(get_irn_n(block, pos));
620 /* Check whether we re_enter or re_leave a procedure and act according. */
621 if ((get_irn_op(cf_pred) == op_EndReg) ||
622 (get_irn_op(cf_pred) == op_EndExcept))
623 re_enter_procedure(block, cf_pred, pos);
624 if (get_irn_op(cf_pred) == op_CallBegin)
625 re_leave_procedure(block, cf_pred, pos);