3 * File name: ir/ir/irgwalk_blk.c
9 * Copyright: (c) 1999-2004 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
17 #include "irgraph_t.h" /* visited flag */
24 #define _get_walk_arity(env, node) \
25 ((env)->follow_deps ? get_irn_ins_or_deps((node)) : get_irn_arity((node)))
26 #define _get_walk_irn_n(env, node, pos) \
27 ((env)->follow_deps ? get_irn_in_or_dep((node), (pos)) : get_irn_n((node), (pos)))
30 * Metadata for block walker
32 typedef struct _blk_collect_data_t {
33 struct obstack obst; /**< obstack to allocate objects on */
34 pset *blk_map; /**< Hash map: Block -> List */
35 ir_node **blk_list; /**< the Block list */
36 unsigned follow_deps : 1; /**< follow dependency edges */
40 * An entry for a block in the blk_map
42 typedef struct _block_entry_t {
43 ir_node *block; /**< the block */
44 ir_node **phi_list; /**< the list of Phi instruction */
45 ir_node **df_list; /**< the list of data flow instruction */
46 ir_node **cf_list; /**< the list of control flow instructions */
47 ir_node **entry_list; /**< list of all block entries */
51 * compare two block_entries
53 static int addr_cmp(const void *elt, const void *key) {
54 const block_entry_t *e1 = elt;
55 const block_entry_t *e2 = key;
57 return e1->block != e2->block;
61 * Returns the associates block_entry_t for an block
63 static block_entry_t *block_find_entry(ir_node *block, blk_collect_data_t *ctx)
69 elem = pset_find(ctx->blk_map, &key, HASH_PTR(block));
73 elem = obstack_alloc(&ctx->obst, sizeof(*elem));
76 elem->phi_list = NEW_ARR_F(ir_node *, 0);
77 elem->df_list = NEW_ARR_F(ir_node *, 0);
78 elem->cf_list = NEW_ARR_F(ir_node *, 0);
79 elem->entry_list = NEW_ARR_F(ir_node *, 0);
81 return pset_insert(ctx->blk_map, elem, HASH_PTR(block));
85 * traverse the pre order only, from End to Start
87 static void traverse_pre(blk_collect_data_t* blks, irg_walk_func *pre, void *env)
91 for (i = ARR_LEN(blks->blk_list) - 1; i >= 0; --i) {
92 ir_node *block = blks->blk_list[i];
93 block_entry_t *entry = block_find_entry(block, blks);
95 for (j = ARR_LEN(entry->cf_list) - 1; j >= 0; --j) {
96 ir_node *node = entry->cf_list[j];
100 for (j = ARR_LEN(entry->df_list) - 1; j >= 0; --j) {
101 ir_node *node = entry->df_list[j];
105 for (j = ARR_LEN(entry->phi_list) - 1; j >= 0; --j) {
106 ir_node *node = entry->phi_list[j];
112 DEL_ARR_F(entry->entry_list);
113 DEL_ARR_F(entry->phi_list);
114 DEL_ARR_F(entry->df_list);
115 DEL_ARR_F(entry->cf_list);
120 * traverse the post order only, from Start to End
122 static void traverse_post(blk_collect_data_t* blks, irg_walk_func *post, void *env)
126 for (i = 0; i < ARR_LEN(blks->blk_list); ++i) {
127 ir_node *block = blks->blk_list[i];
128 block_entry_t *entry = block_find_entry(block, blks);
132 for (j = 0; j < ARR_LEN(entry->phi_list); ++j) {
133 ir_node *node = entry->phi_list[j];
137 for (j = 0; j < ARR_LEN(entry->df_list); ++j) {
138 ir_node *node = entry->df_list[j];
142 for (j = 0; j < ARR_LEN(entry->cf_list); ++j) {
143 ir_node *node = entry->cf_list[j];
147 DEL_ARR_F(entry->entry_list);
148 DEL_ARR_F(entry->phi_list);
149 DEL_ARR_F(entry->df_list);
150 DEL_ARR_F(entry->cf_list);
157 static void traverse_both(blk_collect_data_t* blks, irg_walk_func *pre, irg_walk_func *post, void *env)
161 for (i = ARR_LEN(blks->blk_list) - 1; i >= 0; --i) {
162 ir_node *block = blks->blk_list[i];
163 block_entry_t *entry = block_find_entry(block, blks);
165 for (j = ARR_LEN(entry->cf_list) - 1; j >= 0; --j) {
166 ir_node *node = entry->cf_list[j];
170 for (j = ARR_LEN(entry->df_list) - 1; j >= 0; --j) {
171 ir_node *node = entry->df_list[j];
175 for (j = ARR_LEN(entry->phi_list) - 1; j >= 0; --j) {
176 ir_node *node = entry->phi_list[j];
184 traverse_post(blks, post, env);
191 static void traverse(blk_collect_data_t* blks, irg_walk_func *pre, irg_walk_func *post, void *env)
193 if (!post) traverse_pre (blks, pre, env);
194 else if (!pre) traverse_post(blks, post, env);
195 else traverse_both(blks, pre, post, env);
200 * walks over the graph and collects all blocks and all block entries
202 static void collect_walk(ir_node *node, blk_collect_data_t *env)
205 block_entry_t *entry;
208 mark_irn_visited(node);
210 if (node->op == op_Block) {
211 /* predecessors of a block are control flow nodes */
212 for (i = _get_walk_arity(env, node) - 1; i >= 0; --i) {
213 ir_node *pred = _get_walk_irn_n(env, node, i);
214 ir_node *blk = get_nodes_block(pred);
216 if (irn_not_visited(pred)) {
217 collect_walk(pred, env);
219 /* control flow predecessors are always block inputs */
220 entry = block_find_entry(blk, env);
221 ARR_APP1(ir_node *, entry->entry_list, pred);
225 /* it's a block, put it into the block list */
226 if (node == get_irg_end_block(current_ir_graph)) {
227 /* Put the end block always last. If we don't do it here,
228 * it might be placed elsewhere if the graph contains
233 ARR_APP1(ir_node *, env->blk_list, node);
237 block = get_nodes_block(node);
239 if (irn_not_visited(block))
240 collect_walk(block, env);
242 is_phi = is_Phi(node);
243 for (i = _get_walk_arity(env, node) - 1; i >= 0; --i) {
244 ir_node *pred = _get_walk_irn_n(env, node, i);
246 if (irn_not_visited(pred)) {
247 collect_walk(pred, env);
249 /* BEWARE: predecessors of End nodes might be blocks */
250 if (is_no_Block(pred)) {
251 ir_node *blk = get_nodes_block(pred);
254 * Note that Phi predecessors are always block entries
255 * because Phi edges are always "outside" a block
257 if (block != blk || is_phi) {
258 entry = block_find_entry(blk, env);
259 ARR_APP1(ir_node *, entry->entry_list, pred);
268 * walks over the nodes of a block
269 * and collects them into the right list
271 static void collect_blks_lists(ir_node *node, ir_node *block,
272 block_entry_t *entry, blk_collect_data_t *env)
276 mark_irn_visited(node);
279 * Do not descent into Phi predecessors, these are always
280 * outside the current block because Phi edges are always
283 if (! is_Phi(node)) {
284 for (i = _get_walk_arity(env, node) - 1; i >= 0; --i) {
285 ir_node *pred = _get_walk_irn_n(env, node, i);
287 /* BEWARE: predecessors of End nodes might be blocks */
288 if (is_no_Block(pred)) {
289 ir_node *blk = get_nodes_block(pred);
291 if (irn_not_visited(pred)) {
294 collect_blks_lists(pred, block, entry, env);
300 ARR_APP1(ir_node *, entry->phi_list, node);
304 if (get_irn_mode(node) == mode_X) {
305 ARR_APP1(ir_node *, entry->cf_list, node);
308 ARR_APP1(ir_node *, entry->df_list, node);
313 * walk over the graph and collect all lists
315 static void collect_lists(blk_collect_data_t *env)
318 ir_node *block, *node;
319 block_entry_t *entry;
321 inc_irg_visited(current_ir_graph);
323 for (i = ARR_LEN(env->blk_list) - 1; i >= 0; --i) {
324 block = env->blk_list[i];
325 entry = block_find_entry(block, env);
327 for (j = ARR_LEN(entry->entry_list) - 1; j >= 0; --j) {
328 node = entry->entry_list[j];
330 /* a entry might already be visited due to Phi loops */
331 if (node->visited < current_ir_graph->visited)
332 collect_blks_lists(node, block, entry, env);
338 * Intraprozedural graph walker over blocks.
341 do_irg_walk_blk(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env, unsigned follow_deps)
343 ir_node *end_node = get_irg_end(irg);
344 ir_node *end_blk = get_irg_end_block(irg);
345 blk_collect_data_t blks;
346 int old_view = get_interprocedural_view();
347 block_entry_t *entry;
349 /* switch off interprocedural view */
350 set_interprocedural_view(0);
352 obstack_init(&blks.obst);
353 blks.blk_map = new_pset(addr_cmp, 1);
354 blks.blk_list = NEW_ARR_F(ir_node *, 0);
355 blks.follow_deps = follow_deps != 0;
357 /* first step: traverse the graph and fill the lists */
358 set_using_visited(irg);
359 inc_irg_visited(irg);
360 collect_walk(end_node, &blks);
362 /* add the end block */
363 ARR_APP1(ir_node *, blks.blk_list, end_blk);
365 /* and the end node */
366 entry = block_find_entry(end_blk, &blks);
367 ARR_APP1(ir_node *, entry->entry_list, end_node);
369 collect_lists(&blks);
371 /* second step: traverse the list */
372 traverse(&blks, pre, post, env);
374 DEL_ARR_F(blks.blk_list);
375 del_pset(blks.blk_map);
376 obstack_free(&blks.obst, NULL);
378 set_interprocedural_view(old_view);
379 clear_using_visited(irg);
382 void irg_walk_blkwise_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
384 ir_graph * rem = current_ir_graph;
386 hook_irg_walk_blkwise(irg, (generic_func *)pre, (generic_func *)post);
387 current_ir_graph = irg;
388 do_irg_walk_blk(irg, pre, post, env, 0);
389 current_ir_graph = rem;
393 void irg_walk_in_or_dep_blkwise_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
395 ir_graph * rem = current_ir_graph;
397 hook_irg_walk_blkwise(irg, (generic_func *)pre, (generic_func *)post);
398 current_ir_graph = irg;
399 do_irg_walk_blk(irg, pre, post, env, 1);
400 current_ir_graph = rem;