2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Control flow optimizations.
23 * @author Goetz Lindenmaier, Michael Beck, Sebastian Hack
25 * Removes Bad control flow predecessors and empty blocks. A block is empty
26 * if it contains only a Jmp node. Blocks can only be removed if they are not
27 * needed for the semantics of Phi nodes. Further, we NEVER remove labeled
28 * blocks (even if we could move the label).
32 #include "iroptimize.h"
39 #include "irgraph_t.h"
49 #include "opt_manage.h"
54 #include "irbackedge_t.h"
59 #include "irnodehashmap.h"
62 #include "iropt_dbg.h"
64 /** An environment for merge_blocks and collect nodes. */
65 typedef struct merge_env {
66 bool changed; /**< Set if the graph was changed. */
67 bool phis_moved; /**< Set if Phi nodes were moved. */
70 /** set or reset the removable property of a block. */
71 static void set_Block_removable(ir_node *block, bool removable)
73 set_Block_mark(block, removable);
76 /** check if a block has the removable property set. */
77 static bool is_Block_removable(const ir_node *block)
79 return get_Block_mark(block);
82 /** checks if a given Cond node is a switch Cond. */
83 static bool is_switch_Cond(const ir_node *cond)
85 ir_node *sel = get_Cond_selector(cond);
86 return get_irn_mode(sel) != mode_b;
89 /** Walker: clear link fields and mark all blocks as removable. */
90 static void clear_link_and_mark_blocks_removable(ir_node *node, void *ctx)
93 set_irn_link(node, NULL);
95 set_Block_removable(node, true);
96 set_Block_phis(node, NULL);
97 } else if (is_Phi(node)) {
98 set_Phi_next(node, NULL);
103 * Collects all Phi nodes in link list of Block.
104 * Marks all blocks "non_removable" if they contain a node other
105 * than Jmp (and Proj).
106 * Links all Proj nodes to their predecessors.
107 * Collects all switch-Conds in a list.
109 static void collect_nodes(ir_node *n, void *ctx)
113 /* Collect Phi nodes to compact ins along with block's ins. */
114 ir_node *block = get_nodes_block(n);
115 add_Block_phi(block, n);
116 } else if (is_Block(n)) {
117 if (get_Block_entity(n) != NULL) {
118 /* block with a jump label attached cannot be removed. */
119 set_Block_removable(n, false);
121 } else if (is_Bad(n) || is_Jmp(n)) {
125 /* Check for non-empty block. */
126 ir_node *block = get_nodes_block(n);
128 set_Block_removable(block, false);
131 /* link Proj nodes */
132 ir_node *pred = get_Proj_pred(n);
133 set_irn_link(n, get_irn_link(pred));
134 set_irn_link(pred, n);
139 /** Returns true if pred is predecessor of block b. */
140 static bool is_pred_of(const ir_node *pred, const ir_node *b)
144 for (i = get_Block_n_cfgpreds(b) - 1; i >= 0; --i) {
145 ir_node *b_pred = get_Block_cfgpred_block(b, i);
152 /** Test whether we can optimize away pred block pos of b.
154 * @param b A block node.
155 * @param pos The position of the predecessor block to judge about.
157 * @returns The number of predecessors
159 * The test is rather tricky.
161 * The situation is something like the following:
170 * b merges the control flow of an if-then-else. We may not remove
171 * the 'then' _and_ the 'else' block of an 'if' if there is a Phi
172 * node in b, even if both are empty. The destruction of this Phi
173 * requires that a copy is added before the merge. We have to
174 * keep one of the case blocks to place the copies in.
176 * To perform the test for pos, we must regard predecessors before pos
177 * as already removed.
179 static unsigned test_whether_dispensable(const ir_node *b, int pos)
181 ir_node *pred = get_Block_cfgpred(b, pos);
182 ir_node *predb = get_nodes_block(pred);
184 if (is_Bad(pred) || !is_Block_removable(predb))
187 /* can't remove self-loops */
189 goto non_dispensable;
190 if (is_unknown_jump(pred))
191 goto non_dispensable;
193 /* Seems to be empty. At least we detected this in collect_nodes. */
194 if (get_Block_phis(b) != NULL) {
195 int n_cfgpreds = get_Block_n_cfgpreds(b);
197 /* there are Phi nodes */
199 /* b's pred blocks and pred's pred blocks must be pairwise disjunct.
200 * Handle all pred blocks with preds < pos as if they were already
202 for (i = 0; i < pos; i++) {
203 ir_node *other_pred = get_Block_cfgpred(b, i);
204 ir_node *other_predb = get_nodes_block(other_pred);
205 if (is_Bad(other_pred))
207 if (is_Block_removable(other_predb)
208 && !Block_block_visited(other_predb)) {
210 for (j = get_Block_n_cfgpreds(other_predb) - 1; j >= 0; --j) {
211 ir_node *other_predpred
212 = get_Block_cfgpred_block(other_predb, j);
213 if (is_pred_of(other_predpred, predb))
214 goto non_dispensable;
216 } else if (is_pred_of(other_predb, predb)) {
217 goto non_dispensable;
220 for (i = pos+1; i < n_cfgpreds; i++) {
221 ir_node *other_predb = get_Block_cfgpred_block(b, i);
222 if (is_pred_of(other_predb, predb))
223 goto non_dispensable;
226 /* we will not dispense already visited blocks */
227 if (Block_block_visited(predb))
229 /* if we get here, the block is dispensable, count useful preds */
230 return get_irn_arity(predb);
233 set_Block_removable(predb, false);
238 * This method merges blocks. A block is applicable to be merged, if it
239 * has only one predecessor with an unconditional jump to this block;
240 * and if this block does not contain any phis.
242 static void merge_blocks(ir_node *b)
244 if (get_Block_n_cfgpreds(b) == 1) {
245 ir_node* pred = get_Block_cfgpred(b, 0);
247 ir_node* pred_block = get_nodes_block(pred);
248 if (get_Block_phis(b) == NULL) {
249 exchange(b, pred_block);
256 * This method removes empty blocks. A block is empty if it only contains Phi
259 * We first adapt Phi nodes, then Block nodes, as we need the old ins
260 * of the Block to adapt the Phi nodes. We do this by computing new
261 * in arrays, and then replacing the old ones. So far we compute new in arrays
262 * for all nodes, not regarding whether there is a possibility for optimization.
264 * For each predecessor p of a Block b there are three cases:
265 * - The predecessor p is a Bad node: just skip it. The in array of b shrinks
267 * - The predecessor p is empty. Remove p. All predecessors of p are now
269 * - The predecessor p is a block containing useful code. Just keep p as is.
271 * For Phi nodes f we have to check the conditions at the Block of f.
272 * For cases 1 and 3 we proceed as for Blocks. For case 2 we can have two
274 * -2a: The old predecessor of the Phi f is a Phi pred_f IN THE BLOCK REMOVED.
275 * In this case we proceed as for blocks. We remove pred_f. All
276 * predecessors of pred_f now are predecessors of f.
277 * -2b: The old predecessor of f is NOT in the block removed. It might be a Phi
278 * too. We have to replicate f for each predecessor of the removed block.
279 * Or, with other words, the removed predecessor block has exactly one
282 * Further there is a special case for self referencing blocks:
285 * then_b else_b then_b else_b
291 * | | | === optimized to ===> \ | | |
298 * If there is a Phi in pred_b, but we remove pred_b, we have to generate a
299 * Phi in loop_b, that has the ins of the Phi in pred_b and a self referencing
302 static void optimize_blocks(ir_node *b, void *ctx)
304 int i, j, k, n, max_preds, n_preds, p_preds = -1;
308 merge_env *env = (merge_env*)ctx;
310 if (get_Block_dom_depth(b) < 0) {
311 /* ignore unreachable blocks */
315 /* Count the number of predecessor if this block is merged with pred blocks
318 for (i = 0, k = get_Block_n_cfgpreds(b); i < k; ++i) {
319 max_preds += test_whether_dispensable(b, i);
321 in = XMALLOCN(ir_node*, max_preds);
323 /*- Fix the Phi nodes of the current block -*/
324 for (phi = get_Block_phis(b); phi != NULL; phi = next) {
325 next = get_Phi_next(phi);
327 /* Find the new predecessors for the Phi */
329 for (i = 0, n = get_Block_n_cfgpreds(b); i < n; ++i) {
330 ir_graph *irg = get_irn_irg(b);
331 ir_node *predx = get_Block_cfgpred(b, i);
334 /* case Phi 1: maintain Bads, as somebody else is responsible to
337 in[p_preds++] = new_r_Bad(irg, get_irn_mode(phi));
341 pred = get_nodes_block(predx);
343 /* case Phi 2: It's an empty block and not yet visited. */
344 if (is_Block_removable(pred) && !Block_block_visited(pred)) {
345 ir_node *phi_pred = get_Phi_pred(phi, i);
347 for (j = 0, k = get_Block_n_cfgpreds(pred); j < k; j++) {
348 ir_node *pred_pred = get_Block_cfgpred(pred, j);
350 if (is_Bad(pred_pred)) {
351 in[p_preds++] = new_r_Bad(irg, get_irn_mode(phi));
355 if (get_nodes_block(phi_pred) == pred) {
357 assert(is_Phi(phi_pred)); /* Block is empty!! */
359 in[p_preds++] = get_Phi_pred(phi_pred, j);
362 in[p_preds++] = phi_pred;
367 in[p_preds++] = get_Phi_pred(phi, i);
370 assert(p_preds == max_preds);
374 exchange(phi, in[0]);
376 set_irn_in(phi, p_preds, in);
381 /*- This happens only if merge between loop backedge and single loop entry.
382 Moreover, it is only needed if predb is the direct dominator of b,
383 else there can be no uses of the Phi's in predb ... -*/
384 for (k = 0, n = get_Block_n_cfgpreds(b); k < n; ++k) {
385 ir_node *pred = get_Block_cfgpred(b, k);
386 ir_node *predb = get_nodes_block(pred);
390 if (is_Block_removable(predb) && !Block_block_visited(predb)) {
393 /* we found a predecessor block at position k that will be removed */
394 for (phi = get_Block_phis(predb); phi != NULL; phi = next_phi) {
396 next_phi = get_Phi_next(phi);
398 if (get_Block_idom(b) != predb) {
399 /* predb is not the dominator. There can't be uses of
400 * pred's Phi nodes, kill them .*/
401 ir_graph *irg = get_irn_irg(b);
402 ir_mode *mode = get_irn_mode(phi);
403 exchange(phi, new_r_Bad(irg, mode));
405 /* predb is the direct dominator of b. There might be uses
406 * of the Phi nodes from predb in further block, so move
407 * this phi from the predecessor into the block b */
408 set_nodes_block(phi, b);
409 set_Phi_next(phi, get_Block_phis(b));
410 set_Block_phis(b, phi);
411 env->phis_moved = true;
413 /* first, copy all 0..k-1 predecessors */
414 for (i = 0; i < k; i++) {
415 ir_node *predx = get_Block_cfgpred(b, i);
419 ir_graph *irg = get_irn_irg(b);
420 ir_mode *mode = get_irn_mode(phi);
421 in[q_preds++] = new_r_Bad(irg, mode);
424 pred_block = get_nodes_block(predx);
425 if (is_Block_removable(pred_block)
426 && !Block_block_visited(pred_block)) {
427 int n_cfgpreds = get_Block_n_cfgpreds(pred_block);
428 /* It's an empty block and not yet visited. */
429 for (j = 0; j < n_cfgpreds; j++) {
430 if (!is_Bad(get_Block_cfgpred(pred_block, j))) {
433 ir_graph *irg = get_irn_irg(b);
434 ir_mode *mode = get_irn_mode(phi);
435 in[q_preds++] = new_r_Bad(irg, mode);
443 /* now we are at k, copy the phi predecessors */
444 pred = get_nodes_block(get_Block_cfgpred(b, k));
445 for (i = 0; i < get_Phi_n_preds(phi); i++) {
446 in[q_preds++] = get_Phi_pred(phi, i);
449 /* and now all the rest */
450 for (i = k+1; i < get_Block_n_cfgpreds(b); i++) {
451 pred = get_Block_cfgpred_block(b, i);
454 ir_graph *irg = get_irn_irg(b);
455 ir_mode *mode = get_irn_mode(phi);
456 in[q_preds++] = new_r_Bad(irg, mode);
457 } else if (is_Block_removable(pred) && !Block_block_visited(pred)) {
458 /* It's an empty block and not yet visited. */
459 for (j = 0; j < get_Block_n_cfgpreds(pred); j++) {
460 if (! is_Bad(get_Block_cfgpred(pred, j))) {
463 ir_graph *irg = get_irn_irg(b);
464 ir_mode *mode = get_irn_mode(phi);
465 in[q_preds++] = new_r_Bad(irg, mode);
475 exchange(phi, in[0]);
477 set_irn_in(phi, q_preds, in);
480 assert(q_preds <= max_preds);
481 // assert(p_preds == q_preds && "Wrong Phi Fix");
487 /*- Fix the block -*/
489 for (i = 0; i < get_Block_n_cfgpreds(b); i++) {
490 ir_node *pred = get_Block_cfgpred(b, i);
491 ir_node *predb = get_nodes_block(pred);
492 ir_graph *irg = get_irn_irg(pred);
494 /* case 1: Bad predecessor */
496 in[n_preds++] = new_r_Bad(irg, mode_X);
499 if (is_Block_removable(predb) && !Block_block_visited(predb)) {
500 /* case 2: It's an empty block and not yet visited. */
501 for (j = 0; j < get_Block_n_cfgpreds(predb); j++) {
502 ir_node *predpred = get_Block_cfgpred(predb, j);
504 if (is_Bad(predpred)) {
505 in[n_preds++] = new_r_Bad(irg, mode_X);
509 in[n_preds++] = predpred;
511 /* Remove block+jump as it might be kept alive. */
512 exchange(pred, new_r_Bad(get_irn_irg(b), mode_X));
513 exchange(predb, new_r_Bad(get_irn_irg(b), mode_BB));
516 in[n_preds++] = pred;
519 assert(n_preds == max_preds);
521 set_irn_in(b, n_preds, in);
524 /* see if phi-fix was correct */
525 assert(get_Block_phis(b) == NULL || p_preds == -1 || (n_preds == p_preds));
530 * Optimize boolean Conds, where true and false jump to the same block into a Jmp
531 * Block must contain no Phi nodes.
535 * projA projB => Jmp Bad
539 static bool optimize_pred_cond(ir_node *block, int i, int j)
541 ir_node *projA, *projB, *cond, *pred_block, *jmp, *bad;
544 projA = get_Block_cfgpred(block, i);
545 if (!is_Proj(projA)) return false;
546 projB = get_Block_cfgpred(block, j);
547 if (!is_Proj(projB)) return false;
548 cond = get_Proj_pred(projA);
549 if (!is_Cond(cond)) return false;
551 if (cond != get_Proj_pred(projB)) return false;
552 if (is_switch_Cond(cond)) return false;
554 /* cond should actually be a Jmp */
555 pred_block = get_nodes_block(cond);
556 jmp = new_r_Jmp(pred_block);
557 bad = new_r_Bad(get_irn_irg(block), mode_X);
559 assert(projA != projB);
560 exchange(projA, jmp);
561 exchange(projB, bad);
565 typedef enum block_flags_t {
566 BF_HAS_OPERATIONS = 1 << 0,
567 BF_HAS_PHIS = 1 << 1,
568 BF_IS_UNKNOWN_JUMP_TARGET = 1 << 2,
571 static bool get_block_flag(const ir_nodehashmap_t *infos, const ir_node *block,
574 return PTR_TO_INT(ir_nodehashmap_get(infos, block)) & flag;
577 static void set_block_flag(ir_nodehashmap_t *infos, ir_node *block,
580 int data = PTR_TO_INT(ir_nodehashmap_get(infos, block));
582 ir_nodehashmap_insert(infos, block, INT_TO_PTR(data));
585 static void clear_block_flag(ir_nodehashmap_t *infos, const ir_node *block)
587 ir_nodehashmap_remove(infos, block);
590 static bool has_operations(ir_nodehashmap_t *infos, const ir_node *block)
592 return get_block_flag(infos, block, BF_HAS_OPERATIONS);
595 static void set_has_operations(ir_nodehashmap_t *infos, ir_node *block)
597 set_block_flag(infos, block, BF_HAS_OPERATIONS);
600 static bool has_phis(ir_nodehashmap_t *infos, const ir_node *block)
602 return get_block_flag(infos, block, BF_HAS_PHIS);
605 static void set_has_phis(ir_nodehashmap_t *infos, ir_node *block)
607 set_block_flag(infos, block, BF_HAS_PHIS);
610 static bool is_unknown_jump_target(ir_nodehashmap_t *infos, const ir_node *block)
612 return get_block_flag(infos, block, BF_IS_UNKNOWN_JUMP_TARGET);
615 static void set_is_unknown_jump_target(ir_nodehashmap_t *infos, ir_node *block)
617 set_block_flag(infos, block, BF_IS_UNKNOWN_JUMP_TARGET);
621 * Pre-Walker: fill block info information.
623 static void compute_block_info(ir_node *n, void *x)
625 ir_nodehashmap_t *infos = (ir_nodehashmap_t*)x;
628 int i, max = get_Block_n_cfgpreds(n);
629 for (i=0; i<max; i++) {
630 ir_node *pred = get_Block_cfgpred(n,i);
631 if (is_unknown_jump(pred)) {
632 set_is_unknown_jump_target(infos, n);
635 } else if (is_Phi(n)) {
636 ir_node *block = get_nodes_block(n);
637 set_has_phis(infos, block);
638 } else if (is_Jmp(n) || is_Cond(n) || is_Proj(n)) {
641 ir_node *block = get_nodes_block(n);
642 set_has_operations(infos, block);
646 static void clear_block_info(ir_node *block, void *x)
648 ir_nodehashmap_t *infos = (ir_nodehashmap_t*)x;
649 clear_block_flag(infos, block);
652 typedef struct skip_env {
654 ir_nodehashmap_t block_infos;
658 * Post-Block-walker: Optimize useless if's (boolean Cond nodes
659 * with same true/false target) away.
661 static void optimize_ifs(ir_node *block, void *x)
663 skip_env *env = (skip_env*)x;
665 int n_preds = get_Block_n_cfgpreds(block);
667 if (has_phis(&env->block_infos, block))
670 /* optimize Cond predecessors (might produce Bad predecessors) */
671 for (i = 0; i < n_preds; ++i) {
672 for (j = i+1; j < n_preds; ++j) {
673 optimize_pred_cond(block, i, j);
679 * Pre-Block walker: remove empty blocks (only contain a Jmp)
680 * that are control flow predecessors of the current block.
682 static void remove_empty_blocks(ir_node *block, void *x)
684 skip_env *env = (skip_env*)x;
686 int n_preds = get_Block_n_cfgpreds(block);
688 for (i = 0; i < n_preds; ++i) {
689 ir_node *jmp, *jmp_block;
692 jmp = get_Block_cfgpred(block, i);
695 jmp_block = get_nodes_block(jmp);
696 if (jmp_block == block)
697 continue; /* this infinite loop cannot be optimized any further */
698 if (is_unknown_jump_target(&env->block_infos, jmp_block))
699 continue; /* unknown jump target must not be optimized */
700 if (has_phis(&env->block_infos,jmp_block))
701 continue; /* this block contains Phis and is not skipped */
702 if (Block_block_visited(jmp_block)) {
704 /* otherwise we could break the walker,
705 * if block was reached via
706 * KeepAlive edge -> jmp_block -> A ---> block,
707 * because the walker cannot handle Id nodes.
717 /* jmp_block is an empty block and can be optimized! */
719 n_jpreds = get_Block_n_cfgpreds(jmp_block);
721 * If the jmp block has only one predecessor this is straightforward.
722 * However, if there are more predecessors, we only handle this,
723 * if block has no Phis.
726 ir_node *pred = get_Block_cfgpred(jmp_block, 0);
727 ir_node *pred_block = get_nodes_block(pred);
728 if (has_operations(&env->block_infos,jmp_block)) {
729 if (get_irg_start_block(get_irn_irg(pred_block)) == pred_block)
730 continue; /* must not merge operations into start block */
732 continue; /* must not create partially dead code, especially when it is mode_M */
735 /* skip jmp block by rerouting its predecessor to block
745 /* cleanup: jmp_block might have a Keep edge! */
746 exchange(jmp_block, pred_block);
748 } else if ( !has_phis(&env->block_infos, block) &&
749 !has_operations(&env->block_infos,jmp_block))
751 /* all predecessors can skip the jmp block, so block gets some new
756 * jmp_block C => Bad C | |
760 ir_node **ins = ALLOCAN(ir_node*, n_preds+n_jpreds);
762 /* first copy the old predecessors, because the outer loop (i)
763 * still walks over them */
764 for (j = 0; j < n_preds; ++j) {
765 ins[j] = get_Block_cfgpred(block, j);
767 /* now append the new predecessors */
768 for (j = 0; j < n_jpreds; ++j) {
769 ir_node *pred = get_Block_cfgpred(jmp_block, j);
770 ins[n_preds+j] = pred;
772 set_irn_in(block, n_preds+n_jpreds, ins);
773 /* convert the jmp_block to Bad */
774 ir_graph *irg = get_irn_irg(block);
775 exchange(jmp_block, new_r_Bad(irg, mode_BB));
776 exchange(jmp, new_r_Bad(irg, mode_X));
777 /* let the outer loop walk over the new predecessors as well */
780 // TODO What if jmp_block had a KeepAlive edge?
782 /* This would involve Phis ... */
788 * All cfg optimizations, which do not touch Phi nodes.
790 * Note that this might create critical edges.
792 static void cfgopt_ignoring_phis(ir_graph *irg)
797 ir_nodehashmap_init(&env.block_infos);
799 while (env.changed) {
800 irg_walk_graph(irg, compute_block_info, NULL, &env.block_infos);
803 /* Remove blocks, which only consist of a Jmp */
804 irg_block_walk_graph(irg, remove_empty_blocks, NULL, &env);
806 /* Optimize Cond->Jmp, where then- and else-block are the same. */
807 irg_block_walk_graph(irg, NULL, optimize_ifs, &env);
810 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE);
811 /* clear block info, because it must be recomputed */
812 irg_block_walk_graph(irg, clear_block_info, NULL, &env.block_infos);
813 /* Removing blocks and Conds might enable more optimizations */
820 ir_nodehashmap_destroy(&env.block_infos);
823 /* Optimizations of the control flow that also require changes of Phi nodes. */
824 static ir_graph_state_t do_cfopt(ir_graph *irg)
828 ir_node *end = get_irg_end(irg);
833 env.phis_moved = false;
835 assert(get_irg_phase_state(irg) != phase_building);
837 /* if the graph is not pinned, we cannot determine empty blocks */
838 assert(get_irg_pinned(irg) != op_pin_state_floats &&
839 "Control flow optimization need a pinned graph");
841 edges_deactivate(irg);
843 /* First the "simple" optimizations, which do not touch Phis */
844 cfgopt_ignoring_phis(irg);
846 /* we use the mark flag to mark removable blocks */
847 ir_reserve_resources(irg, IR_RESOURCE_BLOCK_MARK | IR_RESOURCE_IRN_LINK
848 | IR_RESOURCE_PHI_LIST);
850 /* The switch Cond optimization might expose unreachable code, so we loop */
852 bool changed = false;
857 * This pass collects all Phi nodes in a link list in the block
858 * nodes. Further it performs simple control flow optimizations.
859 * Finally it marks all blocks that do not contain useful
860 * computations, i.e., these blocks might be removed.
862 irg_walk(end, clear_link_and_mark_blocks_removable, collect_nodes, NULL);
867 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE
868 | IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS
869 | IR_GRAPH_STATE_CONSISTENT_ENTITY_USAGE);
872 /* assert due to collect_nodes:
873 * 1. removable blocks are now marked as such
874 * 2. phi lists are up to date
877 /* Optimize the standard code.
878 * It walks only over block nodes and adapts these and the Phi nodes in these
879 * blocks, which it finds in a linked list computed before.
882 irg_block_walk_graph(irg, optimize_blocks, merge_blocks, &env);
884 new_end = optimize_in_place(end);
885 if (new_end != end) {
886 set_irg_end(irg, new_end);
889 remove_End_Bads_and_doublets(end);
891 ir_free_resources(irg, IR_RESOURCE_BLOCK_MARK | IR_RESOURCE_IRN_LINK
892 | IR_RESOURCE_PHI_LIST);
894 if (env.phis_moved) {
895 /* Bad: when we moved Phi's, we might produce dead Phi nodes
897 Some other phases cannot copy with this, so kill them.
899 n = get_End_n_keepalives(end);
901 NEW_ARR_A(ir_node *, in, n);
902 assure_irg_outs(irg);
904 for (i = j = 0; i < n; ++i) {
905 ir_node *ka = get_End_keepalive(end, i);
910 for (k = get_irn_n_outs(ka) - 1; k >= 0; --k) {
911 ir_node *user = get_irn_out(ka, k);
913 if (user != ka && user != end) {
914 /* Is it a real user or just a self loop ? */
924 set_End_keepalives(end, j, in);
933 static optdesc_t opt_cf = {
935 IR_GRAPH_STATE_NO_UNREACHABLE_CODE,
939 void optimize_cf(ir_graph *irg)
941 perform_irg_optimization(irg, &opt_cf);
944 /* Creates an ir_graph pass for optimize_cf. */
945 ir_graph_pass_t *optimize_cf_pass(const char *name)
947 return def_graph_pass(name ? name : "optimize_cf", optimize_cf);