DEBUG_ONLY(static firm_dbg_module_t *dbg);
-static INLINE int imin(int a, int b) { return a < b ? a : b; }
+static inline int imin(int a, int b) { return a < b ? a : b; }
static
int is_optimizable_node(const ir_node *node)
return 1;
}
- if (is_Conv(node) && is_downconv(mode, dest_mode)) {
- return get_conv_costs(get_Conv_op(node), dest_mode) - 1;
- }
-
#if 0 // TODO
/* Take the minimum of the conversion costs for Phi predecessors as only one
* branch is actually executed at a time */
}
#endif
- if (!mode_is_int(mode) || !is_optimizable_node(node)) {
+ if (!is_downconv(mode, dest_mode)) {
+ return 1;
+ }
+
+ if (is_Conv(node)) {
+ return get_conv_costs(get_Conv_op(node), dest_mode) - 1;
+ }
+
+ if (!is_optimizable_node(node)) {
return 1;
}
if (tv == tarval_bad) {
return place_conv(node, dest_mode);
} else {
- return new_Const(dest_mode, tv);
+ return new_Const(tv);
}
}
return place_conv(node, dest_mode);
}
- if (is_Conv(node) && is_downconv(mode, dest_mode)) {
+ if (!is_downconv(mode, dest_mode)) {
+ return place_conv(node, dest_mode);
+ }
+
+ if (is_Conv(node)) {
return conv_transform(get_Conv_op(node), dest_mode);
}
- if (!mode_is_int(mode) || !is_optimizable_node(node)) {
+ if (!is_optimizable_node(node)) {
return place_conv(node, dest_mode);
}