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"
47 /** Walker environment. */
48 typedef struct walker_env {
49 pmap *c_map; /**< The intrinsic call map. */
50 size_t nr_of_intrinsics; /**< statistics */
51 i_instr_record **i_map; /**< The intrinsic instruction map. */
55 * walker: call all mapper functions
57 static void call_mapper(ir_node *node, void *env)
59 walker_env_t *wenv = (walker_env_t*)env;
60 ir_op *op = get_irn_op(node);
65 const i_call_record *r;
68 symconst = get_Call_ptr(node);
69 if (! is_SymConst_addr_ent(symconst))
72 ent = get_SymConst_entity(symconst);
73 p = pmap_find(wenv->c_map, ent);
76 r = (const i_call_record*)p->value;
77 wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
80 if (op->code < (unsigned) ARR_LEN(wenv->i_map)) {
81 const i_instr_record *r = wenv->i_map[op->code];
82 /* run all possible mapper */
84 if (r->i_mapper(node, r->ctx)) {
85 ++wenv->nr_of_intrinsics;
88 r = (const i_instr_record*)r->link;
94 /* Go through all graphs and map calls to intrinsic functions. */
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 /* A mapper for the integer abs. */
238 int i_mapper_abs(ir_node *call, void *ctx)
240 ir_node *mem = get_Call_mem(call);
241 ir_node *block = get_nodes_block(call);
242 ir_node *op = get_Call_param(call, 0);
243 ir_graph *irg = get_irn_irg(call);
244 ir_mode *mode = get_irn_mode(op);
245 dbg_info *dbg = get_irn_dbg_info(call);
246 ir_node *zero = new_r_Const(irg, get_mode_null(mode));
247 ir_node *cmp = new_rd_Cmp(dbg, block, op, zero, ir_relation_less);
248 ir_node *minus_op = new_rd_Minus(dbg, block, op, mode);
250 arch_allow_ifconv_func allow_ifconv = be_get_backend_param()->allow_ifconv;
253 /* mux allowed by backend? */
254 if (!allow_ifconv(cmp, op, minus_op))
258 mux = new_rd_Mux(dbg, block, cmp, op, minus_op, mode);
259 DBG_OPT_ALGSIM0(call, mux, FS_OPT_RTS_ABS);
260 replace_call(mux, call, mem, NULL, NULL);
264 /* A mapper for the integer bswap. */
265 int i_mapper_bswap(ir_node *call, void *ctx)
267 ir_node *mem = get_Call_mem(call);
268 ir_node *block = get_nodes_block(call);
269 ir_node *op = get_Call_param(call, 0);
270 ir_type *tp = get_Call_type(call);
271 dbg_info *dbg = get_irn_dbg_info(call);
275 irn = new_rd_Builtin(dbg, block, get_irg_no_mem(current_ir_graph), 1, &op, ir_bk_bswap, tp);
276 set_irn_pinned(irn, op_pin_state_floats);
277 irn = new_r_Proj(irn, get_irn_mode(op), pn_Builtin_max+1);
278 replace_call(irn, call, mem, NULL, NULL);
282 /* A mapper for the alloca() function. */
283 int i_mapper_alloca(ir_node *call, void *ctx)
285 ir_node *mem = get_Call_mem(call);
286 ir_node *block = get_nodes_block(call);
287 ir_node *op = get_Call_param(call, 0);
288 ir_node *irn, *exc, *no_exc;
289 dbg_info *dbg = get_irn_dbg_info(call);
292 if (mode_is_signed(get_irn_mode(op))) {
293 ir_mode *mode = get_irn_mode(op);
294 mode = find_unsigned_mode(mode);
296 panic("Cannot find unsigned mode for %M", mode);
298 op = new_rd_Conv(dbg, block, op, mode);
301 irn = new_rd_Alloc(dbg, block, mem, op, firm_unknown_type, stack_alloc);
302 mem = new_rd_Proj(dbg, irn, mode_M, pn_Alloc_M);
303 irn = new_rd_Proj(dbg, irn, get_modeP_data(), pn_Alloc_res);
304 if (ir_throws_exception(call)) {
305 no_exc = new_rd_Proj(dbg, irn, mode_X, pn_Alloc_X_regular);
306 exc = new_rd_Proj(dbg, irn, mode_X, pn_Alloc_X_except);
307 ir_set_throws_exception(irn, true);
313 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_ALLOCA);
314 replace_call(irn, call, mem, no_exc, exc);
318 /* A mapper for the floating point sqrt. */
319 int i_mapper_sqrt(ir_node *call, void *ctx)
323 ir_node *op = get_Call_param(call, 0);
329 tv = get_Const_tarval(op);
330 if (! tarval_is_null(tv) && !tarval_is_one(tv))
333 mem = get_Call_mem(call);
335 /* sqrt(0) = 0, sqrt(1) = 1 */
336 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_SQRT);
337 replace_call(op, call, mem, NULL, NULL);
341 /* A mapper for the floating point cbrt. */
342 int i_mapper_cbrt(ir_node *call, void *ctx)
346 ir_node *op = get_Call_param(call, 0);
352 tv = get_Const_tarval(op);
353 if (! tarval_is_null(tv) && !tarval_is_one(tv) && !tarval_is_minus_one(tv))
356 mem = get_Call_mem(call);
358 /* cbrt(0) = 0, cbrt(1) = 1, cbrt(-1) = -1 */
359 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_CBRT);
360 replace_call(op, call, mem, NULL, NULL);
364 /* A mapper for the floating point pow. */
365 int i_mapper_pow(ir_node *call, void *ctx)
367 ir_node *left = get_Call_param(call, 0);
368 ir_node *right = get_Call_param(call, 1);
369 ir_node *block = get_nodes_block(call);
370 ir_graph *irg = get_irn_irg(block);
371 ir_node *reg_jmp = NULL;
372 ir_node *exc_jmp = NULL;
378 if (is_Const(left) && is_Const_one(left)) {
379 /* pow (1.0, x) = 1.0 */
381 } else if (is_Const(right)) {
382 ir_tarval *tv = get_Const_tarval(right);
383 if (tarval_is_null(tv)) {
384 /* pow(x, 0.0) = 1.0 */
385 ir_mode *mode = get_tarval_mode(tv);
386 irn = new_r_Const(irg, get_mode_one(mode));
387 } else if (tarval_is_one(tv)) {
388 /* pow(x, 1.0) = x */
390 } else if (tarval_is_minus_one(tv)) {
391 /* pow(x, -1.0) = 1/x */
399 mem = get_Call_mem(call);
400 dbg = get_irn_dbg_info(call);
403 ir_mode *mode = get_irn_mode(left);
406 irn = new_r_Const(irg, get_mode_one(mode));
407 div = new_rd_Div(dbg, block, mem, irn, left, mode, op_pin_state_pinned);
408 mem = new_r_Proj(div, mode_M, pn_Div_M);
409 irn = new_r_Proj(div, mode, pn_Div_res);
410 if (ir_throws_exception(call)) {
411 reg_jmp = new_r_Proj(div, mode_X, pn_Div_X_regular);
412 exc_jmp = new_r_Proj(div, mode_X, pn_Div_X_except);
413 ir_set_throws_exception(div, true);
416 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_POW);
417 replace_call(irn, call, mem, reg_jmp, exc_jmp);
421 /* A mapper for the floating point exp. */
422 int i_mapper_exp(ir_node *call, void *ctx)
424 ir_node *val = get_Call_param(call, 0);
427 if (is_Const(val) && is_Const_null(val)) {
429 ir_graph *irg = get_irn_irg(val);
430 ir_mode *mode = get_irn_mode(val);
431 ir_node *irn = new_r_Const(irg, get_mode_one(mode));
432 ir_node *mem = get_Call_mem(call);
433 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_EXP);
434 replace_call(irn, call, mem, NULL, NULL);
441 * A mapper for mapping f(0.0) to 0.0.
443 static int i_mapper_zero_to_zero(ir_node *call, void *ctx, int reason)
445 ir_node *val = get_Call_param(call, 0);
448 if (is_Const(val) && is_Const_null(val)) {
450 ir_node *mem = get_Call_mem(call);
451 DBG_OPT_ALGSIM0(call, val, reason);
452 replace_call(val, call, mem, NULL, NULL);
459 * A mapper for mapping f(1.0) to 0.0.
461 static int i_mapper_one_to_zero(ir_node *call, void *ctx, int reason)
463 ir_node *val = get_Call_param(call, 0);
466 if (is_Const(val) && is_Const_one(val)) {
467 /* acos(1.0) = 0.0 */
468 ir_graph *irg = get_irn_irg(val);
469 ir_mode *mode = get_irn_mode(val);
470 ir_node *irn = new_r_Const(irg, get_mode_null(mode));
471 ir_node *mem = get_Call_mem(call);
472 DBG_OPT_ALGSIM0(call, irn, reason);
473 replace_call(irn, call, mem, NULL, NULL);
480 * A mapper for mapping a functions with the following characteristics:
484 static int i_mapper_symmetric_zero_to_one(ir_node *call, void *ctx, int reason)
487 ir_node *val = get_Call_param(call, 0);
490 if (is_strictConv(val)) {
491 ir_node *op = get_Conv_op(val);
493 /* f(-x) = f(x) with strictConv */
494 ir_node *block = get_nodes_block(call);
495 ir_mode *mode = get_irn_mode(val);
496 dbg_info *dbg = get_irn_dbg_info(val);
498 op = get_Minus_op(op);
499 val = new_rd_Conv(dbg, block, op, mode);
502 set_Conv_strict(val, 1);
504 DBG_OPT_ALGSIM2(call, op, call, FS_OPT_RTS_SYMMETRIC);
505 set_Call_param(call, 0, val);
508 } else if (is_Minus(val)) {
510 val = get_Minus_op(val);
511 DBG_OPT_ALGSIM2(call, val, call, FS_OPT_RTS_SYMMETRIC);
512 set_Call_param(call, 0, val);
516 if (is_Const(val) && is_Const_null(val)) {
518 ir_graph *irg = get_irn_irg(val);
519 ir_mode *mode = get_irn_mode(val);
520 ir_node *irn = new_r_Const(irg, get_mode_one(mode));
521 ir_node *mem = get_Call_mem(call);
522 DBG_OPT_ALGSIM0(call, irn, reason);
523 replace_call(irn, call, mem, NULL, NULL);
529 /* A mapper for the floating point log. */
530 int i_mapper_log(ir_node *call, void *ctx)
533 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_LOG);
536 /* A mapper for the floating point sin. */
537 int i_mapper_sin(ir_node *call, void *ctx)
540 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SIN);
543 /* A mapper for the floating point cos. */
544 int i_mapper_cos(ir_node *call, void *ctx)
546 /* cos(0.0) = 1.0, cos(-x) = x */
547 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COS);
550 /* A mapper for the floating point tan. */
551 int i_mapper_tan(ir_node *call, void *ctx)
554 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TAN);
557 /* A mapper for the floating point asin. */
558 int i_mapper_asin(ir_node *call, void *ctx)
560 /* asin(0.0) = 0.0 */
561 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ASIN);
564 /* A mapper for the floating point acos. */
565 int i_mapper_acos(ir_node *call, void *ctx)
567 /* acos(1.0) = 0.0 */
568 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_ACOS);
571 /* A mapper for the floating point atan. */
572 int i_mapper_atan(ir_node *call, void *ctx)
574 /* atan(0.0) = 0.0 */
575 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ATAN);
578 /* A mapper for the floating point sinh. */
579 int i_mapper_sinh(ir_node *call, void *ctx)
581 /* sinh(0.0) = 0.0 */
582 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SINH);
585 /* A mapper for the floating point cosh. */
586 int i_mapper_cosh(ir_node *call, void *ctx)
588 /* cosh(0.0) = 1.0, cosh(-x) = x */
589 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COSH);
592 /* A mapper for the floating point tanh. */
593 int i_mapper_tanh(ir_node *call, void *ctx)
595 /* tanh(0.0) = 0.0 */
596 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TANH);
600 * Return the const entity that is accessed through the pointer ptr or
601 * NULL if there is no entity (or the entity is not constant).
603 * @param ptr the pointer
605 static ir_entity *get_const_entity(ir_node *ptr)
607 if (is_SymConst_addr_ent(ptr)) {
608 ir_entity *ent = get_SymConst_entity(ptr);
610 if (get_entity_linkage(ent) & IR_LINKAGE_CONSTANT) {
611 /* a constant entity */
618 static bool initializer_val_is_null(ir_initializer_t *init)
622 if (get_initializer_kind(init) == IR_INITIALIZER_NULL)
625 if (get_initializer_kind(init) == IR_INITIALIZER_TARVAL) {
626 tv = get_initializer_tarval_value(init);
627 } else if (get_initializer_kind(init) == IR_INITIALIZER_CONST) {
628 ir_node *irn = get_initializer_const_value(init);
631 tv = get_Const_tarval(irn);
636 return tarval_is_null(tv);
640 * Calculate the value of strlen if possible.
642 * @param ent the entity
643 * @param res_tp the result type
645 * @return a Const node containing the strlen() result or NULL
646 * if the evaluation fails
648 static ir_node *eval_strlen(ir_graph *irg, ir_entity *ent, ir_type *res_tp)
650 ir_type *tp = get_entity_type(ent);
652 ir_initializer_t *initializer;
656 if (! is_Array_type(tp))
658 tp = get_array_element_type(tp);
659 if (! is_Primitive_type(tp))
661 mode = get_type_mode(tp);
663 /* FIXME: This is too restrict, as the type char might be more the 8bits */
664 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
667 if (!has_entity_initializer(ent)) {
670 n = get_compound_ent_n_values(ent);
671 for (i = 0; i < n; ++i) {
672 ir_node *irn = get_compound_ent_value(ent, i);
677 if (is_Const_null(irn)) {
678 /* found the length */
679 ir_tarval *tv = new_tarval_from_long(i, get_type_mode(res_tp));
680 return new_r_Const(irg, tv);
686 initializer = get_entity_initializer(ent);
687 if (get_initializer_kind(initializer) != IR_INITIALIZER_COMPOUND)
690 size = get_initializer_compound_n_entries(initializer);
691 for (i = 0; i < size; ++i) {
692 ir_initializer_t *val = get_initializer_compound_value(initializer, i);
693 if (initializer_val_is_null(val)) {
694 ir_tarval *tv = new_tarval_from_long(i, get_type_mode(res_tp));
695 return new_r_Const(irg, tv);
702 /* A mapper for strlen */
703 int i_mapper_strlen(ir_node *call, void *ctx)
705 ir_node *s = get_Call_param(call, 0);
706 ir_entity *ent = get_const_entity(s);
710 /* FIXME: this cannot handle constant strings inside struct initializers yet */
712 /* a constant entity */
713 ir_type *tp = get_Call_type(call);
716 tp = get_method_res_type(tp, 0);
717 irn = eval_strlen(get_irn_irg(call), ent, tp);
720 ir_node *mem = get_Call_mem(call);
721 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRLEN);
722 replace_call(irn, call, mem, NULL, NULL);
730 * Calculate the value of strlen if possible.
732 * @param left the left entity
733 * @param right the right entity
734 * @param res_tp the result type
736 * @return a Const node containing the strcmp() result or NULL
737 * if the evaluation fails
739 static ir_node *eval_strcmp(ir_graph *irg, ir_entity *left, ir_entity *right,
745 tp = get_entity_type(left);
746 if (! is_Array_type(tp))
748 tp = get_array_element_type(tp);
749 if (! is_Primitive_type(tp))
751 mode = get_type_mode(tp);
753 /* FIXME: This is too restrict, as the type char might be more the 8bits */
754 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
757 tp = get_entity_type(right);
758 if (! is_Array_type(tp))
760 tp = get_array_element_type(tp);
761 if (! is_Primitive_type(tp))
763 mode = get_type_mode(tp);
765 /* FIXME: This is too restrict, as the type char might be more the 8bits */
766 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
769 if (!has_entity_initializer(left) && !has_entity_initializer(right)) {
770 /* code that uses deprecated compound_graph_path stuff */
771 size_t n = get_compound_ent_n_values(left);
772 size_t n_r = get_compound_ent_n_values(right);
778 for (i = 0; i < n; ++i) {
783 irn = get_compound_ent_value(left, i);
786 tv = get_Const_tarval(irn);
787 v_l = get_tarval_long(tv);
789 irn = get_compound_ent_value(right, i);
792 tv = get_Const_tarval(irn);
793 v_r = get_tarval_long(tv);
810 /* we found an end */
811 ir_tarval *tv = new_tarval_from_long(res, get_type_mode(res_tp));
812 return new_r_Const(irg, tv);
823 * Checks if an entity represents the empty string.
825 * @param ent the entity
827 * @return non-zero if ent represents the empty string
829 static int is_empty_string(ir_entity *ent)
831 ir_type *tp = get_entity_type(ent);
834 ir_initializer_t *initializer;
835 ir_initializer_t *init0;
837 if (! is_Array_type(tp))
839 tp = get_array_element_type(tp);
840 if (! is_Primitive_type(tp))
842 mode = get_type_mode(tp);
844 /* FIXME: This is too restrict, as the type char might be more the 8bits */
845 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
848 if (!has_entity_initializer(ent)) {
849 /* code for deprecated compound_graph_path stuff */
850 size_t n = get_compound_ent_n_values(ent);
853 irn = get_compound_ent_value(ent, 0);
855 return is_Const(irn) && is_Const_null(irn);
858 initializer = get_entity_initializer(ent);
859 if (get_initializer_kind(initializer) != IR_INITIALIZER_COMPOUND)
862 if (get_initializer_compound_n_entries(initializer) < 1)
865 init0 = get_initializer_compound_value(initializer, 0);
866 return initializer_val_is_null(init0);
869 /* A mapper for strcmp */
870 int i_mapper_strcmp(ir_node *call, void *ctx)
872 ir_node *left = get_Call_param(call, 0);
873 ir_node *right = get_Call_param(call, 1);
877 ir_type *call_tp = get_Call_type(call);
878 ir_type *res_tp = get_method_res_type(call_tp, 0);
879 ir_entity *ent_l, *ent_r;
885 /* do some type checks first */
886 if (! is_Primitive_type(res_tp))
888 char_tp = get_method_param_type(call_tp, 0);
889 if (char_tp != get_method_param_type(call_tp, 1))
891 if (! is_Pointer_type(char_tp))
893 char_tp = get_pointer_points_to_type(char_tp);
896 /* a strcmp(s, s) ==> 0 */
897 ir_graph *irg = get_irn_irg(call);
898 ir_node *mem = get_Call_mem(call);
899 ir_mode *mode = get_type_mode(res_tp);
901 irn = new_r_Const(irg, get_mode_null(mode));
902 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
903 replace_call(irn, call, mem, NULL, NULL);
906 ent_l = get_const_entity(left);
907 ent_r = get_const_entity(right);
909 if (ent_l != NULL && ent_r != NULL) {
910 /* both entities are const, try to evaluate */
911 irn = eval_strcmp(get_irn_irg(call), ent_l, ent_r, res_tp);
912 } else if (ent_l != NULL) {
913 if (is_empty_string(ent_l)) {
914 /* s strcmp("", s) ==> -(*s)*/
916 goto replace_by_call;
918 } else if (ent_r != NULL) {
919 if (is_empty_string(ent_r)) {
920 /* s strcmp(s, "") ==> (*s) */
921 ir_node *mem, *block;
927 mem = get_Call_mem(call);
928 block = get_nodes_block(call);
929 dbg = get_irn_dbg_info(call);
930 mode = get_type_mode(char_tp);
932 /* replace the strcmp by (*x) */
933 irn = new_rd_Load(dbg, block, mem, v, mode, cons_none);
934 mem = new_r_Proj(irn, mode_M, pn_Load_M);
935 irn = new_r_Proj(irn, mode, pn_Load_res);
936 if (ir_throws_exception(call)) {
937 exc = new_r_Proj(irn, mode_X, pn_Load_X_except);
938 reg = new_r_Proj(irn, mode_X, pn_Load_X_regular);
939 ir_set_throws_exception(irn, true);
945 /* conv to the result mode */
946 mode = get_type_mode(res_tp);
947 irn = new_rd_Conv(dbg, block, irn, mode);
950 /* negate in the ("", s) case */
951 irn = new_rd_Minus(dbg, block, irn, mode);
957 ir_node *mem = get_Call_mem(call);
958 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
959 replace_call(irn, call, mem, reg, exc);
966 /* A mapper for strncmp */
967 int i_mapper_strncmp(ir_node *call, void *ctx)
969 ir_node *left = get_Call_param(call, 0);
970 ir_node *right = get_Call_param(call, 1);
971 ir_node *len = get_Call_param(call, 2);
975 if (left == right || (is_Const(len) && is_Const_null(len))) {
976 /* a strncmp(s, s, len) ==> 0 OR
977 a strncmp(a, b, 0) ==> 0 */
978 ir_graph *irg = get_irn_irg(call);
979 ir_node *mem = get_Call_mem(call);
980 ir_node *adr = get_Call_ptr(call);
981 ir_entity *ent = get_SymConst_entity(adr);
982 ir_type *call_tp = get_entity_type(ent);
983 ir_type *res_tp = get_method_res_type(call_tp, 0);
984 ir_mode *mode = get_type_mode(res_tp);
986 irn = new_r_Const(irg, get_mode_null(mode));
987 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRNCMP);
988 replace_call(irn, call, mem, NULL, NULL);
994 /* A mapper for strcpy */
995 int i_mapper_strcpy(ir_node *call, void *ctx)
997 ir_node *dst = get_Call_param(call, 0);
998 ir_node *src = get_Call_param(call, 1);
1002 /* a strcpy(d, s) ==> d */
1003 ir_node *mem = get_Call_mem(call);
1004 ir_node *dst = get_Call_param(call, 0);
1006 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_STRCPY);
1007 replace_call(dst, call, mem, NULL, NULL);
1013 /* A mapper for memcpy */
1014 int i_mapper_memcpy(ir_node *call, void *ctx)
1016 ir_node *dst = get_Call_param(call, 0);
1017 ir_node *src = get_Call_param(call, 1);
1018 ir_node *len = get_Call_param(call, 2);
1021 if (dst == src || (is_Const(len) && is_Const_null(len))) {
1022 /* a memcpy(d, d, len) ==> d OR
1023 a memcpy(d, s, 0) ==> d */
1024 ir_node *mem = get_Call_mem(call);
1026 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMCPY);
1027 replace_call(dst, call, mem, NULL, NULL);
1033 /* A mapper for mempcpy */
1034 int i_mapper_mempcpy(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 memcpy(d, d, len) ==> d + len OR
1043 a memcpy(d, s, 0) ==> d + 0 */
1044 dbg_info *dbg = get_irn_dbg_info(call);
1045 ir_node *mem = get_Call_mem(call);
1046 ir_node *blk = get_nodes_block(call);
1047 ir_mode *mode = get_irn_mode(dst);
1048 ir_node *res = new_rd_Add(dbg, blk, dst, len, mode);
1050 DBG_OPT_ALGSIM0(call, res, FS_OPT_RTS_MEMPCPY);
1051 replace_call(res, call, mem, NULL, NULL);
1057 /* A mapper for memmove */
1058 int i_mapper_memmove(ir_node *call, void *ctx)
1060 ir_node *dst = get_Call_param(call, 0);
1061 ir_node *src = get_Call_param(call, 1);
1062 ir_node *len = get_Call_param(call, 2);
1065 if (dst == src || (is_Const(len) && is_Const_null(len))) {
1066 /* a memmove(d, d, len) ==> d OR
1067 a memmove(d, s, 0) ==> d */
1068 ir_node *mem = get_Call_mem(call);
1070 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMMOVE);
1071 replace_call(dst, call, mem, NULL, NULL);
1077 /* A mapper for memset */
1078 int i_mapper_memset(ir_node *call, void *ctx)
1080 ir_node *len = get_Call_param(call, 2);
1083 if (is_Const(len) && is_Const_null(len)) {
1084 /* a memset(d, C, 0) ==> d */
1085 ir_node *mem = get_Call_mem(call);
1086 ir_node *dst = get_Call_param(call, 0);
1088 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMSET);
1089 replace_call(dst, call, mem, NULL, NULL);
1095 /* A mapper for memcmp */
1096 int i_mapper_memcmp(ir_node *call, void *ctx)
1098 ir_node *left = get_Call_param(call, 0);
1099 ir_node *right = get_Call_param(call, 1);
1100 ir_node *len = get_Call_param(call, 2);
1104 if (left == right || (is_Const(len) && is_Const_null(len))) {
1105 /* a memcmp(s, s, len) ==> 0 OR
1106 a memcmp(a, b, 0) ==> 0 */
1107 ir_graph *irg = get_irn_irg(call);
1108 ir_node *mem = get_Call_mem(call);
1109 ir_node *adr = get_Call_ptr(call);
1110 ir_entity *ent = get_SymConst_entity(adr);
1111 ir_type *call_tp = get_entity_type(ent);
1112 ir_type *res_tp = get_method_res_type(call_tp, 0);
1113 ir_mode *mode = get_type_mode(res_tp);
1115 irn = new_r_Const(irg, get_mode_null(mode));
1116 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRNCMP);
1117 replace_call(irn, call, mem, NULL, NULL);
1124 * Returns the result mode of a node.
1126 static ir_mode *get_irn_res_mode(ir_node *node)
1128 switch (get_irn_opcode(node)) {
1129 case iro_Load: return get_Load_mode(node);
1130 case iro_Div: return get_Div_resmode(node);
1131 case iro_Mod: return get_Mod_resmode(node);
1132 default: return NULL;
1136 #define LMAX(a, b) ((a) > (b) ? (a) : (b))
1138 /* A mapper for mapping unsupported instructions to runtime calls. */
1139 int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt)
1141 int i, j, arity, first, n_param, n_res;
1144 ir_node *mem, *bl, *call, *addr, *res_proj;
1146 bool throws_exception;
1149 symconst_symbol sym;
1150 ir_mode *mode = get_irn_mode(node);
1152 if (mode != rt->mode)
1154 /* check if the result modes match */
1155 if (mode == mode_T && rt->res_mode != NULL) {
1156 mode = get_irn_res_mode(node);
1157 if (mode != rt->res_mode)
1161 arity = get_irn_arity(node);
1165 mtp = get_entity_type(rt->ent);
1166 n_param = get_method_n_params(mtp);
1167 irg = current_ir_graph;
1169 mem = get_irn_n(node, 0);
1170 if (get_irn_mode(mem) != mode_M) {
1171 mem = new_r_NoMem(irg);
1176 /* check if the modes of the predecessors match the parameter modes */
1177 if (arity - first != n_param)
1180 for (i = first, j = 0; i < arity; ++i, ++j) {
1181 ir_type *param_tp = get_method_param_type(mtp, j);
1182 ir_node *pred = get_irn_n(node, i);
1184 if (get_type_mode(param_tp) != get_irn_mode(pred))
1188 n_res = get_method_n_ress(mtp);
1189 throws_exception = ir_throws_exception(node);
1191 /* step 0: calculate the number of needed Proj's */
1193 n_proj = LMAX(n_proj, rt->mem_proj_nr + 1);
1194 n_proj = LMAX(n_proj, rt->res_proj_nr + 1);
1195 if (throws_exception) {
1196 n_proj = LMAX(n_proj, rt->regular_proj_nr + 1);
1197 n_proj = LMAX(n_proj, rt->exc_proj_nr + 1);
1201 if (rt->mode != mode_T) /* must be mode_T */
1206 if (get_type_mode(get_method_res_type(mtp, 0)) != rt->mode)
1210 /* ok, when we are here, the number of predecessors match as well as the parameter modes */
1211 bl = get_nodes_block(node);
1212 op = get_irn_op(node);
1216 NEW_ARR_A(ir_node *, in, n_param);
1217 for (i = 0; i < n_param; ++i)
1218 in[i] = get_irn_n(node, first + i);
1221 /* step 1: create the call */
1222 sym.entity_p = rt->ent;
1223 addr = new_r_SymConst(irg, mode_P_code, sym, symconst_addr_ent);
1224 call = new_rd_Call(get_irn_dbg_info(node), bl, mem, addr, n_param, in, mtp);
1225 set_irn_pinned(call, get_irn_pinned(node));
1228 res_proj = new_r_Proj(call, mode_T, pn_Call_T_result);
1233 n_proj += n_res - 1;
1236 turn_into_tuple(node, n_proj);
1238 if (rt->mem_proj_nr >= 0)
1239 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(call, mode_M, pn_Call_M));
1240 if (throws_exception) {
1241 set_Tuple_pred(node, op->pn_x_regular, new_r_Proj(call, mode_X, pn_Call_X_regular));
1242 set_Tuple_pred(node, op->pn_x_except, new_r_Proj(call, mode_X, pn_Call_X_except));
1245 if (rt->res_proj_nr >= 0) {
1246 for (i = 0; i < n_res; ++i) {
1247 ir_mode *mode = get_type_mode(get_method_res_type(mtp, i));
1248 ir_node *proj = new_r_Proj(res_proj, mode, i);
1249 set_Tuple_pred(node, rt->res_proj_nr + i, proj);
1254 /* only one return value supported */
1256 ir_mode *mode = get_type_mode(get_method_res_type(mtp, 0));
1258 res_proj = new_r_Proj(call, mode_T, pn_Call_T_result);
1259 res_proj = new_r_Proj(res_proj, mode, 0);
1261 exchange(node, res_proj);
1265 /* should not happen */