3 * File name: ir/lower/lower_intrinsics.c
4 * Purpose: lowering of Calls of intrinsic functions
8 * Copyright: (c) 1998-2005 Universität Karlsruhe
9 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
31 #include "lower_intrinsics.h"
34 /** Walker environment */
35 typedef struct _walker_env {
36 pmap *c_map; /**< The intrinsic call map. */
37 unsigned nr_of_intrinsics; /**< statistics */
38 const i_instr_record **i_map; /**< The intrinsic instruction map. */
42 * walker: call all mapper functions
44 static void call_mapper(ir_node *node, void *env) {
45 walker_env_t *wenv = env;
46 ir_op *op = get_irn_op(node);
51 const i_call_record *r;
54 symconst = get_Call_ptr(node);
55 if (get_irn_op(symconst) != op_SymConst ||
56 get_SymConst_kind(symconst) != symconst_addr_ent)
59 ent = get_SymConst_entity(symconst);
60 p = pmap_find(wenv->c_map, ent);
64 wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
68 if (0 <= op->code && op->code < ARR_LEN(wenv->i_map)) {
69 const i_instr_record *r = wenv->i_map[op->code];
70 /* run all possible mapper */
72 if (r->i_mapper(node, r->ctx)) {
73 ++wenv->nr_of_intrinsics;
82 /* Go through all graphs and map calls to intrinsic functions. */
83 unsigned lower_intrinsics(i_record *list, int length) {
84 int i, n_ops = get_irp_n_opcodes();
86 pmap *c_map = pmap_create_ex(length);
87 i_instr_record **i_map;
88 unsigned nr_of_intrinsics = 0;
91 /* we use the ir_op generic pointers here */
92 NEW_ARR_A(const i_instr_record *, i_map, n_ops);
93 memset((void *)i_map, 0, sizeof(*i_map) * n_ops);
95 /* fill a map for faster search */
96 for (i = length - 1; i >= 0; --i) {
97 if (list[i].i_call.kind == INTRINSIC_CALL) {
98 pmap_insert(c_map, list[i].i_call.i_ent, (void *)&list[i].i_call);
101 ir_op *op = list[i].i_instr.op;
102 assert(0 <= op->code && op->code < ARR_LEN(i_map));
104 list[i].i_instr.link = i_map[op->code];
105 i_map[op->code] = &list[i].i_instr;
112 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
113 irg = get_irp_irg(i);
115 wenv.nr_of_intrinsics = 0;
116 irg_walk_graph(irg, NULL, call_mapper, &wenv);
118 if (wenv.nr_of_intrinsics) {
119 /* changes detected */
120 set_irg_outs_inconsistent(irg);
121 set_irg_callee_info_state(irg, irg_callee_info_inconsistent);
123 /* exception control flow might have changed */
124 set_irg_doms_inconsistent(irg);
125 set_irg_loopinfo_inconsistent(irg);
127 /* optimize it, tuple might be created */
128 local_optimize_graph(irg);
130 nr_of_intrinsics += wenv.nr_of_intrinsics;
135 return nr_of_intrinsics;
138 /* A mapper for the integer abs. */
139 int i_mapper_Abs(ir_node *call, void *ctx) {
140 ir_node *mem = get_Call_mem(call);
141 ir_node *block = get_nodes_block(call);
142 ir_node *op = get_Call_param(call, 0);
144 dbg_info *dbg = get_irn_dbg_info(call);
146 irn = new_rd_Abs(dbg, current_ir_graph, block, op, get_irn_mode(op));
147 irn = new_Tuple(1, &irn);
149 turn_into_tuple(call, pn_Call_max);
150 set_Tuple_pred(call, pn_Call_M_regular, mem);
151 set_Tuple_pred(call, pn_Call_X_except, new_Bad());
152 set_Tuple_pred(call, pn_Call_T_result, irn);
153 set_Tuple_pred(call, pn_Call_M_except, mem);
154 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
159 /* A mapper for the alloca() function. */
160 int i_mapper_Alloca(ir_node *call, void *ctx) {
161 ir_node *mem = get_Call_mem(call);
162 ir_node *block = get_nodes_block(call);
163 ir_node *op = get_Call_param(call, 0);
165 dbg_info *dbg = get_irn_dbg_info(call);
167 irn = new_rd_Alloc(dbg, current_ir_graph, block, mem, op, firm_unknown_type, stack_alloc);
168 mem = new_Proj(irn, mode_M, pn_Alloc_M);
169 exc = new_Proj(irn, mode_X, pn_Alloc_X_except);
170 irn = new_Proj(irn, get_modeP_data(), pn_Alloc_res);
171 irn = new_Tuple(1, &irn);
173 turn_into_tuple(call, pn_Call_max);
174 set_Tuple_pred(call, pn_Call_M_regular, mem);
175 set_Tuple_pred(call, pn_Call_X_except, exc);
176 set_Tuple_pred(call, pn_Call_T_result, irn);
177 set_Tuple_pred(call, pn_Call_M_except, mem);
178 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
183 #define LMAX(a, b) ((a) > (b) ? (a) : (b))
185 /* A mapper for mapping unsupported instructions to runtime calls. */
186 int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt) {
187 int i, j, arity, first, n_param, n_res;
190 ir_node *mem, *bl, *call, *addr, *res_proj;
195 /* check if the result modes match */
196 if (get_irn_mode(node) != rt->mode)
199 arity = get_irn_arity(node);
203 mtp = get_entity_type(rt->ent);
204 n_param = get_method_n_params(mtp);
205 irg = current_ir_graph;
207 mem = get_irn_n(node, 0);
208 if (get_irn_mode(mem) != mode_M) {
209 mem = new_r_NoMem(irg);
215 /* check if the modes of the predecessors match the parameter modes */
216 if (arity - first != n_param)
219 for (i = first, j = 0; i < arity; ++i, ++j) {
220 ir_type *param_tp = get_method_param_type(mtp, j);
221 ir_node *pred = get_irn_n(node, i);
223 if (get_type_mode(param_tp) != get_irn_mode(pred))
227 n_res = get_method_n_ress(mtp);
229 /* step 0: calculate the number of needed Proj's */
231 n_proj = LMAX(n_proj, rt->mem_proj_nr + 1);
232 n_proj = LMAX(n_proj, rt->exc_proj_nr + 1);
233 n_proj = LMAX(n_proj, rt->exc_mem_proj_nr + 1);
234 n_proj = LMAX(n_proj, rt->res_proj_nr + 1);
237 if (rt->mode != mode_T) /* must be mode_T */
243 if (get_type_mode(get_method_res_type(mtp, 0)) != rt->mode)
247 /* ok, when we are here, the number of predecessors match as well as the parameter modes */
248 bl = get_nodes_block(node);
252 NEW_ARR_A(ir_node *, in, n_param);
253 for (i = 0; i < n_param; ++i)
254 in[i] = get_irn_n(node, first + i);
257 /* step 1: create the call */
258 sym.entity_p = rt->ent;
259 addr = new_r_SymConst(irg, bl, sym, symconst_addr_ent);
260 call = new_rd_Call(get_irn_dbg_info(node), irg, bl, mem, addr, n_param, in, mtp);
261 set_irn_pinned(call, get_irn_pinned(node));
264 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
270 turn_into_tuple(node, n_proj);
272 for (i = 0; i < n_proj; ++i)
273 set_Tuple_pred(node, i, new_r_Bad(irg));
274 if (rt->mem_proj_nr >= 0)
275 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_regular));
276 if (get_irn_op(mem) != op_NoMem) {
277 /* Exceptions can only be handled with real memory */
278 if (rt->exc_proj_nr >= 0)
279 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_X, pn_Call_X_except));
280 if (rt->exc_mem_proj_nr >= 0)
281 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_except));
284 if (rt->res_proj_nr >= 0)
285 for (i = 0; i < n_res; ++i)
286 set_Tuple_pred(node, rt->res_proj_nr + i,
287 new_r_Proj(irg, bl, res_proj, get_type_mode(get_method_res_type(mtp, i)), i));
291 /* only one return value supported */
293 ir_mode *mode = get_type_mode(get_method_res_type(mtp, 0));
295 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
296 res_proj = new_r_Proj(irg, bl, res_proj, mode, 0);
298 exchange(node, res_proj);
302 /* should not happen */