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
21 * @brief Remove all Bad nodes from ir graph
22 * @author Andreas Zwinkau
37 * Return the number of non-Bad predecessors of the given node.
39 static int count_non_bads(ir_node *node)
41 int arity = get_irn_arity(node);
44 for (i = 0; i < arity; ++i) {
45 if (!is_Bad(get_irn_n(node, i)))
52 * Block-walker, remove Bad block predecessors and shorten Phis.
53 * Phi links must be uptodate.
55 static void block_remove_bads(ir_node *block)
57 ir_graph *irg = get_irn_irg(block);
58 const int max = get_irn_arity(block);
59 const int new_max = count_non_bads(block);
60 ir_node **new_in = ALLOCAN(ir_node*, new_max);
66 ir_entity *block_entity;
67 assert(max >= new_max);
69 /* 1. Create a new block without Bad inputs */
70 for (i = j = 0; i < max; ++i) {
71 ir_node *block_pred = get_irn_n(block, i);
72 if (!is_Bad(block_pred)) {
73 new_in[j++] = block_pred;
78 /* If the end block is unreachable, it might have zero predecessors. */
80 ir_node *end_block = get_irg_end_block(irg);
81 if (block == end_block) {
82 set_irn_in(block, new_max, new_in);
87 new_block = new_r_Block(irg, new_max, new_in);
88 block_entity = get_Block_entity(block);
90 set_Block_entity(new_block, block_entity);
92 /* 2. Remove inputs on Phis, where the block input is Bad. */
93 for (phi = get_Block_phis(block); phi != NULL; phi = next) {
96 next = get_Phi_next(phi);
97 assert(get_irn_arity(phi) == max);
99 for (i = j = 0; i < max; ++i) {
100 ir_node *block_pred = get_irn_n(block, i);
102 if (!is_Bad(block_pred)) {
103 ir_node *pred = get_irn_n(phi, i);
107 assert(j == new_max);
109 new_phi = new_r_Phi(new_block, new_max, new_in, get_irn_mode(phi));
110 exchange(phi, new_phi);
113 exchange(block, new_block);
116 static void collect(ir_node *node, void *env)
118 firm_collect_block_phis(node, NULL);
119 if (is_Block(node)) {
120 ir_node ***blocks_to_process = (ir_node***)env;
121 int arity = get_irn_arity(node);
122 int non_bads = count_non_bads(node);
123 if (arity != non_bads)
124 ARR_APP1(ir_node*, *blocks_to_process, node);
128 void remove_bads(ir_graph *irg)
132 ir_node **blocks_to_process = NEW_ARR_F(ir_node*, 0);
134 /* build phi list per block */
135 irg_walk_graph(irg, firm_clear_block_phis, collect, &blocks_to_process);
137 n_to_process = ARR_LEN(blocks_to_process);
138 for (i = 0; i < n_to_process; ++i) {
139 ir_node *block = blocks_to_process[i];
140 block_remove_bads(block);
142 DEL_ARR_F(blocks_to_process);
144 if (n_to_process > 0) {
145 edges_deactivate(irg);
146 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
147 clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE);
149 add_irg_properties(irg, IR_GRAPH_PROPERTY_NO_BADS);