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 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, 59 Temple Place - Suite 330, 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[CTI_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;
301 trapv = flag_trapv && INTEGRAL_TYPE_P (type) && !TYPE_UNSIGNED (type);
305 return trapv ? addv_optab : add_optab;
308 return trapv ? subv_optab : sub_optab;
311 return trapv ? smulv_optab : smul_optab;
314 return trapv ? negv_optab : neg_optab;
317 return trapv ? absv_optab : abs_optab;
325 /* Generate code to perform an operation specified by TERNARY_OPTAB
326 on operands OP0, OP1 and OP2, with result having machine-mode MODE.
328 UNSIGNEDP is for the case where we have to widen the operands
329 to perform the operation. It says to use zero-extension.
331 If TARGET is nonzero, the value
332 is generated there, if it is convenient to do so.
333 In all cases an rtx is returned for the locus of the value;
334 this may or may not be TARGET. */
337 expand_ternary_op (enum machine_mode mode, optab ternary_optab, rtx op0,
338 rtx op1, rtx op2, rtx target, int unsignedp)
340 int icode = (int) ternary_optab->handlers[(int) mode].insn_code;
341 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
342 enum machine_mode mode1 = insn_data[icode].operand[2].mode;
343 enum machine_mode mode2 = insn_data[icode].operand[3].mode;
346 rtx xop0 = op0, xop1 = op1, xop2 = op2;
348 gcc_assert (ternary_optab->handlers[(int) mode].insn_code
349 != CODE_FOR_nothing);
351 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
352 temp = gen_reg_rtx (mode);
356 /* In case the insn wants input operands in modes different from
357 those of the actual operands, convert the operands. It would
358 seem that we don't need to convert CONST_INTs, but we do, so
359 that they're properly zero-extended, sign-extended or truncated
362 if (GET_MODE (op0) != mode0 && mode0 != VOIDmode)
363 xop0 = convert_modes (mode0,
364 GET_MODE (op0) != VOIDmode
369 if (GET_MODE (op1) != mode1 && mode1 != VOIDmode)
370 xop1 = convert_modes (mode1,
371 GET_MODE (op1) != VOIDmode
376 if (GET_MODE (op2) != mode2 && mode2 != VOIDmode)
377 xop2 = convert_modes (mode2,
378 GET_MODE (op2) != VOIDmode
383 /* Now, if insn's predicates don't allow our operands, put them into
386 if (!insn_data[icode].operand[1].predicate (xop0, mode0)
387 && mode0 != VOIDmode)
388 xop0 = copy_to_mode_reg (mode0, xop0);
390 if (!insn_data[icode].operand[2].predicate (xop1, mode1)
391 && mode1 != VOIDmode)
392 xop1 = copy_to_mode_reg (mode1, xop1);
394 if (!insn_data[icode].operand[3].predicate (xop2, mode2)
395 && mode2 != VOIDmode)
396 xop2 = copy_to_mode_reg (mode2, xop2);
398 pat = GEN_FCN (icode) (temp, xop0, xop1, xop2);
405 /* Like expand_binop, but return a constant rtx if the result can be
406 calculated at compile time. The arguments and return value are
407 otherwise the same as for expand_binop. */
410 simplify_expand_binop (enum machine_mode mode, optab binoptab,
411 rtx op0, rtx op1, rtx target, int unsignedp,
412 enum optab_methods methods)
414 if (CONSTANT_P (op0) && CONSTANT_P (op1))
415 return simplify_gen_binary (binoptab->code, mode, op0, op1);
417 return expand_binop (mode, binoptab, op0, op1, target, unsignedp, methods);
420 /* Like simplify_expand_binop, but always put the result in TARGET.
421 Return true if the expansion succeeded. */
424 force_expand_binop (enum machine_mode mode, optab binoptab,
425 rtx op0, rtx op1, rtx target, int unsignedp,
426 enum optab_methods methods)
428 rtx x = simplify_expand_binop (mode, binoptab, op0, op1,
429 target, unsignedp, methods);
433 emit_move_insn (target, x);
437 /* This subroutine of expand_doubleword_shift handles the cases in which
438 the effective shift value is >= BITS_PER_WORD. The arguments and return
439 value are the same as for the parent routine, except that SUPERWORD_OP1
440 is the shift count to use when shifting OUTOF_INPUT into INTO_TARGET.
441 INTO_TARGET may be null if the caller has decided to calculate it. */
444 expand_superword_shift (optab binoptab, rtx outof_input, rtx superword_op1,
445 rtx outof_target, rtx into_target,
446 int unsignedp, enum optab_methods methods)
448 if (into_target != 0)
449 if (!force_expand_binop (word_mode, binoptab, outof_input, superword_op1,
450 into_target, unsignedp, methods))
453 if (outof_target != 0)
455 /* For a signed right shift, we must fill OUTOF_TARGET with copies
456 of the sign bit, otherwise we must fill it with zeros. */
457 if (binoptab != ashr_optab)
458 emit_move_insn (outof_target, CONST0_RTX (word_mode));
460 if (!force_expand_binop (word_mode, binoptab,
461 outof_input, GEN_INT (BITS_PER_WORD - 1),
462 outof_target, unsignedp, methods))
468 /* This subroutine of expand_doubleword_shift handles the cases in which
469 the effective shift value is < BITS_PER_WORD. The arguments and return
470 value are the same as for the parent routine. */
473 expand_subword_shift (enum machine_mode op1_mode, optab binoptab,
474 rtx outof_input, rtx into_input, rtx op1,
475 rtx outof_target, rtx into_target,
476 int unsignedp, enum optab_methods methods,
477 unsigned HOST_WIDE_INT shift_mask)
479 optab reverse_unsigned_shift, unsigned_shift;
482 reverse_unsigned_shift = (binoptab == ashl_optab ? lshr_optab : ashl_optab);
483 unsigned_shift = (binoptab == ashl_optab ? ashl_optab : lshr_optab);
485 /* The low OP1 bits of INTO_TARGET come from the high bits of OUTOF_INPUT.
486 We therefore need to shift OUTOF_INPUT by (BITS_PER_WORD - OP1) bits in
487 the opposite direction to BINOPTAB. */
488 if (CONSTANT_P (op1) || shift_mask >= BITS_PER_WORD)
490 carries = outof_input;
491 tmp = immed_double_const (BITS_PER_WORD, 0, op1_mode);
492 tmp = simplify_expand_binop (op1_mode, sub_optab, tmp, op1,
497 /* We must avoid shifting by BITS_PER_WORD bits since that is either
498 the same as a zero shift (if shift_mask == BITS_PER_WORD - 1) or
499 has unknown behavior. Do a single shift first, then shift by the
500 remainder. It's OK to use ~OP1 as the remainder if shift counts
501 are truncated to the mode size. */
502 carries = expand_binop (word_mode, reverse_unsigned_shift,
503 outof_input, const1_rtx, 0, unsignedp, methods);
504 if (shift_mask == BITS_PER_WORD - 1)
506 tmp = immed_double_const (-1, -1, op1_mode);
507 tmp = simplify_expand_binop (op1_mode, xor_optab, op1, tmp,
512 tmp = immed_double_const (BITS_PER_WORD - 1, 0, op1_mode);
513 tmp = simplify_expand_binop (op1_mode, sub_optab, tmp, op1,
517 if (tmp == 0 || carries == 0)
519 carries = expand_binop (word_mode, reverse_unsigned_shift,
520 carries, tmp, 0, unsignedp, methods);
524 /* Shift INTO_INPUT logically by OP1. This is the last use of INTO_INPUT
525 so the result can go directly into INTO_TARGET if convenient. */
526 tmp = expand_binop (word_mode, unsigned_shift, into_input, op1,
527 into_target, unsignedp, methods);
531 /* Now OR in the bits carried over from OUTOF_INPUT. */
532 if (!force_expand_binop (word_mode, ior_optab, tmp, carries,
533 into_target, unsignedp, methods))
536 /* Use a standard word_mode shift for the out-of half. */
537 if (outof_target != 0)
538 if (!force_expand_binop (word_mode, binoptab, outof_input, op1,
539 outof_target, unsignedp, methods))
546 #ifdef HAVE_conditional_move
547 /* Try implementing expand_doubleword_shift using conditional moves.
548 The shift is by < BITS_PER_WORD if (CMP_CODE CMP1 CMP2) is true,
549 otherwise it is by >= BITS_PER_WORD. SUBWORD_OP1 and SUPERWORD_OP1
550 are the shift counts to use in the former and latter case. All other
551 arguments are the same as the parent routine. */
554 expand_doubleword_shift_condmove (enum machine_mode op1_mode, optab binoptab,
555 enum rtx_code cmp_code, rtx cmp1, rtx cmp2,
556 rtx outof_input, rtx into_input,
557 rtx subword_op1, rtx superword_op1,
558 rtx outof_target, rtx into_target,
559 int unsignedp, enum optab_methods methods,
560 unsigned HOST_WIDE_INT shift_mask)
562 rtx outof_superword, into_superword;
564 /* Put the superword version of the output into OUTOF_SUPERWORD and
566 outof_superword = outof_target != 0 ? gen_reg_rtx (word_mode) : 0;
567 if (outof_target != 0 && subword_op1 == superword_op1)
569 /* The value INTO_TARGET >> SUBWORD_OP1, which we later store in
570 OUTOF_TARGET, is the same as the value of INTO_SUPERWORD. */
571 into_superword = outof_target;
572 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
573 outof_superword, 0, unsignedp, methods))
578 into_superword = gen_reg_rtx (word_mode);
579 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
580 outof_superword, into_superword,
585 /* Put the subword version directly in OUTOF_TARGET and INTO_TARGET. */
586 if (!expand_subword_shift (op1_mode, binoptab,
587 outof_input, into_input, subword_op1,
588 outof_target, into_target,
589 unsignedp, methods, shift_mask))
592 /* Select between them. Do the INTO half first because INTO_SUPERWORD
593 might be the current value of OUTOF_TARGET. */
594 if (!emit_conditional_move (into_target, cmp_code, cmp1, cmp2, op1_mode,
595 into_target, into_superword, word_mode, false))
598 if (outof_target != 0)
599 if (!emit_conditional_move (outof_target, cmp_code, cmp1, cmp2, op1_mode,
600 outof_target, outof_superword,
608 /* Expand a doubleword shift (ashl, ashr or lshr) using word-mode shifts.
609 OUTOF_INPUT and INTO_INPUT are the two word-sized halves of the first
610 input operand; the shift moves bits in the direction OUTOF_INPUT->
611 INTO_TARGET. OUTOF_TARGET and INTO_TARGET are the equivalent words
612 of the target. OP1 is the shift count and OP1_MODE is its mode.
613 If OP1 is constant, it will have been truncated as appropriate
614 and is known to be nonzero.
616 If SHIFT_MASK is zero, the result of word shifts is undefined when the
617 shift count is outside the range [0, BITS_PER_WORD). This routine must
618 avoid generating such shifts for OP1s in the range [0, BITS_PER_WORD * 2).
620 If SHIFT_MASK is nonzero, all word-mode shift counts are effectively
621 masked by it and shifts in the range [BITS_PER_WORD, SHIFT_MASK) will
622 fill with zeros or sign bits as appropriate.
624 If SHIFT_MASK is BITS_PER_WORD - 1, this routine will synthesize
625 a doubleword shift whose equivalent mask is BITS_PER_WORD * 2 - 1.
626 Doing this preserves semantics required by SHIFT_COUNT_TRUNCATED.
627 In all other cases, shifts by values outside [0, BITS_PER_UNIT * 2)
630 BINOPTAB, UNSIGNEDP and METHODS are as for expand_binop. This function
631 may not use INTO_INPUT after modifying INTO_TARGET, and similarly for
632 OUTOF_INPUT and OUTOF_TARGET. OUTOF_TARGET can be null if the parent
633 function wants to calculate it itself.
635 Return true if the shift could be successfully synthesized. */
638 expand_doubleword_shift (enum machine_mode op1_mode, optab binoptab,
639 rtx outof_input, rtx into_input, rtx op1,
640 rtx outof_target, rtx into_target,
641 int unsignedp, enum optab_methods methods,
642 unsigned HOST_WIDE_INT shift_mask)
644 rtx superword_op1, tmp, cmp1, cmp2;
645 rtx subword_label, done_label;
646 enum rtx_code cmp_code;
648 /* See if word-mode shifts by BITS_PER_WORD...BITS_PER_WORD * 2 - 1 will
649 fill the result with sign or zero bits as appropriate. If so, the value
650 of OUTOF_TARGET will always be (SHIFT OUTOF_INPUT OP1). Recursively call
651 this routine to calculate INTO_TARGET (which depends on both OUTOF_INPUT
652 and INTO_INPUT), then emit code to set up OUTOF_TARGET.
654 This isn't worthwhile for constant shifts since the optimizers will
655 cope better with in-range shift counts. */
656 if (shift_mask >= BITS_PER_WORD
658 && !CONSTANT_P (op1))
660 if (!expand_doubleword_shift (op1_mode, binoptab,
661 outof_input, into_input, op1,
663 unsignedp, methods, shift_mask))
665 if (!force_expand_binop (word_mode, binoptab, outof_input, op1,
666 outof_target, unsignedp, methods))
671 /* Set CMP_CODE, CMP1 and CMP2 so that the rtx (CMP_CODE CMP1 CMP2)
672 is true when the effective shift value is less than BITS_PER_WORD.
673 Set SUPERWORD_OP1 to the shift count that should be used to shift
674 OUTOF_INPUT into INTO_TARGET when the condition is false. */
675 tmp = immed_double_const (BITS_PER_WORD, 0, op1_mode);
676 if (!CONSTANT_P (op1) && shift_mask == BITS_PER_WORD - 1)
678 /* Set CMP1 to OP1 & BITS_PER_WORD. The result is zero iff OP1
679 is a subword shift count. */
680 cmp1 = simplify_expand_binop (op1_mode, and_optab, op1, tmp,
682 cmp2 = CONST0_RTX (op1_mode);
688 /* Set CMP1 to OP1 - BITS_PER_WORD. */
689 cmp1 = simplify_expand_binop (op1_mode, sub_optab, op1, tmp,
691 cmp2 = CONST0_RTX (op1_mode);
693 superword_op1 = cmp1;
698 /* If we can compute the condition at compile time, pick the
699 appropriate subroutine. */
700 tmp = simplify_relational_operation (cmp_code, SImode, op1_mode, cmp1, cmp2);
701 if (tmp != 0 && GET_CODE (tmp) == CONST_INT)
703 if (tmp == const0_rtx)
704 return expand_superword_shift (binoptab, outof_input, superword_op1,
705 outof_target, into_target,
708 return expand_subword_shift (op1_mode, binoptab,
709 outof_input, into_input, op1,
710 outof_target, into_target,
711 unsignedp, methods, shift_mask);
714 #ifdef HAVE_conditional_move
715 /* Try using conditional moves to generate straight-line code. */
717 rtx start = get_last_insn ();
718 if (expand_doubleword_shift_condmove (op1_mode, binoptab,
719 cmp_code, cmp1, cmp2,
720 outof_input, into_input,
722 outof_target, into_target,
723 unsignedp, methods, shift_mask))
725 delete_insns_since (start);
729 /* As a last resort, use branches to select the correct alternative. */
730 subword_label = gen_label_rtx ();
731 done_label = gen_label_rtx ();
733 do_compare_rtx_and_jump (cmp1, cmp2, cmp_code, false, op1_mode,
734 0, 0, subword_label);
736 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
737 outof_target, into_target,
741 emit_jump_insn (gen_jump (done_label));
743 emit_label (subword_label);
745 if (!expand_subword_shift (op1_mode, binoptab,
746 outof_input, into_input, op1,
747 outof_target, into_target,
748 unsignedp, methods, shift_mask))
751 emit_label (done_label);
755 /* Subroutine of expand_binop. Perform a double word multiplication of
756 operands OP0 and OP1 both of mode MODE, which is exactly twice as wide
757 as the target's word_mode. This function return NULL_RTX if anything
758 goes wrong, in which case it may have already emitted instructions
759 which need to be deleted.
761 If we want to multiply two two-word values and have normal and widening
762 multiplies of single-word values, we can do this with three smaller
763 multiplications. Note that we do not make a REG_NO_CONFLICT block here
764 because we are not operating on one word at a time.
766 The multiplication proceeds as follows:
767 _______________________
768 [__op0_high_|__op0_low__]
769 _______________________
770 * [__op1_high_|__op1_low__]
771 _______________________________________________
772 _______________________
773 (1) [__op0_low__*__op1_low__]
774 _______________________
775 (2a) [__op0_low__*__op1_high_]
776 _______________________
777 (2b) [__op0_high_*__op1_low__]
778 _______________________
779 (3) [__op0_high_*__op1_high_]
782 This gives a 4-word result. Since we are only interested in the
783 lower 2 words, partial result (3) and the upper words of (2a) and
784 (2b) don't need to be calculated. Hence (2a) and (2b) can be
785 calculated using non-widening multiplication.
787 (1), however, needs to be calculated with an unsigned widening
788 multiplication. If this operation is not directly supported we
789 try using a signed widening multiplication and adjust the result.
790 This adjustment works as follows:
792 If both operands are positive then no adjustment is needed.
794 If the operands have different signs, for example op0_low < 0 and
795 op1_low >= 0, the instruction treats the most significant bit of
796 op0_low as a sign bit instead of a bit with significance
797 2**(BITS_PER_WORD-1), i.e. the instruction multiplies op1_low
798 with 2**BITS_PER_WORD - op0_low, and two's complements the
799 result. Conclusion: We need to add op1_low * 2**BITS_PER_WORD to
802 Similarly, if both operands are negative, we need to add
803 (op0_low + op1_low) * 2**BITS_PER_WORD.
805 We use a trick to adjust quickly. We logically shift op0_low right
806 (op1_low) BITS_PER_WORD-1 steps to get 0 or 1, and add this to
807 op0_high (op1_high) before it is used to calculate 2b (2a). If no
808 logical shift exists, we do an arithmetic right shift and subtract
812 expand_doubleword_mult (enum machine_mode mode, rtx op0, rtx op1, rtx target,
813 bool umulp, enum optab_methods methods)
815 int low = (WORDS_BIG_ENDIAN ? 1 : 0);
816 int high = (WORDS_BIG_ENDIAN ? 0 : 1);
817 rtx wordm1 = umulp ? NULL_RTX : GEN_INT (BITS_PER_WORD - 1);
818 rtx product, adjust, product_high, temp;
820 rtx op0_high = operand_subword_force (op0, high, mode);
821 rtx op0_low = operand_subword_force (op0, low, mode);
822 rtx op1_high = operand_subword_force (op1, high, mode);
823 rtx op1_low = operand_subword_force (op1, low, mode);
825 /* If we're using an unsigned multiply to directly compute the product
826 of the low-order words of the operands and perform any required
827 adjustments of the operands, we begin by trying two more multiplications
828 and then computing the appropriate sum.
830 We have checked above that the required addition is provided.
831 Full-word addition will normally always succeed, especially if
832 it is provided at all, so we don't worry about its failure. The
833 multiplication may well fail, however, so we do handle that. */
837 /* ??? This could be done with emit_store_flag where available. */
838 temp = expand_binop (word_mode, lshr_optab, op0_low, wordm1,
839 NULL_RTX, 1, methods);
841 op0_high = expand_binop (word_mode, add_optab, op0_high, temp,
842 NULL_RTX, 0, OPTAB_DIRECT);
845 temp = expand_binop (word_mode, ashr_optab, op0_low, wordm1,
846 NULL_RTX, 0, methods);
849 op0_high = expand_binop (word_mode, sub_optab, op0_high, temp,
850 NULL_RTX, 0, OPTAB_DIRECT);
857 adjust = expand_binop (word_mode, smul_optab, op0_high, op1_low,
858 NULL_RTX, 0, OPTAB_DIRECT);
862 /* OP0_HIGH should now be dead. */
866 /* ??? This could be done with emit_store_flag where available. */
867 temp = expand_binop (word_mode, lshr_optab, op1_low, wordm1,
868 NULL_RTX, 1, methods);
870 op1_high = expand_binop (word_mode, add_optab, op1_high, temp,
871 NULL_RTX, 0, OPTAB_DIRECT);
874 temp = expand_binop (word_mode, ashr_optab, op1_low, wordm1,
875 NULL_RTX, 0, methods);
878 op1_high = expand_binop (word_mode, sub_optab, op1_high, temp,
879 NULL_RTX, 0, OPTAB_DIRECT);
886 temp = expand_binop (word_mode, smul_optab, op1_high, op0_low,
887 NULL_RTX, 0, OPTAB_DIRECT);
891 /* OP1_HIGH should now be dead. */
893 adjust = expand_binop (word_mode, add_optab, adjust, temp,
894 adjust, 0, OPTAB_DIRECT);
896 if (target && !REG_P (target))
900 product = expand_binop (mode, umul_widen_optab, op0_low, op1_low,
901 target, 1, OPTAB_DIRECT);
903 product = expand_binop (mode, smul_widen_optab, op0_low, op1_low,
904 target, 1, OPTAB_DIRECT);
909 product_high = operand_subword (product, high, 1, mode);
910 adjust = expand_binop (word_mode, add_optab, product_high, adjust,
911 REG_P (product_high) ? product_high : adjust,
913 emit_move_insn (product_high, adjust);
917 /* Wrapper around expand_binop which takes an rtx code to specify
918 the operation to perform, not an optab pointer. All other
919 arguments are the same. */
921 expand_simple_binop (enum machine_mode mode, enum rtx_code code, rtx op0,
922 rtx op1, rtx target, int unsignedp,
923 enum optab_methods methods)
925 optab binop = code_to_optab[(int) code];
928 return expand_binop (mode, binop, op0, op1, target, unsignedp, methods);
931 /* Generate code to perform an operation specified by BINOPTAB
932 on operands OP0 and OP1, with result having machine-mode MODE.
934 UNSIGNEDP is for the case where we have to widen the operands
935 to perform the operation. It says to use zero-extension.
937 If TARGET is nonzero, the value
938 is generated there, if it is convenient to do so.
939 In all cases an rtx is returned for the locus of the value;
940 this may or may not be TARGET. */
943 expand_binop (enum machine_mode mode, optab binoptab, rtx op0, rtx op1,
944 rtx target, int unsignedp, enum optab_methods methods)
946 enum optab_methods next_methods
947 = (methods == OPTAB_LIB || methods == OPTAB_LIB_WIDEN
948 ? OPTAB_WIDEN : methods);
949 enum mode_class class;
950 enum machine_mode wider_mode;
952 int commutative_op = 0;
953 int shift_op = (binoptab->code == ASHIFT
954 || binoptab->code == ASHIFTRT
955 || binoptab->code == LSHIFTRT
956 || binoptab->code == ROTATE
957 || binoptab->code == ROTATERT);
958 rtx entry_last = get_last_insn ();
961 class = GET_MODE_CLASS (mode);
965 /* Load duplicate non-volatile operands once. */
966 if (rtx_equal_p (op0, op1) && ! volatile_refs_p (op0))
968 op0 = force_not_mem (op0);
973 op0 = force_not_mem (op0);
974 op1 = force_not_mem (op1);
978 /* If subtracting an integer constant, convert this into an addition of
979 the negated constant. */
981 if (binoptab == sub_optab && GET_CODE (op1) == CONST_INT)
983 op1 = negate_rtx (mode, op1);
984 binoptab = add_optab;
987 /* If we are inside an appropriately-short loop and we are optimizing,
988 force expensive constants into a register. */
989 if (CONSTANT_P (op0) && optimize
990 && rtx_cost (op0, binoptab->code) > COSTS_N_INSNS (1))
992 if (GET_MODE (op0) != VOIDmode)
993 op0 = convert_modes (mode, VOIDmode, op0, unsignedp);
994 op0 = force_reg (mode, op0);
997 if (CONSTANT_P (op1) && optimize
998 && ! shift_op && rtx_cost (op1, binoptab->code) > COSTS_N_INSNS (1))
1000 if (GET_MODE (op1) != VOIDmode)
1001 op1 = convert_modes (mode, VOIDmode, op1, unsignedp);
1002 op1 = force_reg (mode, op1);
1005 /* Record where to delete back to if we backtrack. */
1006 last = get_last_insn ();
1008 /* If operation is commutative,
1009 try to make the first operand a register.
1010 Even better, try to make it the same as the target.
1011 Also try to make the last operand a constant. */
1012 if (GET_RTX_CLASS (binoptab->code) == RTX_COMM_ARITH
1013 || binoptab == smul_widen_optab
1014 || binoptab == umul_widen_optab
1015 || binoptab == smul_highpart_optab
1016 || binoptab == umul_highpart_optab)
1020 if (((target == 0 || REG_P (target))
1024 : rtx_equal_p (op1, target))
1025 || GET_CODE (op0) == CONST_INT)
1033 /* If we can do it with a three-operand insn, do so. */
1035 if (methods != OPTAB_MUST_WIDEN
1036 && binoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1038 int icode = (int) binoptab->handlers[(int) mode].insn_code;
1039 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
1040 enum machine_mode mode1 = insn_data[icode].operand[2].mode;
1042 rtx xop0 = op0, xop1 = op1;
1047 temp = gen_reg_rtx (mode);
1049 /* If it is a commutative operator and the modes would match
1050 if we would swap the operands, we can save the conversions. */
1053 if (GET_MODE (op0) != mode0 && GET_MODE (op1) != mode1
1054 && GET_MODE (op0) == mode1 && GET_MODE (op1) == mode0)
1058 tmp = op0; op0 = op1; op1 = tmp;
1059 tmp = xop0; xop0 = xop1; xop1 = tmp;
1063 /* In case the insn wants input operands in modes different from
1064 those of the actual operands, convert the operands. It would
1065 seem that we don't need to convert CONST_INTs, but we do, so
1066 that they're properly zero-extended, sign-extended or truncated
1069 if (GET_MODE (op0) != mode0 && mode0 != VOIDmode)
1070 xop0 = convert_modes (mode0,
1071 GET_MODE (op0) != VOIDmode
1076 if (GET_MODE (op1) != mode1 && mode1 != VOIDmode)
1077 xop1 = convert_modes (mode1,
1078 GET_MODE (op1) != VOIDmode
1083 /* Now, if insn's predicates don't allow our operands, put them into
1086 if (!insn_data[icode].operand[1].predicate (xop0, mode0)
1087 && mode0 != VOIDmode)
1088 xop0 = copy_to_mode_reg (mode0, xop0);
1090 if (!insn_data[icode].operand[2].predicate (xop1, mode1)
1091 && mode1 != VOIDmode)
1092 xop1 = copy_to_mode_reg (mode1, xop1);
1094 if (!insn_data[icode].operand[0].predicate (temp, mode))
1095 temp = gen_reg_rtx (mode);
1097 pat = GEN_FCN (icode) (temp, xop0, xop1);
1100 /* If PAT is composed of more than one insn, try to add an appropriate
1101 REG_EQUAL note to it. If we can't because TEMP conflicts with an
1102 operand, call ourselves again, this time without a target. */
1103 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX
1104 && ! add_equal_note (pat, temp, binoptab->code, xop0, xop1))
1106 delete_insns_since (last);
1107 return expand_binop (mode, binoptab, op0, op1, NULL_RTX,
1108 unsignedp, methods);
1115 delete_insns_since (last);
1118 /* If this is a multiply, see if we can do a widening operation that
1119 takes operands of this mode and makes a wider mode. */
1121 if (binoptab == smul_optab && GET_MODE_WIDER_MODE (mode) != VOIDmode
1122 && (((unsignedp ? umul_widen_optab : smul_widen_optab)
1123 ->handlers[(int) GET_MODE_WIDER_MODE (mode)].insn_code)
1124 != CODE_FOR_nothing))
1126 temp = expand_binop (GET_MODE_WIDER_MODE (mode),
1127 unsignedp ? umul_widen_optab : smul_widen_optab,
1128 op0, op1, NULL_RTX, unsignedp, OPTAB_DIRECT);
1132 if (GET_MODE_CLASS (mode) == MODE_INT)
1133 return gen_lowpart (mode, temp);
1135 return convert_to_mode (mode, temp, unsignedp);
1139 /* Look for a wider mode of the same class for which we think we
1140 can open-code the operation. Check for a widening multiply at the
1141 wider mode as well. */
1143 if ((class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT)
1144 && methods != OPTAB_DIRECT && methods != OPTAB_LIB)
1145 for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode;
1146 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1148 if (binoptab->handlers[(int) wider_mode].insn_code != CODE_FOR_nothing
1149 || (binoptab == smul_optab
1150 && GET_MODE_WIDER_MODE (wider_mode) != VOIDmode
1151 && (((unsignedp ? umul_widen_optab : smul_widen_optab)
1152 ->handlers[(int) GET_MODE_WIDER_MODE (wider_mode)].insn_code)
1153 != CODE_FOR_nothing)))
1155 rtx xop0 = op0, xop1 = op1;
1158 /* For certain integer operations, we need not actually extend
1159 the narrow operands, as long as we will truncate
1160 the results to the same narrowness. */
1162 if ((binoptab == ior_optab || binoptab == and_optab
1163 || binoptab == xor_optab
1164 || binoptab == add_optab || binoptab == sub_optab
1165 || binoptab == smul_optab || binoptab == ashl_optab)
1166 && class == MODE_INT)
1169 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp, no_extend);
1171 /* The second operand of a shift must always be extended. */
1172 xop1 = widen_operand (xop1, wider_mode, mode, unsignedp,
1173 no_extend && binoptab != ashl_optab);
1175 temp = expand_binop (wider_mode, binoptab, xop0, xop1, NULL_RTX,
1176 unsignedp, OPTAB_DIRECT);
1179 if (class != MODE_INT)
1182 target = gen_reg_rtx (mode);
1183 convert_move (target, temp, 0);
1187 return gen_lowpart (mode, temp);
1190 delete_insns_since (last);
1194 /* These can be done a word at a time. */
1195 if ((binoptab == and_optab || binoptab == ior_optab || binoptab == xor_optab)
1196 && class == MODE_INT
1197 && GET_MODE_SIZE (mode) > UNITS_PER_WORD
1198 && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1204 /* If TARGET is the same as one of the operands, the REG_EQUAL note
1205 won't be accurate, so use a new target. */
1206 if (target == 0 || target == op0 || target == op1)
1207 target = gen_reg_rtx (mode);
1211 /* Do the actual arithmetic. */
1212 for (i = 0; i < GET_MODE_BITSIZE (mode) / BITS_PER_WORD; i++)
1214 rtx target_piece = operand_subword (target, i, 1, mode);
1215 rtx x = expand_binop (word_mode, binoptab,
1216 operand_subword_force (op0, i, mode),
1217 operand_subword_force (op1, i, mode),
1218 target_piece, unsignedp, next_methods);
1223 if (target_piece != x)
1224 emit_move_insn (target_piece, x);
1227 insns = get_insns ();
1230 if (i == GET_MODE_BITSIZE (mode) / BITS_PER_WORD)
1232 if (binoptab->code != UNKNOWN)
1234 = gen_rtx_fmt_ee (binoptab->code, mode,
1235 copy_rtx (op0), copy_rtx (op1));
1239 emit_no_conflict_block (insns, target, op0, op1, equiv_value);
1244 /* Synthesize double word shifts from single word shifts. */
1245 if ((binoptab == lshr_optab || binoptab == ashl_optab
1246 || binoptab == ashr_optab)
1247 && class == MODE_INT
1248 && (GET_CODE (op1) == CONST_INT || !optimize_size)
1249 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1250 && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing
1251 && ashl_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing
1252 && lshr_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1254 unsigned HOST_WIDE_INT shift_mask, double_shift_mask;
1255 enum machine_mode op1_mode;
1257 double_shift_mask = targetm.shift_truncation_mask (mode);
1258 shift_mask = targetm.shift_truncation_mask (word_mode);
1259 op1_mode = GET_MODE (op1) != VOIDmode ? GET_MODE (op1) : word_mode;
1261 /* Apply the truncation to constant shifts. */
1262 if (double_shift_mask > 0 && GET_CODE (op1) == CONST_INT)
1263 op1 = GEN_INT (INTVAL (op1) & double_shift_mask);
1265 if (op1 == CONST0_RTX (op1_mode))
1268 /* Make sure that this is a combination that expand_doubleword_shift
1269 can handle. See the comments there for details. */
1270 if (double_shift_mask == 0
1271 || (shift_mask == BITS_PER_WORD - 1
1272 && double_shift_mask == BITS_PER_WORD * 2 - 1))
1274 rtx insns, equiv_value;
1275 rtx into_target, outof_target;
1276 rtx into_input, outof_input;
1277 int left_shift, outof_word;
1279 /* If TARGET is the same as one of the operands, the REG_EQUAL note
1280 won't be accurate, so use a new target. */
1281 if (target == 0 || target == op0 || target == op1)
1282 target = gen_reg_rtx (mode);
1286 /* OUTOF_* is the word we are shifting bits away from, and
1287 INTO_* is the word that we are shifting bits towards, thus
1288 they differ depending on the direction of the shift and
1289 WORDS_BIG_ENDIAN. */
1291 left_shift = binoptab == ashl_optab;
1292 outof_word = left_shift ^ ! WORDS_BIG_ENDIAN;
1294 outof_target = operand_subword (target, outof_word, 1, mode);
1295 into_target = operand_subword (target, 1 - outof_word, 1, mode);
1297 outof_input = operand_subword_force (op0, outof_word, mode);
1298 into_input = operand_subword_force (op0, 1 - outof_word, mode);
1300 if (expand_doubleword_shift (op1_mode, binoptab,
1301 outof_input, into_input, op1,
1302 outof_target, into_target,
1303 unsignedp, methods, shift_mask))
1305 insns = get_insns ();
1308 equiv_value = gen_rtx_fmt_ee (binoptab->code, mode, op0, op1);
1309 emit_no_conflict_block (insns, target, op0, op1, equiv_value);
1316 /* Synthesize double word rotates from single word shifts. */
1317 if ((binoptab == rotl_optab || binoptab == rotr_optab)
1318 && class == MODE_INT
1319 && GET_CODE (op1) == CONST_INT
1320 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1321 && ashl_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing
1322 && lshr_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1324 rtx insns, equiv_value;
1325 rtx into_target, outof_target;
1326 rtx into_input, outof_input;
1328 int shift_count, left_shift, outof_word;
1330 /* If TARGET is the same as one of the operands, the REG_EQUAL note
1331 won't be accurate, so use a new target. Do this also if target is not
1332 a REG, first because having a register instead may open optimization
1333 opportunities, and second because if target and op0 happen to be MEMs
1334 designating the same location, we would risk clobbering it too early
1335 in the code sequence we generate below. */
1336 if (target == 0 || target == op0 || target == op1 || ! REG_P (target))
1337 target = gen_reg_rtx (mode);
1341 shift_count = INTVAL (op1);
1343 /* OUTOF_* is the word we are shifting bits away from, and
1344 INTO_* is the word that we are shifting bits towards, thus
1345 they differ depending on the direction of the shift and
1346 WORDS_BIG_ENDIAN. */
1348 left_shift = (binoptab == rotl_optab);
1349 outof_word = left_shift ^ ! WORDS_BIG_ENDIAN;
1351 outof_target = operand_subword (target, outof_word, 1, mode);
1352 into_target = operand_subword (target, 1 - outof_word, 1, mode);
1354 outof_input = operand_subword_force (op0, outof_word, mode);
1355 into_input = operand_subword_force (op0, 1 - outof_word, mode);
1357 if (shift_count == BITS_PER_WORD)
1359 /* This is just a word swap. */
1360 emit_move_insn (outof_target, into_input);
1361 emit_move_insn (into_target, outof_input);
1366 rtx into_temp1, into_temp2, outof_temp1, outof_temp2;
1367 rtx first_shift_count, second_shift_count;
1368 optab reverse_unsigned_shift, unsigned_shift;
1370 reverse_unsigned_shift = (left_shift ^ (shift_count < BITS_PER_WORD)
1371 ? lshr_optab : ashl_optab);
1373 unsigned_shift = (left_shift ^ (shift_count < BITS_PER_WORD)
1374 ? ashl_optab : lshr_optab);
1376 if (shift_count > BITS_PER_WORD)
1378 first_shift_count = GEN_INT (shift_count - BITS_PER_WORD);
1379 second_shift_count = GEN_INT (2 * BITS_PER_WORD - shift_count);
1383 first_shift_count = GEN_INT (BITS_PER_WORD - shift_count);
1384 second_shift_count = GEN_INT (shift_count);
1387 into_temp1 = expand_binop (word_mode, unsigned_shift,
1388 outof_input, first_shift_count,
1389 NULL_RTX, unsignedp, next_methods);
1390 into_temp2 = expand_binop (word_mode, reverse_unsigned_shift,
1391 into_input, second_shift_count,
1392 NULL_RTX, unsignedp, next_methods);
1394 if (into_temp1 != 0 && into_temp2 != 0)
1395 inter = expand_binop (word_mode, ior_optab, into_temp1, into_temp2,
1396 into_target, unsignedp, next_methods);
1400 if (inter != 0 && inter != into_target)
1401 emit_move_insn (into_target, inter);
1403 outof_temp1 = expand_binop (word_mode, unsigned_shift,
1404 into_input, first_shift_count,
1405 NULL_RTX, unsignedp, next_methods);
1406 outof_temp2 = expand_binop (word_mode, reverse_unsigned_shift,
1407 outof_input, second_shift_count,
1408 NULL_RTX, unsignedp, next_methods);
1410 if (inter != 0 && outof_temp1 != 0 && outof_temp2 != 0)
1411 inter = expand_binop (word_mode, ior_optab,
1412 outof_temp1, outof_temp2,
1413 outof_target, unsignedp, next_methods);
1415 if (inter != 0 && inter != outof_target)
1416 emit_move_insn (outof_target, inter);
1419 insns = get_insns ();
1424 if (binoptab->code != UNKNOWN)
1425 equiv_value = gen_rtx_fmt_ee (binoptab->code, mode, op0, op1);
1429 /* We can't make this a no conflict block if this is a word swap,
1430 because the word swap case fails if the input and output values
1431 are in the same register. */
1432 if (shift_count != BITS_PER_WORD)
1433 emit_no_conflict_block (insns, target, op0, op1, equiv_value);
1442 /* These can be done a word at a time by propagating carries. */
1443 if ((binoptab == add_optab || binoptab == sub_optab)
1444 && class == MODE_INT
1445 && GET_MODE_SIZE (mode) >= 2 * UNITS_PER_WORD
1446 && binoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1449 optab otheroptab = binoptab == add_optab ? sub_optab : add_optab;
1450 const unsigned int nwords = GET_MODE_BITSIZE (mode) / BITS_PER_WORD;
1451 rtx carry_in = NULL_RTX, carry_out = NULL_RTX;
1452 rtx xop0, xop1, xtarget;
1454 /* We can handle either a 1 or -1 value for the carry. If STORE_FLAG
1455 value is one of those, use it. Otherwise, use 1 since it is the
1456 one easiest to get. */
1457 #if STORE_FLAG_VALUE == 1 || STORE_FLAG_VALUE == -1
1458 int normalizep = STORE_FLAG_VALUE;
1463 /* Prepare the operands. */
1464 xop0 = force_reg (mode, op0);
1465 xop1 = force_reg (mode, op1);
1467 xtarget = gen_reg_rtx (mode);
1469 if (target == 0 || !REG_P (target))
1472 /* Indicate for flow that the entire target reg is being set. */
1474 emit_insn (gen_rtx_CLOBBER (VOIDmode, xtarget));
1476 /* Do the actual arithmetic. */
1477 for (i = 0; i < nwords; i++)
1479 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
1480 rtx target_piece = operand_subword (xtarget, index, 1, mode);
1481 rtx op0_piece = operand_subword_force (xop0, index, mode);
1482 rtx op1_piece = operand_subword_force (xop1, index, mode);
1485 /* Main add/subtract of the input operands. */
1486 x = expand_binop (word_mode, binoptab,
1487 op0_piece, op1_piece,
1488 target_piece, unsignedp, next_methods);
1494 /* Store carry from main add/subtract. */
1495 carry_out = gen_reg_rtx (word_mode);
1496 carry_out = emit_store_flag_force (carry_out,
1497 (binoptab == add_optab
1500 word_mode, 1, normalizep);
1507 /* Add/subtract previous carry to main result. */
1508 newx = expand_binop (word_mode,
1509 normalizep == 1 ? binoptab : otheroptab,
1511 NULL_RTX, 1, next_methods);
1515 /* Get out carry from adding/subtracting carry in. */
1516 rtx carry_tmp = gen_reg_rtx (word_mode);
1517 carry_tmp = emit_store_flag_force (carry_tmp,
1518 (binoptab == add_optab
1521 word_mode, 1, normalizep);
1523 /* Logical-ior the two poss. carry together. */
1524 carry_out = expand_binop (word_mode, ior_optab,
1525 carry_out, carry_tmp,
1526 carry_out, 0, next_methods);
1530 emit_move_insn (target_piece, newx);
1534 if (x != target_piece)
1535 emit_move_insn (target_piece, x);
1538 carry_in = carry_out;
1541 if (i == GET_MODE_BITSIZE (mode) / (unsigned) BITS_PER_WORD)
1543 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
1544 || ! rtx_equal_p (target, xtarget))
1546 rtx temp = emit_move_insn (target, xtarget);
1548 set_unique_reg_note (temp,
1550 gen_rtx_fmt_ee (binoptab->code, mode,
1561 delete_insns_since (last);
1564 /* Attempt to synthesize double word multiplies using a sequence of word
1565 mode multiplications. We first attempt to generate a sequence using a
1566 more efficient unsigned widening multiply, and if that fails we then
1567 try using a signed widening multiply. */
1569 if (binoptab == smul_optab
1570 && class == MODE_INT
1571 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1572 && smul_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing
1573 && add_optab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
1575 rtx product = NULL_RTX;
1577 if (umul_widen_optab->handlers[(int) mode].insn_code
1578 != CODE_FOR_nothing)
1580 product = expand_doubleword_mult (mode, op0, op1, target,
1583 delete_insns_since (last);
1586 if (product == NULL_RTX
1587 && smul_widen_optab->handlers[(int) mode].insn_code
1588 != CODE_FOR_nothing)
1590 product = expand_doubleword_mult (mode, op0, op1, target,
1593 delete_insns_since (last);
1596 if (product != NULL_RTX)
1598 if (mov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1600 temp = emit_move_insn (target ? target : product, product);
1601 set_unique_reg_note (temp,
1603 gen_rtx_fmt_ee (MULT, mode,
1611 /* It can't be open-coded in this mode.
1612 Use a library call if one is available and caller says that's ok. */
1614 if (binoptab->handlers[(int) mode].libfunc
1615 && (methods == OPTAB_LIB || methods == OPTAB_LIB_WIDEN))
1619 enum machine_mode op1_mode = mode;
1626 op1_mode = word_mode;
1627 /* Specify unsigned here,
1628 since negative shift counts are meaningless. */
1629 op1x = convert_to_mode (word_mode, op1, 1);
1632 if (GET_MODE (op0) != VOIDmode
1633 && GET_MODE (op0) != mode)
1634 op0 = convert_to_mode (mode, op0, unsignedp);
1636 /* Pass 1 for NO_QUEUE so we don't lose any increments
1637 if the libcall is cse'd or moved. */
1638 value = emit_library_call_value (binoptab->handlers[(int) mode].libfunc,
1639 NULL_RTX, LCT_CONST, mode, 2,
1640 op0, mode, op1x, op1_mode);
1642 insns = get_insns ();
1645 target = gen_reg_rtx (mode);
1646 emit_libcall_block (insns, target, value,
1647 gen_rtx_fmt_ee (binoptab->code, mode, op0, op1));
1652 delete_insns_since (last);
1654 /* It can't be done in this mode. Can we do it in a wider mode? */
1656 if (! (methods == OPTAB_WIDEN || methods == OPTAB_LIB_WIDEN
1657 || methods == OPTAB_MUST_WIDEN))
1659 /* Caller says, don't even try. */
1660 delete_insns_since (entry_last);
1664 /* Compute the value of METHODS to pass to recursive calls.
1665 Don't allow widening to be tried recursively. */
1667 methods = (methods == OPTAB_LIB_WIDEN ? OPTAB_LIB : OPTAB_DIRECT);
1669 /* Look for a wider mode of the same class for which it appears we can do
1672 if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT)
1674 for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode;
1675 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1677 if ((binoptab->handlers[(int) wider_mode].insn_code
1678 != CODE_FOR_nothing)
1679 || (methods == OPTAB_LIB
1680 && binoptab->handlers[(int) wider_mode].libfunc))
1682 rtx xop0 = op0, xop1 = op1;
1685 /* For certain integer operations, we need not actually extend
1686 the narrow operands, as long as we will truncate
1687 the results to the same narrowness. */
1689 if ((binoptab == ior_optab || binoptab == and_optab
1690 || binoptab == xor_optab
1691 || binoptab == add_optab || binoptab == sub_optab
1692 || binoptab == smul_optab || binoptab == ashl_optab)
1693 && class == MODE_INT)
1696 xop0 = widen_operand (xop0, wider_mode, mode,
1697 unsignedp, no_extend);
1699 /* The second operand of a shift must always be extended. */
1700 xop1 = widen_operand (xop1, wider_mode, mode, unsignedp,
1701 no_extend && binoptab != ashl_optab);
1703 temp = expand_binop (wider_mode, binoptab, xop0, xop1, NULL_RTX,
1704 unsignedp, methods);
1707 if (class != MODE_INT)
1710 target = gen_reg_rtx (mode);
1711 convert_move (target, temp, 0);
1715 return gen_lowpart (mode, temp);
1718 delete_insns_since (last);
1723 delete_insns_since (entry_last);
1727 /* Expand a binary operator which has both signed and unsigned forms.
1728 UOPTAB is the optab for unsigned operations, and SOPTAB is for
1731 If we widen unsigned operands, we may use a signed wider operation instead
1732 of an unsigned wider operation, since the result would be the same. */
1735 sign_expand_binop (enum machine_mode mode, optab uoptab, optab soptab,
1736 rtx op0, rtx op1, rtx target, int unsignedp,
1737 enum optab_methods methods)
1740 optab direct_optab = unsignedp ? uoptab : soptab;
1741 struct optab wide_soptab;
1743 /* Do it without widening, if possible. */
1744 temp = expand_binop (mode, direct_optab, op0, op1, target,
1745 unsignedp, OPTAB_DIRECT);
1746 if (temp || methods == OPTAB_DIRECT)
1749 /* Try widening to a signed int. Make a fake signed optab that
1750 hides any signed insn for direct use. */
1751 wide_soptab = *soptab;
1752 wide_soptab.handlers[(int) mode].insn_code = CODE_FOR_nothing;
1753 wide_soptab.handlers[(int) mode].libfunc = 0;
1755 temp = expand_binop (mode, &wide_soptab, op0, op1, target,
1756 unsignedp, OPTAB_WIDEN);
1758 /* For unsigned operands, try widening to an unsigned int. */
1759 if (temp == 0 && unsignedp)
1760 temp = expand_binop (mode, uoptab, op0, op1, target,
1761 unsignedp, OPTAB_WIDEN);
1762 if (temp || methods == OPTAB_WIDEN)
1765 /* Use the right width lib call if that exists. */
1766 temp = expand_binop (mode, direct_optab, op0, op1, target, unsignedp, OPTAB_LIB);
1767 if (temp || methods == OPTAB_LIB)
1770 /* Must widen and use a lib call, use either signed or unsigned. */
1771 temp = expand_binop (mode, &wide_soptab, op0, op1, target,
1772 unsignedp, methods);
1776 return expand_binop (mode, uoptab, op0, op1, target,
1777 unsignedp, methods);
1781 /* Generate code to perform an operation specified by UNOPPTAB
1782 on operand OP0, with two results to TARG0 and TARG1.
1783 We assume that the order of the operands for the instruction
1784 is TARG0, TARG1, OP0.
1786 Either TARG0 or TARG1 may be zero, but what that means is that
1787 the result is not actually wanted. We will generate it into
1788 a dummy pseudo-reg and discard it. They may not both be zero.
1790 Returns 1 if this operation can be performed; 0 if not. */
1793 expand_twoval_unop (optab unoptab, rtx op0, rtx targ0, rtx targ1,
1796 enum machine_mode mode = GET_MODE (targ0 ? targ0 : targ1);
1797 enum mode_class class;
1798 enum machine_mode wider_mode;
1799 rtx entry_last = get_last_insn ();
1802 class = GET_MODE_CLASS (mode);
1805 op0 = force_not_mem (op0);
1808 targ0 = gen_reg_rtx (mode);
1810 targ1 = gen_reg_rtx (mode);
1812 /* Record where to go back to if we fail. */
1813 last = get_last_insn ();
1815 if (unoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1817 int icode = (int) unoptab->handlers[(int) mode].insn_code;
1818 enum machine_mode mode0 = insn_data[icode].operand[2].mode;
1822 if (GET_MODE (xop0) != VOIDmode
1823 && GET_MODE (xop0) != mode0)
1824 xop0 = convert_to_mode (mode0, xop0, unsignedp);
1826 /* Now, if insn doesn't accept these operands, put them into pseudos. */
1827 if (!insn_data[icode].operand[2].predicate (xop0, mode0))
1828 xop0 = copy_to_mode_reg (mode0, xop0);
1830 /* We could handle this, but we should always be called with a pseudo
1831 for our targets and all insns should take them as outputs. */
1832 gcc_assert (insn_data[icode].operand[0].predicate (targ0, mode));
1833 gcc_assert (insn_data[icode].operand[1].predicate (targ1, mode));
1835 pat = GEN_FCN (icode) (targ0, targ1, xop0);
1842 delete_insns_since (last);
1845 /* It can't be done in this mode. Can we do it in a wider mode? */
1847 if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT)
1849 for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode;
1850 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1852 if (unoptab->handlers[(int) wider_mode].insn_code
1853 != CODE_FOR_nothing)
1855 rtx t0 = gen_reg_rtx (wider_mode);
1856 rtx t1 = gen_reg_rtx (wider_mode);
1857 rtx cop0 = convert_modes (wider_mode, mode, op0, unsignedp);
1859 if (expand_twoval_unop (unoptab, cop0, t0, t1, unsignedp))
1861 convert_move (targ0, t0, unsignedp);
1862 convert_move (targ1, t1, unsignedp);
1866 delete_insns_since (last);
1871 delete_insns_since (entry_last);
1875 /* Generate code to perform an operation specified by BINOPTAB
1876 on operands OP0 and OP1, with two results to TARG1 and TARG2.
1877 We assume that the order of the operands for the instruction
1878 is TARG0, OP0, OP1, TARG1, which would fit a pattern like
1879 [(set TARG0 (operate OP0 OP1)) (set TARG1 (operate ...))].
1881 Either TARG0 or TARG1 may be zero, but what that means is that
1882 the result is not actually wanted. We will generate it into
1883 a dummy pseudo-reg and discard it. They may not both be zero.
1885 Returns 1 if this operation can be performed; 0 if not. */
1888 expand_twoval_binop (optab binoptab, rtx op0, rtx op1, rtx targ0, rtx targ1,
1891 enum machine_mode mode = GET_MODE (targ0 ? targ0 : targ1);
1892 enum mode_class class;
1893 enum machine_mode wider_mode;
1894 rtx entry_last = get_last_insn ();
1897 class = GET_MODE_CLASS (mode);
1901 op0 = force_not_mem (op0);
1902 op1 = force_not_mem (op1);
1905 /* If we are inside an appropriately-short loop and we are optimizing,
1906 force expensive constants into a register. */
1907 if (CONSTANT_P (op0) && optimize
1908 && rtx_cost (op0, binoptab->code) > COSTS_N_INSNS (1))
1909 op0 = force_reg (mode, op0);
1911 if (CONSTANT_P (op1) && optimize
1912 && rtx_cost (op1, binoptab->code) > COSTS_N_INSNS (1))
1913 op1 = force_reg (mode, op1);
1916 targ0 = gen_reg_rtx (mode);
1918 targ1 = gen_reg_rtx (mode);
1920 /* Record where to go back to if we fail. */
1921 last = get_last_insn ();
1923 if (binoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
1925 int icode = (int) binoptab->handlers[(int) mode].insn_code;
1926 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
1927 enum machine_mode mode1 = insn_data[icode].operand[2].mode;
1929 rtx xop0 = op0, xop1 = op1;
1931 /* In case the insn wants input operands in modes different from
1932 those of the actual operands, convert the operands. It would
1933 seem that we don't need to convert CONST_INTs, but we do, so
1934 that they're properly zero-extended, sign-extended or truncated
1937 if (GET_MODE (op0) != mode0 && mode0 != VOIDmode)
1938 xop0 = convert_modes (mode0,
1939 GET_MODE (op0) != VOIDmode
1944 if (GET_MODE (op1) != mode1 && mode1 != VOIDmode)
1945 xop1 = convert_modes (mode1,
1946 GET_MODE (op1) != VOIDmode
1951 /* Now, if insn doesn't accept these operands, put them into pseudos. */
1952 if (!insn_data[icode].operand[1].predicate (xop0, mode0))
1953 xop0 = copy_to_mode_reg (mode0, xop0);
1955 if (!insn_data[icode].operand[2].predicate (xop1, mode1))
1956 xop1 = copy_to_mode_reg (mode1, xop1);
1958 /* We could handle this, but we should always be called with a pseudo
1959 for our targets and all insns should take them as outputs. */
1960 gcc_assert (insn_data[icode].operand[0].predicate (targ0, mode));
1961 gcc_assert (insn_data[icode].operand[3].predicate (targ1, mode));
1963 pat = GEN_FCN (icode) (targ0, xop0, xop1, targ1);
1970 delete_insns_since (last);
1973 /* It can't be done in this mode. Can we do it in a wider mode? */
1975 if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT)
1977 for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode;
1978 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1980 if (binoptab->handlers[(int) wider_mode].insn_code
1981 != CODE_FOR_nothing)
1983 rtx t0 = gen_reg_rtx (wider_mode);
1984 rtx t1 = gen_reg_rtx (wider_mode);
1985 rtx cop0 = convert_modes (wider_mode, mode, op0, unsignedp);
1986 rtx cop1 = convert_modes (wider_mode, mode, op1, unsignedp);
1988 if (expand_twoval_binop (binoptab, cop0, cop1,
1991 convert_move (targ0, t0, unsignedp);
1992 convert_move (targ1, t1, unsignedp);
1996 delete_insns_since (last);
2001 delete_insns_since (entry_last);
2005 /* Expand the two-valued library call indicated by BINOPTAB, but
2006 preserve only one of the values. If TARG0 is non-NULL, the first
2007 value is placed into TARG0; otherwise the second value is placed
2008 into TARG1. Exactly one of TARG0 and TARG1 must be non-NULL. The
2009 value stored into TARG0 or TARG1 is equivalent to (CODE OP0 OP1).
2010 This routine assumes that the value returned by the library call is
2011 as if the return value was of an integral mode twice as wide as the
2012 mode of OP0. Returns 1 if the call was successful. */
2015 expand_twoval_binop_libfunc (optab binoptab, rtx op0, rtx op1,
2016 rtx targ0, rtx targ1, enum rtx_code code)
2018 enum machine_mode mode;
2019 enum machine_mode libval_mode;
2023 /* Exactly one of TARG0 or TARG1 should be non-NULL. */
2024 gcc_assert (!targ0 != !targ1);
2026 mode = GET_MODE (op0);
2027 if (!binoptab->handlers[(int) mode].libfunc)
2030 /* The value returned by the library function will have twice as
2031 many bits as the nominal MODE. */
2032 libval_mode = smallest_mode_for_size (2 * GET_MODE_BITSIZE (mode),
2035 libval = emit_library_call_value (binoptab->handlers[(int) mode].libfunc,
2036 NULL_RTX, LCT_CONST,
2040 /* Get the part of VAL containing the value that we want. */
2041 libval = simplify_gen_subreg (mode, libval, libval_mode,
2042 targ0 ? 0 : GET_MODE_SIZE (mode));
2043 insns = get_insns ();
2045 /* Move the into the desired location. */
2046 emit_libcall_block (insns, targ0 ? targ0 : targ1, libval,
2047 gen_rtx_fmt_ee (code, mode, op0, op1));
2053 /* Wrapper around expand_unop which takes an rtx code to specify
2054 the operation to perform, not an optab pointer. All other
2055 arguments are the same. */
2057 expand_simple_unop (enum machine_mode mode, enum rtx_code code, rtx op0,
2058 rtx target, int unsignedp)
2060 optab unop = code_to_optab[(int) code];
2063 return expand_unop (mode, unop, op0, target, unsignedp);
2069 (clz:wide (zero_extend:wide x)) - ((width wide) - (width narrow)). */
2071 widen_clz (enum machine_mode mode, rtx op0, rtx target)
2073 enum mode_class class = GET_MODE_CLASS (mode);
2074 if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT)
2076 enum machine_mode wider_mode;
2077 for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode;
2078 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2080 if (clz_optab->handlers[(int) wider_mode].insn_code
2081 != CODE_FOR_nothing)
2083 rtx xop0, temp, last;
2085 last = get_last_insn ();
2088 target = gen_reg_rtx (mode);
2089 xop0 = widen_operand (op0, wider_mode, mode, true, false);
2090 temp = expand_unop (wider_mode, clz_optab, xop0, NULL_RTX, true);
2092 temp = expand_binop (wider_mode, sub_optab, temp,
2093 GEN_INT (GET_MODE_BITSIZE (wider_mode)
2094 - GET_MODE_BITSIZE (mode)),
2095 target, true, OPTAB_DIRECT);
2097 delete_insns_since (last);
2106 /* Try calculating (parity x) as (and (popcount x) 1), where
2107 popcount can also be done in a wider mode. */
2109 expand_parity (enum machine_mode mode, rtx op0, rtx target)
2111 enum mode_class class = GET_MODE_CLASS (mode);
2112 if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT)
2114 enum machine_mode wider_mode;
2115 for (wider_mode = mode; wider_mode != VOIDmode;
2116 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2118 if (popcount_optab->handlers[(int) wider_mode].insn_code
2119 != CODE_FOR_nothing)
2121 rtx xop0, temp, last;
2123 last = get_last_insn ();
2126 target = gen_reg_rtx (mode);
2127 xop0 = widen_operand (op0, wider_mode, mode, true, false);
2128 temp = expand_unop (wider_mode, popcount_optab, xop0, NULL_RTX,
2131 temp = expand_binop (wider_mode, and_optab, temp, const1_rtx,
2132 target, true, OPTAB_DIRECT);
2134 delete_insns_since (last);
2143 /* Extract the OMODE lowpart from VAL, which has IMODE. Under certain
2144 conditions, VAL may already be a SUBREG against which we cannot generate
2145 a further SUBREG. In this case, we expect forcing the value into a
2146 register will work around the situation. */
2149 lowpart_subreg_maybe_copy (enum machine_mode omode, rtx val,
2150 enum machine_mode imode)
2153 ret = lowpart_subreg (omode, val, imode);
2156 val = force_reg (imode, val);
2157 ret = lowpart_subreg (omode, val, imode);
2158 gcc_assert (ret != NULL);
2163 /* Expand a floating point absolute value or negation operation via a
2164 logical operation on the sign bit. */
2167 expand_absneg_bit (enum rtx_code code, enum machine_mode mode,
2168 rtx op0, rtx target)
2170 const struct real_format *fmt;
2171 int bitpos, word, nwords, i;
2172 enum machine_mode imode;
2173 HOST_WIDE_INT hi, lo;
2176 /* The format has to have a simple sign bit. */
2177 fmt = REAL_MODE_FORMAT (mode);
2181 bitpos = fmt->signbit_rw;
2185 /* Don't create negative zeros if the format doesn't support them. */
2186 if (code == NEG && !fmt->has_signed_zero)
2189 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
2191 imode = int_mode_for_mode (mode);
2192 if (imode == BLKmode)
2201 if (FLOAT_WORDS_BIG_ENDIAN)
2202 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
2204 word = bitpos / BITS_PER_WORD;
2205 bitpos = bitpos % BITS_PER_WORD;
2206 nwords = (GET_MODE_BITSIZE (mode) + BITS_PER_WORD - 1) / BITS_PER_WORD;
2209 if (bitpos < HOST_BITS_PER_WIDE_INT)
2212 lo = (HOST_WIDE_INT) 1 << bitpos;
2216 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
2222 if (target == 0 || target == op0)
2223 target = gen_reg_rtx (mode);
2229 for (i = 0; i < nwords; ++i)
2231 rtx targ_piece = operand_subword (target, i, 1, mode);
2232 rtx op0_piece = operand_subword_force (op0, i, mode);
2236 temp = expand_binop (imode, code == ABS ? and_optab : xor_optab,
2238 immed_double_const (lo, hi, imode),
2239 targ_piece, 1, OPTAB_LIB_WIDEN);
2240 if (temp != targ_piece)
2241 emit_move_insn (targ_piece, temp);
2244 emit_move_insn (targ_piece, op0_piece);
2247 insns = get_insns ();
2250 temp = gen_rtx_fmt_e (code, mode, copy_rtx (op0));
2251 emit_no_conflict_block (insns, target, op0, NULL_RTX, temp);
2255 temp = expand_binop (imode, code == ABS ? and_optab : xor_optab,
2256 gen_lowpart (imode, op0),
2257 immed_double_const (lo, hi, imode),
2258 gen_lowpart (imode, target), 1, OPTAB_LIB_WIDEN);
2259 target = lowpart_subreg_maybe_copy (mode, temp, imode);
2261 set_unique_reg_note (get_last_insn (), REG_EQUAL,
2262 gen_rtx_fmt_e (code, mode, copy_rtx (op0)));
2268 /* Generate code to perform an operation specified by UNOPTAB
2269 on operand OP0, with result having machine-mode MODE.
2271 UNSIGNEDP is for the case where we have to widen the operands
2272 to perform the operation. It says to use zero-extension.
2274 If TARGET is nonzero, the value
2275 is generated there, if it is convenient to do so.
2276 In all cases an rtx is returned for the locus of the value;
2277 this may or may not be TARGET. */
2280 expand_unop (enum machine_mode mode, optab unoptab, rtx op0, rtx target,
2283 enum mode_class class;
2284 enum machine_mode wider_mode;
2286 rtx last = get_last_insn ();
2289 class = GET_MODE_CLASS (mode);
2292 op0 = force_not_mem (op0);
2294 if (unoptab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
2296 int icode = (int) unoptab->handlers[(int) mode].insn_code;
2297 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
2303 temp = gen_reg_rtx (mode);
2305 if (GET_MODE (xop0) != VOIDmode
2306 && GET_MODE (xop0) != mode0)
2307 xop0 = convert_to_mode (mode0, xop0, unsignedp);
2309 /* Now, if insn doesn't accept our operand, put it into a pseudo. */
2311 if (!insn_data[icode].operand[1].predicate (xop0, mode0))
2312 xop0 = copy_to_mode_reg (mode0, xop0);
2314 if (!insn_data[icode].operand[0].predicate (temp, mode))
2315 temp = gen_reg_rtx (mode);
2317 pat = GEN_FCN (icode) (temp, xop0);
2320 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX
2321 && ! add_equal_note (pat, temp, unoptab->code, xop0, NULL_RTX))
2323 delete_insns_since (last);
2324 return expand_unop (mode, unoptab, op0, NULL_RTX, unsignedp);
2332 delete_insns_since (last);
2335 /* It can't be done in this mode. Can we open-code it in a wider mode? */
2337 /* Widening clz needs special treatment. */
2338 if (unoptab == clz_optab)
2340 temp = widen_clz (mode, op0, target);
2347 if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT)
2348 for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode;
2349 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2351 if (unoptab->handlers[(int) wider_mode].insn_code != CODE_FOR_nothing)
2355 /* For certain operations, we need not actually extend
2356 the narrow operand, as long as we will truncate the
2357 results to the same narrowness. */
2359 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp,
2360 (unoptab == neg_optab
2361 || unoptab == one_cmpl_optab)
2362 && class == MODE_INT);
2364 temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX,
2369 if (class != MODE_INT)
2372 target = gen_reg_rtx (mode);
2373 convert_move (target, temp, 0);
2377 return gen_lowpart (mode, temp);
2380 delete_insns_since (last);
2384 /* These can be done a word at a time. */
2385 if (unoptab == one_cmpl_optab
2386 && class == MODE_INT
2387 && GET_MODE_SIZE (mode) > UNITS_PER_WORD
2388 && unoptab->handlers[(int) word_mode].insn_code != CODE_FOR_nothing)
2393 if (target == 0 || target == op0)
2394 target = gen_reg_rtx (mode);
2398 /* Do the actual arithmetic. */
2399 for (i = 0; i < GET_MODE_BITSIZE (mode) / BITS_PER_WORD; i++)
2401 rtx target_piece = operand_subword (target, i, 1, mode);
2402 rtx x = expand_unop (word_mode, unoptab,
2403 operand_subword_force (op0, i, mode),
2404 target_piece, unsignedp);
2406 if (target_piece != x)
2407 emit_move_insn (target_piece, x);
2410 insns = get_insns ();
2413 emit_no_conflict_block (insns, target, op0, NULL_RTX,
2414 gen_rtx_fmt_e (unoptab->code, mode,
2419 if (unoptab->code == NEG)
2421 /* Try negating floating point values by flipping the sign bit. */
2422 if (class == MODE_FLOAT)
2424 temp = expand_absneg_bit (NEG, mode, op0, target);
2429 /* If there is no negation pattern, and we have no negative zero,
2430 try subtracting from zero. */
2431 if (!HONOR_SIGNED_ZEROS (mode))
2433 temp = expand_binop (mode, (unoptab == negv_optab
2434 ? subv_optab : sub_optab),
2435 CONST0_RTX (mode), op0, target,
2436 unsignedp, OPTAB_DIRECT);
2442 /* Try calculating parity (x) as popcount (x) % 2. */
2443 if (unoptab == parity_optab)
2445 temp = expand_parity (mode, op0, target);
2451 /* Now try a library call in this mode. */
2452 if (unoptab->handlers[(int) mode].libfunc)
2456 enum machine_mode outmode = mode;
2458 /* All of these functions return small values. Thus we choose to
2459 have them return something that isn't a double-word. */
2460 if (unoptab == ffs_optab || unoptab == clz_optab || unoptab == ctz_optab
2461 || unoptab == popcount_optab || unoptab == parity_optab)
2463 = GET_MODE (hard_libcall_value (TYPE_MODE (integer_type_node)));
2467 /* Pass 1 for NO_QUEUE so we don't lose any increments
2468 if the libcall is cse'd or moved. */
2469 value = emit_library_call_value (unoptab->handlers[(int) mode].libfunc,
2470 NULL_RTX, LCT_CONST, outmode,
2472 insns = get_insns ();
2475 target = gen_reg_rtx (outmode);
2476 emit_libcall_block (insns, target, value,
2477 gen_rtx_fmt_e (unoptab->code, mode, op0));
2482 /* It can't be done in this mode. Can we do it in a wider mode? */
2484 if (class == MODE_INT || class == MODE_FLOAT || class == MODE_COMPLEX_FLOAT)
2486 for (wider_mode = GET_MODE_WIDER_MODE (mode); wider_mode != VOIDmode;
2487 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2489 if ((unoptab->handlers[(int) wider_mode].insn_code
2490 != CODE_FOR_nothing)
2491 || unoptab->handlers[(int) wider_mode].libfunc)
2495 /* For certain operations, we need not actually extend
2496 the narrow operand, as long as we will truncate the
2497 results to the same narrowness. */
2499 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp,
2500 (unoptab == neg_optab
2501 || unoptab == one_cmpl_optab)
2502 && class == MODE_INT);
2504 temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX,
2507 /* If we are generating clz using wider mode, adjust the
2509 if (unoptab == clz_optab && temp != 0)
2510 temp = expand_binop (wider_mode, sub_optab, temp,
2511 GEN_INT (GET_MODE_BITSIZE (wider_mode)
2512 - GET_MODE_BITSIZE (mode)),
2513 target, true, OPTAB_DIRECT);
2517 if (class != MODE_INT)
2520 target = gen_reg_rtx (mode);
2521 convert_move (target, temp, 0);
2525 return gen_lowpart (mode, temp);
2528 delete_insns_since (last);
2533 /* One final attempt at implementing negation via subtraction,
2534 this time allowing widening of the operand. */
2535 if (unoptab->code == NEG && !HONOR_SIGNED_ZEROS (mode))
2538 temp = expand_binop (mode,
2539 unoptab == negv_optab ? subv_optab : sub_optab,
2540 CONST0_RTX (mode), op0,
2541 target, unsignedp, OPTAB_LIB_WIDEN);
2549 /* Emit code to compute the absolute value of OP0, with result to
2550 TARGET if convenient. (TARGET may be 0.) The return value says
2551 where the result actually is to be found.
2553 MODE is the mode of the operand; the mode of the result is
2554 different but can be deduced from MODE.
2559 expand_abs_nojump (enum machine_mode mode, rtx op0, rtx target,
2560 int result_unsignedp)
2565 result_unsignedp = 1;
2567 /* First try to do it with a special abs instruction. */
2568 temp = expand_unop (mode, result_unsignedp ? abs_optab : absv_optab,
2573 /* For floating point modes, try clearing the sign bit. */
2574 if (GET_MODE_CLASS (mode) == MODE_FLOAT)
2576 temp = expand_absneg_bit (ABS, mode, op0, target);
2581 /* If we have a MAX insn, we can do this as MAX (x, -x). */
2582 if (smax_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
2583 && !HONOR_SIGNED_ZEROS (mode))
2585 rtx last = get_last_insn ();
2587 temp = expand_unop (mode, neg_optab, op0, NULL_RTX, 0);
2589 temp = expand_binop (mode, smax_optab, op0, temp, target, 0,
2595 delete_insns_since (last);
2598 /* If this machine has expensive jumps, we can do integer absolute
2599 value of X as (((signed) x >> (W-1)) ^ x) - ((signed) x >> (W-1)),
2600 where W is the width of MODE. */
2602 if (GET_MODE_CLASS (mode) == MODE_INT && BRANCH_COST >= 2)
2604 rtx extended = expand_shift (RSHIFT_EXPR, mode, op0,
2605 size_int (GET_MODE_BITSIZE (mode) - 1),
2608 temp = expand_binop (mode, xor_optab, extended, op0, target, 0,
2611 temp = expand_binop (mode, result_unsignedp ? sub_optab : subv_optab,
2612 temp, extended, target, 0, OPTAB_LIB_WIDEN);
2622 expand_abs (enum machine_mode mode, rtx op0, rtx target,
2623 int result_unsignedp, int safe)
2628 result_unsignedp = 1;
2630 temp = expand_abs_nojump (mode, op0, target, result_unsignedp);
2634 /* If that does not win, use conditional jump and negate. */
2636 /* It is safe to use the target if it is the same
2637 as the source if this is also a pseudo register */
2638 if (op0 == target && REG_P (op0)
2639 && REGNO (op0) >= FIRST_PSEUDO_REGISTER)
2642 op1 = gen_label_rtx ();
2643 if (target == 0 || ! safe
2644 || GET_MODE (target) != mode
2645 || (MEM_P (target) && MEM_VOLATILE_P (target))
2647 && REGNO (target) < FIRST_PSEUDO_REGISTER))
2648 target = gen_reg_rtx (mode);
2650 emit_move_insn (target, op0);
2653 /* If this mode is an integer too wide to compare properly,
2654 compare word by word. Rely on CSE to optimize constant cases. */
2655 if (GET_MODE_CLASS (mode) == MODE_INT
2656 && ! can_compare_p (GE, mode, ccp_jump))
2657 do_jump_by_parts_greater_rtx (mode, 0, target, const0_rtx,
2660 do_compare_rtx_and_jump (target, CONST0_RTX (mode), GE, 0, mode,
2661 NULL_RTX, NULL_RTX, op1);
2663 op0 = expand_unop (mode, result_unsignedp ? neg_optab : negv_optab,
2666 emit_move_insn (target, op0);
2672 /* A subroutine of expand_copysign, perform the copysign operation using the
2673 abs and neg primitives advertised to exist on the target. The assumption
2674 is that we have a split register file, and leaving op0 in fp registers,
2675 and not playing with subregs so much, will help the register allocator. */
2678 expand_copysign_absneg (enum machine_mode mode, rtx op0, rtx op1, rtx target,
2679 int bitpos, bool op0_is_abs)
2681 enum machine_mode imode;
2682 HOST_WIDE_INT hi, lo;
2691 op0 = expand_unop (mode, abs_optab, op0, target, 0);
2698 if (target == NULL_RTX)
2699 target = copy_to_reg (op0);
2701 emit_move_insn (target, op0);
2704 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
2706 imode = int_mode_for_mode (mode);
2707 if (imode == BLKmode)
2709 op1 = gen_lowpart (imode, op1);
2714 if (FLOAT_WORDS_BIG_ENDIAN)
2715 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
2717 word = bitpos / BITS_PER_WORD;
2718 bitpos = bitpos % BITS_PER_WORD;
2719 op1 = operand_subword_force (op1, word, mode);
2722 if (bitpos < HOST_BITS_PER_WIDE_INT)
2725 lo = (HOST_WIDE_INT) 1 << bitpos;
2729 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
2733 op1 = expand_binop (imode, and_optab, op1,
2734 immed_double_const (lo, hi, imode),
2735 NULL_RTX, 1, OPTAB_LIB_WIDEN);
2737 label = gen_label_rtx ();
2738 emit_cmp_and_jump_insns (op1, const0_rtx, EQ, NULL_RTX, imode, 1, label);
2740 if (GET_CODE (op0) == CONST_DOUBLE)
2741 op0 = simplify_unary_operation (NEG, mode, op0, mode);
2743 op0 = expand_unop (mode, neg_optab, op0, target, 0);
2745 emit_move_insn (target, op0);
2753 /* A subroutine of expand_copysign, perform the entire copysign operation
2754 with integer bitmasks. BITPOS is the position of the sign bit; OP0_IS_ABS
2755 is true if op0 is known to have its sign bit clear. */
2758 expand_copysign_bit (enum machine_mode mode, rtx op0, rtx op1, rtx target,
2759 int bitpos, bool op0_is_abs)
2761 enum machine_mode imode;
2762 HOST_WIDE_INT hi, lo;
2763 int word, nwords, i;
2766 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
2768 imode = int_mode_for_mode (mode);
2769 if (imode == BLKmode)
2778 if (FLOAT_WORDS_BIG_ENDIAN)
2779 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
2781 word = bitpos / BITS_PER_WORD;
2782 bitpos = bitpos % BITS_PER_WORD;
2783 nwords = (GET_MODE_BITSIZE (mode) + BITS_PER_WORD - 1) / BITS_PER_WORD;
2786 if (bitpos < HOST_BITS_PER_WIDE_INT)
2789 lo = (HOST_WIDE_INT) 1 << bitpos;
2793 hi = (HOST_WIDE_INT) 1 << (bitpos - HOST_BITS_PER_WIDE_INT);
2797 if (target == 0 || target == op0 || target == op1)
2798 target = gen_reg_rtx (mode);
2804 for (i = 0; i < nwords; ++i)
2806 rtx targ_piece = operand_subword (target, i, 1, mode);
2807 rtx op0_piece = operand_subword_force (op0, i, mode);
2812 op0_piece = expand_binop (imode, and_optab, op0_piece,
2813 immed_double_const (~lo, ~hi, imode),
2814 NULL_RTX, 1, OPTAB_LIB_WIDEN);
2816 op1 = expand_binop (imode, and_optab,
2817 operand_subword_force (op1, i, mode),
2818 immed_double_const (lo, hi, imode),
2819 NULL_RTX, 1, OPTAB_LIB_WIDEN);
2821 temp = expand_binop (imode, ior_optab, op0_piece, op1,
2822 targ_piece, 1, OPTAB_LIB_WIDEN);
2823 if (temp != targ_piece)
2824 emit_move_insn (targ_piece, temp);
2827 emit_move_insn (targ_piece, op0_piece);
2830 insns = get_insns ();
2833 emit_no_conflict_block (insns, target, op0, op1, NULL_RTX);
2837 op1 = expand_binop (imode, and_optab, gen_lowpart (imode, op1),
2838 immed_double_const (lo, hi, imode),
2839 NULL_RTX, 1, OPTAB_LIB_WIDEN);
2841 op0 = gen_lowpart (imode, op0);
2843 op0 = expand_binop (imode, and_optab, op0,
2844 immed_double_const (~lo, ~hi, imode),
2845 NULL_RTX, 1, OPTAB_LIB_WIDEN);
2847 temp = expand_binop (imode, ior_optab, op0, op1,
2848 gen_lowpart (imode, target), 1, OPTAB_LIB_WIDEN);
2849 target = lowpart_subreg_maybe_copy (mode, temp, imode);
2855 /* Expand the C99 copysign operation. OP0 and OP1 must be the same
2856 scalar floating point mode. Return NULL if we do not know how to
2857 expand the operation inline. */
2860 expand_copysign (rtx op0, rtx op1, rtx target)
2862 enum machine_mode mode = GET_MODE (op0);
2863 const struct real_format *fmt;
2867 gcc_assert (SCALAR_FLOAT_MODE_P (mode));
2868 gcc_assert (GET_MODE (op1) == mode);
2870 /* First try to do it with a special instruction. */
2871 temp = expand_binop (mode, copysign_optab, op0, op1,
2872 target, 0, OPTAB_DIRECT);
2876 fmt = REAL_MODE_FORMAT (mode);
2877 if (fmt == NULL || !fmt->has_signed_zero)
2881 if (GET_CODE (op0) == CONST_DOUBLE)
2883 if (real_isneg (CONST_DOUBLE_REAL_VALUE (op0)))
2884 op0 = simplify_unary_operation (ABS, mode, op0, mode);
2888 if (fmt->signbit_ro >= 0
2889 && (GET_CODE (op0) == CONST_DOUBLE
2890 || (neg_optab->handlers[mode].insn_code != CODE_FOR_nothing
2891 && abs_optab->handlers[mode].insn_code != CODE_FOR_nothing)))
2893 temp = expand_copysign_absneg (mode, op0, op1, target,
2894 fmt->signbit_ro, op0_is_abs);
2899 if (fmt->signbit_rw < 0)
2901 return expand_copysign_bit (mode, op0, op1, target,
2902 fmt->signbit_rw, op0_is_abs);
2905 /* Generate an instruction whose insn-code is INSN_CODE,
2906 with two operands: an output TARGET and an input OP0.
2907 TARGET *must* be nonzero, and the output is always stored there.
2908 CODE is an rtx code such that (CODE OP0) is an rtx that describes
2909 the value that is stored into TARGET. */
2912 emit_unop_insn (int icode, rtx target, rtx op0, enum rtx_code code)
2915 enum machine_mode mode0 = insn_data[icode].operand[1].mode;
2920 /* Sign and zero extension from memory is often done specially on
2921 RISC machines, so forcing into a register here can pessimize
2923 if (flag_force_mem && code != SIGN_EXTEND && code != ZERO_EXTEND)
2924 op0 = force_not_mem (op0);
2926 /* Now, if insn does not accept our operands, put them into pseudos. */
2928 if (!insn_data[icode].operand[1].predicate (op0, mode0))
2929 op0 = copy_to_mode_reg (mode0, op0);
2931 if (!insn_data[icode].operand[0].predicate (temp, GET_MODE (temp))
2932 || (flag_force_mem && MEM_P (temp)))
2933 temp = gen_reg_rtx (GET_MODE (temp));
2935 pat = GEN_FCN (icode) (temp, op0);
2937 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX && code != UNKNOWN)
2938 add_equal_note (pat, temp, code, op0, NULL_RTX);
2943 emit_move_insn (target, temp);
2946 /* Emit code to perform a series of operations on a multi-word quantity, one
2949 Such a block is preceded by a CLOBBER of the output, consists of multiple
2950 insns, each setting one word of the output, and followed by a SET copying
2951 the output to itself.
2953 Each of the insns setting words of the output receives a REG_NO_CONFLICT
2954 note indicating that it doesn't conflict with the (also multi-word)
2955 inputs. The entire block is surrounded by REG_LIBCALL and REG_RETVAL
2958 INSNS is a block of code generated to perform the operation, not including
2959 the CLOBBER and final copy. All insns that compute intermediate values
2960 are first emitted, followed by the block as described above.
2962 TARGET, OP0, and OP1 are the output and inputs of the operations,
2963 respectively. OP1 may be zero for a unary operation.
2965 EQUIV, if nonzero, is an expression to be placed into a REG_EQUAL note
2968 If TARGET is not a register, INSNS is simply emitted with no special
2969 processing. Likewise if anything in INSNS is not an INSN or if
2970 there is a libcall block inside INSNS.
2972 The final insn emitted is returned. */
2975 emit_no_conflict_block (rtx insns, rtx target, rtx op0, rtx op1, rtx equiv)
2977 rtx prev, next, first, last, insn;
2979 if (!REG_P (target) || reload_in_progress)
2980 return emit_insn (insns);
2982 for (insn = insns; insn; insn = NEXT_INSN (insn))
2983 if (!NONJUMP_INSN_P (insn)
2984 || find_reg_note (insn, REG_LIBCALL, NULL_RTX))
2985 return emit_insn (insns);
2987 /* First emit all insns that do not store into words of the output and remove
2988 these from the list. */
2989 for (insn = insns; insn; insn = next)
2994 next = NEXT_INSN (insn);
2996 /* Some ports (cris) create a libcall regions at their own. We must
2997 avoid any potential nesting of LIBCALLs. */
2998 if ((note = find_reg_note (insn, REG_LIBCALL, NULL)) != NULL)
2999 remove_note (insn, note);
3000 if ((note = find_reg_note (insn, REG_RETVAL, NULL)) != NULL)
3001 remove_note (insn, note);
3003 if (GET_CODE (PATTERN (insn)) == SET || GET_CODE (PATTERN (insn)) == USE
3004 || GET_CODE (PATTERN (insn)) == CLOBBER)
3005 set = PATTERN (insn);
3006 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
3008 for (i = 0; i < XVECLEN (PATTERN (insn), 0); i++)
3009 if (GET_CODE (XVECEXP (PATTERN (insn), 0, i)) == SET)
3011 set = XVECEXP (PATTERN (insn), 0, i);
3018 if (! reg_overlap_mentioned_p (target, SET_DEST (set)))
3020 if (PREV_INSN (insn))
3021 NEXT_INSN (PREV_INSN (insn)) = next;
3026 PREV_INSN (next) = PREV_INSN (insn);
3032 prev = get_last_insn ();
3034 /* Now write the CLOBBER of the output, followed by the setting of each
3035 of the words, followed by the final copy. */
3036 if (target != op0 && target != op1)
3037 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
3039 for (insn = insns; insn; insn = next)
3041 next = NEXT_INSN (insn);
3044 if (op1 && REG_P (op1))
3045 REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_NO_CONFLICT, op1,
3048 if (op0 && REG_P (op0))
3049 REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_NO_CONFLICT, op0,
3053 if (mov_optab->handlers[(int) GET_MODE (target)].insn_code
3054 != CODE_FOR_nothing)
3056 last = emit_move_insn (target, target);
3058 set_unique_reg_note (last, REG_EQUAL, equiv);
3062 last = get_last_insn ();
3064 /* Remove any existing REG_EQUAL note from "last", or else it will
3065 be mistaken for a note referring to the full contents of the
3066 alleged libcall value when found together with the REG_RETVAL
3067 note added below. An existing note can come from an insn
3068 expansion at "last". */
3069 remove_note (last, find_reg_note (last, REG_EQUAL, NULL_RTX));
3073 first = get_insns ();
3075 first = NEXT_INSN (prev);
3077 /* Encapsulate the block so it gets manipulated as a unit. */
3078 REG_NOTES (first) = gen_rtx_INSN_LIST (REG_LIBCALL, last,
3080 REG_NOTES (last) = gen_rtx_INSN_LIST (REG_RETVAL, first, REG_NOTES (last));
3085 /* Emit code to make a call to a constant function or a library call.
3087 INSNS is a list containing all insns emitted in the call.
3088 These insns leave the result in RESULT. Our block is to copy RESULT
3089 to TARGET, which is logically equivalent to EQUIV.
3091 We first emit any insns that set a pseudo on the assumption that these are
3092 loading constants into registers; doing so allows them to be safely cse'ed
3093 between blocks. Then we emit all the other insns in the block, followed by
3094 an insn to move RESULT to TARGET. This last insn will have a REQ_EQUAL
3095 note with an operand of EQUIV.
3097 Moving assignments to pseudos outside of the block is done to improve
3098 the generated code, but is not required to generate correct code,
3099 hence being unable to move an assignment is not grounds for not making
3100 a libcall block. There are two reasons why it is safe to leave these
3101 insns inside the block: First, we know that these pseudos cannot be
3102 used in generated RTL outside the block since they are created for
3103 temporary purposes within the block. Second, CSE will not record the
3104 values of anything set inside a libcall block, so we know they must
3105 be dead at the end of the block.
3107 Except for the first group of insns (the ones setting pseudos), the
3108 block is delimited by REG_RETVAL and REG_LIBCALL notes. */
3111 emit_libcall_block (rtx insns, rtx target, rtx result, rtx equiv)
3113 rtx final_dest = target;
3114 rtx prev, next, first, last, insn;
3116 /* If this is a reg with REG_USERVAR_P set, then it could possibly turn
3117 into a MEM later. Protect the libcall block from this change. */
3118 if (! REG_P (target) || REG_USERVAR_P (target))
3119 target = gen_reg_rtx (GET_MODE (target));
3121 /* If we're using non-call exceptions, a libcall corresponding to an
3122 operation that may trap may also trap. */
3123 if (flag_non_call_exceptions && may_trap_p (equiv))
3125 for (insn = insns; insn; insn = NEXT_INSN (insn))
3128 rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
3130 if (note != 0 && INTVAL (XEXP (note, 0)) <= 0)
3131 remove_note (insn, note);
3135 /* look for any CALL_INSNs in this sequence, and attach a REG_EH_REGION
3136 reg note to indicate that this call cannot throw or execute a nonlocal
3137 goto (unless there is already a REG_EH_REGION note, in which case
3139 for (insn = insns; insn; insn = NEXT_INSN (insn))
3142 rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
3145 XEXP (note, 0) = constm1_rtx;
3147 REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_EH_REGION, constm1_rtx,
3151 /* First emit all insns that set pseudos. Remove them from the list as
3152 we go. Avoid insns that set pseudos which were referenced in previous
3153 insns. These can be generated by move_by_pieces, for example,
3154 to update an address. Similarly, avoid insns that reference things
3155 set in previous insns. */
3157 for (insn = insns; insn; insn = next)
3159 rtx set = single_set (insn);
3162 /* Some ports (cris) create a libcall regions at their own. We must
3163 avoid any potential nesting of LIBCALLs. */
3164 if ((note = find_reg_note (insn, REG_LIBCALL, NULL)) != NULL)
3165 remove_note (insn, note);
3166 if ((note = find_reg_note (insn, REG_RETVAL, NULL)) != NULL)
3167 remove_note (insn, note);
3169 next = NEXT_INSN (insn);
3171 if (set != 0 && REG_P (SET_DEST (set))
3172 && REGNO (SET_DEST (set)) >= FIRST_PSEUDO_REGISTER
3174 || ((! INSN_P(insns)
3175 || ! reg_mentioned_p (SET_DEST (set), PATTERN (insns)))
3176 && ! reg_used_between_p (SET_DEST (set), insns, insn)
3177 && ! modified_in_p (SET_SRC (set), insns)
3178 && ! modified_between_p (SET_SRC (set), insns, insn))))
3180 if (PREV_INSN (insn))
3181 NEXT_INSN (PREV_INSN (insn)) = next;
3186 PREV_INSN (next) = PREV_INSN (insn);
3191 /* Some ports use a loop to copy large arguments onto the stack.
3192 Don't move anything outside such a loop. */
3197 prev = get_last_insn ();
3199 /* Write the remaining insns followed by the final copy. */
3201 for (insn = insns; insn; insn = next)
3203 next = NEXT_INSN (insn);
3208 last = emit_move_insn (target, result);
3209 if (mov_optab->handlers[(int) GET_MODE (target)].insn_code
3210 != CODE_FOR_nothing)
3211 set_unique_reg_note (last, REG_EQUAL, copy_rtx (equiv));
3214 /* Remove any existing REG_EQUAL note from "last", or else it will
3215 be mistaken for a note referring to the full contents of the
3216 libcall value when found together with the REG_RETVAL note added
3217 below. An existing note can come from an insn expansion at
3219 remove_note (last, find_reg_note (last, REG_EQUAL, NULL_RTX));
3222 if (final_dest != target)
3223 emit_move_insn (final_dest, target);
3226 first = get_insns ();
3228 first = NEXT_INSN (prev);
3230 /* Encapsulate the block so it gets manipulated as a unit. */
3231 if (!flag_non_call_exceptions || !may_trap_p (equiv))
3233 /* We can't attach the REG_LIBCALL and REG_RETVAL notes
3234 when the encapsulated region would not be in one basic block,
3235 i.e. when there is a control_flow_insn_p insn between FIRST and LAST.
3237 bool attach_libcall_retval_notes = true;
3238 next = NEXT_INSN (last);
3239 for (insn = first; insn != next; insn = NEXT_INSN (insn))
3240 if (control_flow_insn_p (insn))
3242 attach_libcall_retval_notes = false;
3246 if (attach_libcall_retval_notes)
3248 REG_NOTES (first) = gen_rtx_INSN_LIST (REG_LIBCALL, last,
3250 REG_NOTES (last) = gen_rtx_INSN_LIST (REG_RETVAL, first,
3256 /* Nonzero if we can perform a comparison of mode MODE straightforwardly.
3257 PURPOSE describes how this comparison will be used. CODE is the rtx
3258 comparison code we will be using.
3260 ??? Actually, CODE is slightly weaker than that. A target is still
3261 required to implement all of the normal bcc operations, but not
3262 required to implement all (or any) of the unordered bcc operations. */
3265 can_compare_p (enum rtx_code code, enum machine_mode mode,
3266 enum can_compare_purpose purpose)
3270 if (cmp_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3272 if (purpose == ccp_jump)
3273 return bcc_gen_fctn[(int) code] != NULL;
3274 else if (purpose == ccp_store_flag)
3275 return setcc_gen_code[(int) code] != CODE_FOR_nothing;
3277 /* There's only one cmov entry point, and it's allowed to fail. */
3280 if (purpose == ccp_jump
3281 && cbranch_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3283 if (purpose == ccp_cmov
3284 && cmov_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3286 if (purpose == ccp_store_flag
3287 && cstore_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
3289 mode = GET_MODE_WIDER_MODE (mode);
3291 while (mode != VOIDmode);
3296 /* This function is called when we are going to emit a compare instruction that
3297 compares the values found in *PX and *PY, using the rtl operator COMPARISON.
3299 *PMODE is the mode of the inputs (in case they are const_int).
3300 *PUNSIGNEDP nonzero says that the operands are unsigned;
3301 this matters if they need to be widened.
3303 If they have mode BLKmode, then SIZE specifies the size of both operands.
3305 This function performs all the setup necessary so that the caller only has
3306 to emit a single comparison insn. This setup can involve doing a BLKmode
3307 comparison or emitting a library call to perform the comparison if no insn
3308 is available to handle it.
3309 The values which are passed in through pointers can be modified; the caller
3310 should perform the comparison on the modified values. */
3313 prepare_cmp_insn (rtx *px, rtx *py, enum rtx_code *pcomparison, rtx size,
3314 enum machine_mode *pmode, int *punsignedp,
3315 enum can_compare_purpose purpose)
3317 enum machine_mode mode = *pmode;
3318 rtx x = *px, y = *py;
3319 int unsignedp = *punsignedp;
3320 enum mode_class class;
3322 class = GET_MODE_CLASS (mode);
3324 /* They could both be VOIDmode if both args are immediate constants,
3325 but we should fold that at an earlier stage.
3326 With no special code here, this will call abort,
3327 reminding the programmer to implement such folding. */
3329 if (mode != BLKmode && flag_force_mem)
3331 /* Load duplicate non-volatile operands once. */
3332 if (rtx_equal_p (x, y) && ! volatile_refs_p (x))
3334 x = force_not_mem (x);
3339 x = force_not_mem (x);
3340 y = force_not_mem (y);
3344 /* If we are inside an appropriately-short loop and we are optimizing,
3345 force expensive constants into a register. */
3346 if (CONSTANT_P (x) && optimize
3347 && rtx_cost (x, COMPARE) > COSTS_N_INSNS (1))
3348 x = force_reg (mode, x);
3350 if (CONSTANT_P (y) && optimize
3351 && rtx_cost (y, COMPARE) > COSTS_N_INSNS (1))
3352 y = force_reg (mode, y);
3355 /* Abort if we have a non-canonical comparison. The RTL documentation
3356 states that canonical comparisons are required only for targets which
3358 gcc_assert (!CONSTANT_P (x) || CONSTANT_P (y));
3361 /* Don't let both operands fail to indicate the mode. */
3362 if (GET_MODE (x) == VOIDmode && GET_MODE (y) == VOIDmode)
3363 x = force_reg (mode, x);
3365 /* Handle all BLKmode compares. */
3367 if (mode == BLKmode)
3369 enum machine_mode cmp_mode, result_mode;
3370 enum insn_code cmp_code;
3375 = GEN_INT (MIN (MEM_ALIGN (x), MEM_ALIGN (y)) / BITS_PER_UNIT);
3379 /* Try to use a memory block compare insn - either cmpstr
3380 or cmpmem will do. */
3381 for (cmp_mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3382 cmp_mode != VOIDmode;
3383 cmp_mode = GET_MODE_WIDER_MODE (cmp_mode))
3385 cmp_code = cmpmem_optab[cmp_mode];
3386 if (cmp_code == CODE_FOR_nothing)
3387 cmp_code = cmpstr_optab[cmp_mode];
3388 if (cmp_code == CODE_FOR_nothing)
3391 /* Must make sure the size fits the insn's mode. */
3392 if ((GET_CODE (size) == CONST_INT
3393 && INTVAL (size) >= (1 << GET_MODE_BITSIZE (cmp_mode)))
3394 || (GET_MODE_BITSIZE (GET_MODE (size))
3395 > GET_MODE_BITSIZE (cmp_mode)))
3398 result_mode = insn_data[cmp_code].operand[0].mode;
3399 result = gen_reg_rtx (result_mode);
3400 size = convert_to_mode (cmp_mode, size, 1);
3401 emit_insn (GEN_FCN (cmp_code) (result, x, y, size, opalign));
3405 *pmode = result_mode;
3409 /* Otherwise call a library function, memcmp. */
3410 libfunc = memcmp_libfunc;
3411 length_type = sizetype;
3412 result_mode = TYPE_MODE (integer_type_node);
3413 cmp_mode = TYPE_MODE (length_type);
3414 size = convert_to_mode (TYPE_MODE (length_type), size,
3415 TYPE_UNSIGNED (length_type));
3417 result = emit_library_call_value (libfunc, 0, LCT_PURE_MAKE_BLOCK,
3424 *pmode = result_mode;
3428 /* Don't allow operands to the compare to trap, as that can put the
3429 compare and branch in different basic blocks. */
3430 if (flag_non_call_exceptions)
3433 x = force_reg (mode, x);
3435 y = force_reg (mode, y);
3440 if (can_compare_p (*pcomparison, mode, purpose))
3443 /* Handle a lib call just for the mode we are using. */
3445 if (cmp_optab->handlers[(int) mode].libfunc && class != MODE_FLOAT)
3447 rtx libfunc = cmp_optab->handlers[(int) mode].libfunc;
3450 /* If we want unsigned, and this mode has a distinct unsigned
3451 comparison routine, use that. */
3452 if (unsignedp && ucmp_optab->handlers[(int) mode].libfunc)
3453 libfunc = ucmp_optab->handlers[(int) mode].libfunc;
3455 result = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST_MAKE_BLOCK,
3456 word_mode, 2, x, mode, y, mode);
3460 if (TARGET_LIB_INT_CMP_BIASED)
3461 /* Integer comparison returns a result that must be compared
3462 against 1, so that even if we do an unsigned compare
3463 afterward, there is still a value that can represent the
3464 result "less than". */
3474 gcc_assert (class == MODE_FLOAT);
3475 prepare_float_lib_cmp (px, py, pcomparison, pmode, punsignedp);
3478 /* Before emitting an insn with code ICODE, make sure that X, which is going
3479 to be used for operand OPNUM of the insn, is converted from mode MODE to
3480 WIDER_MODE (UNSIGNEDP determines whether it is an unsigned conversion), and
3481 that it is accepted by the operand predicate. Return the new value. */
3484 prepare_operand (int icode, rtx x, int opnum, enum machine_mode mode,
3485 enum machine_mode wider_mode, int unsignedp)
3487 if (mode != wider_mode)
3488 x = convert_modes (wider_mode, mode, x, unsignedp);
3490 if (!insn_data[icode].operand[opnum].predicate
3491 (x, insn_data[icode].operand[opnum].mode))
3495 x = copy_to_mode_reg (insn_data[icode].operand[opnum].mode, x);
3501 /* Subroutine of emit_cmp_and_jump_insns; this function is called when we know
3502 we can do the comparison.
3503 The arguments are the same as for emit_cmp_and_jump_insns; but LABEL may
3504 be NULL_RTX which indicates that only a comparison is to be generated. */
3507 emit_cmp_and_jump_insn_1 (rtx x, rtx y, enum machine_mode mode,
3508 enum rtx_code comparison, int unsignedp, rtx label)
3510 rtx test = gen_rtx_fmt_ee (comparison, mode, x, y);
3511 enum mode_class class = GET_MODE_CLASS (mode);
3512 enum machine_mode wider_mode = mode;
3514 /* Try combined insns first. */
3517 enum insn_code icode;
3518 PUT_MODE (test, wider_mode);
3522 icode = cbranch_optab->handlers[(int) wider_mode].insn_code;
3524 if (icode != CODE_FOR_nothing
3525 && insn_data[icode].operand[0].predicate (test, wider_mode))
3527 x = prepare_operand (icode, x, 1, mode, wider_mode, unsignedp);
3528 y = prepare_operand (icode, y, 2, mode, wider_mode, unsignedp);
3529 emit_jump_insn (GEN_FCN (icode) (test, x, y, label));
3534 /* Handle some compares against zero. */
3535 icode = (int) tst_optab->handlers[(int) wider_mode].insn_code;
3536 if (y == CONST0_RTX (mode) && icode != CODE_FOR_nothing)
3538 x = prepare_operand (icode, x, 0, mode, wider_mode, unsignedp);
3539 emit_insn (GEN_FCN (icode) (x));
3541 emit_jump_insn (bcc_gen_fctn[(int) comparison] (label));
3545 /* Handle compares for which there is a directly suitable insn. */
3547 icode = (int) cmp_optab->handlers[(int) wider_mode].insn_code;
3548 if (icode != CODE_FOR_nothing)
3550 x = prepare_operand (icode, x, 0, mode, wider_mode, unsignedp);
3551 y = prepare_operand (icode, y, 1, mode, wider_mode, unsignedp);
3552 emit_insn (GEN_FCN (icode) (x, y));
3554 emit_jump_insn (bcc_gen_fctn[(int) comparison] (label));
3558 if (class != MODE_INT && class != MODE_FLOAT
3559 && class != MODE_COMPLEX_FLOAT)
3562 wider_mode = GET_MODE_WIDER_MODE (wider_mode);
3564 while (wider_mode != VOIDmode);
3569 /* Generate code to compare X with Y so that the condition codes are
3570 set and to jump to LABEL if the condition is true. If X is a
3571 constant and Y is not a constant, then the comparison is swapped to
3572 ensure that the comparison RTL has the canonical form.
3574 UNSIGNEDP nonzero says that X and Y are unsigned; this matters if they
3575 need to be widened by emit_cmp_insn. UNSIGNEDP is also used to select
3576 the proper branch condition code.
3578 If X and Y have mode BLKmode, then SIZE specifies the size of both X and Y.
3580 MODE is the mode of the inputs (in case they are const_int).
3582 COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). It will
3583 be passed unchanged to emit_cmp_insn, then potentially converted into an
3584 unsigned variant based on UNSIGNEDP to select a proper jump instruction. */
3587 emit_cmp_and_jump_insns (rtx x, rtx y, enum rtx_code comparison, rtx size,
3588 enum machine_mode mode, int unsignedp, rtx label)
3590 rtx op0 = x, op1 = y;
3592 /* Swap operands and condition to ensure canonical RTL. */
3593 if (swap_commutative_operands_p (x, y))
3595 /* If we're not emitting a branch, this means some caller
3600 comparison = swap_condition (comparison);
3604 /* If OP0 is still a constant, then both X and Y must be constants. Force
3605 X into a register to avoid aborting in emit_cmp_insn due to non-canonical
3607 if (CONSTANT_P (op0))
3608 op0 = force_reg (mode, op0);
3612 comparison = unsigned_condition (comparison);
3614 prepare_cmp_insn (&op0, &op1, &comparison, size, &mode, &unsignedp,
3616 emit_cmp_and_jump_insn_1 (op0, op1, mode, comparison, unsignedp, label);
3619 /* Like emit_cmp_and_jump_insns, but generate only the comparison. */
3622 emit_cmp_insn (rtx x, rtx y, enum rtx_code comparison, rtx size,
3623 enum machine_mode mode, int unsignedp)
3625 emit_cmp_and_jump_insns (x, y, comparison, size, mode, unsignedp, 0);
3628 /* Emit a library call comparison between floating point X and Y.
3629 COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). */
3632 prepare_float_lib_cmp (rtx *px, rtx *py, enum rtx_code *pcomparison,
3633 enum machine_mode *pmode, int *punsignedp)
3635 enum rtx_code comparison = *pcomparison;
3636 enum rtx_code swapped = swap_condition (comparison);
3637 enum rtx_code reversed = reverse_condition_maybe_unordered (comparison);
3640 enum machine_mode orig_mode = GET_MODE (x);
3641 enum machine_mode mode;
3642 rtx value, target, insns, equiv;
3644 bool reversed_p = false;
3646 for (mode = orig_mode; mode != VOIDmode; mode = GET_MODE_WIDER_MODE (mode))
3648 if ((libfunc = code_to_optab[comparison]->handlers[mode].libfunc))
3651 if ((libfunc = code_to_optab[swapped]->handlers[mode].libfunc))
3654 tmp = x; x = y; y = tmp;
3655 comparison = swapped;
3659 if ((libfunc = code_to_optab[reversed]->handlers[mode].libfunc)
3660 && FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, reversed))
3662 comparison = reversed;
3668 gcc_assert (mode != VOIDmode);
3670 if (mode != orig_mode)
3672 x = convert_to_mode (mode, x, 0);
3673 y = convert_to_mode (mode, y, 0);
3676 /* Attach a REG_EQUAL note describing the semantics of the libcall to
3677 the RTL. The allows the RTL optimizers to delete the libcall if the
3678 condition can be determined at compile-time. */
3679 if (comparison == UNORDERED)
3681 rtx temp = simplify_gen_relational (NE, word_mode, mode, x, x);
3682 equiv = simplify_gen_relational (NE, word_mode, mode, y, y);
3683 equiv = simplify_gen_ternary (IF_THEN_ELSE, word_mode, word_mode,
3684 temp, const_true_rtx, equiv);
3688 equiv = simplify_gen_relational (comparison, word_mode, mode, x, y);
3689 if (! FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, comparison))
3691 rtx true_rtx, false_rtx;
3696 true_rtx = const0_rtx;
3697 false_rtx = const_true_rtx;
3701 true_rtx = const_true_rtx;
3702 false_rtx = const0_rtx;
3706 true_rtx = const1_rtx;
3707 false_rtx = const0_rtx;
3711 true_rtx = const0_rtx;
3712 false_rtx = constm1_rtx;
3716 true_rtx = constm1_rtx;
3717 false_rtx = const0_rtx;
3721 true_rtx = const0_rtx;
3722 false_rtx = const1_rtx;
3728 equiv = simplify_gen_ternary (IF_THEN_ELSE, word_mode, word_mode,
3729 equiv, true_rtx, false_rtx);
3734 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
3735 word_mode, 2, x, mode, y, mode);
3736 insns = get_insns ();
3739 target = gen_reg_rtx (word_mode);
3740 emit_libcall_block (insns, target, value, equiv);
3742 if (comparison == UNORDERED
3743 || FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, comparison))
3744 comparison = reversed_p ? EQ : NE;
3749 *pcomparison = comparison;
3753 /* Generate code to indirectly jump to a location given in the rtx LOC. */
3756 emit_indirect_jump (rtx loc)
3758 if (!insn_data[(int) CODE_FOR_indirect_jump].operand[0].predicate
3760 loc = copy_to_mode_reg (Pmode, loc);
3762 emit_jump_insn (gen_indirect_jump (loc));
3766 #ifdef HAVE_conditional_move
3768 /* Emit a conditional move instruction if the machine supports one for that
3769 condition and machine mode.
3771 OP0 and OP1 are the operands that should be compared using CODE. CMODE is
3772 the mode to use should they be constants. If it is VOIDmode, they cannot
3775 OP2 should be stored in TARGET if the comparison is true, otherwise OP3
3776 should be stored there. MODE is the mode to use should they be constants.
3777 If it is VOIDmode, they cannot both be constants.
3779 The result is either TARGET (perhaps modified) or NULL_RTX if the operation
3780 is not supported. */
3783 emit_conditional_move (rtx target, enum rtx_code code, rtx op0, rtx op1,
3784 enum machine_mode cmode, rtx op2, rtx op3,
3785 enum machine_mode mode, int unsignedp)
3787 rtx tem, subtarget, comparison, insn;
3788 enum insn_code icode;
3789 enum rtx_code reversed;
3791 /* If one operand is constant, make it the second one. Only do this
3792 if the other operand is not constant as well. */
3794 if (swap_commutative_operands_p (op0, op1))
3799 code = swap_condition (code);
3802 /* get_condition will prefer to generate LT and GT even if the old
3803 comparison was against zero, so undo that canonicalization here since
3804 comparisons against zero are cheaper. */
3805 if (code == LT && op1 == const1_rtx)
3806 code = LE, op1 = const0_rtx;
3807 else if (code == GT && op1 == constm1_rtx)
3808 code = GE, op1 = const0_rtx;
3810 if (cmode == VOIDmode)
3811 cmode = GET_MODE (op0);
3813 if (swap_commutative_operands_p (op2, op3)
3814 && ((reversed = reversed_comparison_code_parts (code, op0, op1, NULL))
3823 if (mode == VOIDmode)
3824 mode = GET_MODE (op2);
3826 icode = movcc_gen_code[mode];
3828 if (icode == CODE_FOR_nothing)
3833 op2 = force_not_mem (op2);
3834 op3 = force_not_mem (op3);
3838 target = gen_reg_rtx (mode);
3842 /* If the insn doesn't accept these operands, put them in pseudos. */
3844 if (!insn_data[icode].operand[0].predicate
3845 (subtarget, insn_data[icode].operand[0].mode))
3846 subtarget = gen_reg_rtx (insn_data[icode].operand[0].mode);
3848 if (!insn_data[icode].operand[2].predicate
3849 (op2, insn_data[icode].operand[2].mode))
3850 op2 = copy_to_mode_reg (insn_data[icode].operand[2].mode, op2);
3852 if (!insn_data[icode].operand[3].predicate
3853 (op3, insn_data[icode].operand[3].mode))
3854 op3 = copy_to_mode_reg (insn_data[icode].operand[3].mode, op3);
3856 /* Everything should now be in the suitable form, so emit the compare insn
3857 and then the conditional move. */
3860 = compare_from_rtx (op0, op1, code, unsignedp, cmode, NULL_RTX);
3862 /* ??? Watch for const0_rtx (nop) and const_true_rtx (unconditional)? */
3863 /* We can get const0_rtx or const_true_rtx in some circumstances. Just
3864 return NULL and let the caller figure out how best to deal with this
3866 if (GET_CODE (comparison) != code)
3869 insn = GEN_FCN (icode) (subtarget, comparison, op2, op3);
3871 /* If that failed, then give up. */
3877 if (subtarget != target)
3878 convert_move (target, subtarget, 0);
3883 /* Return nonzero if a conditional move of mode MODE is supported.
3885 This function is for combine so it can tell whether an insn that looks
3886 like a conditional move is actually supported by the hardware. If we
3887 guess wrong we lose a bit on optimization, but that's it. */
3888 /* ??? sparc64 supports conditionally moving integers values based on fp
3889 comparisons, and vice versa. How do we handle them? */
3892 can_conditionally_move_p (enum machine_mode mode)
3894 if (movcc_gen_code[mode] != CODE_FOR_nothing)
3900 #endif /* HAVE_conditional_move */
3902 /* Emit a conditional addition instruction if the machine supports one for that
3903 condition and machine mode.
3905 OP0 and OP1 are the operands that should be compared using CODE. CMODE is
3906 the mode to use should they be constants. If it is VOIDmode, they cannot
3909 OP2 should be stored in TARGET if the comparison is true, otherwise OP2+OP3
3910 should be stored there. MODE is the mode to use should they be constants.
3911 If it is VOIDmode, they cannot both be constants.
3913 The result is either TARGET (perhaps modified) or NULL_RTX if the operation
3914 is not supported. */
3917 emit_conditional_add (rtx target, enum rtx_code code, rtx op0, rtx op1,
3918 enum machine_mode cmode, rtx op2, rtx op3,
3919 enum machine_mode mode, int unsignedp)
3921 rtx tem, subtarget, comparison, insn;
3922 enum insn_code icode;
3923 enum rtx_code reversed;
3925 /* If one operand is constant, make it the second one. Only do this
3926 if the other operand is not constant as well. */
3928 if (swap_commutative_operands_p (op0, op1))
3933 code = swap_condition (code);
3936 /* get_condition will prefer to generate LT and GT even if the old
3937 comparison was against zero, so undo that canonicalization here since
3938 comparisons against zero are cheaper. */
3939 if (code == LT && op1 == const1_rtx)
3940 code = LE, op1 = const0_rtx;
3941 else if (code == GT && op1 == constm1_rtx)
3942 code = GE, op1 = const0_rtx;
3944 if (cmode == VOIDmode)
3945 cmode = GET_MODE (op0);
3947 if (swap_commutative_operands_p (op2, op3)
3948 && ((reversed = reversed_comparison_code_parts (code, op0, op1, NULL))
3957 if (mode == VOIDmode)
3958 mode = GET_MODE (op2);
3960 icode = addcc_optab->handlers[(int) mode].insn_code;
3962 if (icode == CODE_FOR_nothing)
3967 op2 = force_not_mem (op2);
3968 op3 = force_not_mem (op3);
3972 target = gen_reg_rtx (mode);
3974 /* If the insn doesn't accept these operands, put them in pseudos. */
3976 if (!insn_data[icode].operand[0].predicate
3977 (target, insn_data[icode].operand[0].mode))
3978 subtarget = gen_reg_rtx (insn_data[icode].operand[0].mode);
3982 if (!insn_data[icode].operand[2].predicate
3983 (op2, insn_data[icode].operand[2].mode))
3984 op2 = copy_to_mode_reg (insn_data[icode].operand[2].mode, op2);
3986 if (!insn_data[icode].operand[3].predicate
3987 (op3, insn_data[icode].operand[3].mode))
3988 op3 = copy_to_mode_reg (insn_data[icode].operand[3].mode, op3);
3990 /* Everything should now be in the suitable form, so emit the compare insn
3991 and then the conditional move. */
3994 = compare_from_rtx (op0, op1, code, unsignedp, cmode, NULL_RTX);
3996 /* ??? Watch for const0_rtx (nop) and const_true_rtx (unconditional)? */
3997 /* We can get const0_rtx or const_true_rtx in some circumstances. Just
3998 return NULL and let the caller figure out how best to deal with this
4000 if (GET_CODE (comparison) != code)
4003 insn = GEN_FCN (icode) (subtarget, comparison, op2, op3);
4005 /* If that failed, then give up. */
4011 if (subtarget != target)
4012 convert_move (target, subtarget, 0);
4017 /* These functions attempt to generate an insn body, rather than
4018 emitting the insn, but if the gen function already emits them, we
4019 make no attempt to turn them back into naked patterns. */
4021 /* Generate and return an insn body to add Y to X. */
4024 gen_add2_insn (rtx x, rtx y)
4026 int icode = (int) add_optab->handlers[(int) GET_MODE (x)].insn_code;
4028 gcc_assert (insn_data[icode].operand[0].predicate
4029 (x, insn_data[icode].operand[0].mode));
4030 gcc_assert (insn_data[icode].operand[1].predicate
4031 (x, insn_data[icode].operand[1].mode));
4032 gcc_assert (insn_data[icode].operand[2].predicate
4033 (y, insn_data[icode].operand[2].mode));
4035 return GEN_FCN (icode) (x, x, y);
4038 /* Generate and return an insn body to add r1 and c,
4039 storing the result in r0. */
4041 gen_add3_insn (rtx r0, rtx r1, rtx c)
4043 int icode = (int) add_optab->handlers[(int) GET_MODE (r0)].insn_code;
4045 if (icode == CODE_FOR_nothing
4046 || !(insn_data[icode].operand[0].predicate
4047 (r0, insn_data[icode].operand[0].mode))
4048 || !(insn_data[icode].operand[1].predicate
4049 (r1, insn_data[icode].operand[1].mode))
4050 || !(insn_data[icode].operand[2].predicate
4051 (c, insn_data[icode].operand[2].mode)))
4054 return GEN_FCN (icode) (r0, r1, c);
4058 have_add2_insn (rtx x, rtx y)
4062 gcc_assert (GET_MODE (x) != VOIDmode);
4064 icode = (int) add_optab->handlers[(int) GET_MODE (x)].insn_code;
4066 if (icode == CODE_FOR_nothing)
4069 if (!(insn_data[icode].operand[0].predicate
4070 (x, insn_data[icode].operand[0].mode))
4071 || !(insn_data[icode].operand[1].predicate
4072 (x, insn_data[icode].operand[1].mode))
4073 || !(insn_data[icode].operand[2].predicate
4074 (y, insn_data[icode].operand[2].mode)))
4080 /* Generate and return an insn body to subtract Y from X. */
4083 gen_sub2_insn (rtx x, rtx y)
4085 int icode = (int) sub_optab->handlers[(int) GET_MODE (x)].insn_code;
4087 gcc_assert (insn_data[icode].operand[0].predicate
4088 (x, insn_data[icode].operand[0].mode));
4089 gcc_assert (insn_data[icode].operand[1].predicate
4090 (x, insn_data[icode].operand[1].mode));
4091 gcc_assert (insn_data[icode].operand[2].predicate
4092 (y, insn_data[icode].operand[2].mode));
4094 return GEN_FCN (icode) (x, x, y);
4097 /* Generate and return an insn body to subtract r1 and c,
4098 storing the result in r0. */
4100 gen_sub3_insn (rtx r0, rtx r1, rtx c)
4102 int icode = (int) sub_optab->handlers[(int) GET_MODE (r0)].insn_code;
4104 if (icode == CODE_FOR_nothing
4105 || !(insn_data[icode].operand[0].predicate
4106 (r0, insn_data[icode].operand[0].mode))
4107 || !(insn_data[icode].operand[1].predicate
4108 (r1, insn_data[icode].operand[1].mode))
4109 || !(insn_data[icode].operand[2].predicate
4110 (c, insn_data[icode].operand[2].mode)))
4113 return GEN_FCN (icode) (r0, r1, c);
4117 have_sub2_insn (rtx x, rtx y)
4121 gcc_assert (GET_MODE (x) != VOIDmode);
4123 icode = (int) sub_optab->handlers[(int) GET_MODE (x)].insn_code;
4125 if (icode == CODE_FOR_nothing)
4128 if (!(insn_data[icode].operand[0].predicate
4129 (x, insn_data[icode].operand[0].mode))
4130 || !(insn_data[icode].operand[1].predicate
4131 (x, insn_data[icode].operand[1].mode))
4132 || !(insn_data[icode].operand[2].predicate
4133 (y, insn_data[icode].operand[2].mode)))
4139 /* Generate the body of an instruction to copy Y into X.
4140 It may be a list of insns, if one insn isn't enough. */
4143 gen_move_insn (rtx x, rtx y)
4148 emit_move_insn_1 (x, y);
4154 /* Return the insn code used to extend FROM_MODE to TO_MODE.
4155 UNSIGNEDP specifies zero-extension instead of sign-extension. If
4156 no such operation exists, CODE_FOR_nothing will be returned. */
4159 can_extend_p (enum machine_mode to_mode, enum machine_mode from_mode,
4163 #ifdef HAVE_ptr_extend
4165 return CODE_FOR_ptr_extend;
4168 tab = unsignedp ? zext_optab : sext_optab;
4169 return tab->handlers[to_mode][from_mode].insn_code;
4172 /* Generate the body of an insn to extend Y (with mode MFROM)
4173 into X (with mode MTO). Do zero-extension if UNSIGNEDP is nonzero. */
4176 gen_extend_insn (rtx x, rtx y, enum machine_mode mto,
4177 enum machine_mode mfrom, int unsignedp)
4179 enum insn_code icode = can_extend_p (mto, mfrom, unsignedp);
4180 return GEN_FCN (icode) (x, y);
4183 /* can_fix_p and can_float_p say whether the target machine
4184 can directly convert a given fixed point type to
4185 a given floating point type, or vice versa.
4186 The returned value is the CODE_FOR_... value to use,
4187 or CODE_FOR_nothing if these modes cannot be directly converted.
4189 *TRUNCP_PTR is set to 1 if it is necessary to output
4190 an explicit FTRUNC insn before the fix insn; otherwise 0. */
4192 static enum insn_code
4193 can_fix_p (enum machine_mode fixmode, enum machine_mode fltmode,
4194 int unsignedp, int *truncp_ptr)
4197 enum insn_code icode;
4199 tab = unsignedp ? ufixtrunc_optab : sfixtrunc_optab;
4200 icode = tab->handlers[fixmode][fltmode].insn_code;
4201 if (icode != CODE_FOR_nothing)
4207 /* FIXME: This requires a port to define both FIX and FTRUNC pattern
4208 for this to work. We need to rework the fix* and ftrunc* patterns
4209 and documentation. */
4210 tab = unsignedp ? ufix_optab : sfix_optab;
4211 icode = tab->handlers[fixmode][fltmode].insn_code;
4212 if (icode != CODE_FOR_nothing
4213 && ftrunc_optab->handlers[fltmode].insn_code != CODE_FOR_nothing)
4220 return CODE_FOR_nothing;
4223 static enum insn_code
4224 can_float_p (enum machine_mode fltmode, enum machine_mode fixmode,
4229 tab = unsignedp ? ufloat_optab : sfloat_optab;
4230 return tab->handlers[fltmode][fixmode].insn_code;
4233 /* Generate code to convert FROM to floating point
4234 and store in TO. FROM must be fixed point and not VOIDmode.
4235 UNSIGNEDP nonzero means regard FROM as unsigned.
4236 Normally this is done by correcting the final value
4237 if it is negative. */
4240 expand_float (rtx to, rtx from, int unsignedp)
4242 enum insn_code icode;
4244 enum machine_mode fmode, imode;
4246 /* Crash now, because we won't be able to decide which mode to use. */
4247 gcc_assert (GET_MODE (from) != VOIDmode);
4249 /* Look for an insn to do the conversion. Do it in the specified
4250 modes if possible; otherwise convert either input, output or both to
4251 wider mode. If the integer mode is wider than the mode of FROM,
4252 we can do the conversion signed even if the input is unsigned. */
4254 for (fmode = GET_MODE (to); fmode != VOIDmode;
4255 fmode = GET_MODE_WIDER_MODE (fmode))
4256 for (imode = GET_MODE (from); imode != VOIDmode;
4257 imode = GET_MODE_WIDER_MODE (imode))
4259 int doing_unsigned = unsignedp;
4261 if (fmode != GET_MODE (to)
4262 && significand_size (fmode) < GET_MODE_BITSIZE (GET_MODE (from)))
4265 icode = can_float_p (fmode, imode, unsignedp);
4266 if (icode == CODE_FOR_nothing && imode != GET_MODE (from) && unsignedp)
4267 icode = can_float_p (fmode, imode, 0), doing_unsigned = 0;
4269 if (icode != CODE_FOR_nothing)
4271 if (imode != GET_MODE (from))
4272 from = convert_to_mode (imode, from, unsignedp);
4274 if (fmode != GET_MODE (to))
4275 target = gen_reg_rtx (fmode);
4277 emit_unop_insn (icode, target, from,
4278 doing_unsigned ? UNSIGNED_FLOAT : FLOAT);
4281 convert_move (to, target, 0);
4286 /* Unsigned integer, and no way to convert directly.
4287 Convert as signed, then conditionally adjust the result. */
4290 rtx label = gen_label_rtx ();
4292 REAL_VALUE_TYPE offset;
4295 from = force_not_mem (from);
4297 /* Look for a usable floating mode FMODE wider than the source and at
4298 least as wide as the target. Using FMODE will avoid rounding woes
4299 with unsigned values greater than the signed maximum value. */
4301 for (fmode = GET_MODE (to); fmode != VOIDmode;
4302 fmode = GET_MODE_WIDER_MODE (fmode))
4303 if (GET_MODE_BITSIZE (GET_MODE (from)) < GET_MODE_BITSIZE (fmode)
4304 && can_float_p (fmode, GET_MODE (from), 0) != CODE_FOR_nothing)
4307 if (fmode == VOIDmode)
4309 /* There is no such mode. Pretend the target is wide enough. */
4310 fmode = GET_MODE (to);
4312 /* Avoid double-rounding when TO is narrower than FROM. */
4313 if ((significand_size (fmode) + 1)
4314 < GET_MODE_BITSIZE (GET_MODE (from)))
4317 rtx neglabel = gen_label_rtx ();
4319 /* Don't use TARGET if it isn't a register, is a hard register,
4320 or is the wrong mode. */
4322 || REGNO (target) < FIRST_PSEUDO_REGISTER
4323 || GET_MODE (target) != fmode)
4324 target = gen_reg_rtx (fmode);
4326 imode = GET_MODE (from);
4327 do_pending_stack_adjust ();
4329 /* Test whether the sign bit is set. */
4330 emit_cmp_and_jump_insns (from, const0_rtx, LT, NULL_RTX, imode,
4333 /* The sign bit is not set. Convert as signed. */
4334 expand_float (target, from, 0);
4335 emit_jump_insn (gen_jump (label));
4338 /* The sign bit is set.
4339 Convert to a usable (positive signed) value by shifting right
4340 one bit, while remembering if a nonzero bit was shifted
4341 out; i.e., compute (from & 1) | (from >> 1). */
4343 emit_label (neglabel);
4344 temp = expand_binop (imode, and_optab, from, const1_rtx,
4345 NULL_RTX, 1, OPTAB_LIB_WIDEN);
4346 temp1 = expand_shift (RSHIFT_EXPR, imode, from, integer_one_node,
4348 temp = expand_binop (imode, ior_optab, temp, temp1, temp, 1,
4350 expand_float (target, temp, 0);
4352 /* Multiply by 2 to undo the shift above. */
4353 temp = expand_binop (fmode, add_optab, target, target,
4354 target, 0, OPTAB_LIB_WIDEN);
4356 emit_move_insn (target, temp);
4358 do_pending_stack_adjust ();
4364 /* If we are about to do some arithmetic to correct for an
4365 unsigned operand, do it in a pseudo-register. */
4367 if (GET_MODE (to) != fmode
4368 || !REG_P (to) || REGNO (to) < FIRST_PSEUDO_REGISTER)
4369 target = gen_reg_rtx (fmode);
4371 /* Convert as signed integer to floating. */
4372 expand_float (target, from, 0);
4374 /* If FROM is negative (and therefore TO is negative),
4375 correct its value by 2**bitwidth. */
4377 do_pending_stack_adjust ();
4378 emit_cmp_and_jump_insns (from, const0_rtx, GE, NULL_RTX, GET_MODE (from),
4382 real_2expN (&offset, GET_MODE_BITSIZE (GET_MODE (from)));
4383 temp = expand_binop (fmode, add_optab, target,
4384 CONST_DOUBLE_FROM_REAL_VALUE (offset, fmode),
4385 target, 0, OPTAB_LIB_WIDEN);
4387 emit_move_insn (target, temp);
4389 do_pending_stack_adjust ();
4394 /* No hardware instruction available; call a library routine. */
4399 convert_optab tab = unsignedp ? ufloat_optab : sfloat_optab;
4401 if (GET_MODE_SIZE (GET_MODE (from)) < GET_MODE_SIZE (SImode))
4402 from = convert_to_mode (SImode, from, unsignedp);
4405 from = force_not_mem (from);
4407 libfunc = tab->handlers[GET_MODE (to)][GET_MODE (from)].libfunc;
4408 gcc_assert (libfunc);
4412 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
4413 GET_MODE (to), 1, from,
4415 insns = get_insns ();
4418 emit_libcall_block (insns, target, value,
4419 gen_rtx_FLOAT (GET_MODE (to), from));
4424 /* Copy result to requested destination
4425 if we have been computing in a temp location. */
4429 if (GET_MODE (target) == GET_MODE (to))
4430 emit_move_insn (to, target);
4432 convert_move (to, target, 0);
4436 /* Generate code to convert FROM to fixed point and store in TO. FROM
4437 must be floating point. */
4440 expand_fix (rtx to, rtx from, int unsignedp)
4442 enum insn_code icode;
4444 enum machine_mode fmode, imode;
4447 /* We first try to find a pair of modes, one real and one integer, at
4448 least as wide as FROM and TO, respectively, in which we can open-code
4449 this conversion. If the integer mode is wider than the mode of TO,
4450 we can do the conversion either signed or unsigned. */
4452 for (fmode = GET_MODE (from); fmode != VOIDmode;
4453 fmode = GET_MODE_WIDER_MODE (fmode))
4454 for (imode = GET_MODE (to); imode != VOIDmode;
4455 imode = GET_MODE_WIDER_MODE (imode))
4457 int doing_unsigned = unsignedp;
4459 icode = can_fix_p (imode, fmode, unsignedp, &must_trunc);
4460 if (icode == CODE_FOR_nothing && imode != GET_MODE (to) && unsignedp)
4461 icode = can_fix_p (imode, fmode, 0, &must_trunc), doing_unsigned = 0;
4463 if (icode != CODE_FOR_nothing)
4465 if (fmode != GET_MODE (from))
4466 from = convert_to_mode (fmode, from, 0);
4470 rtx temp = gen_reg_rtx (GET_MODE (from));
4471 from = expand_unop (GET_MODE (from), ftrunc_optab, from,
4475 if (imode != GET_MODE (to))
4476 target = gen_reg_rtx (imode);
4478 emit_unop_insn (icode, target, from,
4479 doing_unsigned ? UNSIGNED_FIX : FIX);
4481 convert_move (to, target, unsignedp);
4486 /* For an unsigned conversion, there is one more way to do it.
4487 If we have a signed conversion, we generate code that compares
4488 the real value to the largest representable positive number. If if
4489 is smaller, the conversion is done normally. Otherwise, subtract
4490 one plus the highest signed number, convert, and add it back.
4492 We only need to check all real modes, since we know we didn't find
4493 anything with a wider integer mode.
4495 This code used to extend FP value into mode wider than the destination.
4496 This is not needed. Consider, for instance conversion from SFmode
4499 The hot path trought the code is dealing with inputs smaller than 2^63
4500 and doing just the conversion, so there is no bits to lose.
4502 In the other path we know the value is positive in the range 2^63..2^64-1
4503 inclusive. (as for other imput overflow happens and result is undefined)
4504 So we know that the most important bit set in mantissa corresponds to
4505 2^63. The subtraction of 2^63 should not generate any rounding as it
4506 simply clears out that bit. The rest is trivial. */
4508 if (unsignedp && GET_MODE_BITSIZE (GET_MODE (to)) <= HOST_BITS_PER_WIDE_INT)
4509 for (fmode = GET_MODE (from); fmode != VOIDmode;
4510 fmode = GET_MODE_WIDER_MODE (fmode))
4511 if (CODE_FOR_nothing != can_fix_p (GET_MODE (to), fmode, 0,
4515 REAL_VALUE_TYPE offset;
4516 rtx limit, lab1, lab2, insn;
4518 bitsize = GET_MODE_BITSIZE (GET_MODE (to));
4519 real_2expN (&offset, bitsize - 1);
4520 limit = CONST_DOUBLE_FROM_REAL_VALUE (offset, fmode);
4521 lab1 = gen_label_rtx ();
4522 lab2 = gen_label_rtx ();
4525 from = force_not_mem (from);
4527 if (fmode != GET_MODE (from))
4528 from = convert_to_mode (fmode, from, 0);
4530 /* See if we need to do the subtraction. */
4531 do_pending_stack_adjust ();
4532 emit_cmp_and_jump_insns (from, limit, GE, NULL_RTX, GET_MODE (from),
4535 /* If not, do the signed "fix" and branch around fixup code. */
4536 expand_fix (to, from, 0);
4537 emit_jump_insn (gen_jump (lab2));
4540 /* Otherwise, subtract 2**(N-1), convert to signed number,
4541 then add 2**(N-1). Do the addition using XOR since this
4542 will often generate better code. */
4544 target = expand_binop (GET_MODE (from), sub_optab, from, limit,
4545 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4546 expand_fix (to, target, 0);
4547 target = expand_binop (GET_MODE (to), xor_optab, to,
4549 ((HOST_WIDE_INT) 1 << (bitsize - 1),
4551 to, 1, OPTAB_LIB_WIDEN);
4554 emit_move_insn (to, target);
4558 if (mov_optab->handlers[(int) GET_MODE (to)].insn_code
4559 != CODE_FOR_nothing)
4561 /* Make a place for a REG_NOTE and add it. */
4562 insn = emit_move_insn (to, to);
4563 set_unique_reg_note (insn,
4565 gen_rtx_fmt_e (UNSIGNED_FIX,
4573 /* We can't do it with an insn, so use a library call. But first ensure
4574 that the mode of TO is at least as wide as SImode, since those are the
4575 only library calls we know about. */
4577 if (GET_MODE_SIZE (GET_MODE (to)) < GET_MODE_SIZE (SImode))
4579 target = gen_reg_rtx (SImode);
4581 expand_fix (target, from, unsignedp);
4589 convert_optab tab = unsignedp ? ufix_optab : sfix_optab;
4590 libfunc = tab->handlers[GET_MODE (to)][GET_MODE (from)].libfunc;
4591 gcc_assert (libfunc);
4594 from = force_not_mem (from);
4598 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
4599 GET_MODE (to), 1, from,
4601 insns = get_insns ();
4604 emit_libcall_block (insns, target, value,
4605 gen_rtx_fmt_e (unsignedp ? UNSIGNED_FIX : FIX,
4606 GET_MODE (to), from));
4611 if (GET_MODE (to) == GET_MODE (target))
4612 emit_move_insn (to, target);
4614 convert_move (to, target, 0);
4618 /* Report whether we have an instruction to perform the operation
4619 specified by CODE on operands of mode MODE. */
4621 have_insn_for (enum rtx_code code, enum machine_mode mode)
4623 return (code_to_optab[(int) code] != 0
4624 && (code_to_optab[(int) code]->handlers[(int) mode].insn_code
4625 != CODE_FOR_nothing));
4628 /* Create a blank optab. */
4633 optab op = ggc_alloc (sizeof (struct optab));
4634 for (i = 0; i < NUM_MACHINE_MODES; i++)
4636 op->handlers[i].insn_code = CODE_FOR_nothing;
4637 op->handlers[i].libfunc = 0;
4643 static convert_optab
4644 new_convert_optab (void)
4647 convert_optab op = ggc_alloc (sizeof (struct convert_optab));
4648 for (i = 0; i < NUM_MACHINE_MODES; i++)
4649 for (j = 0; j < NUM_MACHINE_MODES; j++)
4651 op->handlers[i][j].insn_code = CODE_FOR_nothing;
4652 op->handlers[i][j].libfunc = 0;
4657 /* Same, but fill in its code as CODE, and write it into the
4658 code_to_optab table. */
4660 init_optab (enum rtx_code code)
4662 optab op = new_optab ();
4664 code_to_optab[(int) code] = op;
4668 /* Same, but fill in its code as CODE, and do _not_ write it into
4669 the code_to_optab table. */
4671 init_optabv (enum rtx_code code)
4673 optab op = new_optab ();
4678 /* Conversion optabs never go in the code_to_optab table. */
4679 static inline convert_optab
4680 init_convert_optab (enum rtx_code code)
4682 convert_optab op = new_convert_optab ();
4687 /* Initialize the libfunc fields of an entire group of entries in some
4688 optab. Each entry is set equal to a string consisting of a leading
4689 pair of underscores followed by a generic operation name followed by
4690 a mode name (downshifted to lowercase) followed by a single character
4691 representing the number of operands for the given operation (which is
4692 usually one of the characters '2', '3', or '4').
4694 OPTABLE is the table in which libfunc fields are to be initialized.
4695 FIRST_MODE is the first machine mode index in the given optab to
4697 LAST_MODE is the last machine mode index in the given optab to
4699 OPNAME is the generic (string) name of the operation.
4700 SUFFIX is the character which specifies the number of operands for
4701 the given generic operation.
4705 init_libfuncs (optab optable, int first_mode, int last_mode,
4706 const char *opname, int suffix)
4709 unsigned opname_len = strlen (opname);
4711 for (mode = first_mode; (int) mode <= (int) last_mode;
4712 mode = (enum machine_mode) ((int) mode + 1))
4714 const char *mname = GET_MODE_NAME (mode);
4715 unsigned mname_len = strlen (mname);
4716 char *libfunc_name = alloca (2 + opname_len + mname_len + 1 + 1);
4723 for (q = opname; *q; )
4725 for (q = mname; *q; q++)
4726 *p++ = TOLOWER (*q);
4730 optable->handlers[(int) mode].libfunc
4731 = init_one_libfunc (ggc_alloc_string (libfunc_name, p - libfunc_name));
4735 /* Initialize the libfunc fields of an entire group of entries in some
4736 optab which correspond to all integer mode operations. The parameters
4737 have the same meaning as similarly named ones for the `init_libfuncs'
4738 routine. (See above). */
4741 init_integral_libfuncs (optab optable, const char *opname, int suffix)
4743 int maxsize = 2*BITS_PER_WORD;
4744 if (maxsize < LONG_LONG_TYPE_SIZE)
4745 maxsize = LONG_LONG_TYPE_SIZE;
4746 init_libfuncs (optable, word_mode,
4747 mode_for_size (maxsize, MODE_INT, 0),
4751 /* Initialize the libfunc fields of an entire group of entries in some
4752 optab which correspond to all real mode operations. The parameters
4753 have the same meaning as similarly named ones for the `init_libfuncs'
4754 routine. (See above). */
4757 init_floating_libfuncs (optab optable, const char *opname, int suffix)
4759 init_libfuncs (optable, MIN_MODE_FLOAT, MAX_MODE_FLOAT, opname, suffix);
4762 /* Initialize the libfunc fields of an entire group of entries of an
4763 inter-mode-class conversion optab. The string formation rules are
4764 similar to the ones for init_libfuncs, above, but instead of having
4765 a mode name and an operand count these functions have two mode names
4766 and no operand count. */
4768 init_interclass_conv_libfuncs (convert_optab tab, const char *opname,
4769 enum mode_class from_class,
4770 enum mode_class to_class)
4772 enum machine_mode first_from_mode = GET_CLASS_NARROWEST_MODE (from_class);
4773 enum machine_mode first_to_mode = GET_CLASS_NARROWEST_MODE (to_class);
4774 size_t opname_len = strlen (opname);
4775 size_t max_mname_len = 0;
4777 enum machine_mode fmode, tmode;
4778 const char *fname, *tname;
4780 char *libfunc_name, *suffix;
4783 for (fmode = first_from_mode;
4785 fmode = GET_MODE_WIDER_MODE (fmode))
4786 max_mname_len = MAX (max_mname_len, strlen (GET_MODE_NAME (fmode)));
4788 for (tmode = first_to_mode;
4790 tmode = GET_MODE_WIDER_MODE (tmode))
4791 max_mname_len = MAX (max_mname_len, strlen (GET_MODE_NAME (tmode)));
4793 libfunc_name = alloca (2 + opname_len + 2*max_mname_len + 1 + 1);
4794 libfunc_name[0] = '_';
4795 libfunc_name[1] = '_';
4796 memcpy (&libfunc_name[2], opname, opname_len);
4797 suffix = libfunc_name + opname_len + 2;
4799 for (fmode = first_from_mode; fmode != VOIDmode;
4800 fmode = GET_MODE_WIDER_MODE (fmode))
4801 for (tmode = first_to_mode; tmode != VOIDmode;
4802 tmode = GET_MODE_WIDER_MODE (tmode))
4804 fname = GET_MODE_NAME (fmode);
4805 tname = GET_MODE_NAME (tmode);
4808 for (q = fname; *q; p++, q++)
4810 for (q = tname; *q; p++, q++)
4815 tab->handlers[tmode][fmode].libfunc
4816 = init_one_libfunc (ggc_alloc_string (libfunc_name,
4821 /* Initialize the libfunc fields of an entire group of entries of an
4822 intra-mode-class conversion optab. The string formation rules are
4823 similar to the ones for init_libfunc, above. WIDENING says whether
4824 the optab goes from narrow to wide modes or vice versa. These functions
4825 have two mode names _and_ an operand count. */
4827 init_intraclass_conv_libfuncs (convert_optab tab, const char *opname,
4828 enum mode_class class, bool widening)
4830 enum machine_mode first_mode = GET_CLASS_NARROWEST_MODE (class);
4831 size_t opname_len = strlen (opname);
4832 size_t max_mname_len = 0;
4834 enum machine_mode nmode, wmode;
4835 const char *nname, *wname;
4837 char *libfunc_name, *suffix;
4840 for (nmode = first_mode; nmode != VOIDmode;
4841 nmode = GET_MODE_WIDER_MODE (nmode))
4842 max_mname_len = MAX (max_mname_len, strlen (GET_MODE_NAME (nmode)));
4844 libfunc_name = alloca (2 + opname_len + 2*max_mname_len + 1 + 1);
4845 libfunc_name[0] = '_';
4846 libfunc_name[1] = '_';
4847 memcpy (&libfunc_name[2], opname, opname_len);
4848 suffix = libfunc_name + opname_len + 2;
4850 for (nmode = first_mode; nmode != VOIDmode;
4851 nmode = GET_MODE_WIDER_MODE (nmode))
4852 for (wmode = GET_MODE_WIDER_MODE (nmode); wmode != VOIDmode;
4853 wmode = GET_MODE_WIDER_MODE (wmode))
4855 nname = GET_MODE_NAME (nmode);
4856 wname = GET_MODE_NAME (wmode);
4859 for (q = widening ? nname : wname; *q; p++, q++)
4861 for (q = widening ? wname : nname; *q; p++, q++)
4867 tab->handlers[widening ? wmode : nmode]
4868 [widening ? nmode : wmode].libfunc
4869 = init_one_libfunc (ggc_alloc_string (libfunc_name,
4876 init_one_libfunc (const char *name)
4880 /* Create a FUNCTION_DECL that can be passed to
4881 targetm.encode_section_info. */
4882 /* ??? We don't have any type information except for this is
4883 a function. Pretend this is "int foo()". */
4884 tree decl = build_decl (FUNCTION_DECL, get_identifier (name),
4885 build_function_type (integer_type_node, NULL_TREE));
4886 DECL_ARTIFICIAL (decl) = 1;
4887 DECL_EXTERNAL (decl) = 1;
4888 TREE_PUBLIC (decl) = 1;
4890 symbol = XEXP (DECL_RTL (decl), 0);
4892 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
4893 are the flags assigned by targetm.encode_section_info. */
4894 SYMBOL_REF_DECL (symbol) = 0;
4899 /* Call this to reset the function entry for one optab (OPTABLE) in mode
4900 MODE to NAME, which should be either 0 or a string constant. */
4902 set_optab_libfunc (optab optable, enum machine_mode mode, const char *name)
4905 optable->handlers[mode].libfunc = init_one_libfunc (name);
4907 optable->handlers[mode].libfunc = 0;
4910 /* Call this to reset the function entry for one conversion optab
4911 (OPTABLE) from mode FMODE to mode TMODE to NAME, which should be
4912 either 0 or a string constant. */
4914 set_conv_libfunc (convert_optab optable, enum machine_mode tmode,
4915 enum machine_mode fmode, const char *name)
4918 optable->handlers[tmode][fmode].libfunc = init_one_libfunc (name);
4920 optable->handlers[tmode][fmode].libfunc = 0;
4923 /* Call this once to initialize the contents of the optabs
4924 appropriately for the current target machine. */
4931 /* Start by initializing all tables to contain CODE_FOR_nothing. */
4933 for (i = 0; i < NUM_RTX_CODE; i++)
4934 setcc_gen_code[i] = CODE_FOR_nothing;
4936 #ifdef HAVE_conditional_move
4937 for (i = 0; i < NUM_MACHINE_MODES; i++)
4938 movcc_gen_code[i] = CODE_FOR_nothing;
4941 for (i = 0; i < NUM_MACHINE_MODES; i++)
4943 vcond_gen_code[i] = CODE_FOR_nothing;
4944 vcondu_gen_code[i] = CODE_FOR_nothing;
4947 add_optab = init_optab (PLUS);
4948 addv_optab = init_optabv (PLUS);
4949 sub_optab = init_optab (MINUS);
4950 subv_optab = init_optabv (MINUS);
4951 smul_optab = init_optab (MULT);
4952 smulv_optab = init_optabv (MULT);
4953 smul_highpart_optab = init_optab (UNKNOWN);
4954 umul_highpart_optab = init_optab (UNKNOWN);
4955 smul_widen_optab = init_optab (UNKNOWN);
4956 umul_widen_optab = init_optab (UNKNOWN);
4957 sdiv_optab = init_optab (DIV);
4958 sdivv_optab = init_optabv (DIV);
4959 sdivmod_optab = init_optab (UNKNOWN);
4960 udiv_optab = init_optab (UDIV);
4961 udivmod_optab = init_optab (UNKNOWN);
4962 smod_optab = init_optab (MOD);
4963 umod_optab = init_optab (UMOD);
4964 fmod_optab = init_optab (UNKNOWN);
4965 drem_optab = init_optab (UNKNOWN);
4966 ftrunc_optab = init_optab (UNKNOWN);
4967 and_optab = init_optab (AND);
4968 ior_optab = init_optab (IOR);
4969 xor_optab = init_optab (XOR);
4970 ashl_optab = init_optab (ASHIFT);
4971 ashr_optab = init_optab (ASHIFTRT);
4972 lshr_optab = init_optab (LSHIFTRT);
4973 rotl_optab = init_optab (ROTATE);
4974 rotr_optab = init_optab (ROTATERT);
4975 smin_optab = init_optab (SMIN);
4976 smax_optab = init_optab (SMAX);
4977 umin_optab = init_optab (UMIN);
4978 umax_optab = init_optab (UMAX);
4979 pow_optab = init_optab (UNKNOWN);
4980 atan2_optab = init_optab (UNKNOWN);
4982 /* These three have codes assigned exclusively for the sake of
4984 mov_optab = init_optab (SET);
4985 movstrict_optab = init_optab (STRICT_LOW_PART);
4986 cmp_optab = init_optab (COMPARE);
4988 ucmp_optab = init_optab (UNKNOWN);
4989 tst_optab = init_optab (UNKNOWN);
4991 eq_optab = init_optab (EQ);
4992 ne_optab = init_optab (NE);
4993 gt_optab = init_optab (GT);
4994 ge_optab = init_optab (GE);
4995 lt_optab = init_optab (LT);
4996 le_optab = init_optab (LE);
4997 unord_optab = init_optab (UNORDERED);
4999 neg_optab = init_optab (NEG);
5000 negv_optab = init_optabv (NEG);
5001 abs_optab = init_optab (ABS);
5002 absv_optab = init_optabv (ABS);
5003 addcc_optab = init_optab (UNKNOWN);
5004 one_cmpl_optab = init_optab (NOT);
5005 ffs_optab = init_optab (FFS);
5006 clz_optab = init_optab (CLZ);
5007 ctz_optab = init_optab (CTZ);
5008 popcount_optab = init_optab (POPCOUNT);
5009 parity_optab = init_optab (PARITY);
5010 sqrt_optab = init_optab (SQRT);
5011 floor_optab = init_optab (UNKNOWN);
5012 lfloor_optab = init_optab (UNKNOWN);
5013 ceil_optab = init_optab (UNKNOWN);
5014 lceil_optab = init_optab (UNKNOWN);
5015 round_optab = init_optab (UNKNOWN);
5016 btrunc_optab = init_optab (UNKNOWN);
5017 nearbyint_optab = init_optab (UNKNOWN);
5018 rint_optab = init_optab (UNKNOWN);
5019 lrint_optab = init_optab (UNKNOWN);
5020 sincos_optab = init_optab (UNKNOWN);
5021 sin_optab = init_optab (UNKNOWN);
5022 asin_optab = init_optab (UNKNOWN);
5023 cos_optab = init_optab (UNKNOWN);
5024 acos_optab = init_optab (UNKNOWN);
5025 exp_optab = init_optab (UNKNOWN);
5026 exp10_optab = init_optab (UNKNOWN);
5027 exp2_optab = init_optab (UNKNOWN);
5028 expm1_optab = init_optab (UNKNOWN);
5029 ldexp_optab = init_optab (UNKNOWN);
5030 logb_optab = init_optab (UNKNOWN);
5031 ilogb_optab = init_optab (UNKNOWN);
5032 log_optab = init_optab (UNKNOWN);
5033 log10_optab = init_optab (UNKNOWN);
5034 log2_optab = init_optab (UNKNOWN);
5035 log1p_optab = init_optab (UNKNOWN);
5036 tan_optab = init_optab (UNKNOWN);
5037 atan_optab = init_optab (UNKNOWN);
5038 copysign_optab = init_optab (UNKNOWN);
5040 strlen_optab = init_optab (UNKNOWN);
5041 cbranch_optab = init_optab (UNKNOWN);
5042 cmov_optab = init_optab (UNKNOWN);
5043 cstore_optab = init_optab (UNKNOWN);
5044 push_optab = init_optab (UNKNOWN);
5046 vec_extract_optab = init_optab (UNKNOWN);
5047 vec_set_optab = init_optab (UNKNOWN);
5048 vec_init_optab = init_optab (UNKNOWN);
5049 vec_realign_load_optab = init_optab (UNKNOWN);
5050 movmisalign_optab = init_optab (UNKNOWN);
5052 powi_optab = init_optab (UNKNOWN);
5055 sext_optab = init_convert_optab (SIGN_EXTEND);
5056 zext_optab = init_convert_optab (ZERO_EXTEND);
5057 trunc_optab = init_convert_optab (TRUNCATE);
5058 sfix_optab = init_convert_optab (FIX);
5059 ufix_optab = init_convert_optab (UNSIGNED_FIX);
5060 sfixtrunc_optab = init_convert_optab (UNKNOWN);
5061 ufixtrunc_optab = init_convert_optab (UNKNOWN);
5062 sfloat_optab = init_convert_optab (FLOAT);
5063 ufloat_optab = init_convert_optab (UNSIGNED_FLOAT);
5065 for (i = 0; i < NUM_MACHINE_MODES; i++)
5067 movmem_optab[i] = CODE_FOR_nothing;
5068 clrmem_optab[i] = CODE_FOR_nothing;
5069 cmpstr_optab[i] = CODE_FOR_nothing;
5070 cmpmem_optab[i] = CODE_FOR_nothing;
5072 sync_add_optab[i] = CODE_FOR_nothing;
5073 sync_sub_optab[i] = CODE_FOR_nothing;
5074 sync_ior_optab[i] = CODE_FOR_nothing;
5075 sync_and_optab[i] = CODE_FOR_nothing;
5076 sync_xor_optab[i] = CODE_FOR_nothing;
5077 sync_nand_optab[i] = CODE_FOR_nothing;
5078 sync_old_add_optab[i] = CODE_FOR_nothing;
5079 sync_old_sub_optab[i] = CODE_FOR_nothing;
5080 sync_old_ior_optab[i] = CODE_FOR_nothing;
5081 sync_old_and_optab[i] = CODE_FOR_nothing;
5082 sync_old_xor_optab[i] = CODE_FOR_nothing;
5083 sync_old_nand_optab[i] = CODE_FOR_nothing;
5084 sync_new_add_optab[i] = CODE_FOR_nothing;
5085 sync_new_sub_optab[i] = CODE_FOR_nothing;
5086 sync_new_ior_optab[i] = CODE_FOR_nothing;
5087 sync_new_and_optab[i] = CODE_FOR_nothing;
5088 sync_new_xor_optab[i] = CODE_FOR_nothing;
5089 sync_new_nand_optab[i] = CODE_FOR_nothing;
5090 sync_compare_and_swap[i] = CODE_FOR_nothing;
5091 sync_compare_and_swap_cc[i] = CODE_FOR_nothing;
5092 sync_lock_test_and_set[i] = CODE_FOR_nothing;
5093 sync_lock_release[i] = CODE_FOR_nothing;
5095 #ifdef HAVE_SECONDARY_RELOADS
5096 reload_in_optab[i] = reload_out_optab[i] = CODE_FOR_nothing;
5100 /* Fill in the optabs with the insns we support. */
5103 /* Initialize the optabs with the names of the library functions. */
5104 init_integral_libfuncs (add_optab, "add", '3');
5105 init_floating_libfuncs (add_optab, "add", '3');
5106 init_integral_libfuncs (addv_optab, "addv", '3');
5107 init_floating_libfuncs (addv_optab, "add", '3');
5108 init_integral_libfuncs (sub_optab, "sub", '3');
5109 init_floating_libfuncs (sub_optab, "sub", '3');
5110 init_integral_libfuncs (subv_optab, "subv", '3');
5111 init_floating_libfuncs (subv_optab, "sub", '3');
5112 init_integral_libfuncs (smul_optab, "mul", '3');
5113 init_floating_libfuncs (smul_optab, "mul", '3');
5114 init_integral_libfuncs (smulv_optab, "mulv", '3');
5115 init_floating_libfuncs (smulv_optab, "mul", '3');
5116 init_integral_libfuncs (sdiv_optab, "div", '3');
5117 init_floating_libfuncs (sdiv_optab, "div", '3');
5118 init_integral_libfuncs (sdivv_optab, "divv", '3');
5119 init_integral_libfuncs (udiv_optab, "udiv", '3');
5120 init_integral_libfuncs (sdivmod_optab, "divmod", '4');
5121 init_integral_libfuncs (udivmod_optab, "udivmod", '4');
5122 init_integral_libfuncs (smod_optab, "mod", '3');
5123 init_integral_libfuncs (umod_optab, "umod", '3');
5124 init_floating_libfuncs (ftrunc_optab, "ftrunc", '2');
5125 init_integral_libfuncs (and_optab, "and", '3');
5126 init_integral_libfuncs (ior_optab, "ior", '3');
5127 init_integral_libfuncs (xor_optab, "xor", '3');
5128 init_integral_libfuncs (ashl_optab, "ashl", '3');
5129 init_integral_libfuncs (ashr_optab, "ashr", '3');
5130 init_integral_libfuncs (lshr_optab, "lshr", '3');
5131 init_integral_libfuncs (smin_optab, "min", '3');
5132 init_floating_libfuncs (smin_optab, "min", '3');
5133 init_integral_libfuncs (smax_optab, "max", '3');
5134 init_floating_libfuncs (smax_optab, "max", '3');
5135 init_integral_libfuncs (umin_optab, "umin", '3');
5136 init_integral_libfuncs (umax_optab, "umax", '3');
5137 init_integral_libfuncs (neg_optab, "neg", '2');
5138 init_floating_libfuncs (neg_optab, "neg", '2');
5139 init_integral_libfuncs (negv_optab, "negv", '2');
5140 init_floating_libfuncs (negv_optab, "neg", '2');
5141 init_integral_libfuncs (one_cmpl_optab, "one_cmpl", '2');
5142 init_integral_libfuncs (ffs_optab, "ffs", '2');
5143 init_integral_libfuncs (clz_optab, "clz", '2');
5144 init_integral_libfuncs (ctz_optab, "ctz", '2');
5145 init_integral_libfuncs (popcount_optab, "popcount", '2');
5146 init_integral_libfuncs (parity_optab, "parity", '2');
5148 /* Comparison libcalls for integers MUST come in pairs,
5150 init_integral_libfuncs (cmp_optab, "cmp", '2');
5151 init_integral_libfuncs (ucmp_optab, "ucmp", '2');
5152 init_floating_libfuncs (cmp_optab, "cmp", '2');
5154 /* EQ etc are floating point only. */
5155 init_floating_libfuncs (eq_optab, "eq", '2');
5156 init_floating_libfuncs (ne_optab, "ne", '2');
5157 init_floating_libfuncs (gt_optab, "gt", '2');
5158 init_floating_libfuncs (ge_optab, "ge", '2');
5159 init_floating_libfuncs (lt_optab, "lt", '2');
5160 init_floating_libfuncs (le_optab, "le", '2');
5161 init_floating_libfuncs (unord_optab, "unord", '2');
5163 init_floating_libfuncs (powi_optab, "powi", '2');
5166 init_interclass_conv_libfuncs (sfloat_optab, "float",
5167 MODE_INT, MODE_FLOAT);
5168 init_interclass_conv_libfuncs (sfix_optab, "fix",
5169 MODE_FLOAT, MODE_INT);
5170 init_interclass_conv_libfuncs (ufix_optab, "fixuns",
5171 MODE_FLOAT, MODE_INT);
5173 /* sext_optab is also used for FLOAT_EXTEND. */
5174 init_intraclass_conv_libfuncs (sext_optab, "extend", MODE_FLOAT, true);
5175 init_intraclass_conv_libfuncs (trunc_optab, "trunc", MODE_FLOAT, false);
5177 /* Use cabs for double complex abs, since systems generally have cabs.
5178 Don't define any libcall for float complex, so that cabs will be used. */
5179 if (complex_double_type_node)
5180 abs_optab->handlers[TYPE_MODE (complex_double_type_node)].libfunc
5181 = init_one_libfunc ("cabs");
5183 /* The ffs function operates on `int'. */
5184 ffs_optab->handlers[(int) mode_for_size (INT_TYPE_SIZE, MODE_INT, 0)].libfunc
5185 = init_one_libfunc ("ffs");
5187 abort_libfunc = init_one_libfunc ("abort");
5188 memcpy_libfunc = init_one_libfunc ("memcpy");
5189 memmove_libfunc = init_one_libfunc ("memmove");
5190 memcmp_libfunc = init_one_libfunc ("memcmp");
5191 memset_libfunc = init_one_libfunc ("memset");
5192 setbits_libfunc = init_one_libfunc ("__setbits");
5194 unwind_resume_libfunc = init_one_libfunc (USING_SJLJ_EXCEPTIONS
5195 ? "_Unwind_SjLj_Resume"
5196 : "_Unwind_Resume");
5197 #ifndef DONT_USE_BUILTIN_SETJMP
5198 setjmp_libfunc = init_one_libfunc ("__builtin_setjmp");
5199 longjmp_libfunc = init_one_libfunc ("__builtin_longjmp");
5201 setjmp_libfunc = init_one_libfunc ("setjmp");
5202 longjmp_libfunc = init_one_libfunc ("longjmp");
5204 unwind_sjlj_register_libfunc = init_one_libfunc ("_Unwind_SjLj_Register");
5205 unwind_sjlj_unregister_libfunc
5206 = init_one_libfunc ("_Unwind_SjLj_Unregister");
5208 /* For function entry/exit instrumentation. */
5209 profile_function_entry_libfunc
5210 = init_one_libfunc ("__cyg_profile_func_enter");
5211 profile_function_exit_libfunc
5212 = init_one_libfunc ("__cyg_profile_func_exit");
5214 gcov_flush_libfunc = init_one_libfunc ("__gcov_flush");
5216 if (HAVE_conditional_trap)
5217 trap_rtx = gen_rtx_fmt_ee (EQ, VOIDmode, NULL_RTX, NULL_RTX);
5219 /* Allow the target to add more libcalls or rename some, etc. */
5220 targetm.init_libfuncs ();
5225 /* Print information about the current contents of the optabs on
5229 debug_optab_libfuncs (void)
5235 /* Dump the arithmetic optabs. */
5236 for (i = 0; i != (int) OTI_MAX; i++)
5237 for (j = 0; j < NUM_MACHINE_MODES; ++j)
5240 struct optab_handlers *h;
5243 h = &o->handlers[j];
5246 gcc_assert (GET_CODE (h->libfunc) = SYMBOL_REF);
5247 fprintf (stderr, "%s\t%s:\t%s\n",
5248 GET_RTX_NAME (o->code),
5250 XSTR (h->libfunc, 0));
5254 /* Dump the conversion optabs. */
5255 for (i = 0; i < (int) CTI_MAX; ++i)
5256 for (j = 0; j < NUM_MACHINE_MODES; ++j)
5257 for (k = 0; k < NUM_MACHINE_MODES; ++k)
5260 struct optab_handlers *h;
5262 o = &convert_optab_table[i];
5263 h = &o->handlers[j][k];
5266 gcc_assert (GET_CODE (h->libfunc) = SYMBOL_REF);
5267 fprintf (stderr, "%s\t%s\t%s:\t%s\n",
5268 GET_RTX_NAME (o->code),
5271 XSTR (h->libfunc, 0));
5279 /* Generate insns to trap with code TCODE if OP1 and OP2 satisfy condition
5280 CODE. Return 0 on failure. */
5283 gen_cond_trap (enum rtx_code code ATTRIBUTE_UNUSED, rtx op1,
5284 rtx op2 ATTRIBUTE_UNUSED, rtx tcode ATTRIBUTE_UNUSED)
5286 enum machine_mode mode = GET_MODE (op1);
5287 enum insn_code icode;
5290 if (!HAVE_conditional_trap)
5293 if (mode == VOIDmode)
5296 icode = cmp_optab->handlers[(int) mode].insn_code;
5297 if (icode == CODE_FOR_nothing)
5301 op1 = prepare_operand (icode, op1, 0, mode, mode, 0);
5302 op2 = prepare_operand (icode, op2, 1, mode, mode, 0);
5308 emit_insn (GEN_FCN (icode) (op1, op2));
5310 PUT_CODE (trap_rtx, code);
5311 gcc_assert (HAVE_conditional_trap);
5312 insn = gen_conditional_trap (trap_rtx, tcode);
5316 insn = get_insns ();
5323 /* Return rtx code for TCODE. Use UNSIGNEDP to select signed
5324 or unsigned operation code. */
5326 static enum rtx_code
5327 get_rtx_code (enum tree_code tcode, bool unsignedp)
5339 code = unsignedp ? LTU : LT;
5342 code = unsignedp ? LEU : LE;
5345 code = unsignedp ? GTU : GT;
5348 code = unsignedp ? GEU : GE;
5351 case UNORDERED_EXPR:
5382 /* Return comparison rtx for COND. Use UNSIGNEDP to select signed or
5383 unsigned operators. Do not generate compare instruction. */
5386 vector_compare_rtx (tree cond, bool unsignedp, enum insn_code icode)
5388 enum rtx_code rcode;
5390 rtx rtx_op0, rtx_op1;
5392 /* This is unlikely. While generating VEC_COND_EXPR, auto vectorizer
5393 ensures that condition is a relational operation. */
5394 gcc_assert (COMPARISON_CLASS_P (cond));
5396 rcode = get_rtx_code (TREE_CODE (cond), unsignedp);
5397 t_op0 = TREE_OPERAND (cond, 0);
5398 t_op1 = TREE_OPERAND (cond, 1);
5400 /* Expand operands. */
5401 rtx_op0 = expand_expr (t_op0, NULL_RTX, TYPE_MODE (TREE_TYPE (t_op0)), 1);
5402 rtx_op1 = expand_expr (t_op1, NULL_RTX, TYPE_MODE (TREE_TYPE (t_op1)), 1);
5404 if (!insn_data[icode].operand[4].predicate (rtx_op0, GET_MODE (rtx_op0))
5405 && GET_MODE (rtx_op0) != VOIDmode)
5406 rtx_op0 = force_reg (GET_MODE (rtx_op0), rtx_op0);
5408 if (!insn_data[icode].operand[5].predicate (rtx_op1, GET_MODE (rtx_op1))
5409 && GET_MODE (rtx_op1) != VOIDmode)
5410 rtx_op1 = force_reg (GET_MODE (rtx_op1), rtx_op1);
5412 return gen_rtx_fmt_ee (rcode, VOIDmode, rtx_op0, rtx_op1);
5415 /* Return insn code for VEC_COND_EXPR EXPR. */
5417 static inline enum insn_code
5418 get_vcond_icode (tree expr, enum machine_mode mode)
5420 enum insn_code icode = CODE_FOR_nothing;
5422 if (TYPE_UNSIGNED (TREE_TYPE (expr)))
5423 icode = vcondu_gen_code[mode];
5425 icode = vcond_gen_code[mode];
5429 /* Return TRUE iff, appropriate vector insns are available
5430 for vector cond expr expr in VMODE mode. */
5433 expand_vec_cond_expr_p (tree expr, enum machine_mode vmode)
5435 if (get_vcond_icode (expr, vmode) == CODE_FOR_nothing)
5440 /* Generate insns for VEC_COND_EXPR. */
5443 expand_vec_cond_expr (tree vec_cond_expr, rtx target)
5445 enum insn_code icode;
5446 rtx comparison, rtx_op1, rtx_op2, cc_op0, cc_op1;
5447 enum machine_mode mode = TYPE_MODE (TREE_TYPE (vec_cond_expr));
5448 bool unsignedp = TYPE_UNSIGNED (TREE_TYPE (vec_cond_expr));
5450 icode = get_vcond_icode (vec_cond_expr, mode);
5451 if (icode == CODE_FOR_nothing)
5455 target = gen_reg_rtx (mode);
5457 /* Get comparison rtx. First expand both cond expr operands. */
5458 comparison = vector_compare_rtx (TREE_OPERAND (vec_cond_expr, 0),
5460 cc_op0 = XEXP (comparison, 0);
5461 cc_op1 = XEXP (comparison, 1);
5462 /* Expand both operands and force them in reg, if required. */
5463 rtx_op1 = expand_expr (TREE_OPERAND (vec_cond_expr, 1),
5464 NULL_RTX, VOIDmode, 1);
5465 if (!insn_data[icode].operand[1].predicate (rtx_op1, mode)
5466 && mode != VOIDmode)
5467 rtx_op1 = force_reg (mode, rtx_op1);
5469 rtx_op2 = expand_expr (TREE_OPERAND (vec_cond_expr, 2),
5470 NULL_RTX, VOIDmode, 1);
5471 if (!insn_data[icode].operand[2].predicate (rtx_op2, mode)
5472 && mode != VOIDmode)
5473 rtx_op2 = force_reg (mode, rtx_op2);
5475 /* Emit instruction! */
5476 emit_insn (GEN_FCN (icode) (target, rtx_op1, rtx_op2,
5477 comparison, cc_op0, cc_op1));
5483 /* This is an internal subroutine of the other compare_and_swap expanders.
5484 MEM, OLD_VAL and NEW_VAL are as you'd expect for a compare-and-swap
5485 operation. TARGET is an optional place to store the value result of
5486 the operation. ICODE is the particular instruction to expand. Return
5487 the result of the operation. */
5490 expand_val_compare_and_swap_1 (rtx mem, rtx old_val, rtx new_val,
5491 rtx target, enum insn_code icode)
5493 enum machine_mode mode = GET_MODE (mem);
5496 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
5497 target = gen_reg_rtx (mode);
5499 if (GET_MODE (old_val) != VOIDmode && GET_MODE (old_val) != mode)
5500 old_val = convert_modes (mode, GET_MODE (old_val), old_val, 1);
5501 if (!insn_data[icode].operand[2].predicate (old_val, mode))
5502 old_val = force_reg (mode, old_val);
5504 if (GET_MODE (new_val) != VOIDmode && GET_MODE (new_val) != mode)
5505 new_val = convert_modes (mode, GET_MODE (new_val), new_val, 1);
5506 if (!insn_data[icode].operand[3].predicate (new_val, mode))
5507 new_val = force_reg (mode, new_val);
5509 insn = GEN_FCN (icode) (target, mem, old_val, new_val);
5510 if (insn == NULL_RTX)
5517 /* Expand a compare-and-swap operation and return its value. */
5520 expand_val_compare_and_swap (rtx mem, rtx old_val, rtx new_val, rtx target)
5522 enum machine_mode mode = GET_MODE (mem);
5523 enum insn_code icode = sync_compare_and_swap[mode];
5525 if (icode == CODE_FOR_nothing)
5528 return expand_val_compare_and_swap_1 (mem, old_val, new_val, target, icode);
5531 /* Expand a compare-and-swap operation and store true into the result if
5532 the operation was successful and false otherwise. Return the result.
5533 Unlike other routines, TARGET is not optional. */
5536 expand_bool_compare_and_swap (rtx mem, rtx old_val, rtx new_val, rtx target)
5538 enum machine_mode mode = GET_MODE (mem);
5539 enum insn_code icode;
5540 rtx subtarget, label0, label1;
5542 /* If the target supports a compare-and-swap pattern that simultaneously
5543 sets some flag for success, then use it. Otherwise use the regular
5544 compare-and-swap and follow that immediately with a compare insn. */
5545 icode = sync_compare_and_swap_cc[mode];
5549 subtarget = expand_val_compare_and_swap_1 (mem, old_val, new_val,
5551 if (subtarget != NULL_RTX)
5555 case CODE_FOR_nothing:
5556 icode = sync_compare_and_swap[mode];
5557 if (icode == CODE_FOR_nothing)
5560 /* Ensure that if old_val == mem, that we're not comparing
5561 against an old value. */
5562 if (GET_CODE (old_val) == MEM)
5563 old_val = force_reg (mode, old_val);
5565 subtarget = expand_val_compare_and_swap_1 (mem, old_val, new_val,
5567 if (subtarget == NULL_RTX)
5570 emit_cmp_insn (subtarget, old_val, EQ, const0_rtx, mode, true);
5573 /* If the target has a sane STORE_FLAG_VALUE, then go ahead and use a
5574 setcc instruction from the beginning. We don't work too hard here,
5575 but it's nice to not be stupid about initial code gen either. */
5576 if (STORE_FLAG_VALUE == 1)
5578 icode = setcc_gen_code[EQ];
5579 if (icode != CODE_FOR_nothing)
5581 enum machine_mode cmode = insn_data[icode].operand[0].mode;
5585 if (!insn_data[icode].operand[0].predicate (target, cmode))
5586 subtarget = gen_reg_rtx (cmode);
5588 insn = GEN_FCN (icode) (subtarget);
5592 if (GET_MODE (target) != GET_MODE (subtarget))
5594 convert_move (target, subtarget, 1);
5602 /* Without an appropriate setcc instruction, use a set of branches to
5603 get 1 and 0 stored into target. Presumably if the target has a
5604 STORE_FLAG_VALUE that isn't 1, then this will get cleaned up by ifcvt. */
5606 label0 = gen_label_rtx ();
5607 label1 = gen_label_rtx ();
5609 emit_jump_insn (bcc_gen_fctn[EQ] (label0));
5610 emit_move_insn (target, const0_rtx);
5611 emit_jump_insn (gen_jump (label1));
5612 emit_label (label0);
5613 emit_move_insn (target, const1_rtx);
5614 emit_label (label1);
5619 /* This is a helper function for the other atomic operations. This function
5620 emits a loop that contains SEQ that iterates until a compare-and-swap
5621 operation at the end succeeds. MEM is the memory to be modified. SEQ is
5622 a set of instructions that takes a value from OLD_REG as an input and
5623 produces a value in NEW_REG as an output. Before SEQ, OLD_REG will be
5624 set to the current contents of MEM. After SEQ, a compare-and-swap will
5625 attempt to update MEM with NEW_REG. The function returns true when the
5626 loop was generated successfully. */
5629 expand_compare_and_swap_loop (rtx mem, rtx old_reg, rtx new_reg, rtx seq)
5631 enum machine_mode mode = GET_MODE (mem);
5632 enum insn_code icode;
5633 rtx label, subtarget;
5635 /* The loop we want to generate looks like
5640 old_reg = compare-and-swap(mem, old_reg, new_reg)
5641 if (old_reg != new_reg)
5644 Note that we only do the plain load from memory once. Subsequent
5645 iterations use the value loaded by the compare-and-swap pattern. */
5647 label = gen_label_rtx ();
5649 emit_move_insn (old_reg, mem);
5654 /* If the target supports a compare-and-swap pattern that simultaneously
5655 sets some flag for success, then use it. Otherwise use the regular
5656 compare-and-swap and follow that immediately with a compare insn. */
5657 icode = sync_compare_and_swap_cc[mode];
5661 subtarget = expand_val_compare_and_swap_1 (mem, old_reg, new_reg,
5663 if (subtarget != NULL_RTX)
5667 case CODE_FOR_nothing:
5668 icode = sync_compare_and_swap[mode];
5669 if (icode == CODE_FOR_nothing)
5672 subtarget = expand_val_compare_and_swap_1 (mem, old_reg, new_reg,
5674 if (subtarget == NULL_RTX)
5677 emit_cmp_insn (subtarget, old_reg, EQ, const0_rtx, mode, true);
5680 /* ??? Mark this jump predicted not taken? */
5681 emit_jump_insn (bcc_gen_fctn[NE] (label));
5686 /* This function generates the atomic operation MEM CODE= VAL. In this
5687 case, we do not care about any resulting value. Returns NULL if we
5688 cannot generate the operation. */
5691 expand_sync_operation (rtx mem, rtx val, enum rtx_code code)
5693 enum machine_mode mode = GET_MODE (mem);
5694 enum insn_code icode;
5697 /* Look to see if the target supports the operation directly. */
5701 icode = sync_add_optab[mode];
5704 icode = sync_ior_optab[mode];
5707 icode = sync_xor_optab[mode];
5710 icode = sync_and_optab[mode];
5713 icode = sync_nand_optab[mode];
5717 icode = sync_sub_optab[mode];
5718 if (icode == CODE_FOR_nothing)
5720 icode = sync_add_optab[mode];
5721 if (icode != CODE_FOR_nothing)
5723 val = expand_simple_unop (mode, NEG, val, NULL_RTX, 1);
5733 /* Generate the direct operation, if present. */
5734 if (icode != CODE_FOR_nothing)
5736 if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)
5737 val = convert_modes (mode, GET_MODE (val), val, 1);
5738 if (!insn_data[icode].operand[1].predicate (val, mode))
5739 val = force_reg (mode, val);
5741 insn = GEN_FCN (icode) (mem, val);
5749 /* Failing that, generate a compare-and-swap loop in which we perform the
5750 operation with normal arithmetic instructions. */
5751 if (sync_compare_and_swap[mode] != CODE_FOR_nothing)
5753 rtx t0 = gen_reg_rtx (mode), t1;
5760 t1 = expand_simple_unop (mode, NOT, t1, NULL_RTX, true);
5763 t1 = expand_simple_binop (mode, code, t1, val, NULL_RTX,
5764 true, OPTAB_LIB_WIDEN);
5766 insn = get_insns ();
5769 if (t1 != NULL && expand_compare_and_swap_loop (mem, t0, t1, insn))
5776 /* This function generates the atomic operation MEM CODE= VAL. In this
5777 case, we do care about the resulting value: if AFTER is true then
5778 return the value MEM holds after the operation, if AFTER is false
5779 then return the value MEM holds before the operation. TARGET is an
5780 optional place for the result value to be stored. */
5783 expand_sync_fetch_operation (rtx mem, rtx val, enum rtx_code code,
5784 bool after, rtx target)
5786 enum machine_mode mode = GET_MODE (mem);
5787 enum insn_code old_code, new_code, icode;
5791 /* Look to see if the target supports the operation directly. */
5795 old_code = sync_old_add_optab[mode];
5796 new_code = sync_new_add_optab[mode];
5799 old_code = sync_old_ior_optab[mode];
5800 new_code = sync_new_ior_optab[mode];
5803 old_code = sync_old_xor_optab[mode];
5804 new_code = sync_new_xor_optab[mode];
5807 old_code = sync_old_and_optab[mode];
5808 new_code = sync_new_and_optab[mode];
5811 old_code = sync_old_nand_optab[mode];
5812 new_code = sync_new_nand_optab[mode];
5816 old_code = sync_old_sub_optab[mode];
5817 new_code = sync_new_sub_optab[mode];
5818 if (old_code == CODE_FOR_nothing && new_code == CODE_FOR_nothing)
5820 old_code = sync_old_add_optab[mode];
5821 new_code = sync_new_add_optab[mode];
5822 if (old_code != CODE_FOR_nothing || new_code != CODE_FOR_nothing)
5824 val = expand_simple_unop (mode, NEG, val, NULL_RTX, 1);
5834 /* If the target does supports the proper new/old operation, great. But
5835 if we only support the opposite old/new operation, check to see if we
5836 can compensate. In the case in which the old value is supported, then
5837 we can always perform the operation again with normal arithmetic. In
5838 the case in which the new value is supported, then we can only handle
5839 this in the case the operation is reversible. */
5844 if (icode == CODE_FOR_nothing)
5847 if (icode != CODE_FOR_nothing)
5854 if (icode == CODE_FOR_nothing
5855 && (code == PLUS || code == MINUS || code == XOR))
5858 if (icode != CODE_FOR_nothing)
5863 /* If we found something supported, great. */
5864 if (icode != CODE_FOR_nothing)
5866 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
5867 target = gen_reg_rtx (mode);
5869 if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)
5870 val = convert_modes (mode, GET_MODE (val), val, 1);
5871 if (!insn_data[icode].operand[2].predicate (val, mode))
5872 val = force_reg (mode, val);
5874 insn = GEN_FCN (icode) (target, mem, val);
5879 /* If we need to compensate for using an operation with the
5880 wrong return value, do so now. */
5887 else if (code == MINUS)
5892 target = expand_simple_unop (mode, NOT, target, NULL_RTX, true);
5893 target = expand_simple_binop (mode, code, target, val, NULL_RTX,
5894 true, OPTAB_LIB_WIDEN);
5901 /* Failing that, generate a compare-and-swap loop in which we perform the
5902 operation with normal arithmetic instructions. */
5903 if (sync_compare_and_swap[mode] != CODE_FOR_nothing)
5905 rtx t0 = gen_reg_rtx (mode), t1;
5907 if (!target || !register_operand (target, mode))
5908 target = gen_reg_rtx (mode);
5913 emit_move_insn (target, t0);
5917 t1 = expand_simple_unop (mode, NOT, t1, NULL_RTX, true);
5920 t1 = expand_simple_binop (mode, code, t1, val, NULL_RTX,
5921 true, OPTAB_LIB_WIDEN);
5923 emit_move_insn (target, t1);
5925 insn = get_insns ();
5928 if (t1 != NULL && expand_compare_and_swap_loop (mem, t0, t1, insn))
5935 /* This function expands a test-and-set operation. Ideally we atomically
5936 store VAL in MEM and return the previous value in MEM. Some targets
5937 may not support this operation and only support VAL with the constant 1;
5938 in this case while the return value will be 0/1, but the exact value
5939 stored in MEM is target defined. TARGET is an option place to stick
5940 the return value. */
5943 expand_sync_lock_test_and_set (rtx mem, rtx val, rtx target)
5945 enum machine_mode mode = GET_MODE (mem);
5946 enum insn_code icode;
5949 /* If the target supports the test-and-set directly, great. */
5950 icode = sync_lock_test_and_set[mode];
5951 if (icode != CODE_FOR_nothing)
5953 if (!target || !insn_data[icode].operand[0].predicate (target, mode))
5954 target = gen_reg_rtx (mode);
5956 if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)
5957 val = convert_modes (mode, GET_MODE (val), val, 1);
5958 if (!insn_data[icode].operand[2].predicate (val, mode))
5959 val = force_reg (mode, val);
5961 insn = GEN_FCN (icode) (target, mem, val);
5969 /* Otherwise, use a compare-and-swap loop for the exchange. */
5970 if (sync_compare_and_swap[mode] != CODE_FOR_nothing)
5972 if (!target || !register_operand (target, mode))
5973 target = gen_reg_rtx (mode);
5974 if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)
5975 val = convert_modes (mode, GET_MODE (val), val, 1);
5976 if (expand_compare_and_swap_loop (mem, target, val, NULL_RTX))
5983 #include "gt-optabs.h"