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 lowering of Calls of intrinsic functions
23 * @author Michael Beck
44 #include "iropt_dbg.h"
46 /** Walker environment. */
47 typedef struct _walker_env {
48 pmap *c_map; /**< The intrinsic call map. */
49 unsigned nr_of_intrinsics; /**< statistics */
50 i_instr_record **i_map; /**< The intrinsic instruction map. */
54 * walker: call all mapper functions
56 static void call_mapper(ir_node *node, void *env) {
57 walker_env_t *wenv = env;
58 ir_op *op = get_irn_op(node);
63 const i_call_record *r;
66 symconst = get_Call_ptr(node);
67 if (! is_SymConst_addr_ent(symconst))
70 ent = get_SymConst_entity(symconst);
71 p = pmap_find(wenv->c_map, ent);
75 wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
78 if (op->code < (unsigned) ARR_LEN(wenv->i_map)) {
79 const i_instr_record *r = wenv->i_map[op->code];
80 /* run all possible mapper */
82 if (r->i_mapper(node, r->ctx)) {
83 ++wenv->nr_of_intrinsics;
92 /* Go through all graphs and map calls to intrinsic functions. */
93 unsigned lower_intrinsics(i_record *list, int length, int part_block_used) {
94 int i, n_ops = get_irp_n_opcodes();
96 pmap *c_map = pmap_create_ex(length);
97 i_instr_record **i_map;
98 unsigned nr_of_intrinsics = 0;
101 /* we use the ir_op generic pointers here */
102 NEW_ARR_A(const i_instr_record *, i_map, n_ops);
103 memset((void *)i_map, 0, sizeof(*i_map) * n_ops);
105 /* fill a map for faster search */
106 for (i = length - 1; i >= 0; --i) {
107 if (list[i].i_call.kind == INTRINSIC_CALL) {
108 pmap_insert(c_map, list[i].i_call.i_ent, (void *)&list[i].i_call);
110 ir_op *op = list[i].i_instr.op;
111 assert(op->code < (unsigned) ARR_LEN(i_map));
113 list[i].i_instr.link = i_map[op->code];
114 i_map[op->code] = &list[i].i_instr;
121 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
122 irg = get_irp_irg(i);
125 collect_phiprojs(irg);
127 wenv.nr_of_intrinsics = 0;
128 irg_walk_graph(irg, NULL, call_mapper, &wenv);
130 if (wenv.nr_of_intrinsics > 0) {
131 /* Changes detected: we might have added/removed nodes. */
132 set_irg_outs_inconsistent(irg);
133 set_irg_callee_info_state(irg, irg_callee_info_inconsistent);
135 /* Exception control flow might have changed / new block might have added. */
136 set_irg_doms_inconsistent(irg);
137 set_irg_extblk_inconsistent(irg);
138 set_irg_loopinfo_inconsistent(irg);
140 /* Calls might be removed/added. */
141 set_trouts_inconsistent();
144 irg_verify(irg, VRFY_NORMAL);
146 /* Optimize it, tuple might be created. */
147 optimize_graph_df(irg);
149 nr_of_intrinsics += wenv.nr_of_intrinsics;
154 return nr_of_intrinsics;
155 } /* lower_intrinsics */
158 * Helper function, replace the call by the given node.
160 * @param irn the result node
161 * @param call the call to replace
162 * @param mem the new mem result
163 * @param reg_jmp new regular control flow, if NULL, a Jmp will be used
164 * @param exc_jmp new exception control flow, if reg_jmp == NULL, a Bad will be used
166 static void replace_call(ir_node *irn, ir_node *call, ir_node *mem, ir_node *reg_jmp, ir_node *exc_jmp) {
167 ir_node *block = get_nodes_block(call);
169 if (reg_jmp == NULL) {
171 /* Beware: do we need here a protection against CSE? Better we do it. */
172 int old_cse = get_opt_cse();
174 reg_jmp = new_r_Jmp(current_ir_graph, block);
175 set_opt_cse(old_cse);
178 irn = new_r_Tuple(current_ir_graph, block, 1, &irn);
180 turn_into_tuple(call, pn_Call_max);
181 set_Tuple_pred(call, pn_Call_M_regular, mem);
182 set_Tuple_pred(call, pn_Call_X_regular, reg_jmp);
183 set_Tuple_pred(call, pn_Call_X_except, exc_jmp);
184 set_Tuple_pred(call, pn_Call_T_result, irn);
185 set_Tuple_pred(call, pn_Call_M_except, mem);
186 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
189 /* A mapper for the integer abs. */
190 int i_mapper_abs(ir_node *call, void *ctx) {
191 ir_node *mem = get_Call_mem(call);
192 ir_node *block = get_nodes_block(call);
193 ir_node *op = get_Call_param(call, 0);
195 dbg_info *dbg = get_irn_dbg_info(call);
198 irn = new_rd_Abs(dbg, current_ir_graph, block, op, get_irn_mode(op));
199 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_ABS);
200 replace_call(irn, call, mem, NULL, NULL);
204 /* A mapper for the alloca() function. */
205 int i_mapper_alloca(ir_node *call, void *ctx) {
206 ir_node *mem = get_Call_mem(call);
207 ir_node *block = get_nodes_block(call);
208 ir_node *op = get_Call_param(call, 0);
209 ir_node *irn, *exc, *no_exc;
210 dbg_info *dbg = get_irn_dbg_info(call);
213 irn = new_rd_Alloc(dbg, current_ir_graph, block, mem, op, firm_unknown_type, stack_alloc);
214 mem = new_Proj(irn, mode_M, pn_Alloc_M);
215 no_exc = new_Proj(irn, mode_X, pn_Alloc_X_regular);
216 exc = new_Proj(irn, mode_X, pn_Alloc_X_except);
217 irn = new_Proj(irn, get_modeP_data(), pn_Alloc_res);
219 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_ALLOCA);
220 replace_call(irn, call, mem, no_exc, exc);
222 } /* i_mapper_alloca */
224 /* A mapper for the floating point sqrt. */
225 int i_mapper_sqrt(ir_node *call, void *ctx) {
228 ir_node *op = get_Call_param(call, 0);
234 tv = get_Const_tarval(op);
235 if (! tarval_is_null(tv) && !tarval_is_one(tv))
238 mem = get_Call_mem(call);
240 /* sqrt(0) = 0, sqrt(1) = 1 */
241 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_SQRT);
242 replace_call(op, call, mem, NULL, NULL);
244 } /* i_mapper_sqrt */
246 /* A mapper for the floating point cbrt. */
247 int i_mapper_cbrt(ir_node *call, void *ctx) {
250 ir_node *op = get_Call_param(call, 0);
256 tv = get_Const_tarval(op);
257 if (! tarval_is_null(tv) && !tarval_is_one(tv) && !tarval_is_minus_one(tv))
260 mem = get_Call_mem(call);
262 /* cbrt(0) = 0, cbrt(1) = 1, cbrt(-1) = -1 */
263 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_CBRT);
264 replace_call(op, call, mem, NULL, NULL);
266 } /* i_mapper_cbrt */
268 /* A mapper for the floating point pow. */
269 int i_mapper_pow(ir_node *call, void *ctx) {
272 ir_node *left = get_Call_param(call, 0);
273 ir_node *right = get_Call_param(call, 1);
274 ir_node *block = get_nodes_block(call);
275 ir_node *irn, *reg_jmp = NULL, *exc_jmp = NULL;
278 if (is_Const(left) && is_Const_one(left)) {
279 /* pow (1.0, x) = 1.0 */
281 } else if (is_Const(right)) {
282 tarval *tv = get_Const_tarval(right);
283 if (tarval_is_null(tv)) {
284 /* pow(x, 0.0) = 1.0 */
285 ir_mode *mode = get_tarval_mode(tv);
286 irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
287 } else if (tarval_is_one(tv)) {
288 /* pow(x, 1.0) = x */
290 } else if (tarval_is_minus_one(tv)) {
291 /* pow(x, -1.0) = 1/x */
299 mem = get_Call_mem(call);
300 dbg = get_irn_dbg_info(call);
303 ir_mode *mode = get_irn_mode(left);
306 irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
307 quot = new_rd_Quot(dbg, current_ir_graph, block, mem, irn, left, mode, op_pin_state_pinned);
308 mem = new_r_Proj(current_ir_graph, block, quot, mode_M, pn_Quot_M);
309 irn = new_r_Proj(current_ir_graph, block, quot, mode, pn_Quot_res);
310 reg_jmp = new_r_Proj(current_ir_graph, block, quot, mode_X, pn_Quot_X_regular);
311 exc_jmp = new_r_Proj(current_ir_graph, block, quot, mode_X, pn_Quot_X_except);
313 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_POW);
314 replace_call(irn, call, mem, reg_jmp, exc_jmp);
318 /* A mapper for the floating point exp. */
319 int i_mapper_exp(ir_node *call, void *ctx) {
320 ir_node *val = get_Call_param(call, 0);
323 if (is_Const(val) && is_Const_null(val)) {
325 ir_node *block = get_nodes_block(call);
326 ir_mode *mode = get_irn_mode(val);
327 ir_node *irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
328 ir_node *mem = get_Call_mem(call);
329 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_EXP);
330 replace_call(irn, call, mem, NULL, NULL);
337 * A mapper for mapping f(0.0) to 0.0.
339 static int i_mapper_zero_to_zero(ir_node *call, void *ctx, int reason) {
340 ir_node *val = get_Call_param(call, 0);
343 if (is_Const(val) && is_Const_null(val)) {
345 ir_node *mem = get_Call_mem(call);
346 DBG_OPT_ALGSIM0(call, val, reason);
347 replace_call(val, call, mem, NULL, NULL);
351 } /* i_mapper_zero_to_zero */
354 * A mapper for mapping f(1.0) to 0.0.
356 static int i_mapper_one_to_zero(ir_node *call, void *ctx, int reason) {
357 ir_node *val = get_Call_param(call, 0);
360 if (is_Const(val) && is_Const_one(val)) {
361 /* acos(1.0) = 0.0 */
362 ir_node *block = get_nodes_block(call);
363 ir_mode *mode = get_irn_mode(val);
364 ir_node *irn = new_r_Const(current_ir_graph, block, mode, get_mode_null(mode));
365 ir_node *mem = get_Call_mem(call);
366 DBG_OPT_ALGSIM0(call, irn, reason);
367 replace_call(irn, call, mem, NULL, NULL);
371 } /* i_mapper_one_to_zero */
374 * A mapper for mapping a functions with the following characteristics:
378 static int i_mapper_symmetric_zero_to_one(ir_node *call, void *ctx, int reason) {
379 ir_node *val = get_Call_param(call, 0);
382 if (is_strictConv(val)) {
383 ir_node *op = get_Conv_op(val);
385 /* f(-x) = f(x) with strictConv */
386 ir_node *block = get_nodes_block(call);
387 ir_mode *mode = get_irn_mode(val);
388 dbg_info *dbg = get_irn_dbg_info(val);
390 op = get_Minus_op(op);
391 val = new_rd_Conv(dbg, current_ir_graph, block, op, mode);
394 set_Conv_strict(val, 1);
396 DBG_OPT_ALGSIM2(call, op, call, FS_OPT_RTS_SYMMETRIC);
397 set_Call_param(call, 0, val);
399 } else if (is_Minus(val)) {
401 val = get_Minus_op(val);
402 DBG_OPT_ALGSIM2(call, val, call, FS_OPT_RTS_SYMMETRIC);
403 set_Call_param(call, 0, val);
406 if (is_Const(val) && is_Const_null(val)) {
408 ir_node *block = get_nodes_block(call);
409 ir_mode *mode = get_irn_mode(val);
410 ir_node *irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
411 ir_node *mem = get_Call_mem(call);
412 DBG_OPT_ALGSIM0(call, irn, reason);
413 replace_call(irn, call, mem, NULL, NULL);
417 } /* i_mapper_symmetric_zero_to_one */
419 /* A mapper for the floating point log. */
420 int i_mapper_log(ir_node *call, void *ctx) {
422 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_LOG);
425 /* A mapper for the floating point sin. */
426 int i_mapper_sin(ir_node *call, void *ctx) {
428 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SIN);
431 /* A mapper for the floating point cos. */
432 int i_mapper_cos(ir_node *call, void *ctx) {
433 /* cos(0.0) = 1.0, cos(-x) = x */
434 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COS);
437 /* A mapper for the floating point tan. */
438 int i_mapper_tan(ir_node *call, void *ctx) {
440 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TAN);
443 /* A mapper for the floating point asin. */
444 int i_mapper_asin(ir_node *call, void *ctx) {
445 /* asin(0.0) = 0.0 */
446 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ASIN);
447 } /* i_mapper_asin */
449 /* A mapper for the floating point acos. */
450 int i_mapper_acos(ir_node *call, void *ctx) {
451 /* acos(1.0) = 0.0 */
452 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_ACOS);
453 } /* i_mapper_acos */
455 /* A mapper for the floating point atan. */
456 int i_mapper_atan(ir_node *call, void *ctx) {
457 /* atan(0.0) = 0.0 */
458 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ATAN);
459 } /* i_mapper_atan */
461 /* A mapper for the floating point sinh. */
462 int i_mapper_sinh(ir_node *call, void *ctx) {
463 /* sinh(0.0) = 0.0 */
464 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SINH);
465 } /* i_mapper_sinh */
467 /* A mapper for the floating point cosh. */
468 int i_mapper_cosh(ir_node *call, void *ctx) {
469 /* cosh(0.0) = 1.0, cosh(-x) = x */
470 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COSH);
471 } /* i_mapper_cosh */
473 /* A mapper for the floating point tanh. */
474 int i_mapper_tanh(ir_node *call, void *ctx) {
475 /* tanh(0.0) = 0.0 */
476 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TANH);
477 } /* i_mapper_tanh */
480 * Return the const entity that is accessed through the pointer ptr or
481 * NULL if there is no entity (or the entity is not constant).
483 * @param ptr the pointer
485 static ir_entity *get_const_entity(ir_node *ptr) {
486 /* FIXME: this cannot handle constant strings inside struct initializers yet */
487 if (is_SymConst_addr_ent(ptr)) {
488 ir_entity *ent = get_SymConst_entity(ptr);
490 if (get_entity_variability(ent) == variability_constant) {
491 /* a constant entity */
496 } /* get_const_entity */
499 * Calculate the value of strlen if possible.
501 * @param ent the entity
502 * @param res_tp the result type
504 * @return a Const node containing the strlen() result or NULL
505 * if the evaluation fails
507 static ir_node *eval_strlen(ir_entity *ent, ir_type *res_tp) {
508 ir_type *tp = get_entity_type(ent);
512 if (! is_Array_type(tp))
514 tp = get_array_element_type(tp);
515 if (! is_Primitive_type(tp))
517 mode = get_type_mode(tp);
519 /* FIXME: This is too restrict, as the type char might be more the 8bits */
520 if (!mode_is_int(mode) || get_mode_size_bits(mode) != get_mode_size_bits(mode_Bs))
523 n = get_compound_ent_n_values(ent);
524 for (i = 0; i < n; ++i) {
525 ir_node *irn = get_compound_ent_value(ent, i);
530 if (is_Const_null(irn)) {
531 /* found the length */
537 tarval *tv = new_tarval_from_long(len, get_type_mode(res_tp));
538 return new_Const_type(tv, res_tp);
543 /* A mapper for strlen */
544 int i_mapper_strlen(ir_node *call, void *ctx) {
545 ir_node *s = get_Call_param(call, 0);
546 ir_entity *ent = get_const_entity(s);
550 /* FIXME: this cannot handle constant strings inside struct initializers yet */
552 /* a constant entity */
553 ir_type *tp = get_Call_type(call);
556 tp = get_method_res_type(tp, 0);
557 irn = eval_strlen(ent, tp);
560 ir_node *mem = get_Call_mem(call);
561 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRLEN);
562 replace_call(irn, call, mem, NULL, NULL);
567 } /* i_mapper_strlen */
570 * Calculate the value of strlen if possible.
572 * @param left the left entity
573 * @param right the right entity
574 * @param res_tp the result type
576 * @return a Const node containing the strcmp() result or NULL
577 * if the evaluation fails
579 static ir_node *eval_strcmp(ir_entity *left, ir_entity *right, ir_type *res_tp) {
584 tp = get_entity_type(left);
585 if (! is_Array_type(tp))
587 tp = get_array_element_type(tp);
588 if (! is_Primitive_type(tp))
590 mode = get_type_mode(tp);
592 /* FIXME: This is too restrict, as the type char might be more the 8bits */
593 if (!mode_is_int(mode) || get_mode_size_bits(mode) != get_mode_size_bits(mode_Bs))
596 tp = get_entity_type(right);
597 if (! is_Array_type(tp))
599 tp = get_array_element_type(tp);
600 if (! is_Primitive_type(tp))
602 mode = get_type_mode(tp);
604 /* FIXME: This is too restrict, as the type char might be more the 8bits */
605 if (!mode_is_int(mode) || get_mode_size_bits(mode) != get_mode_size_bits(mode_Bs))
608 n = get_compound_ent_n_values(left);
609 n_r = get_compound_ent_n_values(right);
612 for (i = 0; i < n; ++i) {
617 irn = get_compound_ent_value(left, i);
620 tv = get_Const_tarval(irn);
621 v_l = get_tarval_long(tv);
623 irn = get_compound_ent_value(right, i);
626 tv = get_Const_tarval(irn);
627 v_r = get_tarval_long(tv);
644 /* we found an end */
645 tarval *tv = new_tarval_from_long(res, get_type_mode(res_tp));
646 return new_Const_type(tv, res_tp);
652 * Checks if an entity represents the empty string.
654 * @param ent the entity
656 * @return non-zero if ent represents the empty string
658 static int is_empty_string(ir_entity *ent) {
659 ir_type *tp = get_entity_type(ent);
664 if (! is_Array_type(tp))
666 tp = get_array_element_type(tp);
667 if (! is_Primitive_type(tp))
669 mode = get_type_mode(tp);
671 /* FIXME: This is too restrict, as the type char might be more the 8bits */
672 if (!mode_is_int(mode) || get_mode_size_bits(mode) != get_mode_size_bits(mode_Bs))
675 n = get_compound_ent_n_values(ent);
678 irn = get_compound_ent_value(ent, 0);
680 return is_Const(irn) && is_Const_null(irn);
681 } /* is_empty_string */
683 /* A mapper for strcmp */
684 int i_mapper_strcmp(ir_node *call, void *ctx) {
685 ir_node *left = get_Call_param(call, 0);
686 ir_node *right = get_Call_param(call, 1);
690 ir_node *adr = get_Call_ptr(call);
691 ir_entity *ent = get_SymConst_entity(adr);
692 ir_type *call_tp = get_entity_type(ent);
693 ir_type *res_tp = get_method_res_type(call_tp, 0);
694 ir_entity *ent_l, *ent_r;
700 /* do some type checks first */
701 if (! is_Primitive_type(res_tp))
703 char_tp = get_method_param_type(call_tp, 0);
704 if (char_tp != get_method_param_type(call_tp, 1))
706 if (! is_Pointer_type(char_tp))
708 char_tp = get_pointer_points_to_type(char_tp);
711 /* a strcmp(s, s) ==> 0 */
712 ir_node *mem = get_Call_mem(call);
713 ir_mode *mode = get_type_mode(res_tp);
714 ir_node *block = get_nodes_block(call);
716 irn = new_r_Const(current_ir_graph, block, mode, get_mode_null(mode));
717 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
718 replace_call(irn, call, mem, NULL, NULL);
721 ent_l = get_const_entity(left);
722 ent_r = get_const_entity(right);
724 if (ent_l != NULL && ent_r != NULL) {
725 /* both entities are const, try to evaluate */
726 irn = eval_strcmp(ent_l, ent_r, res_tp);
727 } else if (ent_l != NULL) {
728 if (is_empty_string(ent_l)) {
729 /* s strcmp("", s) ==> -(*s)*/
731 goto replace_by_call;
733 } else if (ent_r != NULL) {
734 if (is_empty_string(ent_r)) {
735 /* s strcmp(s, "") ==> (*s) */
736 ir_node *mem, *block;
742 mem = get_Call_mem(call);
743 block = get_nodes_block(call);
744 dbg = get_irn_dbg_info(call);
745 mode = get_type_mode(char_tp);
747 /* replace the strcmp by (*x) */
748 irn = new_rd_Load(dbg, current_ir_graph, block, mem, v, mode);
749 mem = new_r_Proj(current_ir_graph, block, irn, mode_M, pn_Load_M);
750 exc = new_r_Proj(current_ir_graph, block, irn, mode_X, pn_Load_X_except);
751 reg = new_r_Proj(current_ir_graph, block, irn, mode_X, pn_Load_X_regular);
752 irn = new_r_Proj(current_ir_graph, block, irn, mode, pn_Load_res);
754 /* conv to the result mode */
755 mode = get_type_mode(res_tp);
756 irn = new_rd_Conv(dbg, current_ir_graph, block, irn, mode);
759 /* negate in the ("", s) case */
760 irn = new_rd_Minus(dbg, current_ir_graph, block, irn, mode);
766 ir_node *mem = get_Call_mem(call);
767 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
768 replace_call(irn, call, mem, reg, exc);
773 } /* i_mapper_strcmp */
775 /* A mapper for strncmp */
776 int i_mapper_strncmp(ir_node *call, void *ctx) {
777 ir_node *left = get_Call_param(call, 0);
778 ir_node *right = get_Call_param(call, 1);
779 ir_node *len = get_Call_param(call, 2);
783 if (left == right || (is_Const(len) && is_Const_null(len))) {
784 /* a strncmp(s, s, len) ==> 0 OR
785 a strncmp(a, b, 0) ==> 0 */
786 ir_node *mem = get_Call_mem(call);
787 ir_node *adr = get_Call_ptr(call);
788 ir_entity *ent = get_SymConst_entity(adr);
789 ir_type *call_tp = get_entity_type(ent);
790 ir_type *res_tp = get_method_res_type(call_tp, 0);
791 ir_mode *mode = get_type_mode(res_tp);
792 ir_node *block = get_nodes_block(call);
794 irn = new_r_Const(current_ir_graph, block, mode, get_mode_null(mode));
795 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRNCMP);
796 replace_call(irn, call, mem, NULL, NULL);
800 } /* i_mapper_strncmp */
802 /* A mapper for memcpy */
803 int i_mapper_memcpy(ir_node *call, void *ctx) {
804 ir_node *len = get_Call_param(call, 2);
807 if (is_Const(len) && is_Const_null(len)) {
808 /* a memcpy(d, s, 0) ==> d */
809 ir_node *mem = get_Call_mem(call);
810 ir_node *dst = get_Call_param(call, 0);
812 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMCPY);
813 replace_call(dst, call, mem, NULL, NULL);
817 } /* i_mapper_memcpy */
819 /* A mapper for memset */
820 int i_mapper_memset(ir_node *call, void *ctx) {
821 ir_node *len = get_Call_param(call, 2);
824 if (is_Const(len) && is_Const_null(len)) {
825 /* a memset(d, C, 0) ==> d */
826 ir_node *mem = get_Call_mem(call);
827 ir_node *dst = get_Call_param(call, 0);
829 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMSET);
830 replace_call(dst, call, mem, NULL, NULL);
834 } /* i_mapper_memset */
837 * Returns the result mode of a node.
839 static ir_mode *get_irn_res_mode(ir_node *node) {
840 switch (get_irn_opcode(node)) {
841 case iro_Load: return get_Load_mode(node);
842 case iro_Quot: return get_Quot_resmode(node);
843 case iro_Div: return get_Div_resmode(node);
844 case iro_Mod: return get_Mod_resmode(node);
845 case iro_DivMod: return get_DivMod_resmode(node);
846 default: return NULL;
848 } /* get_irn_res_mode */
850 #define LMAX(a, b) ((a) > (b) ? (a) : (b))
852 /* A mapper for mapping unsupported instructions to runtime calls. */
853 int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt) {
854 int i, j, arity, first, n_param, n_res;
857 ir_node *mem, *bl, *call, *addr, *res_proj;
861 ir_mode *mode = get_irn_mode(node);
863 if (mode != rt->mode)
865 /* check if the result modes match */
866 if (mode == mode_T && rt->res_mode != NULL) {
867 mode = get_irn_res_mode(node);
868 if (mode != rt->res_mode)
872 arity = get_irn_arity(node);
876 mtp = get_entity_type(rt->ent);
877 n_param = get_method_n_params(mtp);
878 irg = current_ir_graph;
880 mem = get_irn_n(node, 0);
881 if (get_irn_mode(mem) != mode_M) {
882 mem = new_r_NoMem(irg);
887 /* check if the modes of the predecessors match the parameter modes */
888 if (arity - first != n_param)
891 for (i = first, j = 0; i < arity; ++i, ++j) {
892 ir_type *param_tp = get_method_param_type(mtp, j);
893 ir_node *pred = get_irn_n(node, i);
895 if (get_type_mode(param_tp) != get_irn_mode(pred))
899 n_res = get_method_n_ress(mtp);
901 /* step 0: calculate the number of needed Proj's */
903 n_proj = LMAX(n_proj, rt->mem_proj_nr + 1);
904 n_proj = LMAX(n_proj, rt->regular_proj_nr + 1);
905 n_proj = LMAX(n_proj, rt->exc_proj_nr + 1);
906 n_proj = LMAX(n_proj, rt->exc_mem_proj_nr + 1);
907 n_proj = LMAX(n_proj, rt->res_proj_nr + 1);
910 if (rt->mode != mode_T) /* must be mode_T */
915 if (get_type_mode(get_method_res_type(mtp, 0)) != rt->mode)
919 /* ok, when we are here, the number of predecessors match as well as the parameter modes */
920 bl = get_nodes_block(node);
924 NEW_ARR_A(ir_node *, in, n_param);
925 for (i = 0; i < n_param; ++i)
926 in[i] = get_irn_n(node, first + i);
929 /* step 1: create the call */
930 sym.entity_p = rt->ent;
931 addr = new_r_SymConst(irg, bl, mode_P_code, sym, symconst_addr_ent);
932 call = new_rd_Call(get_irn_dbg_info(node), irg, bl, mem, addr, n_param, in, mtp);
933 set_irn_pinned(call, get_irn_pinned(node));
936 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
944 turn_into_tuple(node, n_proj);
946 for (i = 0; i < n_proj; ++i)
947 set_Tuple_pred(node, i, new_r_Bad(irg));
948 if (rt->mem_proj_nr >= 0)
949 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_regular));
950 if (get_irn_op(mem) != op_NoMem) {
951 /* Exceptions can only be handled with real memory */
952 if (rt->regular_proj_nr >= 0)
953 set_Tuple_pred(node, rt->regular_proj_nr, new_r_Proj(irg, bl, call, mode_X, pn_Call_X_regular));
954 if (rt->exc_proj_nr >= 0)
955 set_Tuple_pred(node, rt->exc_proj_nr, new_r_Proj(irg, bl, call, mode_X, pn_Call_X_except));
956 if (rt->exc_mem_proj_nr >= 0)
957 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_except));
960 if (rt->res_proj_nr >= 0)
961 for (i = 0; i < n_res; ++i)
962 set_Tuple_pred(node, rt->res_proj_nr + i,
963 new_r_Proj(irg, bl, res_proj, get_type_mode(get_method_res_type(mtp, i)), i));
966 /* only one return value supported */
968 ir_mode *mode = get_type_mode(get_method_res_type(mtp, 0));
970 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
971 res_proj = new_r_Proj(irg, bl, res_proj, mode, 0);
973 exchange(node, res_proj);
977 /* should not happen */
979 } /* i_mapper_RuntimeCall */