3 * File name: ir/ana/irextbb.c
4 * Purpose: Extended basis block support.
9 * Copyright: (c) 2002-2005 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
16 * Computes extended basic blocks.
18 * @author Michael Beck
20 #include "irextbb_t.h"
23 #include "irgraph_t.h"
24 #include "iredges_t.h"
30 struct obstack *obst; /**< the obstack where allocations took place */
31 ir_extblk *head; /**< head of the list of all extended blocks */
34 int (is_ir_extbb)(const void *thing) {
35 return _is_ir_extbb(thing);
39 * allocate a new extended block header.
41 static void allocate_extblk(ir_node *block, env_t *env)
43 ir_extblk *extblk = obstack_alloc(env->obst, sizeof(*extblk));
45 extblk->kind = k_ir_extblk;
47 extblk->blks = (ir_node **)env->head;
51 set_Block_extbb(block, extblk);
52 set_irn_link(block, NULL);
56 * add a block to an extended block
58 static void addto_extblk(ir_extblk *extblk, ir_node *block)
60 /* link all blocks belonging to this extended block */
61 set_irn_link(block, extblk->link);
66 set_Block_extbb(block, extblk);
70 * Returns the number of block successors.
71 * we are interested only in 1, 2 and >2.
73 static int get_block_n_succs(ir_node *block) {
74 if (edges_activated(current_ir_graph)) {
75 const ir_edge_t *edge;
77 edge = get_block_succ_first(block);
80 edge = get_block_succ_next(block, edge);
83 edge = get_block_succ_next(block, edge);
86 return get_Block_n_cfg_outs(block);
90 * Pre block-walker. Calculates the extended block info.
92 static void pre_walk_calc_extbb(ir_node *block, void *ctx)
94 int n = get_Block_n_cfgpreds(block);
97 if (n <= 0 || n > 1 ||
98 block == get_irg_start_block(current_ir_graph)) {
100 * block is a JOIN-node ie the control flow from
101 * many other blocks joins here. block is a leader.
102 * Note that we handle unreachable blocks (n <= 0) here too.
104 allocate_extblk(block, env);
106 else { /* we have only one control flow predecessor */
107 ir_node *add_to = get_Block_cfgpred_block(block, 0);
109 /* blocks with only one BAD predecessors are leaders too */
110 if (is_Bad(add_to)) {
111 allocate_extblk(block, env);
115 * Only one control flow predecessor. This block belongs
116 * to the same extended basic block as its predecessor.
118 ir_node *cf_op = skip_Proj(get_Block_cfgpred(block, 0));
120 if (irn_not_visited(cf_op)) {
121 ir_node *pred_bl = get_nodes_block(cf_op);
122 if (get_block_n_succs(pred_bl) > 2) {
123 /* More than two successors means we have a jump table.
124 * we cannot include a jump target into the current extended
125 * basic block, so create a new one here.
127 allocate_extblk(block, env);
130 /* either the previous block has only one successor or
131 * this is the first successor after an if, include it.
133 set_Block_extbb(block, NULL);
135 mark_irn_visited(cf_op);
138 /* already marked, so begin a new extended block here */
139 allocate_extblk(block, env);
145 /** A special extended block used as sentinel */
146 static ir_extblk _sentinel = { k_ir_extblk, 0xFEA1DEAD };
149 * Post block-walker. Calculates the extended block info.
150 * During construction, we use the (free) block input of all basic blocks
151 * to point to there previous block.
153 static void post_walk_calc_extbb(ir_node *block, void *ctx)
155 ir_extblk *extbb = get_Block_extbb(block);
157 ir_extblk *sentinel = &_sentinel;
160 ir_node *curr, *prev;
163 * Search the leader. It can happen, that we fall into an endless
164 * loop, because we enter an unreachable loop that is not yet detected.
165 * We break the loop using a sentinel.
167 for (curr = block; !extbb; curr = prev) {
168 prev = get_Block_cfgpred_block(curr, 0);
169 extbb = get_Block_extbb(prev);
170 set_Block_extbb(curr, sentinel);
173 if (extbb == sentinel) {
174 /* We detect a dead loop. We fix this by allocating an
175 * special Extended block
177 ir_printf("Dead loop detected starting with %+F::%+F\n", get_irg_entity(current_ir_graph), block);
179 allocate_extblk(block, env);
180 extbb = get_Block_extbb(block);
181 set_Block_extbb(block, sentinel);
184 /* replace all sentinels by the extbb info */
187 if (get_Block_extbb(prev) != sentinel)
189 set_Block_extbb(prev, extbb);
191 set_irn_link(prev, extbb->link);
193 prev = get_Block_cfgpred_block(prev, 0);
200 * Walker for cf_dependent_on().
201 * This function searches a node tgt recursively from a given node
202 * but is restricted to the given extended basic block.
204 * @return 1 if tgt was reachable from curr, 0 if not.
206 static int check_cf_dependence(ir_node *curr, ir_node *tgt, ir_extblk *extbb)
210 /* Note: we did not include the leader in our serach, so
211 there could not be any loops here. */
212 if (get_Block_extbb(curr) != extbb)
218 for (i = 0, n = get_Block_n_cfgpreds(curr); i < n; ++i) {
219 if (check_cf_dependence(get_Block_cfgpred_block(curr, i), tgt, extbb))
226 * Check if a block is control dependent on another one.
227 * Both blocks must be in the same extended basic block.
228 * @param blk1 The first block.
229 * @param blk2 The second block.
230 * @return 1, if blk1 is control dependent (transitively) on blk2, 0 if not.
232 static int cf_dependent_on(ir_node *blk1, ir_node *blk2)
234 ir_extblk *extbb = get_Block_extbb(blk1);
235 ir_graph *irg = get_irn_irg(blk1);
237 assert(extbb == get_Block_extbb(blk2));
238 return check_cf_dependence(blk1, blk2, extbb);
242 * Compare two blocks for dependency.
245 * 0 if both blocks nodes are equal
246 * 1 block b1 depends on block b2
247 * -1 block b2 depends on block d2
249 static int block_order(const void *b1, const void *b2)
251 ir_node *n1 = *(ir_node **)b1;
252 ir_node *n2 = *(ir_node **)b2;
254 return n1 == n2 ? 0 : (cf_dependent_on(n1, n2) ? -1 : 1);
256 #endif /* NEED_SORT */
259 * Compute the extended basic blocks for a graph
261 void compute_extbb(ir_graph *irg) {
263 ir_extblk *extbb, *next;
266 obstack_free(irg->extbb_obst, NULL);
268 irg->extbb_obst = xmalloc(sizeof(*irg->extbb_obst));
270 obstack_init(irg->extbb_obst);
272 env.obst = irg->extbb_obst;
275 if (! edges_activated(irg)) {
276 /* we don't have edges */
277 assure_irg_outs(irg);
280 /* we must mark nodes, so increase the visited flag */
281 inc_irg_visited(irg);
282 irg_block_walk_graph(irg, pre_walk_calc_extbb, post_walk_calc_extbb, &env);
285 * Ok, we have now the list of all extended blocks starting with env.head
286 * every extended block "knowns" the number of blocks in visited and
287 * the blocks are linked in link.
288 * Now we can create arrays that hold the blocks, some kind of "out" edges
289 * for the extended block
291 for (extbb = env.head; extbb; extbb = next) {
292 int i, len = (int)extbb->visited;
295 next = (ir_extblk *)extbb->blks;
297 extbb->blks = NEW_ARR_D(ir_node *, env.obst, len);
299 for (block = extbb->link, i = 0; i < len; ++i) {
300 ir_node *nblock = get_irn_link(block);
302 /* ensure that the leader is the first one */
303 extbb->blks[len - 1 - i] = block;
304 set_irn_link(block, NULL);
312 /* we want the blocks in scheduled order, so sort them */
313 /* FIXME: is this really needed? Or generates the algorithm automagically ordered ones? */
315 /* temporary remove the leader from the extended block to break loops */
316 set_Block_extbb(extbb->blks[0], NULL);
317 qsort(&extbb->blks[1], len-1, sizeof(extbb->blks[0]), block_order);
318 set_Block_extbb(extbb->blks[0], extbb);
323 irg->extblk_state = extblk_valid;
326 /* free all extended block info. */
327 void free_extbb(ir_graph *irg) {
328 if (irg->extbb_obst) {
329 obstack_free(irg->extbb_obst, NULL);
330 xfree(irg->extbb_obst);
331 irg->extbb_obst = NULL;
333 irg->extblk_state = extblk_none;
336 /* Return the extended block of a node. */
337 ir_extblk *get_nodes_extbb(ir_node *node) {
338 ir_node *block = is_Block(node) ? node : get_irn_n(node, -1);
339 return get_Block_extbb(block);
342 /* Gets the visited counter of an extended block. */
343 unsigned long (get_extbb_visited)(const ir_extblk *blk) {
344 return _get_extbb_visited(blk);
347 /* Sets the visited counter of an extended block. */
348 void (set_extbb_visited)(ir_extblk *blk, unsigned long visited) {
349 _set_extbb_visited(blk, visited);
352 /* Mark an extended block as visited in a graph. */
353 void (mark_extbb_visited)(ir_extblk *blk) {
354 _mark_extbb_visited(blk);
357 /* Returns non-zero if an extended was visited. */
358 int (extbb_visited)(const ir_extblk *blk) {
359 return _extbb_visited(blk);
362 /* Returns non-zero if an extended block was NOT visited. */
363 int (extbb_not_visited)(const ir_extblk *blk) {
364 return _extbb_not_visited(blk);
367 /* Returns the link field of an extended block. */
368 void *(get_extbb_link)(const ir_extblk *blk) {
369 return _get_extbb_link(blk);
372 /* Sets the link field of an extended block. */
373 void (set_extbb_link)(ir_extblk *blk, void *link) {
374 _set_extbb_link(blk, link);
377 /* Return the number of basic blocks of an extended block */
378 int (get_extbb_n_blocks)(const ir_extblk *blk) {
379 return _get_extbb_n_blocks(blk);
382 /* Return the i'th basic block of an extended block */
383 ir_node *(get_extbb_block)(ir_extblk *blk, int pos) {
384 return _get_extbb_block(blk, pos);
387 /* Return the leader basis block of an extended block. */
388 ir_node *(get_extbb_leader)(ir_extblk *blk) {
389 return _get_extbb_leader(blk);
392 /* Return the node number of an extended block. */
393 long get_extbb_node_nr(ir_extblk *blk) {
394 return get_irn_node_nr(get_extbb_leader(blk));
397 static void irg_extblock_walk_2(ir_extblk *blk, extbb_walk_func *pre, extbb_walk_func *post, void *env)
402 if (extbb_not_visited(blk)) {
403 mark_extbb_visited(blk);
405 if (pre) pre(blk, env);
407 node = get_extbb_leader(blk);
408 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
409 /* find the corresponding predecessor block. */
410 ir_node *pred = get_Block_cfgpred_block(node, i);
411 if (is_Block(pred)) {
413 irg_extblock_walk_2(get_Block_extbb(pred), pre, post, env);
416 assert(is_Bad(pred));
420 if (post) post(blk, env);
424 /* walks only over extended Block nodes in the graph. Has it's own visited
425 flag, so that it can be interleaved with the other walker. */
426 void irg_extblock_walk(ir_extblk *blk, extbb_walk_func *pre, extbb_walk_func *post, void *env)
428 ir_node *pred, *start_bl = get_irg_start_block(current_ir_graph);
429 ir_extblk *start_blk = get_Block_extbb(start_bl);
433 assert(!get_interprocedural_view()); /* interprocedural_view not implemented */
434 inc_irg_block_visited(current_ir_graph);
436 /* assure the start block is the first one */
437 mark_extbb_visited(start_blk);
439 post(start_blk, env);
440 irg_extblock_walk_2(blk, pre, post, env);
442 /* keepalive: the endless loops ... */
443 if (blk == get_Block_extbb(get_irg_end_block(current_ir_graph))) {
444 ir_node *node = get_irg_end(current_ir_graph);
445 int arity = get_irn_arity(node);
446 for (i = 0; i < arity; i++) {
447 pred = get_irn_n(node, i);
449 irg_extblock_walk_2(get_Block_extbb(pred), pre, post, env);
450 else if (is_Phi(pred)) {
451 /* Sometimes the blocks died, but are still reachable through Phis.
452 * Make sure the algorithms that try to remove these reach them. */
453 ir_node *block = get_nodes_block(pred);
456 irg_extblock_walk_2(get_Block_extbb(block), pre, post, env);
465 /* Walks only over reachable Extended Basic Block nodes in the graph. */
466 void irg_extblock_walk_graph(ir_graph *irg, extbb_walk_func *pre, extbb_walk_func *post, void *env)
468 ir_node *endbl = get_irg_end_block(irg);
469 ir_extblk *blk = get_Block_extbb(endbl);
470 ir_graph *rem = current_ir_graph;
471 current_ir_graph = irg;
472 irg_extblock_walk(blk, pre, post, env);
473 current_ir_graph = rem;