2 * Copyright (C) 1995-2011 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"
48 /** Walker environment. */
49 typedef struct walker_env {
50 pmap *c_map; /**< The intrinsic call map. */
51 size_t nr_of_intrinsics; /**< statistics */
52 i_instr_record **i_map; /**< The intrinsic instruction map. */
56 * walker: call all mapper functions
58 static void call_mapper(ir_node *node, void *env)
60 walker_env_t *wenv = (walker_env_t*)env;
61 ir_op *op = get_irn_op(node);
66 const i_call_record *r;
69 symconst = get_Call_ptr(node);
70 if (! is_SymConst_addr_ent(symconst))
73 ent = get_SymConst_entity(symconst);
74 p = pmap_find(wenv->c_map, ent);
77 r = (const i_call_record*)p->value;
78 wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
81 if (op->code < (unsigned) ARR_LEN(wenv->i_map)) {
82 const i_instr_record *r = wenv->i_map[op->code];
83 /* run all possible mapper */
85 if (r->i_mapper(node, r->ctx)) {
86 ++wenv->nr_of_intrinsics;
89 r = (const i_instr_record*)r->link;
95 size_t lower_intrinsics(i_record *list, size_t length, int part_block_used)
98 size_t n_ops = get_irp_n_opcodes();
100 pmap *c_map = pmap_create_ex(length);
101 i_instr_record **i_map;
102 size_t nr_of_intrinsics = 0;
105 /* we use the ir_op generic pointers here */
106 NEW_ARR_A(i_instr_record *, i_map, n_ops);
107 memset((void *)i_map, 0, sizeof(*i_map) * n_ops);
109 /* fill a map for faster search */
110 for (i = 0; i < length; ++i) {
111 if (list[i].i_call.kind == INTRINSIC_CALL) {
112 pmap_insert(c_map, list[i].i_call.i_ent, (void *)&list[i].i_call);
114 ir_op *op = list[i].i_instr.op;
115 assert(op->code < (unsigned) ARR_LEN(i_map));
117 list[i].i_instr.link = i_map[op->code];
118 i_map[op->code] = &list[i].i_instr;
125 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
126 irg = get_irp_irg(i);
128 if (part_block_used) {
129 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_PHI_LIST);
130 collect_phiprojs(irg);
133 wenv.nr_of_intrinsics = 0;
134 irg_walk_graph(irg, NULL, call_mapper, &wenv);
137 ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_PHI_LIST);
139 if (wenv.nr_of_intrinsics > 0) {
140 /* Changes detected: we might have added/removed nodes. */
141 set_irg_callee_info_state(irg, irg_callee_info_inconsistent);
143 /* Exception control flow might have changed / new block might have added. */
144 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE
145 | IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS);
148 irg_verify(irg, VERIFY_NORMAL);
150 nr_of_intrinsics += wenv.nr_of_intrinsics;
155 return nr_of_intrinsics;
158 typedef struct pass_t {
167 * Wrapper for running lower_intrinsics() as an ir_prog pass.
169 static int pass_wrapper(ir_prog *irp, void *context)
171 pass_t *pass = (pass_t*)context;
172 (void) irp; /* TODO: set current irp, or remove parameter */
173 lower_intrinsics(pass->list, pass->length, pass->part_block_used);
174 /* probably this pass should not run again */
179 * Creates an ir_prog pass for lower_intrinsics.
181 * @param name the name of this pass or NULL
182 * @param list an array of intrinsic map records
183 * @param length the length of the array
184 * @param part_block_used set to true if part_block() must be using during lowering
186 ir_prog_pass_t *lower_intrinsics_pass(
188 i_record *list, size_t length, int part_block_used)
190 pass_t *const pass = XMALLOCF(pass_t, list, length);
191 memcpy(pass->list, list, sizeof(list[0]) * length);
192 pass->length = length;
193 pass->part_block_used = part_block_used;
195 return def_prog_pass_constructor(
196 &pass->pass, name ? name : "lower_intrinsics", pass_wrapper);
200 * Helper function, replace the call by the given node.
202 * @param irn the result node
203 * @param call the call to replace
204 * @param mem the new mem result
205 * @param reg_jmp new regular control flow, if NULL, a Jmp will be used
206 * @param exc_jmp new exception control flow, if reg_jmp == NULL, a Bad will be used
208 static void replace_call(ir_node *irn, ir_node *call, ir_node *mem,
209 ir_node *reg_jmp, ir_node *exc_jmp)
211 ir_node *block = get_nodes_block(call);
212 ir_graph *irg = get_irn_irg(block);
213 ir_node *rest = new_r_Tuple(block, 1, &irn);
215 if (ir_throws_exception(call)) {
216 turn_into_tuple(call, pn_Call_max+1);
217 if (reg_jmp == NULL) {
218 reg_jmp = new_r_Jmp(block);
220 if (exc_jmp == NULL) {
221 exc_jmp = new_r_Bad(irg, mode_X);
223 set_Tuple_pred(call, pn_Call_X_regular, reg_jmp);
224 set_Tuple_pred(call, pn_Call_X_except, exc_jmp);
226 assert(reg_jmp == NULL);
227 assert(exc_jmp == NULL);
228 turn_into_tuple(call, pn_Call_T_result+1);
229 assert(pn_Call_M <= pn_Call_T_result);
230 assert(pn_Call_X_regular > pn_Call_T_result);
231 assert(pn_Call_X_except > pn_Call_T_result);
233 set_Tuple_pred(call, pn_Call_M, mem);
234 set_Tuple_pred(call, pn_Call_T_result, rest);
237 int i_mapper_abs(ir_node *call, void *ctx)
239 ir_node *mem = get_Call_mem(call);
240 ir_node *block = get_nodes_block(call);
241 ir_node *op = get_Call_param(call, 0);
242 ir_graph *irg = get_irn_irg(call);
243 ir_mode *mode = get_irn_mode(op);
244 dbg_info *dbg = get_irn_dbg_info(call);
245 ir_node *zero = new_r_Const(irg, get_mode_null(mode));
246 ir_node *cmp = new_rd_Cmp(dbg, block, op, zero, ir_relation_less);
247 ir_node *minus_op = new_rd_Minus(dbg, block, op, mode);
249 arch_allow_ifconv_func allow_ifconv = be_get_backend_param()->allow_ifconv;
252 /* mux allowed by backend? */
253 if (!allow_ifconv(cmp, op, minus_op))
257 mux = new_rd_Mux(dbg, block, cmp, op, minus_op, mode);
258 DBG_OPT_ALGSIM0(call, mux, FS_OPT_RTS_ABS);
259 replace_call(mux, call, mem, NULL, NULL);
263 int i_mapper_bswap(ir_node *call, void *ctx)
265 ir_node *mem = get_Call_mem(call);
266 ir_node *block = get_nodes_block(call);
267 ir_node *op = get_Call_param(call, 0);
268 ir_type *tp = get_Call_type(call);
269 dbg_info *dbg = get_irn_dbg_info(call);
273 irn = new_rd_Builtin(dbg, block, get_irg_no_mem(current_ir_graph), 1, &op, ir_bk_bswap, tp);
274 set_irn_pinned(irn, op_pin_state_floats);
275 irn = new_r_Proj(irn, get_irn_mode(op), pn_Builtin_max+1);
276 replace_call(irn, call, mem, NULL, NULL);
280 int i_mapper_alloca(ir_node *call, void *ctx)
282 ir_node *mem = get_Call_mem(call);
283 ir_node *block = get_nodes_block(call);
284 ir_node *op = get_Call_param(call, 0);
285 ir_node *irn, *exc, *no_exc;
286 dbg_info *dbg = get_irn_dbg_info(call);
289 if (mode_is_signed(get_irn_mode(op))) {
290 ir_mode *mode = get_irn_mode(op);
291 mode = find_unsigned_mode(mode);
293 panic("Cannot find unsigned mode for %M", mode);
295 op = new_rd_Conv(dbg, block, op, mode);
298 irn = new_rd_Alloc(dbg, block, mem, op, firm_unknown_type, stack_alloc);
299 mem = new_rd_Proj(dbg, irn, mode_M, pn_Alloc_M);
300 irn = new_rd_Proj(dbg, irn, get_modeP_data(), pn_Alloc_res);
301 if (ir_throws_exception(call)) {
302 no_exc = new_rd_Proj(dbg, irn, mode_X, pn_Alloc_X_regular);
303 exc = new_rd_Proj(dbg, irn, mode_X, pn_Alloc_X_except);
304 ir_set_throws_exception(irn, true);
310 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_ALLOCA);
311 replace_call(irn, call, mem, no_exc, exc);
315 int i_mapper_sqrt(ir_node *call, void *ctx)
319 ir_node *op = get_Call_param(call, 0);
325 tv = get_Const_tarval(op);
326 if (! tarval_is_null(tv) && !tarval_is_one(tv))
329 mem = get_Call_mem(call);
331 /* sqrt(0) = 0, sqrt(1) = 1 */
332 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_SQRT);
333 replace_call(op, call, mem, NULL, NULL);
337 int i_mapper_cbrt(ir_node *call, void *ctx)
341 ir_node *op = get_Call_param(call, 0);
347 tv = get_Const_tarval(op);
348 if (! tarval_is_null(tv) && !tarval_is_one(tv) && !tarval_is_minus_one(tv))
351 mem = get_Call_mem(call);
353 /* cbrt(0) = 0, cbrt(1) = 1, cbrt(-1) = -1 */
354 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_CBRT);
355 replace_call(op, call, mem, NULL, NULL);
359 int i_mapper_pow(ir_node *call, void *ctx)
361 ir_node *left = get_Call_param(call, 0);
362 ir_node *right = get_Call_param(call, 1);
363 ir_node *block = get_nodes_block(call);
364 ir_graph *irg = get_irn_irg(block);
365 ir_node *reg_jmp = NULL;
366 ir_node *exc_jmp = NULL;
372 if (is_Const(left) && is_Const_one(left)) {
373 /* pow (1.0, x) = 1.0 */
375 } else if (is_Const(right)) {
376 ir_tarval *tv = get_Const_tarval(right);
377 if (tarval_is_null(tv)) {
378 /* pow(x, 0.0) = 1.0 */
379 ir_mode *mode = get_tarval_mode(tv);
380 irn = new_r_Const(irg, get_mode_one(mode));
381 } else if (tarval_is_one(tv)) {
382 /* pow(x, 1.0) = x */
384 } else if (tarval_is_minus_one(tv)) {
385 /* pow(x, -1.0) = 1/x */
393 mem = get_Call_mem(call);
394 dbg = get_irn_dbg_info(call);
397 ir_mode *mode = get_irn_mode(left);
400 irn = new_r_Const(irg, get_mode_one(mode));
401 div = new_rd_Div(dbg, block, mem, irn, left, mode, op_pin_state_pinned);
402 mem = new_r_Proj(div, mode_M, pn_Div_M);
403 irn = new_r_Proj(div, mode, pn_Div_res);
404 if (ir_throws_exception(call)) {
405 reg_jmp = new_r_Proj(div, mode_X, pn_Div_X_regular);
406 exc_jmp = new_r_Proj(div, mode_X, pn_Div_X_except);
407 ir_set_throws_exception(div, true);
410 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_POW);
411 replace_call(irn, call, mem, reg_jmp, exc_jmp);
415 int i_mapper_exp(ir_node *call, void *ctx)
417 ir_node *val = get_Call_param(call, 0);
420 if (is_Const(val) && is_Const_null(val)) {
422 ir_graph *irg = get_irn_irg(val);
423 ir_mode *mode = get_irn_mode(val);
424 ir_node *irn = new_r_Const(irg, get_mode_one(mode));
425 ir_node *mem = get_Call_mem(call);
426 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_EXP);
427 replace_call(irn, call, mem, NULL, NULL);
434 * A mapper for mapping f(0.0) to 0.0.
436 static int i_mapper_zero_to_zero(ir_node *call, void *ctx, int reason)
438 ir_node *val = get_Call_param(call, 0);
441 if (is_Const(val) && is_Const_null(val)) {
443 ir_node *mem = get_Call_mem(call);
444 DBG_OPT_ALGSIM0(call, val, reason);
445 replace_call(val, call, mem, NULL, NULL);
452 * A mapper for mapping f(1.0) to 0.0.
454 static int i_mapper_one_to_zero(ir_node *call, void *ctx, int reason)
456 ir_node *val = get_Call_param(call, 0);
459 if (is_Const(val) && is_Const_one(val)) {
460 /* acos(1.0) = 0.0 */
461 ir_graph *irg = get_irn_irg(val);
462 ir_mode *mode = get_irn_mode(val);
463 ir_node *irn = new_r_Const(irg, get_mode_null(mode));
464 ir_node *mem = get_Call_mem(call);
465 DBG_OPT_ALGSIM0(call, irn, reason);
466 replace_call(irn, call, mem, NULL, NULL);
473 * A mapper for mapping a functions with the following characteristics:
477 static int i_mapper_symmetric_zero_to_one(ir_node *call, void *ctx, int reason)
480 ir_node *val = get_Call_param(call, 0);
483 if (is_strictConv(val)) {
484 ir_node *op = get_Conv_op(val);
486 /* f(-x) = f(x) with strictConv */
487 ir_node *block = get_nodes_block(call);
488 ir_mode *mode = get_irn_mode(val);
489 dbg_info *dbg = get_irn_dbg_info(val);
491 op = get_Minus_op(op);
492 val = new_rd_Conv(dbg, block, op, mode);
495 set_Conv_strict(val, 1);
497 DBG_OPT_ALGSIM2(call, op, call, FS_OPT_RTS_SYMMETRIC);
498 set_Call_param(call, 0, val);
501 } else if (is_Minus(val)) {
503 val = get_Minus_op(val);
504 DBG_OPT_ALGSIM2(call, val, call, FS_OPT_RTS_SYMMETRIC);
505 set_Call_param(call, 0, val);
509 if (is_Const(val) && is_Const_null(val)) {
511 ir_graph *irg = get_irn_irg(val);
512 ir_mode *mode = get_irn_mode(val);
513 ir_node *irn = new_r_Const(irg, get_mode_one(mode));
514 ir_node *mem = get_Call_mem(call);
515 DBG_OPT_ALGSIM0(call, irn, reason);
516 replace_call(irn, call, mem, NULL, NULL);
522 int i_mapper_log(ir_node *call, void *ctx)
525 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_LOG);
528 int i_mapper_sin(ir_node *call, void *ctx)
531 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SIN);
534 int i_mapper_cos(ir_node *call, void *ctx)
536 /* cos(0.0) = 1.0, cos(-x) = x */
537 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COS);
540 int i_mapper_tan(ir_node *call, void *ctx)
543 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TAN);
546 int i_mapper_asin(ir_node *call, void *ctx)
548 /* asin(0.0) = 0.0 */
549 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ASIN);
552 int i_mapper_acos(ir_node *call, void *ctx)
554 /* acos(1.0) = 0.0 */
555 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_ACOS);
558 int i_mapper_atan(ir_node *call, void *ctx)
560 /* atan(0.0) = 0.0 */
561 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ATAN);
564 int i_mapper_sinh(ir_node *call, void *ctx)
566 /* sinh(0.0) = 0.0 */
567 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SINH);
570 int i_mapper_cosh(ir_node *call, void *ctx)
572 /* cosh(0.0) = 1.0, cosh(-x) = x */
573 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COSH);
576 int i_mapper_tanh(ir_node *call, void *ctx)
578 /* tanh(0.0) = 0.0 */
579 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TANH);
583 * Return the const entity that is accessed through the pointer ptr or
584 * NULL if there is no entity (or the entity is not constant).
586 * @param ptr the pointer
588 static ir_entity *get_const_entity(ir_node *ptr)
590 if (is_SymConst_addr_ent(ptr)) {
591 ir_entity *ent = get_SymConst_entity(ptr);
593 if (get_entity_linkage(ent) & IR_LINKAGE_CONSTANT) {
594 /* a constant entity */
601 static bool initializer_val_is_null(ir_initializer_t *init)
605 if (get_initializer_kind(init) == IR_INITIALIZER_NULL)
608 if (get_initializer_kind(init) == IR_INITIALIZER_TARVAL) {
609 tv = get_initializer_tarval_value(init);
610 } else if (get_initializer_kind(init) == IR_INITIALIZER_CONST) {
611 ir_node *irn = get_initializer_const_value(init);
614 tv = get_Const_tarval(irn);
619 return tarval_is_null(tv);
623 * Calculate the value of strlen if possible.
625 * @param ent the entity
626 * @param res_tp the result type
628 * @return a Const node containing the strlen() result or NULL
629 * if the evaluation fails
631 static ir_node *eval_strlen(ir_graph *irg, ir_entity *ent, ir_type *res_tp)
633 ir_type *tp = get_entity_type(ent);
635 ir_initializer_t *initializer;
639 if (! is_Array_type(tp))
641 tp = get_array_element_type(tp);
642 if (! is_Primitive_type(tp))
644 mode = get_type_mode(tp);
646 /* FIXME: This is too restrict, as the type char might be more the 8bits */
647 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
650 if (!has_entity_initializer(ent)) {
653 n = get_compound_ent_n_values(ent);
654 for (i = 0; i < n; ++i) {
655 ir_node *irn = get_compound_ent_value(ent, i);
660 if (is_Const_null(irn)) {
661 /* found the length */
662 ir_tarval *tv = new_tarval_from_long(i, get_type_mode(res_tp));
663 return new_r_Const(irg, tv);
669 initializer = get_entity_initializer(ent);
670 if (get_initializer_kind(initializer) != IR_INITIALIZER_COMPOUND)
673 size = get_initializer_compound_n_entries(initializer);
674 for (i = 0; i < size; ++i) {
675 ir_initializer_t *val = get_initializer_compound_value(initializer, i);
676 if (initializer_val_is_null(val)) {
677 ir_tarval *tv = new_tarval_from_long(i, get_type_mode(res_tp));
678 return new_r_Const(irg, tv);
685 int i_mapper_strlen(ir_node *call, void *ctx)
687 ir_node *s = get_Call_param(call, 0);
688 ir_entity *ent = get_const_entity(s);
692 /* FIXME: this cannot handle constant strings inside struct initializers yet */
694 /* a constant entity */
695 ir_type *tp = get_Call_type(call);
698 tp = get_method_res_type(tp, 0);
699 irn = eval_strlen(get_irn_irg(call), ent, tp);
702 ir_node *mem = get_Call_mem(call);
703 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRLEN);
704 replace_call(irn, call, mem, NULL, NULL);
712 * Calculate the value of strlen if possible.
714 * @param left the left entity
715 * @param right the right entity
716 * @param res_tp the result type
718 * @return a Const node containing the strcmp() result or NULL
719 * if the evaluation fails
721 static ir_node *eval_strcmp(ir_graph *irg, ir_entity *left, ir_entity *right,
727 tp = get_entity_type(left);
728 if (! is_Array_type(tp))
730 tp = get_array_element_type(tp);
731 if (! is_Primitive_type(tp))
733 mode = get_type_mode(tp);
735 /* FIXME: This is too restrict, as the type char might be more the 8bits */
736 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
739 tp = get_entity_type(right);
740 if (! is_Array_type(tp))
742 tp = get_array_element_type(tp);
743 if (! is_Primitive_type(tp))
745 mode = get_type_mode(tp);
747 /* FIXME: This is too restrict, as the type char might be more the 8bits */
748 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
751 if (!has_entity_initializer(left) && !has_entity_initializer(right)) {
752 /* code that uses deprecated compound_graph_path stuff */
753 size_t n = get_compound_ent_n_values(left);
754 size_t n_r = get_compound_ent_n_values(right);
760 for (i = 0; i < n; ++i) {
765 irn = get_compound_ent_value(left, i);
768 tv = get_Const_tarval(irn);
769 v_l = get_tarval_long(tv);
771 irn = get_compound_ent_value(right, i);
774 tv = get_Const_tarval(irn);
775 v_r = get_tarval_long(tv);
792 /* we found an end */
793 ir_tarval *tv = new_tarval_from_long(res, get_type_mode(res_tp));
794 return new_r_Const(irg, tv);
805 * Checks if an entity represents the empty string.
807 * @param ent the entity
809 * @return non-zero if ent represents the empty string
811 static int is_empty_string(ir_entity *ent)
813 ir_type *tp = get_entity_type(ent);
816 ir_initializer_t *initializer;
817 ir_initializer_t *init0;
819 if (! is_Array_type(tp))
821 tp = get_array_element_type(tp);
822 if (! is_Primitive_type(tp))
824 mode = get_type_mode(tp);
826 /* FIXME: This is too restrict, as the type char might be more the 8bits */
827 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
830 if (!has_entity_initializer(ent)) {
831 /* code for deprecated compound_graph_path stuff */
832 size_t n = get_compound_ent_n_values(ent);
835 irn = get_compound_ent_value(ent, 0);
837 return is_Const(irn) && is_Const_null(irn);
840 initializer = get_entity_initializer(ent);
841 if (get_initializer_kind(initializer) != IR_INITIALIZER_COMPOUND)
844 if (get_initializer_compound_n_entries(initializer) < 1)
847 init0 = get_initializer_compound_value(initializer, 0);
848 return initializer_val_is_null(init0);
851 int i_mapper_strcmp(ir_node *call, void *ctx)
853 ir_node *left = get_Call_param(call, 0);
854 ir_node *right = get_Call_param(call, 1);
858 ir_type *call_tp = get_Call_type(call);
859 ir_type *res_tp = get_method_res_type(call_tp, 0);
860 ir_entity *ent_l, *ent_r;
866 /* do some type checks first */
867 if (! is_Primitive_type(res_tp))
869 char_tp = get_method_param_type(call_tp, 0);
870 if (char_tp != get_method_param_type(call_tp, 1))
872 if (! is_Pointer_type(char_tp))
874 char_tp = get_pointer_points_to_type(char_tp);
877 /* a strcmp(s, s) ==> 0 */
878 ir_graph *irg = get_irn_irg(call);
879 ir_node *mem = get_Call_mem(call);
880 ir_mode *mode = get_type_mode(res_tp);
882 irn = new_r_Const(irg, get_mode_null(mode));
883 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
884 replace_call(irn, call, mem, NULL, NULL);
887 ent_l = get_const_entity(left);
888 ent_r = get_const_entity(right);
890 if (ent_l != NULL && ent_r != NULL) {
891 /* both entities are const, try to evaluate */
892 irn = eval_strcmp(get_irn_irg(call), ent_l, ent_r, res_tp);
893 } else if (ent_l != NULL) {
894 if (is_empty_string(ent_l)) {
895 /* s strcmp("", s) ==> -(*s)*/
897 goto replace_by_call;
899 } else if (ent_r != NULL) {
900 if (is_empty_string(ent_r)) {
901 /* s strcmp(s, "") ==> (*s) */
902 ir_node *mem, *block;
908 mem = get_Call_mem(call);
909 block = get_nodes_block(call);
910 dbg = get_irn_dbg_info(call);
911 mode = get_type_mode(char_tp);
913 /* replace the strcmp by (*x) */
914 irn = new_rd_Load(dbg, block, mem, v, mode, cons_none);
915 mem = new_r_Proj(irn, mode_M, pn_Load_M);
916 irn = new_r_Proj(irn, mode, pn_Load_res);
917 if (ir_throws_exception(call)) {
918 exc = new_r_Proj(irn, mode_X, pn_Load_X_except);
919 reg = new_r_Proj(irn, mode_X, pn_Load_X_regular);
920 ir_set_throws_exception(irn, true);
926 /* conv to the result mode */
927 mode = get_type_mode(res_tp);
928 irn = new_rd_Conv(dbg, block, irn, mode);
931 /* negate in the ("", s) case */
932 irn = new_rd_Minus(dbg, block, irn, mode);
938 ir_node *mem = get_Call_mem(call);
939 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
940 replace_call(irn, call, mem, reg, exc);
947 int i_mapper_strncmp(ir_node *call, void *ctx)
949 ir_node *left = get_Call_param(call, 0);
950 ir_node *right = get_Call_param(call, 1);
951 ir_node *len = get_Call_param(call, 2);
955 if (left == right || (is_Const(len) && is_Const_null(len))) {
956 /* a strncmp(s, s, len) ==> 0 OR
957 a strncmp(a, b, 0) ==> 0 */
958 ir_graph *irg = get_irn_irg(call);
959 ir_node *mem = get_Call_mem(call);
960 ir_node *adr = get_Call_ptr(call);
961 ir_entity *ent = get_SymConst_entity(adr);
962 ir_type *call_tp = get_entity_type(ent);
963 ir_type *res_tp = get_method_res_type(call_tp, 0);
964 ir_mode *mode = get_type_mode(res_tp);
966 irn = new_r_Const(irg, get_mode_null(mode));
967 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRNCMP);
968 replace_call(irn, call, mem, NULL, NULL);
974 int i_mapper_strcpy(ir_node *call, void *ctx)
976 ir_node *dst = get_Call_param(call, 0);
977 ir_node *src = get_Call_param(call, 1);
981 /* a strcpy(d, s) ==> d */
982 ir_node *mem = get_Call_mem(call);
983 ir_node *dst = get_Call_param(call, 0);
985 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_STRCPY);
986 replace_call(dst, call, mem, NULL, NULL);
992 int i_mapper_memcpy(ir_node *call, void *ctx)
994 ir_node *dst = get_Call_param(call, 0);
995 ir_node *src = get_Call_param(call, 1);
996 ir_node *len = get_Call_param(call, 2);
999 if (dst == src || (is_Const(len) && is_Const_null(len))) {
1000 /* a memcpy(d, d, len) ==> d OR
1001 a memcpy(d, s, 0) ==> d */
1002 ir_node *mem = get_Call_mem(call);
1004 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMCPY);
1005 replace_call(dst, call, mem, NULL, NULL);
1011 int i_mapper_mempcpy(ir_node *call, void *ctx)
1013 ir_node *dst = get_Call_param(call, 0);
1014 ir_node *src = get_Call_param(call, 1);
1015 ir_node *len = get_Call_param(call, 2);
1018 if (dst == src || (is_Const(len) && is_Const_null(len))) {
1019 /* a memcpy(d, d, len) ==> d + len OR
1020 a memcpy(d, s, 0) ==> d + 0 */
1021 dbg_info *dbg = get_irn_dbg_info(call);
1022 ir_node *mem = get_Call_mem(call);
1023 ir_node *blk = get_nodes_block(call);
1024 ir_mode *mode = get_irn_mode(dst);
1025 ir_node *res = new_rd_Add(dbg, blk, dst, len, mode);
1027 DBG_OPT_ALGSIM0(call, res, FS_OPT_RTS_MEMPCPY);
1028 replace_call(res, call, mem, NULL, NULL);
1034 int i_mapper_memmove(ir_node *call, void *ctx)
1036 ir_node *dst = get_Call_param(call, 0);
1037 ir_node *src = get_Call_param(call, 1);
1038 ir_node *len = get_Call_param(call, 2);
1041 if (dst == src || (is_Const(len) && is_Const_null(len))) {
1042 /* a memmove(d, d, len) ==> d OR
1043 a memmove(d, s, 0) ==> d */
1044 ir_node *mem = get_Call_mem(call);
1046 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMMOVE);
1047 replace_call(dst, call, mem, NULL, NULL);
1053 int i_mapper_memset(ir_node *call, void *ctx)
1055 ir_node *len = get_Call_param(call, 2);
1058 if (is_Const(len) && is_Const_null(len)) {
1059 /* a memset(d, C, 0) ==> d */
1060 ir_node *mem = get_Call_mem(call);
1061 ir_node *dst = get_Call_param(call, 0);
1063 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMSET);
1064 replace_call(dst, call, mem, NULL, NULL);
1070 int i_mapper_memcmp(ir_node *call, void *ctx)
1072 ir_node *left = get_Call_param(call, 0);
1073 ir_node *right = get_Call_param(call, 1);
1074 ir_node *len = get_Call_param(call, 2);
1078 if (left == right || (is_Const(len) && is_Const_null(len))) {
1079 /* a memcmp(s, s, len) ==> 0 OR
1080 a memcmp(a, b, 0) ==> 0 */
1081 ir_graph *irg = get_irn_irg(call);
1082 ir_node *mem = get_Call_mem(call);
1083 ir_node *adr = get_Call_ptr(call);
1084 ir_entity *ent = get_SymConst_entity(adr);
1085 ir_type *call_tp = get_entity_type(ent);
1086 ir_type *res_tp = get_method_res_type(call_tp, 0);
1087 ir_mode *mode = get_type_mode(res_tp);
1089 irn = new_r_Const(irg, get_mode_null(mode));
1090 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRNCMP);
1091 replace_call(irn, call, mem, NULL, NULL);
1098 * Returns the result mode of a node.
1100 static ir_mode *get_irn_res_mode(ir_node *node)
1102 switch (get_irn_opcode(node)) {
1103 case iro_Load: return get_Load_mode(node);
1104 case iro_Div: return get_Div_resmode(node);
1105 case iro_Mod: return get_Mod_resmode(node);
1106 default: return NULL;
1110 int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt)
1112 int i, j, arity, first, n_param, n_res;
1115 ir_node *mem, *bl, *call, *addr, *res_proj;
1117 bool throws_exception;
1120 symconst_symbol sym;
1121 ir_mode *mode = get_irn_mode(node);
1123 if (mode != rt->mode)
1125 /* check if the result modes match */
1126 if (mode == mode_T && rt->res_mode != NULL) {
1127 mode = get_irn_res_mode(node);
1128 if (mode != rt->res_mode)
1132 arity = get_irn_arity(node);
1136 mtp = get_entity_type(rt->ent);
1137 n_param = get_method_n_params(mtp);
1138 irg = current_ir_graph;
1140 mem = get_irn_n(node, 0);
1141 if (get_irn_mode(mem) != mode_M) {
1142 mem = new_r_NoMem(irg);
1147 /* check if the modes of the predecessors match the parameter modes */
1148 if (arity - first != n_param)
1151 for (i = first, j = 0; i < arity; ++i, ++j) {
1152 ir_type *param_tp = get_method_param_type(mtp, j);
1153 ir_node *pred = get_irn_n(node, i);
1155 if (get_type_mode(param_tp) != get_irn_mode(pred))
1159 n_res = get_method_n_ress(mtp);
1160 throws_exception = ir_throws_exception(node);
1162 /* step 0: calculate the number of needed Proj's */
1164 n_proj = MAX(n_proj, rt->mem_proj_nr + 1);
1165 n_proj = MAX(n_proj, rt->res_proj_nr + 1);
1166 if (throws_exception) {
1167 n_proj = MAX(n_proj, rt->regular_proj_nr + 1);
1168 n_proj = MAX(n_proj, rt->exc_proj_nr + 1);
1172 if (rt->mode != mode_T) /* must be mode_T */
1177 if (get_type_mode(get_method_res_type(mtp, 0)) != rt->mode)
1181 /* ok, when we are here, the number of predecessors match as well as the parameter modes */
1182 bl = get_nodes_block(node);
1183 op = get_irn_op(node);
1187 NEW_ARR_A(ir_node *, in, n_param);
1188 for (i = 0; i < n_param; ++i)
1189 in[i] = get_irn_n(node, first + i);
1192 /* step 1: create the call */
1193 sym.entity_p = rt->ent;
1194 addr = new_r_SymConst(irg, mode_P_code, sym, symconst_addr_ent);
1195 call = new_rd_Call(get_irn_dbg_info(node), bl, mem, addr, n_param, in, mtp);
1196 set_irn_pinned(call, get_irn_pinned(node));
1199 res_proj = new_r_Proj(call, mode_T, pn_Call_T_result);
1204 n_proj += n_res - 1;
1207 turn_into_tuple(node, n_proj);
1209 if (rt->mem_proj_nr >= 0)
1210 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(call, mode_M, pn_Call_M));
1211 if (throws_exception) {
1212 set_Tuple_pred(node, op->pn_x_regular, new_r_Proj(call, mode_X, pn_Call_X_regular));
1213 set_Tuple_pred(node, op->pn_x_except, new_r_Proj(call, mode_X, pn_Call_X_except));
1216 if (rt->res_proj_nr >= 0) {
1217 for (i = 0; i < n_res; ++i) {
1218 ir_mode *mode = get_type_mode(get_method_res_type(mtp, i));
1219 ir_node *proj = new_r_Proj(res_proj, mode, i);
1220 set_Tuple_pred(node, rt->res_proj_nr + i, proj);
1225 /* only one return value supported */
1227 ir_mode *mode = get_type_mode(get_method_res_type(mtp, 0));
1229 res_proj = new_r_Proj(call, mode_T, pn_Call_T_result);
1230 res_proj = new_r_Proj(res_proj, mode, 0);
1232 exchange(node, res_proj);
1236 /* should not happen */