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 Lower some High-level constructs, moved from the firmlower.
23 * @author Boris Boesler, Goetz Lindenmaier, Michael Beck
41 * Lower a Sel node. Do not touch Sels accessing entities on the frame type.
43 static void lower_sel(ir_node *sel)
45 ir_graph *irg = get_irn_irg(sel);
46 ir_entity *ent = get_Sel_entity(sel);
47 ir_type *owner = get_entity_owner(ent);
48 dbg_info *dbg = get_irn_dbg_info(sel);
49 ir_mode *mode = get_irn_mode(sel);
50 ir_node *bl = get_nodes_block(sel);
53 /* we can only replace Sels when the layout of the owner type is decided. */
54 if (get_type_state(owner) != layout_fixed)
57 if (0 < get_Sel_n_indexs(sel)) {
59 ir_type *basetyp = get_entity_type(ent);
62 if (is_Primitive_type(basetyp))
63 basemode = get_type_mode(basetyp);
65 basemode = mode_P_data;
67 assert(basemode && "no mode for lowering Sel");
68 assert((get_mode_size_bits(basemode) % 8 == 0) && "can not deal with unorthodox modes");
69 index = get_Sel_index(sel, 0);
71 if (is_Array_type(owner)) {
72 ir_type *arr_ty = owner;
73 size_t dims = get_array_n_dimensions(arr_ty);
74 size_t *map = ALLOCAN(size_t, dims);
75 ir_mode *mode_Int = get_reference_mode_signed_eq(mode);
80 assert(dims == (size_t)get_Sel_n_indexs(sel)
81 && "array dimension must match number of indices of Sel node");
83 for (i = 0; i < dims; i++) {
84 size_t order = get_array_order(arr_ty, i);
86 assert(order < dims &&
87 "order of a dimension must be smaller than the arrays dim");
90 newn = get_Sel_ptr(sel);
92 /* Size of the array element */
93 tv = new_tarval_from_long(get_type_size_bytes(basetyp), mode_Int);
94 last_size = new_rd_Const(dbg, irg, tv);
97 * We compute the offset part of dimension d_i recursively
98 * with the the offset part of dimension d_{i-1}
100 * off_0 = sizeof(array_element_type);
101 * off_i = (u_i - l_i) * off_{i-1} ; i >= 1
103 * whereas u_i is the upper bound of the current dimension
104 * and l_i the lower bound of the current dimension.
106 for (i = dims; i > 0;) {
107 size_t dim = map[--i];
108 ir_node *lb, *ub, *elms, *n, *ind;
111 lb = get_array_lower_bound(arr_ty, dim);
112 ub = get_array_upper_bound(arr_ty, dim);
114 if (! is_Unknown(lb))
115 lb = new_rd_Conv(dbg, bl, copy_const_value(get_irn_dbg_info(sel), lb, bl), mode_Int);
119 if (! is_Unknown(ub))
120 ub = new_rd_Conv(dbg, bl, copy_const_value(get_irn_dbg_info(sel), ub, bl), mode_Int);
125 * If the array has more than one dimension, lower and upper
126 * bounds have to be set in the non-last dimension.
129 assert(lb != NULL && "lower bound has to be set in multi-dim array");
130 assert(ub != NULL && "upper bound has to be set in multi-dim array");
132 /* Elements in one Dimension */
133 elms = new_rd_Sub(dbg, bl, ub, lb, mode_Int);
136 ind = new_rd_Conv(dbg, bl, get_Sel_index(sel, dim), mode_Int);
139 * Normalize index, id lower bound is set, also assume
143 ind = new_rd_Sub(dbg, bl, ind, lb, mode_Int);
145 n = new_rd_Mul(dbg, bl, ind, last_size, mode_Int);
151 last_size = new_rd_Mul(dbg, bl, last_size, elms, mode_Int);
153 newn = new_rd_Add(dbg, bl, newn, n, mode);
157 ir_mode *idx_mode = get_irn_mode(index);
158 ir_tarval *tv = new_tarval_from_long(get_mode_size_bytes(basemode), idx_mode);
160 newn = new_rd_Add(dbg, bl, get_Sel_ptr(sel),
161 new_rd_Mul(dbg, bl, index,
162 new_r_Const(irg, tv),
166 } else if (is_Method_type(get_entity_type(ent)) && is_Class_type(owner)) {
167 /* We need an additional load when accessing methods from a dispatch
169 * Matze TODO: Is this really still used? At least liboo does its own
170 * lowering of Method-Sels...
172 ir_mode *ent_mode = get_type_mode(get_entity_type(ent));
173 int offset = get_entity_offset(ent);
174 ir_mode *mode_Int = get_reference_mode_signed_eq(mode);
175 ir_tarval *tv = new_tarval_from_long(offset, mode_Int);
176 ir_node *cnst = new_rd_Const(dbg, irg, tv);
177 ir_node *add = new_rd_Add(dbg, bl, get_Sel_ptr(sel), cnst, mode);
178 ir_node *mem = get_Sel_mem(sel);
179 newn = new_rd_Load(dbg, bl, mem, add, ent_mode, cons_none);
180 newn = new_r_Proj(newn, ent_mode, pn_Load_res);
182 int offset = get_entity_offset(ent);
184 /* replace Sel by add(obj, const(ent.offset)) */
185 newn = get_Sel_ptr(sel);
187 ir_mode *mode_UInt = get_reference_mode_unsigned_eq(mode);
188 ir_tarval *tv = new_tarval_from_long(offset, mode_UInt);
189 ir_node *cnst = new_r_Const(irg, tv);
190 newn = new_rd_Add(dbg, bl, newn, cnst, mode);
201 * Lower a all possible SymConst nodes.
203 static void lower_symconst(ir_node *symc)
213 switch (get_SymConst_kind(symc)) {
214 case symconst_type_size:
215 /* rewrite the SymConst node by a Const node */
216 irg = get_irn_irg(symc);
217 tp = get_SymConst_type(symc);
218 assert(get_type_state(tp) == layout_fixed);
219 mode = get_irn_mode(symc);
220 newn = new_r_Const_long(irg, mode, get_type_size_bytes(tp));
224 exchange(symc, newn);
226 case symconst_type_align:
227 /* rewrite the SymConst node by a Const node */
228 irg = get_irn_irg(symc);
229 tp = get_SymConst_type(symc);
230 assert(get_type_state(tp) == layout_fixed);
231 mode = get_irn_mode(symc);
232 newn = new_r_Const_long(irg, mode, get_type_alignment_bytes(tp));
236 exchange(symc, newn);
238 case symconst_addr_ent:
241 case symconst_ofs_ent:
242 /* rewrite the SymConst node by a Const node */
243 irg = get_irn_irg(symc);
244 ent = get_SymConst_entity(symc);
245 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
246 mode = get_irn_mode(symc);
247 newn = new_r_Const_long(irg, mode, get_entity_offset(ent));
251 exchange(symc, newn);
253 case symconst_enum_const:
254 /* rewrite the SymConst node by a Const node */
255 irg = get_irn_irg(symc);
256 ec = get_SymConst_enum(symc);
257 assert(get_type_state(get_enumeration_owner(ec)) == layout_fixed);
258 tv = get_enumeration_value(ec);
259 newn = new_r_Const(irg, tv);
263 exchange(symc, newn);
267 assert(!"unknown SymConst kind");
273 * lowers IR-nodes, called from walker
275 static void lower_irnode(ir_node *irn, void *env)
278 switch (get_irn_opcode(irn)) {
286 exchange(irn, get_Cast_op(irn));
294 * Replaces SymConsts by a real constant if possible.
295 * Replace Sel nodes by address computation. Also resolves array access.
296 * Handle Bitfields by added And/Or calculations.
298 void lower_highlevel_graph(ir_graph *irg)
300 /* Finally: lower SymConst-Size and Sel nodes, Casts, unaligned Load/Stores. */
301 irg_walk_graph(irg, NULL, lower_irnode, NULL);
304 typedef struct pass_t {
305 ir_graph_pass_t pass;
309 * Wrapper for running lower_highlevel_graph() as an ir_graph pass.
311 static int lower_highlevel_graph_wrapper(ir_graph *irg, void *context)
315 lower_highlevel_graph(irg);
319 ir_graph_pass_t *lower_highlevel_graph_pass(const char *name)
321 pass_t *pass = XMALLOCZ(pass_t);
323 return def_graph_pass_constructor(
324 &pass->pass, name ? name : "lower_hl", lower_highlevel_graph_wrapper);
328 * does the same as lower_highlevel() for all nodes on the const code irg
330 void lower_const_code(void)
332 walk_const_code(NULL, lower_irnode, NULL);
335 ir_prog_pass_t *lower_const_code_pass(const char *name)
337 return def_prog_pass(name ? name : "lower_const_code", lower_const_code);
341 * Replaces SymConsts by a real constant if possible.
342 * Replace Sel nodes by address computation. Also resolves array access.
343 * Handle Bitfields by added And/Or calculations.
345 void lower_highlevel()
349 n = get_irp_n_irgs();
350 for (i = 0; i < n; ++i) {
351 ir_graph *irg = get_irp_irg(i);
352 lower_highlevel_graph(irg);