X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Firsimpletype.c;h=003bba93376abdbaaf4a8596387c80561b256976;hb=7e151013a3aada6ad9f5861153423b2207377fd1;hp=a8546ed9a390f3180ea3ee36cf27913c2c96cd09;hpb=493a2be714558086f03e0e2d17285e039c83a011;p=libfirm diff --git a/ir/ana/irsimpletype.c b/ir/ana/irsimpletype.c index a8546ed9a..003bba933 100644 --- a/ir/ana/irsimpletype.c +++ b/ir/ana/irsimpletype.c @@ -1,8 +1,4 @@ -/** - * - * @file irsimpeltype.c - * - * Project: libFIRM +/* * File name: ir/ana/irsimpletype.c * Purpose: Run most simple type analyses. * Author: Goetz Lindenmaier @@ -11,106 +7,148 @@ * CVS-ID: $Id$ * Copyright: (c) 2003 Universität Karlsruhe * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + */ + +/** + * @file irsimpletype.c * + * Runs most simple type analyses. * * We compute type information for each node. It is derived from the * types of the origines of values, e.g. parameter types can be derived * from the method type. * The type information so far is saved in the link field. * + * @author Goetz Lindenmaier */ - # include "irtypeinfo.h" # include "irsimpletype.h" # include "irnode_t.h" -# include "irprog.h" +# include "irprog_t.h" # include "irgwalk.h" # include "ident.h" +# include "trouts.h" #define VERBOSE_UNKNOWN_TYPE(s) printf s -static type *phi_cycle_type = NULL; +static ir_type *phi_cycle_type = NULL; /* ------------ Building and Removing the type information ----------- */ -/* init type link field so that types point to their pointers. */ -void precompute_pointer_types(void) { +/** + * init type link field so that types point to their pointers. + */ +static void precompute_pointer_types(void) { +#if 0 int i; - set_type_link(unknown_type, unknown_type); - set_type_link(none_type, unknown_type); - for (i = 0; i < get_irp_n_types(); ++i) - set_type_link(get_irp_type(i), (void *)unknown_type); - for (i = get_irp_n_types()-1; i>=0; --i) { - type *tp = get_irp_type(i); - if (is_pointer_type(tp)) + set_type_link(firm_unknown_type, firm_unknown_type); + set_type_link(firm_none_type, firm_unknown_type); + + for (i = get_irp_n_types() - 1; i >= 0; --i) + set_type_link(get_irp_type(i), (void *)firm_unknown_type); + + for (i = get_irp_n_types() - 1; i >= 0; --i) { + ir_type *tp = get_irp_type(i); + if (is_Pointer_type(tp)) set_type_link(get_pointer_points_to_type(tp), (void *)tp); } +#else + compute_trouts(); +#endif } -/* Store pointer in link to speed up search of pointer type. */ -static type *find_pointer_type_to (type *tp) { - return (type *)get_type_link(tp); +/** + * Returns a pointer to type which was stored in the link field + * to speed up search. + */ +static ir_type *find_pointer_type_to (ir_type *tp) { +#if 0 + return (ir_type *)get_type_link(tp); +#else + if (get_type_n_pointertypes_to(tp) > 0) + return get_type_pointertype_to(tp, 0); + else + return firm_unknown_type; +#endif } -static type* compute_irn_type(ir_node *n); +static ir_type *compute_irn_type(ir_node *n); -static type *find_type_for_Proj(ir_node *n) { - type *tp; +/** + * Try to determine a type for a Proj node. + * If a type cannot be determined, return @p firm_none_type. + */ +static ir_type *find_type_for_Proj(ir_node *n) { + ir_type *tp; + + /* Avoid nested Tuples. */ ir_node *pred = skip_Tuple(get_Proj_pred(n)); - ir_mode *m = intern_get_irn_mode(n); + ir_mode *m = get_irn_mode(n); if (m == mode_T || m == mode_BB || m == mode_X || m == mode_M || m == mode_b ) - return none_type; + return firm_none_type; - switch(intern_get_irn_opcode(pred)) { + switch (get_irn_opcode(pred)) { case iro_Proj: { ir_node *pred_pred; /* Deal with Start / Call here: we need to know the Proj Nr. */ assert(get_irn_mode(pred) == mode_T); pred_pred = get_Proj_pred(pred); - if (intern_get_irn_op(pred_pred) == op_Start) { - type *mtp = get_entity_type(get_irg_ent(get_Start_irg(pred_pred))); + if (get_irn_op(pred_pred) == op_Start) { + ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred))); tp = get_method_param_type(mtp, get_Proj_proj(n)); - } else if (intern_get_irn_op(pred_pred) == op_Call) { - type *mtp = get_Call_type(pred_pred); + } else if (get_irn_op(pred_pred) == op_Call) { + ir_type *mtp = get_Call_type(pred_pred); tp = get_method_res_type(mtp, get_Proj_proj(n)); + } else if (get_irn_op(pred_pred) == op_Tuple) { + assert(0 && "Encountered nested Tuple"); } else { VERBOSE_UNKNOWN_TYPE(("Proj %ld from Proj from ??: unknown type\n", get_irn_node_nr(n))); - tp = unknown_type; + tp = firm_unknown_type; } } break; case iro_Start: { - /* globals and frame pointer */ - if (get_Proj_proj(n) == pns_frame_base) - tp = find_pointer_type_to(get_irg_frame_type(get_Start_irg(pred))); - else if (get_Proj_proj(n) == pns_globals) + /* frame pointer, globals and tls */ + switch (get_Proj_proj(n)) { + case pn_Start_P_frame_base: + tp = find_pointer_type_to(get_irg_frame_type(get_irn_irg(pred))); + break; + case pn_Start_P_globals: tp = find_pointer_type_to(get_glob_type()); - else if (get_Proj_proj(n) == pns_value_arg_base) { + break; + case pn_Start_P_tls: + tp = find_pointer_type_to(get_tls_type()); + break; + case pn_Start_P_value_arg_base: VERBOSE_UNKNOWN_TYPE(("Value arg base proj %ld from Start: unknown type\n", get_irn_node_nr(n))); - tp = unknown_type; /* find_pointer_type_to(get....(get_entity_type(get_irg_ent(get_Start_irg(pred))))); */ - } else { + tp = firm_unknown_type; /* find_pointer_type_to(get....(get_entity_type(get_irg_entity(get_irn_irg(pred))))); */ + break; + default: VERBOSE_UNKNOWN_TYPE(("Proj %ld %ld from Start: unknown type\n", get_Proj_proj(n), get_irn_node_nr(n))); - tp = unknown_type; + tp = firm_unknown_type; } } break; case iro_Call: { /* value args pointer */ - if (get_Proj_proj(n) == pncl_value_res_base) { + if (get_Proj_proj(n) == pn_Call_P_value_res_base) { VERBOSE_UNKNOWN_TYPE(("Value res base Proj %ld from Call: unknown type\n", get_irn_node_nr(n))); - tp = unknown_type; /* find_pointer_type_to(get....get_Call_type(pred)); */ + tp = firm_unknown_type; /* find_pointer_type_to(get....get_Call_type(pred)); */ } else { VERBOSE_UNKNOWN_TYPE(("Proj %ld %ld from Call: unknown type\n", get_Proj_proj(n), get_irn_node_nr(n))); - tp = unknown_type; + tp = firm_unknown_type; } } break; + case iro_Tuple: { + tp = compute_irn_type(get_Tuple_pred(pred, get_Proj_proj(n))); + } break; default: tp = compute_irn_type(pred); } @@ -118,9 +156,13 @@ static type *find_type_for_Proj(ir_node *n) { return tp; } -static type *find_type_for_node(ir_node *n) { - type *tp = NULL; - type *tp1 = NULL, *tp2 = NULL; +/** + * Try to determine the type of a node. + * If a type cannot be determined, return @p firm_none_type. + */ +static ir_type *find_type_for_node(ir_node *n) { + ir_type *tp = firm_unknown_type; + ir_type *tp1 = NULL, *tp2 = NULL; ir_node *a = NULL, *b = NULL; /* DDMN(n); */ @@ -136,7 +178,7 @@ static type *find_type_for_node(ir_node *n) { tp2 = compute_irn_type(b); } - switch(intern_get_irn_opcode(n)) { + switch (get_irn_opcode(n)) { case iro_InstOf: { assert(0 && "op_InstOf not supported"); @@ -147,14 +189,14 @@ static type *find_type_for_node(ir_node *n) { /* Check returned type. */ /* int i; - type *meth_type = get_entity_type(get_irg_ent(current_ir_graph)); + ir_type *meth_type = get_entity_type(get_irg_entity(current_ir_graph)); for (i = 0; i < get_method_n_ress(meth_type); i++) { - type *res_type = get_method_res_type(meth_type, i); - type *ana_res_type = get_irn_type(get_Return_res(n, i)); - if (ana_res_type == unknown_type) continue; + ir_type *res_type = get_method_res_type(meth_type, i); + ir_type *ana_res_type = get_irn_type(get_Return_res(n, i)); + if (ana_res_type == firm_unknown_type) continue; if (res_type != ana_res_type && "return value has wrong type") { - DDMN(n); - assert(res_type == ana_res_type && "return value has wrong type"); + DDMN(n); + assert(res_type == ana_res_type && "return value has wrong type"); } } */ @@ -172,19 +214,20 @@ static type *find_type_for_node(ir_node *n) { case iro_Sync: case iro_Tuple: case iro_Bad: + case iro_NoMem: case iro_Break: case iro_CallBegin: case iro_EndReg: case iro_EndExcept: - tp = none_type; break; + break; /* compute the type */ case iro_Const: tp = get_Const_type(n); break; case iro_SymConst: - tp = unknown_type; break; + tp = get_SymConst_value_type(n); break; case iro_Sel: tp = find_pointer_type_to(get_entity_type(get_Sel_entity(n))); break; - /* assymetric binops */ + /* asymmetric binops */ case iro_Shl: case iro_Shr: case iro_Shrs: @@ -196,26 +239,27 @@ static type *find_type_for_node(ir_node *n) { int i; int n_preds = get_Phi_n_preds(n); - if (n_preds == 0) {tp = none_type; break; } + if (n_preds == 0) + break; /* initialize this Phi */ - set_irn_type(n, phi_cycle_type); + set_irn_typeinfo_type(n, phi_cycle_type); /* find a first real type */ for (i = 0; i < n_preds; ++i) { tp1 = compute_irn_type(get_Phi_pred(n, i)); assert(tp1 != initial_type); - if ((tp1 != phi_cycle_type) && (tp1 != none_type)) - break; + if ((tp1 != phi_cycle_type) && (tp1 != firm_none_type)) + break; } /* find a second real type */ tp2 = tp1; for (; (i < n_preds); ++i) { tp2 = compute_irn_type(get_Phi_pred(n, i)); - if ((tp2 == phi_cycle_type) || (tp2 == none_type)) { - tp2 = tp1; - continue; + if ((tp2 == phi_cycle_type) || (tp2 == firm_none_type)) { + tp2 = tp1; + continue; } if (tp2 != tp1) break; } @@ -224,23 +268,22 @@ static type *find_type_for_node(ir_node *n) { if (tp1 == tp2) { tp = tp1; break; } - VERBOSE_UNKNOWN_TYPE(("Phi %ld with two different types: %s, %s: unknown type.\n", get_irn_node_nr(n), - get_type_name(tp1), get_type_name(tp2))); - tp = unknown_type; + if (get_firm_verbosity() > 55) { // Do not commit 55! should be 1. + VERBOSE_UNKNOWN_TYPE(("Phi %ld with two different types: %s, %s: unknown type.\n", get_irn_node_nr(n), + get_type_name(tp1), get_type_name(tp2))); + } + tp = firm_unknown_type; /* Test for supertypes? */ } break; case iro_Load: { ir_node *a = get_Load_ptr(n); - if (intern_get_irn_op(a) == op_Sel) + if (is_Sel(a)) tp = get_entity_type(get_Sel_entity(a)); - else if ((intern_get_irn_op(a) == op_Const) && - (tarval_is_entity(get_Const_tarval(a)))) - tp = get_entity_type(tarval_to_entity(get_Const_tarval(a))); - else if (is_pointer_type(compute_irn_type(a))) { - tp = get_pointer_points_to_type(get_irn_type(a)); - if (is_array_type(tp)) tp = get_array_element_type(tp); + else if (is_Pointer_type(compute_irn_type(a))) { + tp = get_pointer_points_to_type(get_irn_typeinfo_type(a)); + if (is_Array_type(tp)) + tp = get_array_element_type(tp); } else { VERBOSE_UNKNOWN_TYPE(("Load %ld with typeless address. result: unknown type\n", get_irn_node_nr(n))); - tp = unknown_type; } } break; case iro_Alloc: @@ -250,61 +293,93 @@ static type *find_type_for_node(ir_node *n) { case iro_Id: tp = compute_irn_type(get_Id_pred(n)); break; case iro_Unknown: - tp = unknown_type; break; + tp = firm_unknown_type; break; case iro_Filter: assert(0 && "Filter not implemented"); break; /* catch special cases with fallthrough to binop/unop cases in default. */ case iro_Sub: { - if (mode_is_int(intern_get_irn_mode(n)) && - mode_is_reference(intern_get_irn_mode(a)) && - mode_is_reference(intern_get_irn_mode(b)) ) { + if (mode_is_int(get_irn_mode(n)) && + mode_is_reference(get_irn_mode(a)) && + mode_is_reference(get_irn_mode(b)) ) { VERBOSE_UNKNOWN_TYPE(("Sub %ld ptr - ptr = int: unknown type\n", get_irn_node_nr(n))); - tp = unknown_type; break; + tp = firm_unknown_type; break; } } /* fall through to Add. */ case iro_Add: { - if (mode_is_reference(intern_get_irn_mode(n)) && - mode_is_reference(intern_get_irn_mode(a)) && - mode_is_int(intern_get_irn_mode(b)) ) { + if (mode_is_reference(get_irn_mode(n)) && + mode_is_reference(get_irn_mode(a)) && + mode_is_int(get_irn_mode(b)) ) { tp = tp1; break; } - if (mode_is_reference(intern_get_irn_mode(n)) && - mode_is_int(intern_get_irn_mode(a)) && - mode_is_reference(intern_get_irn_mode(b)) ) { + if (mode_is_reference(get_irn_mode(n)) && + mode_is_int(get_irn_mode(a)) && + mode_is_reference(get_irn_mode(b)) ) { tp = tp2; break; } goto default_code; } break; case iro_Mul: { - if (intern_get_irn_mode(n) != intern_get_irn_mode(a)) { + if (get_irn_mode(n) != get_irn_mode(a)) { VERBOSE_UNKNOWN_TYPE(("Mul %ld int1 * int1 = int2: unknown type\n", get_irn_node_nr(n))); - tp = unknown_type; break; + tp = firm_unknown_type; break; } goto default_code; } break; + case iro_Mux: { + a = get_Mux_true(n); + b = get_Mux_false(n); + tp1 = compute_irn_type(a); + tp2 = compute_irn_type(b); + if (tp1 == tp2) + tp = tp1; + } break; + case iro_Psi: { + int i, n_conds = get_Psi_n_conds(n); + tp1 = compute_irn_type(get_Psi_default(n)); + + for (i = 0; i < n_conds; ++i) { + tp2 = compute_irn_type(get_Psi_val(n, i)); + if (tp2 != tp1) + break; + } + if (tp1 == tp2) + tp = tp1; + } break; + case iro_Bound: + tp = compute_irn_type(get_Bound_index(n)); + break; + case iro_Confirm: + tp = compute_irn_type(get_Confirm_value(n)); + break; + case iro_Conv: + /* Conv is a unop, but changing the mode implies + changing the type. */ + break; default: - default_code: { +default_code: { if (is_unop(n)) { - /* Is is proper to walk past a Conv??? */ + /* It's not proper to walk past a Conv, so this case is handled above. */ tp = tp1; break; } if (is_binop(n)) { if (tp1 == tp2) { - tp = tp1; - break; + tp = tp1; + break; } if((tp1 == phi_cycle_type) || (tp2 == phi_cycle_type)) { - tp = phi_cycle_type; - break; + tp = phi_cycle_type; + break; } - VERBOSE_UNKNOWN_TYPE(("Binop %ld with two different types: %s, %s: unknown type \n", get_irn_node_nr(n), - get_type_name(tp1), get_type_name(tp2))); - tp = unknown_type; + if (get_firm_verbosity() > 55) { + VERBOSE_UNKNOWN_TYPE(("Binop %ld with two different types: %s, %s: unknown type \n", get_irn_node_nr(n), + get_type_name(tp1), get_type_name(tp2))); + } + tp = firm_unknown_type; break; } @@ -317,15 +392,13 @@ static type *find_type_for_node(ir_node *n) { return tp; } +/** Compute the type of an IR node. */ +static ir_type *compute_irn_type(ir_node *n) { + ir_type *tp = get_irn_typeinfo_type(n); -static type* compute_irn_type(ir_node *n) { - /* DDMN(n); */ - - type *tp = get_irn_type(n); - - if ((tp == initial_type)) { + if (tp == initial_type) { tp = find_type_for_node(n); - set_irn_type(n, tp); + set_irn_typeinfo_type(n, tp); } /* printf (" found %s ", get_type_name(tp)); DDM; */ @@ -333,22 +406,34 @@ static type* compute_irn_type(ir_node *n) { return tp; } +/** + * Post-Walker: computes the type for every node + * and store it into a map. + * Post-walking ensures that the types for all predecessor + * nodes are already computed. + */ static void compute_type(ir_node *n, void *env) { - type *tp = get_irn_type(n); + ir_type *tp = get_irn_typeinfo_type(n); if (tp == phi_cycle_type) { /* printf(" recomputing for phi_cycle_type "); DDMN(n); */ - set_irn_type(n, initial_type); + set_irn_typeinfo_type(n, initial_type); } - compute_irn_type(n); } +/** + * Compute the types for all nodes of a graph. + */ static void analyse_irg (ir_graph *irg) { - set_irg_typeinfo_state(irg, irg_typeinfo_consistent); + set_irg_typeinfo_state(irg, ir_typeinfo_consistent); irg_walk_graph(irg, NULL, compute_type, NULL); } +/** + * Initialize the analysis by creating a phi_cycle_type and + * computing pointer types for all class and struct types. + */ static void init_irsimpletype(void) { init_irtypeinfo(); if (!phi_cycle_type) @@ -356,13 +441,15 @@ static void init_irsimpletype(void) { precompute_pointer_types(); } +/* Computes type information for each node in all ir graphs. */ void simple_analyse_types(void) { int i; init_irsimpletype(); for (i = 0; i < get_irp_n_irgs(); i++) { - current_ir_graph = get_irp_irg(i); - analyse_irg(current_ir_graph); + ir_graph *irg = get_irp_irg(i); + analyse_irg(irg); } + set_irp_typeinfo_state(ir_typeinfo_consistent); } void free_simple_type_information(void) { @@ -372,4 +459,5 @@ void free_simple_type_information(void) { free_type(phi_cycle_type); phi_cycle_type = NULL; } + set_irp_typeinfo_state(ir_typeinfo_none); }