/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
* @file
* @brief conv node optimisation
* @author Matthias Braun, Christoph Mallon
- * @version $Id: condeval.c 13543 2007-04-29 19:29:02Z beck $
*
* Try to minimize the number of conv nodes by changing modes of operations.
* The typical example is the following structure:
* Add Is gets transformed to |
* |
* Conv Hs
+ *
+ * TODO: * try to optimize cmp modes
+ * * decide when it is useful to move the convs through phis
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
-#endif
+
+#include "iroptimize.h"
#include <assert.h>
+#include <stdbool.h>
#include "debug.h"
#include "ircons.h"
#include "irgmod.h"
+#include "irgopt.h"
#include "irnode_t.h"
+#include "iropt_t.h"
#include "iredges_t.h"
#include "irgwalk.h"
#include "irprintf.h"
+#include "irpass_t.h"
+#include "tv.h"
+#include "vrp.h"
+
+DEBUG_ONLY(static firm_dbg_module_t *dbg;)
-DEBUG_ONLY(static firm_dbg_module_t *dbg);
+static inline int imin(int a, int b) { return a < b ? a : b; }
-static
-int is_optimizable_node(const ir_node *node)
+static bool is_optimizable_node(const ir_node *node, ir_mode *dest_mode)
{
- if(is_Const(node)) {
- ir_mode *mode = get_irn_mode(node);
- /* tarval module is incomplete and can't convert floats to ints */
- if(!mode_is_int(mode))
- return 0;
- return 1;
+ switch (get_irn_opcode(node)) {
+ case iro_Minus:
+ case iro_Phi:
+ case iro_And:
+ case iro_Eor:
+ case iro_Or:
+ case iro_Not:
+ return true;
+ case iro_Add:
+ case iro_Mul:
+ case iro_Sub:
+ if (mode_is_float(get_irn_mode(node)))
+ return false;
+ return true;
+ case iro_Shl: {
+ int modulo_shift = get_mode_modulo_shift(dest_mode);
+ int old_shift = get_mode_modulo_shift(get_irn_mode(node));
+ /* bail out if modulo shift changes */
+ if (modulo_shift != old_shift)
+ return false;
+ return true;
}
- return is_Add(node) || is_Sub(node) || is_Mul(node);
+
+ default:
+ return false;
+ }
+}
+
+static ir_tarval* conv_const_tv(const ir_node* cnst, ir_mode* dest_mode)
+{
+ return tarval_convert_to(get_Const_tarval(cnst), dest_mode);
}
-static
-int get_conv_costs(const ir_node *node, ir_mode *dest_mode)
+static bool is_downconv(ir_mode *src_mode, ir_mode *dest_mode)
+{
+ return ((mode_is_int(src_mode) && mode_is_int(dest_mode))
+ || (mode_is_float(src_mode) && mode_is_float(dest_mode)))
+ && get_mode_size_bits(dest_mode) <= get_mode_size_bits(src_mode);
+}
+
+static int get_conv_costs(const ir_node *node, ir_mode *dest_mode)
{
ir_mode *mode = get_irn_mode(node);
+ int arity;
+ int i;
+ int costs;
- if(mode == dest_mode)
+ if (mode == dest_mode)
return 0;
- /* TODO... */
- if(!is_Const(node) && get_irn_n_edges(node) > 1) {
+ if (is_Const(node)) {
+ return conv_const_tv(node, dest_mode) == tarval_bad ? 1 : 0;
+ }
+
+ if (is_Conv(node) &&
+ is_downconv(mode, dest_mode) &&
+ get_irn_mode(get_Conv_op(node)) == dest_mode) {
+ return -1;
+ }
+
+ if (get_irn_n_edges(node) > 1) {
DB((dbg, LEVEL_3, "multi outs at %+F\n", node));
return 1;
}
- if(is_Conv(node)) {
- return get_conv_costs(get_Conv_op(node), dest_mode) - 1;
+ if (ir_zero_when_converted(node, dest_mode)) {
+ return -1;
+ }
+
+ /* TODO: Phi nodes */
+
+ if (!is_downconv(mode, dest_mode)) {
+ return 1;
}
- if(is_optimizable_node(node)) {
- int i;
- int arity = get_irn_arity(node);
- int costs = 0;
+ if (is_Conv(node)) {
+ ir_node *pred = get_Conv_op(node);
+ ir_mode *pred_mode = get_irn_mode(pred);
- for(i = 0; i < arity; ++i) {
- ir_node *pred = get_irn_n(node, i);
- costs += get_conv_costs(pred, dest_mode);
+ if (smaller_mode(pred_mode, dest_mode)) {
+ return get_conv_costs(get_Conv_op(node), dest_mode) - 1;
}
+ if (may_leave_out_middle_conv(pred_mode, mode, dest_mode)) {
+ return 0;
+ } else {
+ return 1;
+ }
+ }
+
+ if (!is_optimizable_node(node, dest_mode)) {
+ return 1;
+ }
- return costs;
+ costs = 0;
+ // The shift count does not participate in the conv optimisation
+ arity = is_Shl(node) ? 1 : get_irn_arity(node);
+ for (i = 0; i < arity; ++i) {
+ ir_node *pred = get_irn_n(node, i);
+ costs += imin(get_conv_costs(pred, dest_mode), 1);
}
- return 1;
+ return costs;
}
-static
-ir_node *conv_transform(ir_node *node, ir_mode *dest_mode)
+static ir_node *place_conv(ir_node *node, ir_mode *dest_mode)
{
- size_t arity;
- size_t i;
+ ir_node *block = get_nodes_block(node);
+ ir_node *conv = new_r_Conv(block, node, dest_mode);
+ return conv;
+}
- if (get_irn_mode(node) == dest_mode)
+static ir_node *conv_transform(ir_node *node, ir_mode *dest_mode)
+{
+ ir_mode *mode = get_irn_mode(node);
+ ir_graph *irg = get_irn_irg(node);
+ int arity;
+ int conv_arity;
+ int i;
+ ir_node *new_node;
+ ir_node **ins;
+
+ if (mode == dest_mode)
return node;
if (is_Const(node)) {
- tarval *tv = tarval_convert_to(get_Const_tarval(node), dest_mode);
- assert(get_tarval_mode(tv) == dest_mode);
- return new_Const(dest_mode, tv);
+ ir_tarval *tv = conv_const_tv(node, dest_mode);
+ if (tv == tarval_bad) {
+ return place_conv(node, dest_mode);
+ } else {
+ return new_r_Const(irg, tv);
+ }
}
- if (!is_optimizable_node(node) || get_irn_n_edges(node) > 1) {
- ir_node *block = get_nodes_block(node);
- ir_node *conv = new_r_Conv(current_ir_graph, block, node, dest_mode);
- return conv;
+ if (is_Conv(node) &&
+ is_downconv(mode, dest_mode) &&
+ get_irn_mode(get_Conv_op(node)) == dest_mode) {
+ return get_Conv_op(node);
+ }
+
+ if (get_irn_n_edges(node) > 1) {
+ return place_conv(node, dest_mode);
+ }
+
+ if (!is_downconv(mode, dest_mode)) {
+ return place_conv(node, dest_mode);
+ }
+
+ if (is_Conv(node)) {
+ ir_node *pred = get_Conv_op(node);
+ ir_mode *pred_mode = get_irn_mode(pred);
+
+ if (smaller_mode(pred_mode, dest_mode)) {
+ return conv_transform(get_Conv_op(node), dest_mode);
+ }
+ return place_conv(node, dest_mode);
}
- if (is_Conv(node))
- return conv_transform(get_Conv_op(node), dest_mode);
+ if (!is_optimizable_node(node, dest_mode)) {
+ return place_conv(node, dest_mode);
+ }
+ // We want to create a new node with the right mode
arity = get_irn_arity(node);
- for (i = 0; i < arity; i++) {
+ ins = ALLOCAN(ir_node *, arity);
+
+ // The shift count does not participate in the conv optimisation
+ conv_arity = is_Shl(node) ? 1 : arity;
+ for (i = 0; i < conv_arity; i++) {
ir_node *pred = get_irn_n(node, i);
- ir_node *transformed = conv_transform(pred, dest_mode);
- set_irn_n(node, i, transformed);
+ ir_node *transformed;
+ if (get_conv_costs(pred, dest_mode) > 0) {
+ transformed = place_conv(pred, dest_mode);
+ } else {
+ transformed = conv_transform(pred, dest_mode);
+ }
+ ins[i] = transformed;
}
- set_irn_mode(node, dest_mode);
- return node;
-}
-
-static
-int is_downconv(ir_mode *src_mode, ir_mode *dest_mode)
-{
- if(!mode_is_int(src_mode) || !mode_is_int(dest_mode))
- return 0;
- if(get_mode_size_bits(dest_mode) >= get_mode_size_bits(src_mode))
- return 0;
- return 1;
-}
+ for (i = conv_arity; i < arity; i++) {
+ ins[i] = get_irn_n(node, i);
+ }
-/* TODO, backends can't handle and it's probably not more efficient on most
- archs */
-#if 0
-static
-void try_optimize_cmp(ir_node *node)
-{
- ir_node *left = get_Cmp_left(node);
- ir_node *right = get_Cmp_right(node);
- ir_node *conv = NULL;
+ new_node = new_ir_node(get_irn_dbg_info(node),
+ irg,
+ get_nodes_block(node),
+ get_irn_op(node),
+ dest_mode,
+ arity,
+ ins);
+ copy_node_attr(irg, node, new_node);
- if(is_downconv
+ return new_node;
}
-#endif
-static
-void conv_opt_walker(ir_node *node, void *data)
+static void conv_opt_walker(ir_node *node, void *data)
{
ir_node *transformed;
ir_node *pred;
ir_mode *pred_mode;
ir_mode *mode;
int costs;
+ bool *changed = (bool*)data;
-#if 0
- if(is_Cmp(node)) {
- try_optimize_cmp(node);
- return;
- }
-#endif
-
- if(!is_Conv(node))
+ if (!is_Conv(node))
return;
pred = get_Conv_op(node);
mode = get_irn_mode(node);
pred_mode = get_irn_mode(pred);
- if(!is_downconv(pred_mode, mode))
+ if (mode_is_reference(mode) || mode_is_reference(pred_mode))
+ return;
+
+ if (!is_Phi(pred) && !is_downconv(pred_mode, mode))
return;
- costs = get_conv_costs(pred, mode);
+ /* - 1 for the initial conv */
+ costs = get_conv_costs(pred, mode) - 1;
DB((dbg, LEVEL_2, "Costs for %+F -> %+F: %d\n", node, pred, costs));
- if (costs >= 0) return;
+ if (costs > 0)
+ return;
transformed = conv_transform(pred, mode);
- exchange(node, transformed);
+ if (node != transformed) {
+ exchange(node, transformed);
+ *changed = true;
+ }
}
void conv_opt(ir_graph *irg)
{
+ bool global_changed = false;
+ bool changed;
FIRM_DBG_REGISTER(dbg, "firm.opt.conv");
+ assure_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES);
+
DB((dbg, LEVEL_1, "===> Performing conversion optimization on %+F\n", irg));
- edges_assure(irg);
- irg_walk_graph(irg, conv_opt_walker, NULL, NULL);
+ do {
+ changed = false;
+ irg_walk_graph(irg, NULL, conv_opt_walker, &changed);
+ local_optimize_graph(irg);
+ global_changed |= changed;
+ } while (changed);
+
+ confirm_irg_properties(irg,
+ global_changed ? IR_GRAPH_PROPERTIES_NONE : IR_GRAPH_PROPERTIES_ALL);
+}
+
+/* Creates an ir_graph pass for conv_opt. */
+ir_graph_pass_t *conv_opt_pass(const char *name)
+{
+ ir_graph_pass_t *path = def_graph_pass(name ? name : "conv_opt", conv_opt);
+
+ /* safe to run parallel on all irgs */
+ ir_graph_pass_set_parallel(path, 1);
+
+ return path;
}
projects / libfirm / blobdiff