/**
- *
- * @file irsimpeltype.h
+ * @file tropt.c
*
* Project: libFIRM
- * File name: ir/opt/tropt.h
+ * File name: ir/opt/tropt.c
* Purpose: Optimize the type representation.
* Author: Goetz Lindenmaier
* Modified by:
* Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*
* Perform optimizations of the type representation.
- *
- *
*/
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include <assert.h>
+#ifdef HAVE_ALLOCA_H
#include <alloca.h>
+#endif
+#ifdef HAVE_MALLOC_H
+#include <malloc.h>
+#endif
#include "tropt.h"
#include "trouts.h"
#include "ircons.h"
#include "irgmod.h"
-#include "irflag.h"
+#include "irflag_t.h"
/* - statistics ---------------------------------------------- */
static ident *ptr_type_suffix = NULL;
static gen_pointer_type_to_func gen_pointer_type_to = default_gen_pointer_type_to;
+/**
+ * Find a pointer type to a given type.
+ * Uses and updates trouts if available.
+ */
static type *default_gen_pointer_type_to(type *tp) {
type *res = NULL;
if (get_trouts_state() == outs_consistent) {
if (get_type_n_pointertypes_to(tp) > 0) {
res = get_type_pointertype_to(tp, 0);
} else {
- res = new_type_pointer(mangle_u(get_type_ident(tp), ptr_type_suffix), tp);
- /* Update trout for pointertypes, so we can use it in next call. */
+ ir_mode *mode = is_Method_type(tp) ? mode_P_code : mode_P_data;
+
+ res = new_type_pointer(mangle_u(get_type_ident(tp), ptr_type_suffix), tp, mode);
+ /* Update trout for pointer types, so we can use it in next call. */
add_type_pointertype_to(tp, res);
}
- } else {
+ }
+ else {
res = find_pointer_type_to_type(tp);
if (res == firm_unknown_type)
- res = new_type_pointer(mangle_u(get_type_ident(tp), ptr_type_suffix), tp);
+ res = new_type_pointer(mangle_u(get_type_ident(tp), ptr_type_suffix), tp, mode_P_data);
}
return res;
}
-/* Return a type that is a depth times pointer to type. */
+/** Return a type that is a depth times pointer to type. */
static type *pointerize_type(type *tp, int depth) {
for (; depth > 0; --depth) {
tp = gen_pointer_type_to(tp);
return tp;
}
-static void normalize_irn_class_cast(ir_node *n, void *env) {
- if (get_irn_op(n) != op_Cast) return;
-
- type *fromtype = get_irn_typeinfo_type(get_Cast_op(n));
- type *totype = get_Cast_type(n);
+static ir_node *normalize_values_type(type *totype, ir_node *pred) {
+ type *fromtype = get_irn_typeinfo_type(pred);
+ ir_node *new_cast = pred;
int ref_depth = 0;
- if (totype == fromtype) return; /* Case for optimization! */
+ if (totype == fromtype) return pred; /* Case for optimization! */
while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
totype = get_pointer_points_to_type(totype);
ref_depth++;
}
- if (!is_Class_type(totype)) return;
- if (!is_Class_type(fromtype)) return;
+ if (!is_Class_type(totype)) return pred;
+ if (!is_Class_type(fromtype)) return pred;
if ((get_class_supertype_index(totype, fromtype) != -1) ||
(get_class_supertype_index(fromtype, totype) != -1) ) {
/* It's just what we want ... */
- return;
+ return pred;
}
- set_cur_block(get_nodes_block(n));
+ set_cur_block(get_nodes_block(pred));
- if (is_subclass_of(totype, fromtype)) {
+ if (is_SubClass_of(totype, fromtype)) {
/* downcast */
while (get_class_subtype_index(fromtype, totype) == -1) {
/* Insert a cast to a subtype of fromtype. */
ir_node *new_cast;
int i, n_subtypes = get_class_n_subtypes(fromtype);
for (i = 0; i < n_subtypes && !new_type; ++i) {
- type *new_sub = get_class_subtype(fromtype, i);
- if (is_superclass_of(new_sub, totype))
- new_type = new_sub;
+ type *new_sub = get_class_subtype(fromtype, i);
+ if (is_SuperClass_of(new_sub, totype))
+ new_type = new_sub;
}
assert(new_type);
fromtype = new_type;
new_type = pointerize_type(new_type, ref_depth);
- new_cast = new_Cast(get_Cast_op(n), new_type);
+ new_cast = new_Cast(pred, new_type);
+ pred = new_cast;
n_casts_normalized ++;
set_irn_typeinfo_type(new_cast, new_type); /* keep type information up to date. */
- set_Cast_op(n, new_cast);
if (get_trouts_state() != outs_none) add_type_cast(new_type, new_cast);
}
}
else {
- assert(is_superclass_of(totype, fromtype));
+ assert(is_SuperClass_of(totype, fromtype));
/* upcast */
while (get_class_supertype_index(fromtype, totype) == -1) {
/* Insert a cast to a supertype of fromtype. */
type *new_type = NULL;
- ir_node *new_cast;
int i, n_supertypes = get_class_n_supertypes(fromtype);
for (i = 0; i < n_supertypes && !new_type; ++i) {
type *new_super = get_class_supertype(fromtype, i);
- if (is_subclass_of(new_super, totype))
+ if (is_SubClass_of(new_super, totype))
new_type = new_super;
}
assert(new_type);
fromtype = new_type;
new_type = pointerize_type(new_type, ref_depth);
- new_cast = new_Cast(get_Cast_op(n), new_type);
+ new_cast = new_Cast(pred, new_type);
+ pred = new_cast;
n_casts_normalized ++;
set_irn_typeinfo_type(new_cast, new_type); /* keep type information up to date. */
if (get_trouts_state() != outs_none) add_type_cast(new_type, new_cast);
- set_Cast_op(n, new_cast);
+ }
+ }
+ return new_cast;
+}
+
+
+static void normalize_irn_class_cast(ir_node *n, void *env) {
+ ir_node *res;
+ if (get_irn_op(n) == op_Cast) {
+ ir_node *pred = get_Cast_op(n);
+ type *totype = get_Cast_type(n);
+ res = normalize_values_type(totype, pred);
+ set_Cast_op(n, res);
+ } else if (get_irn_op(n) == op_Call) {
+ int i, n_params = get_Call_n_params(n);
+ type *tp = get_Call_type(n);
+ for (i = 0; i < n_params; ++i) {
+ res = normalize_values_type(get_method_param_type(tp, i), get_Call_param(n, i));
+ set_Call_param(n, i, res);
}
}
}
/* - Cast optimization. ------------------------------------------- */
+/**
+ * Optimizes Casts:
+ *
+ * (T1)(T2)x<T1> -> x<T1>
+ *
+ * (T3)(T2)x<T1> -> (T3)x<T1>
+ *
+ * if possible.
+ */
static void cancel_out_casts(ir_node *cast) {
ir_node *orig, *pred = get_Cast_op(cast);
type *tp_cast, *tp_pred, *tp_orig;
if (!is_Class_type(tp_pred)) return;
if (!is_Class_type(tp_orig)) return;
- if (is_subclass_of(tp_pred, tp_cast) && get_opt_suppress_downcast_optimization())
+ if (is_SubClass_of(tp_pred, tp_cast) && get_opt_suppress_downcast_optimization())
return;
if (tp_cast == tp_orig) {
return;
}
- if (!(is_subclass_of (tp_cast, tp_orig) || is_subclass_of (tp_orig, tp_cast)))
- /* Avoid (B2)(A)(new B1()) --> (B2)(new B1()) */
+ if (!(is_SubClass_of (tp_cast, tp_orig) || is_SubClass_of (tp_orig, tp_cast))) {
+ /* Avoid (B2)(A)(new B1()) --> (B2)(new B1())
+ * if B1 =!> B2 and B2 =!> B1
+ */
return;
+ }
- if ((is_subclass_of (tp_cast, tp_pred) && is_superclass_of(tp_pred, tp_orig)) ||
- (is_superclass_of(tp_cast, tp_pred) && is_subclass_of (tp_pred, tp_orig)) ) {
+ if ((is_SubClass_of (tp_cast, tp_pred) && is_SuperClass_of(tp_pred, tp_orig)) ||
+ (is_SuperClass_of(tp_cast, tp_pred) && is_SubClass_of (tp_pred, tp_orig)) ) {
+ /* Cast --> Pred --> Orig */
set_Cast_op (cast, orig);
n_casts_removed ++;
}
if (!is_Class_type(orig_tp)) return;
if (!is_Class_type(cast_tp)) return;
- /* We only want to contretize, but not generalize. */
- if (!is_superclass_of(cast_tp, orig_tp)) return;
+ /* We only want to concretize, but not generalize. */
+ if (!is_SuperClass_of(cast_tp, orig_tp)) return;
/* Hmm, we are not properly typed. */
if (get_class_member_index(cast_tp, sel_ent) == -1) return;
n_casts_removed ++;
}
+/**
+ * Post-Walker:
+ */
static void irn_optimize_class_cast(ir_node *n, void *env) {
if (get_irn_op(n) == op_Cast)
cancel_out_casts(n);