2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Run most simple type analyses.
23 * @author Goetz Lindenmaier
27 * Runs most simple type analyses.
29 * We compute type information for each node. It is derived from the
30 * types of the origines of values, e.g. parameter types can be derived
31 * from the method type.
32 * The type information so far is saved in the link field.
36 #include "irtypeinfo.h"
37 #include "irsimpletype.h"
47 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL);
49 static ir_type *phi_cycle_type = NULL;
52 /* ------------ Building and Removing the type information ----------- */
56 * init type link field so that types point to their pointers.
58 static void precompute_pointer_types(void) {
61 set_type_link(firm_unknown_type, firm_unknown_type);
62 set_type_link(firm_none_type, firm_unknown_type);
64 for (i = get_irp_n_types() - 1; i >= 0; --i)
65 set_type_link(get_irp_type(i), (void *)firm_unknown_type);
67 for (i = get_irp_n_types() - 1; i >= 0; --i) {
68 ir_type *tp = get_irp_type(i);
69 if (is_Pointer_type(tp))
70 set_type_link(get_pointer_points_to_type(tp), (void *)tp);
78 * Returns a pointer to type which was stored in the link field
81 static ir_type *find_pointer_type_to (ir_type *tp) {
83 return (ir_type *)get_type_link(tp);
85 if (get_type_n_pointertypes_to(tp) > 0)
86 return get_type_pointertype_to(tp, 0);
88 return firm_unknown_type;
92 static ir_type *compute_irn_type(ir_node *n);
95 * Try to determine a type for a Proj node.
96 * If a type cannot be determined, return @p firm_none_type.
98 static ir_type *find_type_for_Proj(ir_node *n) {
101 /* Avoid nested Tuples. */
102 ir_node *pred = skip_Tuple(get_Proj_pred(n));
103 ir_mode *m = get_irn_mode(n);
110 return firm_none_type;
112 switch (get_irn_opcode(pred)) {
115 /* Deal with Start / Call here: we need to know the Proj Nr. */
116 assert(get_irn_mode(pred) == mode_T);
117 pred_pred = get_Proj_pred(pred);
118 if (is_Start(pred_pred)) {
119 ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred)));
120 tp = get_method_param_type(mtp, get_Proj_proj(n));
121 } else if (is_Call(pred_pred)) {
122 ir_type *mtp = get_Call_type(pred_pred);
123 tp = get_method_res_type(mtp, get_Proj_proj(n));
124 } else if (is_Tuple(pred_pred)) {
125 panic("Encountered nested Tuple");
127 DB((dbg, SET_LEVEL_1, "Proj %ld from Proj from ??: unknown type\n", get_irn_node_nr(n)));
128 tp = firm_unknown_type;
133 /* frame pointer, globals and tls */
134 switch (get_Proj_proj(n)) {
135 case pn_Start_P_frame_base:
136 tp = find_pointer_type_to(get_irg_frame_type(get_irn_irg(pred)));
139 tp = find_pointer_type_to(get_tls_type());
141 case pn_Start_P_value_arg_base:
142 DB((dbg, SET_LEVEL_1, "Value arg base proj %ld from Start: unknown type\n", get_irn_node_nr(n)));
143 tp = firm_unknown_type; /* find_pointer_type_to(get....(get_entity_type(get_irg_entity(get_irn_irg(pred))))); */
146 DB((dbg, SET_LEVEL_1, "Proj %ld %ld from Start: unknown type\n", get_Proj_proj(n), get_irn_node_nr(n)));
147 tp = firm_unknown_type;
151 /* value args pointer */
152 if (get_Proj_proj(n) == pn_Call_P_value_res_base) {
153 DB((dbg, SET_LEVEL_1, "Value res base Proj %ld from Call: unknown type\n", get_irn_node_nr(n)));
154 tp = firm_unknown_type; /* find_pointer_type_to(get....get_Call_type(pred)); */
156 DB((dbg, SET_LEVEL_1, "Proj %ld %ld from Call: unknown type\n", get_Proj_proj(n), get_irn_node_nr(n)));
157 tp = firm_unknown_type;
161 tp = compute_irn_type(get_Tuple_pred(pred, get_Proj_proj(n)));
164 tp = compute_irn_type(pred);
171 * Try to determine the type of a node.
172 * If a type cannot be determined, return @p firm_none_type.
174 static ir_type *find_type_for_node(ir_node *n) {
175 ir_type *tp = firm_unknown_type;
176 ir_type *tp1 = NULL, *tp2 = NULL;
177 ir_node *a = NULL, *b = NULL;
181 tp1 = compute_irn_type(a);
184 a = get_binop_left(n);
185 b = get_binop_right(n);
186 tp1 = compute_irn_type(a);
187 tp2 = compute_irn_type(b);
190 switch (get_irn_opcode(n)) {
193 assert(0 && "op_InstOf not supported");
198 /* Check returned type. */
201 ir_type *meth_type = get_entity_type(get_irg_entity(current_ir_graph));
202 for (i = 0; i < get_method_n_ress(meth_type); i++) {
203 ir_type *res_type = get_method_res_type(meth_type, i);
204 ir_type *ana_res_type = get_irn_type(get_Return_res(n, i));
205 if (ana_res_type == firm_unknown_type) continue;
206 if (res_type != ana_res_type && "return value has wrong type") {
208 assert(res_type == ana_res_type && "return value has wrong type");
233 /* compute the type */
235 tp = get_Const_type(n);
238 tp = get_SymConst_value_type(n);
241 tp = find_pointer_type_to(get_entity_type(get_Sel_entity(n)));
244 /* asymmetric binops */
252 tp = get_Cast_type(n);
256 int n_preds = get_Phi_n_preds(n);
261 /* initialize this Phi */
262 set_irn_typeinfo_type(n, phi_cycle_type);
264 /* find a first real type */
265 for (i = 0; i < n_preds; ++i) {
266 tp1 = compute_irn_type(get_Phi_pred(n, i));
267 assert(tp1 != initial_type);
268 if ((tp1 != phi_cycle_type) && (tp1 != firm_none_type))
272 /* find a second real type */
274 for (; (i < n_preds); ++i) {
275 tp2 = compute_irn_type(get_Phi_pred(n, i));
276 if ((tp2 == phi_cycle_type) || (tp2 == firm_none_type)) {
280 if (tp2 != tp1) break;
283 /* printf("Types in Phi %s and %s \n", get_type_name(tp1), get_type_name(tp2)); */
285 if (tp1 == tp2) { tp = tp1; break; }
287 DB((dbg, SET_LEVEL_2, "Phi %ld with two different types: %s, %s: unknown type.\n", get_irn_node_nr(n),
288 get_type_name(tp1), get_type_name(tp2)));
289 tp = firm_unknown_type; /* Test for supertypes? */
294 ir_node *a = get_Load_ptr(n);
296 tp = get_entity_type(get_Sel_entity(a));
297 else if (is_Pointer_type(compute_irn_type(a))) {
298 tp = get_pointer_points_to_type(get_irn_typeinfo_type(a));
299 if (is_Array_type(tp))
300 tp = get_array_element_type(tp);
302 DB((dbg, SET_LEVEL_1, "Load %ld with typeless address. result: unknown type\n", get_irn_node_nr(n)));
307 tp = find_pointer_type_to(get_Alloc_type(n));
310 tp = find_type_for_Proj(n);
313 tp = compute_irn_type(get_Id_pred(n));
316 tp = firm_unknown_type;
319 assert(0 && "Filter not implemented");
322 /* catch special cases with fallthrough to binop/unop cases in default. */
324 if (mode_is_int(get_irn_mode(n)) &&
325 mode_is_reference(get_irn_mode(a)) &&
326 mode_is_reference(get_irn_mode(b)) ) {
327 DB((dbg, SET_LEVEL_1, "Sub %ld ptr - ptr = int: unknown type\n", get_irn_node_nr(n)));
328 tp = firm_unknown_type; break;
330 /* fall through to Add. */
332 if (mode_is_reference(get_irn_mode(n)) &&
333 mode_is_reference(get_irn_mode(a)) &&
334 mode_is_int(get_irn_mode(b)) ) {
337 if (mode_is_reference(get_irn_mode(n)) &&
338 mode_is_int(get_irn_mode(a)) &&
339 mode_is_reference(get_irn_mode(b)) ) {
345 if (get_irn_mode(n) != get_irn_mode(a)) {
346 DB((dbg, SET_LEVEL_1, "Mul %ld int1 * int1 = int2: unknown type\n", get_irn_node_nr(n)));
347 tp = firm_unknown_type; break;
353 b = get_Mux_false(n);
354 tp1 = compute_irn_type(a);
355 tp2 = compute_irn_type(b);
361 tp = compute_irn_type(get_Bound_index(n));
364 tp = compute_irn_type(get_Confirm_value(n));
367 /* Conv is a unop, but changing the mode implies
368 changing the type. */
374 /* It's not proper to walk past a Conv, so this case is handled above. */
384 if ((tp1 == phi_cycle_type) || (tp2 == phi_cycle_type)) {
388 DB((dbg, SET_LEVEL_2, "Binop %ld with two different types: %s, %s: unknown type \n", get_irn_node_nr(n),
389 get_type_name(tp1), get_type_name(tp2)));
390 tp = firm_unknown_type;
394 panic(" not implemented: %+F", n);
401 /** Compute the type of an IR node. */
402 static ir_type *compute_irn_type(ir_node *n) {
403 ir_type *tp = get_irn_typeinfo_type(n);
405 if (tp == initial_type) {
406 tp = find_type_for_node(n);
407 set_irn_typeinfo_type(n, tp);
413 * Post-Walker: computes the type for every node
414 * and store it into a map.
415 * Post-walking ensures that the types for all predecessor
416 * nodes are already computed.
418 static void compute_type(ir_node *n, void *env) {
419 ir_type *tp = get_irn_typeinfo_type(n);
421 if (tp == phi_cycle_type) {
422 /* printf(" recomputing for phi_cycle_type "); DDMN(n); */
423 set_irn_typeinfo_type(n, initial_type);
429 * Compute the types for all nodes of a graph.
431 static void analyse_irg (ir_graph *irg) {
432 set_irg_typeinfo_state(irg, ir_typeinfo_consistent);
433 irg_walk_graph(irg, NULL, compute_type, NULL);
437 * Initialize the analysis by creating a phi_cycle_type and
438 * computing pointer types for all class and struct types.
440 static void init_irsimpletype(void) {
443 phi_cycle_type = new_type_class(new_id_from_str("phi_cycle_type"));
444 precompute_pointer_types();
447 /* Computes type information for each node in all ir graphs. */
448 void simple_analyse_types(void) {
450 FIRM_DBG_REGISTER(dbg, "firm.ana.simpletype");
453 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
454 ir_graph *irg = get_irp_irg(i);
457 set_irp_typeinfo_state(ir_typeinfo_consistent);
460 void free_simple_type_information(void) {
463 if (phi_cycle_type) {
464 free_type(phi_cycle_type);
465 phi_cycle_type = NULL;
467 set_irp_typeinfo_state(ir_typeinfo_none);