/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
}
if (get_irn_n_edges(node) > 1) {
- if (is_Conv(node) && is_downconv(get_irn_mode(node), dest_mode)) {
- return get_conv_costs(get_Conv_op(node), dest_mode) - 1;
- }
DB((dbg, LEVEL_3, "multi outs at %+F\n", node));
return 1;
}
}
costs = 0;
- arity = get_irn_arity(node);
+ // 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);
}
if (get_irn_n_edges(node) > 1) {
- if (is_Conv(node) && is_downconv(get_irn_mode(node), dest_mode)) {
- return conv_transform(get_Conv_op(node), dest_mode);
- }
return place_conv(node, dest_mode);
}
return place_conv(node, dest_mode);
}
- arity = get_irn_arity(node);
+ // 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);
ir_node *transformed;