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.
30 #include "lower_intrinsics.h"
33 /** Walker environment */
34 typedef struct _walker_env {
35 pmap *c_map; /**< The intrinsic call map. */
36 unsigned nr_of_intrinsics; /**< statistics */
37 const i_instr_record **i_map; /**< The intrinsic instruction map. */
41 * walker: call all mapper functions
43 static void call_mapper(ir_node *node, void *env) {
44 walker_env_t *wenv = env;
45 ir_op *op = get_irn_op(node);
50 const i_call_record *r;
53 symconst = get_Call_ptr(node);
54 if (get_irn_op(symconst) != op_SymConst ||
55 get_SymConst_kind(symconst) != symconst_addr_ent)
58 ent = get_SymConst_entity(symconst);
59 p = pmap_find(wenv->c_map, ent);
63 wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
67 if (0 <= op->code && op->code < ARR_LEN(wenv->i_map)) {
68 const i_instr_record *r = wenv->i_map[op->code];
69 if (r) { /* we have a mapper */
70 wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
76 /* Go through all graphs and map calls to intrinsic functions. */
77 unsigned lower_intrinsics(const i_record *list, int length) {
78 int i, n_ops = get_irp_n_opcodes();
80 pmap *c_map = pmap_create_ex(length);
81 const i_instr_record **i_map;
82 unsigned nr_of_intrinsics = 0;
85 /* we use the ir_op generic pointers here */
86 NEW_ARR_A(const i_instr_record *, i_map, n_ops);
87 memset((void *)i_map, 0, sizeof(*i_map) * n_ops);
89 /* fill a map for faster search */
90 for (i = length - 1; i >= 0; --i) {
91 if (list[i].i_call.kind == INTRINSIC_CALL) {
92 pmap_insert(c_map, list[i].i_call.i_ent, (void *)&list[i].i_call);
95 ir_op *op = list[i].i_instr.op;
96 assert(0 <= op->code && op->code < ARR_LEN(i_map));
98 i_map[op->code] = &list[i].i_instr;
105 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
106 irg = get_irp_irg(i);
108 wenv.nr_of_intrinsics = 0;
109 irg_walk_graph(irg, NULL, call_mapper, &wenv);
111 if (wenv.nr_of_intrinsics) {
112 /* changes detected */
113 set_irg_outs_inconsistent(irg);
114 set_irg_callee_info_state(irg, irg_callee_info_inconsistent);
116 /* exception control flow might have changed */
117 set_irg_doms_inconsistent(irg);
118 set_irg_loopinfo_inconsistent(irg);
120 nr_of_intrinsics += wenv.nr_of_intrinsics;
125 return nr_of_intrinsics;
128 /* A mapper for the integer abs. */
129 int i_mapper_Abs(ir_node *call, void *ctx) {
130 ir_node *mem = get_Call_mem(call);
131 ir_node *block = get_nodes_block(call);
132 ir_node *op = get_Call_param(call, 0);
134 dbg_info *dbg = get_irn_dbg_info(call);
136 irn = new_rd_Abs(dbg, current_ir_graph, block, op, get_irn_mode(op));
137 irn = new_Tuple(1, &irn);
139 turn_into_tuple(call, pn_Call_max);
140 set_Tuple_pred(call, pn_Call_M_regular, mem);
141 set_Tuple_pred(call, pn_Call_X_except, new_Bad());
142 set_Tuple_pred(call, pn_Call_T_result, irn);
143 set_Tuple_pred(call, pn_Call_M_except, mem);
144 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
149 /* A mapper for the alloca() function. */
150 int i_mapper_Alloca(ir_node *call, void *ctx) {
151 ir_node *mem = get_Call_mem(call);
152 ir_node *block = get_nodes_block(call);
153 ir_node *op = get_Call_param(call, 0);
155 dbg_info *dbg = get_irn_dbg_info(call);
157 irn = new_rd_Alloc(dbg, current_ir_graph, block, mem, op, firm_unknown_type, stack_alloc);
158 mem = new_Proj(irn, mode_M, pn_Alloc_M);
159 exc = new_Proj(irn, mode_X, pn_Alloc_X_except);
160 irn = new_Proj(irn, get_modeP_data(), pn_Alloc_res);
161 irn = new_Tuple(1, &irn);
163 turn_into_tuple(call, pn_Call_max);
164 set_Tuple_pred(call, pn_Call_M_regular, mem);
165 set_Tuple_pred(call, pn_Call_X_except, exc);
166 set_Tuple_pred(call, pn_Call_T_result, irn);
167 set_Tuple_pred(call, pn_Call_M_except, mem);
168 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
173 #define LMAX(a, b) ((a) > (b) ? (a) : (b))
175 /* A mapper for mapping unsupported instructions to runtime calls. */
176 int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt) {
177 int i, j, arity, first, n_param, n_res;
180 ir_node *mem, *bl, *call, *addr, *res_proj;
185 /* check if the result modes match */
186 if (get_irn_mode(node) != rt->mode)
189 arity = get_irn_arity(node);
193 mtp = get_entity_type(rt->ent);
194 n_param = get_method_n_params(mtp);
195 irg = current_ir_graph;
197 mem = get_irn_n(node, 0);
198 if (get_irn_mode(mem) != mode_M) {
199 mem = new_r_NoMem(irg);
205 /* check if the modes of the predecessors match the parameter modes */
206 if (arity - first != n_param)
209 for (i = first, j = 0; i < arity; ++i, ++j) {
210 ir_type *param_tp = get_method_param_type(mtp, j);
211 ir_node *pred = get_irn_n(node, i);
213 if (get_type_mode(param_tp) != get_irn_mode(pred))
217 n_res = get_method_n_ress(mtp);
219 /* step 0: calculate the number of needed Proj's */
221 n_proj = LMAX(n_proj, rt->mem_proj_nr + 1);
222 n_proj = LMAX(n_proj, rt->exc_proj_nr + 1);
223 n_proj = LMAX(n_proj, rt->exc_mem_proj_nr + 1);
224 n_proj = LMAX(n_proj, rt->res_proj_nr + 1);
227 if (rt->mode != mode_T) /* must be mode_T */
233 if (get_type_mode(get_method_res_type(mtp, 0)) != rt->mode)
237 /* ok, when we are here, the number of predecessors match as well as the parameter modes */
238 bl = get_nodes_block(node);
242 NEW_ARR_A(ir_node *, in, n_param);
243 for (i = 0; i < n_param; ++i)
244 in[i] = get_irn_n(node, first + i);
247 /* step 1: create the call */
248 sym.entity_p = rt->ent;
249 addr = new_r_SymConst(irg, bl, sym, symconst_addr_ent);
250 call = new_rd_Call(get_irn_dbg_info(node), irg, bl, mem, addr, n_param, in, mtp);
251 set_irn_pinned(call, get_irn_pinned(node));
254 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
260 turn_into_tuple(node, n_proj);
262 for (i = 0; i < n_proj; ++i)
263 set_Tuple_pred(node, i, new_r_Bad(irg));
264 if (rt->mem_proj_nr >= 0)
265 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_regular));
266 if (get_irn_op(mem) != op_NoMem) {
267 /* Exceptions can only be handled with real memory */
268 if (rt->exc_proj_nr >= 0)
269 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_X, pn_Call_X_except));
270 if (rt->exc_mem_proj_nr >= 0)
271 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_except));
274 if (rt->res_proj_nr >= 0)
275 for (i = 0; i < n_res; ++i)
276 set_Tuple_pred(node, rt->res_proj_nr + i,
277 new_r_Proj(irg, bl, res_proj, get_type_mode(get_method_res_type(mtp, i)), i));
281 /* only one return value supported */
283 ir_mode *mode = get_type_mode(get_method_res_type(mtp, 0));
285 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
286 res_proj = new_r_Proj(irg, bl, res_proj, mode, 0);
288 exchange(node, res_proj);
292 /* should not happen */