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
28 #include "iroptimize.h"
35 #include "irgraph_t.h"
49 #include "irbackedge_t.h"
54 #include "iropt_dbg.h"
56 /*------------------------------------------------------------------*/
57 /* Control flow optimization. */
59 /* Removes Bad control flow predecessors and empty blocks. A block */
60 /* is empty if it contains only a Jmp node. */
61 /* Blocks can only be removed if they are not needed for the */
62 /* semantics of Phi nodes. */
63 /* Further, we NEVER remove labeled blocks (even if we could move */
65 /*------------------------------------------------------------------*/
67 #define set_Block_removable(block) set_Block_mark(block, 1)
68 #define set_Block_non_removable(block) set_Block_mark(block, 0)
69 #define is_Block_removable(block) (get_Block_mark(block) != 0)
72 * Replace binary Conds that jumps twice into the same block
78 * ProjX True ProjX False ==> | /
83 * Such pattern are the result of if-conversion.
85 * Note that the simple case that Block has only these two
86 * predecessors are already handled in equivalent_node_Block().
88 static int remove_senseless_conds(ir_node *bl) {
90 int n = get_Block_n_cfgpreds(bl);
93 for (i = 0; i < n; ++i) {
94 ir_node *pred_i = get_Block_cfgpred(bl, i);
95 ir_node *cond_i = skip_Proj(pred_i);
98 if (is_Cond(cond_i) && get_irn_mode(get_Cond_selector(cond_i)) == mode_b) {
100 for (j = i + 1; j < n; ++j) {
101 ir_node *pred_j = get_Block_cfgpred(bl, j);
102 ir_node *cond_j = skip_Proj(pred_j);
104 if (cond_j == cond_i) {
105 ir_node *jmp = new_r_Jmp(current_ir_graph, get_nodes_block(cond_i));
106 set_irn_n(bl, i, jmp);
107 set_irn_n(bl, j, new_Bad());
109 DBG_OPT_IFSIM2(cond_i, jmp);
119 /** An environment for merge_blocks and collect nodes. */
120 typedef struct _merge_env {
121 int changed; /**< Set if the graph was changed. */
122 int phis_moved; /**< Set if Phi nodes were moved. */
123 plist_t *list; /**< Helper list for all found Switch Conds. */
127 * Removes Tuples from Block control flow predecessors.
128 * Optimizes blocks with equivalent_node(). This is tricky,
129 * as we want to avoid nodes that have as block predecessor Bads.
130 * Therefore we also optimize at control flow operations, depending
131 * how we first reach the Block.
133 static void merge_blocks(ir_node *node, void *ctx) {
136 merge_env *env = ctx;
138 /* clear the link field for ALL nodes first */
139 set_irn_link(node, NULL);
141 if (is_Block(node)) {
143 for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
144 ir_node *pred = get_Block_cfgpred(node, i);
145 ir_node *skipped = skip_Tuple(pred);
146 if (pred != skipped) {
147 set_Block_cfgpred(node, i, skipped);
153 new_block = equivalent_node(node);
154 if (new_block != node && ! is_Block_dead(new_block)) {
155 exchange(node, new_block);
159 } else if (get_opt_optimize() && (get_irn_mode(node) == mode_X)) {
160 /* We will soon visit a block. Optimize it before visiting! */
161 ir_node *b = get_nodes_block(skip_Proj(node));
163 if (!is_Block_dead(b)) {
164 new_block = equivalent_node(b);
166 while (!irn_visited(b) && !is_Block_dead(new_block) && new_block != b) {
167 /* We would have to run gigo() if new is bad, so we
168 promote it directly below. Nevertheless, we sometimes reach a block
169 the first time through a dataflow node. In this case we optimized the
170 block as such and have to promote the Bad here. */
171 assert((get_opt_control_flow_straightening() ||
172 get_opt_control_flow_weak_simplification()) &&
173 ("strange flag setting"));
174 exchange(b, new_block);
177 new_block = equivalent_node(b);
180 /* normally, we would create a Bad block here, but this must be
181 * prevented, so just set it's cf to Bad.
183 if (is_Block_dead(new_block)) {
184 exchange(node, new_Bad());
192 * Block walker removing control flow from dead block by
193 * inspecting dominance info.
194 * Do not replace blocks by Bad. This optimization shall
195 * ensure, that all Bad control flow predecessors are
196 * removed, and no new other Bads are introduced.
197 * Further removed useless Conds and clear the mark of all blocks.
199 * Must be run in the post walker.
201 static void remove_unreachable_blocks_and_conds(ir_node *block, void *env) {
205 /* Check block predecessors and turn control flow into bad.
206 Beware of Tuple, kill them. */
207 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
208 ir_node *pred_X = get_Block_cfgpred(block, i);
209 ir_node *skipped = skip_Tuple(pred_X);
211 if (! is_Bad(skipped)) {
212 ir_node *pred_bl = get_nodes_block(skip_Proj(skipped));
214 if (is_Block_dead(pred_bl) || (get_Block_dom_depth(pred_bl) < 0)) {
215 set_Block_dead(pred_bl);
216 exchange(pred_X, new_Bad());
218 } else if (skipped != pred_X) {
219 set_Block_cfgpred(block, i, skipped);
225 *changed |= remove_senseless_conds(block);
227 /* clear the block mark of all non labeled blocks */
228 if (has_Block_label(block))
229 set_Block_non_removable(block);
231 set_Block_removable(block);
235 * Collects all Phi nodes in link list of Block.
236 * Marks all blocks "non_removable" if they contain a node other
237 * than Jmp (and Proj).
238 * Links all Proj nodes to their predecessors.
239 * Collects all switch-Conds in a list.
241 static void collect_nodes(ir_node *n, void *ctx) {
242 ir_opcode code = get_irn_opcode(n);
243 merge_env *env = ctx;
245 if (code == iro_Block) {
246 /* mark the block as non-removable if it is labeled */
247 if (has_Block_label(n))
248 set_Block_non_removable(n);
250 ir_node *b = get_nodes_block(n);
252 if (code == iro_Phi && get_irn_arity(n) > 0) {
253 /* Collect Phi nodes to compact ins along with block's ins. */
254 set_irn_link(n, get_irn_link(b));
256 } else if (code != iro_Jmp && !is_Bad(b)) { /* Check for non-empty block. */
257 set_Block_non_removable(b);
259 if (code == iro_Proj) { /* link Proj nodes */
260 ir_node *pred = get_Proj_pred(n);
262 set_irn_link(n, get_irn_link(pred));
263 set_irn_link(pred, n);
264 } else if (code == iro_Cond) {
265 ir_node *sel = get_Cond_selector(n);
266 if (mode_is_int(get_irn_mode(sel))) {
267 /* found a switch-Cond, collect */
268 plist_insert_back(env->list, n);
275 /** Returns true if pred is predecessor of block. */
276 static int is_pred_of(ir_node *pred, ir_node *b) {
279 for (i = get_Block_n_cfgpreds(b) - 1; i >= 0; --i) {
280 ir_node *b_pred = get_Block_cfgpred_block(b, i);
287 /** Test whether we can optimize away pred block pos of b.
289 * @param b A block node.
290 * @param pos The position of the predecessor block to judge about.
292 * @returns The number of predecessors
294 * The test is rather tricky.
296 * The situation is something like the following:
305 * b merges the control flow of an if-then-else. We may not remove
306 * the 'then' _and_ the 'else' block of an 'if' if there is a Phi
307 * node in b, even if both are empty. The destruction of this Phi
308 * requires that a copy is added before the merge. We have to
309 * keep one of the case blocks to place the copies in.
311 * To perform the test for pos, we must regard predecessors before pos
312 * as already removed.
314 static int test_whether_dispensable(ir_node *b, int pos) {
315 int i, j, n_preds = 1;
316 ir_node *pred = get_Block_cfgpred_block(b, pos);
318 /* Bad blocks will be optimized away, so we don't need space for them */
319 if (is_Block_dead(pred))
322 if (is_Block_removable(pred)) {
323 if (!get_opt_optimize() || !get_opt_control_flow_strong_simplification()) {
324 /* Mark block so that is will not be removed: optimization is turned off. */
325 set_Block_non_removable(pred);
329 /* Seems to be empty. At least we detected this in collect_nodes. */
330 if (get_irn_link(b) == NULL) {
331 /* There are no Phi nodes ==> all predecessors are dispensable. */
332 n_preds = get_Block_n_cfgpreds(pred);
334 /* b's pred blocks and pred's pred blocks must be pairwise disjunct.
335 Handle all pred blocks with preds < pos as if they were already removed. */
336 for (i = 0; i < pos; i++) {
337 ir_node *b_pred = get_Block_cfgpred_block(b, i);
338 if (! is_Block_dead(b_pred) && is_Block_removable(b_pred)) {
339 for (j = get_Block_n_cfgpreds(b_pred) - 1; j >= 0; --j) {
340 ir_node *b_pred_pred = get_Block_cfgpred_block(b_pred, j);
341 if (is_pred_of(b_pred_pred, pred))
342 goto non_dispensable;
345 if (is_pred_of(b_pred, pred))
346 goto non_dispensable;
349 for (i = pos +1; i < get_Block_n_cfgpreds(b); i++) {
350 ir_node *b_pred = get_Block_cfgpred_block(b, i);
351 if (is_pred_of(b_pred, pred))
352 goto non_dispensable;
354 /* if we get here, the block is dispensable */
355 n_preds = get_Block_n_cfgpreds(pred);
362 set_Block_non_removable(pred);
367 * This method removed Bad cf predecessors from Blocks and Phis, and removes
368 * empty blocks. A block is empty if it only contains Phi and Jmp nodes.
370 * We first adapt Phi nodes, then Block nodes, as we need the old ins
371 * of the Block to adapt the Phi nodes. We do this by computing new
372 * in arrays, and then replacing the old ones. So far we compute new in arrays
373 * for all nodes, not regarding whether there is a possibility for optimization.
375 * For each predecessor p of a Block b there are three cases:
376 * -1. The predecessor p is a Bad node: just skip it. The in array of b shrinks by one.
377 * -2. The predecessor p is empty. Remove p. All predecessors of p are now
379 * -3. The predecessor p is a block containing useful code. Just keep p as is.
381 * For Phi nodes f we have to check the conditions at the Block of f.
382 * For cases 1 and 3 we proceed as for Blocks. For case 2 we can have two
384 * -2a: The old predecessor of the Phi f is a Phi pred_f IN THE BLOCK REMOVED. In this
385 * case we proceed as for blocks. We remove pred_f. All
386 * predecessors of pred_f now are predecessors of f.
387 * -2b: The old predecessor of f is NOT in the block removed. It might be a Phi, too.
388 * We have to replicate f for each predecessor of the removed block. Or, with
389 * other words, the removed predecessor block has exactly one predecessor.
391 * Further there is a special case for self referencing blocks:
394 * then_b else_b then_b else_b
400 * | | | === optimized to ===> \ | | |
407 * If there is a Phi in pred_b, but we remove pred_b, we have to generate a
408 * Phi in loop_b, that has the ins of the Phi in pred_b and a self referencing
410 * @@@ It is negotiable whether we should do this ... there might end up a copy
411 * from the Phi in the loop when removing the Phis.
413 static void optimize_blocks(ir_node *b, void *ctx) {
414 int i, j, k, n, max_preds, n_preds, p_preds = -1;
415 ir_node *pred, *phi, *next;
417 merge_env *env = ctx;
419 /* Count the number of predecessor if this block is merged with pred blocks
422 for (i = 0, k = get_Block_n_cfgpreds(b); i < k; ++i) {
423 max_preds += test_whether_dispensable(b, i);
425 in = XMALLOCN(ir_node*, max_preds);
427 /*- Fix the Phi nodes of the current block -*/
428 for (phi = get_irn_link(b); phi != NULL; phi = next) {
430 next = get_irn_link(phi);
432 /* Find the new predecessors for the Phi */
434 for (i = 0, n = get_Block_n_cfgpreds(b); i < n; ++i) {
435 pred = get_Block_cfgpred_block(b, i);
437 if (is_Block_dead(pred)) {
438 /* case Phi 1: Do nothing */
439 } else if (is_Block_removable(pred) && !Block_block_visited(pred)) {
440 /* case Phi 2: It's an empty block and not yet visited. */
441 ir_node *phi_pred = get_Phi_pred(phi, i);
443 for (j = 0, k = get_Block_n_cfgpreds(pred); j < k; j++) {
444 /* because of breaking loops, not all predecessors are Bad-clean,
445 * so we must check this here again */
446 if (! is_Bad(get_Block_cfgpred(pred, j))) {
447 if (get_nodes_block(phi_pred) == pred) {
449 assert(is_Phi(phi_pred)); /* Block is empty!! */
451 in[p_preds++] = get_Phi_pred(phi_pred, j);
454 in[p_preds++] = phi_pred;
460 in[p_preds++] = get_Phi_pred(phi, i);
463 assert(p_preds <= max_preds);
467 /* By removal of Bad ins the Phi might be degenerated. */
468 exchange(phi, in[0]);
470 set_irn_in(phi, p_preds, in);
474 /*- This happens only if merge between loop backedge and single loop entry.
475 Moreover, it is only needed if predb is the direct dominator of b, else there can be no uses
476 of the Phi's in predb ... -*/
477 for (k = 0, n = get_Block_n_cfgpreds(b); k < n; ++k) {
478 ir_node *predb = get_nodes_block(get_Block_cfgpred(b, k));
480 if (is_Block_removable(predb) && !Block_block_visited(predb)) {
483 /* we found a predecessor block at position k that will be removed */
484 for (phi = get_irn_link(predb); phi; phi = next_phi) {
486 next_phi = get_irn_link(phi);
490 if (get_Block_idom(b) != predb) {
491 /* predb is not the dominator. There can't be uses of pred's Phi nodes, kill them .*/
492 exchange(phi, new_Bad());
494 /* predb is the direct dominator of b. There might be uses of the Phi nodes from
495 predb in further block, so move this phi from the predecessor into the block b */
496 set_nodes_block(phi, b);
497 set_irn_link(phi, get_irn_link(b));
498 set_irn_link(b, phi);
501 /* first, copy all 0..k-1 predecessors */
502 for (i = 0; i < k; i++) {
503 pred = get_Block_cfgpred_block(b, i);
505 if (is_Block_dead(pred)) {
507 } else if (is_Block_removable(pred) && !Block_block_visited(pred)) {
508 /* It's an empty block and not yet visited. */
509 for (j = 0; j < get_Block_n_cfgpreds(pred); j++) {
510 if (! is_Bad(get_Block_cfgpred(pred, j)))
518 /* now we are at k, copy the phi predecessors */
519 pred = get_nodes_block(get_Block_cfgpred(b, k));
520 for (i = 0; i < get_Phi_n_preds(phi); i++) {
521 if (! is_Bad(get_Block_cfgpred(pred, i)))
522 in[q_preds++] = get_Phi_pred(phi, i);
525 /* and now all the rest */
526 for (i = k+1; i < get_Block_n_cfgpreds(b); i++) {
527 pred = get_Block_cfgpred_block(b, i);
529 if (is_Block_dead(pred)) {
531 } else if (is_Block_removable(pred) && !Block_block_visited(pred)) {
532 /* It's an empty block and not yet visited. */
533 for (j = 0; j < get_Block_n_cfgpreds(pred); j++) {
534 if (! is_Bad(get_Block_cfgpred(pred, j)))
544 exchange(phi, in[0]);
546 set_irn_in(phi, q_preds, in);
549 assert(q_preds <= max_preds);
550 // assert(p_preds == q_preds && "Wrong Phi Fix");
556 /*- Fix the block -*/
558 for (i = 0; i < get_Block_n_cfgpreds(b); i++) {
559 pred = get_Block_cfgpred_block(b, i);
561 if (is_Block_dead(pred)) {
562 /* case 1: Do nothing */
563 } else if (is_Block_removable(pred) && !Block_block_visited(pred)) {
564 /* case 2: It's an empty block and not yet visited. */
565 assert(get_Block_n_cfgpreds(b) > 1 || has_Block_label(b));
566 /* Else it should be optimized by equivalent_node. */
567 for (j = 0; j < get_Block_n_cfgpreds(pred); j++) {
568 ir_node *pred_X = get_Block_cfgpred(pred, j);
570 /* because of breaking loops, not all predecessors are Bad-clean,
571 * so we must check this here again */
572 if (! is_Bad(pred_X))
573 in[n_preds++] = pred_X;
575 /* Remove block as it might be kept alive. */
576 exchange(pred, b/*new_Bad()*/);
579 in[n_preds++] = get_Block_cfgpred(b, i);
582 assert(n_preds <= max_preds);
584 set_irn_in(b, n_preds, in);
587 assert(get_irn_link(b) == NULL || p_preds == -1 || (n_preds == p_preds && "Wrong Phi Fix"));
592 * Block walker: optimize all blocks using the default optimizations.
593 * This removes Blocks that with only a Jmp predecessor.
595 static void remove_simple_blocks(ir_node *block, void *ctx) {
596 ir_node *new_blk = equivalent_node(block);
597 merge_env *env = ctx;
599 if (new_blk != block) {
600 exchange(block, new_blk);
606 * Handle pre-optimized table switch Cond's.
607 * During iropt, all Projs from a switch-Cond are already removed except
608 * the defProj and maybe the taken one.
609 * The defProj cannot be removed WITHOUT looking backwards, so we do this here.
611 * @param cond the switch-Cond
613 * @return non-zero if a switch-Cond was optimized
615 * Expects all Proj's linked to the cond node
617 static int handle_switch_cond(ir_node *cond) {
618 ir_node *sel = get_Cond_selector(cond);
620 ir_node *proj1 = get_irn_link(cond);
621 ir_node *proj2 = get_irn_link(proj1);
624 blk = get_nodes_block(cond);
627 /* this Cond has only one Proj: must be the defProj */
628 assert(get_Cond_default_proj(cond) == get_Proj_proj(proj1));
629 /* convert it into a Jmp */
630 jmp = new_r_Jmp(current_ir_graph, blk);
631 exchange(proj1, jmp);
633 } else if (get_irn_link(proj2) == NULL) {
634 /* We have two Proj's here. Check if the Cond has
635 a constant argument */
636 tarval *tv = value_of(sel);
638 if (tv != tarval_bad) {
639 /* we have a constant switch */
640 long num = get_tarval_long(tv);
641 long def_num = get_Cond_default_proj(cond);
643 if (def_num == get_Proj_proj(proj1)) {
644 /* first one is the defProj */
645 if (num == get_Proj_proj(proj2)) {
646 jmp = new_r_Jmp(current_ir_graph, blk);
647 exchange(proj2, jmp);
648 exchange(proj1, new_Bad());
651 } else if (def_num == get_Proj_proj(proj2)) {
652 /* second one is the defProj */
653 if (num == get_Proj_proj(proj1)) {
654 jmp = new_r_Jmp(current_ir_graph, blk);
655 exchange(proj1, jmp);
656 exchange(proj2, new_Bad());
660 /* neither: strange, Cond was not optimized so far */
661 if (num == get_Proj_proj(proj1)) {
662 jmp = new_r_Jmp(current_ir_graph, blk);
663 exchange(proj1, jmp);
664 exchange(proj2, new_Bad());
666 } else if (num == get_Proj_proj(proj2)) {
667 jmp = new_r_Jmp(current_ir_graph, blk);
668 exchange(proj2, jmp);
669 exchange(proj1, new_Bad());
678 /* Optimizations of the control flow that also require changes of Phi nodes.
680 * This optimization performs two passes over the graph.
682 * The first pass collects all Phi nodes in a link list in the block
683 * nodes. Further it performs simple control flow optimizations.
684 * Finally it marks all blocks that do not contain useful
685 * computations, i.e., these blocks might be removed.
687 * The second pass performs the optimizations intended by this algorithm.
688 * It walks only over block nodes and adapts these and the Phi nodes in these blocks,
689 * which it finds in a linked list computed by the first pass.
691 * We use the mark flag to mark removable blocks in the first
694 void optimize_cf(ir_graph *irg) {
695 int i, j, n, changed;
697 ir_node *cond, *end = get_irg_end(irg);
698 ir_graph *rem = current_ir_graph;
702 assert(get_irg_phase_state(irg) != phase_building);
704 /* if the graph is not pinned, we cannot determine empty blocks */
705 assert(get_irg_pinned(irg) != op_pin_state_floats &&
706 "Control flow optimization need a pinned graph");
708 current_ir_graph = irg;
710 /* FIXME: control flow opt destroys block edges. So edges are deactivated here. Fix the edges! */
711 edges_deactivate(irg);
713 /* we use the mark flag to mark removable blocks */
714 ir_reserve_resources(irg, IR_RESOURCE_BLOCK_MARK);
719 /* ALWAYS kill unreachable control flow. Backend cannot handle it anyway.
720 Use dominator info to kill blocks. Also optimize useless Conds. */
722 irg_block_walk_graph(irg, NULL, remove_unreachable_blocks_and_conds, &env.changed);
724 /* fix the keep-alives */
726 for (i = 0, n = get_End_n_keepalives(end); i < n; ++i) {
727 ir_node *ka = get_End_keepalive(end, i);
730 /* do NOT keep dead blocks */
731 if (is_Block_dead(ka) || get_Block_dom_depth(ka) < 0) {
732 set_End_keepalive(end, i, new_Bad());
736 ir_node *block = get_nodes_block(ka);
738 if (is_Bad(block) || is_Block_dead(block) || get_Block_dom_depth(block) < 0) {
739 /* do NOT keep nodes in dead blocks */
740 set_End_keepalive(end, i, new_Bad());
745 env.changed |= changed;
747 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
749 env.list = plist_new();
750 irg_walk(end, merge_blocks, collect_nodes, &env);
752 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
755 /* Handle graph state if was changed. */
756 set_irg_outs_inconsistent(irg);
757 set_irg_doms_inconsistent(irg);
758 set_irg_extblk_inconsistent(irg);
759 set_irg_loopinfo_inconsistent(irg);
760 set_irg_entity_usage_state(irg, ir_entity_usage_not_computed);
764 /* handle all collected switch-Conds */
765 foreach_plist(env.list, el) {
766 cond = plist_element_get_value(el);
767 env.changed |= handle_switch_cond(cond);
769 plist_free(env.list);
772 /* The Cond optimization might generate unreachable code, so restart if
777 /* Optimize the standard code. */
780 irg_block_walk_graph(irg, optimize_blocks, remove_simple_blocks, &env);
782 /* in rare cases a node may be kept alive more than once, use the visited flag to detect this */
783 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
784 inc_irg_visited(irg);
786 /* fix the keep-alives again */
788 for (i = 0, n = get_End_n_keepalives(end); i < n; ++i) {
789 ir_node *ka = get_End_keepalive(end, i);
792 /* do NOT keep dead blocks */
793 if (is_Block_dead(ka) || get_Block_dom_depth(ka) < 0) {
794 set_End_keepalive(end, i, new_Bad());
798 ir_node *block = get_nodes_block(ka);
800 if (is_Bad(block) || is_Block_dead(block) || get_Block_dom_depth(block) < 0) {
801 /* do NOT keep nodes in dead blocks */
802 set_End_keepalive(end, i, new_Bad());
807 env.changed |= changed;
809 remove_End_Bads_and_doublets(end);
812 ir_free_resources(irg, IR_RESOURCE_BLOCK_MARK | IR_RESOURCE_IRN_VISITED);
814 if (env.phis_moved) {
815 /* Bad: when we moved Phi's, we might produce dead Phi nodes
817 Some other phases cannot copy with this, so will them.
819 n = get_End_n_keepalives(end);
821 NEW_ARR_A(ir_node *, in, n);
823 /* Handle graph state if was changed. */
824 set_irg_outs_inconsistent(irg);
826 assure_irg_outs(irg);
828 for (i = j = 0; i < n; ++i) {
829 ir_node *ka = get_End_keepalive(end, i);
834 for (k = get_irn_n_outs(ka) - 1; k >= 0; --k) {
835 ir_node *user = get_irn_out(ka, k);
837 if (user != ka && user != end) {
838 /* Is it a real user or just a self loop ? */
848 set_End_keepalives(end, j, in);
855 /* Handle graph state if was changed. */
856 set_irg_outs_inconsistent(irg);
857 set_irg_doms_inconsistent(irg);
858 set_irg_extblk_inconsistent(irg);
859 set_irg_loopinfo_inconsistent(irg);
860 set_irg_entity_usage_state(irg, ir_entity_usage_not_computed);
864 /* the verifier doesn't work yet with floating nodes */
865 if (get_irg_pinned(irg) == op_pin_state_pinned) {
866 /* after optimize_cf(), only Bad data flow may remain. */
867 if (irg_vrfy_bads(irg, BAD_DF | BAD_BLOCK | TUPLE)) {
868 dump_ir_block_graph(irg, "-vrfy-cf");
869 dump_ir_graph(irg, "-vrfy-cf");
870 fprintf(stderr, "VRFY_BAD in optimize_cf()\n");
874 current_ir_graph = rem;