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 * Metadata for block walker
26 typedef struct _blk_collect_data_t {
27 struct obstack obst; /**< obstack to allocate objects on */
28 pset *blk_map; /**< Hash map: Block -> List */
29 ir_node **blk_list; /**< the Block list */
33 * An entry for a block in the blk_map
35 typedef struct _block_entry_t {
36 ir_node *block; /**< the block */
37 ir_node **phi_list; /**< the list of Phi instruction */
38 ir_node **df_list; /**< the list of data flow instruction */
39 ir_node **cf_list; /**< the list of control flow instructions */
40 ir_node **entry_list; /**< list of all block entries */
44 * compare two block_entries
46 static int addr_cmp(const void *elt, const void *key) {
47 const block_entry_t *e1 = elt;
48 const block_entry_t *e2 = key;
50 return e1->block != e2->block;
54 * calculates a hash value for an block address
55 * Addresses are typically aligned at 32bit, so we ignore the lowest bits
57 static INLINE unsigned block_hash(const ir_node *node) {
58 return (unsigned)node >> 3;
62 * Returns the associates block_entry_t for an block
64 static block_entry_t *block_find_entry(ir_node *block, blk_collect_data_t *ctx)
70 elem = pset_find(ctx->blk_map, &key, block_hash(block));
74 elem = obstack_alloc(&ctx->obst, sizeof(*elem));
77 elem->phi_list = NEW_ARR_F(ir_node *, 0);
78 elem->df_list = NEW_ARR_F(ir_node *, 0);
79 elem->cf_list = NEW_ARR_F(ir_node *, 0);
80 elem->entry_list = NEW_ARR_F(ir_node *, 0);
82 return pset_insert(ctx->blk_map, elem, block_hash(block));
86 * traverse the pre order only, from End to Start
88 static void traverse_pre(blk_collect_data_t* blks, irg_walk_func *pre, void *env)
92 for (i = ARR_LEN(blks->blk_list) - 1; i >= 0; --i) {
93 ir_node *block = blks->blk_list[i];
94 block_entry_t *entry = block_find_entry(block, blks);
96 for (j = ARR_LEN(entry->cf_list) - 1; j >= 0; --j) {
97 ir_node *node = entry->cf_list[j];
101 for (j = ARR_LEN(entry->df_list) - 1; j >= 0; --j) {
102 ir_node *node = entry->df_list[j];
106 for (j = ARR_LEN(entry->phi_list) - 1; j >= 0; --j) {
107 ir_node *node = entry->phi_list[j];
113 DEL_ARR_F(entry->entry_list);
114 DEL_ARR_F(entry->phi_list);
115 DEL_ARR_F(entry->df_list);
116 DEL_ARR_F(entry->cf_list);
121 * traverse the post order only, from Start to End
123 static void traverse_post(blk_collect_data_t* blks, irg_walk_func *post, void *env)
127 for (i = 0; i < ARR_LEN(blks->blk_list); ++i) {
128 ir_node *block = blks->blk_list[i];
129 block_entry_t *entry = block_find_entry(block, blks);
133 for (j = 0; j < ARR_LEN(entry->phi_list); ++j) {
134 ir_node *node = entry->phi_list[j];
138 for (j = 0; j < ARR_LEN(entry->df_list); ++j) {
139 ir_node *node = entry->df_list[j];
143 for (j = 0; j < ARR_LEN(entry->cf_list); ++j) {
144 ir_node *node = entry->cf_list[j];
148 DEL_ARR_F(entry->entry_list);
149 DEL_ARR_F(entry->phi_list);
150 DEL_ARR_F(entry->df_list);
151 DEL_ARR_F(entry->cf_list);
158 static void traverse_both(blk_collect_data_t* blks, irg_walk_func *pre, irg_walk_func *post, void *env)
162 for (i = ARR_LEN(blks->blk_list) - 1; i >= 0; --i) {
163 ir_node *block = blks->blk_list[i];
164 block_entry_t *entry = block_find_entry(block, blks);
166 for (j = ARR_LEN(entry->cf_list) - 1; j >= 0; --j) {
167 ir_node *node = entry->cf_list[j];
171 for (j = ARR_LEN(entry->df_list) - 1; j >= 0; --j) {
172 ir_node *node = entry->df_list[j];
176 for (j = ARR_LEN(entry->phi_list) - 1; j >= 0; --j) {
177 ir_node *node = entry->phi_list[j];
185 traverse_post(blks, post, env);
192 static void traverse(blk_collect_data_t* blks, irg_walk_func *pre, irg_walk_func *post, void *env)
194 if (!post) traverse_pre (blks, pre, env);
195 else if (!pre) traverse_post(blks, post, env);
196 else traverse_both(blks, pre, post, env);
201 * walks over the graph and collects all blocks and all block entries
203 static void collect_walk(ir_node *node, blk_collect_data_t *env)
206 block_entry_t *entry;
209 mark_irn_visited(node);
211 if (node->op == op_Block) {
212 /* predecessors of a block are control flow nodes */
213 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
214 ir_node *pred = get_irn_n(node, i);
215 ir_node *blk = get_nodes_block(pred);
217 if (irn_not_visited(pred)) {
218 collect_walk(pred, env);
220 /* control flow predecessors are always block inputs */
221 entry = block_find_entry(blk, env);
222 ARR_APP1(ir_node *, entry->entry_list, pred);
226 /* it's a block, put it into the block list */
227 if (node == get_irg_end_block(current_ir_graph)) {
228 /* Put the end block always last. If we don't do it here,
229 * it might be placed elsewhere if the graph contains
234 ARR_APP1(ir_node *, env->blk_list, node);
238 block = get_nodes_block(node);
240 if (irn_not_visited(block))
241 collect_walk(block, env);
243 is_phi = is_Phi(node);
244 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
245 ir_node *pred = get_irn_n(node, i);
247 if (irn_not_visited(pred)) {
248 collect_walk(pred, env);
250 /* BEWARE: predecessors of End nodes might be blocks */
251 if (is_no_Block(pred)) {
252 ir_node *blk = get_nodes_block(pred);
255 * Note that Phi predecessors are always block entries
256 * because Phi edges are always "outside" a block
258 if (block != blk || is_phi) {
259 entry = block_find_entry(blk, env);
260 ARR_APP1(ir_node *, entry->entry_list, pred);
269 * walks over the nodes of a block
270 * and collects them into the right list
272 static void collect_blks_lists(ir_node *node, ir_node *block,
273 block_entry_t *entry, blk_collect_data_t *env)
277 mark_irn_visited(node);
280 * Do not descent into Phi predecessors, these are always
281 * outside the current block because Phi edges are always
284 if (! is_Phi(node)) {
285 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
286 ir_node *pred = get_irn_n(node, i);
288 /* BEWARE: predecessors of End nodes might be blocks */
289 if (is_no_Block(pred)) {
290 ir_node *blk = get_nodes_block(pred);
292 if (irn_not_visited(pred)) {
295 collect_blks_lists(pred, block, entry, env);
301 ARR_APP1(ir_node *, entry->phi_list, node);
305 if (get_irn_mode(node) == mode_X) {
306 ARR_APP1(ir_node *, entry->cf_list, node);
309 ARR_APP1(ir_node *, entry->df_list, node);
314 * walk over the graph and collect all lists
316 static void collect_lists(blk_collect_data_t *env)
319 ir_node *block, *node;
320 block_entry_t *entry;
322 inc_irg_visited(current_ir_graph);
324 for (i = ARR_LEN(env->blk_list) - 1; i >= 0; --i) {
325 block = env->blk_list[i];
326 entry = block_find_entry(block, env);
328 for (j = ARR_LEN(entry->entry_list) - 1; j >= 0; --j) {
329 node = entry->entry_list[j];
331 /* a entry might already be visited due to Phi loops */
332 if (node->visited < current_ir_graph->visited)
333 collect_blks_lists(node, block, entry, env);
339 * Intraprozedural graph walker over blocks.
342 do_irg_walk_blk(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
344 ir_node *end_node = get_irg_end(irg);
345 ir_node *end_blk = get_irg_end_block(irg);
346 blk_collect_data_t blks;
347 int old_view = get_interprocedural_view();
348 block_entry_t *entry;
350 /* switch off interprocedural view */
351 set_interprocedural_view(false);
353 obstack_init(&blks.obst);
354 blks.blk_map = new_pset(addr_cmp, 1);
355 blks.blk_list = NEW_ARR_F(ir_node *, 0);
357 /* first step: traverse the graph and fill the lists */
358 inc_irg_visited(irg);
359 collect_walk(end_node, &blks);
361 /* add the end block */
362 ARR_APP1(ir_node *, blks.blk_list, end_blk);
364 /* and the end node */
365 entry = block_find_entry(end_blk, &blks);
366 ARR_APP1(ir_node *, entry->entry_list, end_node);
368 collect_lists(&blks);
370 /* second step: traverse the list */
371 traverse(&blks, pre, post, env);
373 DEL_ARR_F(blks.blk_list);
374 del_pset(blks.blk_map);
375 obstack_free(&blks.obst, NULL);
377 set_interprocedural_view(old_view);
380 void irg_walk_blkwise_graph(ir_graph *irg, irg_walk_func *pre, irg_walk_func *post, void *env)
382 ir_graph * rem = current_ir_graph;
384 hook_irg_walk_blkwise(irg, (void *)pre, (void *)post);
385 current_ir_graph = irg;
386 do_irg_walk_blk(irg, pre, post, env);
387 current_ir_graph = rem;