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 * @file ir/opt/ifconv.c
22 * @brief If conversion
23 * @author Christoph Mallon
32 #include "iroptimize.h"
48 DEBUG_ONLY(static firm_dbg_module_t *dbg);
50 /** allow every Mux to be created. */
51 static int default_allow_ifconv(ir_node *sel, ir_node* phi_list, int i, int j)
63 static const ir_settings_if_conv_t default_info = {
64 0, /* doesn't matter for Mux */
69 * Returns non-zero if a Block can be emptied.
71 static int can_empty_block(ir_node *block) {
72 return get_Block_mark(block) == 0;
76 static ir_node* walk_to_projx(ir_node* start, const ir_node* dependency)
81 /* No need to find the conditional block if this block cannot be emptied and
82 * therefore not moved */
83 if (!can_empty_block(start)) return NULL;
85 arity = get_irn_arity(start);
86 for (i = 0; i < arity; ++i) {
87 ir_node* pred = get_irn_n(start, i);
88 ir_node* pred_block = get_nodes_block(pred);
90 if (pred_block == dependency) {
92 assert(get_irn_mode(pred) == mode_X);
99 assert(get_irn_mode(pred) == mode_X);
103 if (is_cdep_on(pred_block, dependency)) {
104 return walk_to_projx(pred_block, dependency);
112 * Copies the DAG starting at node to the ith predecessor block of src_block
113 * -if the node isn't in the src_block, this is a nop and the node is returned
114 * -if the node is a phi in the src_block, the ith predecessor of the phi is
116 * otherwise returns the copy of the passed node
118 static ir_node* copy_to(ir_node* node, ir_node* src_block, int i)
125 if (get_nodes_block(node) != src_block) return node;
126 if (get_irn_op(node) == op_Phi) return get_irn_n(node, i);
128 copy = exact_copy(node);
129 dst_block = get_nodes_block(get_irn_n(src_block, i));
130 set_nodes_block(copy, dst_block);
132 DB((dbg, LEVEL_1, "Copying node %+F to block %+F, copy is %+F\n",
133 node, dst_block, copy));
135 arity = get_irn_arity(node);
136 for (j = 0; j < arity; ++j) {
137 set_irn_n(copy, j, copy_to(get_irn_n(node, j), src_block, i));
138 DB((dbg, LEVEL_2, "-- pred %d is %+F\n", j, get_irn_n(copy, j)));
145 * Remove predecessors i and j from node and add predecessor new_pred
147 static void rewire(ir_node* node, int i, int j, ir_node* new_pred)
149 int arity = get_irn_arity(node);
154 NEW_ARR_A(ir_node *, ins, arity - 1);
157 for (k = 0; k < i; ++k) ins[l++] = get_irn_n(node, k);
158 for (++k; k < j; ++k) ins[l++] = get_irn_n(node, k);
159 for (++k; k < arity; ++k) ins[l++] = get_irn_n(node, k);
161 assert(l == arity - 1);
162 set_irn_in(node, l, ins);
167 * Remove the jth predecessors from the ith predecessor of block and add it to block
169 static void split_block(ir_node* block, int i, int j)
171 ir_node* pred_block = get_nodes_block(get_irn_n(block, i));
172 int arity = get_irn_arity(block);
179 DB((dbg, LEVEL_1, "Splitting predecessor %d of predecessor %d of %+F\n", j, i, block));
181 NEW_ARR_A(ir_node*, ins, arity + 1);
183 for (phi = get_Block_phis(block); phi != NULL; phi = get_Phi_next(phi)) {
184 ir_node* copy = copy_to(get_irn_n(phi, i), pred_block, j);
186 for (k = 0; k < i; ++k) ins[k] = get_irn_n(phi, k);
188 for (; k < arity; ++k) ins[k] = get_irn_n(phi, k);
189 ins[k] = get_irn_n(phi, i);
191 set_irn_in(phi, arity + 1, ins);
194 for (k = 0; k < i; ++k) ins[k] = get_irn_n(block, k);
195 ins[k++] = get_irn_n(pred_block, j);
196 for (; k < arity; ++k) ins[k] = get_irn_n(block, k);
197 ins[k] = get_irn_n(block, i);
199 set_irn_in(block, arity + 1, ins);
201 new_pred_arity = get_irn_arity(pred_block) - 1;
202 NEW_ARR_A(ir_node*, pred_ins, new_pred_arity);
204 for (phi = get_Block_phis(pred_block); phi != NULL; phi = next) {
205 for (k = 0; k < j; ++k) pred_ins[k] = get_irn_n(phi, k);
206 for (; k < new_pred_arity; ++k) pred_ins[k] = get_irn_n(phi, k + 1);
207 assert(k == new_pred_arity);
208 next = get_Phi_next(phi);
209 if (new_pred_arity > 1) {
210 set_irn_in(phi, new_pred_arity, pred_ins);
212 exchange(phi, pred_ins[0]);
216 for (k = 0; k < j; ++k) pred_ins[k] = get_irn_n(pred_block, k);
217 for (; k < new_pred_arity; ++k) pred_ins[k] = get_irn_n(pred_block, k + 1);
218 assert(k == new_pred_arity);
219 if (new_pred_arity > 1) {
220 set_irn_in(pred_block, new_pred_arity, pred_ins);
222 exchange(pred_block, get_nodes_block(pred_ins[0]));
227 static void prepare_path(ir_node* block, int i, const ir_node* dependency)
229 ir_node* pred = get_nodes_block(get_irn_n(block, i));
233 DB((dbg, LEVEL_1, "Preparing predecessor %d of %+F\n", i, block));
235 pred_arity = get_irn_arity(pred);
236 for (j = 0; j < pred_arity; ++j) {
237 ir_node* pred_pred = get_nodes_block(get_irn_n(pred, j));
239 if (is_cdep_on(pred_pred, dependency)) {
240 prepare_path(pred, j, dependency);
241 split_block(block, i, j);
248 static void if_conv_walker(ir_node* block, void* env)
250 ir_settings_if_conv_t* opt_info = env;
254 /* Bail out, if there are no Phis at all */
255 if (get_Block_phis(block) == NULL) return;
258 arity = get_irn_arity(block);
259 for (i = 0; i < arity; ++i) {
263 pred0 = get_Block_cfgpred_block(block, i);
264 for (cdep = find_cdep(pred0); cdep != NULL; cdep = cdep->next) {
265 const ir_node* dependency = cdep->node;
266 ir_node* projx0 = walk_to_projx(pred0, dependency);
270 if (projx0 == NULL) continue;
272 cond = get_Proj_pred(projx0);
276 /* We only handle boolean decisions, no switches */
277 if (get_irn_mode(get_Cond_selector(cond)) != mode_b) continue;
279 for (j = i + 1; j < arity; ++j) {
287 pred1 = get_Block_cfgpred_block(block, j);
289 if (!is_cdep_on(pred1, dependency)) continue;
291 projx1 = walk_to_projx(pred1, dependency);
293 if (projx1 == NULL) continue;
295 phi = get_Block_phis(block);
296 if (!opt_info->allow_ifconv(get_Cond_selector(cond), phi, i, j)) continue;
298 DB((dbg, LEVEL_1, "Found Cond %+F with proj %+F and %+F\n",
302 prepare_path(block, i, dependency);
303 prepare_path(block, j, dependency);
304 arity = get_irn_arity(block);
306 sel = get_Cond_selector(cond);
308 mux_block = get_nodes_block(cond);
309 cond_dbg = get_irn_dbg_info(cond);
311 ir_node* val_i = get_irn_n(phi, i);
312 ir_node* val_j = get_irn_n(phi, j);
316 if (val_i == val_j) {
318 DB((dbg, LEVEL_2, "Generating no Mux, because both values are equal\n"));
322 /* Something is very fishy if two predecessors of a PhiM point into
323 * one block, but not at the same memory node
325 assert(get_irn_mode(phi) != mode_M);
326 if (get_Proj_proj(projx0) == pn_Cond_true) {
334 mux = new_rd_Mux(cond_dbg, current_ir_graph, mux_block, sel, f, t, get_irn_mode(phi));
335 DB((dbg, LEVEL_2, "Generating %+F for %+F\n", mux, phi));
338 next_phi = get_Phi_next(phi);
343 rewire(phi, i, j, mux);
347 } while (phi != NULL);
349 exchange(get_nodes_block(get_irn_n(block, i)), mux_block);
350 exchange(get_nodes_block(get_irn_n(block, j)), mux_block);
355 DB((dbg, LEVEL_1, "Welding block %+F and %+F\n", block, mux_block));
356 /* copy the block-info from the Mux-block to the block before merging */
358 mark = get_Block_mark(mux_block) | get_Block_mark(block);
359 set_Block_mark(block, mark);
360 set_Block_phis(block, get_Block_phis(mux_block));
362 set_irn_in(block, get_irn_arity(mux_block), get_irn_in(mux_block) + 1);
363 exchange_cdep(mux_block, block);
364 exchange(mux_block, block);
366 DB((dbg, LEVEL_1, "Welding block %+F to %+F\n", block, mux_block));
367 mark = get_Block_mark(mux_block) | get_Block_mark(block);
368 /* mark both block just to be sure, should be enough to mark mux_block */
369 set_Block_mark(mux_block, mark);
370 exchange(block, mux_block);
374 rewire(block, i, j, new_r_Jmp(current_ir_graph, mux_block));
383 * Block walker: clear block mark and Phi list
385 static void init_block_link(ir_node *block, void *env)
388 set_Block_mark(block, 0);
389 set_Block_phis(block, NULL);
394 * Daisy-chain all phis in a block
395 * If a non-movable node is encountered set the has_pinned flag in its block.
397 static void collect_phis(ir_node *node, void *env) {
401 ir_node *block = get_nodes_block(node);
403 add_Block_phi(block, node);
405 if (is_no_Block(node) && get_irn_pinned(node) == op_pin_state_pinned) {
407 * Ignore control flow nodes, these will be removed.
408 * This ignores Raise. That is surely bad. FIXME.
410 if (!is_cfop(node)) {
411 ir_node *block = get_nodes_block(node);
413 DB((dbg, LEVEL_2, "Node %+F in block %+F is unmovable\n", node, block));
414 set_Block_mark(block, 1);
420 static void optimise_muxs_0(ir_node* mux, void* env)
427 if (!is_Mux(mux)) return;
429 t = get_Mux_true(mux);
430 f = get_Mux_false(mux);
432 DB((dbg, LEVEL_3, "Simplify %+F T=%+F F=%+F\n", mux, t, f));
435 DB((dbg, LEVEL_3, "Replace Mux with unknown operand by %+F\n", f));
440 DB((dbg, LEVEL_3, "Replace Mux with unknown operand by %+F\n", t));
446 ir_graph* irg = current_ir_graph;
447 ir_node* block = get_nodes_block(mux);
448 ir_mode* mode = get_irn_mode(mux);
449 ir_node* c0 = get_Mux_sel(mux);
450 ir_node* c1 = get_Mux_sel(t);
451 ir_node* t1 = get_Mux_true(t);
452 ir_node* f1 = get_Mux_false(t);
454 /* Mux(c0, Mux(c1, x, y), y) -> typical if (c0 && c1) x else y */
455 ir_node* and_ = new_r_And(irg, block, c0, c1, mode_b);
456 ir_node* new_mux = new_r_Mux(irg, block, and_, f1, t1, mode);
457 exchange(mux, new_mux);
458 } else if (f == t1) {
459 /* Mux(c0, Mux(c1, x, y), x) */
460 ir_node* not_c1 = new_r_Not(irg, block, c1, mode_b);
461 ir_node* and_ = new_r_And(irg, block, c0, not_c1, mode_b);
462 ir_node* new_mux = new_r_Mux(irg, block, and_, t1, f1, mode);
463 exchange(mux, new_mux);
465 } else if (is_Mux(f)) {
466 ir_graph* irg = current_ir_graph;
467 ir_node* block = get_nodes_block(mux);
468 ir_mode* mode = get_irn_mode(mux);
469 ir_node* c0 = get_Mux_sel(mux);
470 ir_node* c1 = get_Mux_sel(f);
471 ir_node* t1 = get_Mux_true(f);
472 ir_node* f1 = get_Mux_false(f);
474 /* Mux(c0, x, Mux(c1, x, y)) -> typical if (c0 || c1) x else y */
475 ir_node* or_ = new_r_Or(irg, block, c0, c1, mode_b);
476 ir_node* new_mux = new_r_Mux(irg, block, or_, f1, t1, mode);
477 exchange(mux, new_mux);
478 } else if (t == f1) {
479 /* Mux(c0, x, Mux(c1, y, x)) */
480 ir_node* not_c1 = new_r_Not(irg, block, c1, mode_b);
481 ir_node* or_ = new_r_Or(irg, block, c0, not_c1, mode_b);
482 ir_node* new_mux = new_r_Mux(irg, block, or_, t1, f1, mode);
483 exchange(mux, new_mux);
489 static void optimise_muxs_1(ir_node* mux, void* env)
497 if (!is_Mux(mux)) return;
499 t = get_Mux_true(mux);
500 f = get_Mux_false(mux);
502 DB((dbg, LEVEL_3, "Simplify %+F T=%+F F=%+F\n", mux, t, f));
504 mode = get_irn_mode(mux);
506 if (is_Const(t) && is_Const(f) && (mode_is_int(mode))) {
507 ir_node* block = get_nodes_block(mux);
508 ir_node* c = get_Mux_sel(mux);
509 tarval* tv_t = get_Const_tarval(t);
510 tarval* tv_f = get_Const_tarval(f);
511 if (tarval_is_one(tv_t) && tarval_is_null(tv_f)) {
512 ir_node* conv = new_r_Conv(current_ir_graph, block, c, mode);
514 } else if (tarval_is_null(tv_t) && tarval_is_one(tv_f)) {
515 ir_node* not_ = new_r_Not(current_ir_graph, block, c, mode_b);
516 ir_node* conv = new_r_Conv(current_ir_graph, block, not_, mode);
523 void opt_if_conv(ir_graph *irg, const ir_settings_if_conv_t *params)
525 ir_settings_if_conv_t p;
527 /* get the parameters */
528 p = (params != NULL ? *params : default_info);
530 FIRM_DBG_REGISTER(dbg, "firm.opt.ifconv");
532 DB((dbg, LEVEL_1, "Running if-conversion on %+F\n", irg));
534 normalize_one_return(irg);
535 remove_critical_cf_edges(irg);
540 ir_reserve_resources(irg, IR_RESOURCE_BLOCK_MARK);
542 irg_block_walk_graph(irg, init_block_link, NULL, NULL);
543 irg_walk_graph(irg, collect_phis, NULL, NULL);
544 irg_block_walk_graph(irg, NULL, if_conv_walker, &p);
546 ir_free_resources(irg, IR_RESOURCE_BLOCK_MARK);
548 local_optimize_graph(irg);
550 irg_walk_graph(irg, NULL, optimise_muxs_0, NULL);
552 irg_walk_graph(irg, NULL, optimise_muxs_1, NULL);
555 /* TODO: graph might be changed, handle more graceful */
556 set_irg_outs_inconsistent(irg);
557 set_irg_extblk_inconsistent(irg);
558 set_irg_loopinfo_inconsistent(irg);