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 Backend IRG modification routines.
23 * @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
27 * This file contains the following IRG modifications for be routines:
28 * - insertion of Perm nodes
29 * - empty block elimination
30 * - a simple dead node elimination (set inputs of unreachable nodes to BAD)
51 #include "iredges_t.h"
52 #include "irgraph_t.h"
55 #include "irprintf_t.h"
59 #include "bechordal_t.h"
66 #include "bessaconstr.h"
71 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
75 |_ _|_ __ ___ ___ _ __| |_ | _ \ ___ _ __ _ __ ___
76 | || '_ \/ __|/ _ \ '__| __| | |_) / _ \ '__| '_ ` _ \
77 | || | | \__ \ __/ | | |_ | __/ __/ | | | | | | |
78 |___|_| |_|___/\___|_| \__| |_| \___|_| |_| |_| |_|
82 ir_node *insert_Perm_after(be_irg_t *birg,
83 const arch_register_class_t *cls,
86 be_lv_t *lv = birg->lv;
87 ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
89 ir_nodeset_iterator_t iter;
91 ir_node *curr, *irn, *perm, **nodes;
94 DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos));
96 ir_nodeset_init(&live);
97 be_liveness_nodes_live_at(lv, cls, pos, &live);
99 n = ir_nodeset_size(&live);
101 ir_nodeset_destroy(&live);
105 nodes = XMALLOCN(ir_node*, n);
107 DBG((dbg, LEVEL_1, "live:\n"));
109 foreach_ir_nodeset(&live, irn, iter) {
110 DBG((dbg, LEVEL_1, "\t%+F\n", irn));
114 ir_nodeset_destroy(&live);
116 perm = be_new_Perm(cls, bl, n, nodes);
117 sched_add_after(pos, perm);
121 for (i = 0; i < n; ++i) {
122 ir_node *perm_op = get_irn_n(perm, i);
123 const arch_register_t *reg = arch_get_irn_register(perm_op);
124 be_ssa_construction_env_t senv;
126 ir_mode *mode = get_irn_mode(perm_op);
127 ir_node *proj = new_r_Proj(perm, mode, i);
128 arch_set_irn_register(proj, reg);
132 be_ssa_construction_init(&senv, birg);
133 be_ssa_construction_add_copy(&senv, perm_op);
134 be_ssa_construction_add_copy(&senv, proj);
135 be_ssa_construction_fix_users(&senv, perm_op);
136 be_ssa_construction_update_liveness_phis(&senv, lv);
137 be_liveness_update(lv, perm_op);
138 be_liveness_update(lv, proj);
139 be_ssa_construction_destroy(&senv);
145 static int blocks_removed;
148 * Post-block-walker: Find blocks containing only one jump and
151 static void remove_empty_block(ir_node *block)
153 const ir_edge_t *edge, *next;
158 ir_node *jump = NULL;
160 if (irn_visited_else_mark(block))
163 if (get_Block_n_cfgpreds(block) != 1)
166 sched_foreach(block, node) {
168 && !(arch_irn_get_flags(node) & arch_irn_flags_simple_jump))
171 /* we should never have 2 jumps in a block */
172 panic("found 2 jumps in a block");
180 pred = get_Block_cfgpred(block, 0);
182 foreach_out_edge_safe(jump, edge, next) {
183 int pos = get_edge_src_pos(edge);
185 assert(succ_block == NULL);
186 succ_block = get_edge_src_irn(edge);
187 if (has_Block_entity(succ_block) && has_Block_entity(block)) {
189 * Currently we can add only one label for a block.
190 * Therefore we cannot combine them if both block already have one.
195 set_irn_n(succ_block, pos, pred);
198 if (has_Block_entity(block)) {
199 /* move the label to the successor block */
200 ir_entity *entity = get_Block_entity(block);
201 set_Block_entity(succ_block, entity);
204 /* there can be some non-scheduled Pin nodes left in the block, move them
205 * to the succ block (Pin) or pred block (Sync) */
206 foreach_out_edge_safe(block, edge, next) {
207 node = get_edge_src_irn(edge);
211 if (is_Block(node)) {
212 /* a Block->Block edge: This should be the MacroBlock
214 assert(get_Block_MacroBlock(node) == block && "Wrong Block->Block edge");
217 /* we simply kill Pins, because there are some strange interactions
218 * between jump threading, which produce PhiMs with Pins, we simply
219 * kill the pins here, everything is scheduled anyway */
221 exchange(node, get_Pin_op(node));
225 set_nodes_block(node, get_nodes_block(pred));
228 if (is_End(node)) { /* End-keep, reroute it to the successor */
229 int pos = get_edge_src_pos(edge);
230 set_irn_n(node, pos, succ_block);
233 panic("Unexpected node %+F in block %+F with empty schedule", node, block);
236 set_Block_cfgpred(block, 0, new_Bad());
240 /* check predecessor */
241 remove_empty_block(get_nodes_block(pred));
245 arity = get_Block_n_cfgpreds(block);
246 for (i = 0; i < arity; ++i) {
247 ir_node *pred = get_Block_cfgpred_block(block, i);
248 remove_empty_block(pred);
252 /* removes basic blocks that just contain a jump instruction */
253 int be_remove_empty_blocks(ir_graph *irg)
260 ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
261 inc_irg_visited(irg);
262 remove_empty_block(get_irg_end_block(irg));
263 end = get_irg_end(irg);
264 arity = get_irn_arity(end);
265 for (i = 0; i < arity; ++i) {
266 ir_node *pred = get_irn_n(end, i);
269 remove_empty_block(pred);
271 ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
273 if (blocks_removed) {
274 /* invalidate analysis info */
275 set_irg_doms_inconsistent(irg);
276 set_irg_extblk_inconsistent(irg);
277 set_irg_outs_inconsistent(irg);
278 set_irg_loopinfo_inconsistent(irg);
280 return blocks_removed;
283 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_irgmod);
284 void be_init_irgmod(void)
286 FIRM_DBG_REGISTER(dbg, "firm.be.irgmod");