2 * Copyright (C) 1995-2007 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 conv node optimisation
23 * @author Matthias Braun, Christoph Mallon
26 * Try to minimize the number of conv nodes by changing modes of operations.
27 * The typical example is the following structure:
32 * Add Is gets transformed to |
36 * TODO: * try to optimize cmp modes
37 * * decide when it is useful to move the convs through phis
49 #include "iredges_t.h"
53 DEBUG_ONLY(static firm_dbg_module_t *dbg);
56 int is_optimizable_node(const ir_node *node)
59 ir_mode *mode = get_irn_mode(node);
60 /* tarval module is incomplete and can't convert floats to ints */
61 if(!mode_is_int(mode))
65 return is_Add(node) || is_Sub(node) || is_Mul(node) || is_Phi(node);
69 int get_conv_costs(const ir_node *node, ir_mode *dest_mode)
71 ir_mode *mode = get_irn_mode(node);
77 if(!is_Const(node) && get_irn_n_edges(node) > 1) {
78 DB((dbg, LEVEL_3, "multi outs at %+F\n", node));
83 return get_conv_costs(get_Conv_op(node), dest_mode) - 1;
86 if(is_optimizable_node(node)) {
88 int arity = get_irn_arity(node);
91 for(i = 0; i < arity; ++i) {
92 ir_node *pred = get_irn_n(node, i);
93 costs += get_conv_costs(pred, dest_mode);
103 ir_node *conv_transform(ir_node *node, ir_mode *dest_mode)
108 if (get_irn_mode(node) == dest_mode)
111 if (is_Const(node)) {
112 tarval *tv = tarval_convert_to(get_Const_tarval(node), dest_mode);
113 assert(get_tarval_mode(tv) == dest_mode);
114 return new_Const(dest_mode, tv);
118 return conv_transform(get_Conv_op(node), dest_mode);
121 if (!is_optimizable_node(node) || get_irn_n_edges(node) > 1) {
122 ir_node *block = get_nodes_block(node);
123 ir_node *conv = new_r_Conv(current_ir_graph, block, node, dest_mode);
127 arity = get_irn_arity(node);
128 for (i = 0; i < arity; i++) {
129 ir_node *pred = get_irn_n(node, i);
130 ir_node *transformed = conv_transform(pred, dest_mode);
131 set_irn_n(node, i, transformed);
133 set_irn_mode(node, dest_mode);
138 int is_downconv(ir_mode *src_mode, ir_mode *dest_mode)
140 if(!mode_is_int(src_mode) || !mode_is_int(dest_mode))
142 if(get_mode_size_bits(dest_mode) >= get_mode_size_bits(src_mode))
148 /* TODO, backends can't handle and it's probably not more efficient on most
152 void try_optimize_cmp(ir_node *node)
154 ir_node *left = get_Cmp_left(node);
155 ir_node *right = get_Cmp_right(node);
156 ir_node *conv = NULL;
165 void conv_opt_walker(ir_node *node, void *data)
167 ir_node *transformed;
175 try_optimize_cmp(node);
183 pred = get_Conv_op(node);
184 mode = get_irn_mode(node);
185 pred_mode = get_irn_mode(pred);
187 if (!is_Phi(pred) && !is_downconv(pred_mode, mode))
190 costs = get_conv_costs(pred, mode);
191 DB((dbg, LEVEL_2, "Costs for %+F -> %+F: %d\n", node, pred, costs));
192 if (costs > 0) return;
194 transformed = conv_transform(pred, mode);
195 exchange(node, transformed);
199 void conv_opt(ir_graph *irg)
201 FIRM_DBG_REGISTER(dbg, "firm.opt.conv");
203 DB((dbg, LEVEL_1, "===> Performing conversion optimization on %+F\n", irg));
208 irg_walk_graph(irg, NULL, conv_opt_walker, NULL);
209 local_optimize_graph(irg);