2 * Copyright (C) 1995-2007 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 lowering of Calls of intrinsic functions
23 * @author Michael Beck
44 /** Walker environment */
45 typedef struct _walker_env {
46 pmap *c_map; /**< The intrinsic call map. */
47 unsigned nr_of_intrinsics; /**< statistics */
48 i_instr_record **i_map; /**< The intrinsic instruction map. */
52 * walker: call all mapper functions
54 static void call_mapper(ir_node *node, void *env) {
55 walker_env_t *wenv = env;
56 ir_op *op = get_irn_op(node);
61 const i_call_record *r;
64 symconst = get_Call_ptr(node);
65 if (get_irn_op(symconst) != op_SymConst ||
66 get_SymConst_kind(symconst) != symconst_addr_ent)
69 ent = get_SymConst_entity(symconst);
70 p = pmap_find(wenv->c_map, ent);
74 wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
77 if (op->code < (unsigned) ARR_LEN(wenv->i_map)) {
78 const i_instr_record *r = wenv->i_map[op->code];
79 /* run all possible mapper */
81 if (r->i_mapper(node, r->ctx)) {
82 ++wenv->nr_of_intrinsics;
91 /* Go through all graphs and map calls to intrinsic functions. */
92 unsigned lower_intrinsics(i_record *list, int length, int part_block_used) {
93 int i, n_ops = get_irp_n_opcodes();
95 pmap *c_map = pmap_create_ex(length);
96 i_instr_record **i_map;
97 unsigned nr_of_intrinsics = 0;
100 /* we use the ir_op generic pointers here */
101 NEW_ARR_A(const i_instr_record *, i_map, n_ops);
102 memset((void *)i_map, 0, sizeof(*i_map) * n_ops);
104 /* fill a map for faster search */
105 for (i = length - 1; i >= 0; --i) {
106 if (list[i].i_call.kind == INTRINSIC_CALL) {
107 pmap_insert(c_map, list[i].i_call.i_ent, (void *)&list[i].i_call);
109 ir_op *op = list[i].i_instr.op;
110 assert(op->code < (unsigned) ARR_LEN(i_map));
112 list[i].i_instr.link = i_map[op->code];
113 i_map[op->code] = &list[i].i_instr;
120 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
121 irg = get_irp_irg(i);
124 collect_phiprojs(irg);
126 wenv.nr_of_intrinsics = 0;
127 irg_walk_graph(irg, NULL, call_mapper, &wenv);
129 if (wenv.nr_of_intrinsics) {
130 /* changes detected */
131 set_irg_outs_inconsistent(irg);
132 set_irg_callee_info_state(irg, irg_callee_info_inconsistent);
134 /* exception control flow might have changed */
135 set_irg_doms_inconsistent(irg);
136 set_irg_extblk_inconsistent(irg);
137 set_irg_loopinfo_inconsistent(irg);
139 /* calls might be removed/added */
140 set_trouts_inconsistent();
142 /* optimize it, tuple might be created */
143 local_optimize_graph(irg);
145 nr_of_intrinsics += wenv.nr_of_intrinsics;
150 return nr_of_intrinsics;
153 /* A mapper for the integer abs. */
154 int i_mapper_Abs(ir_node *call, void *ctx) {
155 ir_node *mem = get_Call_mem(call);
156 ir_node *block = get_nodes_block(call);
157 ir_node *op = get_Call_param(call, 0);
159 dbg_info *dbg = get_irn_dbg_info(call);
162 irn = new_rd_Abs(dbg, current_ir_graph, block, op, get_irn_mode(op));
163 irn = new_Tuple(1, &irn);
165 turn_into_tuple(call, pn_Call_max);
166 set_Tuple_pred(call, pn_Call_M_regular, mem);
167 set_Tuple_pred(call, pn_Call_X_regular, new_r_Jmp(current_ir_graph, block));
168 set_Tuple_pred(call, pn_Call_X_except, new_Bad());
169 set_Tuple_pred(call, pn_Call_T_result, irn);
170 set_Tuple_pred(call, pn_Call_M_except, mem);
171 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
176 /* A mapper for the alloca() function. */
177 int i_mapper_Alloca(ir_node *call, void *ctx) {
178 ir_node *mem = get_Call_mem(call);
179 ir_node *block = get_nodes_block(call);
180 ir_node *op = get_Call_param(call, 0);
181 ir_node *irn, *exc, *no_exc;
182 dbg_info *dbg = get_irn_dbg_info(call);
185 irn = new_rd_Alloc(dbg, current_ir_graph, block, mem, op, firm_unknown_type, stack_alloc);
186 mem = new_Proj(irn, mode_M, pn_Alloc_M);
187 no_exc = new_Proj(irn, mode_X, pn_Alloc_X_regular);
188 exc = new_Proj(irn, mode_X, pn_Alloc_X_except);
189 irn = new_Proj(irn, get_modeP_data(), pn_Alloc_res);
190 irn = new_Tuple(1, &irn);
192 turn_into_tuple(call, pn_Call_max);
193 set_Tuple_pred(call, pn_Call_M_regular, mem);
194 set_Tuple_pred(call, pn_Call_X_regular, no_exc);
195 set_Tuple_pred(call, pn_Call_X_except, exc);
196 set_Tuple_pred(call, pn_Call_T_result, irn);
197 set_Tuple_pred(call, pn_Call_M_except, mem);
198 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
203 /* A mapper for the floating point sqrt. */
204 int i_mapper_Sqrt(ir_node *call, void *ctx) {
206 ir_node *irn, *mem, *block;
208 ir_node *op = get_Call_param(call, 0);
214 tv = get_Const_tarval(op);
215 if (! tarval_is_null(tv) && !tarval_is_one(tv))
218 mem = get_Call_mem(call);
219 block = get_nodes_block(call);
220 dbg = get_irn_dbg_info(call);
222 /* sqrt(0) = 0, sqrt(1) = 1 */
224 irn = new_Tuple(1, &irn);
226 turn_into_tuple(call, pn_Call_max);
227 set_Tuple_pred(call, pn_Call_M_regular, mem);
228 set_Tuple_pred(call, pn_Call_X_regular, new_r_Jmp(current_ir_graph, block));
229 set_Tuple_pred(call, pn_Call_X_except, new_Bad());
230 set_Tuple_pred(call, pn_Call_T_result, irn);
231 set_Tuple_pred(call, pn_Call_M_except, mem);
232 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
237 /* A mapper for the floating point pow. */
238 int i_mapper_Pow(ir_node *call, void *ctx) {
241 ir_node *left = get_Call_param(call, 0);
242 ir_node *right = get_Call_param(call, 1);
243 ir_node *block = get_nodes_block(call);
244 ir_node *irn, *reg_jmp, *exc_jmp;
247 if (is_Const(left) && is_Const_one(left)) {
248 /* pow (1.0, x) = 1.0 */
250 } else if (is_Const(right)) {
251 tarval *tv = get_Const_tarval(right);
252 if (tarval_is_null(tv)) {
253 /* pow(x, 0.0) = 1.0 */
254 ir_mode *mode = get_tarval_mode(tv);
255 irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
256 } else if (tarval_is_one(tv)) {
257 /* pow(x, 1.0) = x */
259 } else if (tarval_is_minus_one(tv)) {
260 /* pow(x, -1.0) = 1/x */
266 mem = get_Call_mem(call);
267 dbg = get_irn_dbg_info(call);
270 ir_mode *mode = get_irn_mode(left);
273 irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
274 quot = new_rd_Quot(dbg, current_ir_graph, block, mem, irn, left, mode, op_pin_state_pinned);
275 mem = new_r_Proj(current_ir_graph, block, quot, mode_M, pn_Quot_M);
276 irn = new_r_Proj(current_ir_graph, block, quot, mode, pn_Quot_res);
277 reg_jmp = new_r_Proj(current_ir_graph, block, quot, mode_X, pn_Quot_X_regular);
278 exc_jmp = new_r_Proj(current_ir_graph, block, quot, mode_X, pn_Quot_X_except);
280 /* Beware: do we need here a protection against CSE? Better we do it. */
281 int old_cse = get_opt_cse();
283 reg_jmp = new_r_Jmp(current_ir_graph, block);
284 set_opt_cse(old_cse);
287 irn = new_Tuple(1, &irn);
289 turn_into_tuple(call, pn_Call_max);
290 set_Tuple_pred(call, pn_Call_M_regular, mem);
291 set_Tuple_pred(call, pn_Call_X_regular, reg_jmp);
292 set_Tuple_pred(call, pn_Call_X_except, exc_jmp);
293 set_Tuple_pred(call, pn_Call_T_result, irn);
294 set_Tuple_pred(call, pn_Call_M_except, mem);
295 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
301 * Returns the result mode of a node.
303 static ir_mode *get_irn_res_mode(ir_node *node) {
304 switch (get_irn_opcode(node)) {
305 case iro_Load: return get_Load_mode(node);
306 case iro_Quot: return get_Quot_resmode(node);
307 case iro_Div: return get_Div_resmode(node);
308 case iro_Mod: return get_Mod_resmode(node);
309 case iro_DivMod: return get_DivMod_resmode(node);
310 default: return NULL;
314 #define LMAX(a, b) ((a) > (b) ? (a) : (b))
316 /* A mapper for mapping unsupported instructions to runtime calls. */
317 int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt) {
318 int i, j, arity, first, n_param, n_res;
321 ir_node *mem, *bl, *call, *addr, *res_proj;
325 ir_mode *mode = get_irn_mode(node);
327 if (mode != rt->mode)
329 /* check if the result modes match */
330 if (mode == mode_T && rt->res_mode != NULL) {
331 mode = get_irn_res_mode(node);
332 if (mode != rt->res_mode)
336 arity = get_irn_arity(node);
340 mtp = get_entity_type(rt->ent);
341 n_param = get_method_n_params(mtp);
342 irg = current_ir_graph;
344 mem = get_irn_n(node, 0);
345 if (get_irn_mode(mem) != mode_M) {
346 mem = new_r_NoMem(irg);
351 /* check if the modes of the predecessors match the parameter modes */
352 if (arity - first != n_param)
355 for (i = first, j = 0; i < arity; ++i, ++j) {
356 ir_type *param_tp = get_method_param_type(mtp, j);
357 ir_node *pred = get_irn_n(node, i);
359 if (get_type_mode(param_tp) != get_irn_mode(pred))
363 n_res = get_method_n_ress(mtp);
365 /* step 0: calculate the number of needed Proj's */
367 n_proj = LMAX(n_proj, rt->mem_proj_nr + 1);
368 n_proj = LMAX(n_proj, rt->regular_proj_nr + 1);
369 n_proj = LMAX(n_proj, rt->exc_proj_nr + 1);
370 n_proj = LMAX(n_proj, rt->exc_mem_proj_nr + 1);
371 n_proj = LMAX(n_proj, rt->res_proj_nr + 1);
374 if (rt->mode != mode_T) /* must be mode_T */
379 if (get_type_mode(get_method_res_type(mtp, 0)) != rt->mode)
383 /* ok, when we are here, the number of predecessors match as well as the parameter modes */
384 bl = get_nodes_block(node);
388 NEW_ARR_A(ir_node *, in, n_param);
389 for (i = 0; i < n_param; ++i)
390 in[i] = get_irn_n(node, first + i);
393 /* step 1: create the call */
394 sym.entity_p = rt->ent;
395 addr = new_r_SymConst(irg, bl, sym, symconst_addr_ent);
396 call = new_rd_Call(get_irn_dbg_info(node), irg, bl, mem, addr, n_param, in, mtp);
397 set_irn_pinned(call, get_irn_pinned(node));
400 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
408 turn_into_tuple(node, n_proj);
410 for (i = 0; i < n_proj; ++i)
411 set_Tuple_pred(node, i, new_r_Bad(irg));
412 if (rt->mem_proj_nr >= 0)
413 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_regular));
414 if (get_irn_op(mem) != op_NoMem) {
415 /* Exceptions can only be handled with real memory */
416 if (rt->regular_proj_nr >= 0)
417 set_Tuple_pred(node, rt->regular_proj_nr, new_r_Proj(irg, bl, call, mode_X, pn_Call_X_regular));
418 if (rt->exc_proj_nr >= 0)
419 set_Tuple_pred(node, rt->exc_proj_nr, new_r_Proj(irg, bl, call, mode_X, pn_Call_X_except));
420 if (rt->exc_mem_proj_nr >= 0)
421 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_except));
424 if (rt->res_proj_nr >= 0)
425 for (i = 0; i < n_res; ++i)
426 set_Tuple_pred(node, rt->res_proj_nr + i,
427 new_r_Proj(irg, bl, res_proj, get_type_mode(get_method_res_type(mtp, i)), i));
430 /* only one return value supported */
432 ir_mode *mode = get_type_mode(get_method_res_type(mtp, 0));
434 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
435 res_proj = new_r_Proj(irg, bl, res_proj, mode, 0);
437 exchange(node, res_proj);
441 /* should not happen */