1 /* Expand the basic unary and binary arithmetic operations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
25 #include "coretypes.h"
29 /* Include insn-config.h before expr.h so that HAVE_conditional_move
30 is properly defined. */
31 #include "insn-config.h"
45 #include "basic-block.h"
48 /* Each optab contains info on how this target machine
49 can perform a particular operation
50 for all sizes and kinds of operands.
52 The operation to be performed is often specified
53 by passing one of these optabs as an argument.
55 See expr.h for documentation of these optabs. */
57 optab optab_table[OTI_MAX];
59 rtx libfunc_table[LTI_MAX];
61 /* Tables of patterns for converting one mode to another. */
62 convert_optab convert_optab_table[COI_MAX];
64 /* Contains the optab used for each rtx code. */
65 optab code_to_optab[NUM_RTX_CODE + 1];
67 /* Indexed by the rtx-code for a conditional (eg. EQ, LT,...)
68 gives the gen_function to make a branch to test that condition. */
70 rtxfun bcc_gen_fctn[NUM_RTX_CODE];
72 /* Indexed by the rtx-code for a conditional (eg. EQ, LT,...)
73 gives the insn code to make a store-condition insn
74 to test that condition. */
76 enum insn_code setcc_gen_code[NUM_RTX_CODE];
78 #ifdef HAVE_conditional_move
79 /* Indexed by the machine mode, gives the insn code to make a conditional
80 move insn. This is not indexed by the rtx-code like bcc_gen_fctn and
81 setcc_gen_code to cut down on the number of named patterns. Consider a day
82 when a lot more rtx codes are conditional (eg: for the ARM). */
84 enum insn_code movcc_gen_code[NUM_MACHINE_MODES];
87 /* Indexed by the machine mode, gives the insn code for vector conditional
90 enum insn_code vcond_gen_code[NUM_MACHINE_MODES];
91 enum insn_code vcondu_gen_code[NUM_MACHINE_MODES];
93 /* The insn generating function can not take an rtx_code argument.
94 TRAP_RTX is used as an rtx argument. Its code is replaced with
95 the code to be used in the trap insn and all other fields are ignored. */
96 static GTY(()) rtx trap_rtx;
98 static int add_equal_note (rtx, rtx, enum rtx_code, rtx, rtx);
99 static rtx widen_operand (rtx, enum machine_mode, enum machine_mode, int,
101 static void prepare_cmp_insn (rtx *, rtx *, enum rtx_code *, rtx,
102 enum machine_mode *, int *,
103 enum can_compare_purpose);
104 static enum insn_code can_fix_p (enum machine_mode, enum machine_mode, int,
106 static enum insn_code can_float_p (enum machine_mode, enum machine_mode, int);
107 static optab new_optab (void);
108 static convert_optab new_convert_optab (void);
109 static inline optab init_optab (enum rtx_code);
110 static inline optab init_optabv (enum rtx_code);
111 static inline convert_optab init_convert_optab (enum rtx_code);
112 static void init_libfuncs (optab, int, int, const char *, int);
113 static void init_integral_libfuncs (optab, const char *, int);
114 static void init_floating_libfuncs (optab, const char *, int);
115 static void init_interclass_conv_libfuncs (convert_optab, const char *,
116 enum mode_class, enum mode_class);
117 static void init_intraclass_conv_libfuncs (convert_optab, const char *,
118 enum mode_class, bool);
119 static void emit_cmp_and_jump_insn_1 (rtx, rtx, enum machine_mode,
120 enum rtx_code, int, rtx);
121 static void prepare_float_lib_cmp (rtx *, rtx *, enum rtx_code *,
122 enum machine_mode *, int *);
123 static rtx widen_clz (enum machine_mode, rtx, rtx);
124 static rtx expand_parity (enum machine_mode, rtx, rtx);
125 static enum rtx_code get_rtx_code (enum tree_code, bool);
126 static rtx vector_compare_rtx (tree, bool, enum insn_code);
128 #ifndef HAVE_conditional_trap
129 #define HAVE_conditional_trap 0
130 #define gen_conditional_trap(a,b) (gcc_unreachable (), NULL_RTX)
133 /* Add a REG_EQUAL note to the last insn in INSNS. TARGET is being set to
134 the result of operation CODE applied to OP0 (and OP1 if it is a binary
137 If the last insn does not set TARGET, don't do anything, but return 1.
139 If a previous insn sets TARGET and TARGET is one of OP0 or OP1,
140 don't add the REG_EQUAL note but return 0. Our caller can then try
141 again, ensuring that TARGET is not one of the operands. */
144 add_equal_note (rtx insns, rtx target, enum rtx_code code, rtx op0, rtx op1)
146 rtx last_insn, insn, set;
149 gcc_assert (insns && INSN_P (insns) && NEXT_INSN (insns));
151 if (GET_RTX_CLASS (code) != RTX_COMM_ARITH
152 && GET_RTX_CLASS (code) != RTX_BIN_ARITH
153 && GET_RTX_CLASS (code) != RTX_COMM_COMPARE
154 && GET_RTX_CLASS (code) != RTX_COMPARE
155 && GET_RTX_CLASS (code) != RTX_UNARY)
158 if (GET_CODE (target) == ZERO_EXTRACT)
161 for (last_insn = insns;
162 NEXT_INSN (last_insn) != NULL_RTX;
163 last_insn = NEXT_INSN (last_insn))
166 set = single_set (last_insn);
170 if (! rtx_equal_p (SET_DEST (set), target)
171 /* For a STRICT_LOW_PART, the REG_NOTE applies to what is inside it. */
172 && (GET_CODE (SET_DEST (set)) != STRICT_LOW_PART
173 || ! rtx_equal_p (XEXP (SET_DEST (set), 0), target)))
176 /* If TARGET is in OP0 or OP1, check if anything in SEQ sets TARGET
177 besides the last insn. */
178 if (reg_overlap_mentioned_p (target, op0)
179 || (op1 && reg_overlap_mentioned_p (target, op1)))
181 insn = PREV_INSN (last_insn);
182 while (insn != NULL_RTX)
184 if (reg_set_p (target, insn))
187 insn = PREV_INSN (insn);
191 if (GET_RTX_CLASS (code) == RTX_UNARY)
192 note = gen_rtx_fmt_e (code, GET_MODE (target), copy_rtx (op0));
194 note = gen_rtx_fmt_ee (code, GET_MODE (target), copy_rtx (op0), copy_rtx (op1));
196 set_unique_reg_note (last_insn, REG_EQUAL, note);
201 /* Widen OP to MODE and return the rtx for the widened operand. UNSIGNEDP
202 says whether OP is signed or unsigned. NO_EXTEND is nonzero if we need
203 not actually do a sign-extend or zero-extend, but can leave the
204 higher-order bits of the result rtx undefined, for example, in the case
205 of logical operations, but not right shifts. */
208 widen_operand (rtx op, enum machine_mode mode, enum machine_mode oldmode,
209 int unsignedp, int no_extend)
213 /* If we don't have to extend and this is a constant, return it. */
214 if (no_extend && GET_MODE (op) == VOIDmode)
217 /* If we must extend do so. If OP is a SUBREG for a promoted object, also
218 extend since it will be more efficient to do so unless the signedness of
219 a promoted object differs from our extension. */
221 || (GET_CODE (op) == SUBREG && SUBREG_PROMOTED_VAR_P (op)
222 && SUBREG_PROMOTED_UNSIGNED_P (op) == unsignedp))
223 return convert_modes (mode, oldmode, op, unsignedp);
225 /* If MODE is no wider than a single word, we return a paradoxical
227 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
228 return gen_rtx_SUBREG (mode, force_reg (GET_MODE (op), op), 0);
230 /* Otherwise, get an object of MODE, clobber it, and set the low-order
233 result = gen_reg_rtx (mode);
234 emit_insn (gen_rtx_CLOBBER (VOIDmode, result));
235 emit_move_insn (gen_lowpart (GET_MODE (op), result), op);
239 /* Return the optab used for computing the operation given by
240 the tree code, CODE. This function is not always usable (for
241 example, it cannot give complete results for multiplication
242 or division) but probably ought to be relied on more widely
243 throughout the expander. */
245 optab_for_tree_code (enum tree_code code, tree type)
257 return one_cmpl_optab;
266 return TYPE_UNSIGNED (type) ? umod_optab : smod_optab;
274 return TYPE_UNSIGNED (type) ? udiv_optab : sdiv_optab;
280 return TYPE_UNSIGNED (type) ? lshr_optab : ashr_optab;
289 return TYPE_UNSIGNED (type) ? umax_optab : smax_optab;
292 return TYPE_UNSIGNED (type) ? umin_optab : smin_optab;
294 case REALIGN_LOAD_EXPR:
295 return vec_realign_load_optab;
298 return TYPE_UNSIGNED (type) ? usum_widen_optab : ssum_widen_optab;
301 return TYPE_UNSIGNED (type) ? udot_prod_optab : sdot_prod_optab;
304 return TYPE_UNSIGNED (type) ? reduc_umax_optab : reduc_smax_optab;
307 return TYPE_UNSIGNED (type) ? reduc_umin_optab : reduc_smin_optab;
309 case REDUC_PLUS_EXPR:
310 return TYPE_UNSIGNED (type) ? reduc_uplus_optab : reduc_splus_optab;
312 case VEC_LSHIFT_EXPR:
313 return vec_shl_optab;
315 case VEC_RSHIFT_EXPR:
316 return vec_shr_optab;
322 trapv = flag_trapv && INTEGRAL_TYPE_P (type) && !TYPE_UNSIGNED (type);
326 return trapv ? addv_optab : add_optab;
329 return trapv ? subv_optab : sub_optab;
332 return trapv ? smulv_optab : smul_optab;
335 return trapv ? negv_optab : neg_optab;
338 return trapv ? absv_optab : abs_optab;
346 /* Expand vector widening operations.
348 There are two different classes of operations handled here:
349 1) Operations whose result is wider than all the arguments to the operation.
350 Examples: VEC_UNPACK_HI/LO_EXPR, VEC_WIDEN_MULT_HI/LO_EXPR
351 In this case OP0 and optionally OP1 would be initialized,
352 but WIDE_OP wouldn't (not relevant for this case).
353 2) Operations whose result is of the same size as the last argument to the
354 operation, but wider than all the other arguments to the operation.
355 Examples: WIDEN_SUM_EXPR, VEC_DOT_PROD_EXPR.
356 In the case WIDE_OP, OP0 and optionally OP1 would be initialized.
358 E.g, when called to expand the following operations, this is how
359 the arguments will be initialized:
361 widening-sum 2 oprnd0 - oprnd1
362 widening-dot-product 3 oprnd0 oprnd1 oprnd2
363 widening-mult 2 oprnd0 oprnd1 -
364 type-promotion (vec-unpack) 1 oprnd0 - - */
367 expand_widen_pattern_expr (tree exp, rtx op0, rtx op1, rtx wide_op, rtx target,
370 tree oprnd0, oprnd1, oprnd2;
371 enum machine_mode wmode = 0, tmode0, tmode1 = 0;
372 optab widen_pattern_optab;
374 enum machine_mode xmode0, xmode1 = 0, wxmode = 0;
377 rtx xop0, xop1, wxop;
378 int nops = TREE_CODE_LENGTH (TREE_CODE (exp));
380 oprnd0 = TREE_OPERAND (exp, 0);
381 tmode0 = TYPE_MODE (TREE_TYPE (oprnd0));
382 widen_pattern_optab =
383 optab_for_tree_code (TREE_CODE (exp), TREE_TYPE (oprnd0));
384 icode = (int) widen_pattern_optab->handlers[(int) tmode0].insn_code;
385 gcc_assert (icode != CODE_FOR_nothing);
386 xmode0 = insn_data[icode].operand[1].mode;
390 oprnd1 = TREE_OPERAND (exp, 1);
391 tmode1 = TYPE_MODE (TREE_TYPE (oprnd1));
392 xmode1 = insn_data[icode].operand[2].mode;
395 /* The last operand is of a wider mode than the rest of the operands. */
403 gcc_assert (tmode1 == tmode0);
405 oprnd2 = TREE_OPERAND (exp, 2);
406 wmode = TYPE_MODE (TREE_TYPE (oprnd2));
407 wxmode = insn_data[icode].operand[3].mode;
411 wmode = wxmode = insn_data[icode].operand[0].mode;
414 || ! (*insn_data[icode].operand[0].predicate) (target, wmode))
415 temp = gen_reg_rtx (wmode);
423 /* In case the insn wants input operands in modes different from
424 those of the actual operands, convert the operands. It would
425 seem that we don't need to convert CONST_INTs, but we do, so
426 that they're properly zero-extended, sign-extended or truncated
429 if (GET_MODE (op0) != xmode0 && xmode0 != VOIDmode)
430 xop0 = convert_modes (xmode0,
431 GET_MODE (op0) != VOIDmode
437 if (GET_MODE (op1) != xmode1 && xmode1 != VOIDmode)
438 xop1 = convert_modes (xmode1,
439 GET_MODE (op1) != VOIDmode
445 if (GET_MODE (wide_op) != wxmode && wxmode != VOIDmode)
446 wxop = convert_modes (wxmode,
447 GET_MODE (wide_op) != VOIDmode
452 /* Now, if insn's predicates don't allow our operands, put them into
455 if (! (*insn_data[icode].operand[1].predicate) (xop0, xmode0)
456 && xmode0 != VOIDmode)
457 xop0 = copy_to_mode_reg (xmode0, xop0);
461 if (! (*insn_data[icode].operand[2].predicate) (xop1, xmode1)
462 && xmode1 != VOIDmode)
463 xop1 = copy_to_mode_reg (xmode1, xop1);
467 if (! (*insn_data[icode].operand[3].predicate) (wxop, wxmode)
468 && wxmode != VOIDmode)
469 wxop = copy_to_mode_reg (wxmode, wxop);
471 pat = GEN_FCN (icode) (temp, xop0, xop1, wxop);
474 pat = GEN_FCN (icode) (temp, xop0, xop1);
480 if (! (*insn_data[icode].operand[2].predicate) (wxop, wxmode)
481 && wxmode != VOIDmode)
482 wxop = copy_to_mode_reg (wxmode, wxop);
484 pat = GEN_FCN (icode) (temp, xop0, wxop);
487 pat = GEN_FCN (icode) (temp, xop0);
494 /* Generate code to perform an operation specified by TERNARY_OPTAB
495 on operands OP0, OP1 and OP2, with result having machine-mode MODE.
497 UNSIGNEDP is for the case where we have to widen the operands
498 to perform the operation. It says to use zero-extension.
500 If TARGET is nonzero, the value
501 is generated there, if it is convenient to do so.
502 In all cases an rtx is returned for the locus of the value;
503 this may or may not be TARGET. */
506 expand_ternary_op (enum machine_mode mode, optab ternary_optab, rtx op0,
507 rtx op1, rtx op2, rtx target, int unsignedp)
509 int icode = (int) ternary_optab->handlers[(int) mode].insn_code;
510 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
511 enum machine_mode mode1 = insn_data[icode].operand[2].mode;
512 enum machine_mode mode2 = insn_data[icode].operand[3].mode;
515 rtx xop0 = op0, xop1 = op1, xop2 = op2;
517 gcc_assert (ternary_optab->handlers[(int) mode].insn_code
518 != CODE_FOR_nothing);
520 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
521 temp = gen_reg_rtx (mode);
525 /* In case the insn wants input operands in modes different from
526 those of the actual operands, convert the operands. It would
527 seem that we don't need to convert CONST_INTs, but we do, so
528 that they're properly zero-extended, sign-extended or truncated
531 if (GET_MODE (op0) != mode0 && mode0 != VOIDmode)
532 xop0 = convert_modes (mode0,
533 GET_MODE (op0) != VOIDmode
538 if (GET_MODE (op1) != mode1 && mode1 != VOIDmode)
539 xop1 = convert_modes (mode1,
540 GET_MODE (op1) != VOIDmode
545 if (GET_MODE (op2) != mode2 && mode2 != VOIDmode)
546 xop2 = convert_modes (mode2,
547 GET_MODE (op2) != VOIDmode
552 /* Now, if insn's predicates don't allow our operands, put them into
555 if (!insn_data[icode].operand[1].predicate (xop0, mode0)
556 && mode0 != VOIDmode)
557 xop0 = copy_to_mode_reg (mode0, xop0);
559 if (!insn_data[icode].operand[2].predicate (xop1, mode1)
560 && mode1 != VOIDmode)
561 xop1 = copy_to_mode_reg (mode1, xop1);
563 if (!insn_data[icode].operand[3].predicate (xop2, mode2)
564 && mode2 != VOIDmode)
565 xop2 = copy_to_mode_reg (mode2, xop2);
567 pat = GEN_FCN (icode) (temp, xop0, xop1, xop2);
574 /* Like expand_binop, but return a constant rtx if the result can be
575 calculated at compile time. The arguments and return value are
576 otherwise the same as for expand_binop. */
579 simplify_expand_binop (enum machine_mode mode, optab binoptab,
580 rtx op0, rtx op1, rtx target, int unsignedp,
581 enum optab_methods methods)
583 if (CONSTANT_P (op0) && CONSTANT_P (op1))
585 rtx x = simplify_binary_operation (binoptab->code, mode, op0, op1);
591 return expand_binop (mode, binoptab, op0, op1, target, unsignedp, methods);
594 /* Like simplify_expand_binop, but always put the result in TARGET.
595 Return true if the expansion succeeded. */
598 force_expand_binop (enum machine_mode mode, optab binoptab,
599 rtx op0, rtx op1, rtx target, int unsignedp,
600 enum optab_methods methods)
602 rtx x = simplify_expand_binop (mode, binoptab, op0, op1,
603 target, unsignedp, methods);
607 emit_move_insn (target, x);
611 /* Generate insns for VEC_LSHIFT_EXPR, VEC_RSHIFT_EXPR. */
614 expand_vec_shift_expr (tree vec_shift_expr, rtx target)
616 enum insn_code icode;
617 rtx rtx_op1, rtx_op2;
618 enum machine_mode mode1;
619 enum machine_mode mode2;
620 enum machine_mode mode = TYPE_MODE (TREE_TYPE (vec_shift_expr));
621 tree vec_oprnd = TREE_OPERAND (vec_shift_expr, 0);
622 tree shift_oprnd = TREE_OPERAND (vec_shift_expr, 1);
626 switch (TREE_CODE (vec_shift_expr))
628 case VEC_RSHIFT_EXPR:
629 shift_optab = vec_shr_optab;
631 case VEC_LSHIFT_EXPR:
632 shift_optab = vec_shl_optab;
638 icode = (int) shift_optab->handlers[(int) mode].insn_code;
639 gcc_assert (icode != CODE_FOR_nothing);
641 mode1 = insn_data[icode].operand[1].mode;
642 mode2 = insn_data[icode].operand[2].mode;
644 rtx_op1 = expand_expr (vec_oprnd, NULL_RTX, VOIDmode, EXPAND_NORMAL);
645 if (!(*insn_data[icode].operand[1].predicate) (rtx_op1, mode1)
646 && mode1 != VOIDmode)
647 rtx_op1 = force_reg (mode1, rtx_op1);
649 rtx_op2 = expand_expr (shift_oprnd, NULL_RTX, VOIDmode, EXPAND_NORMAL);
650 if (!(*insn_data[icode].operand[2].predicate) (rtx_op2, mode2)
651 && mode2 != VOIDmode)
652 rtx_op2 = force_reg (mode2, rtx_op2);
655 || ! (*insn_data[icode].operand[0].predicate) (target, mode))
656 target = gen_reg_rtx (mode);
658 /* Emit instruction */
659 pat = GEN_FCN (icode) (target, rtx_op1, rtx_op2);
666 /* This subroutine of expand_doubleword_shift handles the cases in which
667 the effective shift value is >= BITS_PER_WORD. The arguments and return
668 value are the same as for the parent routine, except that SUPERWORD_OP1
669 is the shift count to use when shifting OUTOF_INPUT into INTO_TARGET.
670 INTO_TARGET may be null if the caller has decided to calculate it. */
673 expand_superword_shift (optab binoptab, rtx outof_input, rtx superword_op1,
674 rtx outof_target, rtx into_target,
675 int unsignedp, enum optab_methods methods)
677 if (into_target != 0)
678 if (!force_expand_binop (word_mode, binoptab, outof_input, superword_op1,
679 into_target, unsignedp, methods))
682 if (outof_target != 0)
684 /* For a signed right shift, we must fill OUTOF_TARGET with copies
685 of the sign bit, otherwise we must fill it with zeros. */
686 if (binoptab != ashr_optab)
687 emit_move_insn (outof_target, CONST0_RTX (word_mode));
689 if (!force_expand_binop (word_mode, binoptab,
690 outof_input, GEN_INT (BITS_PER_WORD - 1),
691 outof_target, unsignedp, methods))
697 /* This subroutine of expand_doubleword_shift handles the cases in which
698 the effective shift value is < BITS_PER_WORD. The arguments and return
699 value are the same as for the parent routine. */
702 expand_subword_shift (enum machine_mode op1_mode, optab binoptab,
703 rtx outof_input, rtx into_input, rtx op1,
704 rtx outof_target, rtx into_target,
705 int unsignedp, enum optab_methods methods,
706 unsigned HOST_WIDE_INT shift_mask)
708 optab reverse_unsigned_shift, unsigned_shift;
711 reverse_unsigned_shift = (binoptab == ashl_optab ? lshr_optab : ashl_optab);
712 unsigned_shift = (binoptab == ashl_optab ? ashl_optab : lshr_optab);
714 /* The low OP1 bits of INTO_TARGET come from the high bits of OUTOF_INPUT.
715 We therefore need to shift OUTOF_INPUT by (BITS_PER_WORD - OP1) bits in
716 the opposite direction to BINOPTAB. */
717 if (CONSTANT_P (op1) || shift_mask >= BITS_PER_WORD)
719 carries = outof_input;
720 tmp = immed_double_const (BITS_PER_WORD, 0, op1_mode);
721 tmp = simplify_expand_binop (op1_mode, sub_optab, tmp, op1,
726 /* We must avoid shifting by BITS_PER_WORD bits since that is either
727 the same as a zero shift (if shift_mask == BITS_PER_WORD - 1) or
728 has unknown behavior. Do a single shift first, then shift by the
729 remainder. It's OK to use ~OP1 as the remainder if shift counts
730 are truncated to the mode size. */
731 carries = expand_binop (word_mode, reverse_unsigned_shift,
732 outof_input, const1_rtx, 0, unsignedp, methods);
733 if (shift_mask == BITS_PER_WORD - 1)
735 tmp = immed_double_const (-1, -1, op1_mode);
736 tmp = simplify_expand_binop (op1_mode, xor_optab, op1, tmp,
741 tmp = immed_double_const (BITS_PER_WORD - 1, 0, op1_mode);
742 tmp = simplify_expand_binop (op1_mode, sub_optab, tmp, op1,
746 if (tmp == 0 || carries == 0)
748 carries = expand_binop (word_mode, reverse_unsigned_shift,
749 carries, tmp, 0, unsignedp, methods);
753 /* Shift INTO_INPUT logically by OP1. This is the last use of INTO_INPUT
754 so the result can go directly into INTO_TARGET if convenient. */
755 tmp = expand_binop (word_mode, unsigned_shift, into_input, op1,
756 into_target, unsignedp, methods);
760 /* Now OR in the bits carried over from OUTOF_INPUT. */
761 if (!force_expand_binop (word_mode, ior_optab, tmp, carries,
762 into_target, unsignedp, methods))
765 /* Use a standard word_mode shift for the out-of half. */
766 if (outof_target != 0)
767 if (!force_expand_binop (word_mode, binoptab, outof_input, op1,
768 outof_target, unsignedp, methods))
775 #ifdef HAVE_conditional_move
776 /* Try implementing expand_doubleword_shift using conditional moves.
777 The shift is by < BITS_PER_WORD if (CMP_CODE CMP1 CMP2) is true,
778 otherwise it is by >= BITS_PER_WORD. SUBWORD_OP1 and SUPERWORD_OP1
779 are the shift counts to use in the former and latter case. All other
780 arguments are the same as the parent routine. */
783 expand_doubleword_shift_condmove (enum machine_mode op1_mode, optab binoptab,
784 enum rtx_code cmp_code, rtx cmp1, rtx cmp2,
785 rtx outof_input, rtx into_input,
786 rtx subword_op1, rtx superword_op1,
787 rtx outof_target, rtx into_target,
788 int unsignedp, enum optab_methods methods,
789 unsigned HOST_WIDE_INT shift_mask)
791 rtx outof_superword, into_superword;
793 /* Put the superword version of the output into OUTOF_SUPERWORD and
795 outof_superword = outof_target != 0 ? gen_reg_rtx (word_mode) : 0;
796 if (outof_target != 0 && subword_op1 == superword_op1)
798 /* The value INTO_TARGET >> SUBWORD_OP1, which we later store in
799 OUTOF_TARGET, is the same as the value of INTO_SUPERWORD. */
800 into_superword = outof_target;
801 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
802 outof_superword, 0, unsignedp, methods))
807 into_superword = gen_reg_rtx (word_mode);
808 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
809 outof_superword, into_superword,
814 /* Put the subword version directly in OUTOF_TARGET and INTO_TARGET. */
815 if (!expand_subword_shift (op1_mode, binoptab,
816 outof_input, into_input, subword_op1,
817 outof_target, into_target,
818 unsignedp, methods, shift_mask))
821 /* Select between them. Do the INTO half first because INTO_SUPERWORD
822 might be the current value of OUTOF_TARGET. */
823 if (!emit_conditional_move (into_target, cmp_code, cmp1, cmp2, op1_mode,
824 into_target, into_superword, word_mode, false))
827 if (outof_target != 0)
828 if (!emit_conditional_move (outof_target, cmp_code, cmp1, cmp2, op1_mode,
829 outof_target, outof_superword,
837 /* Expand a doubleword shift (ashl, ashr or lshr) using word-mode shifts.
838 OUTOF_INPUT and INTO_INPUT are the two word-sized halves of the first
839 input operand; the shift moves bits in the direction OUTOF_INPUT->
840 INTO_TARGET. OUTOF_TARGET and INTO_TARGET are the equivalent words
841 of the target. OP1 is the shift count and OP1_MODE is its mode.
842 If OP1 is constant, it will have been truncated as appropriate
843 and is known to be nonzero.
845 If SHIFT_MASK is zero, the result of word shifts is undefined when the
846 shift count is outside the range [0, BITS_PER_WORD). This routine must
847 avoid generating such shifts for OP1s in the range [0, BITS_PER_WORD * 2).
849 If SHIFT_MASK is nonzero, all word-mode shift counts are effectively
850 masked by it and shifts in the range [BITS_PER_WORD, SHIFT_MASK) will
851 fill with zeros or sign bits as appropriate.
853 If SHIFT_MASK is BITS_PER_WORD - 1, this routine will synthesize
854 a doubleword shift whose equivalent mask is BITS_PER_WORD * 2 - 1.
855 Doing this preserves semantics required by SHIFT_COUNT_TRUNCATED.
856 In all other cases, shifts by values outside [0, BITS_PER_UNIT * 2)
859 BINOPTAB, UNSIGNEDP and METHODS are as for expand_binop. This function
860 may not use INTO_INPUT after modifying INTO_TARGET, and similarly for
861 OUTOF_INPUT and OUTOF_TARGET. OUTOF_TARGET can be null if the parent
862 function wants to calculate it itself.
864 Return true if the shift could be successfully synthesized. */
867 expand_doubleword_shift (enum machine_mode op1_mode, optab binoptab,
868 rtx outof_input, rtx into_input, rtx op1,
869 rtx outof_target, rtx into_target,
870 int unsignedp, enum optab_methods methods,
871 unsigned HOST_WIDE_INT shift_mask)
873 rtx superword_op1, tmp, cmp1, cmp2;
874 rtx subword_label, done_label;
875 enum rtx_code cmp_code;
877 /* See if word-mode shifts by BITS_PER_WORD...BITS_PER_WORD * 2 - 1 will
878 fill the result with sign or zero bits as appropriate. If so, the value
879 of OUTOF_TARGET will always be (SHIFT OUTOF_INPUT OP1). Recursively call
880 this routine to calculate INTO_TARGET (which depends on both OUTOF_INPUT
881 and INTO_INPUT), then emit code to set up OUTOF_TARGET.
883 This isn't worthwhile for constant shifts since the optimizers will
884 cope better with in-range shift counts. */
885 if (shift_mask >= BITS_PER_WORD
887 && !CONSTANT_P (op1))
889 if (!expand_doubleword_shift (op1_mode, binoptab,
890 outof_input, into_input, op1,
892 unsignedp, methods, shift_mask))
894 if (!force_expand_binop (word_mode, binoptab, outof_input, op1,
895 outof_target, unsignedp, methods))
900 /* Set CMP_CODE, CMP1 and CMP2 so that the rtx (CMP_CODE CMP1 CMP2)
901 is true when the effective shift value is less than BITS_PER_WORD.
902 Set SUPERWORD_OP1 to the shift count that should be used to shift
903 OUTOF_INPUT into INTO_TARGET when the condition is false. */
904 tmp = immed_double_const (BITS_PER_WORD, 0, op1_mode);
905 if (!CONSTANT_P (op1) && shift_mask == BITS_PER_WORD - 1)
907 /* Set CMP1 to OP1 & BITS_PER_WORD. The result is zero iff OP1
908 is a subword shift count. */
909 cmp1 = simplify_expand_binop (op1_mode, and_optab, op1, tmp,
911 cmp2 = CONST0_RTX (op1_mode);
917 /* Set CMP1 to OP1 - BITS_PER_WORD. */
918 cmp1 = simplify_expand_binop (op1_mode, sub_optab, op1, tmp,
920 cmp2 = CONST0_RTX (op1_mode);
922 superword_op1 = cmp1;
927 /* If we can compute the condition at compile time, pick the
928 appropriate subroutine. */
929 tmp = simplify_relational_operation (cmp_code, SImode, op1_mode, cmp1, cmp2);
930 if (tmp != 0 && GET_CODE (tmp) == CONST_INT)
932 if (tmp == const0_rtx)
933 return expand_superword_shift (binoptab, outof_input, superword_op1,
934 outof_target, into_target,
937 return expand_subword_shift (op1_mode, binoptab,
938 outof_input, into_input, op1,
939 outof_target, into_target,
940 unsignedp, methods, shift_mask);
943 #ifdef HAVE_conditional_move
944 /* Try using conditional moves to generate straight-line code. */
946 rtx start = get_last_insn ();
947 if (expand_doubleword_shift_condmove (op1_mode, binoptab,
948 cmp_code, cmp1, cmp2,
949 outof_input, into_input,
951 outof_target, into_target,
952 unsignedp, methods, shift_mask))
954 delete_insns_since (start);
958 /* As a last resort, use branches to select the correct alternative. */
959 subword_label = gen_label_rtx ();
960 done_label = gen_label_rtx ();
962 do_compare_rtx_and_jump (cmp1, cmp2, cmp_code, false, op1_mode,
963 0, 0, subword_label);
965 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
966 outof_target, into_target,
970 emit_jump_insn (gen_jump (done_label));
972 emit_label (subword_label);
974 if (!expand_subword_shift (op1_mode, binoptab,
975 outof_input, into_input, op1,
976 outof_target, into_target,
977 unsignedp, methods, shift_mask))
980 emit_label (done_label);
984 /* Subroutine of expand_binop. Perform a double word multiplication of
985 operands OP0 and OP1 both of mode MODE, which is exactly twice as wide
986 as the target's word_mode. This function return NULL_RTX if anything
987 goes wrong, in which case it may have already emitted instructions
988 which need to be deleted.
990 If we want to multiply two two-word values and have normal and widening
991 multiplies of single-word values, we can do this with three smaller
992 multiplications. Note that we do not make a REG_NO_CONFLICT block here
993 because we are not operating on one word at a time.
995 The multiplication proceeds as follows:
996 _______________________
997 [__op0_high_|__op0_low__]
998 _______________________
999 * [__op1_high_|__op1_low__]
1000 _______________________________________________
1001 _______________________
1002 (1) [__op0_low__*__op1_low__]
1003 _______________________
1004 (2a) [__op0_low__*__op1_high_]
1005 _______________________
1006 (2b) [__op0_high_*__op1_low__]
1007 _______________________
1008 (3) [__op0_high_*__op1_high_]
1011 This gives a 4-word result. Since we are only interested in the
1012 lower 2 words, partial result (3) and the upper words of (2a) and
1013 (2b) don't need to be calculated. Hence (2a) and (2b) can be
1014 calculated using non-widening multiplication.
1016 (1), however, needs to be calculated with an unsigned widening
1017 multiplication. If this operation is not directly supported we
1018 try using a signed widening multiplication and adjust the result.
1019 This adjustment works as follows:
1021 If both operands are positive then no adjustment is needed.
1023 If the operands have different signs, for example op0_low < 0 and
1024 op1_low >= 0, the instruction treats the most significant bit of
1025 op0_low as a sign bit instead of a bit with significance
1026 2**(BITS_PER_WORD-1), i.e. the instruction multiplies op1_low
1027 with 2**BITS_PER_WORD - op0_low, and two's complements the
1028 result. Conclusion: We need to add op1_low * 2**BITS_PER_WORD to
1031 Similarly, if both operands are negative, we need to add
1032 (op0_low + op1_low) * 2**BITS_PER_WORD.
1034 We use a trick to adjust quickly. We logically shift op0_low right
1035 (op1_low) BITS_PER_WORD-1 steps to get 0 or 1, and add this to
1036 op0_high (op1_high) before it is used to calculate 2b (2a). If no
1037 logical shift exists, we do an arithmetic right shift and subtract
1041 expand_doubleword_mult (enum machine_mode mode, rtx op0, rtx op1, rtx target,
1042 bool umulp, enum optab_methods methods)
1044 int low = (WORDS_BIG_ENDIAN ? 1 : 0);
1045 int high = (WORDS_BIG_ENDIAN ? 0 : 1);
1046 rtx wordm1 = umulp ? NULL_RTX : GEN_INT (BITS_PER_WORD - 1);
1047 rtx product, adjust, product_high, temp;
1049 rtx op0_high = operand_subword_force (op0, high, mode);
1050 rtx op0_low = operand_subword_force (op0, low, mode);
1051 rtx op1_high = operand_subword_force (op1, high, mode);
1052 rtx op1_low = operand_subword_force (op1, low, mode);
1054 /* If we're using an unsigned multiply to directly compute the product
1055 of the low-order words of the operands and perform any required
1056 adjustments of the operands, we begin by trying two more multiplications
1057 and then computing the appropriate sum.
1059 We have checked above that the required addition is provided.
1060 Full-word addition will normally always succeed, especially if
1061 it is provided at all, so we don't worry about its failure. The
1062 multiplication may well fail, however, so we do handle that. */
1066 /* ??? This could be done with emit_store_flag where available. */
1067 temp = expand_binop (word_mode, lshr_optab, op0_low, wordm1,
1068 NULL_RTX, 1, methods);
1070 op0_high = expand_binop (word_mode, add_optab, op0_high, temp,
1071 NULL_RTX, 0, OPTAB_DIRECT);
1074 temp = expand_binop (word_mode, ashr_optab, op0_low, wordm1,
1075 NULL_RTX, 0, methods);
1078 op0_high = expand_binop (word_mode, sub_optab, op0_high, temp,
1079 NULL_RTX, 0, OPTAB_DIRECT);
1086 adjust = expand_binop (word_mode, smul_optab, op0_high, op1_low,
1087 NULL_RTX, 0, OPTAB_DIRECT);
1091 /* OP0_HIGH should now be dead. */
1095 /* ??? This could be done with emit_store_flag where available. */
1096 temp = expand_binop (word_mode, lshr_optab, op1_low, wordm1,
1097 NULL_RTX, 1, methods);
1099 op1_high = expand_binop (word_mode, add_optab, op1_high, temp,
1100 NULL_RTX, 0, OPTAB_DIRECT);
1103 temp = expand_binop (word_mode, ashr_optab, op1_low, wordm1,
1104 NULL_RTX, 0, methods);
1107 op1_high = expand_binop (word_mode, sub_optab, op1_high, temp,
1108 NULL_RTX, 0, OPTAB_DIRECT);
1115 temp = expand_binop (word_mode, smul_optab, op1_high, op0_low,
1116 NULL_RTX, 0, OPTAB_DIRECT);
1120 /* OP1_HIGH should now be dead. */
1122 adjust = expand_binop (word_mode, add_optab, adjust, temp,
1123 adjust, 0, OPTAB_DIRECT);
1125 if (target && !REG_P (target))
1129 product = expand_binop (mode, umul_widen_optab, op0_low, op1_low,
1130 target, 1, OPTAB_DIRECT);
1132 product = expand_binop (mode, smul_widen_optab, op0_low, op1_low,
1133 target, 1, OPTAB_DIRECT);
1138 product_high = operand_subword (product, high, 1, mode);
1139 adjust = expand_binop (word_mode, add_optab, product_high, adjust,
1140 REG_P (product_high) ? product_high : adjust,
1142 emit_move_insn (product_high, adjust);
1146 /* Wrapper around expand_binop which takes an rtx code to specify
1147 the operation to perform, not an optab pointer. All other
1148 arguments are the same. */
1150 expand_simple_binop (enum machine_mode mode, enum rtx_code code, rtx op0,
1151 rtx op1, rtx target, int unsignedp,
1152 enum optab_methods methods)
1154 optab binop = code_to_optab[(int) code];
1157 return expand_binop (mode, binop, op0, op1, target, unsignedp, methods);
1160 /* Return whether OP0 and OP1 should be swapped when expanding a commutative
1161 binop. Order them according to commutative_operand_precedence and, if
1162 possible, try to put TARGET or a pseudo first. */
1164 swap_commutative_operands_with_target (rtx target, rtx op0, rtx op1)
1166 int op0_prec = commutative_operand_precedence (op0);
1167 int op1_prec = commutative_operand_precedence (op1);
1169 if (op0_prec < op1_prec)
1172 if (op0_prec > op1_prec)
1175 /* With equal precedence, both orders are ok, but it is better if the
1176 first operand is TARGET, or if both TARGET and OP0 are pseudos. */
1177 if (target == 0 || REG_P (target))
1178 return (REG_P (op1) && !REG_P (op0)) || target == op1;
1180 return rtx_equal_p (op1, target);
1184 /* Generate code to perform an operation specified by BINOPTAB
1185 on operands OP0 and OP1, with result having machine-mode MODE.
1187 UNSIGNEDP is for the case where we have to widen the operands
1188 to perform the operation. It says to use zero-extension.
1190 If TARGET is nonzero, the value
1191 is generated there, if it is convenient to do so.
1192 In all cases an rtx is returned for the locus of the value;
1193 this may or may not be TARGET. */
1196 expand_binop (enum machine_mode mode, optab binoptab, rtx op0, rtx op1,
1197 rtx target, int unsignedp, enum optab_methods methods)
1199 enum optab_methods next_methods
1200 = (methods == OPTAB_LIB || methods == OPTAB_LIB_WIDEN
1201 ? OPTAB_WIDEN : methods);
1202 enum mode_class class;
1203 enum machine_mode wider_mode;
1205 int commutative_op = 0;
1206 int shift_op = (binoptab->code == ASHIFT
1207 || binoptab->code == ASHIFTRT
1208 || binoptab->code == LSHIFTRT
1209 || binoptab->code == ROTATE
1210 || binoptab->code == ROTATERT);
1211 rtx entry_last = get_last_insn ();
1213 bool first_pass_p = true;
1215 class = GET_MODE_CLASS (mode);
1217 /* If subtracting an integer constant, convert this into an addition of
1218 the negated constant. */
1220 if (binoptab == sub_optab && GET_CODE (op1) == CONST_INT)
1222 op1 = negate_rtx (mode, op1);
1223 binoptab = add_optab;
1226 /* If we are inside an appropriately-short loop and we are optimizing,
1227 force expensive constants into a register. */
1228 if (CONSTANT_P (op0) && optimize
1229 && rtx_cost (op0, binoptab->code) > COSTS_N_INSNS (1))
1231 if (GET_MODE (op0) != VOIDmode)
1232 op0 = convert_modes (mode, VOIDmode, op0, unsignedp);
1233 op0 = force_reg (mode, op0);
1236 if (CONSTANT_P (op1) && optimize
1237 && ! shift_op && rtx_cost (op1, binoptab->code) > COSTS_N_INSNS (1))
1239 if (GET_MODE (op1) != VOIDmode)
1240 op1 = convert_modes (mode, VOIDmode, op1, unsignedp);
1241 op1 = force_reg (mode, op1);
1244 /* Record where to delete back to if we backtrack. */
1245 last = get_last_insn ();
1247 /* If operation is commutative,
1248 try to make the first operand a register.
1249 Even better, try to make it the same as the target.
1250 Also try to make the last operand a constant. */
1251 if (GET_RTX_CLASS (binoptab->code) == RTX_COMM_ARITH
1252 || binoptab == smul_widen_optab
1253 || binoptab == umul_widen_optab
1254 || binoptab == smul_highpart_optab
1255 || binoptab == umul_highpart_optab)
1259 if (swap_commutative_operands_with_target (target, op0, op1))
1269 /* If we can do it with a three-operand insn, do so. */
1271 if (methods != OPTAB_MUST_WIDEN
1272 && binoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1274 int icode = (int) binoptab->handlers[(int) mode].insn_code;
1275 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
1276 enum machine_mode mode1 = insn_data[icode].operand[2].mode;
1278 rtx xop0 = op0, xop1 = op1;
1283 temp = gen_reg_rtx (mode);
1285 /* If it is a commutative operator and the modes would match
1286 if we would swap the operands, we can save the conversions. */
1289 if (GET_MODE (op0) != mode0 && GET_MODE (op1) != mode1
1290 && GET_MODE (op0) == mode1 && GET_MODE (op1) == mode0)
1294 tmp = op0; op0 = op1; op1 = tmp;
1295 tmp = xop0; xop0 = xop1; xop1 = tmp;
1299 /* In case the insn wants input operands in modes different from
1300 those of the actual operands, convert the operands. It would
1301 seem that we don't need to convert CONST_INTs, but we do, so
1302 that they're properly zero-extended, sign-extended or truncated
1305 if (GET_MODE (op0) != mode0 && mode0 != VOIDmode)
1306 xop0 = convert_modes (mode0,
1307 GET_MODE (op0) != VOIDmode
1312 if (GET_MODE (op1) != mode1 && mode1 != VOIDmode)
1313 xop1 = convert_modes (mode1,
1314 GET_MODE (op1) != VOIDmode
1319 /* Now, if insn's predicates don't allow our operands, put them into
1322 if (!insn_data[icode].operand[1].predicate (xop0, mode0)
1323 && mode0 != VOIDmode)
1324 xop0 = copy_to_mode_reg (mode0, xop0);
1326 if (!insn_data[icode].operand[2].predicate (xop1, mode1)
1327 && mode1 != VOIDmode)
1328 xop1 = copy_to_mode_reg (mode1, xop1);
1330 if (!insn_data[icode].operand[0].predicate (temp, mode))
1331 temp = gen_reg_rtx (mode);
1333 pat = GEN_FCN (icode) (temp, xop0, xop1);
1336 /* If PAT is composed of more than one insn, try to add an appropriate
1337 REG_EQUAL note to it. If we can't because TEMP conflicts with an
1338 operand, call ourselves again, this time without a target. */
1339 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX
1340 && ! add_equal_note (pat, temp, binoptab->code, xop0, xop1))
1342 delete_insns_since (last);
1343 return expand_binop (mode, binoptab, op0, op1, NULL_RTX,
1344 unsignedp, methods);
1351 delete_insns_since (last);
1354 /* If we were trying to rotate by a constant value, and that didn't
1355 work, try rotating the other direction before falling back to
1356 shifts and bitwise-or. */
1358 && (binoptab == rotl_optab || binoptab == rotr_optab)
1359 && class == MODE_INT
1360 && GET_CODE (op1) == CONST_INT
1362 && (unsigned int) INTVAL (op1) < GET_MODE_BITSIZE (mode))
1364 first_pass_p = false;
1365 op1 = GEN_INT (GET_MODE_BITSIZE (mode) - INTVAL (op1));
1366 binoptab = binoptab == rotl_optab ? rotr_optab : rotl_optab;
1370 /* If this is a multiply, see if we can do a widening operation that
1371 takes operands of this mode and makes a wider mode. */
1373 if (binoptab == smul_optab
1374 && GET_MODE_WIDER_MODE (mode) != VOIDmode
1375 && (((unsignedp ? umul_widen_optab : smul_widen_optab)
1376 ->handlers[(int) GET_MODE_WIDER_MODE (mode)].insn_code)
1377 != CODE_FOR_nothing))
1379 temp = expand_binop (GET_MODE_WIDER_MODE (mode),
1380 unsignedp ? umul_widen_optab : smul_widen_optab,
1381 op0, op1, NULL_RTX, unsignedp, OPTAB_DIRECT);
1385 if (GET_MODE_CLASS (mode) == MODE_INT
1386 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
1387 GET_MODE_BITSIZE (GET_MODE (temp))))
1388 return gen_lowpart (mode, temp);
1390 return convert_to_mode (mode, temp, unsignedp);
1394 /* Look for a wider mode of the same class for which we think we
1395 can open-code the operation. Check for a widening multiply at the
1396 wider mode as well. */
1398 if (CLASS_HAS_WIDER_MODES_P (class)
1399 && methods != OPTAB_DIRECT && methods != OPTAB_LIB)
1400 for (wider_mode = GET_MODE_WIDER_MODE (mode);
1401 wider_mode != VOIDmode;
1402 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1404 if (binoptab->handlers[(int) wider_mode].insn_code != CODE_FOR_nothing
1405 || (binoptab == smul_optab
1406 && GET_MODE_WIDER_MODE (wider_mode) != VOIDmode
1407 && (((unsignedp ? umul_widen_optab : smul_widen_optab)
1408 ->handlers[(int) GET_MODE_WIDER_MODE (wider_mode)].insn_code)
1409 != CODE_FOR_nothing)))
1411 rtx xop0 = op0, xop1 = op1;
1414 /* For certain integer operations, we need not actually extend
1415 the narrow operands, as long as we will truncate
1416 the results to the same narrowness. */
1418 if ((binoptab == ior_optab || binoptab == and_optab
1419 || binoptab == xor_optab
1420 || binoptab == add_optab || binoptab == sub_optab
1421 || binoptab == smul_optab || binoptab == ashl_optab)
1422 && class == MODE_INT)
1425 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp, no_extend);
1427 /* The second operand of a shift must always be extended. */
1428 xop1 = widen_operand (xop1, wider_mode, mode, unsignedp,
1429 no_extend && binoptab != ashl_optab);
1431 temp = expand_binop (wider_mode, binoptab, xop0, xop1, NULL_RTX,
1432 unsignedp, OPTAB_DIRECT);
1435 if (class != MODE_INT
1436 || !TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
1437 GET_MODE_BITSIZE (wider_mode)))
1440 target = gen_reg_rtx (mode);
1441 convert_move (target, temp, 0);
1445 return gen_lowpart (mode, temp);
1448 delete_insns_since (last);
1452 /* These can be done a word at a time. */
1453 if ((binoptab == and_optab || binoptab == ior_optab || binoptab == xor_optab)
1454 && class == MODE_INT
1455 && GET_MODE_SIZE (mode) > UNITS_PER_WORD
1456 && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1462 /* If TARGET is the same as one of the operands, the REG_EQUAL note
1463 won't be accurate, so use a new target. */
1464 if (target == 0 || target == op0 || target == op1)
1465 target = gen_reg_rtx (mode);
1469 /* Do the actual arithmetic. */
1470 for (i = 0; i < GET_MODE_BITSIZE (mode) / BITS_PER_WORD; i++)
1472 rtx target_piece = operand_subword (target, i, 1, mode);
1473 rtx x = expand_binop (word_mode, binoptab,
1474 operand_subword_force (op0, i, mode),
1475 operand_subword_force (op1, i, mode),
1476 target_piece, unsignedp, next_methods);
1481 if (target_piece != x)
1482 emit_move_insn (target_piece, x);
1485 insns = get_insns ();
1488 if (i == GET_MODE_BITSIZE (mode) / BITS_PER_WORD)
1490 if (binoptab->code != UNKNOWN)
1492 = gen_rtx_fmt_ee (binoptab->code, mode,
1493 copy_rtx (op0), copy_rtx (op1));
1497 emit_no_conflict_block (insns, target, op0, op1, equiv_value);
1502 /* Synthesize double word shifts from single word shifts. */
1503 if ((binoptab == lshr_optab || binoptab == ashl_optab
1504 || binoptab == ashr_optab)
1505 && class == MODE_INT
1506 && (GET_CODE (op1) == CONST_INT || !optimize_size)
1507 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1508 && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing
1509 && ashl_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing
1510 && lshr_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1512 unsigned HOST_WIDE_INT shift_mask, double_shift_mask;
1513 enum machine_mode op1_mode;
1515 double_shift_mask = targetm.shift_truncation_mask (mode);
1516 shift_mask = targetm.shift_truncation_mask (word_mode);
1517 op1_mode = GET_MODE (op1) != VOIDmode ? GET_MODE (op1) : word_mode;
1519 /* Apply the truncation to constant shifts. */
1520 if (double_shift_mask > 0 && GET_CODE (op1) == CONST_INT)
1521 op1 = GEN_INT (INTVAL (op1) & double_shift_mask);
1523 if (op1 == CONST0_RTX (op1_mode))
1526 /* Make sure that this is a combination that expand_doubleword_shift
1527 can handle. See the comments there for details. */
1528 if (double_shift_mask == 0
1529 || (shift_mask == BITS_PER_WORD - 1
1530 && double_shift_mask == BITS_PER_WORD * 2 - 1))
1532 rtx insns, equiv_value;
1533 rtx into_target, outof_target;
1534 rtx into_input, outof_input;
1535 int left_shift, outof_word;
1537 /* If TARGET is the same as one of the operands, the REG_EQUAL note
1538 won't be accurate, so use a new target. */
1539 if (target == 0 || target == op0 || target == op1)
1540 target = gen_reg_rtx (mode);
1544 /* OUTOF_* is the word we are shifting bits away from, and
1545 INTO_* is the word that we are shifting bits towards, thus
1546 they differ depending on the direction of the shift and
1547 WORDS_BIG_ENDIAN. */
1549 left_shift = binoptab == ashl_optab;
1550 outof_word = left_shift ^ ! WORDS_BIG_ENDIAN;
1552 outof_target = operand_subword (target, outof_word, 1, mode);
1553 into_target = operand_subword (target, 1 - outof_word, 1, mode);
1555 outof_input = operand_subword_force (op0, outof_word, mode);
1556 into_input = operand_subword_force (op0, 1 - outof_word, mode);
1558 if (expand_doubleword_shift (op1_mode, binoptab,
1559 outof_input, into_input, op1,
1560 outof_target, into_target,
1561 unsignedp, next_methods, shift_mask))
1563 insns = get_insns ();
1566 equiv_value = gen_rtx_fmt_ee (binoptab->code, mode, op0, op1);
1567 emit_no_conflict_block (insns, target, op0, op1, equiv_value);
1574 /* Synthesize double word rotates from single word shifts. */
1575 if ((binoptab == rotl_optab || binoptab == rotr_optab)
1576 && class == MODE_INT
1577 && GET_CODE (op1) == CONST_INT
1578 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1579 && ashl_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing
1580 && lshr_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1583 rtx into_target, outof_target;
1584 rtx into_input, outof_input;
1586 int shift_count, left_shift, outof_word;
1588 /* If TARGET is the same as one of the operands, the REG_EQUAL note
1589 won't be accurate, so use a new target. Do this also if target is not
1590 a REG, first because having a register instead may open optimization
1591 opportunities, and second because if target and op0 happen to be MEMs
1592 designating the same location, we would risk clobbering it too early
1593 in the code sequence we generate below. */
1594 if (target == 0 || target == op0 || target == op1 || ! REG_P (target))
1595 target = gen_reg_rtx (mode);
1599 shift_count = INTVAL (op1);
1601 /* OUTOF_* is the word we are shifting bits away from, and
1602 INTO_* is the word that we are shifting bits towards, thus
1603 they differ depending on the direction of the shift and
1604 WORDS_BIG_ENDIAN. */
1606 left_shift = (binoptab == rotl_optab);
1607 outof_word = left_shift ^ ! WORDS_BIG_ENDIAN;
1609 outof_target = operand_subword (target, outof_word, 1, mode);
1610 into_target = operand_subword (target, 1 - outof_word, 1, mode);
1612 outof_input = operand_subword_force (op0, outof_word, mode);
1613 into_input = operand_subword_force (op0, 1 - outof_word, mode);
1615 if (shift_count == BITS_PER_WORD)
1617 /* This is just a word swap. */
1618 emit_move_insn (outof_target, into_input);
1619 emit_move_insn (into_target, outof_input);
1624 rtx into_temp1, into_temp2, outof_temp1, outof_temp2;
1625 rtx first_shift_count, second_shift_count;
1626 optab reverse_unsigned_shift, unsigned_shift;
1628 reverse_unsigned_shift = (left_shift ^ (shift_count < BITS_PER_WORD)
1629 ? lshr_optab : ashl_optab);
1631 unsigned_shift = (left_shift ^ (shift_count < BITS_PER_WORD)
1632 ? ashl_optab : lshr_optab);
1634 if (shift_count > BITS_PER_WORD)
1636 first_shift_count = GEN_INT (shift_count - BITS_PER_WORD);
1637 second_shift_count = GEN_INT (2 * BITS_PER_WORD - shift_count);
1641 first_shift_count = GEN_INT (BITS_PER_WORD - shift_count);
1642 second_shift_count = GEN_INT (shift_count);
1645 into_temp1 = expand_binop (word_mode, unsigned_shift,
1646 outof_input, first_shift_count,
1647 NULL_RTX, unsignedp, next_methods);
1648 into_temp2 = expand_binop (word_mode, reverse_unsigned_shift,
1649 into_input, second_shift_count,
1650 NULL_RTX, unsignedp, next_methods);
1652 if (into_temp1 != 0 && into_temp2 != 0)
1653 inter = expand_binop (word_mode, ior_optab, into_temp1, into_temp2,
1654 into_target, unsignedp, next_methods);
1658 if (inter != 0 && inter != into_target)
1659 emit_move_insn (into_target, inter);
1661 outof_temp1 = expand_binop (word_mode, unsigned_shift,
1662 into_input, first_shift_count,
1663 NULL_RTX, unsignedp, next_methods);
1664 outof_temp2 = expand_binop (word_mode, reverse_unsigned_shift,
1665 outof_input, second_shift_count,
1666 NULL_RTX, unsignedp, next_methods);
1668 if (inter != 0 && outof_temp1 != 0 && outof_temp2 != 0)
1669 inter = expand_binop (word_mode, ior_optab,
1670 outof_temp1, outof_temp2,
1671 outof_target, unsignedp, next_methods);
1673 if (inter != 0 && inter != outof_target)
1674 emit_move_insn (outof_target, inter);
1677 insns = get_insns ();
1682 /* One may be tempted to wrap the insns in a REG_NO_CONFLICT
1683 block to help the register allocator a bit. But a multi-word
1684 rotate will need all the input bits when setting the output
1685 bits, so there clearly is a conflict between the input and
1686 output registers. So we can't use a no-conflict block here. */
1692 /* These can be done a word at a time by propagating carries. */
1693 if ((binoptab == add_optab || binoptab == sub_optab)
1694 && class == MODE_INT
1695 && GET_MODE_SIZE (mode) >= 2 * UNITS_PER_WORD
1696 && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1699 optab otheroptab = binoptab == add_optab ? sub_optab : add_optab;
1700 const unsigned int nwords = GET_MODE_BITSIZE (mode) / BITS_PER_WORD;
1701 rtx carry_in = NULL_RTX, carry_out = NULL_RTX;
1702 rtx xop0, xop1, xtarget;
1704 /* We can handle either a 1 or -1 value for the carry. If STORE_FLAG
1705 value is one of those, use it. Otherwise, use 1 since it is the
1706 one easiest to get. */
1707 #if STORE_FLAG_VALUE == 1 || STORE_FLAG_VALUE == -1
1708 int normalizep = STORE_FLAG_VALUE;
1713 /* Prepare the operands. */
1714 xop0 = force_reg (mode, op0);
1715 xop1 = force_reg (mode, op1);
1717 xtarget = gen_reg_rtx (mode);
1719 if (target == 0 || !REG_P (target))
1722 /* Indicate for flow that the entire target reg is being set. */
1724 emit_insn (gen_rtx_CLOBBER (VOIDmode, xtarget));
1726 /* Do the actual arithmetic. */
1727 for (i = 0; i < nwords; i++)
1729 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
1730 rtx target_piece = operand_subword (xtarget, index, 1, mode);
1731 rtx op0_piece = operand_subword_force (xop0, index, mode);
1732 rtx op1_piece = operand_subword_force (xop1, index, mode);
1735 /* Main add/subtract of the input operands. */
1736 x = expand_binop (word_mode, binoptab,
1737 op0_piece, op1_piece,
1738 target_piece, unsignedp, next_methods);
1744 /* Store carry from main add/subtract. */
1745 carry_out = gen_reg_rtx (word_mode);
1746 carry_out = emit_store_flag_force (carry_out,
1747 (binoptab == add_optab
1750 word_mode, 1, normalizep);
1757 /* Add/subtract previous carry to main result. */
1758 newx = expand_binop (word_mode,
1759 normalizep == 1 ? binoptab : otheroptab,
1761 NULL_RTX, 1, next_methods);
1765 /* Get out carry from adding/subtracting carry in. */
1766 rtx carry_tmp = gen_reg_rtx (word_mode);
1767 carry_tmp = emit_store_flag_force (carry_tmp,
1768 (binoptab == add_optab
1771 word_mode, 1, normalizep);
1773 /* Logical-ior the two poss. carry together. */
1774 carry_out = expand_binop (word_mode, ior_optab,
1775 carry_out, carry_tmp,
1776 carry_out, 0, next_methods);
1780 emit_move_insn (target_piece, newx);
1784 if (x != target_piece)
1785 emit_move_insn (target_piece, x);
1788 carry_in = carry_out;
1791 if (i == GET_MODE_BITSIZE (mode) / (unsigned) BITS_PER_WORD)
1793 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
1794 || ! rtx_equal_p (target, xtarget))
1796 rtx temp = emit_move_insn (target, xtarget);
1798 set_unique_reg_note (temp,
1800 gen_rtx_fmt_ee (binoptab->code, mode,
1811 delete_insns_since (last);
1814 /* Attempt to synthesize double word multiplies using a sequence of word
1815 mode multiplications. We first attempt to generate a sequence using a
1816 more efficient unsigned widening multiply, and if that fails we then
1817 try using a signed widening multiply. */
1819 if (binoptab == smul_optab
1820 && class == MODE_INT
1821 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1822 && smul_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing
1823 && add_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1825 rtx product = NULL_RTX;
1827 if (umul_widen_optab->handlers[(int) mode].insn_code
1828 != CODE_FOR_nothing)
1830 product = expand_doubleword_mult (mode, op0, op1, target,
1833 delete_insns_since (last);
1836 if (product == NULL_RTX
1837 && smul_widen_optab->handlers[(int) mode].insn_code
1838 != CODE_FOR_nothing)
1840 product = expand_doubleword_mult (mode, op0, op1, target,
1843 delete_insns_since (last);
1846 if (product != NULL_RTX)
1848 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1850 temp = emit_move_insn (target ? target : product, product);
1851 set_unique_reg_note (temp,
1853 gen_rtx_fmt_ee (MULT, mode,
1861 /* It can't be open-coded in this mode.
1862 Use a library call if one is available and caller says that's ok. */
1864 if (binoptab->handlers[(int) mode].libfunc
1865 && (methods == OPTAB_LIB || methods == OPTAB_LIB_WIDEN))
1869 enum machine_mode op1_mode = mode;
1876 op1_mode = word_mode;
1877 /* Specify unsigned here,
1878 since negative shift counts are meaningless. */
1879 op1x = convert_to_mode (word_mode, op1, 1);
1882 if (GET_MODE (op0) != VOIDmode
1883 && GET_MODE (op0) != mode)
1884 op0 = convert_to_mode (mode, op0, unsignedp);
1886 /* Pass 1 for NO_QUEUE so we don't lose any increments
1887 if the libcall is cse'd or moved. */
1888 value = emit_library_call_value (binoptab->handlers[(int) mode].libfunc,
1889 NULL_RTX, LCT_CONST, mode, 2,
1890 op0, mode, op1x, op1_mode);
1892 insns = get_insns ();
1895 target = gen_reg_rtx (mode);
1896 emit_libcall_block (insns, target, value,
1897 gen_rtx_fmt_ee (binoptab->code, mode, op0, op1));
1902 delete_insns_since (last);
1904 /* It can't be done in this mode. Can we do it in a wider mode? */
1906 if (! (methods == OPTAB_WIDEN || methods == OPTAB_LIB_WIDEN
1907 || methods == OPTAB_MUST_WIDEN))
1909 /* Caller says, don't even try. */
1910 delete_insns_since (entry_last);
1914 /* Compute the value of METHODS to pass to recursive calls.
1915 Don't allow widening to be tried recursively. */
1917 methods = (methods == OPTAB_LIB_WIDEN ? OPTAB_LIB : OPTAB_DIRECT);
1919 /* Look for a wider mode of the same class for which it appears we can do
1922 if (CLASS_HAS_WIDER_MODES_P (class))
1924 for (wider_mode = GET_MODE_WIDER_MODE (mode);
1925 wider_mode != VOIDmode;
1926 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1928 if ((binoptab->handlers[(int) wider_mode].insn_code
1929 != CODE_FOR_nothing)
1930 || (methods == OPTAB_LIB
1931 && binoptab->handlers[(int) wider_mode].libfunc))
1933 rtx xop0 = op0, xop1 = op1;
1936 /* For certain integer operations, we need not actually extend
1937 the narrow operands, as long as we will truncate
1938 the results to the same narrowness. */
1940 if ((binoptab == ior_optab || binoptab == and_optab
1941 || binoptab == xor_optab
1942 || binoptab == add_optab || binoptab == sub_optab
1943 || binoptab == smul_optab || binoptab == ashl_optab)
1944 && class == MODE_INT)
1947 xop0 = widen_operand (xop0, wider_mode, mode,
1948 unsignedp, no_extend);
1950 /* The second operand of a shift must always be extended. */
1951 xop1 = widen_operand (xop1, wider_mode, mode, unsignedp,
1952 no_extend && binoptab != ashl_optab);
1954 temp = expand_binop (wider_mode, binoptab, xop0, xop1, NULL_RTX,
1955 unsignedp, methods);
1958 if (class != MODE_INT
1959 || !TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
1960 GET_MODE_BITSIZE (wider_mode)))
1963 target = gen_reg_rtx (mode);
1964 convert_move (target, temp, 0);
1968 return gen_lowpart (mode, temp);
1971 delete_insns_since (last);
1976 delete_insns_since (entry_last);
1980 /* Expand a binary operator which has both signed and unsigned forms.
1981 UOPTAB is the optab for unsigned operations, and SOPTAB is for
1984 If we widen unsigned operands, we may use a signed wider operation instead
1985 of an unsigned wider operation, since the result would be the same. */
1988 sign_expand_binop (enum machine_mode mode, optab uoptab, optab soptab,
1989 rtx op0, rtx op1, rtx target, int unsignedp,
1990 enum optab_methods methods)
1993 optab direct_optab = unsignedp ? uoptab : soptab;
1994 struct optab wide_soptab;
1996 /* Do it without widening, if possible. */
1997 temp = expand_binop (mode, direct_optab, op0, op1, target,
1998 unsignedp, OPTAB_DIRECT);
1999 if (temp || methods == OPTAB_DIRECT)
2002 /* Try widening to a signed int. Make a fake signed optab that
2003 hides any signed insn for direct use. */
2004 wide_soptab = *soptab;
2005 wide_soptab.handlers[(int) mode].insn_code = CODE_FOR_nothing;
2006 wide_soptab.handlers[(int) mode].libfunc = 0;
2008 temp = expand_binop (mode, &wide_soptab, op0, op1, target,
2009 unsignedp, OPTAB_WIDEN);
2011 /* For unsigned operands, try widening to an unsigned int. */
2012 if (temp == 0 && unsignedp)
2013 temp = expand_binop (mode, uoptab, op0, op1, target,
2014 unsignedp, OPTAB_WIDEN);
2015 if (temp || methods == OPTAB_WIDEN)
2018 /* Use the right width lib call if that exists. */
2019 temp = expand_binop (mode, direct_optab, op0, op1, target, unsignedp, OPTAB_LIB);
2020 if (temp || methods == OPTAB_LIB)
2023 /* Must widen and use a lib call, use either signed or unsigned. */
2024 temp = expand_binop (mode, &wide_soptab, op0, op1, target,
2025 unsignedp, methods);
2029 return expand_binop (mode, uoptab, op0, op1, target,
2030 unsignedp, methods);
2034 /* Generate code to perform an operation specified by UNOPPTAB
2035 on operand OP0, with two results to TARG0 and TARG1.
2036 We assume that the order of the operands for the instruction
2037 is TARG0, TARG1, OP0.
2039 Either TARG0 or TARG1 may be zero, but what that means is that
2040 the result is not actually wanted. We will generate it into
2041 a dummy pseudo-reg and discard it. They may not both be zero.
2043 Returns 1 if this operation can be performed; 0 if not. */
2046 expand_twoval_unop (optab unoptab, rtx op0, rtx targ0, rtx targ1,
2049 enum machine_mode mode = GET_MODE (targ0 ? targ0 : targ1);
2050 enum mode_class class;
2051 enum machine_mode wider_mode;
2052 rtx entry_last = get_last_insn ();
2055 class = GET_MODE_CLASS (mode);
2058 targ0 = gen_reg_rtx (mode);
2060 targ1 = gen_reg_rtx (mode);
2062 /* Record where to go back to if we fail. */
2063 last = get_last_insn ();
2065 if (unoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2067 int icode = (int) unoptab->handlers[(int) mode].insn_code;
2068 enum machine_mode mode0 = insn_data[icode].operand[2].mode;
2072 if (GET_MODE (xop0) != VOIDmode
2073 && GET_MODE (xop0) != mode0)
2074 xop0 = convert_to_mode (mode0, xop0, unsignedp);
2076 /* Now, if insn doesn't accept these operands, put them into pseudos. */
2077 if (!insn_data[icode].operand[2].predicate (xop0, mode0))
2078 xop0 = copy_to_mode_reg (mode0, xop0);
2080 /* We could handle this, but we should always be called with a pseudo
2081 for our targets and all insns should take them as outputs. */
2082 gcc_assert (insn_data[icode].operand[0].predicate (targ0, mode));
2083 gcc_assert (insn_data[icode].operand[1].predicate (targ1, mode));
2085 pat = GEN_FCN (icode) (targ0, targ1, xop0);
2092 delete_insns_since (last);
2095 /* It can't be done in this mode. Can we do it in a wider mode? */
2097 if (CLASS_HAS_WIDER_MODES_P (class))
2099 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2100 wider_mode != VOIDmode;
2101 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2103 if (unoptab->handlers[(int) wider_mode].insn_code
2104 != CODE_FOR_nothing)
2106 rtx t0 = gen_reg_rtx (wider_mode);
2107 rtx t1 = gen_reg_rtx (wider_mode);
2108 rtx cop0 = convert_modes (wider_mode, mode, op0, unsignedp);
2110 if (expand_twoval_unop (unoptab, cop0, t0, t1, unsignedp))
2112 convert_move (targ0, t0, unsignedp);
2113 convert_move (targ1, t1, unsignedp);
2117 delete_insns_since (last);
2122 delete_insns_since (entry_last);
2126 /* Generate code to perform an operation specified by BINOPTAB
2127 on operands OP0 and OP1, with two results to TARG1 and TARG2.
2128 We assume that the order of the operands for the instruction
2129 is TARG0, OP0, OP1, TARG1, which would fit a pattern like
2130 [(set TARG0 (operate OP0 OP1)) (set TARG1 (operate ...))].
2132 Either TARG0 or TARG1 may be zero, but what that means is that
2133 the result is not actually wanted. We will generate it into
2134 a dummy pseudo-reg and discard it. They may not both be zero.
2136 Returns 1 if this operation can be performed; 0 if not. */
2139 expand_twoval_binop (optab binoptab, rtx op0, rtx op1, rtx targ0, rtx targ1,
2142 enum machine_mode mode = GET_MODE (targ0 ? targ0 : targ1);
2143 enum mode_class class;
2144 enum machine_mode wider_mode;
2145 rtx entry_last = get_last_insn ();
2148 class = GET_MODE_CLASS (mode);
2150 /* If we are inside an appropriately-short loop and we are optimizing,
2151 force expensive constants into a register. */
2152 if (CONSTANT_P (op0) && optimize
2153 && rtx_cost (op0, binoptab->code) > COSTS_N_INSNS (1))
2154 op0 = force_reg (mode, op0);
2156 if (CONSTANT_P (op1) && optimize
2157 && rtx_cost (op1, binoptab->code) > COSTS_N_INSNS (1))
2158 op1 = force_reg (mode, op1);
2161 targ0 = gen_reg_rtx (mode);
2163 targ1 = gen_reg_rtx (mode);
2165 /* Record where to go back to if we fail. */
2166 last = get_last_insn ();
2168 if (binoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2170 int icode = (int) binoptab->handlers[(int) mode].insn_code;
2171 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
2172 enum machine_mode mode1 = insn_data[icode].operand[2].mode;
2174 rtx xop0 = op0, xop1 = op1;
2176 /* In case the insn wants input operands in modes different from
2177 those of the actual operands, convert the operands. It would
2178 seem that we don't need to convert CONST_INTs, but we do, so
2179 that they're properly zero-extended, sign-extended or truncated
2182 if (GET_MODE (op0) != mode0 && mode0 != VOIDmode)
2183 xop0 = convert_modes (mode0,
2184 GET_MODE (op0) != VOIDmode
2189 if (GET_MODE (op1) != mode1 && mode1 != VOIDmode)
2190 xop1 = convert_modes (mode1,
2191 GET_MODE (op1) != VOIDmode
2196 /* Now, if insn doesn't accept these operands, put them into pseudos. */
2197 if (!insn_data[icode].operand[1].predicate (xop0, mode0))
2198 xop0 = copy_to_mode_reg (mode0, xop0);
2200 if (!insn_data[icode].operand[2].predicate (xop1, mode1))
2201 xop1 = copy_to_mode_reg (mode1, xop1);
2203 /* We could handle this, but we should always be called with a pseudo
2204 for our targets and all insns should take them as outputs. */
2205 gcc_assert (insn_data[icode].operand[0].predicate (targ0, mode));
2206 gcc_assert (insn_data[icode].operand[3].predicate (targ1, mode));
2208 pat = GEN_FCN (icode) (targ0, xop0, xop1, targ1);
2215 delete_insns_since (last);
2218 /* It can't be done in this mode. Can we do it in a wider mode? */
2220 if (CLASS_HAS_WIDER_MODES_P (class))
2222 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2223 wider_mode != VOIDmode;
2224 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2226 if (binoptab->handlers[(int) wider_mode].insn_code
2227 != CODE_FOR_nothing)
2229 rtx t0 = gen_reg_rtx (wider_mode);
2230 rtx t1 = gen_reg_rtx (wider_mode);
2231 rtx cop0 = convert_modes (wider_mode, mode, op0, unsignedp);
2232 rtx cop1 = convert_modes (wider_mode, mode, op1, unsignedp);
2234 if (expand_twoval_binop (binoptab, cop0, cop1,
2237 convert_move (targ0, t0, unsignedp);
2238 convert_move (targ1, t1, unsignedp);
2242 delete_insns_since (last);
2247 delete_insns_since (entry_last);
2251 /* Expand the two-valued library call indicated by BINOPTAB, but
2252 preserve only one of the values. If TARG0 is non-NULL, the first
2253 value is placed into TARG0; otherwise the second value is placed
2254 into TARG1. Exactly one of TARG0 and TARG1 must be non-NULL. The
2255 value stored into TARG0 or TARG1 is equivalent to (CODE OP0 OP1).
2256 This routine assumes that the value returned by the library call is
2257 as if the return value was of an integral mode twice as wide as the
2258 mode of OP0. Returns 1 if the call was successful. */
2261 expand_twoval_binop_libfunc (optab binoptab, rtx op0, rtx op1,
2262 rtx targ0, rtx targ1, enum rtx_code code)
2264 enum machine_mode mode;
2265 enum machine_mode libval_mode;
2269 /* Exactly one of TARG0 or TARG1 should be non-NULL. */
2270 gcc_assert (!targ0 != !targ1);
2272 mode = GET_MODE (op0);
2273 if (!binoptab->handlers[(int) mode].libfunc)
2276 /* The value returned by the library function will have twice as
2277 many bits as the nominal MODE. */
2278 libval_mode = smallest_mode_for_size (2 * GET_MODE_BITSIZE (mode),
2281 libval = emit_library_call_value (binoptab->handlers[(int) mode].libfunc,
2282 NULL_RTX, LCT_CONST,
2286 /* Get the part of VAL containing the value that we want. */
2287 libval = simplify_gen_subreg (mode, libval, libval_mode,
2288 targ0 ? 0 : GET_MODE_SIZE (mode));
2289 insns = get_insns ();
2291 /* Move the into the desired location. */
2292 emit_libcall_block (insns, targ0 ? targ0 : targ1, libval,
2293 gen_rtx_fmt_ee (code, mode, op0, op1));
2299 /* Wrapper around expand_unop which takes an rtx code to specify
2300 the operation to perform, not an optab pointer. All other
2301 arguments are the same. */
2303 expand_simple_unop (enum machine_mode mode, enum rtx_code code, rtx op0,
2304 rtx target, int unsignedp)
2306 optab unop = code_to_optab[(int) code];
2309 return expand_unop (mode, unop, op0, target, unsignedp);
2315 (clz:wide (zero_extend:wide x)) - ((width wide) - (width narrow)). */
2317 widen_clz (enum machine_mode mode, rtx op0, rtx target)
2319 enum mode_class class = GET_MODE_CLASS (mode);
2320 if (CLASS_HAS_WIDER_MODES_P (class))
2322 enum machine_mode wider_mode;
2323 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2324 wider_mode != VOIDmode;
2325 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2327 if (clz_optab->handlers[(int) wider_mode].insn_code
2328 != CODE_FOR_nothing)
2330 rtx xop0, temp, last;
2332 last = get_last_insn ();
2335 target = gen_reg_rtx (mode);
2336 xop0 = widen_operand (op0, wider_mode, mode, true, false);
2337 temp = expand_unop (wider_mode, clz_optab, xop0, NULL_RTX, true);
2339 temp = expand_binop (wider_mode, sub_optab, temp,
2340 GEN_INT (GET_MODE_BITSIZE (wider_mode)
2341 - GET_MODE_BITSIZE (mode)),
2342 target, true, OPTAB_DIRECT);
2344 delete_insns_since (last);
2353 /* Try calculating (parity x) as (and (popcount x) 1), where
2354 popcount can also be done in a wider mode. */
2356 expand_parity (enum machine_mode mode, rtx op0, rtx target)
2358 enum mode_class class = GET_MODE_CLASS (mode);
2359 if (CLASS_HAS_WIDER_MODES_P (class))
2361 enum machine_mode wider_mode;
2362 for (wider_mode = mode; wider_mode != VOIDmode;
2363 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2365 if (popcount_optab->handlers[(int) wider_mode].insn_code
2366 != CODE_FOR_nothing)
2368 rtx xop0, temp, last;
2370 last = get_last_insn ();
2373 target = gen_reg_rtx (mode);
2374 xop0 = widen_operand (op0, wider_mode, mode, true, false);
2375 temp = expand_unop (wider_mode, popcount_optab, xop0, NULL_RTX,
2378 temp = expand_binop (wider_mode, and_optab, temp, const1_rtx,
2379 target, true, OPTAB_DIRECT);
2381 delete_insns_since (last);
2390 /* Extract the OMODE lowpart from VAL, which has IMODE. Under certain
2391 conditions, VAL may already be a SUBREG against which we cannot generate
2392 a further SUBREG. In this case, we expect forcing the value into a
2393 register will work around the situation. */
2396 lowpart_subreg_maybe_copy (enum machine_mode omode, rtx val,
2397 enum machine_mode imode)
2400 ret = lowpart_subreg (omode, val, imode);
2403 val = force_reg (imode, val);
2404 ret = lowpart_subreg (omode, val, imode);
2405 gcc_assert (ret != NULL);
2410 /* Expand a floating point absolute value or negation operation via a
2411 logical operation on the sign bit. */
2414 expand_absneg_bit (enum rtx_code code, enum machine_mode mode,
2415 rtx op0, rtx target)
2417 const struct real_format *fmt;
2418 int bitpos, word, nwords, i;
2419 enum machine_mode imode;
2420 HOST_WIDE_INT hi, lo;
2423 /* The format has to have a simple sign bit. */
2424 fmt = REAL_MODE_FORMAT (mode);
2428 bitpos = fmt->signbit_rw;
2432 /* Don't create negative zeros if the format doesn't support them. */
2433 if (code == NEG && !fmt->has_signed_zero)
2436 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
2438 imode = int_mode_for_mode (mode);
2439 if (imode == BLKmode)
2448 if (FLOAT_WORDS_BIG_ENDIAN)
2449 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
2451 word = bitpos / BITS_PER_WORD;
2452 bitpos = bitpos % BITS_PER_WORD;
2453 nwords = (GET_MODE_BITSIZE (mode) + BITS_PER_WORD - 1) / BITS_PER_WORD;
2456 if (bitpos < HOST_BITS_PER_WIDE_INT)
2459 lo = (HOST_WIDE_INT) 1 << bitpos;
2463 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
2469 if (target == 0 || target == op0)
2470 target = gen_reg_rtx (mode);
2476 for (i = 0; i < nwords; ++i)
2478 rtx targ_piece = operand_subword (target, i, 1, mode);
2479 rtx op0_piece = operand_subword_force (op0, i, mode);
2483 temp = expand_binop (imode, code == ABS ? and_optab : xor_optab,
2485 immed_double_const (lo, hi, imode),
2486 targ_piece, 1, OPTAB_LIB_WIDEN);
2487 if (temp != targ_piece)
2488 emit_move_insn (targ_piece, temp);
2491 emit_move_insn (targ_piece, op0_piece);
2494 insns = get_insns ();
2497 temp = gen_rtx_fmt_e (code, mode, copy_rtx (op0));
2498 emit_no_conflict_block (insns, target, op0, NULL_RTX, temp);
2502 temp = expand_binop (imode, code == ABS ? and_optab : xor_optab,
2503 gen_lowpart (imode, op0),
2504 immed_double_const (lo, hi, imode),
2505 gen_lowpart (imode, target), 1, OPTAB_LIB_WIDEN);
2506 target = lowpart_subreg_maybe_copy (mode, temp, imode);
2508 set_unique_reg_note (get_last_insn (), REG_EQUAL,
2509 gen_rtx_fmt_e (code, mode, copy_rtx (op0)));
2515 /* Generate code to perform an operation specified by UNOPTAB
2516 on operand OP0, with result having machine-mode MODE.
2518 UNSIGNEDP is for the case where we have to widen the operands
2519 to perform the operation. It says to use zero-extension.
2521 If TARGET is nonzero, the value
2522 is generated there, if it is convenient to do so.
2523 In all cases an rtx is returned for the locus of the value;
2524 this may or may not be TARGET. */
2527 expand_unop (enum machine_mode mode, optab unoptab, rtx op0, rtx target,
2530 enum mode_class class;
2531 enum machine_mode wider_mode;
2533 rtx last = get_last_insn ();
2536 class = GET_MODE_CLASS (mode);
2538 if (unoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2540 int icode = (int) unoptab->handlers[(int) mode].insn_code;
2541 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
2547 temp = gen_reg_rtx (mode);
2549 if (GET_MODE (xop0) != VOIDmode
2550 && GET_MODE (xop0) != mode0)
2551 xop0 = convert_to_mode (mode0, xop0, unsignedp);
2553 /* Now, if insn doesn't accept our operand, put it into a pseudo. */
2555 if (!insn_data[icode].operand[1].predicate (xop0, mode0))
2556 xop0 = copy_to_mode_reg (mode0, xop0);
2558 if (!insn_data[icode].operand[0].predicate (temp, mode))
2559 temp = gen_reg_rtx (mode);
2561 pat = GEN_FCN (icode) (temp, xop0);
2564 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX
2565 && ! add_equal_note (pat, temp, unoptab->code, xop0, NULL_RTX))
2567 delete_insns_since (last);
2568 return expand_unop (mode, unoptab, op0, NULL_RTX, unsignedp);
2576 delete_insns_since (last);
2579 /* It can't be done in this mode. Can we open-code it in a wider mode? */
2581 /* Widening clz needs special treatment. */
2582 if (unoptab == clz_optab)
2584 temp = widen_clz (mode, op0, target);
2591 if (CLASS_HAS_WIDER_MODES_P (class))
2592 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2593 wider_mode != VOIDmode;
2594 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2596 if (unoptab->handlers[(int) wider_mode].insn_code != CODE_FOR_nothing)
2600 /* For certain operations, we need not actually extend
2601 the narrow operand, as long as we will truncate the
2602 results to the same narrowness. */
2604 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp,
2605 (unoptab == neg_optab
2606 || unoptab == one_cmpl_optab)
2607 && class == MODE_INT);
2609 temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX,
2614 if (class != MODE_INT
2615 || !TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
2616 GET_MODE_BITSIZE (wider_mode)))
2619 target = gen_reg_rtx (mode);
2620 convert_move (target, temp, 0);
2624 return gen_lowpart (mode, temp);
2627 delete_insns_since (last);
2631 /* These can be done a word at a time. */
2632 if (unoptab == one_cmpl_optab
2633 && class == MODE_INT
2634 && GET_MODE_SIZE (mode) > UNITS_PER_WORD
2635 && unoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
2640 if (target == 0 || target == op0)
2641 target = gen_reg_rtx (mode);
2645 /* Do the actual arithmetic. */
2646 for (i = 0; i < GET_MODE_BITSIZE (mode) / BITS_PER_WORD; i++)
2648 rtx target_piece = operand_subword (target, i, 1, mode);
2649 rtx x = expand_unop (word_mode, unoptab,
2650 operand_subword_force (op0, i, mode),
2651 target_piece, unsignedp);
2653 if (target_piece != x)
2654 emit_move_insn (target_piece, x);
2657 insns = get_insns ();
2660 emit_no_conflict_block (insns, target, op0, NULL_RTX,
2661 gen_rtx_fmt_e (unoptab->code, mode,
2666 if (unoptab->code == NEG)
2668 /* Try negating floating point values by flipping the sign bit. */
2669 if (SCALAR_FLOAT_MODE_P (mode))
2671 temp = expand_absneg_bit (NEG, mode, op0, target);
2676 /* If there is no negation pattern, and we have no negative zero,
2677 try subtracting from zero. */
2678 if (!HONOR_SIGNED_ZEROS (mode))
2680 temp = expand_binop (mode, (unoptab == negv_optab
2681 ? subv_optab : sub_optab),
2682 CONST0_RTX (mode), op0, target,
2683 unsignedp, OPTAB_DIRECT);
2689 /* Try calculating parity (x) as popcount (x) % 2. */
2690 if (unoptab == parity_optab)
2692 temp = expand_parity (mode, op0, target);
2698 /* Now try a library call in this mode. */
2699 if (unoptab->handlers[(int) mode].libfunc)
2703 enum machine_mode outmode = mode;
2705 /* All of these functions return small values. Thus we choose to
2706 have them return something that isn't a double-word. */
2707 if (unoptab == ffs_optab || unoptab == clz_optab || unoptab == ctz_optab
2708 || unoptab == popcount_optab || unoptab == parity_optab)
2710 = GET_MODE (hard_libcall_value (TYPE_MODE (integer_type_node)));
2714 /* Pass 1 for NO_QUEUE so we don't lose any increments
2715 if the libcall is cse'd or moved. */
2716 value = emit_library_call_value (unoptab->handlers[(int) mode].libfunc,
2717 NULL_RTX, LCT_CONST, outmode,
2719 insns = get_insns ();
2722 target = gen_reg_rtx (outmode);
2723 emit_libcall_block (insns, target, value,
2724 gen_rtx_fmt_e (unoptab->code, outmode, op0));
2729 /* It can't be done in this mode. Can we do it in a wider mode? */
2731 if (CLASS_HAS_WIDER_MODES_P (class))
2733 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2734 wider_mode != VOIDmode;
2735 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2737 if ((unoptab->handlers[(int) wider_mode].insn_code
2738 != CODE_FOR_nothing)
2739 || unoptab->handlers[(int) wider_mode].libfunc)
2743 /* For certain operations, we need not actually extend
2744 the narrow operand, as long as we will truncate the
2745 results to the same narrowness. */
2747 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp,
2748 (unoptab == neg_optab
2749 || unoptab == one_cmpl_optab)
2750 && class == MODE_INT);
2752 temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX,
2755 /* If we are generating clz using wider mode, adjust the
2757 if (unoptab == clz_optab && temp != 0)
2758 temp = expand_binop (wider_mode, sub_optab, temp,
2759 GEN_INT (GET_MODE_BITSIZE (wider_mode)
2760 - GET_MODE_BITSIZE (mode)),
2761 target, true, OPTAB_DIRECT);
2765 if (class != MODE_INT)
2768 target = gen_reg_rtx (mode);
2769 convert_move (target, temp, 0);
2773 return gen_lowpart (mode, temp);
2776 delete_insns_since (last);
2781 /* One final attempt at implementing negation via subtraction,
2782 this time allowing widening of the operand. */
2783 if (unoptab->code == NEG && !HONOR_SIGNED_ZEROS (mode))
2786 temp = expand_binop (mode,
2787 unoptab == negv_optab ? subv_optab : sub_optab,
2788 CONST0_RTX (mode), op0,
2789 target, unsignedp, OPTAB_LIB_WIDEN);
2797 /* Emit code to compute the absolute value of OP0, with result to
2798 TARGET if convenient. (TARGET may be 0.) The return value says
2799 where the result actually is to be found.
2801 MODE is the mode of the operand; the mode of the result is
2802 different but can be deduced from MODE.
2807 expand_abs_nojump (enum machine_mode mode, rtx op0, rtx target,
2808 int result_unsignedp)
2813 result_unsignedp = 1;
2815 /* First try to do it with a special abs instruction. */
2816 temp = expand_unop (mode, result_unsignedp ? abs_optab : absv_optab,
2821 /* For floating point modes, try clearing the sign bit. */
2822 if (SCALAR_FLOAT_MODE_P (mode))
2824 temp = expand_absneg_bit (ABS, mode, op0, target);
2829 /* If we have a MAX insn, we can do this as MAX (x, -x). */
2830 if (smax_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
2831 && !HONOR_SIGNED_ZEROS (mode))
2833 rtx last = get_last_insn ();
2835 temp = expand_unop (mode, neg_optab, op0, NULL_RTX, 0);
2837 temp = expand_binop (mode, smax_optab, op0, temp, target, 0,
2843 delete_insns_since (last);
2846 /* If this machine has expensive jumps, we can do integer absolute
2847 value of X as (((signed) x >> (W-1)) ^ x) - ((signed) x >> (W-1)),
2848 where W is the width of MODE. */
2850 if (GET_MODE_CLASS (mode) == MODE_INT && BRANCH_COST >= 2)
2852 rtx extended = expand_shift (RSHIFT_EXPR, mode, op0,
2853 size_int (GET_MODE_BITSIZE (mode) - 1),
2856 temp = expand_binop (mode, xor_optab, extended, op0, target, 0,
2859 temp = expand_binop (mode, result_unsignedp ? sub_optab : subv_optab,
2860 temp, extended, target, 0, OPTAB_LIB_WIDEN);
2870 expand_abs (enum machine_mode mode, rtx op0, rtx target,
2871 int result_unsignedp, int safe)
2876 result_unsignedp = 1;
2878 temp = expand_abs_nojump (mode, op0, target, result_unsignedp);
2882 /* If that does not win, use conditional jump and negate. */
2884 /* It is safe to use the target if it is the same
2885 as the source if this is also a pseudo register */
2886 if (op0 == target && REG_P (op0)
2887 && REGNO (op0) >= FIRST_PSEUDO_REGISTER)
2890 op1 = gen_label_rtx ();
2891 if (target == 0 || ! safe
2892 || GET_MODE (target) != mode
2893 || (MEM_P (target) && MEM_VOLATILE_P (target))
2895 && REGNO (target) < FIRST_PSEUDO_REGISTER))
2896 target = gen_reg_rtx (mode);
2898 emit_move_insn (target, op0);
2901 do_compare_rtx_and_jump (target, CONST0_RTX (mode), GE, 0, mode,
2902 NULL_RTX, NULL_RTX, op1);
2904 op0 = expand_unop (mode, result_unsignedp ? neg_optab : negv_optab,
2907 emit_move_insn (target, op0);
2913 /* A subroutine of expand_copysign, perform the copysign operation using the
2914 abs and neg primitives advertised to exist on the target. The assumption
2915 is that we have a split register file, and leaving op0 in fp registers,
2916 and not playing with subregs so much, will help the register allocator. */
2919 expand_copysign_absneg (enum machine_mode mode, rtx op0, rtx op1, rtx target,
2920 int bitpos, bool op0_is_abs)
2922 enum machine_mode imode;
2923 HOST_WIDE_INT hi, lo;
2932 op0 = expand_unop (mode, abs_optab, op0, target, 0);
2939 if (target == NULL_RTX)
2940 target = copy_to_reg (op0);
2942 emit_move_insn (target, op0);
2945 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
2947 imode = int_mode_for_mode (mode);
2948 if (imode == BLKmode)
2950 op1 = gen_lowpart (imode, op1);
2955 if (FLOAT_WORDS_BIG_ENDIAN)
2956 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
2958 word = bitpos / BITS_PER_WORD;
2959 bitpos = bitpos % BITS_PER_WORD;
2960 op1 = operand_subword_force (op1, word, mode);
2963 if (bitpos < HOST_BITS_PER_WIDE_INT)
2966 lo = (HOST_WIDE_INT) 1 << bitpos;
2970 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
2974 op1 = expand_binop (imode, and_optab, op1,
2975 immed_double_const (lo, hi, imode),
2976 NULL_RTX, 1, OPTAB_LIB_WIDEN);
2978 label = gen_label_rtx ();
2979 emit_cmp_and_jump_insns (op1, const0_rtx, EQ, NULL_RTX, imode, 1, label);
2981 if (GET_CODE (op0) == CONST_DOUBLE)
2982 op0 = simplify_unary_operation (NEG, mode, op0, mode);
2984 op0 = expand_unop (mode, neg_optab, op0, target, 0);
2986 emit_move_insn (target, op0);
2994 /* A subroutine of expand_copysign, perform the entire copysign operation
2995 with integer bitmasks. BITPOS is the position of the sign bit; OP0_IS_ABS
2996 is true if op0 is known to have its sign bit clear. */
2999 expand_copysign_bit (enum machine_mode mode, rtx op0, rtx op1, rtx target,
3000 int bitpos, bool op0_is_abs)
3002 enum machine_mode imode;
3003 HOST_WIDE_INT hi, lo;
3004 int word, nwords, i;
3007 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
3009 imode = int_mode_for_mode (mode);
3010 if (imode == BLKmode)
3019 if (FLOAT_WORDS_BIG_ENDIAN)
3020 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
3022 word = bitpos / BITS_PER_WORD;
3023 bitpos = bitpos % BITS_PER_WORD;
3024 nwords = (GET_MODE_BITSIZE (mode) + BITS_PER_WORD - 1) / BITS_PER_WORD;
3027 if (bitpos < HOST_BITS_PER_WIDE_INT)
3030 lo = (HOST_WIDE_INT) 1 << bitpos;
3034 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
3038 if (target == 0 || target == op0 || target == op1)
3039 target = gen_reg_rtx (mode);
3045 for (i = 0; i < nwords; ++i)
3047 rtx targ_piece = operand_subword (target, i, 1, mode);
3048 rtx op0_piece = operand_subword_force (op0, i, mode);
3053 op0_piece = expand_binop (imode, and_optab, op0_piece,
3054 immed_double_const (~lo, ~hi, imode),
3055 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3057 op1 = expand_binop (imode, and_optab,
3058 operand_subword_force (op1, i, mode),
3059 immed_double_const (lo, hi, imode),
3060 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3062 temp = expand_binop (imode, ior_optab, op0_piece, op1,
3063 targ_piece, 1, OPTAB_LIB_WIDEN);
3064 if (temp != targ_piece)
3065 emit_move_insn (targ_piece, temp);
3068 emit_move_insn (targ_piece, op0_piece);
3071 insns = get_insns ();
3074 emit_no_conflict_block (insns, target, op0, op1, NULL_RTX);
3078 op1 = expand_binop (imode, and_optab, gen_lowpart (imode, op1),
3079 immed_double_const (lo, hi, imode),
3080 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3082 op0 = gen_lowpart (imode, op0);
3084 op0 = expand_binop (imode, and_optab, op0,
3085 immed_double_const (~lo, ~hi, imode),
3086 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3088 temp = expand_binop (imode, ior_optab, op0, op1,
3089 gen_lowpart (imode, target), 1, OPTAB_LIB_WIDEN);
3090 target = lowpart_subreg_maybe_copy (mode, temp, imode);
3096 /* Expand the C99 copysign operation. OP0 and OP1 must be the same
3097 scalar floating point mode. Return NULL if we do not know how to
3098 expand the operation inline. */
3101 expand_copysign (rtx op0, rtx op1, rtx target)
3103 enum machine_mode mode = GET_MODE (op0);
3104 const struct real_format *fmt;
3108 gcc_assert (SCALAR_FLOAT_MODE_P (mode));
3109 gcc_assert (GET_MODE (op1) == mode);
3111 /* First try to do it with a special instruction. */
3112 temp = expand_binop (mode, copysign_optab, op0, op1,
3113 target, 0, OPTAB_DIRECT);
3117 fmt = REAL_MODE_FORMAT (mode);
3118 if (fmt == NULL || !fmt->has_signed_zero)
3122 if (GET_CODE (op0) == CONST_DOUBLE)
3124 if (real_isneg (CONST_DOUBLE_REAL_VALUE (op0)))
3125 op0 = simplify_unary_operation (ABS, mode, op0, mode);
3129 if (fmt->signbit_ro >= 0
3130 && (GET_CODE (op0) == CONST_DOUBLE
3131 || (neg_optab->handlers[mode].insn_code != CODE_FOR_nothing
3132 && abs_optab->handlers[mode].insn_code != CODE_FOR_nothing)))
3134 temp = expand_copysign_absneg (mode, op0, op1, target,
3135 fmt->signbit_ro, op0_is_abs);
3140 if (fmt->signbit_rw < 0)
3142 return expand_copysign_bit (mode, op0, op1, target,
3143 fmt->signbit_rw, op0_is_abs);
3146 /* Generate an instruction whose insn-code is INSN_CODE,
3147 with two operands: an output TARGET and an input OP0.
3148 TARGET *must* be nonzero, and the output is always stored there.
3149 CODE is an rtx code such that (CODE OP0) is an rtx that describes
3150 the value that is stored into TARGET. */
3153 emit_unop_insn (int icode, rtx target, rtx op0, enum rtx_code code)
3156 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
3161 /* Now, if insn does not accept our operands, put them into pseudos. */
3163 if (!insn_data[icode].operand[1].predicate (op0, mode0))
3164 op0 = copy_to_mode_reg (mode0, op0);
3166 if (!insn_data[icode].operand[0].predicate (temp, GET_MODE (temp)))
3167 temp = gen_reg_rtx (GET_MODE (temp));
3169 pat = GEN_FCN (icode) (temp, op0);
3171 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX && code != UNKNOWN)
3172 add_equal_note (pat, temp, code, op0, NULL_RTX);
3177 emit_move_insn (target, temp);
3180 struct no_conflict_data
3182 rtx target, first, insn;
3186 /* Called via note_stores by emit_no_conflict_block and emit_libcall_block.
3187 Set P->must_stay if the currently examined clobber / store has to stay
3188 in the list of insns that constitute the actual no_conflict block /
3191 no_conflict_move_test (rtx dest, rtx set, void *p0)
3193 struct no_conflict_data *p= p0;
3195 /* If this inns directly contributes to setting the target, it must stay. */
3196 if (reg_overlap_mentioned_p (p->target, dest))
3197 p->must_stay = true;
3198 /* If we haven't committed to keeping any other insns in the list yet,
3199 there is nothing more to check. */
3200 else if (p->insn == p->first)
3202 /* If this insn sets / clobbers a register that feeds one of the insns
3203 already in the list, this insn has to stay too. */
3204 else if (reg_overlap_mentioned_p (dest, PATTERN (p->first))
3205 || (CALL_P (p->first) && (find_reg_fusage (p->first, USE, dest)))
3206 || reg_used_between_p (dest, p->first, p->insn)
3207 /* Likewise if this insn depends on a register set by a previous
3208 insn in the list, or if it sets a result (presumably a hard
3209 register) that is set or clobbered by a previous insn.
3210 N.B. the modified_*_p (SET_DEST...) tests applied to a MEM
3211 SET_DEST perform the former check on the address, and the latter
3212 check on the MEM. */
3213 || (GET_CODE (set) == SET
3214 && (modified_in_p (SET_SRC (set), p->first)
3215 || modified_in_p (SET_DEST (set), p->first)
3216 || modified_between_p (SET_SRC (set), p->first, p->insn)
3217 || modified_between_p (SET_DEST (set), p->first, p->insn))))
3218 p->must_stay = true;
3221 /* Encapsulate the block starting at FIRST and ending with LAST, which is
3222 logically equivalent to EQUIV, so it gets manipulated as a unit if it
3223 is possible to do so. */
3226 maybe_encapsulate_block (rtx first, rtx last, rtx equiv)
3228 if (!flag_non_call_exceptions || !may_trap_p (equiv))
3230 /* We can't attach the REG_LIBCALL and REG_RETVAL notes when the
3231 encapsulated region would not be in one basic block, i.e. when
3232 there is a control_flow_insn_p insn between FIRST and LAST. */
3233 bool attach_libcall_retval_notes = true;
3234 rtx insn, next = NEXT_INSN (last);
3236 for (insn = first; insn != next; insn = NEXT_INSN (insn))
3237 if (control_flow_insn_p (insn))
3239 attach_libcall_retval_notes = false;
3243 if (attach_libcall_retval_notes)
3245 REG_NOTES (first) = gen_rtx_INSN_LIST (REG_LIBCALL, last,
3247 REG_NOTES (last) = gen_rtx_INSN_LIST (REG_RETVAL, first,
3253 /* Emit code to perform a series of operations on a multi-word quantity, one
3256 Such a block is preceded by a CLOBBER of the output, consists of multiple
3257 insns, each setting one word of the output, and followed by a SET copying
3258 the output to itself.
3260 Each of the insns setting words of the output receives a REG_NO_CONFLICT
3261 note indicating that it doesn't conflict with the (also multi-word)
3262 inputs. The entire block is surrounded by REG_LIBCALL and REG_RETVAL
3265 INSNS is a block of code generated to perform the operation, not including
3266 the CLOBBER and final copy. All insns that compute intermediate values
3267 are first emitted, followed by the block as described above.
3269 TARGET, OP0, and OP1 are the output and inputs of the operations,
3270 respectively. OP1 may be zero for a unary operation.
3272 EQUIV, if nonzero, is an expression to be placed into a REG_EQUAL note
3275 If TARGET is not a register, INSNS is simply emitted with no special
3276 processing. Likewise if anything in INSNS is not an INSN or if
3277 there is a libcall block inside INSNS.
3279 The final insn emitted is returned. */
3282 emit_no_conflict_block (rtx insns, rtx target, rtx op0, rtx op1, rtx equiv)
3284 rtx prev, next, first, last, insn;
3286 if (!REG_P (target) || reload_in_progress)
3287 return emit_insn (insns);
3289 for (insn = insns; insn; insn = NEXT_INSN (insn))
3290 if (!NONJUMP_INSN_P (insn)
3291 || find_reg_note (insn, REG_LIBCALL, NULL_RTX))
3292 return emit_insn (insns);
3294 /* First emit all insns that do not store into words of the output and remove
3295 these from the list. */
3296 for (insn = insns; insn; insn = next)
3299 struct no_conflict_data data;
3301 next = NEXT_INSN (insn);
3303 /* Some ports (cris) create a libcall regions at their own. We must
3304 avoid any potential nesting of LIBCALLs. */
3305 if ((note = find_reg_note (insn, REG_LIBCALL, NULL)) != NULL)
3306 remove_note (insn, note);
3307 if ((note = find_reg_note (insn, REG_RETVAL, NULL)) != NULL)
3308 remove_note (insn, note);
3310 data.target = target;
3314 note_stores (PATTERN (insn), no_conflict_move_test, &data);
3315 if (! data.must_stay)
3317 if (PREV_INSN (insn))
3318 NEXT_INSN (PREV_INSN (insn)) = next;
3323 PREV_INSN (next) = PREV_INSN (insn);
3329 prev = get_last_insn ();
3331 /* Now write the CLOBBER of the output, followed by the setting of each
3332 of the words, followed by the final copy. */
3333 if (target != op0 && target != op1)
3334 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
3336 for (insn = insns; insn; insn = next)
3338 next = NEXT_INSN (insn);
3341 if (op1 && REG_P (op1))
3342 REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_NO_CONFLICT, op1,
3345 if (op0 && REG_P (op0))
3346 REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_NO_CONFLICT, op0,
3350 if (mov_optab->handlers[(int) GET_MODE (target)].insn_code
3351 != CODE_FOR_nothing)
3353 last = emit_move_insn (target, target);
3355 set_unique_reg_note (last, REG_EQUAL, equiv);
3359 last = get_last_insn ();
3361 /* Remove any existing REG_EQUAL note from "last", or else it will
3362 be mistaken for a note referring to the full contents of the
3363 alleged libcall value when found together with the REG_RETVAL
3364 note added below. An existing note can come from an insn
3365 expansion at "last". */
3366 remove_note (last, find_reg_note (last, REG_EQUAL, NULL_RTX));
3370 first = get_insns ();
3372 first = NEXT_INSN (prev);
3374 maybe_encapsulate_block (first, last, equiv);
3379 /* Emit code to make a call to a constant function or a library call.
3381 INSNS is a list containing all insns emitted in the call.
3382 These insns leave the result in RESULT. Our block is to copy RESULT
3383 to TARGET, which is logically equivalent to EQUIV.
3385 We first emit any insns that set a pseudo on the assumption that these are
3386 loading constants into registers; doing so allows them to be safely cse'ed
3387 between blocks. Then we emit all the other insns in the block, followed by
3388 an insn to move RESULT to TARGET. This last insn will have a REQ_EQUAL
3389 note with an operand of EQUIV.
3391 Moving assignments to pseudos outside of the block is done to improve
3392 the generated code, but is not required to generate correct code,
3393 hence being unable to move an assignment is not grounds for not making
3394 a libcall block. There are two reasons why it is safe to leave these
3395 insns inside the block: First, we know that these pseudos cannot be
3396 used in generated RTL outside the block since they are created for
3397 temporary purposes within the block. Second, CSE will not record the
3398 values of anything set inside a libcall block, so we know they must
3399 be dead at the end of the block.
3401 Except for the first group of insns (the ones setting pseudos), the
3402 block is delimited by REG_RETVAL and REG_LIBCALL notes. */
3405 emit_libcall_block (rtx insns, rtx target, rtx result, rtx equiv)
3407 rtx final_dest = target;
3408 rtx prev, next, first, last, insn;
3410 /* If this is a reg with REG_USERVAR_P set, then it could possibly turn
3411 into a MEM later. Protect the libcall block from this change. */
3412 if (! REG_P (target) || REG_USERVAR_P (target))
3413 target = gen_reg_rtx (GET_MODE (target));
3415 /* If we're using non-call exceptions, a libcall corresponding to an
3416 operation that may trap may also trap. */
3417 if (flag_non_call_exceptions && may_trap_p (equiv))
3419 for (insn = insns; insn; insn = NEXT_INSN (insn))
3422 rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
3424 if (note != 0 && INTVAL (XEXP (note, 0)) <= 0)
3425 remove_note (insn, note);
3429 /* look for any CALL_INSNs in this sequence, and attach a REG_EH_REGION
3430 reg note to indicate that this call cannot throw or execute a nonlocal
3431 goto (unless there is already a REG_EH_REGION note, in which case
3433 for (insn = insns; insn; insn = NEXT_INSN (insn))
3436 rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
3439 XEXP (note, 0) = constm1_rtx;
3441 REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_EH_REGION, constm1_rtx,
3445 /* First emit all insns that set pseudos. Remove them from the list as
3446 we go. Avoid insns that set pseudos which were referenced in previous
3447 insns. These can be generated by move_by_pieces, for example,
3448 to update an address. Similarly, avoid insns that reference things
3449 set in previous insns. */
3451 for (insn = insns; insn; insn = next)
3453 rtx set = single_set (insn);
3456 /* Some ports (cris) create a libcall regions at their own. We must
3457 avoid any potential nesting of LIBCALLs. */
3458 if ((note = find_reg_note (insn, REG_LIBCALL, NULL)) != NULL)
3459 remove_note (insn, note);
3460 if ((note = find_reg_note (insn, REG_RETVAL, NULL)) != NULL)
3461 remove_note (insn, note);
3463 next = NEXT_INSN (insn);
3465 if (set != 0 && REG_P (SET_DEST (set))
3466 && REGNO (SET_DEST (set)) >= FIRST_PSEUDO_REGISTER)
3468 struct no_conflict_data data;
3470 data.target = const0_rtx;
3474 note_stores (PATTERN (insn), no_conflict_move_test, &data);
3475 if (! data.must_stay)
3477 if (PREV_INSN (insn))
3478 NEXT_INSN (PREV_INSN (insn)) = next;
3483 PREV_INSN (next) = PREV_INSN (insn);
3489 /* Some ports use a loop to copy large arguments onto the stack.
3490 Don't move anything outside such a loop. */
3495 prev = get_last_insn ();
3497 /* Write the remaining insns followed by the final copy. */
3499 for (insn = insns; insn; insn = next)
3501 next = NEXT_INSN (insn);
3506 last = emit_move_insn (target, result);
3507 if (mov_optab->handlers[(int) GET_MODE (target)].insn_code
3508 != CODE_FOR_nothing)
3509 set_unique_reg_note (last, REG_EQUAL, copy_rtx (equiv));
3512 /* Remove any existing REG_EQUAL note from "last", or else it will
3513 be mistaken for a note referring to the full contents of the
3514 libcall value when found together with the REG_RETVAL note added
3515 below. An existing note can come from an insn expansion at
3517 remove_note (last, find_reg_note (last, REG_EQUAL, NULL_RTX));
3520 if (final_dest != target)
3521 emit_move_insn (final_dest, target);
3524 first = get_insns ();
3526 first = NEXT_INSN (prev);
3528 maybe_encapsulate_block (first, last, equiv);
3531 /* Nonzero if we can perform a comparison of mode MODE straightforwardly.
3532 PURPOSE describes how this comparison will be used. CODE is the rtx
3533 comparison code we will be using.
3535 ??? Actually, CODE is slightly weaker than that. A target is still
3536 required to implement all of the normal bcc operations, but not
3537 required to implement all (or any) of the unordered bcc operations. */
3540 can_compare_p (enum rtx_code code, enum machine_mode mode,
3541 enum can_compare_purpose purpose)
3545 if (cmp_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3547 if (purpose == ccp_jump)
3548 return bcc_gen_fctn[(int) code] != NULL;
3549 else if (purpose == ccp_store_flag)
3550 return setcc_gen_code[(int) code] != CODE_FOR_nothing;
3552 /* There's only one cmov entry point, and it's allowed to fail. */
3555 if (purpose == ccp_jump
3556 && cbranch_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3558 if (purpose == ccp_cmov
3559 && cmov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3561 if (purpose == ccp_store_flag
3562 && cstore_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3564 mode = GET_MODE_WIDER_MODE (mode);
3566 while (mode != VOIDmode);
3571 /* This function is called when we are going to emit a compare instruction that
3572 compares the values found in *PX and *PY, using the rtl operator COMPARISON.
3574 *PMODE is the mode of the inputs (in case they are const_int).
3575 *PUNSIGNEDP nonzero says that the operands are unsigned;
3576 this matters if they need to be widened.
3578 If they have mode BLKmode, then SIZE specifies the size of both operands.
3580 This function performs all the setup necessary so that the caller only has
3581 to emit a single comparison insn. This setup can involve doing a BLKmode
3582 comparison or emitting a library call to perform the comparison if no insn
3583 is available to handle it.
3584 The values which are passed in through pointers can be modified; the caller
3585 should perform the comparison on the modified values. Constant
3586 comparisons must have already been folded. */
3589 prepare_cmp_insn (rtx *px, rtx *py, enum rtx_code *pcomparison, rtx size,
3590 enum machine_mode *pmode, int *punsignedp,
3591 enum can_compare_purpose purpose)
3593 enum machine_mode mode = *pmode;
3594 rtx x = *px, y = *py;
3595 int unsignedp = *punsignedp;
3597 /* If we are inside an appropriately-short loop and we are optimizing,
3598 force expensive constants into a register. */
3599 if (CONSTANT_P (x) && optimize
3600 && rtx_cost (x, COMPARE) > COSTS_N_INSNS (1))
3601 x = force_reg (mode, x);
3603 if (CONSTANT_P (y) && optimize
3604 && rtx_cost (y, COMPARE) > COSTS_N_INSNS (1))
3605 y = force_reg (mode, y);
3608 /* Make sure if we have a canonical comparison. The RTL
3609 documentation states that canonical comparisons are required only
3610 for targets which have cc0. */
3611 gcc_assert (!CONSTANT_P (x) || CONSTANT_P (y));
3614 /* Don't let both operands fail to indicate the mode. */
3615 if (GET_MODE (x) == VOIDmode && GET_MODE (y) == VOIDmode)
3616 x = force_reg (mode, x);
3618 /* Handle all BLKmode compares. */
3620 if (mode == BLKmode)
3622 enum machine_mode cmp_mode, result_mode;
3623 enum insn_code cmp_code;
3628 = GEN_INT (MIN (MEM_ALIGN (x), MEM_ALIGN (y)) / BITS_PER_UNIT);
3632 /* Try to use a memory block compare insn - either cmpstr
3633 or cmpmem will do. */
3634 for (cmp_mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3635 cmp_mode != VOIDmode;
3636 cmp_mode = GET_MODE_WIDER_MODE (cmp_mode))
3638 cmp_code = cmpmem_optab[cmp_mode];
3639 if (cmp_code == CODE_FOR_nothing)
3640 cmp_code = cmpstr_optab[cmp_mode];
3641 if (cmp_code == CODE_FOR_nothing)
3642 cmp_code = cmpstrn_optab[cmp_mode];
3643 if (cmp_code == CODE_FOR_nothing)
3646 /* Must make sure the size fits the insn's mode. */
3647 if ((GET_CODE (size) == CONST_INT
3648 && INTVAL (size) >= (1 << GET_MODE_BITSIZE (cmp_mode)))
3649 || (GET_MODE_BITSIZE (GET_MODE (size))
3650 > GET_MODE_BITSIZE (cmp_mode)))
3653 result_mode = insn_data[cmp_code].operand[0].mode;
3654 result = gen_reg_rtx (result_mode);
3655 size = convert_to_mode (cmp_mode, size, 1);
3656 emit_insn (GEN_FCN (cmp_code) (result, x, y, size, opalign));
3660 *pmode = result_mode;
3664 /* Otherwise call a library function, memcmp. */
3665 libfunc = memcmp_libfunc;
3666 length_type = sizetype;
3667 result_mode = TYPE_MODE (integer_type_node);
3668 cmp_mode = TYPE_MODE (length_type);
3669 size = convert_to_mode (TYPE_MODE (length_type), size,
3670 TYPE_UNSIGNED (length_type));
3672 result = emit_library_call_value (libfunc, 0, LCT_PURE_MAKE_BLOCK,
3679 *pmode = result_mode;
3683 /* Don't allow operands to the compare to trap, as that can put the
3684 compare and branch in different basic blocks. */
3685 if (flag_non_call_exceptions)
3688 x = force_reg (mode, x);
3690 y = force_reg (mode, y);
3695 if (can_compare_p (*pcomparison, mode, purpose))
3698 /* Handle a lib call just for the mode we are using. */
3700 if (cmp_optab->handlers[(int) mode].libfunc && !SCALAR_FLOAT_MODE_P (mode))
3702 rtx libfunc = cmp_optab->handlers[(int) mode].libfunc;
3705 /* If we want unsigned, and this mode has a distinct unsigned
3706 comparison routine, use that. */
3707 if (unsignedp && ucmp_optab->handlers[(int) mode].libfunc)
3708 libfunc = ucmp_optab->handlers[(int) mode].libfunc;
3710 result = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST_MAKE_BLOCK,
3711 word_mode, 2, x, mode, y, mode);
3713 /* There are two kinds of comparison routines. Biased routines
3714 return 0/1/2, and unbiased routines return -1/0/1. Other parts
3715 of gcc expect that the comparison operation is equivalent
3716 to the modified comparison. For signed comparisons compare the
3717 result against 1 in the biased case, and zero in the unbiased
3718 case. For unsigned comparisons always compare against 1 after
3719 biasing the unbiased result by adding 1. This gives us a way to
3725 if (!TARGET_LIB_INT_CMP_BIASED)
3728 *px = plus_constant (result, 1);
3735 gcc_assert (SCALAR_FLOAT_MODE_P (mode));
3736 prepare_float_lib_cmp (px, py, pcomparison, pmode, punsignedp);
3739 /* Before emitting an insn with code ICODE, make sure that X, which is going
3740 to be used for operand OPNUM of the insn, is converted from mode MODE to
3741 WIDER_MODE (UNSIGNEDP determines whether it is an unsigned conversion), and
3742 that it is accepted by the operand predicate. Return the new value. */
3745 prepare_operand (int icode, rtx x, int opnum, enum machine_mode mode,
3746 enum machine_mode wider_mode, int unsignedp)
3748 if (mode != wider_mode)
3749 x = convert_modes (wider_mode, mode, x, unsignedp);
3751 if (!insn_data[icode].operand[opnum].predicate
3752 (x, insn_data[icode].operand[opnum].mode))
3756 x = copy_to_mode_reg (insn_data[icode].operand[opnum].mode, x);
3762 /* Subroutine of emit_cmp_and_jump_insns; this function is called when we know
3763 we can do the comparison.
3764 The arguments are the same as for emit_cmp_and_jump_insns; but LABEL may
3765 be NULL_RTX which indicates that only a comparison is to be generated. */
3768 emit_cmp_and_jump_insn_1 (rtx x, rtx y, enum machine_mode mode,
3769 enum rtx_code comparison, int unsignedp, rtx label)
3771 rtx test = gen_rtx_fmt_ee (comparison, mode, x, y);
3772 enum mode_class class = GET_MODE_CLASS (mode);
3773 enum machine_mode wider_mode = mode;
3775 /* Try combined insns first. */
3778 enum insn_code icode;
3779 PUT_MODE (test, wider_mode);
3783 icode = cbranch_optab->handlers[(int) wider_mode].insn_code;
3785 if (icode != CODE_FOR_nothing
3786 && insn_data[icode].operand[0].predicate (test, wider_mode))
3788 x = prepare_operand (icode, x, 1, mode, wider_mode, unsignedp);
3789 y = prepare_operand (icode, y, 2, mode, wider_mode, unsignedp);
3790 emit_jump_insn (GEN_FCN (icode) (test, x, y, label));
3795 /* Handle some compares against zero. */
3796 icode = (int) tst_optab->handlers[(int) wider_mode].insn_code;
3797 if (y == CONST0_RTX (mode) && icode != CODE_FOR_nothing)
3799 x = prepare_operand (icode, x, 0, mode, wider_mode, unsignedp);
3800 emit_insn (GEN_FCN (icode) (x));
3802 emit_jump_insn (bcc_gen_fctn[(int) comparison] (label));
3806 /* Handle compares for which there is a directly suitable insn. */
3808 icode = (int) cmp_optab->handlers[(int) wider_mode].insn_code;
3809 if (icode != CODE_FOR_nothing)
3811 x = prepare_operand (icode, x, 0, mode, wider_mode, unsignedp);
3812 y = prepare_operand (icode, y, 1, mode, wider_mode, unsignedp);
3813 emit_insn (GEN_FCN (icode) (x, y));
3815 emit_jump_insn (bcc_gen_fctn[(int) comparison] (label));
3819 if (!CLASS_HAS_WIDER_MODES_P (class))
3822 wider_mode = GET_MODE_WIDER_MODE (wider_mode);
3824 while (wider_mode != VOIDmode);
3829 /* Generate code to compare X with Y so that the condition codes are
3830 set and to jump to LABEL if the condition is true. If X is a
3831 constant and Y is not a constant, then the comparison is swapped to
3832 ensure that the comparison RTL has the canonical form.
3834 UNSIGNEDP nonzero says that X and Y are unsigned; this matters if they
3835 need to be widened by emit_cmp_insn. UNSIGNEDP is also used to select
3836 the proper branch condition code.
3838 If X and Y have mode BLKmode, then SIZE specifies the size of both X and Y.
3840 MODE is the mode of the inputs (in case they are const_int).
3842 COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). It will
3843 be passed unchanged to emit_cmp_insn, then potentially converted into an
3844 unsigned variant based on UNSIGNEDP to select a proper jump instruction. */
3847 emit_cmp_and_jump_insns (rtx x, rtx y, enum rtx_code comparison, rtx size,
3848 enum machine_mode mode, int unsignedp, rtx label)
3850 rtx op0 = x, op1 = y;
3852 /* Swap operands and condition to ensure canonical RTL. */
3853 if (swap_commutative_operands_p (x, y))
3855 /* If we're not emitting a branch, this means some caller
3860 comparison = swap_condition (comparison);
3864 /* If OP0 is still a constant, then both X and Y must be constants.
3865 Force X into a register to create canonical RTL. */
3866 if (CONSTANT_P (op0))
3867 op0 = force_reg (mode, op0);
3871 comparison = unsigned_condition (comparison);
3873 prepare_cmp_insn (&op0, &op1, &comparison, size, &mode, &unsignedp,
3875 emit_cmp_and_jump_insn_1 (op0, op1, mode, comparison, unsignedp, label);
3878 /* Like emit_cmp_and_jump_insns, but generate only the comparison. */
3881 emit_cmp_insn (rtx x, rtx y, enum rtx_code comparison, rtx size,
3882 enum machine_mode mode, int unsignedp)
3884 emit_cmp_and_jump_insns (x, y, comparison, size, mode, unsignedp, 0);
3887 /* Emit a library call comparison between floating point X and Y.
3888 COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). */
3891 prepare_float_lib_cmp (rtx *px, rtx *py, enum rtx_code *pcomparison,
3892 enum machine_mode *pmode, int *punsignedp)
3894 enum rtx_code comparison = *pcomparison;
3895 enum rtx_code swapped = swap_condition (comparison);
3896 enum rtx_code reversed = reverse_condition_maybe_unordered (comparison);
3899 enum machine_mode orig_mode = GET_MODE (x);
3900 enum machine_mode mode;
3901 rtx value, target, insns, equiv;
3903 bool reversed_p = false;
3905 for (mode = orig_mode;
3907 mode = GET_MODE_WIDER_MODE (mode))
3909 if ((libfunc = code_to_optab[comparison]->handlers[mode].libfunc))
3912 if ((libfunc = code_to_optab[swapped]->handlers[mode].libfunc))
3915 tmp = x; x = y; y = tmp;
3916 comparison = swapped;
3920 if ((libfunc = code_to_optab[reversed]->handlers[mode].libfunc)
3921 && FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, reversed))
3923 comparison = reversed;
3929 gcc_assert (mode != VOIDmode);
3931 if (mode != orig_mode)
3933 x = convert_to_mode (mode, x, 0);
3934 y = convert_to_mode (mode, y, 0);
3937 /* Attach a REG_EQUAL note describing the semantics of the libcall to
3938 the RTL. The allows the RTL optimizers to delete the libcall if the
3939 condition can be determined at compile-time. */
3940 if (comparison == UNORDERED)
3942 rtx temp = simplify_gen_relational (NE, word_mode, mode, x, x);
3943 equiv = simplify_gen_relational (NE, word_mode, mode, y, y);
3944 equiv = simplify_gen_ternary (IF_THEN_ELSE, word_mode, word_mode,
3945 temp, const_true_rtx, equiv);
3949 equiv = simplify_gen_relational (comparison, word_mode, mode, x, y);
3950 if (! FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, comparison))
3952 rtx true_rtx, false_rtx;
3957 true_rtx = const0_rtx;
3958 false_rtx = const_true_rtx;
3962 true_rtx = const_true_rtx;
3963 false_rtx = const0_rtx;
3967 true_rtx = const1_rtx;
3968 false_rtx = const0_rtx;
3972 true_rtx = const0_rtx;
3973 false_rtx = constm1_rtx;
3977 true_rtx = constm1_rtx;
3978 false_rtx = const0_rtx;
3982 true_rtx = const0_rtx;
3983 false_rtx = const1_rtx;
3989 equiv = simplify_gen_ternary (IF_THEN_ELSE, word_mode, word_mode,
3990 equiv, true_rtx, false_rtx);
3995 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
3996 word_mode, 2, x, mode, y, mode);
3997 insns = get_insns ();
4000 target = gen_reg_rtx (word_mode);
4001 emit_libcall_block (insns, target, value, equiv);
4003 if (comparison == UNORDERED
4004 || FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, comparison))
4005 comparison = reversed_p ? EQ : NE;
4010 *pcomparison = comparison;
4014 /* Generate code to indirectly jump to a location given in the rtx LOC. */
4017 emit_indirect_jump (rtx loc)
4019 if (!insn_data[(int) CODE_FOR_indirect_jump].operand[0].predicate
4021 loc = copy_to_mode_reg (Pmode, loc);
4023 emit_jump_insn (gen_indirect_jump (loc));
4027 #ifdef HAVE_conditional_move
4029 /* Emit a conditional move instruction if the machine supports one for that
4030 condition and machine mode.
4032 OP0 and OP1 are the operands that should be compared using CODE. CMODE is
4033 the mode to use should they be constants. If it is VOIDmode, they cannot
4036 OP2 should be stored in TARGET if the comparison is true, otherwise OP3
4037 should be stored there. MODE is the mode to use should they be constants.
4038 If it is VOIDmode, they cannot both be constants.
4040 The result is either TARGET (perhaps modified) or NULL_RTX if the operation
4041 is not supported. */
4044 emit_conditional_move (rtx target, enum rtx_code code, rtx op0, rtx op1,
4045 enum machine_mode cmode, rtx op2, rtx op3,
4046 enum machine_mode mode, int unsignedp)
4048 rtx tem, subtarget, comparison, insn;
4049 enum insn_code icode;
4050 enum rtx_code reversed;
4052 /* If one operand is constant, make it the second one. Only do this
4053 if the other operand is not constant as well. */
4055 if (swap_commutative_operands_p (op0, op1))
4060 code = swap_condition (code);
4063 /* get_condition will prefer to generate LT and GT even if the old
4064 comparison was against zero, so undo that canonicalization here since
4065 comparisons against zero are cheaper. */
4066 if (code == LT && op1 == const1_rtx)
4067 code = LE, op1 = const0_rtx;
4068 else if (code == GT && op1 == constm1_rtx)
4069 code = GE, op1 = const0_rtx;
4071 if (cmode == VOIDmode)
4072 cmode = GET_MODE (op0);
4074 if (swap_commutative_operands_p (op2, op3)
4075 && ((reversed = reversed_comparison_code_parts (code, op0, op1, NULL))
4084 if (mode == VOIDmode)
4085 mode = GET_MODE (op2);
4087 icode = movcc_gen_code[mode];
4089 if (icode == CODE_FOR_nothing)
4093 target = gen_reg_rtx (mode);
4097 /* If the insn doesn't accept these operands, put them in pseudos. */
4099 if (!insn_data[icode].operand[0].predicate
4100 (subtarget, insn_data[icode].operand[0].mode))
4101 subtarget = gen_reg_rtx (insn_data[icode].operand[0].mode);
4103 if (!insn_data[icode].operand[2].predicate
4104 (op2, insn_data[icode].operand[2].mode))
4105 op2 = copy_to_mode_reg (insn_data[icode].operand[2].mode, op2);
4107 if (!insn_data[icode].operand[3].predicate
4108 (op3, insn_data[icode].operand[3].mode))
4109 op3 = copy_to_mode_reg (insn_data[icode].operand[3].mode, op3);
4111 /* Everything should now be in the suitable form, so emit the compare insn
4112 and then the conditional move. */
4115 = compare_from_rtx (op0, op1, code, unsignedp, cmode, NULL_RTX);
4117 /* ??? Watch for const0_rtx (nop) and const_true_rtx (unconditional)? */
4118 /* We can get const0_rtx or const_true_rtx in some circumstances. Just
4119 return NULL and let the caller figure out how best to deal with this
4121 if (GET_CODE (comparison) != code)
4124 insn = GEN_FCN (icode) (subtarget, comparison, op2, op3);
4126 /* If that failed, then give up. */
4132 if (subtarget != target)
4133 convert_move (target, subtarget, 0);
4138 /* Return nonzero if a conditional move of mode MODE is supported.
4140 This function is for combine so it can tell whether an insn that looks
4141 like a conditional move is actually supported by the hardware. If we
4142 guess wrong we lose a bit on optimization, but that's it. */
4143 /* ??? sparc64 supports conditionally moving integers values based on fp
4144 comparisons, and vice versa. How do we handle them? */
4147 can_conditionally_move_p (enum machine_mode mode)
4149 if (movcc_gen_code[mode] != CODE_FOR_nothing)
4155 #endif /* HAVE_conditional_move */
4157 /* Emit a conditional addition instruction if the machine supports one for that
4158 condition and machine mode.
4160 OP0 and OP1 are the operands that should be compared using CODE. CMODE is
4161 the mode to use should they be constants. If it is VOIDmode, they cannot
4164 OP2 should be stored in TARGET if the comparison is true, otherwise OP2+OP3
4165 should be stored there. MODE is the mode to use should they be constants.
4166 If it is VOIDmode, they cannot both be constants.
4168 The result is either TARGET (perhaps modified) or NULL_RTX if the operation
4169 is not supported. */
4172 emit_conditional_add (rtx target, enum rtx_code code, rtx op0, rtx op1,
4173 enum machine_mode cmode, rtx op2, rtx op3,
4174 enum machine_mode mode, int unsignedp)
4176 rtx tem, subtarget, comparison, insn;
4177 enum insn_code icode;
4178 enum rtx_code reversed;
4180 /* If one operand is constant, make it the second one. Only do this
4181 if the other operand is not constant as well. */
4183 if (swap_commutative_operands_p (op0, op1))
4188 code = swap_condition (code);
4191 /* get_condition will prefer to generate LT and GT even if the old
4192 comparison was against zero, so undo that canonicalization here since
4193 comparisons against zero are cheaper. */
4194 if (code == LT && op1 == const1_rtx)
4195 code = LE, op1 = const0_rtx;
4196 else if (code == GT && op1 == constm1_rtx)
4197 code = GE, op1 = const0_rtx;
4199 if (cmode == VOIDmode)
4200 cmode = GET_MODE (op0);
4202 if (swap_commutative_operands_p (op2, op3)
4203 && ((reversed = reversed_comparison_code_parts (code, op0, op1, NULL))
4212 if (mode == VOIDmode)
4213 mode = GET_MODE (op2);
4215 icode = addcc_optab->handlers[(int) mode].insn_code;
4217 if (icode == CODE_FOR_nothing)
4221 target = gen_reg_rtx (mode);
4223 /* If the insn doesn't accept these operands, put them in pseudos. */
4225 if (!insn_data[icode].operand[0].predicate
4226 (target, insn_data[icode].operand[0].mode))
4227 subtarget = gen_reg_rtx (insn_data[icode].operand[0].mode);
4231 if (!insn_data[icode].operand[2].predicate
4232 (op2, insn_data[icode].operand[2].mode))
4233 op2 = copy_to_mode_reg (insn_data[icode].operand[2].mode, op2);
4235 if (!insn_data[icode].operand[3].predicate
4236 (op3, insn_data[icode].operand[3].mode))
4237 op3 = copy_to_mode_reg (insn_data[icode].operand[3].mode, op3);
4239 /* Everything should now be in the suitable form, so emit the compare insn
4240 and then the conditional move. */
4243 = compare_from_rtx (op0, op1, code, unsignedp, cmode, NULL_RTX);
4245 /* ??? Watch for const0_rtx (nop) and const_true_rtx (unconditional)? */
4246 /* We can get const0_rtx or const_true_rtx in some circumstances. Just
4247 return NULL and let the caller figure out how best to deal with this
4249 if (GET_CODE (comparison) != code)
4252 insn = GEN_FCN (icode) (subtarget, comparison, op2, op3);
4254 /* If that failed, then give up. */
4260 if (subtarget != target)
4261 convert_move (target, subtarget, 0);
4266 /* These functions attempt to generate an insn body, rather than
4267 emitting the insn, but if the gen function already emits them, we
4268 make no attempt to turn them back into naked patterns. */
4270 /* Generate and return an insn body to add Y to X. */
4273 gen_add2_insn (rtx x, rtx y)
4275 int icode = (int) add_optab->handlers[(int) GET_MODE (x)].insn_code;
4277 gcc_assert (insn_data[icode].operand[0].predicate
4278 (x, insn_data[icode].operand[0].mode));
4279 gcc_assert (insn_data[icode].operand[1].predicate
4280 (x, insn_data[icode].operand[1].mode));
4281 gcc_assert (insn_data[icode].operand[2].predicate
4282 (y, insn_data[icode].operand[2].mode));
4284 return GEN_FCN (icode) (x, x, y);
4287 /* Generate and return an insn body to add r1 and c,
4288 storing the result in r0. */
4290 gen_add3_insn (rtx r0, rtx r1, rtx c)
4292 int icode = (int) add_optab->handlers[(int) GET_MODE (r0)].insn_code;
4294 if (icode == CODE_FOR_nothing
4295 || !(insn_data[icode].operand[0].predicate
4296 (r0, insn_data[icode].operand[0].mode))
4297 || !(insn_data[icode].operand[1].predicate
4298 (r1, insn_data[icode].operand[1].mode))
4299 || !(insn_data[icode].operand[2].predicate
4300 (c, insn_data[icode].operand[2].mode)))
4303 return GEN_FCN (icode) (r0, r1, c);
4307 have_add2_insn (rtx x, rtx y)
4311 gcc_assert (GET_MODE (x) != VOIDmode);
4313 icode = (int) add_optab->handlers[(int) GET_MODE (x)].insn_code;
4315 if (icode == CODE_FOR_nothing)
4318 if (!(insn_data[icode].operand[0].predicate
4319 (x, insn_data[icode].operand[0].mode))
4320 || !(insn_data[icode].operand[1].predicate
4321 (x, insn_data[icode].operand[1].mode))
4322 || !(insn_data[icode].operand[2].predicate
4323 (y, insn_data[icode].operand[2].mode)))
4329 /* Generate and return an insn body to subtract Y from X. */
4332 gen_sub2_insn (rtx x, rtx y)
4334 int icode = (int) sub_optab->handlers[(int) GET_MODE (x)].insn_code;
4336 gcc_assert (insn_data[icode].operand[0].predicate
4337 (x, insn_data[icode].operand[0].mode));
4338 gcc_assert (insn_data[icode].operand[1].predicate
4339 (x, insn_data[icode].operand[1].mode));
4340 gcc_assert (insn_data[icode].operand[2].predicate
4341 (y, insn_data[icode].operand[2].mode));
4343 return GEN_FCN (icode) (x, x, y);
4346 /* Generate and return an insn body to subtract r1 and c,
4347 storing the result in r0. */
4349 gen_sub3_insn (rtx r0, rtx r1, rtx c)
4351 int icode = (int) sub_optab->handlers[(int) GET_MODE (r0)].insn_code;
4353 if (icode == CODE_FOR_nothing
4354 || !(insn_data[icode].operand[0].predicate
4355 (r0, insn_data[icode].operand[0].mode))
4356 || !(insn_data[icode].operand[1].predicate
4357 (r1, insn_data[icode].operand[1].mode))
4358 || !(insn_data[icode].operand[2].predicate
4359 (c, insn_data[icode].operand[2].mode)))
4362 return GEN_FCN (icode) (r0, r1, c);
4366 have_sub2_insn (rtx x, rtx y)
4370 gcc_assert (GET_MODE (x) != VOIDmode);
4372 icode = (int) sub_optab->handlers[(int) GET_MODE (x)].insn_code;
4374 if (icode == CODE_FOR_nothing)
4377 if (!(insn_data[icode].operand[0].predicate
4378 (x, insn_data[icode].operand[0].mode))
4379 || !(insn_data[icode].operand[1].predicate
4380 (x, insn_data[icode].operand[1].mode))
4381 || !(insn_data[icode].operand[2].predicate
4382 (y, insn_data[icode].operand[2].mode)))
4388 /* Generate the body of an instruction to copy Y into X.
4389 It may be a list of insns, if one insn isn't enough. */
4392 gen_move_insn (rtx x, rtx y)
4397 emit_move_insn_1 (x, y);
4403 /* Return the insn code used to extend FROM_MODE to TO_MODE.
4404 UNSIGNEDP specifies zero-extension instead of sign-extension. If
4405 no such operation exists, CODE_FOR_nothing will be returned. */
4408 can_extend_p (enum machine_mode to_mode, enum machine_mode from_mode,
4412 #ifdef HAVE_ptr_extend
4414 return CODE_FOR_ptr_extend;
4417 tab = unsignedp ? zext_optab : sext_optab;
4418 return tab->handlers[to_mode][from_mode].insn_code;
4421 /* Generate the body of an insn to extend Y (with mode MFROM)
4422 into X (with mode MTO). Do zero-extension if UNSIGNEDP is nonzero. */
4425 gen_extend_insn (rtx x, rtx y, enum machine_mode mto,
4426 enum machine_mode mfrom, int unsignedp)
4428 enum insn_code icode = can_extend_p (mto, mfrom, unsignedp);
4429 return GEN_FCN (icode) (x, y);
4432 /* can_fix_p and can_float_p say whether the target machine
4433 can directly convert a given fixed point type to
4434 a given floating point type, or vice versa.
4435 The returned value is the CODE_FOR_... value to use,
4436 or CODE_FOR_nothing if these modes cannot be directly converted.
4438 *TRUNCP_PTR is set to 1 if it is necessary to output
4439 an explicit FTRUNC insn before the fix insn; otherwise 0. */
4441 static enum insn_code
4442 can_fix_p (enum machine_mode fixmode, enum machine_mode fltmode,
4443 int unsignedp, int *truncp_ptr)
4446 enum insn_code icode;
4448 tab = unsignedp ? ufixtrunc_optab : sfixtrunc_optab;
4449 icode = tab->handlers[fixmode][fltmode].insn_code;
4450 if (icode != CODE_FOR_nothing)
4456 /* FIXME: This requires a port to define both FIX and FTRUNC pattern
4457 for this to work. We need to rework the fix* and ftrunc* patterns
4458 and documentation. */
4459 tab = unsignedp ? ufix_optab : sfix_optab;
4460 icode = tab->handlers[fixmode][fltmode].insn_code;
4461 if (icode != CODE_FOR_nothing
4462 && ftrunc_optab->handlers[fltmode].insn_code != CODE_FOR_nothing)
4469 return CODE_FOR_nothing;
4472 static enum insn_code
4473 can_float_p (enum machine_mode fltmode, enum machine_mode fixmode,
4478 tab = unsignedp ? ufloat_optab : sfloat_optab;
4479 return tab->handlers[fltmode][fixmode].insn_code;
4482 /* Generate code to convert FROM to floating point
4483 and store in TO. FROM must be fixed point and not VOIDmode.
4484 UNSIGNEDP nonzero means regard FROM as unsigned.
4485 Normally this is done by correcting the final value
4486 if it is negative. */
4489 expand_float (rtx to, rtx from, int unsignedp)
4491 enum insn_code icode;
4493 enum machine_mode fmode, imode;
4494 bool can_do_signed = false;
4496 /* Crash now, because we won't be able to decide which mode to use. */
4497 gcc_assert (GET_MODE (from) != VOIDmode);
4499 /* Look for an insn to do the conversion. Do it in the specified
4500 modes if possible; otherwise convert either input, output or both to
4501 wider mode. If the integer mode is wider than the mode of FROM,
4502 we can do the conversion signed even if the input is unsigned. */
4504 for (fmode = GET_MODE (to); fmode != VOIDmode;
4505 fmode = GET_MODE_WIDER_MODE (fmode))
4506 for (imode = GET_MODE (from); imode != VOIDmode;
4507 imode = GET_MODE_WIDER_MODE (imode))
4509 int doing_unsigned = unsignedp;
4511 if (fmode != GET_MODE (to)
4512 && significand_size (fmode) < GET_MODE_BITSIZE (GET_MODE (from)))
4515 icode = can_float_p (fmode, imode, unsignedp);
4516 if (icode == CODE_FOR_nothing && unsignedp)
4518 enum insn_code scode = can_float_p (fmode, imode, 0);
4519 if (scode != CODE_FOR_nothing)
4520 can_do_signed = true;
4521 if (imode != GET_MODE (from))
4522 icode = scode, doing_unsigned = 0;
4525 if (icode != CODE_FOR_nothing)
4527 if (imode != GET_MODE (from))
4528 from = convert_to_mode (imode, from, unsignedp);
4530 if (fmode != GET_MODE (to))
4531 target = gen_reg_rtx (fmode);
4533 emit_unop_insn (icode, target, from,
4534 doing_unsigned ? UNSIGNED_FLOAT : FLOAT);
4537 convert_move (to, target, 0);
4542 /* Unsigned integer, and no way to convert directly. For binary
4543 floating point modes, convert as signed, then conditionally adjust
4545 if (unsignedp && can_do_signed && !DECIMAL_FLOAT_MODE_P (GET_MODE (to)))
4547 rtx label = gen_label_rtx ();
4549 REAL_VALUE_TYPE offset;
4551 /* Look for a usable floating mode FMODE wider than the source and at
4552 least as wide as the target. Using FMODE will avoid rounding woes
4553 with unsigned values greater than the signed maximum value. */
4555 for (fmode = GET_MODE (to); fmode != VOIDmode;
4556 fmode = GET_MODE_WIDER_MODE (fmode))
4557 if (GET_MODE_BITSIZE (GET_MODE (from)) < GET_MODE_BITSIZE (fmode)
4558 && can_float_p (fmode, GET_MODE (from), 0) != CODE_FOR_nothing)
4561 if (fmode == VOIDmode)
4563 /* There is no such mode. Pretend the target is wide enough. */
4564 fmode = GET_MODE (to);
4566 /* Avoid double-rounding when TO is narrower than FROM. */
4567 if ((significand_size (fmode) + 1)
4568 < GET_MODE_BITSIZE (GET_MODE (from)))
4571 rtx neglabel = gen_label_rtx ();
4573 /* Don't use TARGET if it isn't a register, is a hard register,
4574 or is the wrong mode. */
4576 || REGNO (target) < FIRST_PSEUDO_REGISTER
4577 || GET_MODE (target) != fmode)
4578 target = gen_reg_rtx (fmode);
4580 imode = GET_MODE (from);
4581 do_pending_stack_adjust ();
4583 /* Test whether the sign bit is set. */
4584 emit_cmp_and_jump_insns (from, const0_rtx, LT, NULL_RTX, imode,
4587 /* The sign bit is not set. Convert as signed. */
4588 expand_float (target, from, 0);
4589 emit_jump_insn (gen_jump (label));
4592 /* The sign bit is set.
4593 Convert to a usable (positive signed) value by shifting right
4594 one bit, while remembering if a nonzero bit was shifted
4595 out; i.e., compute (from & 1) | (from >> 1). */
4597 emit_label (neglabel);
4598 temp = expand_binop (imode, and_optab, from, const1_rtx,
4599 NULL_RTX, 1, OPTAB_LIB_WIDEN);
4600 temp1 = expand_shift (RSHIFT_EXPR, imode, from, integer_one_node,
4602 temp = expand_binop (imode, ior_optab, temp, temp1, temp, 1,
4604 expand_float (target, temp, 0);
4606 /* Multiply by 2 to undo the shift above. */
4607 temp = expand_binop (fmode, add_optab, target, target,
4608 target, 0, OPTAB_LIB_WIDEN);
4610 emit_move_insn (target, temp);
4612 do_pending_stack_adjust ();
4618 /* If we are about to do some arithmetic to correct for an
4619 unsigned operand, do it in a pseudo-register. */
4621 if (GET_MODE (to) != fmode
4622 || !REG_P (to) || REGNO (to) < FIRST_PSEUDO_REGISTER)
4623 target = gen_reg_rtx (fmode);
4625 /* Convert as signed integer to floating. */
4626 expand_float (target, from, 0);
4628 /* If FROM is negative (and therefore TO is negative),
4629 correct its value by 2**bitwidth. */
4631 do_pending_stack_adjust ();
4632 emit_cmp_and_jump_insns (from, const0_rtx, GE, NULL_RTX, GET_MODE (from),
4636 real_2expN (&offset, GET_MODE_BITSIZE (GET_MODE (from)));
4637 temp = expand_binop (fmode, add_optab, target,
4638 CONST_DOUBLE_FROM_REAL_VALUE (offset, fmode),
4639 target, 0, OPTAB_LIB_WIDEN);
4641 emit_move_insn (target, temp);
4643 do_pending_stack_adjust ();
4648 /* No hardware instruction available; call a library routine. */
4653 convert_optab tab = unsignedp ? ufloat_optab : sfloat_optab;
4655 if (GET_MODE_SIZE (GET_MODE (from)) < GET_MODE_SIZE (SImode))
4656 from = convert_to_mode (SImode, from, unsignedp);
4658 libfunc = tab->handlers[GET_MODE (to)][GET_MODE (from)].libfunc;
4659 gcc_assert (libfunc);
4663 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
4664 GET_MODE (to), 1, from,
4666 insns = get_insns ();
4669 emit_libcall_block (insns, target, value,
4670 gen_rtx_FLOAT (GET_MODE (to), from));
4675 /* Copy result to requested destination
4676 if we have been computing in a temp location. */
4680 if (GET_MODE (target) == GET_MODE (to))
4681 emit_move_insn (to, target);
4683 convert_move (to, target, 0);
4687 /* Generate code to convert FROM to fixed point and store in TO. FROM
4688 must be floating point. */
4691 expand_fix (rtx to, rtx from, int unsignedp)
4693 enum insn_code icode;
4695 enum machine_mode fmode, imode;
4698 /* We first try to find a pair of modes, one real and one integer, at
4699 least as wide as FROM and TO, respectively, in which we can open-code
4700 this conversion. If the integer mode is wider than the mode of TO,
4701 we can do the conversion either signed or unsigned. */
4703 for (fmode = GET_MODE (from); fmode != VOIDmode;
4704 fmode = GET_MODE_WIDER_MODE (fmode))
4705 for (imode = GET_MODE (to); imode != VOIDmode;
4706 imode = GET_MODE_WIDER_MODE (imode))
4708 int doing_unsigned = unsignedp;
4710 icode = can_fix_p (imode, fmode, unsignedp, &must_trunc);
4711 if (icode == CODE_FOR_nothing && imode != GET_MODE (to) && unsignedp)
4712 icode = can_fix_p (imode, fmode, 0, &must_trunc), doing_unsigned = 0;
4714 if (icode != CODE_FOR_nothing)
4716 if (fmode != GET_MODE (from))
4717 from = convert_to_mode (fmode, from, 0);
4721 rtx temp = gen_reg_rtx (GET_MODE (from));
4722 from = expand_unop (GET_MODE (from), ftrunc_optab, from,
4726 if (imode != GET_MODE (to))
4727 target = gen_reg_rtx (imode);
4729 emit_unop_insn (icode, target, from,
4730 doing_unsigned ? UNSIGNED_FIX : FIX);
4732 convert_move (to, target, unsignedp);
4737 /* For an unsigned conversion, there is one more way to do it.
4738 If we have a signed conversion, we generate code that compares
4739 the real value to the largest representable positive number. If if
4740 is smaller, the conversion is done normally. Otherwise, subtract
4741 one plus the highest signed number, convert, and add it back.
4743 We only need to check all real modes, since we know we didn't find
4744 anything with a wider integer mode.
4746 This code used to extend FP value into mode wider than the destination.
4747 This is not needed. Consider, for instance conversion from SFmode
4750 The hot path through the code is dealing with inputs smaller than 2^63
4751 and doing just the conversion, so there is no bits to lose.
4753 In the other path we know the value is positive in the range 2^63..2^64-1
4754 inclusive. (as for other imput overflow happens and result is undefined)
4755 So we know that the most important bit set in mantissa corresponds to
4756 2^63. The subtraction of 2^63 should not generate any rounding as it
4757 simply clears out that bit. The rest is trivial. */
4759 if (unsignedp && GET_MODE_BITSIZE (GET_MODE (to)) <= HOST_BITS_PER_WIDE_INT)
4760 for (fmode = GET_MODE (from); fmode != VOIDmode;
4761 fmode = GET_MODE_WIDER_MODE (fmode))
4762 if (CODE_FOR_nothing != can_fix_p (GET_MODE (to), fmode, 0,
4766 REAL_VALUE_TYPE offset;
4767 rtx limit, lab1, lab2, insn;
4769 bitsize = GET_MODE_BITSIZE (GET_MODE (to));
4770 real_2expN (&offset, bitsize - 1);
4771 limit = CONST_DOUBLE_FROM_REAL_VALUE (offset, fmode);
4772 lab1 = gen_label_rtx ();
4773 lab2 = gen_label_rtx ();
4775 if (fmode != GET_MODE (from))
4776 from = convert_to_mode (fmode, from, 0);
4778 /* See if we need to do the subtraction. */
4779 do_pending_stack_adjust ();
4780 emit_cmp_and_jump_insns (from, limit, GE, NULL_RTX, GET_MODE (from),
4783 /* If not, do the signed "fix" and branch around fixup code. */
4784 expand_fix (to, from, 0);
4785 emit_jump_insn (gen_jump (lab2));
4788 /* Otherwise, subtract 2**(N-1), convert to signed number,
4789 then add 2**(N-1). Do the addition using XOR since this
4790 will often generate better code. */
4792 target = expand_binop (GET_MODE (from), sub_optab, from, limit,
4793 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4794 expand_fix (to, target, 0);
4795 target = expand_binop (GET_MODE (to), xor_optab, to,
4797 ((HOST_WIDE_INT) 1 << (bitsize - 1),
4799 to, 1, OPTAB_LIB_WIDEN);
4802 emit_move_insn (to, target);
4806 if (mov_optab->handlers[(int) GET_MODE (to)].insn_code
4807 != CODE_FOR_nothing)
4809 /* Make a place for a REG_NOTE and add it. */
4810 insn = emit_move_insn (to, to);
4811 set_unique_reg_note (insn,
4813 gen_rtx_fmt_e (UNSIGNED_FIX,
4821 /* We can't do it with an insn, so use a library call. But first ensure
4822 that the mode of TO is at least as wide as SImode, since those are the
4823 only library calls we know about. */
4825 if (GET_MODE_SIZE (GET_MODE (to)) < GET_MODE_SIZE (SImode))
4827 target = gen_reg_rtx (SImode);
4829 expand_fix (target, from, unsignedp);
4837 convert_optab tab = unsignedp ? ufix_optab : sfix_optab;
4838 libfunc = tab->handlers[GET_MODE (to)][GET_MODE (from)].libfunc;
4839 gcc_assert (libfunc);
4843 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
4844 GET_MODE (to), 1, from,
4846 insns = get_insns ();
4849 emit_libcall_block (insns, target, value,
4850 gen_rtx_fmt_e (unsignedp ? UNSIGNED_FIX : FIX,
4851 GET_MODE (to), from));
4856 if (GET_MODE (to) == GET_MODE (target))
4857 emit_move_insn (to, target);
4859 convert_move (to, target, 0);
4863 /* Report whether we have an instruction to perform the operation
4864 specified by CODE on operands of mode MODE. */
4866 have_insn_for (enum rtx_code code, enum machine_mode mode)
4868 return (code_to_optab[(int) code] != 0
4869 && (code_to_optab[(int) code]->handlers[(int) mode].insn_code
4870 != CODE_FOR_nothing));
4873 /* Create a blank optab. */
4878 optab op = ggc_alloc (sizeof (struct optab));
4879 for (i = 0; i < NUM_MACHINE_MODES; i++)
4881 op->handlers[i].insn_code = CODE_FOR_nothing;
4882 op->handlers[i].libfunc = 0;
4888 static convert_optab
4889 new_convert_optab (void)
4892 convert_optab op = ggc_alloc (sizeof (struct convert_optab));
4893 for (i = 0; i < NUM_MACHINE_MODES; i++)
4894 for (j = 0; j < NUM_MACHINE_MODES; j++)
4896 op->handlers[i][j].insn_code = CODE_FOR_nothing;
4897 op->handlers[i][j].libfunc = 0;
4902 /* Same, but fill in its code as CODE, and write it into the
4903 code_to_optab table. */
4905 init_optab (enum rtx_code code)
4907 optab op = new_optab ();
4909 code_to_optab[(int) code] = op;
4913 /* Same, but fill in its code as CODE, and do _not_ write it into
4914 the code_to_optab table. */
4916 init_optabv (enum rtx_code code)
4918 optab op = new_optab ();
4923 /* Conversion optabs never go in the code_to_optab table. */
4924 static inline convert_optab
4925 init_convert_optab (enum rtx_code code)
4927 convert_optab op = new_convert_optab ();
4932 /* Initialize the libfunc fields of an entire group of entries in some
4933 optab. Each entry is set equal to a string consisting of a leading
4934 pair of underscores followed by a generic operation name followed by
4935 a mode name (downshifted to lowercase) followed by a single character
4936 representing the number of operands for the given operation (which is
4937 usually one of the characters '2', '3', or '4').
4939 OPTABLE is the table in which libfunc fields are to be initialized.
4940 FIRST_MODE is the first machine mode index in the given optab to
4942 LAST_MODE is the last machine mode index in the given optab to
4944 OPNAME is the generic (string) name of the operation.
4945 SUFFIX is the character which specifies the number of operands for
4946 the given generic operation.
4950 init_libfuncs (optab optable, int first_mode, int last_mode,
4951 const char *opname, int suffix)
4954 unsigned opname_len = strlen (opname);
4956 for (mode = first_mode; (int) mode <= (int) last_mode;
4957 mode = (enum machine_mode) ((int) mode + 1))
4959 const char *mname = GET_MODE_NAME (mode);
4960 unsigned mname_len = strlen (mname);
4961 char *libfunc_name = alloca (2 + opname_len + mname_len + 1 + 1);
4968 for (q = opname; *q; )
4970 for (q = mname; *q; q++)
4971 *p++ = TOLOWER (*q);
4975 optable->handlers[(int) mode].libfunc
4976 = init_one_libfunc (ggc_alloc_string (libfunc_name, p - libfunc_name));
4980 /* Initialize the libfunc fields of an entire group of entries in some
4981 optab which correspond to all integer mode operations. The parameters
4982 have the same meaning as similarly named ones for the `init_libfuncs'
4983 routine. (See above). */
4986 init_integral_libfuncs (optab optable, const char *opname, int suffix)
4988 int maxsize = 2*BITS_PER_WORD;
4989 if (maxsize < LONG_LONG_TYPE_SIZE)
4990 maxsize = LONG_LONG_TYPE_SIZE;
4991 init_libfuncs (optable, word_mode,
4992 mode_for_size (maxsize, MODE_INT, 0),
4996 /* Initialize the libfunc fields of an entire group of entries in some
4997 optab which correspond to all real mode operations. The parameters
4998 have the same meaning as similarly named ones for the `init_libfuncs'
4999 routine. (See above). */
5002 init_floating_libfuncs (optab optable, const char *opname, int suffix)
5004 init_libfuncs (optable, MIN_MODE_FLOAT, MAX_MODE_FLOAT, opname, suffix);
5005 init_libfuncs (optable, MIN_MODE_DECIMAL_FLOAT, MAX_MODE_DECIMAL_FLOAT,
5009 /* Initialize the libfunc fields of an entire group of entries of an
5010 inter-mode-class conversion optab. The string formation rules are
5011 similar to the ones for init_libfuncs, above, but instead of having
5012 a mode name and an operand count these functions have two mode names
5013 and no operand count. */
5015 init_interclass_conv_libfuncs (convert_optab tab, const char *opname,
5016 enum mode_class from_class,
5017 enum mode_class to_class)
5019 enum machine_mode first_from_mode = GET_CLASS_NARROWEST_MODE (from_class);
5020 enum machine_mode first_to_mode = GET_CLASS_NARROWEST_MODE (to_class);
5021 size_t opname_len = strlen (opname);
5022 size_t max_mname_len = 0;
5024 enum machine_mode fmode, tmode;
5025 const char *fname, *tname;
5027 char *libfunc_name, *suffix;
5030 for (fmode = first_from_mode;
5032 fmode = GET_MODE_WIDER_MODE (fmode))
5033 max_mname_len = MAX (max_mname_len, strlen (GET_MODE_NAME (fmode)));
5035 for (tmode = first_to_mode;
5037 tmode = GET_MODE_WIDER_MODE (tmode))
5038 max_mname_len = MAX (max_mname_len, strlen (GET_MODE_NAME (tmode)));
5040 libfunc_name = alloca (2 + opname_len + 2*max_mname_len + 1 + 1);
5041 libfunc_name[0] = '_';
5042 libfunc_name[1] = '_';
5043 memcpy (&libfunc_name[2], opname, opname_len);
5044 suffix = libfunc_name + opname_len + 2;
5046 for (fmode = first_from_mode; fmode != VOIDmode;
5047 fmode = GET_MODE_WIDER_MODE (fmode))
5048 for (tmode = first_to_mode; tmode != VOIDmode;
5049 tmode = GET_MODE_WIDER_MODE (tmode))
5051 fname = GET_MODE_NAME (fmode);
5052 tname = GET_MODE_NAME (tmode);
5055 for (q = fname; *q; p++, q++)
5057 for (q = tname; *q; p++, q++)
5062 tab->handlers[tmode][fmode].libfunc
5063 = init_one_libfunc (ggc_alloc_string (libfunc_name,
5068 /* Initialize the libfunc fields of an entire group of entries of an
5069 intra-mode-class conversion optab. The string formation rules are
5070 similar to the ones for init_libfunc, above. WIDENING says whether
5071 the optab goes from narrow to wide modes or vice versa. These functions
5072 have two mode names _and_ an operand count. */
5074 init_intraclass_conv_libfuncs (convert_optab tab, const char *opname,
5075 enum mode_class class, bool widening)
5077 enum machine_mode first_mode = GET_CLASS_NARROWEST_MODE (class);
5078 size_t opname_len = strlen (opname);
5079 size_t max_mname_len = 0;
5081 enum machine_mode nmode, wmode;
5082 const char *nname, *wname;
5084 char *libfunc_name, *suffix;
5087 for (nmode = first_mode; nmode != VOIDmode;
5088 nmode = GET_MODE_WIDER_MODE (nmode))
5089 max_mname_len = MAX (max_mname_len, strlen (GET_MODE_NAME (nmode)));
5091 libfunc_name = alloca (2 + opname_len + 2*max_mname_len + 1 + 1);
5092 libfunc_name[0] = '_';
5093 libfunc_name[1] = '_';
5094 memcpy (&libfunc_name[2], opname, opname_len);
5095 suffix = libfunc_name + opname_len + 2;
5097 for (nmode = first_mode; nmode != VOIDmode;
5098 nmode = GET_MODE_WIDER_MODE (nmode))
5099 for (wmode = GET_MODE_WIDER_MODE (nmode); wmode != VOIDmode;
5100 wmode = GET_MODE_WIDER_MODE (wmode))
5102 nname = GET_MODE_NAME (nmode);
5103 wname = GET_MODE_NAME (wmode);
5106 for (q = widening ? nname : wname; *q; p++, q++)
5108 for (q = widening ? wname : nname; *q; p++, q++)
5114 tab->handlers[widening ? wmode : nmode]
5115 [widening ? nmode : wmode].libfunc
5116 = init_one_libfunc (ggc_alloc_string (libfunc_name,
5123 init_one_libfunc (const char *name)
5127 /* Create a FUNCTION_DECL that can be passed to
5128 targetm.encode_section_info. */
5129 /* ??? We don't have any type information except for this is
5130 a function. Pretend this is "int foo()". */
5131 tree decl = build_decl (FUNCTION_DECL, get_identifier (name),
5132 build_function_type (integer_type_node, NULL_TREE));
5133 DECL_ARTIFICIAL (decl) = 1;
5134 DECL_EXTERNAL (decl) = 1;
5135 TREE_PUBLIC (decl) = 1;
5137 symbol = XEXP (DECL_RTL (decl), 0);
5139 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
5140 are the flags assigned by targetm.encode_section_info. */
5141 SET_SYMBOL_REF_DECL (symbol, 0);
5146 /* Call this to reset the function entry for one optab (OPTABLE) in mode
5147 MODE to NAME, which should be either 0 or a string constant. */
5149 set_optab_libfunc (optab optable, enum machine_mode mode, const char *name)
5152 optable->handlers[mode].libfunc = init_one_libfunc (name);
5154 optable->handlers[mode].libfunc = 0;
5157 /* Call this to reset the function entry for one conversion optab
5158 (OPTABLE) from mode FMODE to mode TMODE to NAME, which should be
5159 either 0 or a string constant. */
5161 set_conv_libfunc (convert_optab optable, enum machine_mode tmode,
5162 enum machine_mode fmode, const char *name)
5165 optable->handlers[tmode][fmode].libfunc = init_one_libfunc (name);
5167 optable->handlers[tmode][fmode].libfunc = 0;
5170 /* Call this once to initialize the contents of the optabs
5171 appropriately for the current target machine. */
5178 /* Start by initializing all tables to contain CODE_FOR_nothing. */
5180 for (i = 0; i < NUM_RTX_CODE; i++)
5181 setcc_gen_code[i] = CODE_FOR_nothing;
5183 #ifdef HAVE_conditional_move
5184 for (i = 0; i < NUM_MACHINE_MODES; i++)
5185 movcc_gen_code[i] = CODE_FOR_nothing;
5188 for (i = 0; i < NUM_MACHINE_MODES; i++)
5190 vcond_gen_code[i] = CODE_FOR_nothing;
5191 vcondu_gen_code[i] = CODE_FOR_nothing;
5194 add_optab = init_optab (PLUS);
5195 addv_optab = init_optabv (PLUS);
5196 sub_optab = init_optab (MINUS);
5197 subv_optab = init_optabv (MINUS);
5198 smul_optab = init_optab (MULT);
5199 smulv_optab = init_optabv (MULT);
5200 smul_highpart_optab = init_optab (UNKNOWN);
5201 umul_highpart_optab = init_optab (UNKNOWN);
5202 smul_widen_optab = init_optab (UNKNOWN);
5203 umul_widen_optab = init_optab (UNKNOWN);
5204 usmul_widen_optab = init_optab (UNKNOWN);
5205 sdiv_optab = init_optab (DIV);
5206 sdivv_optab = init_optabv (DIV);
5207 sdivmod_optab = init_optab (UNKNOWN);
5208 udiv_optab = init_optab (UDIV);
5209 udivmod_optab = init_optab (UNKNOWN);
5210 smod_optab = init_optab (MOD);
5211 umod_optab = init_optab (UMOD);
5212 fmod_optab = init_optab (UNKNOWN);
5213 drem_optab = init_optab (UNKNOWN);
5214 ftrunc_optab = init_optab (UNKNOWN);
5215 and_optab = init_optab (AND);
5216 ior_optab = init_optab (IOR);
5217 xor_optab = init_optab (XOR);
5218 ashl_optab = init_optab (ASHIFT);
5219 ashr_optab = init_optab (ASHIFTRT);
5220 lshr_optab = init_optab (LSHIFTRT);
5221 rotl_optab = init_optab (ROTATE);
5222 rotr_optab = init_optab (ROTATERT);
5223 smin_optab = init_optab (SMIN);
5224 smax_optab = init_optab (SMAX);
5225 umin_optab = init_optab (UMIN);
5226 umax_optab = init_optab (UMAX);
5227 pow_optab = init_optab (UNKNOWN);
5228 atan2_optab = init_optab (UNKNOWN);
5230 /* These three have codes assigned exclusively for the sake of
5232 mov_optab = init_optab (SET);
5233 movstrict_optab = init_optab (STRICT_LOW_PART);
5234 cmp_optab = init_optab (COMPARE);
5236 ucmp_optab = init_optab (UNKNOWN);
5237 tst_optab = init_optab (UNKNOWN);
5239 eq_optab = init_optab (EQ);
5240 ne_optab = init_optab (NE);
5241 gt_optab = init_optab (GT);
5242 ge_optab = init_optab (GE);
5243 lt_optab = init_optab (LT);
5244 le_optab = init_optab (LE);
5245 unord_optab = init_optab (UNORDERED);
5247 neg_optab = init_optab (NEG);
5248 negv_optab = init_optabv (NEG);
5249 abs_optab = init_optab (ABS);
5250 absv_optab = init_optabv (ABS);
5251 addcc_optab = init_optab (UNKNOWN);
5252 one_cmpl_optab = init_optab (NOT);
5253 ffs_optab = init_optab (FFS);
5254 clz_optab = init_optab (CLZ);
5255 ctz_optab = init_optab (CTZ);
5256 popcount_optab = init_optab (POPCOUNT);
5257 parity_optab = init_optab (PARITY);
5258 sqrt_optab = init_optab (SQRT);
5259 floor_optab = init_optab (UNKNOWN);
5260 lfloor_optab = init_optab (UNKNOWN);
5261 ceil_optab = init_optab (UNKNOWN);
5262 lceil_optab = init_optab (UNKNOWN);
5263 round_optab = init_optab (UNKNOWN);
5264 btrunc_optab = init_optab (UNKNOWN);
5265 nearbyint_optab = init_optab (UNKNOWN);
5266 rint_optab = init_optab (UNKNOWN);
5267 lrint_optab = init_optab (UNKNOWN);
5268 sincos_optab = init_optab (UNKNOWN);
5269 sin_optab = init_optab (UNKNOWN);
5270 asin_optab = init_optab (UNKNOWN);
5271 cos_optab = init_optab (UNKNOWN);
5272 acos_optab = init_optab (UNKNOWN);
5273 exp_optab = init_optab (UNKNOWN);
5274 exp10_optab = init_optab (UNKNOWN);
5275 exp2_optab = init_optab (UNKNOWN);
5276 expm1_optab = init_optab (UNKNOWN);
5277 ldexp_optab = init_optab (UNKNOWN);
5278 logb_optab = init_optab (UNKNOWN);
5279 ilogb_optab = init_optab (UNKNOWN);
5280 log_optab = init_optab (UNKNOWN);
5281 log10_optab = init_optab (UNKNOWN);
5282 log2_optab = init_optab (UNKNOWN);
5283 log1p_optab = init_optab (UNKNOWN);
5284 tan_optab = init_optab (UNKNOWN);
5285 atan_optab = init_optab (UNKNOWN);
5286 copysign_optab = init_optab (UNKNOWN);
5288 strlen_optab = init_optab (UNKNOWN);
5289 cbranch_optab = init_optab (UNKNOWN);
5290 cmov_optab = init_optab (UNKNOWN);
5291 cstore_optab = init_optab (UNKNOWN);
5292 push_optab = init_optab (UNKNOWN);
5294 reduc_smax_optab = init_optab (UNKNOWN);
5295 reduc_umax_optab = init_optab (UNKNOWN);
5296 reduc_smin_optab = init_optab (UNKNOWN);
5297 reduc_umin_optab = init_optab (UNKNOWN);
5298 reduc_splus_optab = init_optab (UNKNOWN);
5299 reduc_uplus_optab = init_optab (UNKNOWN);
5301 ssum_widen_optab = init_optab (UNKNOWN);
5302 usum_widen_optab = init_optab (UNKNOWN);
5303 sdot_prod_optab = init_optab (UNKNOWN);
5304 udot_prod_optab = init_optab (UNKNOWN);
5306 vec_extract_optab = init_optab (UNKNOWN);
5307 vec_set_optab = init_optab (UNKNOWN);
5308 vec_init_optab = init_optab (UNKNOWN);
5309 vec_shl_optab = init_optab (UNKNOWN);
5310 vec_shr_optab = init_optab (UNKNOWN);
5311 vec_realign_load_optab = init_optab (UNKNOWN);
5312 movmisalign_optab = init_optab (UNKNOWN);
5314 powi_optab = init_optab (UNKNOWN);
5317 sext_optab = init_convert_optab (SIGN_EXTEND);
5318 zext_optab = init_convert_optab (ZERO_EXTEND);
5319 trunc_optab = init_convert_optab (TRUNCATE);
5320 sfix_optab = init_convert_optab (FIX);
5321 ufix_optab = init_convert_optab (UNSIGNED_FIX);
5322 sfixtrunc_optab = init_convert_optab (UNKNOWN);
5323 ufixtrunc_optab = init_convert_optab (UNKNOWN);
5324 sfloat_optab = init_convert_optab (FLOAT);
5325 ufloat_optab = init_convert_optab (UNSIGNED_FLOAT);
5327 for (i = 0; i < NUM_MACHINE_MODES; i++)
5329 movmem_optab[i] = CODE_FOR_nothing;
5330 cmpstr_optab[i] = CODE_FOR_nothing;
5331 cmpstrn_optab[i] = CODE_FOR_nothing;
5332 cmpmem_optab[i] = CODE_FOR_nothing;
5333 setmem_optab[i] = CODE_FOR_nothing;
5335 sync_add_optab[i] = CODE_FOR_nothing;
5336 sync_sub_optab[i] = CODE_FOR_nothing;
5337 sync_ior_optab[i] = CODE_FOR_nothing;
5338 sync_and_optab[i] = CODE_FOR_nothing;
5339 sync_xor_optab[i] = CODE_FOR_nothing;
5340 sync_nand_optab[i] = CODE_FOR_nothing;
5341 sync_old_add_optab[i] = CODE_FOR_nothing;
5342 sync_old_sub_optab[i] = CODE_FOR_nothing;
5343 sync_old_ior_optab[i] = CODE_FOR_nothing;
5344 sync_old_and_optab[i] = CODE_FOR_nothing;
5345 sync_old_xor_optab[i] = CODE_FOR_nothing;
5346 sync_old_nand_optab[i] = CODE_FOR_nothing;
5347 sync_new_add_optab[i] = CODE_FOR_nothing;
5348 sync_new_sub_optab[i] = CODE_FOR_nothing;
5349 sync_new_ior_optab[i] = CODE_FOR_nothing;
5350 sync_new_and_optab[i] = CODE_FOR_nothing;
5351 sync_new_xor_optab[i] = CODE_FOR_nothing;
5352 sync_new_nand_optab[i] = CODE_FOR_nothing;
5353 sync_compare_and_swap[i] = CODE_FOR_nothing;
5354 sync_compare_and_swap_cc[i] = CODE_FOR_nothing;
5355 sync_lock_test_and_set[i] = CODE_FOR_nothing;
5356 sync_lock_release[i] = CODE_FOR_nothing;
5358 reload_in_optab[i] = reload_out_optab[i] = CODE_FOR_nothing;
5361 /* Fill in the optabs with the insns we support. */
5364 /* Initialize the optabs with the names of the library functions. */
5365 init_integral_libfuncs (add_optab, "add", '3');
5366 init_floating_libfuncs (add_optab, "add", '3');
5367 init_integral_libfuncs (addv_optab, "addv", '3');
5368 init_floating_libfuncs (addv_optab, "add", '3');
5369 init_integral_libfuncs (sub_optab, "sub", '3');
5370 init_floating_libfuncs (sub_optab, "sub", '3');
5371 init_integral_libfuncs (subv_optab, "subv", '3');
5372 init_floating_libfuncs (subv_optab, "sub", '3');
5373 init_integral_libfuncs (smul_optab, "mul", '3');
5374 init_floating_libfuncs (smul_optab, "mul", '3');
5375 init_integral_libfuncs (smulv_optab, "mulv", '3');
5376 init_floating_libfuncs (smulv_optab, "mul", '3');
5377 init_integral_libfuncs (sdiv_optab, "div", '3');
5378 init_floating_libfuncs (sdiv_optab, "div", '3');
5379 init_integral_libfuncs (sdivv_optab, "divv", '3');
5380 init_integral_libfuncs (udiv_optab, "udiv", '3');
5381 init_integral_libfuncs (sdivmod_optab, "divmod", '4');
5382 init_integral_libfuncs (udivmod_optab, "udivmod", '4');
5383 init_integral_libfuncs (smod_optab, "mod", '3');
5384 init_integral_libfuncs (umod_optab, "umod", '3');
5385 init_floating_libfuncs (ftrunc_optab, "ftrunc", '2');
5386 init_integral_libfuncs (and_optab, "and", '3');
5387 init_integral_libfuncs (ior_optab, "ior", '3');
5388 init_integral_libfuncs (xor_optab, "xor", '3');
5389 init_integral_libfuncs (ashl_optab, "ashl", '3');
5390 init_integral_libfuncs (ashr_optab, "ashr", '3');
5391 init_integral_libfuncs (lshr_optab, "lshr", '3');
5392 init_integral_libfuncs (smin_optab, "min", '3');
5393 init_floating_libfuncs (smin_optab, "min", '3');
5394 init_integral_libfuncs (smax_optab, "max", '3');
5395 init_floating_libfuncs (smax_optab, "max", '3');
5396 init_integral_libfuncs (umin_optab, "umin", '3');
5397 init_integral_libfuncs (umax_optab, "umax", '3');
5398 init_integral_libfuncs (neg_optab, "neg", '2');
5399 init_floating_libfuncs (neg_optab, "neg", '2');
5400 init_integral_libfuncs (negv_optab, "negv", '2');
5401 init_floating_libfuncs (negv_optab, "neg", '2');
5402 init_integral_libfuncs (one_cmpl_optab, "one_cmpl", '2');
5403 init_integral_libfuncs (ffs_optab, "ffs", '2');
5404 init_integral_libfuncs (clz_optab, "clz", '2');
5405 init_integral_libfuncs (ctz_optab, "ctz", '2');
5406 init_integral_libfuncs (popcount_optab, "popcount", '2');
5407 init_integral_libfuncs (parity_optab, "parity", '2');
5409 /* Comparison libcalls for integers MUST come in pairs,
5411 init_integral_libfuncs (cmp_optab, "cmp", '2');
5412 init_integral_libfuncs (ucmp_optab, "ucmp", '2');
5413 init_floating_libfuncs (cmp_optab, "cmp", '2');
5415 /* EQ etc are floating point only. */
5416 init_floating_libfuncs (eq_optab, "eq", '2');
5417 init_floating_libfuncs (ne_optab, "ne", '2');
5418 init_floating_libfuncs (gt_optab, "gt", '2');
5419 init_floating_libfuncs (ge_optab, "ge", '2');
5420 init_floating_libfuncs (lt_optab, "lt", '2');
5421 init_floating_libfuncs (le_optab, "le", '2');
5422 init_floating_libfuncs (unord_optab, "unord", '2');
5424 init_floating_libfuncs (powi_optab, "powi", '2');
5427 init_interclass_conv_libfuncs (sfloat_optab, "float",
5428 MODE_INT, MODE_FLOAT);
5429 init_interclass_conv_libfuncs (sfloat_optab, "float",
5430 MODE_INT, MODE_DECIMAL_FLOAT);
5431 init_interclass_conv_libfuncs (ufloat_optab, "floatun",
5432 MODE_INT, MODE_FLOAT);
5433 init_interclass_conv_libfuncs (ufloat_optab, "floatun",
5434 MODE_INT, MODE_DECIMAL_FLOAT);
5435 init_interclass_conv_libfuncs (sfix_optab, "fix",
5436 MODE_FLOAT, MODE_INT);
5437 init_interclass_conv_libfuncs (sfix_optab, "fix",
5438 MODE_DECIMAL_FLOAT, MODE_INT);
5439 init_interclass_conv_libfuncs (ufix_optab, "fixuns",
5440 MODE_FLOAT, MODE_INT);
5441 init_interclass_conv_libfuncs (ufix_optab, "fixuns",
5442 MODE_DECIMAL_FLOAT, MODE_INT);
5443 init_interclass_conv_libfuncs (ufloat_optab, "floatuns",
5444 MODE_INT, MODE_DECIMAL_FLOAT);
5446 /* sext_optab is also used for FLOAT_EXTEND. */
5447 init_intraclass_conv_libfuncs (sext_optab, "extend", MODE_FLOAT, true);
5448 init_intraclass_conv_libfuncs (sext_optab, "extend", MODE_DECIMAL_FLOAT, true);
5449 init_interclass_conv_libfuncs (sext_optab, "extend", MODE_FLOAT, MODE_DECIMAL_FLOAT);
5450 init_interclass_conv_libfuncs (sext_optab, "extend", MODE_DECIMAL_FLOAT, MODE_FLOAT);
5451 init_intraclass_conv_libfuncs (trunc_optab, "trunc", MODE_FLOAT, false);
5452 init_intraclass_conv_libfuncs (trunc_optab, "trunc", MODE_DECIMAL_FLOAT, false);
5453 init_interclass_conv_libfuncs (trunc_optab, "trunc", MODE_FLOAT, MODE_DECIMAL_FLOAT);
5454 init_interclass_conv_libfuncs (trunc_optab, "trunc", MODE_DECIMAL_FLOAT, MODE_FLOAT);
5456 /* Use cabs for double complex abs, since systems generally have cabs.
5457 Don't define any libcall for float complex, so that cabs will be used. */
5458 if (complex_double_type_node)
5459 abs_optab->handlers[TYPE_MODE (complex_double_type_node)].libfunc
5460 = init_one_libfunc ("cabs");
5462 /* The ffs function operates on `int'. */
5463 ffs_optab->handlers[(int) mode_for_size (INT_TYPE_SIZE, MODE_INT, 0)].libfunc
5464 = init_one_libfunc ("ffs");
5466 abort_libfunc = init_one_libfunc ("abort");
5467 memcpy_libfunc = init_one_libfunc ("memcpy");
5468 memmove_libfunc = init_one_libfunc ("memmove");
5469 memcmp_libfunc = init_one_libfunc ("memcmp");
5470 memset_libfunc = init_one_libfunc ("memset");
5471 setbits_libfunc = init_one_libfunc ("__setbits");
5473 #ifndef DONT_USE_BUILTIN_SETJMP
5474 setjmp_libfunc = init_one_libfunc ("__builtin_setjmp");
5475 longjmp_libfunc = init_one_libfunc ("__builtin_longjmp");
5477 setjmp_libfunc = init_one_libfunc ("setjmp");
5478 longjmp_libfunc = init_one_libfunc ("longjmp");
5480 unwind_sjlj_register_libfunc = init_one_libfunc ("_Unwind_SjLj_Register");
5481 unwind_sjlj_unregister_libfunc
5482 = init_one_libfunc ("_Unwind_SjLj_Unregister");
5484 /* For function entry/exit instrumentation. */
5485 profile_function_entry_libfunc
5486 = init_one_libfunc ("__cyg_profile_func_enter");
5487 profile_function_exit_libfunc
5488 = init_one_libfunc ("__cyg_profile_func_exit");
5490 gcov_flush_libfunc = init_one_libfunc ("__gcov_flush");
5492 if (HAVE_conditional_trap)
5493 trap_rtx = gen_rtx_fmt_ee (EQ, VOIDmode, NULL_RTX, NULL_RTX);
5495 /* Allow the target to add more libcalls or rename some, etc. */
5496 targetm.init_libfuncs ();
5501 /* Print information about the current contents of the optabs on
5505 debug_optab_libfuncs (void)
5511 /* Dump the arithmetic optabs. */
5512 for (i = 0; i != (int) OTI_MAX; i++)
5513 for (j = 0; j < NUM_MACHINE_MODES; ++j)
5516 struct optab_handlers *h;
5519 h = &o->handlers[j];
5522 gcc_assert (GET_CODE (h->libfunc) = SYMBOL_REF);
5523 fprintf (stderr, "%s\t%s:\t%s\n",
5524 GET_RTX_NAME (o->code),
5526 XSTR (h->libfunc, 0));
5530 /* Dump the conversion optabs. */
5531 for (i = 0; i < (int) COI_MAX; ++i)
5532 for (j = 0; j < NUM_MACHINE_MODES; ++j)
5533 for (k = 0; k < NUM_MACHINE_MODES; ++k)
5536 struct optab_handlers *h;
5538 o = &convert_optab_table[i];
5539 h = &o->handlers[j][k];
5542 gcc_assert (GET_CODE (h->libfunc) = SYMBOL_REF);
5543 fprintf (stderr, "%s\t%s\t%s:\t%s\n",
5544 GET_RTX_NAME (o->code),
5547 XSTR (h->libfunc, 0));
5555 /* Generate insns to trap with code TCODE if OP1 and OP2 satisfy condition
5556 CODE. Return 0 on failure. */
5559 gen_cond_trap (enum rtx_code code ATTRIBUTE_UNUSED, rtx op1,
5560 rtx op2 ATTRIBUTE_UNUSED, rtx tcode ATTRIBUTE_UNUSED)
5562 enum machine_mode mode = GET_MODE (op1);
5563 enum insn_code icode;
5566 if (!HAVE_conditional_trap)
5569 if (mode == VOIDmode)
5572 icode = cmp_optab->handlers[(int) mode].insn_code;
5573 if (icode == CODE_FOR_nothing)
5577 op1 = prepare_operand (icode, op1, 0, mode, mode, 0);
5578 op2 = prepare_operand (icode, op2, 1, mode, mode, 0);
5584 emit_insn (GEN_FCN (icode) (op1, op2));
5586 PUT_CODE (trap_rtx, code);
5587 gcc_assert (HAVE_conditional_trap);
5588 insn = gen_conditional_trap (trap_rtx, tcode);
5592 insn = get_insns ();
5599 /* Return rtx code for TCODE. Use UNSIGNEDP to select signed
5600 or unsigned operation code. */
5602 static enum rtx_code
5603 get_rtx_code (enum tree_code tcode, bool unsignedp)
5615 code = unsignedp ? LTU : LT;
5618 code = unsignedp ? LEU : LE;
5621 code = unsignedp ? GTU : GT;
5624 code = unsignedp ? GEU : GE;
5627 case UNORDERED_EXPR:
5658 /* Return comparison rtx for COND. Use UNSIGNEDP to select signed or
5659 unsigned operators. Do not generate compare instruction. */
5662 vector_compare_rtx (tree cond, bool unsignedp, enum insn_code icode)
5664 enum rtx_code rcode;
5666 rtx rtx_op0, rtx_op1;
5668 /* This is unlikely. While generating VEC_COND_EXPR, auto vectorizer
5669 ensures that condition is a relational operation. */
5670 gcc_assert (COMPARISON_CLASS_P (cond));
5672 rcode = get_rtx_code (TREE_CODE (cond), unsignedp);
5673 t_op0 = TREE_OPERAND (cond, 0);
5674 t_op1 = TREE_OPERAND (cond, 1);
5676 /* Expand operands. */
5677 rtx_op0 = expand_expr (t_op0, NULL_RTX, TYPE_MODE (TREE_TYPE (t_op0)), 1);
5678 rtx_op1 = expand_expr (t_op1, NULL_RTX, TYPE_MODE (TREE_TYPE (t_op1)), 1);
5680 if (!insn_data[icode].operand[4].predicate (rtx_op0, GET_MODE (rtx_op0))
5681 && GET_MODE (rtx_op0) != VOIDmode)
5682 rtx_op0 = force_reg (GET_MODE (rtx_op0), rtx_op0);
5684 if (!insn_data[icode].operand[5].predicate (rtx_op1, GET_MODE (rtx_op1))
5685 && GET_MODE (rtx_op1) != VOIDmode)
5686 rtx_op1 = force_reg (GET_MODE (rtx_op1), rtx_op1);
5688 return gen_rtx_fmt_ee (rcode, VOIDmode, rtx_op0, rtx_op1);
5691 /* Return insn code for VEC_COND_EXPR EXPR. */
5693 static inline enum insn_code
5694 get_vcond_icode (tree expr, enum machine_mode mode)
5696 enum insn_code icode = CODE_FOR_nothing;
5698 if (TYPE_UNSIGNED (TREE_TYPE (expr)))
5699 icode = vcondu_gen_code[mode];
5701 icode = vcond_gen_code[mode];
5705 /* Return TRUE iff, appropriate vector insns are available
5706 for vector cond expr expr in VMODE mode. */
5709 expand_vec_cond_expr_p (tree expr, enum machine_mode vmode)
5711 if (get_vcond_icode (expr, vmode) == CODE_FOR_nothing)
5716 /* Generate insns for VEC_COND_EXPR. */
5719 expand_vec_cond_expr (tree vec_cond_expr, rtx target)
5721 enum insn_code icode;
5722 rtx comparison, rtx_op1, rtx_op2, cc_op0, cc_op1;
5723 enum machine_mode mode = TYPE_MODE (TREE_TYPE (vec_cond_expr));
5724 bool unsignedp = TYPE_UNSIGNED (TREE_TYPE (vec_cond_expr));
5726 icode = get_vcond_icode (vec_cond_expr, mode);
5727 if (icode == CODE_FOR_nothing)
5730 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
5731 target = gen_reg_rtx (mode);
5733 /* Get comparison rtx. First expand both cond expr operands. */
5734 comparison = vector_compare_rtx (TREE_OPERAND (vec_cond_expr, 0),
5736 cc_op0 = XEXP (comparison, 0);
5737 cc_op1 = XEXP (comparison, 1);
5738 /* Expand both operands and force them in reg, if required. */
5739 rtx_op1 = expand_expr (TREE_OPERAND (vec_cond_expr, 1),
5740 NULL_RTX, VOIDmode, EXPAND_NORMAL);
5741 if (!insn_data[icode].operand[1].predicate (rtx_op1, mode)
5742 && mode != VOIDmode)
5743 rtx_op1 = force_reg (mode, rtx_op1);
5745 rtx_op2 = expand_expr (TREE_OPERAND (vec_cond_expr, 2),
5746 NULL_RTX, VOIDmode, EXPAND_NORMAL);
5747 if (!insn_data[icode].operand[2].predicate (rtx_op2, mode)
5748 && mode != VOIDmode)
5749 rtx_op2 = force_reg (mode, rtx_op2);
5751 /* Emit instruction! */
5752 emit_insn (GEN_FCN (icode) (target, rtx_op1, rtx_op2,
5753 comparison, cc_op0, cc_op1));
5759 /* This is an internal subroutine of the other compare_and_swap expanders.
5760 MEM, OLD_VAL and NEW_VAL are as you'd expect for a compare-and-swap
5761 operation. TARGET is an optional place to store the value result of
5762 the operation. ICODE is the particular instruction to expand. Return
5763 the result of the operation. */
5766 expand_val_compare_and_swap_1 (rtx mem, rtx old_val, rtx new_val,
5767 rtx target, enum insn_code icode)
5769 enum machine_mode mode = GET_MODE (mem);
5772 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
5773 target = gen_reg_rtx (mode);
5775 if (GET_MODE (old_val) != VOIDmode && GET_MODE (old_val) != mode)
5776 old_val = convert_modes (mode, GET_MODE (old_val), old_val, 1);
5777 if (!insn_data[icode].operand[2].predicate (old_val, mode))
5778 old_val = force_reg (mode, old_val);
5780 if (GET_MODE (new_val) != VOIDmode && GET_MODE (new_val) != mode)
5781 new_val = convert_modes (mode, GET_MODE (new_val), new_val, 1);
5782 if (!insn_data[icode].operand[3].predicate (new_val, mode))
5783 new_val = force_reg (mode, new_val);
5785 insn = GEN_FCN (icode) (target, mem, old_val, new_val);
5786 if (insn == NULL_RTX)
5793 /* Expand a compare-and-swap operation and return its value. */
5796 expand_val_compare_and_swap (rtx mem, rtx old_val, rtx new_val, rtx target)
5798 enum machine_mode mode = GET_MODE (mem);
5799 enum insn_code icode = sync_compare_and_swap[mode];
5801 if (icode == CODE_FOR_nothing)
5804 return expand_val_compare_and_swap_1 (mem, old_val, new_val, target, icode);
5807 /* Expand a compare-and-swap operation and store true into the result if
5808 the operation was successful and false otherwise. Return the result.
5809 Unlike other routines, TARGET is not optional. */
5812 expand_bool_compare_and_swap (rtx mem, rtx old_val, rtx new_val, rtx target)
5814 enum machine_mode mode = GET_MODE (mem);
5815 enum insn_code icode;
5816 rtx subtarget, label0, label1;
5818 /* If the target supports a compare-and-swap pattern that simultaneously
5819 sets some flag for success, then use it. Otherwise use the regular
5820 compare-and-swap and follow that immediately with a compare insn. */
5821 icode = sync_compare_and_swap_cc[mode];
5825 subtarget = expand_val_compare_and_swap_1 (mem, old_val, new_val,
5827 if (subtarget != NULL_RTX)
5831 case CODE_FOR_nothing:
5832 icode = sync_compare_and_swap[mode];
5833 if (icode == CODE_FOR_nothing)
5836 /* Ensure that if old_val == mem, that we're not comparing
5837 against an old value. */
5838 if (MEM_P (old_val))
5839 old_val = force_reg (mode, old_val);
5841 subtarget = expand_val_compare_and_swap_1 (mem, old_val, new_val,
5843 if (subtarget == NULL_RTX)
5846 emit_cmp_insn (subtarget, old_val, EQ, const0_rtx, mode, true);
5849 /* If the target has a sane STORE_FLAG_VALUE, then go ahead and use a
5850 setcc instruction from the beginning. We don't work too hard here,
5851 but it's nice to not be stupid about initial code gen either. */
5852 if (STORE_FLAG_VALUE == 1)
5854 icode = setcc_gen_code[EQ];
5855 if (icode != CODE_FOR_nothing)
5857 enum machine_mode cmode = insn_data[icode].operand[0].mode;
5861 if (!insn_data[icode].operand[0].predicate (target, cmode))
5862 subtarget = gen_reg_rtx (cmode);
5864 insn = GEN_FCN (icode) (subtarget);
5868 if (GET_MODE (target) != GET_MODE (subtarget))
5870 convert_move (target, subtarget, 1);
5878 /* Without an appropriate setcc instruction, use a set of branches to
5879 get 1 and 0 stored into target. Presumably if the target has a
5880 STORE_FLAG_VALUE that isn't 1, then this will get cleaned up by ifcvt. */
5882 label0 = gen_label_rtx ();
5883 label1 = gen_label_rtx ();
5885 emit_jump_insn (bcc_gen_fctn[EQ] (label0));
5886 emit_move_insn (target, const0_rtx);
5887 emit_jump_insn (gen_jump (label1));
5889 emit_label (label0);
5890 emit_move_insn (target, const1_rtx);
5891 emit_label (label1);
5896 /* This is a helper function for the other atomic operations. This function
5897 emits a loop that contains SEQ that iterates until a compare-and-swap
5898 operation at the end succeeds. MEM is the memory to be modified. SEQ is
5899 a set of instructions that takes a value from OLD_REG as an input and
5900 produces a value in NEW_REG as an output. Before SEQ, OLD_REG will be
5901 set to the current contents of MEM. After SEQ, a compare-and-swap will
5902 attempt to update MEM with NEW_REG. The function returns true when the
5903 loop was generated successfully. */
5906 expand_compare_and_swap_loop (rtx mem, rtx old_reg, rtx new_reg, rtx seq)
5908 enum machine_mode mode = GET_MODE (mem);
5909 enum insn_code icode;
5910 rtx label, cmp_reg, subtarget;
5912 /* The loop we want to generate looks like
5918 cmp_reg = compare-and-swap(mem, old_reg, new_reg)
5919 if (cmp_reg != old_reg)
5922 Note that we only do the plain load from memory once. Subsequent
5923 iterations use the value loaded by the compare-and-swap pattern. */
5925 label = gen_label_rtx ();
5926 cmp_reg = gen_reg_rtx (mode);
5928 emit_move_insn (cmp_reg, mem);
5930 emit_move_insn (old_reg, cmp_reg);
5934 /* If the target supports a compare-and-swap pattern that simultaneously
5935 sets some flag for success, then use it. Otherwise use the regular
5936 compare-and-swap and follow that immediately with a compare insn. */
5937 icode = sync_compare_and_swap_cc[mode];
5941 subtarget = expand_val_compare_and_swap_1 (mem, old_reg, new_reg,
5943 if (subtarget != NULL_RTX)
5945 gcc_assert (subtarget == cmp_reg);
5950 case CODE_FOR_nothing:
5951 icode = sync_compare_and_swap[mode];
5952 if (icode == CODE_FOR_nothing)
5955 subtarget = expand_val_compare_and_swap_1 (mem, old_reg, new_reg,
5957 if (subtarget == NULL_RTX)
5959 if (subtarget != cmp_reg)
5960 emit_move_insn (cmp_reg, subtarget);
5962 emit_cmp_insn (cmp_reg, old_reg, EQ, const0_rtx, mode, true);
5965 /* ??? Mark this jump predicted not taken? */
5966 emit_jump_insn (bcc_gen_fctn[NE] (label));
5971 /* This function generates the atomic operation MEM CODE= VAL. In this
5972 case, we do not care about any resulting value. Returns NULL if we
5973 cannot generate the operation. */
5976 expand_sync_operation (rtx mem, rtx val, enum rtx_code code)
5978 enum machine_mode mode = GET_MODE (mem);
5979 enum insn_code icode;
5982 /* Look to see if the target supports the operation directly. */
5986 icode = sync_add_optab[mode];
5989 icode = sync_ior_optab[mode];
5992 icode = sync_xor_optab[mode];
5995 icode = sync_and_optab[mode];
5998 icode = sync_nand_optab[mode];
6002 icode = sync_sub_optab[mode];
6003 if (icode == CODE_FOR_nothing)
6005 icode = sync_add_optab[mode];
6006 if (icode != CODE_FOR_nothing)
6008 val = expand_simple_unop (mode, NEG, val, NULL_RTX, 1);
6018 /* Generate the direct operation, if present. */
6019 if (icode != CODE_FOR_nothing)
6021 if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)
6022 val = convert_modes (mode, GET_MODE (val), val, 1);
6023 if (!insn_data[icode].operand[1].predicate (val, mode))
6024 val = force_reg (mode, val);
6026 insn = GEN_FCN (icode) (mem, val);
6034 /* Failing that, generate a compare-and-swap loop in which we perform the
6035 operation with normal arithmetic instructions. */
6036 if (sync_compare_and_swap[mode] != CODE_FOR_nothing)
6038 rtx t0 = gen_reg_rtx (mode), t1;
6045 t1 = expand_simple_unop (mode, NOT, t1, NULL_RTX, true);
6048 t1 = expand_simple_binop (mode, code, t1, val, NULL_RTX,
6049 true, OPTAB_LIB_WIDEN);
6051 insn = get_insns ();
6054 if (t1 != NULL && expand_compare_and_swap_loop (mem, t0, t1, insn))
6061 /* This function generates the atomic operation MEM CODE= VAL. In this
6062 case, we do care about the resulting value: if AFTER is true then
6063 return the value MEM holds after the operation, if AFTER is false
6064 then return the value MEM holds before the operation. TARGET is an
6065 optional place for the result value to be stored. */
6068 expand_sync_fetch_operation (rtx mem, rtx val, enum rtx_code code,
6069 bool after, rtx target)
6071 enum machine_mode mode = GET_MODE (mem);
6072 enum insn_code old_code, new_code, icode;
6076 /* Look to see if the target supports the operation directly. */
6080 old_code = sync_old_add_optab[mode];
6081 new_code = sync_new_add_optab[mode];
6084 old_code = sync_old_ior_optab[mode];
6085 new_code = sync_new_ior_optab[mode];
6088 old_code = sync_old_xor_optab[mode];
6089 new_code = sync_new_xor_optab[mode];
6092 old_code = sync_old_and_optab[mode];
6093 new_code = sync_new_and_optab[mode];
6096 old_code = sync_old_nand_optab[mode];
6097 new_code = sync_new_nand_optab[mode];
6101 old_code = sync_old_sub_optab[mode];
6102 new_code = sync_new_sub_optab[mode];
6103 if (old_code == CODE_FOR_nothing && new_code == CODE_FOR_nothing)
6105 old_code = sync_old_add_optab[mode];
6106 new_code = sync_new_add_optab[mode];
6107 if (old_code != CODE_FOR_nothing || new_code != CODE_FOR_nothing)
6109 val = expand_simple_unop (mode, NEG, val, NULL_RTX, 1);
6119 /* If the target does supports the proper new/old operation, great. But
6120 if we only support the opposite old/new operation, check to see if we
6121 can compensate. In the case in which the old value is supported, then
6122 we can always perform the operation again with normal arithmetic. In
6123 the case in which the new value is supported, then we can only handle
6124 this in the case the operation is reversible. */
6129 if (icode == CODE_FOR_nothing)
6132 if (icode != CODE_FOR_nothing)
6139 if (icode == CODE_FOR_nothing
6140 && (code == PLUS || code == MINUS || code == XOR))
6143 if (icode != CODE_FOR_nothing)
6148 /* If we found something supported, great. */
6149 if (icode != CODE_FOR_nothing)
6151 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
6152 target = gen_reg_rtx (mode);
6154 if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)
6155 val = convert_modes (mode, GET_MODE (val), val, 1);
6156 if (!insn_data[icode].operand[2].predicate (val, mode))
6157 val = force_reg (mode, val);
6159 insn = GEN_FCN (icode) (target, mem, val);
6164 /* If we need to compensate for using an operation with the
6165 wrong return value, do so now. */
6172 else if (code == MINUS)
6177 target = expand_simple_unop (mode, NOT, target, NULL_RTX, true);
6178 target = expand_simple_binop (mode, code, target, val, NULL_RTX,
6179 true, OPTAB_LIB_WIDEN);
6186 /* Failing that, generate a compare-and-swap loop in which we perform the
6187 operation with normal arithmetic instructions. */
6188 if (sync_compare_and_swap[mode] != CODE_FOR_nothing)
6190 rtx t0 = gen_reg_rtx (mode), t1;
6192 if (!target || !register_operand (target, mode))
6193 target = gen_reg_rtx (mode);
6198 emit_move_insn (target, t0);
6202 t1 = expand_simple_unop (mode, NOT, t1, NULL_RTX, true);
6205 t1 = expand_simple_binop (mode, code, t1, val, NULL_RTX,
6206 true, OPTAB_LIB_WIDEN);
6208 emit_move_insn (target, t1);
6210 insn = get_insns ();
6213 if (t1 != NULL && expand_compare_and_swap_loop (mem, t0, t1, insn))
6220 /* This function expands a test-and-set operation. Ideally we atomically
6221 store VAL in MEM and return the previous value in MEM. Some targets
6222 may not support this operation and only support VAL with the constant 1;
6223 in this case while the return value will be 0/1, but the exact value
6224 stored in MEM is target defined. TARGET is an option place to stick
6225 the return value. */
6228 expand_sync_lock_test_and_set (rtx mem, rtx val, rtx target)
6230 enum machine_mode mode = GET_MODE (mem);
6231 enum insn_code icode;
6234 /* If the target supports the test-and-set directly, great. */
6235 icode = sync_lock_test_and_set[mode];
6236 if (icode != CODE_FOR_nothing)
6238 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
6239 target = gen_reg_rtx (mode);
6241 if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)
6242 val = convert_modes (mode, GET_MODE (val), val, 1);
6243 if (!insn_data[icode].operand[2].predicate (val, mode))
6244 val = force_reg (mode, val);
6246 insn = GEN_FCN (icode) (target, mem, val);
6254 /* Otherwise, use a compare-and-swap loop for the exchange. */
6255 if (sync_compare_and_swap[mode] != CODE_FOR_nothing)
6257 if (!target || !register_operand (target, mode))
6258 target = gen_reg_rtx (mode);
6259 if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)
6260 val = convert_modes (mode, GET_MODE (val), val, 1);
6261 if (expand_compare_and_swap_loop (mem, target, val, NULL_RTX))
6268 #include "gt-optabs.h"