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
16 # include "irgraph.h" /* visited flag */
19 void irg_walk_2(ir_node *node,
20 void (pre)(ir_node*, void*), void (post)(ir_node*, void*),
27 /* printf(" - "); DDMSG2(node); */
29 if (get_irn_visited(node) < get_irg_visited(current_ir_graph)) {
31 /* printf(" -> "); DDMSG2(node); */
32 set_irn_visited(node, get_irg_visited(current_ir_graph));
38 if (is_no_Block(node)) {
39 irg_walk_2(get_nodes_Block(node), pre, post, env);
41 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
42 /* printf(" "); DDMSG2(node); */
43 /* printf(" "); DDMSG2(get_irn_n(node, i)); */
45 irg_walk_2(get_irn_n(node, i), pre, post, env);
48 /* printf(" <- "); DDMSG2(node); */
56 void irg_walk(ir_node *node,
57 void (pre)(ir_node*, void*), void (post)(ir_node*, void*),
61 inc_irg_visited (current_ir_graph);
62 irg_walk_2(node, pre, post, env);
66 /***************************************************************************/
68 /* Walks back from n until it finds a real cf op. */
69 ir_node *get_cf_op(ir_node *n) {
75 if (!(is_cfop(pred) || is_fragile_op(pred) ||
76 (get_irn_op(pred) == op_Bad)))
82 void irg_block_walk_2(ir_node *node, void (pre)(ir_node*, void*),
83 void (post)(ir_node*, void*), void *env)
87 assert(get_irn_opcode(node) == iro_Block);
89 if(get_Block_block_visited(node) < get_irg_block_visited(current_ir_graph)) {
90 set_Block_block_visited(node, get_irg_block_visited(current_ir_graph));
95 for(i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
97 /* find the corresponding predecessor block. */
98 ir_node *pred = get_cf_op(get_Block_cfgpred(node, i));
99 /* GL: I'm not sure whether this assert must go through. There
100 could be Id chains?? Tuple/Proj .... */
102 assert(is_cfop(pred) || is_fragile_op(pred) ||
103 (get_irn_op(pred) == op_Bad));
104 pred = get_nodes_Block(pred);
105 if(get_irn_opcode(pred) == iro_Block) {
107 irg_block_walk_2(pred, pre, post, env);
110 assert(get_irn_opcode(pred) == iro_Bad);
121 /* walks only over Block nodes in the graph. Has it's own visited
122 flag, so that it can be interleaved with the other walker. */
123 void irg_block_walk(ir_node *node,
124 void (pre)(ir_node*, void*), void (post)(ir_node*, void*),
128 inc_irg_block_visited(current_ir_graph);
129 if (is_no_Block(node)) node = get_nodes_Block(node);
130 assert(get_irn_opcode(node) == iro_Block);
131 irg_block_walk_2(node, pre, post, env);