6 * File name: ir/ana/irsimpletype.c
7 * Purpose: Run most simple type analyses.
8 * Author: Goetz Lindenmaier
12 * Copyright: (c) 2003 Universität Karlsruhe
13 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
16 * We compute type information for each node. It is derived from the
17 * types of the origines of values, e.g. parameter types can be derived
18 * from the method type.
19 * The type information so far is saved in the link field.
24 # include "irtypeinfo.h"
25 # include "irsimpletype.h"
27 # include "irnode_t.h"
28 # include "irprog_t.h"
32 #define VERBOSE_UNKNOWN_TYPE(s) printf s
34 static type *phi_cycle_type = NULL;
37 /* ------------ Building and Removing the type information ----------- */
40 /* init type link field so that types point to their pointers. */
41 void precompute_pointer_types(void) {
43 set_type_link(unknown_type, unknown_type);
44 set_type_link(none_type, unknown_type);
45 for (i = 0; i < get_irp_n_types(); ++i)
46 set_type_link(get_irp_type(i), (void *)unknown_type);
47 for (i = get_irp_n_types()-1; i>=0; --i) {
48 type *tp = get_irp_type(i);
49 if (is_pointer_type(tp))
50 set_type_link(get_pointer_points_to_type(tp), (void *)tp);
54 /* Store pointer in link to speed up search of pointer type. */
55 static type *find_pointer_type_to (type *tp) {
56 return (type *)get_type_link(tp);
59 static type* compute_irn_type(ir_node *n);
61 static type *find_type_for_Proj(ir_node *n) {
63 ir_node *pred = skip_Tuple(get_Proj_pred(n));
64 ir_mode *m = get_irn_mode(n);
73 switch (get_irn_opcode(pred)) {
76 /* Deal with Start / Call here: we need to know the Proj Nr. */
77 assert(get_irn_mode(pred) == mode_T);
78 pred_pred = get_Proj_pred(pred);
79 if (get_irn_op(pred_pred) == op_Start) {
80 type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
81 tp = get_method_param_type(mtp, get_Proj_proj(n));
82 } else if (get_irn_op(pred_pred) == op_Call) {
83 type *mtp = get_Call_type(pred_pred);
84 tp = get_method_res_type(mtp, get_Proj_proj(n));
86 VERBOSE_UNKNOWN_TYPE(("Proj %ld from Proj from ??: unknown type\n", get_irn_node_nr(n)));
91 /* globals and frame pointer */
92 if (get_Proj_proj(n) == pn_Start_P_frame_base)
93 tp = find_pointer_type_to(get_irg_frame_type(get_irn_irg(pred)));
94 else if (get_Proj_proj(n) == pn_Start_P_globals)
95 tp = find_pointer_type_to(get_glob_type());
96 else if (get_Proj_proj(n) == pn_Start_P_value_arg_base) {
97 VERBOSE_UNKNOWN_TYPE(("Value arg base proj %ld from Start: unknown type\n", get_irn_node_nr(n)));
98 tp = unknown_type; /* find_pointer_type_to(get....(get_entity_type(get_irg_entity(get_irn_irg(pred))))); */
100 VERBOSE_UNKNOWN_TYPE(("Proj %ld %ld from Start: unknown type\n", get_Proj_proj(n), get_irn_node_nr(n)));
105 /* value args pointer */
106 if (get_Proj_proj(n) == pn_Call_P_value_res_base) {
107 VERBOSE_UNKNOWN_TYPE(("Value res base Proj %ld from Call: unknown type\n", get_irn_node_nr(n)));
108 tp = unknown_type; /* find_pointer_type_to(get....get_Call_type(pred)); */
110 VERBOSE_UNKNOWN_TYPE(("Proj %ld %ld from Call: unknown type\n", get_Proj_proj(n), get_irn_node_nr(n)));
115 tp = compute_irn_type(pred);
121 static type *find_type_for_node(ir_node *n) {
123 type *tp1 = NULL, *tp2 = NULL;
124 ir_node *a = NULL, *b = NULL;
130 tp1 = compute_irn_type(a);
133 a = get_binop_left(n);
134 b = get_binop_right(n);
135 tp1 = compute_irn_type(a);
136 tp2 = compute_irn_type(b);
139 switch(get_irn_opcode(n)) {
142 assert(0 && "op_InstOf not supported");
147 /* Check returned type. */
150 type *meth_type = get_entity_type(get_irg_entity(current_ir_graph));
151 for (i = 0; i < get_method_n_ress(meth_type); i++) {
152 type *res_type = get_method_res_type(meth_type, i);
153 type *ana_res_type = get_irn_type(get_Return_res(n, i));
154 if (ana_res_type == unknown_type) continue;
155 if (res_type != ana_res_type && "return value has wrong type") {
157 assert(res_type == ana_res_type && "return value has wrong type");
179 tp = none_type; break;
181 /* compute the type */
182 case iro_Const: tp = get_Const_type(n); break;
184 tp = unknown_type; break;
186 tp = find_pointer_type_to(get_entity_type(get_Sel_entity(n))); break;
187 /* assymetric binops */
194 tp = get_Cast_type(n); break;
197 int n_preds = get_Phi_n_preds(n);
199 if (n_preds == 0) {tp = none_type; break; }
201 /* initialize this Phi */
202 set_irn_type(n, phi_cycle_type);
204 /* find a first real type */
205 for (i = 0; i < n_preds; ++i) {
206 tp1 = compute_irn_type(get_Phi_pred(n, i));
207 assert(tp1 != initial_type);
208 if ((tp1 != phi_cycle_type) && (tp1 != none_type))
212 /* find a second real type */
214 for (; (i < n_preds); ++i) {
215 tp2 = compute_irn_type(get_Phi_pred(n, i));
216 if ((tp2 == phi_cycle_type) || (tp2 == none_type)) {
220 if (tp2 != tp1) break;
223 /* printf("Types in Phi %s and %s \n", get_type_name(tp1), get_type_name(tp2)); */
225 if (tp1 == tp2) { tp = tp1; break; }
227 VERBOSE_UNKNOWN_TYPE(("Phi %ld with two different types: %s, %s: unknown type.\n", get_irn_node_nr(n),
228 get_type_name(tp1), get_type_name(tp2)));
232 ir_node *a = get_Load_ptr(n);
233 if (get_irn_op(a) == op_Sel)
234 tp = get_entity_type(get_Sel_entity(a));
235 else if (is_pointer_type(compute_irn_type(a))) {
236 tp = get_pointer_points_to_type(get_irn_type(a));
237 if (is_array_type(tp)) tp = get_array_element_type(tp);
239 VERBOSE_UNKNOWN_TYPE(("Load %ld with typeless address. result: unknown type\n", get_irn_node_nr(n)));
244 tp = find_pointer_type_to(get_Alloc_type(n)); break;
246 tp = find_type_for_Proj(n); break;
248 tp = compute_irn_type(get_Id_pred(n)); break;
250 tp = unknown_type; break;
252 assert(0 && "Filter not implemented"); break;
254 /* catch special cases with fallthrough to binop/unop cases in default. */
256 if (mode_is_int(get_irn_mode(n)) &&
257 mode_is_reference(get_irn_mode(a)) &&
258 mode_is_reference(get_irn_mode(b)) ) {
259 VERBOSE_UNKNOWN_TYPE(("Sub %ld ptr - ptr = int: unknown type\n", get_irn_node_nr(n)));
260 tp = unknown_type; break;
262 } /* fall through to Add. */
264 if (mode_is_reference(get_irn_mode(n)) &&
265 mode_is_reference(get_irn_mode(a)) &&
266 mode_is_int(get_irn_mode(b)) ) {
269 if (mode_is_reference(get_irn_mode(n)) &&
270 mode_is_int(get_irn_mode(a)) &&
271 mode_is_reference(get_irn_mode(b)) ) {
277 if (get_irn_mode(n) != get_irn_mode(a)) {
278 VERBOSE_UNKNOWN_TYPE(("Mul %ld int1 * int1 = int2: unknown type\n", get_irn_node_nr(n)));
279 tp = unknown_type; break;
288 /* Is is proper to walk past a Conv??? */
298 if((tp1 == phi_cycle_type) || (tp2 == phi_cycle_type)) {
302 VERBOSE_UNKNOWN_TYPE(("Binop %ld with two different types: %s, %s: unknown type \n", get_irn_node_nr(n),
303 get_type_name(tp1), get_type_name(tp2)));
308 printf(" not implemented: "); DDMN(n);
309 } break; /* default */
312 /* printf (" found %s ", get_type_name(tp)); DDM; */
318 static type* compute_irn_type(ir_node *n) {
321 type *tp = get_irn_type(n);
323 if ((tp == initial_type)) {
324 tp = find_type_for_node(n);
328 /* printf (" found %s ", get_type_name(tp)); DDM; */
333 static void compute_type(ir_node *n, void *env) {
335 type *tp = get_irn_type(n);
336 if (tp == phi_cycle_type) {
337 /* printf(" recomputing for phi_cycle_type "); DDMN(n); */
338 set_irn_type(n, initial_type);
344 static void analyse_irg (ir_graph *irg) {
345 set_irg_typeinfo_state(irg, irg_typeinfo_consistent);
346 irg_walk_graph(irg, NULL, compute_type, NULL);
349 static void init_irsimpletype(void) {
352 phi_cycle_type = new_type_class(new_id_from_str("phi_cycle_type"));
353 precompute_pointer_types();
356 void simple_analyse_types(void) {
359 for (i = 0; i < get_irp_n_irgs(); i++) {
360 current_ir_graph = get_irp_irg(i);
361 analyse_irg(current_ir_graph);
365 void free_simple_type_information(void) {
368 if (phi_cycle_type) {
369 free_type(phi_cycle_type);
370 phi_cycle_type = NULL;