2 * File name: ir/ana/irsimpletype.c
3 * Purpose: Run most simple type analyses.
4 * Author: Goetz Lindenmaier
8 * Copyright: (c) 2003 Universität Karlsruhe
9 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
13 * @file irsimpletype.c
15 * Runs most simple type analyses.
17 * We compute type information for each node. It is derived from the
18 * types of the origines of values, e.g. parameter types can be derived
19 * from the method type.
20 * The type information so far is saved in the link field.
22 * @author Goetz Lindenmaier
25 # include "irtypeinfo.h"
26 # include "irsimpletype.h"
28 # include "irnode_t.h"
29 # include "irprog_t.h"
34 #define VERBOSE_UNKNOWN_TYPE(s) printf s
36 static ir_type *phi_cycle_type = NULL;
39 /* ------------ Building and Removing the type information ----------- */
43 * init type link field so that types point to their pointers.
45 static void precompute_pointer_types(void) {
48 set_type_link(firm_unknown_type, firm_unknown_type);
49 set_type_link(firm_none_type, firm_unknown_type);
51 for (i = get_irp_n_types() - 1; i >= 0; --i)
52 set_type_link(get_irp_type(i), (void *)firm_unknown_type);
54 for (i = get_irp_n_types() - 1; i >= 0; --i) {
55 ir_type *tp = get_irp_type(i);
56 if (is_Pointer_type(tp))
57 set_type_link(get_pointer_points_to_type(tp), (void *)tp);
65 * Returns a pointer to type which was stored in the link field
68 static ir_type *find_pointer_type_to (ir_type *tp) {
70 return (ir_type *)get_type_link(tp);
72 if (get_type_n_pointertypes_to(tp) > 0)
73 return get_type_pointertype_to(tp, 0);
75 return firm_unknown_type;
79 static ir_type *compute_irn_type(ir_node *n);
82 * Try to determine a type for a Proj node.
83 * If a type cannot be determined, return @p firm_none_type.
85 static ir_type *find_type_for_Proj(ir_node *n) {
88 /* Avoid nested Tuples. */
89 ir_node *pred = skip_Tuple(get_Proj_pred(n));
90 ir_mode *m = get_irn_mode(n);
97 return firm_none_type;
99 switch (get_irn_opcode(pred)) {
102 /* Deal with Start / Call here: we need to know the Proj Nr. */
103 assert(get_irn_mode(pred) == mode_T);
104 pred_pred = get_Proj_pred(pred);
105 if (get_irn_op(pred_pred) == op_Start) {
106 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
107 tp = get_method_param_type(mtp, get_Proj_proj(n));
108 } else if (get_irn_op(pred_pred) == op_Call) {
109 ir_type *mtp = get_Call_type(pred_pred);
110 tp = get_method_res_type(mtp, get_Proj_proj(n));
111 } else if (get_irn_op(pred_pred) == op_Tuple) {
112 assert(0 && "Encountered nested Tuple");
114 VERBOSE_UNKNOWN_TYPE(("Proj %ld from Proj from ??: unknown type\n", get_irn_node_nr(n)));
115 tp = firm_unknown_type;
119 /* frame pointer, globals and tls */
120 switch (get_Proj_proj(n)) {
121 case pn_Start_P_frame_base:
122 tp = find_pointer_type_to(get_irg_frame_type(get_irn_irg(pred)));
124 case pn_Start_P_globals:
125 tp = find_pointer_type_to(get_glob_type());
128 tp = find_pointer_type_to(get_tls_type());
130 case pn_Start_P_value_arg_base:
131 VERBOSE_UNKNOWN_TYPE(("Value arg base proj %ld from Start: unknown type\n", get_irn_node_nr(n)));
132 tp = firm_unknown_type; /* find_pointer_type_to(get....(get_entity_type(get_irg_entity(get_irn_irg(pred))))); */
135 VERBOSE_UNKNOWN_TYPE(("Proj %ld %ld from Start: unknown type\n", get_Proj_proj(n), get_irn_node_nr(n)));
136 tp = firm_unknown_type;
140 /* value args pointer */
141 if (get_Proj_proj(n) == pn_Call_P_value_res_base) {
142 VERBOSE_UNKNOWN_TYPE(("Value res base Proj %ld from Call: unknown type\n", get_irn_node_nr(n)));
143 tp = firm_unknown_type; /* find_pointer_type_to(get....get_Call_type(pred)); */
145 VERBOSE_UNKNOWN_TYPE(("Proj %ld %ld from Call: unknown type\n", get_Proj_proj(n), get_irn_node_nr(n)));
146 tp = firm_unknown_type;
150 tp = compute_irn_type(get_Tuple_pred(pred, get_Proj_proj(n)));
153 tp = compute_irn_type(pred);
160 * Try to determine the type of a node.
161 * If a type cannot be determined, return @p firm_none_type.
163 static ir_type *find_type_for_node(ir_node *n) {
164 ir_type *tp = firm_unknown_type;
165 ir_type *tp1 = NULL, *tp2 = NULL;
166 ir_node *a = NULL, *b = NULL;
172 tp1 = compute_irn_type(a);
175 a = get_binop_left(n);
176 b = get_binop_right(n);
177 tp1 = compute_irn_type(a);
178 tp2 = compute_irn_type(b);
181 switch (get_irn_opcode(n)) {
184 assert(0 && "op_InstOf not supported");
189 /* Check returned type. */
192 ir_type *meth_type = get_entity_type(get_irg_entity(current_ir_graph));
193 for (i = 0; i < get_method_n_ress(meth_type); i++) {
194 ir_type *res_type = get_method_res_type(meth_type, i);
195 ir_type *ana_res_type = get_irn_type(get_Return_res(n, i));
196 if (ana_res_type == firm_unknown_type) continue;
197 if (res_type != ana_res_type && "return value has wrong type") {
199 assert(res_type == ana_res_type && "return value has wrong type");
224 /* compute the type */
225 case iro_Const: tp = get_Const_type(n); break;
227 tp = get_SymConst_value_type(n); break;
229 tp = find_pointer_type_to(get_entity_type(get_Sel_entity(n))); break;
230 /* asymmetric binops */
237 tp = get_Cast_type(n); break;
240 int n_preds = get_Phi_n_preds(n);
245 /* initialize this Phi */
246 set_irn_typeinfo_type(n, phi_cycle_type);
248 /* find a first real type */
249 for (i = 0; i < n_preds; ++i) {
250 tp1 = compute_irn_type(get_Phi_pred(n, i));
251 assert(tp1 != initial_type);
252 if ((tp1 != phi_cycle_type) && (tp1 != firm_none_type))
256 /* find a second real type */
258 for (; (i < n_preds); ++i) {
259 tp2 = compute_irn_type(get_Phi_pred(n, i));
260 if ((tp2 == phi_cycle_type) || (tp2 == firm_none_type)) {
264 if (tp2 != tp1) break;
267 /* printf("Types in Phi %s and %s \n", get_type_name(tp1), get_type_name(tp2)); */
269 if (tp1 == tp2) { tp = tp1; break; }
271 if (get_firm_verbosity() > 55) { // Do not commit 55! should be 1.
272 VERBOSE_UNKNOWN_TYPE(("Phi %ld with two different types: %s, %s: unknown type.\n", get_irn_node_nr(n),
273 get_type_name(tp1), get_type_name(tp2)));
275 tp = firm_unknown_type; /* Test for supertypes? */
278 ir_node *a = get_Load_ptr(n);
280 tp = get_entity_type(get_Sel_entity(a));
281 else if (is_Pointer_type(compute_irn_type(a))) {
282 tp = get_pointer_points_to_type(get_irn_typeinfo_type(a));
283 if (is_Array_type(tp))
284 tp = get_array_element_type(tp);
286 VERBOSE_UNKNOWN_TYPE(("Load %ld with typeless address. result: unknown type\n", get_irn_node_nr(n)));
290 tp = find_pointer_type_to(get_Alloc_type(n)); break;
292 tp = find_type_for_Proj(n); break;
294 tp = compute_irn_type(get_Id_pred(n)); break;
296 tp = firm_unknown_type; break;
298 assert(0 && "Filter not implemented"); break;
300 /* catch special cases with fallthrough to binop/unop cases in default. */
302 if (mode_is_int(get_irn_mode(n)) &&
303 mode_is_reference(get_irn_mode(a)) &&
304 mode_is_reference(get_irn_mode(b)) ) {
305 VERBOSE_UNKNOWN_TYPE(("Sub %ld ptr - ptr = int: unknown type\n", get_irn_node_nr(n)));
306 tp = firm_unknown_type; break;
308 } /* fall through to Add. */
310 if (mode_is_reference(get_irn_mode(n)) &&
311 mode_is_reference(get_irn_mode(a)) &&
312 mode_is_int(get_irn_mode(b)) ) {
315 if (mode_is_reference(get_irn_mode(n)) &&
316 mode_is_int(get_irn_mode(a)) &&
317 mode_is_reference(get_irn_mode(b)) ) {
323 if (get_irn_mode(n) != get_irn_mode(a)) {
324 VERBOSE_UNKNOWN_TYPE(("Mul %ld int1 * int1 = int2: unknown type\n", get_irn_node_nr(n)));
325 tp = firm_unknown_type; break;
331 b = get_Mux_false(n);
332 tp1 = compute_irn_type(a);
333 tp2 = compute_irn_type(b);
338 int i, n_conds = get_Psi_n_conds(n);
339 tp1 = compute_irn_type(get_Psi_default(n));
341 for (i = 0; i < n_conds; ++i) {
342 tp2 = compute_irn_type(get_Psi_val(n, i));
350 tp = compute_irn_type(get_Bound_index(n));
353 tp = compute_irn_type(get_Confirm_value(n));
356 /* Conv is a unop, but changing the mode implies
357 changing the type. */
364 /* It's not proper to walk past a Conv, so this case is handled above. */
374 if((tp1 == phi_cycle_type) || (tp2 == phi_cycle_type)) {
378 if (get_firm_verbosity() > 55) {
379 VERBOSE_UNKNOWN_TYPE(("Binop %ld with two different types: %s, %s: unknown type \n", get_irn_node_nr(n),
380 get_type_name(tp1), get_type_name(tp2)));
382 tp = firm_unknown_type;
386 printf(" not implemented: "); DDMN(n);
387 } break; /* default */
390 /* printf (" found %s ", get_type_name(tp)); DDM; */
395 /** Compute the type of an IR node. */
396 static ir_type *compute_irn_type(ir_node *n) {
397 ir_type *tp = get_irn_typeinfo_type(n);
399 if (tp == initial_type) {
400 tp = find_type_for_node(n);
401 set_irn_typeinfo_type(n, tp);
404 /* printf (" found %s ", get_type_name(tp)); DDM; */
410 * Post-Walker: computes the type for every node
411 * and store it into a map.
412 * Post-walking ensures that the types for all predecessor
413 * nodes are already computed.
415 static void compute_type(ir_node *n, void *env) {
417 ir_type *tp = get_irn_typeinfo_type(n);
418 if (tp == phi_cycle_type) {
419 /* printf(" recomputing for phi_cycle_type "); DDMN(n); */
420 set_irn_typeinfo_type(n, initial_type);
426 * Compute the types for all nodes of a graph.
428 static void analyse_irg (ir_graph *irg) {
429 set_irg_typeinfo_state(irg, ir_typeinfo_consistent);
430 irg_walk_graph(irg, NULL, compute_type, NULL);
434 * Initialize the analysis by creating a phi_cycle_type and
435 * computing pointer types for all class and struct types.
437 static void init_irsimpletype(void) {
440 phi_cycle_type = new_type_class(new_id_from_str("phi_cycle_type"));
441 precompute_pointer_types();
444 /* Computes type information for each node in all ir graphs. */
445 void simple_analyse_types(void) {
448 for (i = 0; i < get_irp_n_irgs(); i++) {
449 ir_graph *irg = get_irp_irg(i);
452 set_irp_typeinfo_state(ir_typeinfo_consistent);
455 void free_simple_type_information(void) {
458 if (phi_cycle_type) {
459 free_type(phi_cycle_type);
460 phi_cycle_type = NULL;
462 set_irp_typeinfo_state(ir_typeinfo_none);