1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
2 ** All rights reserved.
4 ** Author: Boris Boesler
6 ** traverse an ir graph
7 ** - execute the pre function before recursion
8 ** - execute the post function after recursion
20 # include "irgraph.h" /* visited flag */
27 /* walk over an interprocedural graph (callgraph). Visits only graphs in irg_set. */
28 static void irg_walk_cg(ir_node * node, int visited, eset * irg_set,
29 irg_walk_func pre, irg_walk_func post, void * env) {
31 ir_graph * rem = current_ir_graph;
35 if (get_irn_visited(node) >= visited) return;
37 set_irn_visited(node, visited);
39 pred = skip_Proj(node);
40 if (get_irn_op(pred) == op_CallBegin
41 || get_irn_op(pred) == op_EndReg
42 || get_irn_op(pred) == op_EndExcept) {
43 current_ir_graph = get_irn_irg(pred);
46 if (pre) pre(node, env);
48 if (is_no_Block(node)) irg_walk_cg(get_nodes_Block(node), visited, irg_set, pre, post, env);
50 if (get_irn_op(node) == op_Block) { /* block */
51 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
52 ir_node * exec = get_irn_n(node, i);
53 ir_node * pred = skip_Proj(exec);
54 if ((get_irn_op(pred) != op_CallBegin
55 && get_irn_op(pred) != op_EndReg
56 && get_irn_op(pred) != op_EndExcept)
57 || eset_contains(irg_set, get_irn_irg(pred))) {
58 irg_walk_cg(exec, visited, irg_set, pre, post, env);
61 } else if (get_irn_op(node) == op_Filter) {
62 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
63 ir_node * pred = get_irn_n(node, i);
64 if (get_irn_op(pred) == op_Unknown || get_irn_op(pred) == op_Bad) {
65 irg_walk_cg(pred, visited, irg_set, pre, post, env);
68 exec = skip_Proj(get_Block_cfgpred(get_nodes_Block(node), i));
69 assert(get_irn_op(exec) == op_CallBegin
70 || get_irn_op(exec) == op_EndReg
71 || get_irn_op(exec) == op_EndExcept);
72 if (eset_contains(irg_set, get_irn_irg(exec))) {
73 current_ir_graph = get_irn_irg(exec);
74 irg_walk_cg(pred, visited, irg_set, pre, post, env);
75 current_ir_graph = rem;
80 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
81 irg_walk_cg(get_irn_n(node, i), visited, irg_set, pre, post, env);
85 if (post) post(node, env);
87 current_ir_graph = rem;
91 /* Insert all ir_graphs in irg_set, that are (transitive) reachable. */
92 static void collect_irgs(ir_node * node, eset * irg_set) {
93 if (get_irn_op(node) == op_Call) {
95 for (i = get_Call_n_callees(node) - 1; i >= 0; --i) {
96 entity * ent = get_Call_callee(node, i);
97 ir_graph * irg = ent ? get_entity_irg(ent) : NULL;
98 if (irg && !eset_contains(irg_set, irg)) {
99 eset_insert(irg_set, irg);
100 irg_walk_graph(irg, (irg_walk_func) collect_irgs, NULL, irg_set);
107 void irg_walk_2(ir_node *node, irg_walk_func pre, irg_walk_func post, void * env)
113 /* printf(" - "); DDMSG2(node); */
115 if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
117 /* printf(" -> "); DDMSG2(node); */
118 set_irn_visited(node, get_irg_visited(current_ir_graph));
124 if (is_no_Block(node)) {
125 irg_walk_2(get_nodes_Block(node), pre, post, env);
127 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
128 /* printf(" "); DDMSG2(node);
129 printf(" "); DDMSG2(get_irn_n(node, i)); */
131 irg_walk_2(get_irn_n(node, i), pre, post, env);
134 /* printf(" <- "); DDMSG2(node); */
142 void irg_walk(ir_node *node, irg_walk_func pre, irg_walk_func post, void *env)
145 if (interprocedural_view) {
146 eset * irg_set = eset_create();
149 interprocedural_view = false;
150 eset_insert(irg_set, current_ir_graph);
151 irg_walk(node, (irg_walk_func) collect_irgs, NULL, irg_set);
152 interprocedural_view = true;
153 visited = get_max_irg_visited() + 1;
154 irg_walk_cg(node, visited, irg_set, pre, post, env);
155 for (irg = eset_first(irg_set); irg; irg = eset_next(irg_set)) {
156 set_irg_visited(irg, visited);
158 eset_destroy(irg_set);
160 inc_irg_visited(current_ir_graph);
161 irg_walk_2(node, pre, post, env);
167 void irg_walk_graph(ir_graph *irg, irg_walk_func pre, irg_walk_func post, void *env) {
168 ir_graph * rem = current_ir_graph;
169 current_ir_graph = irg;
170 irg_walk(get_irg_end(irg), pre, post, env);
171 current_ir_graph = rem;
175 /***************************************************************************/
177 /* Executes irg_walk(end, pre, post, env) for all irgraphs in irprog.
178 Sets current_ir_graph properly for each walk. Conserves current
180 void all_irg_walk(irg_walk_func pre, irg_walk_func post, void *env) {
184 rem = current_ir_graph;
186 for (i = 0; i < get_irp_n_irgs(); i++) {
187 irg = get_irp_irg(i);
188 current_ir_graph = irg;
189 irg_walk(get_irg_end(irg), pre, post, env);
191 current_ir_graph = rem;
194 /***************************************************************************/
196 /* Walks back from n until it finds a real cf op. */
197 ir_node *get_cf_op(ir_node *n) {
203 if (!(is_cfop(pred) || is_fragile_op(pred) ||
204 (get_irn_op(pred) == op_Bad)))
210 void irg_block_walk_2(ir_node *node, irg_walk_func pre, irg_walk_func post, void *env)
214 assert(get_irn_opcode(node) == iro_Block);
216 if(get_Block_block_visited(node) < get_irg_block_visited(current_ir_graph)) {
217 set_Block_block_visited(node, get_irg_block_visited(current_ir_graph));
222 for(i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
224 /* find the corresponding predecessor block. */
225 ir_node *pred = get_cf_op(get_Block_cfgpred(node, i));
226 /* GL: I'm not sure whether this assert must go through. There
227 could be Id chains?? Tuple/Proj .... */
230 || is_fragile_op(pred)
231 || (get_irn_op(pred) == op_Bad));
233 pred = get_nodes_Block(pred);
234 if(get_irn_opcode(pred) == iro_Block) {
236 irg_block_walk_2(pred, pre, post, env);
239 assert(get_irn_opcode(pred) == iro_Bad);
250 /* walks only over Block nodes in the graph. Has it's own visited
251 flag, so that it can be interleaved with the other walker. */
252 void irg_block_walk(ir_node *node, irg_walk_func pre, irg_walk_func post, void *env)
254 ir_node *block, *pred;
258 assert(!interprocedural_view); /* interprocedural_view not implemented, because it
259 * interleaves with irg_walk */
260 inc_irg_block_visited(current_ir_graph);
261 if (is_no_Block(node)) block = get_nodes_Block(node); else block = node;
262 assert(get_irn_opcode(block) == iro_Block);
263 irg_block_walk_2(block, pre, post, env);
264 /* keepalive: the endless loops ... */
265 if (get_irn_op(node) == op_End)
266 for (i = 0; i < get_irn_arity(node); i++) {
267 pred = get_irn_n(node, i);
268 if (get_irn_op(pred) == op_Block)
269 irg_block_walk_2(pred, pre, post, env);
276 void irg_block_walk_graph(ir_graph *irg, irg_walk_func pre, irg_walk_func post, void *env) {
277 ir_graph * rem = current_ir_graph;
278 current_ir_graph = irg;
279 irg_block_walk(get_irg_end(irg), pre, post, env);
280 current_ir_graph = rem;
283 /********************************************************************/
285 typedef struct walk_env {
291 /* Walk to all constant expressions in this entity. */
292 void walk_entity(entity *ent, void *env) {
293 walk_env *my_env = (walk_env *)env;
294 if (get_entity_variability(ent) != uninitialized) {
295 if (is_atomic_entity(ent)) {
296 irg_walk(get_atomic_ent_value(ent), my_env->pre, my_env->post, my_env->env);
299 for (i = 0; i < get_compound_ent_n_values(ent); i++) {
300 irg_walk(get_compound_ent_value(ent, i), my_env->pre, my_env->post, my_env->env);
306 /* Walks over all code in const_code_irg. */
307 void walk_const_code(irg_walk_func pre, irg_walk_func post, void *env) {
311 ir_graph *rem = current_ir_graph;
312 current_ir_graph = get_const_code_irg();
313 inc_irg_visited(current_ir_graph);
319 /* Walk all types that can contain constant entities. */
320 walk_types_entities(get_glob_type(), &walk_entity, &env);
321 for (i = 0; i < get_irp_n_types(); i++)
322 walk_types_entities(get_irp_type(i), &walk_entity, &env);
323 for (i = 0; i < get_irp_n_irgs(); i++)
324 walk_types_entities(get_irg_frame_type(get_irp_irg(i)), &walk_entity, &env);
326 /* Walk constant array bounds. */
327 for (i = 0; i < get_irp_n_types(); i++) {
328 type *tp = get_irp_type(i);
329 if (is_array_type(tp)) {
330 for (j = 0; j < get_array_n_dimensions(tp); j++) {
332 n = get_array_lower_bound(tp, j);
333 if (n) irg_walk(n, pre, post, env);
334 n = get_array_upper_bound(tp, j);
335 if (n) irg_walk(n, pre, post, env);
340 current_ir_graph = rem;
343 /********************************************************************/
344 /** Walking support for interprocedural analysis **/
345 /********************************************************************/
347 #define MIN_STACK_SIZE 40
349 typedef struct callsite_stack {
354 /* Access the stack in the irg **************************************/
357 set_irg_callsite_stack(ir_graph *g, callsite_stack *s) {
361 static INLINE callsite_stack *
362 get_irg_callsite_stack(ir_graph *g) {
363 return (callsite_stack *) get_irg_link(g);
366 /* A stack of callsites *********************************************/
368 /* @@@ eventually change the implementation so the new_ only sets the field
369 to NULL, and the stack is only allocated if used. Saves Memory! */
370 static INLINE callsite_stack *
371 new_callsite_stack(ir_graph *g) {
372 callsite_stack *res = (callsite_stack *)malloc(sizeof(callsite_stack));
374 res->s = NEW_ARR_F (ir_node *, MIN_STACK_SIZE);
375 set_irg_callsite_stack(g, res);
380 free_callsite_stack(ir_graph *g) {
381 callsite_stack *s = get_irg_callsite_stack(g);
387 push_callsite(ir_graph *callee, ir_node *callsite) {
388 callsite_stack *s = get_irg_callsite_stack(callee);
389 if (s->tos == ARR_LEN(s->s)) {
390 int nlen = ARR_LEN (s->s) * 2;
391 ARR_RESIZE (ir_node *, s->s, nlen);
393 s->s[s->tos] = callsite;
397 static INLINE ir_node *
398 get_top_of_callsite_stack(ir_graph *callee) {
399 callsite_stack *s = get_irg_callsite_stack(callee);
400 return (s->s[s->tos-1]);
404 ir_node * pop_callsite(ir_graph *callee) {
405 callsite_stack *s = get_irg_callsite_stack(callee);
407 return (s->s[s->tos]);
411 /* Initialization routines ******************************************/
413 void init_ip_walk () {
415 for (i = 0; i < get_irp_n_irgs(); i++)
416 new_callsite_stack(get_irp_irg(i));
419 void finish_ip_walk() {
421 for (i = 0; i < get_irp_n_irgs(); i++)
422 free_callsite_stack(get_irp_irg(i));
423 set_irg_link(get_irp_irg(i), NULL);
426 /* walker routines **************************************************/
428 /* cf_pred is End* */
430 enter_procedure(ir_node *block, ir_node *cf_pred, int pos) {
432 ir_graph *irg = get_irn_irg(cf_pred);
434 assert(interprocedural_view);
436 interprocedural_view = 0;
437 callbegin = skip_Proj(get_irn_n(block, 0));
438 assert(get_irn_op(callbegin) == op_CallBegin);
439 interprocedural_view = 1;
441 push_callsite(irg, callbegin);
442 current_ir_graph = irg;
445 /* cf_pred is CallBegin */
447 leave_procedure(ir_node *block, ir_node *cf_pred, int pos) {
448 ir_node *tos = get_top_of_callsite_stack(current_ir_graph);
450 assert(get_irn_op(cf_pred) == op_CallBegin);
452 if (tos == cf_pred) {
453 /* We entered this procedure by the call pred pos refers to. */
454 pop_callsite(current_ir_graph);
455 current_ir_graph = get_CallBegin_irg(cf_pred);
463 ir_node *get_irn_ip_pred(ir_node *n, int pos) {
465 if (interprocedural_view) {
467 /* Find the cf_pred refering to pos. */
470 if (get_irn_opcode(n) == iro_Filter) block = get_nodes_Block(n);
471 cf_pred = skip_Proj(get_irn_n(block, pos));
473 /* Check whether we enter or leave a procedure and act according. */
474 if ((get_irn_op(cf_pred) == op_EndReg) ||
475 (get_irn_op(cf_pred) == op_EndExcept))
476 enter_procedure(block, cf_pred, pos);
477 if (get_irn_op(cf_pred) == op_CallBegin)
478 if (!leave_procedure(block, cf_pred, pos)) return NULL;
481 return get_irn_n(n, pos);
485 re_enter_procedure(ir_node *block, ir_node *cf_pred, int pos) {
486 ir_node *callbegin = pop_callsite(current_ir_graph);
487 assert(interprocedural_view);
488 current_ir_graph = get_CallBegin_irg(callbegin);
492 re_leave_procedure(ir_node *block, ir_node *cf_pred, int pos) {
496 assert(get_irn_op(cf_pred) == op_CallBegin);
498 /* Find the irg block is in. */
499 proj = get_Block_cg_cfgpred(block, pos);
500 assert(is_Proj(proj));
501 callee = get_entity_irg(get_Call_callee(get_CallBegin_call(cf_pred),
502 get_Proj_proj(proj)));
503 current_ir_graph = callee;
504 push_callsite(callee, cf_pred);
508 return_recur(ir_node *n, int pos) {
512 if (!interprocedural_view) return;
514 /* Find the cf_pred refering to pos. */
516 if (get_irn_opcode(n) == iro_Filter) block = get_nodes_Block(n);
517 cf_pred = skip_Proj(get_irn_n(block, pos));
519 /* Check whether we re_enter or re_leave a procedure and act according. */
520 if ((get_irn_op(cf_pred) == op_EndReg) ||
521 (get_irn_op(cf_pred) == op_EndExcept))
522 re_enter_procedure(block, cf_pred, pos);
523 if (get_irn_op(cf_pred) == op_CallBegin)
524 re_leave_procedure(block, cf_pred, pos);