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);
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 r = (const i_call_record*)pmap_get(wenv->c_map, ent);
76 wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
79 if (op->code < (unsigned) ARR_LEN(wenv->i_map)) {
80 const i_instr_record *r = wenv->i_map[op->code];
81 /* run all possible mapper */
83 if (r->i_mapper(node, r->ctx)) {
84 ++wenv->nr_of_intrinsics;
87 r = (const i_instr_record*)r->link;
93 size_t lower_intrinsics(i_record *list, size_t length, int part_block_used)
96 size_t n_ops = get_irp_n_opcodes();
98 pmap *c_map = pmap_create_ex(length);
99 i_instr_record **i_map;
100 size_t nr_of_intrinsics = 0;
103 /* we use the ir_op generic pointers here */
104 NEW_ARR_A(i_instr_record *, i_map, n_ops);
105 memset((void *)i_map, 0, sizeof(*i_map) * n_ops);
107 /* fill a map for faster search */
108 for (i = 0; i < length; ++i) {
109 if (list[i].i_call.kind == INTRINSIC_CALL) {
110 pmap_insert(c_map, list[i].i_call.i_ent, (void *)&list[i].i_call);
112 ir_op *op = list[i].i_instr.op;
113 assert(op->code < (unsigned) ARR_LEN(i_map));
115 list[i].i_instr.link = i_map[op->code];
116 i_map[op->code] = &list[i].i_instr;
123 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
124 irg = get_irp_irg(i);
126 if (part_block_used) {
127 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_PHI_LIST);
128 collect_phiprojs(irg);
131 wenv.nr_of_intrinsics = 0;
132 irg_walk_graph(irg, NULL, call_mapper, &wenv);
135 ir_free_resources(irg, IR_RESOURCE_IRN_LINK | IR_RESOURCE_PHI_LIST);
137 if (wenv.nr_of_intrinsics > 0) {
138 /* Changes detected: we might have added/removed nodes. */
139 set_irg_callee_info_state(irg, irg_callee_info_inconsistent);
141 /* Exception control flow might have changed / new block might have added. */
142 clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE
143 | IR_GRAPH_STATE_VALID_EXTENDED_BLOCKS);
146 irg_verify(irg, VERIFY_NORMAL);
148 nr_of_intrinsics += wenv.nr_of_intrinsics;
153 return nr_of_intrinsics;
156 typedef struct pass_t {
165 * Wrapper for running lower_intrinsics() as an ir_prog pass.
167 static int pass_wrapper(ir_prog *irp, void *context)
169 pass_t *pass = (pass_t*)context;
170 (void) irp; /* TODO: set current irp, or remove parameter */
171 lower_intrinsics(pass->list, pass->length, pass->part_block_used);
172 /* probably this pass should not run again */
177 * Creates an ir_prog pass for lower_intrinsics.
179 * @param name the name of this pass or NULL
180 * @param list an array of intrinsic map records
181 * @param length the length of the array
182 * @param part_block_used set to true if part_block() must be using during lowering
184 ir_prog_pass_t *lower_intrinsics_pass(
186 i_record *list, size_t length, int part_block_used)
188 pass_t *const pass = XMALLOCF(pass_t, list, length);
189 memcpy(pass->list, list, sizeof(list[0]) * length);
190 pass->length = length;
191 pass->part_block_used = part_block_used;
193 return def_prog_pass_constructor(
194 &pass->pass, name ? name : "lower_intrinsics", pass_wrapper);
198 * Helper function, replace the call by the given node.
200 * @param irn the result node
201 * @param call the call to replace
202 * @param mem the new mem result
203 * @param reg_jmp new regular control flow, if NULL, a Jmp will be used
204 * @param exc_jmp new exception control flow, if reg_jmp == NULL, a Bad will be used
206 static void replace_call(ir_node *irn, ir_node *call, ir_node *mem,
207 ir_node *reg_jmp, ir_node *exc_jmp)
209 ir_node *block = get_nodes_block(call);
210 ir_graph *irg = get_irn_irg(block);
211 ir_node *rest = new_r_Tuple(block, 1, &irn);
213 if (ir_throws_exception(call)) {
214 turn_into_tuple(call, pn_Call_max+1);
215 if (reg_jmp == NULL) {
216 reg_jmp = new_r_Jmp(block);
218 if (exc_jmp == NULL) {
219 exc_jmp = new_r_Bad(irg, mode_X);
221 set_Tuple_pred(call, pn_Call_X_regular, reg_jmp);
222 set_Tuple_pred(call, pn_Call_X_except, exc_jmp);
224 assert(reg_jmp == NULL);
225 assert(exc_jmp == NULL);
226 turn_into_tuple(call, pn_Call_T_result+1);
227 assert(pn_Call_M <= pn_Call_T_result);
228 assert(pn_Call_X_regular > pn_Call_T_result);
229 assert(pn_Call_X_except > pn_Call_T_result);
231 set_Tuple_pred(call, pn_Call_M, mem);
232 set_Tuple_pred(call, pn_Call_T_result, rest);
235 int i_mapper_abs(ir_node *call, void *ctx)
237 ir_node *mem = get_Call_mem(call);
238 ir_node *block = get_nodes_block(call);
239 ir_node *op = get_Call_param(call, 0);
240 ir_graph *irg = get_irn_irg(call);
241 ir_mode *mode = get_irn_mode(op);
242 dbg_info *dbg = get_irn_dbg_info(call);
243 ir_node *zero = new_r_Const(irg, get_mode_null(mode));
244 ir_node *cmp = new_rd_Cmp(dbg, block, op, zero, ir_relation_less);
245 ir_node *minus_op = new_rd_Minus(dbg, block, op, mode);
247 arch_allow_ifconv_func allow_ifconv = be_get_backend_param()->allow_ifconv;
250 /* mux allowed by backend? */
251 if (!allow_ifconv(cmp, op, minus_op))
255 mux = new_rd_Mux(dbg, block, cmp, op, minus_op, mode);
256 DBG_OPT_ALGSIM0(call, mux, FS_OPT_RTS_ABS);
257 replace_call(mux, call, mem, NULL, NULL);
261 int i_mapper_bswap(ir_node *call, void *ctx)
263 ir_node *mem = get_Call_mem(call);
264 ir_node *block = get_nodes_block(call);
265 ir_node *op = get_Call_param(call, 0);
266 ir_type *tp = get_Call_type(call);
267 dbg_info *dbg = get_irn_dbg_info(call);
271 irn = new_rd_Builtin(dbg, block, get_irg_no_mem(current_ir_graph), 1, &op, ir_bk_bswap, tp);
272 set_irn_pinned(irn, op_pin_state_floats);
273 irn = new_r_Proj(irn, get_irn_mode(op), pn_Builtin_max+1);
274 replace_call(irn, call, mem, NULL, NULL);
278 int i_mapper_alloca(ir_node *call, void *ctx)
280 ir_node *mem = get_Call_mem(call);
281 ir_node *block = get_nodes_block(call);
282 ir_node *op = get_Call_param(call, 0);
283 ir_node *irn, *exc, *no_exc;
284 dbg_info *dbg = get_irn_dbg_info(call);
287 if (mode_is_signed(get_irn_mode(op))) {
288 ir_mode *mode = get_irn_mode(op);
289 mode = find_unsigned_mode(mode);
291 panic("Cannot find unsigned mode for %M", mode);
293 op = new_rd_Conv(dbg, block, op, mode);
296 irn = new_rd_Alloc(dbg, block, mem, op, get_unknown_type(), stack_alloc);
297 mem = new_rd_Proj(dbg, irn, mode_M, pn_Alloc_M);
298 irn = new_rd_Proj(dbg, irn, get_modeP_data(), pn_Alloc_res);
299 if (ir_throws_exception(call)) {
300 no_exc = new_rd_Proj(dbg, irn, mode_X, pn_Alloc_X_regular);
301 exc = new_rd_Proj(dbg, irn, mode_X, pn_Alloc_X_except);
302 ir_set_throws_exception(irn, true);
308 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_ALLOCA);
309 replace_call(irn, call, mem, no_exc, exc);
313 int i_mapper_sqrt(ir_node *call, void *ctx)
317 ir_node *op = get_Call_param(call, 0);
323 tv = get_Const_tarval(op);
324 if (! tarval_is_null(tv) && !tarval_is_one(tv))
327 mem = get_Call_mem(call);
329 /* sqrt(0) = 0, sqrt(1) = 1 */
330 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_SQRT);
331 replace_call(op, call, mem, NULL, NULL);
335 int i_mapper_cbrt(ir_node *call, void *ctx)
339 ir_node *op = get_Call_param(call, 0);
345 tv = get_Const_tarval(op);
346 if (! tarval_is_null(tv) && !tarval_is_one(tv) && !tarval_is_minus_one(tv))
349 mem = get_Call_mem(call);
351 /* cbrt(0) = 0, cbrt(1) = 1, cbrt(-1) = -1 */
352 DBG_OPT_ALGSIM0(call, op, FS_OPT_RTS_CBRT);
353 replace_call(op, call, mem, NULL, NULL);
357 int i_mapper_pow(ir_node *call, void *ctx)
359 ir_node *left = get_Call_param(call, 0);
360 ir_node *right = get_Call_param(call, 1);
361 ir_node *block = get_nodes_block(call);
362 ir_graph *irg = get_irn_irg(block);
363 ir_node *reg_jmp = NULL;
364 ir_node *exc_jmp = NULL;
370 if (is_Const(left) && is_Const_one(left)) {
371 /* pow (1.0, x) = 1.0 */
373 } else if (is_Const(right)) {
374 ir_tarval *tv = get_Const_tarval(right);
375 if (tarval_is_null(tv)) {
376 /* pow(x, 0.0) = 1.0 */
377 ir_mode *mode = get_tarval_mode(tv);
378 irn = new_r_Const(irg, get_mode_one(mode));
379 } else if (tarval_is_one(tv)) {
380 /* pow(x, 1.0) = x */
382 } else if (tarval_is_minus_one(tv)) {
383 /* pow(x, -1.0) = 1/x */
391 mem = get_Call_mem(call);
392 dbg = get_irn_dbg_info(call);
395 ir_mode *mode = get_irn_mode(left);
398 irn = new_r_Const(irg, get_mode_one(mode));
399 div = new_rd_Div(dbg, block, mem, irn, left, mode, op_pin_state_pinned);
400 mem = new_r_Proj(div, mode_M, pn_Div_M);
401 irn = new_r_Proj(div, mode, pn_Div_res);
402 if (ir_throws_exception(call)) {
403 reg_jmp = new_r_Proj(div, mode_X, pn_Div_X_regular);
404 exc_jmp = new_r_Proj(div, mode_X, pn_Div_X_except);
405 ir_set_throws_exception(div, true);
408 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_POW);
409 replace_call(irn, call, mem, reg_jmp, exc_jmp);
413 int i_mapper_exp(ir_node *call, void *ctx)
415 ir_node *val = get_Call_param(call, 0);
418 if (is_Const(val) && is_Const_null(val)) {
420 ir_graph *irg = get_irn_irg(val);
421 ir_mode *mode = get_irn_mode(val);
422 ir_node *irn = new_r_Const(irg, get_mode_one(mode));
423 ir_node *mem = get_Call_mem(call);
424 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_EXP);
425 replace_call(irn, call, mem, NULL, NULL);
431 int i_mapper_exp2(ir_node *call, void *ctx)
433 return i_mapper_exp(call, ctx);
436 int i_mapper_exp10(ir_node *call, void *ctx)
438 return i_mapper_exp(call, ctx);
442 * A mapper for mapping f(0.0) to 0.0.
444 static int i_mapper_zero_to_zero(ir_node *call, void *ctx, int reason)
446 ir_node *val = get_Call_param(call, 0);
449 if (is_Const(val) && is_Const_null(val)) {
451 ir_node *mem = get_Call_mem(call);
452 DBG_OPT_ALGSIM0(call, val, reason);
453 replace_call(val, call, mem, NULL, NULL);
460 * A mapper for mapping f(1.0) to 0.0.
462 static int i_mapper_one_to_zero(ir_node *call, void *ctx, int reason)
464 ir_node *val = get_Call_param(call, 0);
467 if (is_Const(val) && is_Const_one(val)) {
468 /* acos(1.0) = 0.0 */
469 ir_graph *irg = get_irn_irg(val);
470 ir_mode *mode = get_irn_mode(val);
471 ir_node *irn = new_r_Const(irg, get_mode_null(mode));
472 ir_node *mem = get_Call_mem(call);
473 DBG_OPT_ALGSIM0(call, irn, reason);
474 replace_call(irn, call, mem, NULL, NULL);
481 * A mapper for mapping a functions with the following characteristics:
485 static int i_mapper_symmetric_zero_to_one(ir_node *call, void *ctx, int reason)
488 ir_node *val = get_Call_param(call, 0);
491 if (is_strictConv(val)) {
492 ir_node *op = get_Conv_op(val);
494 /* f(-x) = f(x) with strictConv */
495 ir_node *block = get_nodes_block(call);
496 ir_mode *mode = get_irn_mode(val);
497 dbg_info *dbg = get_irn_dbg_info(val);
499 op = get_Minus_op(op);
500 val = new_rd_Conv(dbg, block, op, mode);
503 set_Conv_strict(val, 1);
505 DBG_OPT_ALGSIM2(call, op, call, FS_OPT_RTS_SYMMETRIC);
506 set_Call_param(call, 0, val);
509 } else if (is_Minus(val)) {
511 val = get_Minus_op(val);
512 DBG_OPT_ALGSIM2(call, val, call, FS_OPT_RTS_SYMMETRIC);
513 set_Call_param(call, 0, val);
517 if (is_Const(val) && is_Const_null(val)) {
519 ir_graph *irg = get_irn_irg(val);
520 ir_mode *mode = get_irn_mode(val);
521 ir_node *irn = new_r_Const(irg, get_mode_one(mode));
522 ir_node *mem = get_Call_mem(call);
523 DBG_OPT_ALGSIM0(call, irn, reason);
524 replace_call(irn, call, mem, NULL, NULL);
530 int i_mapper_log(ir_node *call, void *ctx)
533 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_LOG);
536 int i_mapper_log2(ir_node *call, void *ctx)
538 /* log2(1.0) = 0.0 */
539 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_LOG);
542 int i_mapper_log10(ir_node *call, void *ctx)
544 /* log10(1.0) = 0.0 */
545 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_LOG);
548 int i_mapper_sin(ir_node *call, void *ctx)
551 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SIN);
554 int i_mapper_cos(ir_node *call, void *ctx)
556 /* cos(0.0) = 1.0, cos(-x) = x */
557 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COS);
560 int i_mapper_tan(ir_node *call, void *ctx)
563 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TAN);
566 int i_mapper_asin(ir_node *call, void *ctx)
568 /* asin(0.0) = 0.0 */
569 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ASIN);
572 int i_mapper_acos(ir_node *call, void *ctx)
574 /* acos(1.0) = 0.0 */
575 return i_mapper_one_to_zero(call, ctx, FS_OPT_RTS_ACOS);
578 int i_mapper_atan(ir_node *call, void *ctx)
580 /* atan(0.0) = 0.0 */
581 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_ATAN);
584 int i_mapper_sinh(ir_node *call, void *ctx)
586 /* sinh(0.0) = 0.0 */
587 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_SINH);
590 int i_mapper_cosh(ir_node *call, void *ctx)
592 /* cosh(0.0) = 1.0, cosh(-x) = x */
593 return i_mapper_symmetric_zero_to_one(call, ctx, FS_OPT_RTS_COSH);
596 int i_mapper_tanh(ir_node *call, void *ctx)
598 /* tanh(0.0) = 0.0 */
599 return i_mapper_zero_to_zero(call, ctx, FS_OPT_RTS_TANH);
603 * Return the const entity that is accessed through the pointer ptr or
604 * NULL if there is no entity (or the entity is not constant).
606 * @param ptr the pointer
608 static ir_entity *get_const_entity(ir_node *ptr)
610 if (is_SymConst_addr_ent(ptr)) {
611 ir_entity *ent = get_SymConst_entity(ptr);
613 if (get_entity_linkage(ent) & IR_LINKAGE_CONSTANT) {
614 /* a constant entity */
621 static bool initializer_val_is_null(ir_initializer_t *init)
625 if (get_initializer_kind(init) == IR_INITIALIZER_NULL)
628 if (get_initializer_kind(init) == IR_INITIALIZER_TARVAL) {
629 tv = get_initializer_tarval_value(init);
630 } else if (get_initializer_kind(init) == IR_INITIALIZER_CONST) {
631 ir_node *irn = get_initializer_const_value(init);
634 tv = get_Const_tarval(irn);
639 return tarval_is_null(tv);
643 * Calculate the value of strlen if possible.
645 * @param ent the entity
646 * @param res_tp the result type
648 * @return a Const node containing the strlen() result or NULL
649 * if the evaluation fails
651 static ir_node *eval_strlen(ir_graph *irg, ir_entity *ent, ir_type *res_tp)
653 ir_type *tp = get_entity_type(ent);
655 ir_initializer_t *initializer;
659 if (! is_Array_type(tp))
661 tp = get_array_element_type(tp);
662 if (! is_Primitive_type(tp))
664 mode = get_type_mode(tp);
666 /* FIXME: This is too restrict, as the type char might be more the 8bits */
667 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
670 if (!has_entity_initializer(ent)) {
673 n = get_compound_ent_n_values(ent);
674 for (i = 0; i < n; ++i) {
675 ir_node *irn = get_compound_ent_value(ent, i);
680 if (is_Const_null(irn)) {
681 /* found the length */
682 ir_tarval *tv = new_tarval_from_long(i, get_type_mode(res_tp));
683 return new_r_Const(irg, tv);
689 initializer = get_entity_initializer(ent);
690 if (get_initializer_kind(initializer) != IR_INITIALIZER_COMPOUND)
693 size = get_initializer_compound_n_entries(initializer);
694 for (i = 0; i < size; ++i) {
695 ir_initializer_t *val = get_initializer_compound_value(initializer, i);
696 if (initializer_val_is_null(val)) {
697 ir_tarval *tv = new_tarval_from_long(i, get_type_mode(res_tp));
698 return new_r_Const(irg, tv);
705 int i_mapper_strlen(ir_node *call, void *ctx)
707 ir_node *s = get_Call_param(call, 0);
708 ir_entity *ent = get_const_entity(s);
712 /* FIXME: this cannot handle constant strings inside struct initializers yet */
714 /* a constant entity */
715 ir_type *tp = get_Call_type(call);
718 tp = get_method_res_type(tp, 0);
719 irn = eval_strlen(get_irn_irg(call), ent, tp);
722 ir_node *mem = get_Call_mem(call);
723 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRLEN);
724 replace_call(irn, call, mem, NULL, NULL);
732 * Calculate the value of strlen if possible.
734 * @param left the left entity
735 * @param right the right entity
736 * @param res_tp the result type
738 * @return a Const node containing the strcmp() result or NULL
739 * if the evaluation fails
741 static ir_node *eval_strcmp(ir_graph *irg, ir_entity *left, ir_entity *right,
747 tp = get_entity_type(left);
748 if (! is_Array_type(tp))
750 tp = get_array_element_type(tp);
751 if (! is_Primitive_type(tp))
753 mode = get_type_mode(tp);
755 /* FIXME: This is too restrict, as the type char might be more the 8bits */
756 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
759 tp = get_entity_type(right);
760 if (! is_Array_type(tp))
762 tp = get_array_element_type(tp);
763 if (! is_Primitive_type(tp))
765 mode = get_type_mode(tp);
767 /* FIXME: This is too restrict, as the type char might be more the 8bits */
768 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
771 if (!has_entity_initializer(left) && !has_entity_initializer(right)) {
772 /* code that uses deprecated compound_graph_path stuff */
773 size_t n = get_compound_ent_n_values(left);
774 size_t n_r = get_compound_ent_n_values(right);
780 for (i = 0; i < n; ++i) {
785 irn = get_compound_ent_value(left, i);
788 tv = get_Const_tarval(irn);
789 v_l = get_tarval_long(tv);
791 irn = get_compound_ent_value(right, i);
794 tv = get_Const_tarval(irn);
795 v_r = get_tarval_long(tv);
812 /* we found an end */
813 ir_tarval *tv = new_tarval_from_long(res, get_type_mode(res_tp));
814 return new_r_Const(irg, tv);
825 * Checks if an entity represents the empty string.
827 * @param ent the entity
829 * @return non-zero if ent represents the empty string
831 static int is_empty_string(ir_entity *ent)
833 ir_type *tp = get_entity_type(ent);
836 ir_initializer_t *initializer;
837 ir_initializer_t *init0;
839 if (! is_Array_type(tp))
841 tp = get_array_element_type(tp);
842 if (! is_Primitive_type(tp))
844 mode = get_type_mode(tp);
846 /* FIXME: This is too restrict, as the type char might be more the 8bits */
847 if (!mode_is_int(mode) || get_mode_size_bits(mode) != 8)
850 if (!has_entity_initializer(ent)) {
851 /* code for deprecated compound_graph_path stuff */
852 size_t n = get_compound_ent_n_values(ent);
855 irn = get_compound_ent_value(ent, 0);
857 return is_Const(irn) && is_Const_null(irn);
860 initializer = get_entity_initializer(ent);
861 if (get_initializer_kind(initializer) != IR_INITIALIZER_COMPOUND)
864 if (get_initializer_compound_n_entries(initializer) < 1)
867 init0 = get_initializer_compound_value(initializer, 0);
868 return initializer_val_is_null(init0);
871 int i_mapper_strcmp(ir_node *call, void *ctx)
873 ir_node *left = get_Call_param(call, 0);
874 ir_node *right = get_Call_param(call, 1);
878 ir_type *call_tp = get_Call_type(call);
879 ir_type *res_tp = get_method_res_type(call_tp, 0);
880 ir_entity *ent_l, *ent_r;
886 /* do some type checks first */
887 if (! is_Primitive_type(res_tp))
889 char_tp = get_method_param_type(call_tp, 0);
890 if (char_tp != get_method_param_type(call_tp, 1))
892 if (! is_Pointer_type(char_tp))
894 char_tp = get_pointer_points_to_type(char_tp);
897 /* a strcmp(s, s) ==> 0 */
898 ir_graph *irg = get_irn_irg(call);
899 ir_node *mem = get_Call_mem(call);
900 ir_mode *mode = get_type_mode(res_tp);
902 irn = new_r_Const(irg, get_mode_null(mode));
903 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
904 replace_call(irn, call, mem, NULL, NULL);
907 ent_l = get_const_entity(left);
908 ent_r = get_const_entity(right);
910 if (ent_l != NULL && ent_r != NULL) {
911 /* both entities are const, try to evaluate */
912 irn = eval_strcmp(get_irn_irg(call), ent_l, ent_r, res_tp);
913 } else if (ent_l != NULL) {
914 if (is_empty_string(ent_l)) {
915 /* s strcmp("", s) ==> -(*s)*/
917 goto replace_by_call;
919 } else if (ent_r != NULL) {
920 if (is_empty_string(ent_r)) {
921 /* s strcmp(s, "") ==> (*s) */
922 ir_node *mem, *block;
928 mem = get_Call_mem(call);
929 block = get_nodes_block(call);
930 dbg = get_irn_dbg_info(call);
931 mode = get_type_mode(char_tp);
933 /* replace the strcmp by (*x) */
934 irn = new_rd_Load(dbg, block, mem, v, mode, cons_none);
935 mem = new_r_Proj(irn, mode_M, pn_Load_M);
936 irn = new_r_Proj(irn, mode, pn_Load_res);
937 if (ir_throws_exception(call)) {
938 exc = new_r_Proj(irn, mode_X, pn_Load_X_except);
939 reg = new_r_Proj(irn, mode_X, pn_Load_X_regular);
940 ir_set_throws_exception(irn, true);
946 /* conv to the result mode */
947 mode = get_type_mode(res_tp);
948 irn = new_rd_Conv(dbg, block, irn, mode);
951 /* negate in the ("", s) case */
952 irn = new_rd_Minus(dbg, block, irn, mode);
958 ir_node *mem = get_Call_mem(call);
959 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRCMP);
960 replace_call(irn, call, mem, reg, exc);
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 int i_mapper_strcpy(ir_node *call, void *ctx)
996 ir_node *dst = get_Call_param(call, 0);
997 ir_node *src = get_Call_param(call, 1);
1001 /* a strcpy(d, s) ==> d */
1002 ir_node *mem = get_Call_mem(call);
1003 ir_node *dst = get_Call_param(call, 0);
1005 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_STRCPY);
1006 replace_call(dst, call, mem, NULL, NULL);
1012 int i_mapper_memcpy(ir_node *call, void *ctx)
1014 ir_node *dst = get_Call_param(call, 0);
1015 ir_node *src = get_Call_param(call, 1);
1016 ir_node *len = get_Call_param(call, 2);
1019 if (dst == src || (is_Const(len) && is_Const_null(len))) {
1020 /* a memcpy(d, d, len) ==> d OR
1021 a memcpy(d, s, 0) ==> d */
1022 ir_node *mem = get_Call_mem(call);
1024 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMCPY);
1025 replace_call(dst, call, mem, NULL, NULL);
1031 int i_mapper_mempcpy(ir_node *call, void *ctx)
1033 ir_node *dst = get_Call_param(call, 0);
1034 ir_node *src = get_Call_param(call, 1);
1035 ir_node *len = get_Call_param(call, 2);
1038 if (dst == src || (is_Const(len) && is_Const_null(len))) {
1039 /* a memcpy(d, d, len) ==> d + len OR
1040 a memcpy(d, s, 0) ==> d + 0 */
1041 dbg_info *dbg = get_irn_dbg_info(call);
1042 ir_node *mem = get_Call_mem(call);
1043 ir_node *blk = get_nodes_block(call);
1044 ir_mode *mode = get_irn_mode(dst);
1045 ir_node *res = new_rd_Add(dbg, blk, dst, len, mode);
1047 DBG_OPT_ALGSIM0(call, res, FS_OPT_RTS_MEMPCPY);
1048 replace_call(res, call, mem, NULL, NULL);
1054 int i_mapper_memmove(ir_node *call, void *ctx)
1056 ir_node *dst = get_Call_param(call, 0);
1057 ir_node *src = get_Call_param(call, 1);
1058 ir_node *len = get_Call_param(call, 2);
1061 if (dst == src || (is_Const(len) && is_Const_null(len))) {
1062 /* a memmove(d, d, len) ==> d OR
1063 a memmove(d, s, 0) ==> d */
1064 ir_node *mem = get_Call_mem(call);
1066 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMMOVE);
1067 replace_call(dst, call, mem, NULL, NULL);
1073 int i_mapper_memset(ir_node *call, void *ctx)
1075 ir_node *len = get_Call_param(call, 2);
1078 if (is_Const(len) && is_Const_null(len)) {
1079 /* a memset(d, C, 0) ==> d */
1080 ir_node *mem = get_Call_mem(call);
1081 ir_node *dst = get_Call_param(call, 0);
1083 DBG_OPT_ALGSIM0(call, dst, FS_OPT_RTS_MEMSET);
1084 replace_call(dst, call, mem, NULL, NULL);
1090 int i_mapper_memcmp(ir_node *call, void *ctx)
1092 ir_node *left = get_Call_param(call, 0);
1093 ir_node *right = get_Call_param(call, 1);
1094 ir_node *len = get_Call_param(call, 2);
1098 if (left == right || (is_Const(len) && is_Const_null(len))) {
1099 /* a memcmp(s, s, len) ==> 0 OR
1100 a memcmp(a, b, 0) ==> 0 */
1101 ir_graph *irg = get_irn_irg(call);
1102 ir_node *mem = get_Call_mem(call);
1103 ir_node *adr = get_Call_ptr(call);
1104 ir_entity *ent = get_SymConst_entity(adr);
1105 ir_type *call_tp = get_entity_type(ent);
1106 ir_type *res_tp = get_method_res_type(call_tp, 0);
1107 ir_mode *mode = get_type_mode(res_tp);
1109 irn = new_r_Const(irg, get_mode_null(mode));
1110 DBG_OPT_ALGSIM0(call, irn, FS_OPT_RTS_STRNCMP);
1111 replace_call(irn, call, mem, NULL, NULL);
1118 * Returns the result mode of a node.
1120 static ir_mode *get_irn_res_mode(ir_node *node)
1122 switch (get_irn_opcode(node)) {
1123 case iro_Load: return get_Load_mode(node);
1124 case iro_Div: return get_Div_resmode(node);
1125 case iro_Mod: return get_Mod_resmode(node);
1126 default: return NULL;
1130 int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt)
1132 int i, j, arity, first, n_param, n_res;
1135 ir_node *mem, *bl, *call, *addr, *res_proj;
1137 bool throws_exception;
1140 symconst_symbol sym;
1141 ir_mode *mode = get_irn_mode(node);
1143 if (mode != rt->mode)
1145 /* check if the result modes match */
1146 if (mode == mode_T && rt->res_mode != NULL) {
1147 mode = get_irn_res_mode(node);
1148 if (mode != rt->res_mode)
1152 arity = get_irn_arity(node);
1156 mtp = get_entity_type(rt->ent);
1157 n_param = get_method_n_params(mtp);
1158 irg = current_ir_graph;
1160 mem = get_irn_n(node, 0);
1161 if (get_irn_mode(mem) != mode_M) {
1162 mem = new_r_NoMem(irg);
1167 /* check if the modes of the predecessors match the parameter modes */
1168 if (arity - first != n_param)
1171 for (i = first, j = 0; i < arity; ++i, ++j) {
1172 ir_type *param_tp = get_method_param_type(mtp, j);
1173 ir_node *pred = get_irn_n(node, i);
1175 if (get_type_mode(param_tp) != get_irn_mode(pred))
1179 n_res = get_method_n_ress(mtp);
1180 throws_exception = ir_throws_exception(node);
1182 /* step 0: calculate the number of needed Proj's */
1184 n_proj = MAX(n_proj, rt->mem_proj_nr + 1);
1185 n_proj = MAX(n_proj, rt->res_proj_nr + 1);
1186 if (throws_exception) {
1187 n_proj = MAX(n_proj, rt->regular_proj_nr + 1);
1188 n_proj = MAX(n_proj, rt->exc_proj_nr + 1);
1192 if (rt->mode != mode_T) /* must be mode_T */
1197 if (get_type_mode(get_method_res_type(mtp, 0)) != rt->mode)
1201 /* ok, when we are here, the number of predecessors match as well as the parameter modes */
1202 bl = get_nodes_block(node);
1203 op = get_irn_op(node);
1207 NEW_ARR_A(ir_node *, in, n_param);
1208 for (i = 0; i < n_param; ++i)
1209 in[i] = get_irn_n(node, first + i);
1212 /* step 1: create the call */
1213 sym.entity_p = rt->ent;
1214 addr = new_r_SymConst(irg, mode_P_code, sym, symconst_addr_ent);
1215 call = new_rd_Call(get_irn_dbg_info(node), bl, mem, addr, n_param, in, mtp);
1216 set_irn_pinned(call, get_irn_pinned(node));
1219 res_proj = new_r_Proj(call, mode_T, pn_Call_T_result);
1224 n_proj += n_res - 1;
1227 turn_into_tuple(node, n_proj);
1229 if (rt->mem_proj_nr >= 0)
1230 set_Tuple_pred(node, rt->mem_proj_nr, new_r_Proj(call, mode_M, pn_Call_M));
1231 if (throws_exception) {
1232 set_Tuple_pred(node, op->pn_x_regular, new_r_Proj(call, mode_X, pn_Call_X_regular));
1233 set_Tuple_pred(node, op->pn_x_except, new_r_Proj(call, mode_X, pn_Call_X_except));
1236 if (rt->res_proj_nr >= 0) {
1237 for (i = 0; i < n_res; ++i) {
1238 ir_mode *mode = get_type_mode(get_method_res_type(mtp, i));
1239 ir_node *proj = new_r_Proj(res_proj, mode, i);
1240 set_Tuple_pred(node, rt->res_proj_nr + i, proj);
1245 /* only one return value supported */
1247 ir_mode *mode = get_type_mode(get_method_res_type(mtp, 0));
1249 res_proj = new_r_Proj(call, mode_T, pn_Call_T_result);
1250 res_proj = new_r_Proj(res_proj, mode, 0);
1252 exchange(node, res_proj);
1256 /* should not happen */