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
43 #include "iropt_dbg.h"
45 /** Walker environment */
46 typedef struct _walker_env {
47 pmap *c_map; /**< The intrinsic call map. */
48 unsigned nr_of_intrinsics; /**< statistics */
49 i_instr_record **i_map; /**< The intrinsic instruction map. */
53 * walker: call all mapper functions
55 static void call_mapper(ir_node *node, void *env) {
56 walker_env_t *wenv = env;
57 ir_op *op = get_irn_op(node);
62 const i_call_record *r;
65 symconst = get_Call_ptr(node);
66 if (! is_SymConst_addr_ent(symconst))
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;
151 } /* lower_intrinsics */
154 * Helper function, replace the call by the given node.
156 * @param irn the result node
157 * @param call the call to replace
158 * @param mem the new mem result
159 * @param reg_jmp new regular control flow, if NULL, a Jmp will be used
160 * @param exc_jmp new exception control flow, if reg_jmp == NULL, a Bad will be used
162 static void replace_call(ir_node *irn, ir_node *call, ir_node *mem, ir_node *reg_jmp, ir_node *exc_jmp) {
163 ir_node *block = get_nodes_block(call);
165 if (reg_jmp == NULL) {
167 /* Beware: do we need here a protection against CSE? Better we do it. */
168 int old_cse = get_opt_cse();
170 reg_jmp = new_r_Jmp(current_ir_graph, block);
171 set_opt_cse(old_cse);
174 irn = new_r_Tuple(current_ir_graph, block, 1, &irn);
176 turn_into_tuple(call, pn_Call_max);
177 set_Tuple_pred(call, pn_Call_M_regular, mem);
178 set_Tuple_pred(call, pn_Call_X_regular, reg_jmp);
179 set_Tuple_pred(call, pn_Call_X_except, exc_jmp);
180 set_Tuple_pred(call, pn_Call_T_result, irn);
181 set_Tuple_pred(call, pn_Call_M_except, mem);
182 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
185 /* A mapper for the integer abs. */
186 int i_mapper_abs(ir_node *call, void *ctx) {
187 ir_node *mem = get_Call_mem(call);
188 ir_node *block = get_nodes_block(call);
189 ir_node *op = get_Call_param(call, 0);
191 dbg_info *dbg = get_irn_dbg_info(call);
194 irn = new_rd_Abs(dbg, current_ir_graph, block, op, get_irn_mode(op));
195 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_ABS);
196 replace_call(irn, call, mem, NULL, NULL);
200 /* A mapper for the alloca() function. */
201 int i_mapper_alloca(ir_node *call, void *ctx) {
202 ir_node *mem = get_Call_mem(call);
203 ir_node *block = get_nodes_block(call);
204 ir_node *op = get_Call_param(call, 0);
205 ir_node *irn, *exc, *no_exc;
206 dbg_info *dbg = get_irn_dbg_info(call);
209 irn = new_rd_Alloc(dbg, current_ir_graph, block, mem, op, firm_unknown_type, stack_alloc);
210 mem = new_Proj(irn, mode_M, pn_Alloc_M);
211 no_exc = new_Proj(irn, mode_X, pn_Alloc_X_regular);
212 exc = new_Proj(irn, mode_X, pn_Alloc_X_except);
213 irn = new_Proj(irn, get_modeP_data(), pn_Alloc_res);
215 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_ALLOCA);
216 replace_call(irn, call, mem, no_exc, exc);
218 } /* i_mapper_alloca */
220 /* A mapper for the floating point sqrt. */
221 int i_mapper_sqrt(ir_node *call, void *ctx) {
224 ir_node *op = get_Call_param(call, 0);
230 tv = get_Const_tarval(op);
231 if (! tarval_is_null(tv) && !tarval_is_one(tv))
234 mem = get_Call_mem(call);
236 /* sqrt(0) = 0, sqrt(1) = 1 */
237 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_SQRT);
238 replace_call(op, call, mem, NULL, NULL);
240 } /* i_mapper_sqrt */
242 /* A mapper for the floating point cbrt. */
243 int i_mapper_cbrt(ir_node *call, void *ctx) {
246 ir_node *op = get_Call_param(call, 0);
252 tv = get_Const_tarval(op);
253 if (! tarval_is_null(tv) && !tarval_is_one(tv) && !tarval_is_minus_one(tv))
256 mem = get_Call_mem(call);
258 /* cbrt(0) = 0, cbrt(1) = 1, cbrt(-1) = -1 */
259 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_CBRT);
260 replace_call(op, call, mem, NULL, NULL);
262 } /* i_mapper_cbrt */
264 /* A mapper for the floating point pow. */
265 int i_mapper_pow(ir_node *call, void *ctx) {
268 ir_node *left = get_Call_param(call, 0);
269 ir_node *right = get_Call_param(call, 1);
270 ir_node *block = get_nodes_block(call);
271 ir_node *irn, *reg_jmp = NULL, *exc_jmp = NULL;
274 if (is_Const(left) && is_Const_one(left)) {
275 /* pow (1.0, x) = 1.0 */
277 } else if (is_Const(right)) {
278 tarval *tv = get_Const_tarval(right);
279 if (tarval_is_null(tv)) {
280 /* pow(x, 0.0) = 1.0 */
281 ir_mode *mode = get_tarval_mode(tv);
282 irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
283 } else if (tarval_is_one(tv)) {
284 /* pow(x, 1.0) = x */
286 } else if (tarval_is_minus_one(tv)) {
287 /* pow(x, -1.0) = 1/x */
295 mem = get_Call_mem(call);
296 dbg = get_irn_dbg_info(call);
299 ir_mode *mode = get_irn_mode(left);
302 irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
303 quot = new_rd_Quot(dbg, current_ir_graph, block, mem, irn, left, mode, op_pin_state_pinned);
304 mem = new_r_Proj(current_ir_graph, block, quot, mode_M, pn_Quot_M);
305 irn = new_r_Proj(current_ir_graph, block, quot, mode, pn_Quot_res);
306 reg_jmp = new_r_Proj(current_ir_graph, block, quot, mode_X, pn_Quot_X_regular);
307 exc_jmp = new_r_Proj(current_ir_graph, block, quot, mode_X, pn_Quot_X_except);
309 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_POW);
310 replace_call(irn, call, mem, reg_jmp, exc_jmp);
314 /* A mapper for the floating point exp. */
315 int i_mapper_exp(ir_node *call, void *ctx) {
316 ir_node *val = get_Call_param(call, 0);
319 if (is_Const(val) && is_Const_null(val)) {
321 ir_node *block = get_nodes_block(call);
322 ir_mode *mode = get_irn_mode(val);
323 ir_node *irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
324 ir_node *mem = get_Call_mem(call);
325 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_EXP);
326 replace_call(irn, call, mem, NULL, NULL);
333 * A mapper for mapping f(0.0) to 0.0.
335 static int i_mapper_zero_to_zero(ir_node *call, void *ctx, int reason) {
336 ir_node *val = get_Call_param(call, 0);
339 if (is_Const(val) && is_Const_null(val)) {
341 ir_node *mem = get_Call_mem(call);
342 DBG_OPT_ALGSIM0(call, val, reason);
343 replace_call(val, call, mem, NULL, NULL);
347 } /* i_mapper_zero_to_zero */
350 * A mapper for mapping f(1.0) to 0.0.
352 static int i_mapper_one_to_zero(ir_node *call, void *ctx, int reason) {
353 ir_node *val = get_Call_param(call, 0);
356 if (is_Const(val) && is_Const_one(val)) {
357 /* acos(1.0) = 0.0 */
358 ir_node *block = get_nodes_block(call);
359 ir_mode *mode = get_irn_mode(val);
360 ir_node *irn = new_r_Const(current_ir_graph, block, mode, get_mode_null(mode));
361 ir_node *mem = get_Call_mem(call);
362 DBG_OPT_ALGSIM0(call, irn, reason);
363 replace_call(irn, call, mem, NULL, NULL);
367 } /* i_mapper_one_to_zero */
370 * A mapper for mapping a functions with the following characteristics:
374 static int i_mapper_symmetric_zero_to_one(ir_node *call, void *ctx, int reason) {
375 ir_node *val = get_Call_param(call, 0);
378 if (is_strictConv(val)) {
379 ir_node *op = get_Conv_op(val);
381 /* f(-x) = f(x) with strictConv */
382 ir_node *block = get_nodes_block(call);
383 ir_mode *mode = get_irn_mode(val);
384 dbg_info *dbg = get_irn_dbg_info(val);
386 op = get_Minus_op(op);
387 val = new_rd_Conv(dbg, current_ir_graph, block, op, mode);
390 set_Conv_strict(val, 1);
392 DBG_OPT_ALGSIM2(call, op, call, FS_OPT_RTS_SYMMETRIC);
393 set_Call_param(call, 0, val);
395 } else if (is_Minus(val)) {
397 val = get_Minus_op(val);
398 DBG_OPT_ALGSIM2(call, val, call, FS_OPT_RTS_SYMMETRIC);
399 set_Call_param(call, 0, val);
402 if (is_Const(val) && is_Const_null(val)) {
404 ir_node *block = get_nodes_block(call);
405 ir_mode *mode = get_irn_mode(val);
406 ir_node *irn = new_r_Const(current_ir_graph, block, mode, get_mode_one(mode));
407 ir_node *mem = get_Call_mem(call);
408 DBG_OPT_ALGSIM0(call, irn, reason);
409 replace_call(irn, call, mem, NULL, NULL);
413 } /* i_mapper_symmetric_zero_to_one */
415 /* A mapper for the floating point log. */
416 int i_mapper_log(ir_node *call, void *ctx) {
418 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_LOG);
421 /* A mapper for the floating point sin. */
422 int i_mapper_sin(ir_node *call, void *ctx) {
424 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SIN);
427 /* A mapper for the floating point cos. */
428 int i_mapper_cos(ir_node *call, void *ctx) {
429 /* cos(0.0) = 1.0, cos(-x) = x */
430 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COS);
433 /* A mapper for the floating point tan. */
434 int i_mapper_tan(ir_node *call, void *ctx) {
436 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TAN);
439 /* A mapper for the floating point asin. */
440 int i_mapper_asin(ir_node *call, void *ctx) {
441 /* asin(0.0) = 0.0 */
442 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ASIN);
443 } /* i_mapper_asin */
445 /* A mapper for the floating point acos. */
446 int i_mapper_acos(ir_node *call, void *ctx) {
447 /* acos(1.0) = 0.0 */
448 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_ACOS);
449 } /* i_mapper_acos */
451 /* A mapper for the floating point atan. */
452 int i_mapper_atan(ir_node *call, void *ctx) {
453 /* atan(0.0) = 0.0 */
454 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ATAN);
455 } /* i_mapper_atan */
457 /* A mapper for the floating point sinh. */
458 int i_mapper_sinh(ir_node *call, void *ctx) {
459 /* sinh(0.0) = 0.0 */
460 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SINH);
461 } /* i_mapper_sinh */
463 /* A mapper for the floating point cosh. */
464 int i_mapper_cosh(ir_node *call, void *ctx) {
465 /* cosh(0.0) = 1.0, cosh(-x) = x */
466 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COSH);
467 } /* i_mapper_cosh */
469 /* A mapper for the floating point tanh. */
470 int i_mapper_tanh(ir_node *call, void *ctx) {
471 /* tanh(0.0) = 0.0 */
472 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TANH);
473 } /* i_mapper_tanh */
476 * Return the const entity that is accessed through the pointer ptr or
477 * NULL if there is no entity (or the entity is not constant).
479 * @param ptr the pointer
481 static ir_entity *get_const_entity(ir_node *ptr) {
482 /* FIXME: this cannot handle constant strings inside struct initializers yet */
483 if (is_SymConst_addr_ent(ptr)) {
484 ir_entity *ent = get_SymConst_entity(ptr);
486 if (get_entity_variability(ent) == variability_constant) {
487 /* a constant entity */
492 } /* get_const_entity */
495 * Calculate the value of strlen if possible.
497 * @param ent the entity
498 * @param res_tp the result type
500 * @return a Const node containing the strlen() result or NULL
501 * if the evaluation fails
503 static ir_node *eval_strlen(ir_entity *ent, ir_type *res_tp) {
504 ir_type *tp = get_entity_type(ent);
508 if (! is_Array_type(tp))
510 tp = get_array_element_type(tp);
511 if (! is_Primitive_type(tp))
513 mode = get_type_mode(tp);
515 /* FIXME: This is too restrict, as the type char might be more the 8bits */
516 if (!mode_is_int(mode) || get_mode_size_bits(mode) != get_mode_size_bits(mode_Bs))
519 n = get_compound_ent_n_values(ent);
520 for (i = 0; i < n; ++i) {
521 ir_node *irn = get_compound_ent_value(ent, i);
526 if (is_Const_null(irn)) {
527 /* found the length */
533 tarval *tv = new_tarval_from_long(len, get_type_mode(res_tp));
534 return new_Const_type(tv, res_tp);
539 /* A mapper for strlen */
540 int i_mapper_strlen(ir_node *call, void *ctx) {
541 ir_node *s = get_Call_param(call, 0);
542 ir_entity *ent = get_const_entity(s);
546 /* FIXME: this cannot handle constant strings inside struct initializers yet */
548 /* a constant entity */
549 ir_type *tp = get_Call_type(call);
552 tp = get_method_res_type(tp, 0);
553 irn = eval_strlen(ent, tp);
556 ir_node *mem = get_Call_mem(call);
557 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRLEN);
558 replace_call(irn, call, mem, NULL, NULL);
563 } /* i_mapper_strlen */
566 * Calculate the value of strlen if possible.
568 * @param left the left entity
569 * @param right the right entity
570 * @param res_tp the result type
572 * @return a Const node containing the strcmp() result or NULL
573 * if the evaluation fails
575 static ir_node *eval_strcmp(ir_entity *left, ir_entity *right, ir_type *res_tp) {
580 tp = get_entity_type(left);
581 if (! is_Array_type(tp))
583 tp = get_array_element_type(tp);
584 if (! is_Primitive_type(tp))
586 mode = get_type_mode(tp);
588 /* FIXME: This is too restrict, as the type char might be more the 8bits */
589 if (!mode_is_int(mode) || get_mode_size_bits(mode) != get_mode_size_bits(mode_Bs))
592 tp = get_entity_type(right);
593 if (! is_Array_type(tp))
595 tp = get_array_element_type(tp);
596 if (! is_Primitive_type(tp))
598 mode = get_type_mode(tp);
600 /* FIXME: This is too restrict, as the type char might be more the 8bits */
601 if (!mode_is_int(mode) || get_mode_size_bits(mode) != get_mode_size_bits(mode_Bs))
604 n = get_compound_ent_n_values(left);
605 n_r = get_compound_ent_n_values(right);
608 for (i = 0; i < n; ++i) {
613 irn = get_compound_ent_value(left, i);
616 tv = get_Const_tarval(irn);
617 v_l = get_tarval_long(tv);
619 irn = get_compound_ent_value(right, i);
622 tv = get_Const_tarval(irn);
623 v_r = get_tarval_long(tv);
640 /* we found an end */
641 tarval *tv = new_tarval_from_long(res, get_type_mode(res_tp));
642 return new_Const_type(tv, res_tp);
648 * Checks if an entity represents the empty string.
650 * @param ent the entity
652 * @return non-zero if ent represents the empty string
654 static int is_empty_string(ir_entity *ent) {
655 ir_type *tp = get_entity_type(ent);
660 if (! is_Array_type(tp))
662 tp = get_array_element_type(tp);
663 if (! is_Primitive_type(tp))
665 mode = get_type_mode(tp);
667 /* FIXME: This is too restrict, as the type char might be more the 8bits */
668 if (!mode_is_int(mode) || get_mode_size_bits(mode) != get_mode_size_bits(mode_Bs))
671 n = get_compound_ent_n_values(ent);
674 irn = get_compound_ent_value(ent, 0);
676 return is_Const(irn) && is_Const_null(irn);
677 } /* is_empty_string */
679 /* A mapper for strcmp */
680 int i_mapper_strcmp(ir_node *call, void *ctx) {
681 ir_node *left = get_Call_param(call, 0);
682 ir_node *right = get_Call_param(call, 1);
686 ir_node *adr = get_Call_ptr(call);
687 ir_entity *ent = get_SymConst_entity(adr);
688 ir_type *call_tp = get_entity_type(ent);
689 ir_type *res_tp = get_method_res_type(call_tp, 0);
690 ir_entity *ent_l, *ent_r;
696 /* do some type checks first */
697 if (! is_Primitive_type(res_tp))
699 char_tp = get_method_param_type(call_tp, 0);
700 if (char_tp != get_method_param_type(call_tp, 1))
702 if (! is_Pointer_type(char_tp))
704 char_tp = get_pointer_points_to_type(char_tp);
707 /* a strcmp(s, s) ==> 0 */
708 ir_node *mem = get_Call_mem(call);
709 ir_mode *mode = get_type_mode(res_tp);
710 ir_node *block = get_nodes_block(call);
712 irn = new_r_Const(current_ir_graph, block, mode, get_mode_null(mode));
713 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
714 replace_call(irn, call, mem, NULL, NULL);
717 ent_l = get_const_entity(left);
718 ent_r = get_const_entity(right);
720 if (ent_l != NULL && ent_r != NULL) {
721 /* both entities are const, try to evaluate */
722 irn = eval_strcmp(ent_l, ent_r, res_tp);
723 } else if (ent_l != NULL) {
724 if (is_empty_string(ent_l)) {
725 /* s strcmp("", s) ==> -(*s)*/
727 goto replace_by_call;
729 } else if (ent_r != NULL) {
730 if (is_empty_string(ent_r)) {
731 /* s strcmp(s, "") ==> (*s) */
732 ir_node *mem, *block;
738 mem = get_Call_mem(call);
739 block = get_nodes_block(call);
740 dbg = get_irn_dbg_info(call);
741 mode = get_type_mode(char_tp);
743 /* replace the strcmp by (*x) */
744 irn = new_rd_Load(dbg, current_ir_graph, block, mem, v, mode);
745 mem = new_r_Proj(current_ir_graph, block, irn, mode_M, pn_Load_M);
746 exc = new_r_Proj(current_ir_graph, block, irn, mode_X, pn_Load_X_except);
747 reg = new_r_Proj(current_ir_graph, block, irn, mode_X, pn_Load_X_regular);
748 irn = new_r_Proj(current_ir_graph, block, irn, mode, pn_Load_res);
750 /* conv to the result mode */
751 mode = get_type_mode(res_tp);
752 irn = new_rd_Conv(dbg, current_ir_graph, block, irn, mode);
755 /* negate in the ("", s) case */
756 irn = new_rd_Minus(dbg, current_ir_graph, block, irn, mode);
762 ir_node *mem = get_Call_mem(call);
763 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
764 replace_call(irn, call, mem, reg, exc);
769 } /* i_mapper_strcmp */
771 /* A mapper for strncmp */
772 int i_mapper_strncmp(ir_node *call, void *ctx) {
773 ir_node *left = get_Call_param(call, 0);
774 ir_node *right = get_Call_param(call, 1);
775 ir_node *len = get_Call_param(call, 2);
779 if (left == right || (is_Const(len) && is_Const_null(len))) {
780 /* a strncmp(s, s, len) ==> 0 OR
781 a strncmp(a, b, 0) ==> 0 */
782 ir_node *mem = get_Call_mem(call);
783 ir_node *adr = get_Call_ptr(call);
784 ir_entity *ent = get_SymConst_entity(adr);
785 ir_type *call_tp = get_entity_type(ent);
786 ir_type *res_tp = get_method_res_type(call_tp, 0);
787 ir_mode *mode = get_type_mode(res_tp);
788 ir_node *block = get_nodes_block(call);
790 irn = new_r_Const(current_ir_graph, block, mode, get_mode_null(mode));
791 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRNCMP);
792 replace_call(irn, call, mem, NULL, NULL);
796 } /* i_mapper_strncmp */
798 /* A mapper for memcpy */
799 int i_mapper_memcpy(ir_node *call, void *ctx) {
800 ir_node *len = get_Call_param(call, 2);
803 if (is_Const(len) && is_Const_null(len)) {
804 /* a memcpy(d, s, 0) ==> d */
805 ir_node *mem = get_Call_mem(call);
806 ir_node *dst = get_Call_param(call, 0);
808 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMCPY);
809 replace_call(dst, call, mem, NULL, NULL);
813 } /* i_mapper_memcpy */
815 /* A mapper for memset */
816 int i_mapper_memset(ir_node *call, void *ctx) {
817 ir_node *len = get_Call_param(call, 2);
820 if (is_Const(len) && is_Const_null(len)) {
821 /* a memset(d, C, 0) ==> d */
822 ir_node *mem = get_Call_mem(call);
823 ir_node *dst = get_Call_param(call, 0);
825 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMSET);
826 replace_call(dst, call, mem, NULL, NULL);
830 } /* i_mapper_memset */
833 * Returns the result mode of a node.
835 static ir_mode *get_irn_res_mode(ir_node *node) {
836 switch (get_irn_opcode(node)) {
837 case iro_Load: return get_Load_mode(node);
838 case iro_Quot: return get_Quot_resmode(node);
839 case iro_Div: return get_Div_resmode(node);
840 case iro_Mod: return get_Mod_resmode(node);
841 case iro_DivMod: return get_DivMod_resmode(node);
842 default: return NULL;
844 } /* get_irn_res_mode */
846 #define LMAX(a, b) ((a) > (b) ? (a) : (b))
848 /* A mapper for mapping unsupported instructions to runtime calls. */
849 int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt) {
850 int i, j, arity, first, n_param, n_res;
853 ir_node *mem, *bl, *call, *addr, *res_proj;
857 ir_mode *mode = get_irn_mode(node);
859 if (mode != rt->mode)
861 /* check if the result modes match */
862 if (mode == mode_T && rt->res_mode != NULL) {
863 mode = get_irn_res_mode(node);
864 if (mode != rt->res_mode)
868 arity = get_irn_arity(node);
872 mtp = get_entity_type(rt->ent);
873 n_param = get_method_n_params(mtp);
874 irg = current_ir_graph;
876 mem = get_irn_n(node, 0);
877 if (get_irn_mode(mem) != mode_M) {
878 mem = new_r_NoMem(irg);
883 /* check if the modes of the predecessors match the parameter modes */
884 if (arity - first != n_param)
887 for (i = first, j = 0; i < arity; ++i, ++j) {
888 ir_type *param_tp = get_method_param_type(mtp, j);
889 ir_node *pred = get_irn_n(node, i);
891 if (get_type_mode(param_tp) != get_irn_mode(pred))
895 n_res = get_method_n_ress(mtp);
897 /* step 0: calculate the number of needed Proj's */
899 n_proj = LMAX(n_proj, rt->mem_proj_nr + 1);
900 n_proj = LMAX(n_proj, rt->regular_proj_nr + 1);
901 n_proj = LMAX(n_proj, rt->exc_proj_nr + 1);
902 n_proj = LMAX(n_proj, rt->exc_mem_proj_nr + 1);
903 n_proj = LMAX(n_proj, rt->res_proj_nr + 1);
906 if (rt->mode != mode_T) /* must be mode_T */
911 if (get_type_mode(get_method_res_type(mtp, 0)) != rt->mode)
915 /* ok, when we are here, the number of predecessors match as well as the parameter modes */
916 bl = get_nodes_block(node);
920 NEW_ARR_A(ir_node *, in, n_param);
921 for (i = 0; i < n_param; ++i)
922 in[i] = get_irn_n(node, first + i);
925 /* step 1: create the call */
926 sym.entity_p = rt->ent;
927 addr = new_r_SymConst(irg, bl, mode_P_code, sym, symconst_addr_ent);
928 call = new_rd_Call(get_irn_dbg_info(node), irg, bl, mem, addr, n_param, in, mtp);
929 set_irn_pinned(call, get_irn_pinned(node));
932 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
940 turn_into_tuple(node, n_proj);
942 for (i = 0; i < n_proj; ++i)
943 set_Tuple_pred(node, i, new_r_Bad(irg));
944 if (rt->mem_proj_nr >= 0)
945 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_regular));
946 if (get_irn_op(mem) != op_NoMem) {
947 /* Exceptions can only be handled with real memory */
948 if (rt->regular_proj_nr >= 0)
949 set_Tuple_pred(node, rt->regular_proj_nr, new_r_Proj(irg, bl, call, mode_X, pn_Call_X_regular));
950 if (rt->exc_proj_nr >= 0)
951 set_Tuple_pred(node, rt->exc_proj_nr, new_r_Proj(irg, bl, call, mode_X, pn_Call_X_except));
952 if (rt->exc_mem_proj_nr >= 0)
953 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(irg, bl, call, mode_M, pn_Call_M_except));
956 if (rt->res_proj_nr >= 0)
957 for (i = 0; i < n_res; ++i)
958 set_Tuple_pred(node, rt->res_proj_nr + i,
959 new_r_Proj(irg, bl, res_proj, get_type_mode(get_method_res_type(mtp, i)), i));
962 /* only one return value supported */
964 ir_mode *mode = get_type_mode(get_method_res_type(mtp, 0));
966 res_proj = new_r_Proj(irg, bl, call, mode_T, pn_Call_T_result);
967 res_proj = new_r_Proj(irg, bl, res_proj, mode, 0);
969 exchange(node, res_proj);
973 /* should not happen */
975 } /* i_mapper_RuntimeCall */