1 /* Expand the basic unary and binary arithmetic operations, for GNU compiler.
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
35 #include "diagnostic-core.h"
37 /* Include insn-config.h before expr.h so that HAVE_conditional_move
38 is properly defined. */
39 #include "stor-layout.h"
44 #include "optabs-tree.h"
47 static void prepare_float_lib_cmp (rtx, rtx, enum rtx_code, rtx *,
49 static rtx expand_unop_direct (machine_mode, optab, rtx, rtx, int);
50 static void emit_libcall_block_1 (rtx_insn *, rtx, rtx, rtx, bool);
52 /* Debug facility for use in GDB. */
53 void debug_optab_libfuncs (void);
55 /* Add a REG_EQUAL note to the last insn in INSNS. TARGET is being set to
56 the result of operation CODE applied to OP0 (and OP1 if it is a binary
59 If the last insn does not set TARGET, don't do anything, but return 1.
61 If the last insn or a previous insn sets TARGET and TARGET is one of OP0
62 or OP1, don't add the REG_EQUAL note but return 0. Our caller can then
63 try again, ensuring that TARGET is not one of the operands. */
66 add_equal_note (rtx_insn *insns, rtx target, enum rtx_code code, rtx op0, rtx op1)
72 gcc_assert (insns && INSN_P (insns) && NEXT_INSN (insns));
74 if (GET_RTX_CLASS (code) != RTX_COMM_ARITH
75 && GET_RTX_CLASS (code) != RTX_BIN_ARITH
76 && GET_RTX_CLASS (code) != RTX_COMM_COMPARE
77 && GET_RTX_CLASS (code) != RTX_COMPARE
78 && GET_RTX_CLASS (code) != RTX_UNARY)
81 if (GET_CODE (target) == ZERO_EXTRACT)
84 for (last_insn = insns;
85 NEXT_INSN (last_insn) != NULL_RTX;
86 last_insn = NEXT_INSN (last_insn))
89 /* If TARGET is in OP0 or OP1, punt. We'd end up with a note referencing
90 a value changing in the insn, so the note would be invalid for CSE. */
91 if (reg_overlap_mentioned_p (target, op0)
92 || (op1 && reg_overlap_mentioned_p (target, op1)))
95 && (rtx_equal_p (target, op0)
96 || (op1 && rtx_equal_p (target, op1))))
98 /* For MEM target, with MEM = MEM op X, prefer no REG_EQUAL note
99 over expanding it as temp = MEM op X, MEM = temp. If the target
100 supports MEM = MEM op X instructions, it is sometimes too hard
101 to reconstruct that form later, especially if X is also a memory,
102 and due to multiple occurrences of addresses the address might
103 be forced into register unnecessarily.
104 Note that not emitting the REG_EQUIV note might inhibit
105 CSE in some cases. */
106 set = single_set (last_insn);
108 && GET_CODE (SET_SRC (set)) == code
109 && MEM_P (SET_DEST (set))
110 && (rtx_equal_p (SET_DEST (set), XEXP (SET_SRC (set), 0))
111 || (op1 && rtx_equal_p (SET_DEST (set),
112 XEXP (SET_SRC (set), 1)))))
118 set = set_for_reg_notes (last_insn);
122 if (! rtx_equal_p (SET_DEST (set), target)
123 /* For a STRICT_LOW_PART, the REG_NOTE applies to what is inside it. */
124 && (GET_CODE (SET_DEST (set)) != STRICT_LOW_PART
125 || ! rtx_equal_p (XEXP (SET_DEST (set), 0), target)))
128 if (GET_RTX_CLASS (code) == RTX_UNARY)
138 if (GET_MODE (op0) != VOIDmode && GET_MODE (target) != GET_MODE (op0))
140 note = gen_rtx_fmt_e (code, GET_MODE (op0), copy_rtx (op0));
141 if (GET_MODE_SIZE (GET_MODE (op0))
142 > GET_MODE_SIZE (GET_MODE (target)))
143 note = simplify_gen_unary (TRUNCATE, GET_MODE (target),
144 note, GET_MODE (op0));
146 note = simplify_gen_unary (ZERO_EXTEND, GET_MODE (target),
147 note, GET_MODE (op0));
152 note = gen_rtx_fmt_e (code, GET_MODE (target), copy_rtx (op0));
156 note = gen_rtx_fmt_ee (code, GET_MODE (target), copy_rtx (op0), copy_rtx (op1));
158 set_unique_reg_note (last_insn, REG_EQUAL, note);
163 /* Given two input operands, OP0 and OP1, determine what the correct from_mode
164 for a widening operation would be. In most cases this would be OP0, but if
165 that's a constant it'll be VOIDmode, which isn't useful. */
168 widened_mode (machine_mode to_mode, rtx op0, rtx op1)
170 machine_mode m0 = GET_MODE (op0);
171 machine_mode m1 = GET_MODE (op1);
174 if (m0 == VOIDmode && m1 == VOIDmode)
176 else if (m0 == VOIDmode || GET_MODE_SIZE (m0) < GET_MODE_SIZE (m1))
181 if (GET_MODE_SIZE (result) > GET_MODE_SIZE (to_mode))
187 /* Widen OP to MODE and return the rtx for the widened operand. UNSIGNEDP
188 says whether OP is signed or unsigned. NO_EXTEND is nonzero if we need
189 not actually do a sign-extend or zero-extend, but can leave the
190 higher-order bits of the result rtx undefined, for example, in the case
191 of logical operations, but not right shifts. */
194 widen_operand (rtx op, machine_mode mode, machine_mode oldmode,
195 int unsignedp, int no_extend)
199 /* If we don't have to extend and this is a constant, return it. */
200 if (no_extend && GET_MODE (op) == VOIDmode)
203 /* If we must extend do so. If OP is a SUBREG for a promoted object, also
204 extend since it will be more efficient to do so unless the signedness of
205 a promoted object differs from our extension. */
207 || (GET_CODE (op) == SUBREG && SUBREG_PROMOTED_VAR_P (op)
208 && SUBREG_CHECK_PROMOTED_SIGN (op, unsignedp)))
209 return convert_modes (mode, oldmode, op, unsignedp);
211 /* If MODE is no wider than a single word, we return a lowpart or paradoxical
213 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
214 return gen_lowpart (mode, force_reg (GET_MODE (op), op));
216 /* Otherwise, get an object of MODE, clobber it, and set the low-order
219 result = gen_reg_rtx (mode);
220 emit_clobber (result);
221 emit_move_insn (gen_lowpart (GET_MODE (op), result), op);
225 /* Expand vector widening operations.
227 There are two different classes of operations handled here:
228 1) Operations whose result is wider than all the arguments to the operation.
229 Examples: VEC_UNPACK_HI/LO_EXPR, VEC_WIDEN_MULT_HI/LO_EXPR
230 In this case OP0 and optionally OP1 would be initialized,
231 but WIDE_OP wouldn't (not relevant for this case).
232 2) Operations whose result is of the same size as the last argument to the
233 operation, but wider than all the other arguments to the operation.
234 Examples: WIDEN_SUM_EXPR, VEC_DOT_PROD_EXPR.
235 In the case WIDE_OP, OP0 and optionally OP1 would be initialized.
237 E.g, when called to expand the following operations, this is how
238 the arguments will be initialized:
240 widening-sum 2 oprnd0 - oprnd1
241 widening-dot-product 3 oprnd0 oprnd1 oprnd2
242 widening-mult 2 oprnd0 oprnd1 -
243 type-promotion (vec-unpack) 1 oprnd0 - - */
246 expand_widen_pattern_expr (sepops ops, rtx op0, rtx op1, rtx wide_op,
247 rtx target, int unsignedp)
249 struct expand_operand eops[4];
250 tree oprnd0, oprnd1, oprnd2;
251 machine_mode wmode = VOIDmode, tmode0, tmode1 = VOIDmode;
252 optab widen_pattern_optab;
253 enum insn_code icode;
254 int nops = TREE_CODE_LENGTH (ops->code);
258 tmode0 = TYPE_MODE (TREE_TYPE (oprnd0));
259 widen_pattern_optab =
260 optab_for_tree_code (ops->code, TREE_TYPE (oprnd0), optab_default);
261 if (ops->code == WIDEN_MULT_PLUS_EXPR
262 || ops->code == WIDEN_MULT_MINUS_EXPR)
263 icode = find_widening_optab_handler (widen_pattern_optab,
264 TYPE_MODE (TREE_TYPE (ops->op2)),
267 icode = optab_handler (widen_pattern_optab, tmode0);
268 gcc_assert (icode != CODE_FOR_nothing);
273 tmode1 = TYPE_MODE (TREE_TYPE (oprnd1));
276 /* The last operand is of a wider mode than the rest of the operands. */
281 gcc_assert (tmode1 == tmode0);
284 wmode = TYPE_MODE (TREE_TYPE (oprnd2));
288 create_output_operand (&eops[op++], target, TYPE_MODE (ops->type));
289 create_convert_operand_from (&eops[op++], op0, tmode0, unsignedp);
291 create_convert_operand_from (&eops[op++], op1, tmode1, unsignedp);
293 create_convert_operand_from (&eops[op++], wide_op, wmode, unsignedp);
294 expand_insn (icode, op, eops);
295 return eops[0].value;
298 /* Generate code to perform an operation specified by TERNARY_OPTAB
299 on operands OP0, OP1 and OP2, with result having machine-mode MODE.
301 UNSIGNEDP is for the case where we have to widen the operands
302 to perform the operation. It says to use zero-extension.
304 If TARGET is nonzero, the value
305 is generated there, if it is convenient to do so.
306 In all cases an rtx is returned for the locus of the value;
307 this may or may not be TARGET. */
310 expand_ternary_op (machine_mode mode, optab ternary_optab, rtx op0,
311 rtx op1, rtx op2, rtx target, int unsignedp)
313 struct expand_operand ops[4];
314 enum insn_code icode = optab_handler (ternary_optab, mode);
316 gcc_assert (optab_handler (ternary_optab, mode) != CODE_FOR_nothing);
318 create_output_operand (&ops[0], target, mode);
319 create_convert_operand_from (&ops[1], op0, mode, unsignedp);
320 create_convert_operand_from (&ops[2], op1, mode, unsignedp);
321 create_convert_operand_from (&ops[3], op2, mode, unsignedp);
322 expand_insn (icode, 4, ops);
327 /* Like expand_binop, but return a constant rtx if the result can be
328 calculated at compile time. The arguments and return value are
329 otherwise the same as for expand_binop. */
332 simplify_expand_binop (machine_mode mode, optab binoptab,
333 rtx op0, rtx op1, rtx target, int unsignedp,
334 enum optab_methods methods)
336 if (CONSTANT_P (op0) && CONSTANT_P (op1))
338 rtx x = simplify_binary_operation (optab_to_code (binoptab),
344 return expand_binop (mode, binoptab, op0, op1, target, unsignedp, methods);
347 /* Like simplify_expand_binop, but always put the result in TARGET.
348 Return true if the expansion succeeded. */
351 force_expand_binop (machine_mode mode, optab binoptab,
352 rtx op0, rtx op1, rtx target, int unsignedp,
353 enum optab_methods methods)
355 rtx x = simplify_expand_binop (mode, binoptab, op0, op1,
356 target, unsignedp, methods);
360 emit_move_insn (target, x);
364 /* Create a new vector value in VMODE with all elements set to OP. The
365 mode of OP must be the element mode of VMODE. If OP is a constant,
366 then the return value will be a constant. */
369 expand_vector_broadcast (machine_mode vmode, rtx op)
371 enum insn_code icode;
376 gcc_checking_assert (VECTOR_MODE_P (vmode));
378 n = GET_MODE_NUNITS (vmode);
379 vec = rtvec_alloc (n);
380 for (i = 0; i < n; ++i)
381 RTVEC_ELT (vec, i) = op;
384 return gen_rtx_CONST_VECTOR (vmode, vec);
386 /* ??? If the target doesn't have a vec_init, then we have no easy way
387 of performing this operation. Most of this sort of generic support
388 is hidden away in the vector lowering support in gimple. */
389 icode = optab_handler (vec_init_optab, vmode);
390 if (icode == CODE_FOR_nothing)
393 ret = gen_reg_rtx (vmode);
394 emit_insn (GEN_FCN (icode) (ret, gen_rtx_PARALLEL (vmode, vec)));
399 /* This subroutine of expand_doubleword_shift handles the cases in which
400 the effective shift value is >= BITS_PER_WORD. The arguments and return
401 value are the same as for the parent routine, except that SUPERWORD_OP1
402 is the shift count to use when shifting OUTOF_INPUT into INTO_TARGET.
403 INTO_TARGET may be null if the caller has decided to calculate it. */
406 expand_superword_shift (optab binoptab, rtx outof_input, rtx superword_op1,
407 rtx outof_target, rtx into_target,
408 int unsignedp, enum optab_methods methods)
410 if (into_target != 0)
411 if (!force_expand_binop (word_mode, binoptab, outof_input, superword_op1,
412 into_target, unsignedp, methods))
415 if (outof_target != 0)
417 /* For a signed right shift, we must fill OUTOF_TARGET with copies
418 of the sign bit, otherwise we must fill it with zeros. */
419 if (binoptab != ashr_optab)
420 emit_move_insn (outof_target, CONST0_RTX (word_mode));
422 if (!force_expand_binop (word_mode, binoptab,
423 outof_input, GEN_INT (BITS_PER_WORD - 1),
424 outof_target, unsignedp, methods))
430 /* This subroutine of expand_doubleword_shift handles the cases in which
431 the effective shift value is < BITS_PER_WORD. The arguments and return
432 value are the same as for the parent routine. */
435 expand_subword_shift (machine_mode op1_mode, optab binoptab,
436 rtx outof_input, rtx into_input, rtx op1,
437 rtx outof_target, rtx into_target,
438 int unsignedp, enum optab_methods methods,
439 unsigned HOST_WIDE_INT shift_mask)
441 optab reverse_unsigned_shift, unsigned_shift;
444 reverse_unsigned_shift = (binoptab == ashl_optab ? lshr_optab : ashl_optab);
445 unsigned_shift = (binoptab == ashl_optab ? ashl_optab : lshr_optab);
447 /* The low OP1 bits of INTO_TARGET come from the high bits of OUTOF_INPUT.
448 We therefore need to shift OUTOF_INPUT by (BITS_PER_WORD - OP1) bits in
449 the opposite direction to BINOPTAB. */
450 if (CONSTANT_P (op1) || shift_mask >= BITS_PER_WORD)
452 carries = outof_input;
453 tmp = immed_wide_int_const (wi::shwi (BITS_PER_WORD,
454 op1_mode), op1_mode);
455 tmp = simplify_expand_binop (op1_mode, sub_optab, tmp, op1,
460 /* We must avoid shifting by BITS_PER_WORD bits since that is either
461 the same as a zero shift (if shift_mask == BITS_PER_WORD - 1) or
462 has unknown behavior. Do a single shift first, then shift by the
463 remainder. It's OK to use ~OP1 as the remainder if shift counts
464 are truncated to the mode size. */
465 carries = expand_binop (word_mode, reverse_unsigned_shift,
466 outof_input, const1_rtx, 0, unsignedp, methods);
467 if (shift_mask == BITS_PER_WORD - 1)
469 tmp = immed_wide_int_const
470 (wi::minus_one (GET_MODE_PRECISION (op1_mode)), op1_mode);
471 tmp = simplify_expand_binop (op1_mode, xor_optab, op1, tmp,
476 tmp = immed_wide_int_const (wi::shwi (BITS_PER_WORD - 1,
477 op1_mode), op1_mode);
478 tmp = simplify_expand_binop (op1_mode, sub_optab, tmp, op1,
482 if (tmp == 0 || carries == 0)
484 carries = expand_binop (word_mode, reverse_unsigned_shift,
485 carries, tmp, 0, unsignedp, methods);
489 /* Shift INTO_INPUT logically by OP1. This is the last use of INTO_INPUT
490 so the result can go directly into INTO_TARGET if convenient. */
491 tmp = expand_binop (word_mode, unsigned_shift, into_input, op1,
492 into_target, unsignedp, methods);
496 /* Now OR in the bits carried over from OUTOF_INPUT. */
497 if (!force_expand_binop (word_mode, ior_optab, tmp, carries,
498 into_target, unsignedp, methods))
501 /* Use a standard word_mode shift for the out-of half. */
502 if (outof_target != 0)
503 if (!force_expand_binop (word_mode, binoptab, outof_input, op1,
504 outof_target, unsignedp, methods))
511 /* Try implementing expand_doubleword_shift using conditional moves.
512 The shift is by < BITS_PER_WORD if (CMP_CODE CMP1 CMP2) is true,
513 otherwise it is by >= BITS_PER_WORD. SUBWORD_OP1 and SUPERWORD_OP1
514 are the shift counts to use in the former and latter case. All other
515 arguments are the same as the parent routine. */
518 expand_doubleword_shift_condmove (machine_mode op1_mode, optab binoptab,
519 enum rtx_code cmp_code, rtx cmp1, rtx cmp2,
520 rtx outof_input, rtx into_input,
521 rtx subword_op1, rtx superword_op1,
522 rtx outof_target, rtx into_target,
523 int unsignedp, enum optab_methods methods,
524 unsigned HOST_WIDE_INT shift_mask)
526 rtx outof_superword, into_superword;
528 /* Put the superword version of the output into OUTOF_SUPERWORD and
530 outof_superword = outof_target != 0 ? gen_reg_rtx (word_mode) : 0;
531 if (outof_target != 0 && subword_op1 == superword_op1)
533 /* The value INTO_TARGET >> SUBWORD_OP1, which we later store in
534 OUTOF_TARGET, is the same as the value of INTO_SUPERWORD. */
535 into_superword = outof_target;
536 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
537 outof_superword, 0, unsignedp, methods))
542 into_superword = gen_reg_rtx (word_mode);
543 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
544 outof_superword, into_superword,
549 /* Put the subword version directly in OUTOF_TARGET and INTO_TARGET. */
550 if (!expand_subword_shift (op1_mode, binoptab,
551 outof_input, into_input, subword_op1,
552 outof_target, into_target,
553 unsignedp, methods, shift_mask))
556 /* Select between them. Do the INTO half first because INTO_SUPERWORD
557 might be the current value of OUTOF_TARGET. */
558 if (!emit_conditional_move (into_target, cmp_code, cmp1, cmp2, op1_mode,
559 into_target, into_superword, word_mode, false))
562 if (outof_target != 0)
563 if (!emit_conditional_move (outof_target, cmp_code, cmp1, cmp2, op1_mode,
564 outof_target, outof_superword,
571 /* Expand a doubleword shift (ashl, ashr or lshr) using word-mode shifts.
572 OUTOF_INPUT and INTO_INPUT are the two word-sized halves of the first
573 input operand; the shift moves bits in the direction OUTOF_INPUT->
574 INTO_TARGET. OUTOF_TARGET and INTO_TARGET are the equivalent words
575 of the target. OP1 is the shift count and OP1_MODE is its mode.
576 If OP1 is constant, it will have been truncated as appropriate
577 and is known to be nonzero.
579 If SHIFT_MASK is zero, the result of word shifts is undefined when the
580 shift count is outside the range [0, BITS_PER_WORD). This routine must
581 avoid generating such shifts for OP1s in the range [0, BITS_PER_WORD * 2).
583 If SHIFT_MASK is nonzero, all word-mode shift counts are effectively
584 masked by it and shifts in the range [BITS_PER_WORD, SHIFT_MASK) will
585 fill with zeros or sign bits as appropriate.
587 If SHIFT_MASK is BITS_PER_WORD - 1, this routine will synthesize
588 a doubleword shift whose equivalent mask is BITS_PER_WORD * 2 - 1.
589 Doing this preserves semantics required by SHIFT_COUNT_TRUNCATED.
590 In all other cases, shifts by values outside [0, BITS_PER_UNIT * 2)
593 BINOPTAB, UNSIGNEDP and METHODS are as for expand_binop. This function
594 may not use INTO_INPUT after modifying INTO_TARGET, and similarly for
595 OUTOF_INPUT and OUTOF_TARGET. OUTOF_TARGET can be null if the parent
596 function wants to calculate it itself.
598 Return true if the shift could be successfully synthesized. */
601 expand_doubleword_shift (machine_mode op1_mode, optab binoptab,
602 rtx outof_input, rtx into_input, rtx op1,
603 rtx outof_target, rtx into_target,
604 int unsignedp, enum optab_methods methods,
605 unsigned HOST_WIDE_INT shift_mask)
607 rtx superword_op1, tmp, cmp1, cmp2;
608 enum rtx_code cmp_code;
610 /* See if word-mode shifts by BITS_PER_WORD...BITS_PER_WORD * 2 - 1 will
611 fill the result with sign or zero bits as appropriate. If so, the value
612 of OUTOF_TARGET will always be (SHIFT OUTOF_INPUT OP1). Recursively call
613 this routine to calculate INTO_TARGET (which depends on both OUTOF_INPUT
614 and INTO_INPUT), then emit code to set up OUTOF_TARGET.
616 This isn't worthwhile for constant shifts since the optimizers will
617 cope better with in-range shift counts. */
618 if (shift_mask >= BITS_PER_WORD
620 && !CONSTANT_P (op1))
622 if (!expand_doubleword_shift (op1_mode, binoptab,
623 outof_input, into_input, op1,
625 unsignedp, methods, shift_mask))
627 if (!force_expand_binop (word_mode, binoptab, outof_input, op1,
628 outof_target, unsignedp, methods))
633 /* Set CMP_CODE, CMP1 and CMP2 so that the rtx (CMP_CODE CMP1 CMP2)
634 is true when the effective shift value is less than BITS_PER_WORD.
635 Set SUPERWORD_OP1 to the shift count that should be used to shift
636 OUTOF_INPUT into INTO_TARGET when the condition is false. */
637 tmp = immed_wide_int_const (wi::shwi (BITS_PER_WORD, op1_mode), op1_mode);
638 if (!CONSTANT_P (op1) && shift_mask == BITS_PER_WORD - 1)
640 /* Set CMP1 to OP1 & BITS_PER_WORD. The result is zero iff OP1
641 is a subword shift count. */
642 cmp1 = simplify_expand_binop (op1_mode, and_optab, op1, tmp,
644 cmp2 = CONST0_RTX (op1_mode);
650 /* Set CMP1 to OP1 - BITS_PER_WORD. */
651 cmp1 = simplify_expand_binop (op1_mode, sub_optab, op1, tmp,
653 cmp2 = CONST0_RTX (op1_mode);
655 superword_op1 = cmp1;
660 /* If we can compute the condition at compile time, pick the
661 appropriate subroutine. */
662 tmp = simplify_relational_operation (cmp_code, SImode, op1_mode, cmp1, cmp2);
663 if (tmp != 0 && CONST_INT_P (tmp))
665 if (tmp == const0_rtx)
666 return expand_superword_shift (binoptab, outof_input, superword_op1,
667 outof_target, into_target,
670 return expand_subword_shift (op1_mode, binoptab,
671 outof_input, into_input, op1,
672 outof_target, into_target,
673 unsignedp, methods, shift_mask);
676 /* Try using conditional moves to generate straight-line code. */
677 if (HAVE_conditional_move)
679 rtx_insn *start = get_last_insn ();
680 if (expand_doubleword_shift_condmove (op1_mode, binoptab,
681 cmp_code, cmp1, cmp2,
682 outof_input, into_input,
684 outof_target, into_target,
685 unsignedp, methods, shift_mask))
687 delete_insns_since (start);
690 /* As a last resort, use branches to select the correct alternative. */
691 rtx_code_label *subword_label = gen_label_rtx ();
692 rtx_code_label *done_label = gen_label_rtx ();
695 do_compare_rtx_and_jump (cmp1, cmp2, cmp_code, false, op1_mode,
696 0, 0, subword_label, -1);
699 if (!expand_superword_shift (binoptab, outof_input, superword_op1,
700 outof_target, into_target,
704 emit_jump_insn (targetm.gen_jump (done_label));
706 emit_label (subword_label);
708 if (!expand_subword_shift (op1_mode, binoptab,
709 outof_input, into_input, op1,
710 outof_target, into_target,
711 unsignedp, methods, shift_mask))
714 emit_label (done_label);
718 /* Subroutine of expand_binop. Perform a double word multiplication of
719 operands OP0 and OP1 both of mode MODE, which is exactly twice as wide
720 as the target's word_mode. This function return NULL_RTX if anything
721 goes wrong, in which case it may have already emitted instructions
722 which need to be deleted.
724 If we want to multiply two two-word values and have normal and widening
725 multiplies of single-word values, we can do this with three smaller
728 The multiplication proceeds as follows:
729 _______________________
730 [__op0_high_|__op0_low__]
731 _______________________
732 * [__op1_high_|__op1_low__]
733 _______________________________________________
734 _______________________
735 (1) [__op0_low__*__op1_low__]
736 _______________________
737 (2a) [__op0_low__*__op1_high_]
738 _______________________
739 (2b) [__op0_high_*__op1_low__]
740 _______________________
741 (3) [__op0_high_*__op1_high_]
744 This gives a 4-word result. Since we are only interested in the
745 lower 2 words, partial result (3) and the upper words of (2a) and
746 (2b) don't need to be calculated. Hence (2a) and (2b) can be
747 calculated using non-widening multiplication.
749 (1), however, needs to be calculated with an unsigned widening
750 multiplication. If this operation is not directly supported we
751 try using a signed widening multiplication and adjust the result.
752 This adjustment works as follows:
754 If both operands are positive then no adjustment is needed.
756 If the operands have different signs, for example op0_low < 0 and
757 op1_low >= 0, the instruction treats the most significant bit of
758 op0_low as a sign bit instead of a bit with significance
759 2**(BITS_PER_WORD-1), i.e. the instruction multiplies op1_low
760 with 2**BITS_PER_WORD - op0_low, and two's complements the
761 result. Conclusion: We need to add op1_low * 2**BITS_PER_WORD to
764 Similarly, if both operands are negative, we need to add
765 (op0_low + op1_low) * 2**BITS_PER_WORD.
767 We use a trick to adjust quickly. We logically shift op0_low right
768 (op1_low) BITS_PER_WORD-1 steps to get 0 or 1, and add this to
769 op0_high (op1_high) before it is used to calculate 2b (2a). If no
770 logical shift exists, we do an arithmetic right shift and subtract
774 expand_doubleword_mult (machine_mode mode, rtx op0, rtx op1, rtx target,
775 bool umulp, enum optab_methods methods)
777 int low = (WORDS_BIG_ENDIAN ? 1 : 0);
778 int high = (WORDS_BIG_ENDIAN ? 0 : 1);
779 rtx wordm1 = umulp ? NULL_RTX : GEN_INT (BITS_PER_WORD - 1);
780 rtx product, adjust, product_high, temp;
782 rtx op0_high = operand_subword_force (op0, high, mode);
783 rtx op0_low = operand_subword_force (op0, low, mode);
784 rtx op1_high = operand_subword_force (op1, high, mode);
785 rtx op1_low = operand_subword_force (op1, low, mode);
787 /* If we're using an unsigned multiply to directly compute the product
788 of the low-order words of the operands and perform any required
789 adjustments of the operands, we begin by trying two more multiplications
790 and then computing the appropriate sum.
792 We have checked above that the required addition is provided.
793 Full-word addition will normally always succeed, especially if
794 it is provided at all, so we don't worry about its failure. The
795 multiplication may well fail, however, so we do handle that. */
799 /* ??? This could be done with emit_store_flag where available. */
800 temp = expand_binop (word_mode, lshr_optab, op0_low, wordm1,
801 NULL_RTX, 1, methods);
803 op0_high = expand_binop (word_mode, add_optab, op0_high, temp,
804 NULL_RTX, 0, OPTAB_DIRECT);
807 temp = expand_binop (word_mode, ashr_optab, op0_low, wordm1,
808 NULL_RTX, 0, methods);
811 op0_high = expand_binop (word_mode, sub_optab, op0_high, temp,
812 NULL_RTX, 0, OPTAB_DIRECT);
819 adjust = expand_binop (word_mode, smul_optab, op0_high, op1_low,
820 NULL_RTX, 0, OPTAB_DIRECT);
824 /* OP0_HIGH should now be dead. */
828 /* ??? This could be done with emit_store_flag where available. */
829 temp = expand_binop (word_mode, lshr_optab, op1_low, wordm1,
830 NULL_RTX, 1, methods);
832 op1_high = expand_binop (word_mode, add_optab, op1_high, temp,
833 NULL_RTX, 0, OPTAB_DIRECT);
836 temp = expand_binop (word_mode, ashr_optab, op1_low, wordm1,
837 NULL_RTX, 0, methods);
840 op1_high = expand_binop (word_mode, sub_optab, op1_high, temp,
841 NULL_RTX, 0, OPTAB_DIRECT);
848 temp = expand_binop (word_mode, smul_optab, op1_high, op0_low,
849 NULL_RTX, 0, OPTAB_DIRECT);
853 /* OP1_HIGH should now be dead. */
855 adjust = expand_binop (word_mode, add_optab, adjust, temp,
856 NULL_RTX, 0, OPTAB_DIRECT);
858 if (target && !REG_P (target))
862 product = expand_binop (mode, umul_widen_optab, op0_low, op1_low,
863 target, 1, OPTAB_DIRECT);
865 product = expand_binop (mode, smul_widen_optab, op0_low, op1_low,
866 target, 1, OPTAB_DIRECT);
871 product_high = operand_subword (product, high, 1, mode);
872 adjust = expand_binop (word_mode, add_optab, product_high, adjust,
873 NULL_RTX, 0, OPTAB_DIRECT);
874 emit_move_insn (product_high, adjust);
878 /* Wrapper around expand_binop which takes an rtx code to specify
879 the operation to perform, not an optab pointer. All other
880 arguments are the same. */
882 expand_simple_binop (machine_mode mode, enum rtx_code code, rtx op0,
883 rtx op1, rtx target, int unsignedp,
884 enum optab_methods methods)
886 optab binop = code_to_optab (code);
889 return expand_binop (mode, binop, op0, op1, target, unsignedp, methods);
892 /* Return whether OP0 and OP1 should be swapped when expanding a commutative
893 binop. Order them according to commutative_operand_precedence and, if
894 possible, try to put TARGET or a pseudo first. */
896 swap_commutative_operands_with_target (rtx target, rtx op0, rtx op1)
898 int op0_prec = commutative_operand_precedence (op0);
899 int op1_prec = commutative_operand_precedence (op1);
901 if (op0_prec < op1_prec)
904 if (op0_prec > op1_prec)
907 /* With equal precedence, both orders are ok, but it is better if the
908 first operand is TARGET, or if both TARGET and OP0 are pseudos. */
909 if (target == 0 || REG_P (target))
910 return (REG_P (op1) && !REG_P (op0)) || target == op1;
912 return rtx_equal_p (op1, target);
915 /* Return true if BINOPTAB implements a shift operation. */
918 shift_optab_p (optab binoptab)
920 switch (optab_to_code (binoptab))
936 /* Return true if BINOPTAB implements a commutative binary operation. */
939 commutative_optab_p (optab binoptab)
941 return (GET_RTX_CLASS (optab_to_code (binoptab)) == RTX_COMM_ARITH
942 || binoptab == smul_widen_optab
943 || binoptab == umul_widen_optab
944 || binoptab == smul_highpart_optab
945 || binoptab == umul_highpart_optab);
948 /* X is to be used in mode MODE as operand OPN to BINOPTAB. If we're
949 optimizing, and if the operand is a constant that costs more than
950 1 instruction, force the constant into a register and return that
951 register. Return X otherwise. UNSIGNEDP says whether X is unsigned. */
954 avoid_expensive_constant (machine_mode mode, optab binoptab,
955 int opn, rtx x, bool unsignedp)
957 bool speed = optimize_insn_for_speed_p ();
962 && (rtx_cost (x, mode, optab_to_code (binoptab), opn, speed)
963 > set_src_cost (x, mode, speed)))
967 HOST_WIDE_INT intval = trunc_int_for_mode (INTVAL (x), mode);
968 if (intval != INTVAL (x))
969 x = GEN_INT (intval);
972 x = convert_modes (mode, VOIDmode, x, unsignedp);
973 x = force_reg (mode, x);
978 /* Helper function for expand_binop: handle the case where there
979 is an insn that directly implements the indicated operation.
980 Returns null if this is not possible. */
982 expand_binop_directly (machine_mode mode, optab binoptab,
984 rtx target, int unsignedp, enum optab_methods methods,
987 machine_mode from_mode = widened_mode (mode, op0, op1);
988 enum insn_code icode = find_widening_optab_handler (binoptab, mode,
990 machine_mode xmode0 = insn_data[(int) icode].operand[1].mode;
991 machine_mode xmode1 = insn_data[(int) icode].operand[2].mode;
992 machine_mode mode0, mode1, tmp_mode;
993 struct expand_operand ops[3];
996 rtx xop0 = op0, xop1 = op1;
997 bool canonicalize_op1 = false;
999 /* If it is a commutative operator and the modes would match
1000 if we would swap the operands, we can save the conversions. */
1001 commutative_p = commutative_optab_p (binoptab);
1003 && GET_MODE (xop0) != xmode0 && GET_MODE (xop1) != xmode1
1004 && GET_MODE (xop0) == xmode1 && GET_MODE (xop1) == xmode1)
1005 std::swap (xop0, xop1);
1007 /* If we are optimizing, force expensive constants into a register. */
1008 xop0 = avoid_expensive_constant (xmode0, binoptab, 0, xop0, unsignedp);
1009 if (!shift_optab_p (binoptab))
1010 xop1 = avoid_expensive_constant (xmode1, binoptab, 1, xop1, unsignedp);
1012 /* Shifts and rotates often use a different mode for op1 from op0;
1013 for VOIDmode constants we don't know the mode, so force it
1014 to be canonicalized using convert_modes. */
1015 canonicalize_op1 = true;
1017 /* In case the insn wants input operands in modes different from
1018 those of the actual operands, convert the operands. It would
1019 seem that we don't need to convert CONST_INTs, but we do, so
1020 that they're properly zero-extended, sign-extended or truncated
1023 mode0 = GET_MODE (xop0) != VOIDmode ? GET_MODE (xop0) : mode;
1024 if (xmode0 != VOIDmode && xmode0 != mode0)
1026 xop0 = convert_modes (xmode0, mode0, xop0, unsignedp);
1030 mode1 = ((GET_MODE (xop1) != VOIDmode || canonicalize_op1)
1031 ? GET_MODE (xop1) : mode);
1032 if (xmode1 != VOIDmode && xmode1 != mode1)
1034 xop1 = convert_modes (xmode1, mode1, xop1, unsignedp);
1038 /* If operation is commutative,
1039 try to make the first operand a register.
1040 Even better, try to make it the same as the target.
1041 Also try to make the last operand a constant. */
1043 && swap_commutative_operands_with_target (target, xop0, xop1))
1044 std::swap (xop0, xop1);
1046 /* Now, if insn's predicates don't allow our operands, put them into
1049 if (binoptab == vec_pack_trunc_optab
1050 || binoptab == vec_pack_usat_optab
1051 || binoptab == vec_pack_ssat_optab
1052 || binoptab == vec_pack_ufix_trunc_optab
1053 || binoptab == vec_pack_sfix_trunc_optab)
1055 /* The mode of the result is different then the mode of the
1057 tmp_mode = insn_data[(int) icode].operand[0].mode;
1058 if (VECTOR_MODE_P (mode)
1059 && GET_MODE_NUNITS (tmp_mode) != 2 * GET_MODE_NUNITS (mode))
1061 delete_insns_since (last);
1068 create_output_operand (&ops[0], target, tmp_mode);
1069 create_input_operand (&ops[1], xop0, mode0);
1070 create_input_operand (&ops[2], xop1, mode1);
1071 pat = maybe_gen_insn (icode, 3, ops);
1074 /* If PAT is composed of more than one insn, try to add an appropriate
1075 REG_EQUAL note to it. If we can't because TEMP conflicts with an
1076 operand, call expand_binop again, this time without a target. */
1077 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX
1078 && ! add_equal_note (pat, ops[0].value,
1079 optab_to_code (binoptab),
1080 ops[1].value, ops[2].value))
1082 delete_insns_since (last);
1083 return expand_binop (mode, binoptab, op0, op1, NULL_RTX,
1084 unsignedp, methods);
1088 return ops[0].value;
1090 delete_insns_since (last);
1094 /* Generate code to perform an operation specified by BINOPTAB
1095 on operands OP0 and OP1, with result having machine-mode MODE.
1097 UNSIGNEDP is for the case where we have to widen the operands
1098 to perform the operation. It says to use zero-extension.
1100 If TARGET is nonzero, the value
1101 is generated there, if it is convenient to do so.
1102 In all cases an rtx is returned for the locus of the value;
1103 this may or may not be TARGET. */
1106 expand_binop (machine_mode mode, optab binoptab, rtx op0, rtx op1,
1107 rtx target, int unsignedp, enum optab_methods methods)
1109 enum optab_methods next_methods
1110 = (methods == OPTAB_LIB || methods == OPTAB_LIB_WIDEN
1111 ? OPTAB_WIDEN : methods);
1112 enum mode_class mclass;
1113 machine_mode wider_mode;
1116 rtx_insn *entry_last = get_last_insn ();
1119 mclass = GET_MODE_CLASS (mode);
1121 /* If subtracting an integer constant, convert this into an addition of
1122 the negated constant. */
1124 if (binoptab == sub_optab && CONST_INT_P (op1))
1126 op1 = negate_rtx (mode, op1);
1127 binoptab = add_optab;
1129 /* For shifts, constant invalid op1 might be expanded from different
1130 mode than MODE. As those are invalid, force them to a register
1131 to avoid further problems during expansion. */
1132 else if (CONST_INT_P (op1)
1133 && shift_optab_p (binoptab)
1134 && UINTVAL (op1) >= GET_MODE_BITSIZE (GET_MODE_INNER (mode)))
1136 op1 = gen_int_mode (INTVAL (op1), GET_MODE_INNER (mode));
1137 op1 = force_reg (GET_MODE_INNER (mode), op1);
1140 /* Record where to delete back to if we backtrack. */
1141 last = get_last_insn ();
1143 /* If we can do it with a three-operand insn, do so. */
1145 if (methods != OPTAB_MUST_WIDEN
1146 && find_widening_optab_handler (binoptab, mode,
1147 widened_mode (mode, op0, op1), 1)
1148 != CODE_FOR_nothing)
1150 temp = expand_binop_directly (mode, binoptab, op0, op1, target,
1151 unsignedp, methods, last);
1156 /* If we were trying to rotate, and that didn't work, try rotating
1157 the other direction before falling back to shifts and bitwise-or. */
1158 if (((binoptab == rotl_optab
1159 && optab_handler (rotr_optab, mode) != CODE_FOR_nothing)
1160 || (binoptab == rotr_optab
1161 && optab_handler (rotl_optab, mode) != CODE_FOR_nothing))
1162 && mclass == MODE_INT)
1164 optab otheroptab = (binoptab == rotl_optab ? rotr_optab : rotl_optab);
1166 unsigned int bits = GET_MODE_PRECISION (mode);
1168 if (CONST_INT_P (op1))
1169 newop1 = GEN_INT (bits - INTVAL (op1));
1170 else if (targetm.shift_truncation_mask (mode) == bits - 1)
1171 newop1 = negate_rtx (GET_MODE (op1), op1);
1173 newop1 = expand_binop (GET_MODE (op1), sub_optab,
1174 gen_int_mode (bits, GET_MODE (op1)), op1,
1175 NULL_RTX, unsignedp, OPTAB_DIRECT);
1177 temp = expand_binop_directly (mode, otheroptab, op0, newop1,
1178 target, unsignedp, methods, last);
1183 /* If this is a multiply, see if we can do a widening operation that
1184 takes operands of this mode and makes a wider mode. */
1186 if (binoptab == smul_optab
1187 && GET_MODE_2XWIDER_MODE (mode) != VOIDmode
1188 && (widening_optab_handler ((unsignedp ? umul_widen_optab
1189 : smul_widen_optab),
1190 GET_MODE_2XWIDER_MODE (mode), mode)
1191 != CODE_FOR_nothing))
1193 temp = expand_binop (GET_MODE_2XWIDER_MODE (mode),
1194 unsignedp ? umul_widen_optab : smul_widen_optab,
1195 op0, op1, NULL_RTX, unsignedp, OPTAB_DIRECT);
1199 if (GET_MODE_CLASS (mode) == MODE_INT
1200 && TRULY_NOOP_TRUNCATION_MODES_P (mode, GET_MODE (temp)))
1201 return gen_lowpart (mode, temp);
1203 return convert_to_mode (mode, temp, unsignedp);
1207 /* If this is a vector shift by a scalar, see if we can do a vector
1208 shift by a vector. If so, broadcast the scalar into a vector. */
1209 if (mclass == MODE_VECTOR_INT)
1211 optab otheroptab = unknown_optab;
1213 if (binoptab == ashl_optab)
1214 otheroptab = vashl_optab;
1215 else if (binoptab == ashr_optab)
1216 otheroptab = vashr_optab;
1217 else if (binoptab == lshr_optab)
1218 otheroptab = vlshr_optab;
1219 else if (binoptab == rotl_optab)
1220 otheroptab = vrotl_optab;
1221 else if (binoptab == rotr_optab)
1222 otheroptab = vrotr_optab;
1224 if (otheroptab && optab_handler (otheroptab, mode) != CODE_FOR_nothing)
1226 /* The scalar may have been extended to be too wide. Truncate
1227 it back to the proper size to fit in the broadcast vector. */
1228 machine_mode inner_mode = GET_MODE_INNER (mode);
1229 if (!CONST_INT_P (op1)
1230 && (GET_MODE_BITSIZE (inner_mode)
1231 < GET_MODE_BITSIZE (GET_MODE (op1))))
1232 op1 = force_reg (inner_mode,
1233 simplify_gen_unary (TRUNCATE, inner_mode, op1,
1235 rtx vop1 = expand_vector_broadcast (mode, op1);
1238 temp = expand_binop_directly (mode, otheroptab, op0, vop1,
1239 target, unsignedp, methods, last);
1246 /* Look for a wider mode of the same class for which we think we
1247 can open-code the operation. Check for a widening multiply at the
1248 wider mode as well. */
1250 if (CLASS_HAS_WIDER_MODES_P (mclass)
1251 && methods != OPTAB_DIRECT && methods != OPTAB_LIB)
1252 for (wider_mode = GET_MODE_WIDER_MODE (mode);
1253 wider_mode != VOIDmode;
1254 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1256 if (optab_handler (binoptab, wider_mode) != CODE_FOR_nothing
1257 || (binoptab == smul_optab
1258 && GET_MODE_WIDER_MODE (wider_mode) != VOIDmode
1259 && (find_widening_optab_handler ((unsignedp
1261 : smul_widen_optab),
1262 GET_MODE_WIDER_MODE (wider_mode),
1264 != CODE_FOR_nothing)))
1266 rtx xop0 = op0, xop1 = op1;
1269 /* For certain integer operations, we need not actually extend
1270 the narrow operands, as long as we will truncate
1271 the results to the same narrowness. */
1273 if ((binoptab == ior_optab || binoptab == and_optab
1274 || binoptab == xor_optab
1275 || binoptab == add_optab || binoptab == sub_optab
1276 || binoptab == smul_optab || binoptab == ashl_optab)
1277 && mclass == MODE_INT)
1280 xop0 = avoid_expensive_constant (mode, binoptab, 0,
1282 if (binoptab != ashl_optab)
1283 xop1 = avoid_expensive_constant (mode, binoptab, 1,
1287 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp, no_extend);
1289 /* The second operand of a shift must always be extended. */
1290 xop1 = widen_operand (xop1, wider_mode, mode, unsignedp,
1291 no_extend && binoptab != ashl_optab);
1293 temp = expand_binop (wider_mode, binoptab, xop0, xop1, NULL_RTX,
1294 unsignedp, OPTAB_DIRECT);
1297 if (mclass != MODE_INT
1298 || !TRULY_NOOP_TRUNCATION_MODES_P (mode, wider_mode))
1301 target = gen_reg_rtx (mode);
1302 convert_move (target, temp, 0);
1306 return gen_lowpart (mode, temp);
1309 delete_insns_since (last);
1313 /* If operation is commutative,
1314 try to make the first operand a register.
1315 Even better, try to make it the same as the target.
1316 Also try to make the last operand a constant. */
1317 if (commutative_optab_p (binoptab)
1318 && swap_commutative_operands_with_target (target, op0, op1))
1319 std::swap (op0, op1);
1321 /* These can be done a word at a time. */
1322 if ((binoptab == and_optab || binoptab == ior_optab || binoptab == xor_optab)
1323 && mclass == MODE_INT
1324 && GET_MODE_SIZE (mode) > UNITS_PER_WORD
1325 && optab_handler (binoptab, word_mode) != CODE_FOR_nothing)
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. */
1335 || !valid_multiword_target_p (target))
1336 target = gen_reg_rtx (mode);
1340 /* Do the actual arithmetic. */
1341 for (i = 0; i < GET_MODE_BITSIZE (mode) / BITS_PER_WORD; i++)
1343 rtx target_piece = operand_subword (target, i, 1, mode);
1344 rtx x = expand_binop (word_mode, binoptab,
1345 operand_subword_force (op0, i, mode),
1346 operand_subword_force (op1, i, mode),
1347 target_piece, unsignedp, next_methods);
1352 if (target_piece != x)
1353 emit_move_insn (target_piece, x);
1356 insns = get_insns ();
1359 if (i == GET_MODE_BITSIZE (mode) / BITS_PER_WORD)
1366 /* Synthesize double word shifts from single word shifts. */
1367 if ((binoptab == lshr_optab || binoptab == ashl_optab
1368 || binoptab == ashr_optab)
1369 && mclass == MODE_INT
1370 && (CONST_INT_P (op1) || optimize_insn_for_speed_p ())
1371 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1372 && GET_MODE_PRECISION (mode) == GET_MODE_BITSIZE (mode)
1373 && optab_handler (binoptab, word_mode) != CODE_FOR_nothing
1374 && optab_handler (ashl_optab, word_mode) != CODE_FOR_nothing
1375 && optab_handler (lshr_optab, word_mode) != CODE_FOR_nothing)
1377 unsigned HOST_WIDE_INT shift_mask, double_shift_mask;
1378 machine_mode op1_mode;
1380 double_shift_mask = targetm.shift_truncation_mask (mode);
1381 shift_mask = targetm.shift_truncation_mask (word_mode);
1382 op1_mode = GET_MODE (op1) != VOIDmode ? GET_MODE (op1) : word_mode;
1384 /* Apply the truncation to constant shifts. */
1385 if (double_shift_mask > 0 && CONST_INT_P (op1))
1386 op1 = GEN_INT (INTVAL (op1) & double_shift_mask);
1388 if (op1 == CONST0_RTX (op1_mode))
1391 /* Make sure that this is a combination that expand_doubleword_shift
1392 can handle. See the comments there for details. */
1393 if (double_shift_mask == 0
1394 || (shift_mask == BITS_PER_WORD - 1
1395 && double_shift_mask == BITS_PER_WORD * 2 - 1))
1398 rtx into_target, outof_target;
1399 rtx into_input, outof_input;
1400 int left_shift, outof_word;
1402 /* If TARGET is the same as one of the operands, the REG_EQUAL note
1403 won't be accurate, so use a new target. */
1407 || !valid_multiword_target_p (target))
1408 target = gen_reg_rtx (mode);
1412 /* OUTOF_* is the word we are shifting bits away from, and
1413 INTO_* is the word that we are shifting bits towards, thus
1414 they differ depending on the direction of the shift and
1415 WORDS_BIG_ENDIAN. */
1417 left_shift = binoptab == ashl_optab;
1418 outof_word = left_shift ^ ! WORDS_BIG_ENDIAN;
1420 outof_target = operand_subword (target, outof_word, 1, mode);
1421 into_target = operand_subword (target, 1 - outof_word, 1, mode);
1423 outof_input = operand_subword_force (op0, outof_word, mode);
1424 into_input = operand_subword_force (op0, 1 - outof_word, mode);
1426 if (expand_doubleword_shift (op1_mode, binoptab,
1427 outof_input, into_input, op1,
1428 outof_target, into_target,
1429 unsignedp, next_methods, shift_mask))
1431 insns = get_insns ();
1441 /* Synthesize double word rotates from single word shifts. */
1442 if ((binoptab == rotl_optab || binoptab == rotr_optab)
1443 && mclass == MODE_INT
1444 && CONST_INT_P (op1)
1445 && GET_MODE_PRECISION (mode) == 2 * BITS_PER_WORD
1446 && optab_handler (ashl_optab, word_mode) != CODE_FOR_nothing
1447 && optab_handler (lshr_optab, word_mode) != CODE_FOR_nothing)
1450 rtx into_target, outof_target;
1451 rtx into_input, outof_input;
1453 int shift_count, left_shift, outof_word;
1455 /* If TARGET is the same as one of the operands, the REG_EQUAL note
1456 won't be accurate, so use a new target. Do this also if target is not
1457 a REG, first because having a register instead may open optimization
1458 opportunities, and second because if target and op0 happen to be MEMs
1459 designating the same location, we would risk clobbering it too early
1460 in the code sequence we generate below. */
1465 || !valid_multiword_target_p (target))
1466 target = gen_reg_rtx (mode);
1470 shift_count = INTVAL (op1);
1472 /* OUTOF_* is the word we are shifting bits away from, and
1473 INTO_* is the word that we are shifting bits towards, thus
1474 they differ depending on the direction of the shift and
1475 WORDS_BIG_ENDIAN. */
1477 left_shift = (binoptab == rotl_optab);
1478 outof_word = left_shift ^ ! WORDS_BIG_ENDIAN;
1480 outof_target = operand_subword (target, outof_word, 1, mode);
1481 into_target = operand_subword (target, 1 - outof_word, 1, mode);
1483 outof_input = operand_subword_force (op0, outof_word, mode);
1484 into_input = operand_subword_force (op0, 1 - outof_word, mode);
1486 if (shift_count == BITS_PER_WORD)
1488 /* This is just a word swap. */
1489 emit_move_insn (outof_target, into_input);
1490 emit_move_insn (into_target, outof_input);
1495 rtx into_temp1, into_temp2, outof_temp1, outof_temp2;
1496 rtx first_shift_count, second_shift_count;
1497 optab reverse_unsigned_shift, unsigned_shift;
1499 reverse_unsigned_shift = (left_shift ^ (shift_count < BITS_PER_WORD)
1500 ? lshr_optab : ashl_optab);
1502 unsigned_shift = (left_shift ^ (shift_count < BITS_PER_WORD)
1503 ? ashl_optab : lshr_optab);
1505 if (shift_count > BITS_PER_WORD)
1507 first_shift_count = GEN_INT (shift_count - BITS_PER_WORD);
1508 second_shift_count = GEN_INT (2 * BITS_PER_WORD - shift_count);
1512 first_shift_count = GEN_INT (BITS_PER_WORD - shift_count);
1513 second_shift_count = GEN_INT (shift_count);
1516 into_temp1 = expand_binop (word_mode, unsigned_shift,
1517 outof_input, first_shift_count,
1518 NULL_RTX, unsignedp, next_methods);
1519 into_temp2 = expand_binop (word_mode, reverse_unsigned_shift,
1520 into_input, second_shift_count,
1521 NULL_RTX, unsignedp, next_methods);
1523 if (into_temp1 != 0 && into_temp2 != 0)
1524 inter = expand_binop (word_mode, ior_optab, into_temp1, into_temp2,
1525 into_target, unsignedp, next_methods);
1529 if (inter != 0 && inter != into_target)
1530 emit_move_insn (into_target, inter);
1532 outof_temp1 = expand_binop (word_mode, unsigned_shift,
1533 into_input, first_shift_count,
1534 NULL_RTX, unsignedp, next_methods);
1535 outof_temp2 = expand_binop (word_mode, reverse_unsigned_shift,
1536 outof_input, second_shift_count,
1537 NULL_RTX, unsignedp, next_methods);
1539 if (inter != 0 && outof_temp1 != 0 && outof_temp2 != 0)
1540 inter = expand_binop (word_mode, ior_optab,
1541 outof_temp1, outof_temp2,
1542 outof_target, unsignedp, next_methods);
1544 if (inter != 0 && inter != outof_target)
1545 emit_move_insn (outof_target, inter);
1548 insns = get_insns ();
1558 /* These can be done a word at a time by propagating carries. */
1559 if ((binoptab == add_optab || binoptab == sub_optab)
1560 && mclass == MODE_INT
1561 && GET_MODE_SIZE (mode) >= 2 * UNITS_PER_WORD
1562 && optab_handler (binoptab, word_mode) != CODE_FOR_nothing)
1565 optab otheroptab = binoptab == add_optab ? sub_optab : add_optab;
1566 const unsigned int nwords = GET_MODE_BITSIZE (mode) / BITS_PER_WORD;
1567 rtx carry_in = NULL_RTX, carry_out = NULL_RTX;
1568 rtx xop0, xop1, xtarget;
1570 /* We can handle either a 1 or -1 value for the carry. If STORE_FLAG
1571 value is one of those, use it. Otherwise, use 1 since it is the
1572 one easiest to get. */
1573 #if STORE_FLAG_VALUE == 1 || STORE_FLAG_VALUE == -1
1574 int normalizep = STORE_FLAG_VALUE;
1579 /* Prepare the operands. */
1580 xop0 = force_reg (mode, op0);
1581 xop1 = force_reg (mode, op1);
1583 xtarget = gen_reg_rtx (mode);
1585 if (target == 0 || !REG_P (target) || !valid_multiword_target_p (target))
1588 /* Indicate for flow that the entire target reg is being set. */
1590 emit_clobber (xtarget);
1592 /* Do the actual arithmetic. */
1593 for (i = 0; i < nwords; i++)
1595 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
1596 rtx target_piece = operand_subword (xtarget, index, 1, mode);
1597 rtx op0_piece = operand_subword_force (xop0, index, mode);
1598 rtx op1_piece = operand_subword_force (xop1, index, mode);
1601 /* Main add/subtract of the input operands. */
1602 x = expand_binop (word_mode, binoptab,
1603 op0_piece, op1_piece,
1604 target_piece, unsignedp, next_methods);
1610 /* Store carry from main add/subtract. */
1611 carry_out = gen_reg_rtx (word_mode);
1612 carry_out = emit_store_flag_force (carry_out,
1613 (binoptab == add_optab
1616 word_mode, 1, normalizep);
1623 /* Add/subtract previous carry to main result. */
1624 newx = expand_binop (word_mode,
1625 normalizep == 1 ? binoptab : otheroptab,
1627 NULL_RTX, 1, next_methods);
1631 /* Get out carry from adding/subtracting carry in. */
1632 rtx carry_tmp = gen_reg_rtx (word_mode);
1633 carry_tmp = emit_store_flag_force (carry_tmp,
1634 (binoptab == add_optab
1637 word_mode, 1, normalizep);
1639 /* Logical-ior the two poss. carry together. */
1640 carry_out = expand_binop (word_mode, ior_optab,
1641 carry_out, carry_tmp,
1642 carry_out, 0, next_methods);
1646 emit_move_insn (target_piece, newx);
1650 if (x != target_piece)
1651 emit_move_insn (target_piece, x);
1654 carry_in = carry_out;
1657 if (i == GET_MODE_BITSIZE (mode) / (unsigned) BITS_PER_WORD)
1659 if (optab_handler (mov_optab, mode) != CODE_FOR_nothing
1660 || ! rtx_equal_p (target, xtarget))
1662 rtx_insn *temp = emit_move_insn (target, xtarget);
1664 set_dst_reg_note (temp, REG_EQUAL,
1665 gen_rtx_fmt_ee (optab_to_code (binoptab),
1666 mode, copy_rtx (xop0),
1677 delete_insns_since (last);
1680 /* Attempt to synthesize double word multiplies using a sequence of word
1681 mode multiplications. We first attempt to generate a sequence using a
1682 more efficient unsigned widening multiply, and if that fails we then
1683 try using a signed widening multiply. */
1685 if (binoptab == smul_optab
1686 && mclass == MODE_INT
1687 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
1688 && optab_handler (smul_optab, word_mode) != CODE_FOR_nothing
1689 && optab_handler (add_optab, word_mode) != CODE_FOR_nothing)
1691 rtx product = NULL_RTX;
1692 if (widening_optab_handler (umul_widen_optab, mode, word_mode)
1693 != CODE_FOR_nothing)
1695 product = expand_doubleword_mult (mode, op0, op1, target,
1698 delete_insns_since (last);
1701 if (product == NULL_RTX
1702 && widening_optab_handler (smul_widen_optab, mode, word_mode)
1703 != CODE_FOR_nothing)
1705 product = expand_doubleword_mult (mode, op0, op1, target,
1708 delete_insns_since (last);
1711 if (product != NULL_RTX)
1713 if (optab_handler (mov_optab, mode) != CODE_FOR_nothing)
1715 temp = emit_move_insn (target ? target : product, product);
1716 set_dst_reg_note (temp,
1718 gen_rtx_fmt_ee (MULT, mode,
1721 target ? target : product);
1727 /* It can't be open-coded in this mode.
1728 Use a library call if one is available and caller says that's ok. */
1730 libfunc = optab_libfunc (binoptab, mode);
1732 && (methods == OPTAB_LIB || methods == OPTAB_LIB_WIDEN))
1736 machine_mode op1_mode = mode;
1741 if (shift_optab_p (binoptab))
1743 op1_mode = targetm.libgcc_shift_count_mode ();
1744 /* Specify unsigned here,
1745 since negative shift counts are meaningless. */
1746 op1x = convert_to_mode (op1_mode, op1, 1);
1749 if (GET_MODE (op0) != VOIDmode
1750 && GET_MODE (op0) != mode)
1751 op0 = convert_to_mode (mode, op0, unsignedp);
1753 /* Pass 1 for NO_QUEUE so we don't lose any increments
1754 if the libcall is cse'd or moved. */
1755 value = emit_library_call_value (libfunc,
1756 NULL_RTX, LCT_CONST, mode, 2,
1757 op0, mode, op1x, op1_mode);
1759 insns = get_insns ();
1762 bool trapv = trapv_binoptab_p (binoptab);
1763 target = gen_reg_rtx (mode);
1764 emit_libcall_block_1 (insns, target, value,
1766 : gen_rtx_fmt_ee (optab_to_code (binoptab),
1767 mode, op0, op1), trapv);
1772 delete_insns_since (last);
1774 /* It can't be done in this mode. Can we do it in a wider mode? */
1776 if (! (methods == OPTAB_WIDEN || methods == OPTAB_LIB_WIDEN
1777 || methods == OPTAB_MUST_WIDEN))
1779 /* Caller says, don't even try. */
1780 delete_insns_since (entry_last);
1784 /* Compute the value of METHODS to pass to recursive calls.
1785 Don't allow widening to be tried recursively. */
1787 methods = (methods == OPTAB_LIB_WIDEN ? OPTAB_LIB : OPTAB_DIRECT);
1789 /* Look for a wider mode of the same class for which it appears we can do
1792 if (CLASS_HAS_WIDER_MODES_P (mclass))
1794 for (wider_mode = GET_MODE_WIDER_MODE (mode);
1795 wider_mode != VOIDmode;
1796 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1798 if (find_widening_optab_handler (binoptab, wider_mode, mode, 1)
1800 || (methods == OPTAB_LIB
1801 && optab_libfunc (binoptab, wider_mode)))
1803 rtx xop0 = op0, xop1 = op1;
1806 /* For certain integer operations, we need not actually extend
1807 the narrow operands, as long as we will truncate
1808 the results to the same narrowness. */
1810 if ((binoptab == ior_optab || binoptab == and_optab
1811 || binoptab == xor_optab
1812 || binoptab == add_optab || binoptab == sub_optab
1813 || binoptab == smul_optab || binoptab == ashl_optab)
1814 && mclass == MODE_INT)
1817 xop0 = widen_operand (xop0, wider_mode, mode,
1818 unsignedp, no_extend);
1820 /* The second operand of a shift must always be extended. */
1821 xop1 = widen_operand (xop1, wider_mode, mode, unsignedp,
1822 no_extend && binoptab != ashl_optab);
1824 temp = expand_binop (wider_mode, binoptab, xop0, xop1, NULL_RTX,
1825 unsignedp, methods);
1828 if (mclass != MODE_INT
1829 || !TRULY_NOOP_TRUNCATION_MODES_P (mode, wider_mode))
1832 target = gen_reg_rtx (mode);
1833 convert_move (target, temp, 0);
1837 return gen_lowpart (mode, temp);
1840 delete_insns_since (last);
1845 delete_insns_since (entry_last);
1849 /* Expand a binary operator which has both signed and unsigned forms.
1850 UOPTAB is the optab for unsigned operations, and SOPTAB is for
1853 If we widen unsigned operands, we may use a signed wider operation instead
1854 of an unsigned wider operation, since the result would be the same. */
1857 sign_expand_binop (machine_mode mode, optab uoptab, optab soptab,
1858 rtx op0, rtx op1, rtx target, int unsignedp,
1859 enum optab_methods methods)
1862 optab direct_optab = unsignedp ? uoptab : soptab;
1865 /* Do it without widening, if possible. */
1866 temp = expand_binop (mode, direct_optab, op0, op1, target,
1867 unsignedp, OPTAB_DIRECT);
1868 if (temp || methods == OPTAB_DIRECT)
1871 /* Try widening to a signed int. Disable any direct use of any
1872 signed insn in the current mode. */
1873 save_enable = swap_optab_enable (soptab, mode, false);
1875 temp = expand_binop (mode, soptab, op0, op1, target,
1876 unsignedp, OPTAB_WIDEN);
1878 /* For unsigned operands, try widening to an unsigned int. */
1879 if (!temp && unsignedp)
1880 temp = expand_binop (mode, uoptab, op0, op1, target,
1881 unsignedp, OPTAB_WIDEN);
1882 if (temp || methods == OPTAB_WIDEN)
1885 /* Use the right width libcall if that exists. */
1886 temp = expand_binop (mode, direct_optab, op0, op1, target,
1887 unsignedp, OPTAB_LIB);
1888 if (temp || methods == OPTAB_LIB)
1891 /* Must widen and use a libcall, use either signed or unsigned. */
1892 temp = expand_binop (mode, soptab, op0, op1, target,
1893 unsignedp, methods);
1894 if (!temp && unsignedp)
1895 temp = expand_binop (mode, uoptab, op0, op1, target,
1896 unsignedp, methods);
1899 /* Undo the fiddling above. */
1901 swap_optab_enable (soptab, mode, true);
1905 /* Generate code to perform an operation specified by UNOPPTAB
1906 on operand OP0, with two results to TARG0 and TARG1.
1907 We assume that the order of the operands for the instruction
1908 is TARG0, TARG1, OP0.
1910 Either TARG0 or TARG1 may be zero, but what that means is that
1911 the result is not actually wanted. We will generate it into
1912 a dummy pseudo-reg and discard it. They may not both be zero.
1914 Returns 1 if this operation can be performed; 0 if not. */
1917 expand_twoval_unop (optab unoptab, rtx op0, rtx targ0, rtx targ1,
1920 machine_mode mode = GET_MODE (targ0 ? targ0 : targ1);
1921 enum mode_class mclass;
1922 machine_mode wider_mode;
1923 rtx_insn *entry_last = get_last_insn ();
1926 mclass = GET_MODE_CLASS (mode);
1929 targ0 = gen_reg_rtx (mode);
1931 targ1 = gen_reg_rtx (mode);
1933 /* Record where to go back to if we fail. */
1934 last = get_last_insn ();
1936 if (optab_handler (unoptab, mode) != CODE_FOR_nothing)
1938 struct expand_operand ops[3];
1939 enum insn_code icode = optab_handler (unoptab, mode);
1941 create_fixed_operand (&ops[0], targ0);
1942 create_fixed_operand (&ops[1], targ1);
1943 create_convert_operand_from (&ops[2], op0, mode, unsignedp);
1944 if (maybe_expand_insn (icode, 3, ops))
1948 /* It can't be done in this mode. Can we do it in a wider mode? */
1950 if (CLASS_HAS_WIDER_MODES_P (mclass))
1952 for (wider_mode = GET_MODE_WIDER_MODE (mode);
1953 wider_mode != VOIDmode;
1954 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
1956 if (optab_handler (unoptab, wider_mode) != CODE_FOR_nothing)
1958 rtx t0 = gen_reg_rtx (wider_mode);
1959 rtx t1 = gen_reg_rtx (wider_mode);
1960 rtx cop0 = convert_modes (wider_mode, mode, op0, unsignedp);
1962 if (expand_twoval_unop (unoptab, cop0, t0, t1, unsignedp))
1964 convert_move (targ0, t0, unsignedp);
1965 convert_move (targ1, t1, unsignedp);
1969 delete_insns_since (last);
1974 delete_insns_since (entry_last);
1978 /* Generate code to perform an operation specified by BINOPTAB
1979 on operands OP0 and OP1, with two results to TARG1 and TARG2.
1980 We assume that the order of the operands for the instruction
1981 is TARG0, OP0, OP1, TARG1, which would fit a pattern like
1982 [(set TARG0 (operate OP0 OP1)) (set TARG1 (operate ...))].
1984 Either TARG0 or TARG1 may be zero, but what that means is that
1985 the result is not actually wanted. We will generate it into
1986 a dummy pseudo-reg and discard it. They may not both be zero.
1988 Returns 1 if this operation can be performed; 0 if not. */
1991 expand_twoval_binop (optab binoptab, rtx op0, rtx op1, rtx targ0, rtx targ1,
1994 machine_mode mode = GET_MODE (targ0 ? targ0 : targ1);
1995 enum mode_class mclass;
1996 machine_mode wider_mode;
1997 rtx_insn *entry_last = get_last_insn ();
2000 mclass = GET_MODE_CLASS (mode);
2003 targ0 = gen_reg_rtx (mode);
2005 targ1 = gen_reg_rtx (mode);
2007 /* Record where to go back to if we fail. */
2008 last = get_last_insn ();
2010 if (optab_handler (binoptab, mode) != CODE_FOR_nothing)
2012 struct expand_operand ops[4];
2013 enum insn_code icode = optab_handler (binoptab, mode);
2014 machine_mode mode0 = insn_data[icode].operand[1].mode;
2015 machine_mode mode1 = insn_data[icode].operand[2].mode;
2016 rtx xop0 = op0, xop1 = op1;
2018 /* If we are optimizing, force expensive constants into a register. */
2019 xop0 = avoid_expensive_constant (mode0, binoptab, 0, xop0, unsignedp);
2020 xop1 = avoid_expensive_constant (mode1, binoptab, 1, xop1, unsignedp);
2022 create_fixed_operand (&ops[0], targ0);
2023 create_convert_operand_from (&ops[1], op0, mode, unsignedp);
2024 create_convert_operand_from (&ops[2], op1, mode, unsignedp);
2025 create_fixed_operand (&ops[3], targ1);
2026 if (maybe_expand_insn (icode, 4, ops))
2028 delete_insns_since (last);
2031 /* It can't be done in this mode. Can we do it in a wider mode? */
2033 if (CLASS_HAS_WIDER_MODES_P (mclass))
2035 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2036 wider_mode != VOIDmode;
2037 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2039 if (optab_handler (binoptab, wider_mode) != CODE_FOR_nothing)
2041 rtx t0 = gen_reg_rtx (wider_mode);
2042 rtx t1 = gen_reg_rtx (wider_mode);
2043 rtx cop0 = convert_modes (wider_mode, mode, op0, unsignedp);
2044 rtx cop1 = convert_modes (wider_mode, mode, op1, unsignedp);
2046 if (expand_twoval_binop (binoptab, cop0, cop1,
2049 convert_move (targ0, t0, unsignedp);
2050 convert_move (targ1, t1, unsignedp);
2054 delete_insns_since (last);
2059 delete_insns_since (entry_last);
2063 /* Expand the two-valued library call indicated by BINOPTAB, but
2064 preserve only one of the values. If TARG0 is non-NULL, the first
2065 value is placed into TARG0; otherwise the second value is placed
2066 into TARG1. Exactly one of TARG0 and TARG1 must be non-NULL. The
2067 value stored into TARG0 or TARG1 is equivalent to (CODE OP0 OP1).
2068 This routine assumes that the value returned by the library call is
2069 as if the return value was of an integral mode twice as wide as the
2070 mode of OP0. Returns 1 if the call was successful. */
2073 expand_twoval_binop_libfunc (optab binoptab, rtx op0, rtx op1,
2074 rtx targ0, rtx targ1, enum rtx_code code)
2077 machine_mode libval_mode;
2082 /* Exactly one of TARG0 or TARG1 should be non-NULL. */
2083 gcc_assert (!targ0 != !targ1);
2085 mode = GET_MODE (op0);
2086 libfunc = optab_libfunc (binoptab, mode);
2090 /* The value returned by the library function will have twice as
2091 many bits as the nominal MODE. */
2092 libval_mode = smallest_mode_for_size (2 * GET_MODE_BITSIZE (mode),
2095 libval = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
2099 /* Get the part of VAL containing the value that we want. */
2100 libval = simplify_gen_subreg (mode, libval, libval_mode,
2101 targ0 ? 0 : GET_MODE_SIZE (mode));
2102 insns = get_insns ();
2104 /* Move the into the desired location. */
2105 emit_libcall_block (insns, targ0 ? targ0 : targ1, libval,
2106 gen_rtx_fmt_ee (code, mode, op0, op1));
2112 /* Wrapper around expand_unop which takes an rtx code to specify
2113 the operation to perform, not an optab pointer. All other
2114 arguments are the same. */
2116 expand_simple_unop (machine_mode mode, enum rtx_code code, rtx op0,
2117 rtx target, int unsignedp)
2119 optab unop = code_to_optab (code);
2122 return expand_unop (mode, unop, op0, target, unsignedp);
2128 (clz:wide (zero_extend:wide x)) - ((width wide) - (width narrow)).
2130 A similar operation can be used for clrsb. UNOPTAB says which operation
2131 we are trying to expand. */
2133 widen_leading (machine_mode mode, rtx op0, rtx target, optab unoptab)
2135 enum mode_class mclass = GET_MODE_CLASS (mode);
2136 if (CLASS_HAS_WIDER_MODES_P (mclass))
2138 machine_mode wider_mode;
2139 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2140 wider_mode != VOIDmode;
2141 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2143 if (optab_handler (unoptab, wider_mode) != CODE_FOR_nothing)
2148 last = get_last_insn ();
2151 target = gen_reg_rtx (mode);
2152 xop0 = widen_operand (op0, wider_mode, mode,
2153 unoptab != clrsb_optab, false);
2154 temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX,
2155 unoptab != clrsb_optab);
2158 (wider_mode, sub_optab, temp,
2159 gen_int_mode (GET_MODE_PRECISION (wider_mode)
2160 - GET_MODE_PRECISION (mode),
2162 target, true, OPTAB_DIRECT);
2164 delete_insns_since (last);
2173 /* Try calculating clz of a double-word quantity as two clz's of word-sized
2174 quantities, choosing which based on whether the high word is nonzero. */
2176 expand_doubleword_clz (machine_mode mode, rtx op0, rtx target)
2178 rtx xop0 = force_reg (mode, op0);
2179 rtx subhi = gen_highpart (word_mode, xop0);
2180 rtx sublo = gen_lowpart (word_mode, xop0);
2181 rtx_code_label *hi0_label = gen_label_rtx ();
2182 rtx_code_label *after_label = gen_label_rtx ();
2186 /* If we were not given a target, use a word_mode register, not a
2187 'mode' register. The result will fit, and nobody is expecting
2188 anything bigger (the return type of __builtin_clz* is int). */
2190 target = gen_reg_rtx (word_mode);
2192 /* In any case, write to a word_mode scratch in both branches of the
2193 conditional, so we can ensure there is a single move insn setting
2194 'target' to tag a REG_EQUAL note on. */
2195 result = gen_reg_rtx (word_mode);
2199 /* If the high word is not equal to zero,
2200 then clz of the full value is clz of the high word. */
2201 emit_cmp_and_jump_insns (subhi, CONST0_RTX (word_mode), EQ, 0,
2202 word_mode, true, hi0_label);
2204 temp = expand_unop_direct (word_mode, clz_optab, subhi, result, true);
2209 convert_move (result, temp, true);
2211 emit_jump_insn (targetm.gen_jump (after_label));
2214 /* Else clz of the full value is clz of the low word plus the number
2215 of bits in the high word. */
2216 emit_label (hi0_label);
2218 temp = expand_unop_direct (word_mode, clz_optab, sublo, 0, true);
2221 temp = expand_binop (word_mode, add_optab, temp,
2222 gen_int_mode (GET_MODE_BITSIZE (word_mode), word_mode),
2223 result, true, OPTAB_DIRECT);
2227 convert_move (result, temp, true);
2229 emit_label (after_label);
2230 convert_move (target, result, true);
2235 add_equal_note (seq, target, CLZ, xop0, 0);
2244 /* Try calculating popcount of a double-word quantity as two popcount's of
2245 word-sized quantities and summing up the results. */
2247 expand_doubleword_popcount (machine_mode mode, rtx op0, rtx target)
2254 t0 = expand_unop_direct (word_mode, popcount_optab,
2255 operand_subword_force (op0, 0, mode), NULL_RTX,
2257 t1 = expand_unop_direct (word_mode, popcount_optab,
2258 operand_subword_force (op0, 1, mode), NULL_RTX,
2266 /* If we were not given a target, use a word_mode register, not a
2267 'mode' register. The result will fit, and nobody is expecting
2268 anything bigger (the return type of __builtin_popcount* is int). */
2270 target = gen_reg_rtx (word_mode);
2272 t = expand_binop (word_mode, add_optab, t0, t1, target, 0, OPTAB_DIRECT);
2277 add_equal_note (seq, t, POPCOUNT, op0, 0);
2285 (parity:narrow (low (x) ^ high (x))) */
2287 expand_doubleword_parity (machine_mode mode, rtx op0, rtx target)
2289 rtx t = expand_binop (word_mode, xor_optab,
2290 operand_subword_force (op0, 0, mode),
2291 operand_subword_force (op0, 1, mode),
2292 NULL_RTX, 0, OPTAB_DIRECT);
2293 return expand_unop (word_mode, parity_optab, t, target, true);
2299 (lshiftrt:wide (bswap:wide x) ((width wide) - (width narrow))). */
2301 widen_bswap (machine_mode mode, rtx op0, rtx target)
2303 enum mode_class mclass = GET_MODE_CLASS (mode);
2304 machine_mode wider_mode;
2308 if (!CLASS_HAS_WIDER_MODES_P (mclass))
2311 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2312 wider_mode != VOIDmode;
2313 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2314 if (optab_handler (bswap_optab, wider_mode) != CODE_FOR_nothing)
2319 last = get_last_insn ();
2321 x = widen_operand (op0, wider_mode, mode, true, true);
2322 x = expand_unop (wider_mode, bswap_optab, x, NULL_RTX, true);
2324 gcc_assert (GET_MODE_PRECISION (wider_mode) == GET_MODE_BITSIZE (wider_mode)
2325 && GET_MODE_PRECISION (mode) == GET_MODE_BITSIZE (mode));
2327 x = expand_shift (RSHIFT_EXPR, wider_mode, x,
2328 GET_MODE_BITSIZE (wider_mode)
2329 - GET_MODE_BITSIZE (mode),
2335 target = gen_reg_rtx (mode);
2336 emit_move_insn (target, gen_lowpart (mode, x));
2339 delete_insns_since (last);
2344 /* Try calculating bswap as two bswaps of two word-sized operands. */
2347 expand_doubleword_bswap (machine_mode mode, rtx op, rtx target)
2351 t1 = expand_unop (word_mode, bswap_optab,
2352 operand_subword_force (op, 0, mode), NULL_RTX, true);
2353 t0 = expand_unop (word_mode, bswap_optab,
2354 operand_subword_force (op, 1, mode), NULL_RTX, true);
2356 if (target == 0 || !valid_multiword_target_p (target))
2357 target = gen_reg_rtx (mode);
2359 emit_clobber (target);
2360 emit_move_insn (operand_subword (target, 0, 1, mode), t0);
2361 emit_move_insn (operand_subword (target, 1, 1, mode), t1);
2366 /* Try calculating (parity x) as (and (popcount x) 1), where
2367 popcount can also be done in a wider mode. */
2369 expand_parity (machine_mode mode, rtx op0, rtx target)
2371 enum mode_class mclass = GET_MODE_CLASS (mode);
2372 if (CLASS_HAS_WIDER_MODES_P (mclass))
2374 machine_mode wider_mode;
2375 for (wider_mode = mode; wider_mode != VOIDmode;
2376 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2378 if (optab_handler (popcount_optab, wider_mode) != CODE_FOR_nothing)
2383 last = get_last_insn ();
2386 target = gen_reg_rtx (mode);
2387 xop0 = widen_operand (op0, wider_mode, mode, true, false);
2388 temp = expand_unop (wider_mode, popcount_optab, xop0, NULL_RTX,
2391 temp = expand_binop (wider_mode, and_optab, temp, const1_rtx,
2392 target, true, OPTAB_DIRECT);
2394 delete_insns_since (last);
2403 /* Try calculating ctz(x) as K - clz(x & -x) ,
2404 where K is GET_MODE_PRECISION(mode) - 1.
2406 Both __builtin_ctz and __builtin_clz are undefined at zero, so we
2407 don't have to worry about what the hardware does in that case. (If
2408 the clz instruction produces the usual value at 0, which is K, the
2409 result of this code sequence will be -1; expand_ffs, below, relies
2410 on this. It might be nice to have it be K instead, for consistency
2411 with the (very few) processors that provide a ctz with a defined
2412 value, but that would take one more instruction, and it would be
2413 less convenient for expand_ffs anyway. */
2416 expand_ctz (machine_mode mode, rtx op0, rtx target)
2421 if (optab_handler (clz_optab, mode) == CODE_FOR_nothing)
2426 temp = expand_unop_direct (mode, neg_optab, op0, NULL_RTX, true);
2428 temp = expand_binop (mode, and_optab, op0, temp, NULL_RTX,
2429 true, OPTAB_DIRECT);
2431 temp = expand_unop_direct (mode, clz_optab, temp, NULL_RTX, true);
2433 temp = expand_binop (mode, sub_optab,
2434 gen_int_mode (GET_MODE_PRECISION (mode) - 1, mode),
2436 true, OPTAB_DIRECT);
2446 add_equal_note (seq, temp, CTZ, op0, 0);
2452 /* Try calculating ffs(x) using ctz(x) if we have that instruction, or
2453 else with the sequence used by expand_clz.
2455 The ffs builtin promises to return zero for a zero value and ctz/clz
2456 may have an undefined value in that case. If they do not give us a
2457 convenient value, we have to generate a test and branch. */
2459 expand_ffs (machine_mode mode, rtx op0, rtx target)
2461 HOST_WIDE_INT val = 0;
2462 bool defined_at_zero = false;
2466 if (optab_handler (ctz_optab, mode) != CODE_FOR_nothing)
2470 temp = expand_unop_direct (mode, ctz_optab, op0, 0, true);
2474 defined_at_zero = (CTZ_DEFINED_VALUE_AT_ZERO (mode, val) == 2);
2476 else if (optab_handler (clz_optab, mode) != CODE_FOR_nothing)
2479 temp = expand_ctz (mode, op0, 0);
2483 if (CLZ_DEFINED_VALUE_AT_ZERO (mode, val) == 2)
2485 defined_at_zero = true;
2486 val = (GET_MODE_PRECISION (mode) - 1) - val;
2492 if (defined_at_zero && val == -1)
2493 /* No correction needed at zero. */;
2496 /* We don't try to do anything clever with the situation found
2497 on some processors (eg Alpha) where ctz(0:mode) ==
2498 bitsize(mode). If someone can think of a way to send N to -1
2499 and leave alone all values in the range 0..N-1 (where N is a
2500 power of two), cheaper than this test-and-branch, please add it.
2502 The test-and-branch is done after the operation itself, in case
2503 the operation sets condition codes that can be recycled for this.
2504 (This is true on i386, for instance.) */
2506 rtx_code_label *nonzero_label = gen_label_rtx ();
2507 emit_cmp_and_jump_insns (op0, CONST0_RTX (mode), NE, 0,
2508 mode, true, nonzero_label);
2510 convert_move (temp, GEN_INT (-1), false);
2511 emit_label (nonzero_label);
2514 /* temp now has a value in the range -1..bitsize-1. ffs is supposed
2515 to produce a value in the range 0..bitsize. */
2516 temp = expand_binop (mode, add_optab, temp, gen_int_mode (1, mode),
2517 target, false, OPTAB_DIRECT);
2524 add_equal_note (seq, temp, FFS, op0, 0);
2533 /* Extract the OMODE lowpart from VAL, which has IMODE. Under certain
2534 conditions, VAL may already be a SUBREG against which we cannot generate
2535 a further SUBREG. In this case, we expect forcing the value into a
2536 register will work around the situation. */
2539 lowpart_subreg_maybe_copy (machine_mode omode, rtx val,
2543 ret = lowpart_subreg (omode, val, imode);
2546 val = force_reg (imode, val);
2547 ret = lowpart_subreg (omode, val, imode);
2548 gcc_assert (ret != NULL);
2553 /* Expand a floating point absolute value or negation operation via a
2554 logical operation on the sign bit. */
2557 expand_absneg_bit (enum rtx_code code, machine_mode mode,
2558 rtx op0, rtx target)
2560 const struct real_format *fmt;
2561 int bitpos, word, nwords, i;
2566 /* The format has to have a simple sign bit. */
2567 fmt = REAL_MODE_FORMAT (mode);
2571 bitpos = fmt->signbit_rw;
2575 /* Don't create negative zeros if the format doesn't support them. */
2576 if (code == NEG && !fmt->has_signed_zero)
2579 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
2581 imode = int_mode_for_mode (mode);
2582 if (imode == BLKmode)
2591 if (FLOAT_WORDS_BIG_ENDIAN)
2592 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
2594 word = bitpos / BITS_PER_WORD;
2595 bitpos = bitpos % BITS_PER_WORD;
2596 nwords = (GET_MODE_BITSIZE (mode) + BITS_PER_WORD - 1) / BITS_PER_WORD;
2599 wide_int mask = wi::set_bit_in_zero (bitpos, GET_MODE_PRECISION (imode));
2605 || (nwords > 1 && !valid_multiword_target_p (target)))
2606 target = gen_reg_rtx (mode);
2612 for (i = 0; i < nwords; ++i)
2614 rtx targ_piece = operand_subword (target, i, 1, mode);
2615 rtx op0_piece = operand_subword_force (op0, i, mode);
2619 temp = expand_binop (imode, code == ABS ? and_optab : xor_optab,
2621 immed_wide_int_const (mask, imode),
2622 targ_piece, 1, OPTAB_LIB_WIDEN);
2623 if (temp != targ_piece)
2624 emit_move_insn (targ_piece, temp);
2627 emit_move_insn (targ_piece, op0_piece);
2630 insns = get_insns ();
2637 temp = expand_binop (imode, code == ABS ? and_optab : xor_optab,
2638 gen_lowpart (imode, op0),
2639 immed_wide_int_const (mask, imode),
2640 gen_lowpart (imode, target), 1, OPTAB_LIB_WIDEN);
2641 target = lowpart_subreg_maybe_copy (mode, temp, imode);
2643 set_dst_reg_note (get_last_insn (), REG_EQUAL,
2644 gen_rtx_fmt_e (code, mode, copy_rtx (op0)),
2651 /* As expand_unop, but will fail rather than attempt the operation in a
2652 different mode or with a libcall. */
2654 expand_unop_direct (machine_mode mode, optab unoptab, rtx op0, rtx target,
2657 if (optab_handler (unoptab, mode) != CODE_FOR_nothing)
2659 struct expand_operand ops[2];
2660 enum insn_code icode = optab_handler (unoptab, mode);
2661 rtx_insn *last = get_last_insn ();
2664 create_output_operand (&ops[0], target, mode);
2665 create_convert_operand_from (&ops[1], op0, mode, unsignedp);
2666 pat = maybe_gen_insn (icode, 2, ops);
2669 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX
2670 && ! add_equal_note (pat, ops[0].value,
2671 optab_to_code (unoptab),
2672 ops[1].value, NULL_RTX))
2674 delete_insns_since (last);
2675 return expand_unop (mode, unoptab, op0, NULL_RTX, unsignedp);
2680 return ops[0].value;
2686 /* Generate code to perform an operation specified by UNOPTAB
2687 on operand OP0, with result having machine-mode MODE.
2689 UNSIGNEDP is for the case where we have to widen the operands
2690 to perform the operation. It says to use zero-extension.
2692 If TARGET is nonzero, the value
2693 is generated there, if it is convenient to do so.
2694 In all cases an rtx is returned for the locus of the value;
2695 this may or may not be TARGET. */
2698 expand_unop (machine_mode mode, optab unoptab, rtx op0, rtx target,
2701 enum mode_class mclass = GET_MODE_CLASS (mode);
2702 machine_mode wider_mode;
2706 temp = expand_unop_direct (mode, unoptab, op0, target, unsignedp);
2710 /* It can't be done in this mode. Can we open-code it in a wider mode? */
2712 /* Widening (or narrowing) clz needs special treatment. */
2713 if (unoptab == clz_optab)
2715 temp = widen_leading (mode, op0, target, unoptab);
2719 if (GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
2720 && optab_handler (unoptab, word_mode) != CODE_FOR_nothing)
2722 temp = expand_doubleword_clz (mode, op0, target);
2730 if (unoptab == clrsb_optab)
2732 temp = widen_leading (mode, op0, target, unoptab);
2738 if (unoptab == popcount_optab
2739 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
2740 && optab_handler (unoptab, word_mode) != CODE_FOR_nothing
2741 && optimize_insn_for_speed_p ())
2743 temp = expand_doubleword_popcount (mode, op0, target);
2748 if (unoptab == parity_optab
2749 && GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
2750 && (optab_handler (unoptab, word_mode) != CODE_FOR_nothing
2751 || optab_handler (popcount_optab, word_mode) != CODE_FOR_nothing)
2752 && optimize_insn_for_speed_p ())
2754 temp = expand_doubleword_parity (mode, op0, target);
2759 /* Widening (or narrowing) bswap needs special treatment. */
2760 if (unoptab == bswap_optab)
2762 /* HImode is special because in this mode BSWAP is equivalent to ROTATE
2763 or ROTATERT. First try these directly; if this fails, then try the
2764 obvious pair of shifts with allowed widening, as this will probably
2765 be always more efficient than the other fallback methods. */
2771 if (optab_handler (rotl_optab, mode) != CODE_FOR_nothing)
2773 temp = expand_binop (mode, rotl_optab, op0, GEN_INT (8), target,
2774 unsignedp, OPTAB_DIRECT);
2779 if (optab_handler (rotr_optab, mode) != CODE_FOR_nothing)
2781 temp = expand_binop (mode, rotr_optab, op0, GEN_INT (8), target,
2782 unsignedp, OPTAB_DIRECT);
2787 last = get_last_insn ();
2789 temp1 = expand_binop (mode, ashl_optab, op0, GEN_INT (8), NULL_RTX,
2790 unsignedp, OPTAB_WIDEN);
2791 temp2 = expand_binop (mode, lshr_optab, op0, GEN_INT (8), NULL_RTX,
2792 unsignedp, OPTAB_WIDEN);
2795 temp = expand_binop (mode, ior_optab, temp1, temp2, target,
2796 unsignedp, OPTAB_WIDEN);
2801 delete_insns_since (last);
2804 temp = widen_bswap (mode, op0, target);
2808 if (GET_MODE_SIZE (mode) == 2 * UNITS_PER_WORD
2809 && optab_handler (unoptab, word_mode) != CODE_FOR_nothing)
2811 temp = expand_doubleword_bswap (mode, op0, target);
2819 if (CLASS_HAS_WIDER_MODES_P (mclass))
2820 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2821 wider_mode != VOIDmode;
2822 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2824 if (optab_handler (unoptab, wider_mode) != CODE_FOR_nothing)
2827 rtx_insn *last = get_last_insn ();
2829 /* For certain operations, we need not actually extend
2830 the narrow operand, as long as we will truncate the
2831 results to the same narrowness. */
2833 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp,
2834 (unoptab == neg_optab
2835 || unoptab == one_cmpl_optab)
2836 && mclass == MODE_INT);
2838 temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX,
2843 if (mclass != MODE_INT
2844 || !TRULY_NOOP_TRUNCATION_MODES_P (mode, wider_mode))
2847 target = gen_reg_rtx (mode);
2848 convert_move (target, temp, 0);
2852 return gen_lowpart (mode, temp);
2855 delete_insns_since (last);
2859 /* These can be done a word at a time. */
2860 if (unoptab == one_cmpl_optab
2861 && mclass == MODE_INT
2862 && GET_MODE_SIZE (mode) > UNITS_PER_WORD
2863 && optab_handler (unoptab, word_mode) != CODE_FOR_nothing)
2868 if (target == 0 || target == op0 || !valid_multiword_target_p (target))
2869 target = gen_reg_rtx (mode);
2873 /* Do the actual arithmetic. */
2874 for (i = 0; i < GET_MODE_BITSIZE (mode) / BITS_PER_WORD; i++)
2876 rtx target_piece = operand_subword (target, i, 1, mode);
2877 rtx x = expand_unop (word_mode, unoptab,
2878 operand_subword_force (op0, i, mode),
2879 target_piece, unsignedp);
2881 if (target_piece != x)
2882 emit_move_insn (target_piece, x);
2885 insns = get_insns ();
2892 if (optab_to_code (unoptab) == NEG)
2894 /* Try negating floating point values by flipping the sign bit. */
2895 if (SCALAR_FLOAT_MODE_P (mode))
2897 temp = expand_absneg_bit (NEG, mode, op0, target);
2902 /* If there is no negation pattern, and we have no negative zero,
2903 try subtracting from zero. */
2904 if (!HONOR_SIGNED_ZEROS (mode))
2906 temp = expand_binop (mode, (unoptab == negv_optab
2907 ? subv_optab : sub_optab),
2908 CONST0_RTX (mode), op0, target,
2909 unsignedp, OPTAB_DIRECT);
2915 /* Try calculating parity (x) as popcount (x) % 2. */
2916 if (unoptab == parity_optab)
2918 temp = expand_parity (mode, op0, target);
2923 /* Try implementing ffs (x) in terms of clz (x). */
2924 if (unoptab == ffs_optab)
2926 temp = expand_ffs (mode, op0, target);
2931 /* Try implementing ctz (x) in terms of clz (x). */
2932 if (unoptab == ctz_optab)
2934 temp = expand_ctz (mode, op0, target);
2940 /* Now try a library call in this mode. */
2941 libfunc = optab_libfunc (unoptab, mode);
2947 machine_mode outmode = mode;
2949 /* All of these functions return small values. Thus we choose to
2950 have them return something that isn't a double-word. */
2951 if (unoptab == ffs_optab || unoptab == clz_optab || unoptab == ctz_optab
2952 || unoptab == clrsb_optab || unoptab == popcount_optab
2953 || unoptab == parity_optab)
2955 = GET_MODE (hard_libcall_value (TYPE_MODE (integer_type_node),
2956 optab_libfunc (unoptab, mode)));
2960 /* Pass 1 for NO_QUEUE so we don't lose any increments
2961 if the libcall is cse'd or moved. */
2962 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST, outmode,
2964 insns = get_insns ();
2967 target = gen_reg_rtx (outmode);
2968 bool trapv = trapv_unoptab_p (unoptab);
2970 eq_value = NULL_RTX;
2973 eq_value = gen_rtx_fmt_e (optab_to_code (unoptab), mode, op0);
2974 if (GET_MODE_SIZE (outmode) < GET_MODE_SIZE (mode))
2975 eq_value = simplify_gen_unary (TRUNCATE, outmode, eq_value, mode);
2976 else if (GET_MODE_SIZE (outmode) > GET_MODE_SIZE (mode))
2977 eq_value = simplify_gen_unary (ZERO_EXTEND,
2978 outmode, eq_value, mode);
2980 emit_libcall_block_1 (insns, target, value, eq_value, trapv);
2985 /* It can't be done in this mode. Can we do it in a wider mode? */
2987 if (CLASS_HAS_WIDER_MODES_P (mclass))
2989 for (wider_mode = GET_MODE_WIDER_MODE (mode);
2990 wider_mode != VOIDmode;
2991 wider_mode = GET_MODE_WIDER_MODE (wider_mode))
2993 if (optab_handler (unoptab, wider_mode) != CODE_FOR_nothing
2994 || optab_libfunc (unoptab, wider_mode))
2997 rtx_insn *last = get_last_insn ();
2999 /* For certain operations, we need not actually extend
3000 the narrow operand, as long as we will truncate the
3001 results to the same narrowness. */
3002 xop0 = widen_operand (xop0, wider_mode, mode, unsignedp,
3003 (unoptab == neg_optab
3004 || unoptab == one_cmpl_optab
3005 || unoptab == bswap_optab)
3006 && mclass == MODE_INT);
3008 temp = expand_unop (wider_mode, unoptab, xop0, NULL_RTX,
3011 /* If we are generating clz using wider mode, adjust the
3012 result. Similarly for clrsb. */
3013 if ((unoptab == clz_optab || unoptab == clrsb_optab)
3016 (wider_mode, sub_optab, temp,
3017 gen_int_mode (GET_MODE_PRECISION (wider_mode)
3018 - GET_MODE_PRECISION (mode),
3020 target, true, OPTAB_DIRECT);
3022 /* Likewise for bswap. */
3023 if (unoptab == bswap_optab && temp != 0)
3025 gcc_assert (GET_MODE_PRECISION (wider_mode)
3026 == GET_MODE_BITSIZE (wider_mode)
3027 && GET_MODE_PRECISION (mode)
3028 == GET_MODE_BITSIZE (mode));
3030 temp = expand_shift (RSHIFT_EXPR, wider_mode, temp,
3031 GET_MODE_BITSIZE (wider_mode)
3032 - GET_MODE_BITSIZE (mode),
3038 if (mclass != MODE_INT)
3041 target = gen_reg_rtx (mode);
3042 convert_move (target, temp, 0);
3046 return gen_lowpart (mode, temp);
3049 delete_insns_since (last);
3054 /* One final attempt at implementing negation via subtraction,
3055 this time allowing widening of the operand. */
3056 if (optab_to_code (unoptab) == NEG && !HONOR_SIGNED_ZEROS (mode))
3059 temp = expand_binop (mode,
3060 unoptab == negv_optab ? subv_optab : sub_optab,
3061 CONST0_RTX (mode), op0,
3062 target, unsignedp, OPTAB_LIB_WIDEN);
3070 /* Emit code to compute the absolute value of OP0, with result to
3071 TARGET if convenient. (TARGET may be 0.) The return value says
3072 where the result actually is to be found.
3074 MODE is the mode of the operand; the mode of the result is
3075 different but can be deduced from MODE.
3080 expand_abs_nojump (machine_mode mode, rtx op0, rtx target,
3081 int result_unsignedp)
3085 if (GET_MODE_CLASS (mode) != MODE_INT
3087 result_unsignedp = 1;
3089 /* First try to do it with a special abs instruction. */
3090 temp = expand_unop (mode, result_unsignedp ? abs_optab : absv_optab,
3095 /* For floating point modes, try clearing the sign bit. */
3096 if (SCALAR_FLOAT_MODE_P (mode))
3098 temp = expand_absneg_bit (ABS, mode, op0, target);
3103 /* If we have a MAX insn, we can do this as MAX (x, -x). */
3104 if (optab_handler (smax_optab, mode) != CODE_FOR_nothing
3105 && !HONOR_SIGNED_ZEROS (mode))
3107 rtx_insn *last = get_last_insn ();
3109 temp = expand_unop (mode, result_unsignedp ? neg_optab : negv_optab,
3112 temp = expand_binop (mode, smax_optab, op0, temp, target, 0,
3118 delete_insns_since (last);
3121 /* If this machine has expensive jumps, we can do integer absolute
3122 value of X as (((signed) x >> (W-1)) ^ x) - ((signed) x >> (W-1)),
3123 where W is the width of MODE. */
3125 if (GET_MODE_CLASS (mode) == MODE_INT
3126 && BRANCH_COST (optimize_insn_for_speed_p (),
3129 rtx extended = expand_shift (RSHIFT_EXPR, mode, op0,
3130 GET_MODE_PRECISION (mode) - 1,
3133 temp = expand_binop (mode, xor_optab, extended, op0, target, 0,
3136 temp = expand_binop (mode, result_unsignedp ? sub_optab : subv_optab,
3137 temp, extended, target, 0, OPTAB_LIB_WIDEN);
3147 expand_abs (machine_mode mode, rtx op0, rtx target,
3148 int result_unsignedp, int safe)
3151 rtx_code_label *op1;
3153 if (GET_MODE_CLASS (mode) != MODE_INT
3155 result_unsignedp = 1;
3157 temp = expand_abs_nojump (mode, op0, target, result_unsignedp);
3161 /* If that does not win, use conditional jump and negate. */
3163 /* It is safe to use the target if it is the same
3164 as the source if this is also a pseudo register */
3165 if (op0 == target && REG_P (op0)
3166 && REGNO (op0) >= FIRST_PSEUDO_REGISTER)
3169 op1 = gen_label_rtx ();
3170 if (target == 0 || ! safe
3171 || GET_MODE (target) != mode
3172 || (MEM_P (target) && MEM_VOLATILE_P (target))
3174 && REGNO (target) < FIRST_PSEUDO_REGISTER))
3175 target = gen_reg_rtx (mode);
3177 emit_move_insn (target, op0);
3180 do_compare_rtx_and_jump (target, CONST0_RTX (mode), GE, 0, mode,
3181 NULL_RTX, NULL, op1, -1);
3183 op0 = expand_unop (mode, result_unsignedp ? neg_optab : negv_optab,
3186 emit_move_insn (target, op0);
3192 /* Emit code to compute the one's complement absolute value of OP0
3193 (if (OP0 < 0) OP0 = ~OP0), with result to TARGET if convenient.
3194 (TARGET may be NULL_RTX.) The return value says where the result
3195 actually is to be found.
3197 MODE is the mode of the operand; the mode of the result is
3198 different but can be deduced from MODE. */
3201 expand_one_cmpl_abs_nojump (machine_mode mode, rtx op0, rtx target)
3205 /* Not applicable for floating point modes. */
3206 if (FLOAT_MODE_P (mode))
3209 /* If we have a MAX insn, we can do this as MAX (x, ~x). */
3210 if (optab_handler (smax_optab, mode) != CODE_FOR_nothing)
3212 rtx_insn *last = get_last_insn ();
3214 temp = expand_unop (mode, one_cmpl_optab, op0, NULL_RTX, 0);
3216 temp = expand_binop (mode, smax_optab, op0, temp, target, 0,
3222 delete_insns_since (last);
3225 /* If this machine has expensive jumps, we can do one's complement
3226 absolute value of X as (((signed) x >> (W-1)) ^ x). */
3228 if (GET_MODE_CLASS (mode) == MODE_INT
3229 && BRANCH_COST (optimize_insn_for_speed_p (),
3232 rtx extended = expand_shift (RSHIFT_EXPR, mode, op0,
3233 GET_MODE_PRECISION (mode) - 1,
3236 temp = expand_binop (mode, xor_optab, extended, op0, target, 0,
3246 /* A subroutine of expand_copysign, perform the copysign operation using the
3247 abs and neg primitives advertised to exist on the target. The assumption
3248 is that we have a split register file, and leaving op0 in fp registers,
3249 and not playing with subregs so much, will help the register allocator. */
3252 expand_copysign_absneg (machine_mode mode, rtx op0, rtx op1, rtx target,
3253 int bitpos, bool op0_is_abs)
3256 enum insn_code icode;
3258 rtx_code_label *label;
3263 /* Check if the back end provides an insn that handles signbit for the
3265 icode = optab_handler (signbit_optab, mode);
3266 if (icode != CODE_FOR_nothing)
3268 imode = insn_data[(int) icode].operand[0].mode;
3269 sign = gen_reg_rtx (imode);
3270 emit_unop_insn (icode, sign, op1, UNKNOWN);
3274 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
3276 imode = int_mode_for_mode (mode);
3277 if (imode == BLKmode)
3279 op1 = gen_lowpart (imode, op1);
3286 if (FLOAT_WORDS_BIG_ENDIAN)
3287 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
3289 word = bitpos / BITS_PER_WORD;
3290 bitpos = bitpos % BITS_PER_WORD;
3291 op1 = operand_subword_force (op1, word, mode);
3294 wide_int mask = wi::set_bit_in_zero (bitpos, GET_MODE_PRECISION (imode));
3295 sign = expand_binop (imode, and_optab, op1,
3296 immed_wide_int_const (mask, imode),
3297 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3302 op0 = expand_unop (mode, abs_optab, op0, target, 0);
3309 if (target == NULL_RTX)
3310 target = copy_to_reg (op0);
3312 emit_move_insn (target, op0);
3315 label = gen_label_rtx ();
3316 emit_cmp_and_jump_insns (sign, const0_rtx, EQ, NULL_RTX, imode, 1, label);
3318 if (CONST_DOUBLE_AS_FLOAT_P (op0))
3319 op0 = simplify_unary_operation (NEG, mode, op0, mode);
3321 op0 = expand_unop (mode, neg_optab, op0, target, 0);
3323 emit_move_insn (target, op0);
3331 /* A subroutine of expand_copysign, perform the entire copysign operation
3332 with integer bitmasks. BITPOS is the position of the sign bit; OP0_IS_ABS
3333 is true if op0 is known to have its sign bit clear. */
3336 expand_copysign_bit (machine_mode mode, rtx op0, rtx op1, rtx target,
3337 int bitpos, bool op0_is_abs)
3340 int word, nwords, i;
3344 if (GET_MODE_SIZE (mode) <= UNITS_PER_WORD)
3346 imode = int_mode_for_mode (mode);
3347 if (imode == BLKmode)
3356 if (FLOAT_WORDS_BIG_ENDIAN)
3357 word = (GET_MODE_BITSIZE (mode) - bitpos) / BITS_PER_WORD;
3359 word = bitpos / BITS_PER_WORD;
3360 bitpos = bitpos % BITS_PER_WORD;
3361 nwords = (GET_MODE_BITSIZE (mode) + BITS_PER_WORD - 1) / BITS_PER_WORD;
3364 wide_int mask = wi::set_bit_in_zero (bitpos, GET_MODE_PRECISION (imode));
3369 || (nwords > 1 && !valid_multiword_target_p (target)))
3370 target = gen_reg_rtx (mode);
3376 for (i = 0; i < nwords; ++i)
3378 rtx targ_piece = operand_subword (target, i, 1, mode);
3379 rtx op0_piece = operand_subword_force (op0, i, mode);
3385 = expand_binop (imode, and_optab, op0_piece,
3386 immed_wide_int_const (~mask, imode),
3387 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3388 op1 = expand_binop (imode, and_optab,
3389 operand_subword_force (op1, i, mode),
3390 immed_wide_int_const (mask, imode),
3391 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3393 temp = expand_binop (imode, ior_optab, op0_piece, op1,
3394 targ_piece, 1, OPTAB_LIB_WIDEN);
3395 if (temp != targ_piece)
3396 emit_move_insn (targ_piece, temp);
3399 emit_move_insn (targ_piece, op0_piece);
3402 insns = get_insns ();
3409 op1 = expand_binop (imode, and_optab, gen_lowpart (imode, op1),
3410 immed_wide_int_const (mask, imode),
3411 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3413 op0 = gen_lowpart (imode, op0);
3415 op0 = expand_binop (imode, and_optab, op0,
3416 immed_wide_int_const (~mask, imode),
3417 NULL_RTX, 1, OPTAB_LIB_WIDEN);
3419 temp = expand_binop (imode, ior_optab, op0, op1,
3420 gen_lowpart (imode, target), 1, OPTAB_LIB_WIDEN);
3421 target = lowpart_subreg_maybe_copy (mode, temp, imode);
3427 /* Expand the C99 copysign operation. OP0 and OP1 must be the same
3428 scalar floating point mode. Return NULL if we do not know how to
3429 expand the operation inline. */
3432 expand_copysign (rtx op0, rtx op1, rtx target)
3434 machine_mode mode = GET_MODE (op0);
3435 const struct real_format *fmt;
3439 gcc_assert (SCALAR_FLOAT_MODE_P (mode));
3440 gcc_assert (GET_MODE (op1) == mode);
3442 /* First try to do it with a special instruction. */
3443 temp = expand_binop (mode, copysign_optab, op0, op1,
3444 target, 0, OPTAB_DIRECT);
3448 fmt = REAL_MODE_FORMAT (mode);
3449 if (fmt == NULL || !fmt->has_signed_zero)
3453 if (CONST_DOUBLE_AS_FLOAT_P (op0))
3455 if (real_isneg (CONST_DOUBLE_REAL_VALUE (op0)))
3456 op0 = simplify_unary_operation (ABS, mode, op0, mode);
3460 if (fmt->signbit_ro >= 0
3461 && (CONST_DOUBLE_AS_FLOAT_P (op0)
3462 || (optab_handler (neg_optab, mode) != CODE_FOR_nothing
3463 && optab_handler (abs_optab, mode) != CODE_FOR_nothing)))
3465 temp = expand_copysign_absneg (mode, op0, op1, target,
3466 fmt->signbit_ro, op0_is_abs);
3471 if (fmt->signbit_rw < 0)
3473 return expand_copysign_bit (mode, op0, op1, target,
3474 fmt->signbit_rw, op0_is_abs);
3477 /* Generate an instruction whose insn-code is INSN_CODE,
3478 with two operands: an output TARGET and an input OP0.
3479 TARGET *must* be nonzero, and the output is always stored there.
3480 CODE is an rtx code such that (CODE OP0) is an rtx that describes
3481 the value that is stored into TARGET.
3483 Return false if expansion failed. */
3486 maybe_emit_unop_insn (enum insn_code icode, rtx target, rtx op0,
3489 struct expand_operand ops[2];
3492 create_output_operand (&ops[0], target, GET_MODE (target));
3493 create_input_operand (&ops[1], op0, GET_MODE (op0));
3494 pat = maybe_gen_insn (icode, 2, ops);
3498 if (INSN_P (pat) && NEXT_INSN (pat) != NULL_RTX
3500 add_equal_note (pat, ops[0].value, code, ops[1].value, NULL_RTX);
3504 if (ops[0].value != target)
3505 emit_move_insn (target, ops[0].value);
3508 /* Generate an instruction whose insn-code is INSN_CODE,
3509 with two operands: an output TARGET and an input OP0.
3510 TARGET *must* be nonzero, and the output is always stored there.
3511 CODE is an rtx code such that (CODE OP0) is an rtx that describes
3512 the value that is stored into TARGET. */
3515 emit_unop_insn (enum insn_code icode, rtx target, rtx op0, enum rtx_code code)
3517 bool ok = maybe_emit_unop_insn (icode, target, op0, code);
3521 struct no_conflict_data
3524 rtx_insn *first, *insn;
3528 /* Called via note_stores by emit_libcall_block. Set P->must_stay if
3529 the currently examined clobber / store has to stay in the list of
3530 insns that constitute the actual libcall block. */
3532 no_conflict_move_test (rtx dest, const_rtx set, void *p0)
3534 struct no_conflict_data *p= (struct no_conflict_data *) p0;
3536 /* If this inns directly contributes to setting the target, it must stay. */
3537 if (reg_overlap_mentioned_p (p->target, dest))
3538 p->must_stay = true;
3539 /* If we haven't committed to keeping any other insns in the list yet,
3540 there is nothing more to check. */
3541 else if (p->insn == p->first)
3543 /* If this insn sets / clobbers a register that feeds one of the insns
3544 already in the list, this insn has to stay too. */
3545 else if (reg_overlap_mentioned_p (dest, PATTERN (p->first))
3546 || (CALL_P (p->first) && (find_reg_fusage (p->first, USE, dest)))
3547 || reg_used_between_p (dest, p->first, p->insn)
3548 /* Likewise if this insn depends on a register set by a previous
3549 insn in the list, or if it sets a result (presumably a hard
3550 register) that is set or clobbered by a previous insn.
3551 N.B. the modified_*_p (SET_DEST...) tests applied to a MEM
3552 SET_DEST perform the former check on the address, and the latter
3553 check on the MEM. */
3554 || (GET_CODE (set) == SET
3555 && (modified_in_p (SET_SRC (set), p->first)
3556 || modified_in_p (SET_DEST (set), p->first)
3557 || modified_between_p (SET_SRC (set), p->first, p->insn)
3558 || modified_between_p (SET_DEST (set), p->first, p->insn))))
3559 p->must_stay = true;
3563 /* Emit code to make a call to a constant function or a library call.
3565 INSNS is a list containing all insns emitted in the call.
3566 These insns leave the result in RESULT. Our block is to copy RESULT
3567 to TARGET, which is logically equivalent to EQUIV.
3569 We first emit any insns that set a pseudo on the assumption that these are
3570 loading constants into registers; doing so allows them to be safely cse'ed
3571 between blocks. Then we emit all the other insns in the block, followed by
3572 an insn to move RESULT to TARGET. This last insn will have a REQ_EQUAL
3573 note with an operand of EQUIV. */
3576 emit_libcall_block_1 (rtx_insn *insns, rtx target, rtx result, rtx equiv,
3577 bool equiv_may_trap)
3579 rtx final_dest = target;
3580 rtx_insn *next, *last, *insn;
3582 /* If this is a reg with REG_USERVAR_P set, then it could possibly turn
3583 into a MEM later. Protect the libcall block from this change. */
3584 if (! REG_P (target) || REG_USERVAR_P (target))
3585 target = gen_reg_rtx (GET_MODE (target));
3587 /* If we're using non-call exceptions, a libcall corresponding to an
3588 operation that may trap may also trap. */
3589 /* ??? See the comment in front of make_reg_eh_region_note. */
3590 if (cfun->can_throw_non_call_exceptions
3591 && (equiv_may_trap || may_trap_p (equiv)))
3593 for (insn = insns; insn; insn = NEXT_INSN (insn))
3596 rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
3599 int lp_nr = INTVAL (XEXP (note, 0));
3600 if (lp_nr == 0 || lp_nr == INT_MIN)
3601 remove_note (insn, note);
3607 /* Look for any CALL_INSNs in this sequence, and attach a REG_EH_REGION
3608 reg note to indicate that this call cannot throw or execute a nonlocal
3609 goto (unless there is already a REG_EH_REGION note, in which case
3611 for (insn = insns; insn; insn = NEXT_INSN (insn))
3613 make_reg_eh_region_note_nothrow_nononlocal (insn);
3616 /* First emit all insns that set pseudos. Remove them from the list as
3617 we go. Avoid insns that set pseudos which were referenced in previous
3618 insns. These can be generated by move_by_pieces, for example,
3619 to update an address. Similarly, avoid insns that reference things
3620 set in previous insns. */
3622 for (insn = insns; insn; insn = next)
3624 rtx set = single_set (insn);
3626 next = NEXT_INSN (insn);
3628 if (set != 0 && REG_P (SET_DEST (set))
3629 && REGNO (SET_DEST (set)) >= FIRST_PSEUDO_REGISTER)
3631 struct no_conflict_data data;
3633 data.target = const0_rtx;
3637 note_stores (PATTERN (insn), no_conflict_move_test, &data);
3638 if (! data.must_stay)
3640 if (PREV_INSN (insn))
3641 SET_NEXT_INSN (PREV_INSN (insn)) = next;
3646 SET_PREV_INSN (next) = PREV_INSN (insn);
3652 /* Some ports use a loop to copy large arguments onto the stack.
3653 Don't move anything outside such a loop. */
3658 /* Write the remaining insns followed by the final copy. */
3659 for (insn = insns; insn; insn = next)
3661 next = NEXT_INSN (insn);
3666 last = emit_move_insn (target, result);
3668 set_dst_reg_note (last, REG_EQUAL, copy_rtx (equiv), target);
3670 if (final_dest != target)
3671 emit_move_insn (final_dest, target);
3675 emit_libcall_block (rtx insns, rtx target, rtx result, rtx equiv)
3677 emit_libcall_block_1 (safe_as_a <rtx_insn *> (insns),
3678 target, result, equiv, false);
3681 /* Nonzero if we can perform a comparison of mode MODE straightforwardly.
3682 PURPOSE describes how this comparison will be used. CODE is the rtx
3683 comparison code we will be using.
3685 ??? Actually, CODE is slightly weaker than that. A target is still
3686 required to implement all of the normal bcc operations, but not
3687 required to implement all (or any) of the unordered bcc operations. */
3690 can_compare_p (enum rtx_code code, machine_mode mode,
3691 enum can_compare_purpose purpose)
3694 test = gen_rtx_fmt_ee (code, mode, const0_rtx, const0_rtx);
3697 enum insn_code icode;
3699 if (purpose == ccp_jump
3700 && (icode = optab_handler (cbranch_optab, mode)) != CODE_FOR_nothing
3701 && insn_operand_matches (icode, 0, test))
3703 if (purpose == ccp_store_flag
3704 && (icode = optab_handler (cstore_optab, mode)) != CODE_FOR_nothing
3705 && insn_operand_matches (icode, 1, test))
3707 if (purpose == ccp_cmov
3708 && optab_handler (cmov_optab, mode) != CODE_FOR_nothing)
3711 mode = GET_MODE_WIDER_MODE (mode);
3712 PUT_MODE (test, mode);
3714 while (mode != VOIDmode);
3719 /* This function is called when we are going to emit a compare instruction that
3720 compares the values found in *PX and *PY, using the rtl operator COMPARISON.
3722 *PMODE is the mode of the inputs (in case they are const_int).
3723 *PUNSIGNEDP nonzero says that the operands are unsigned;
3724 this matters if they need to be widened (as given by METHODS).
3726 If they have mode BLKmode, then SIZE specifies the size of both operands.
3728 This function performs all the setup necessary so that the caller only has
3729 to emit a single comparison insn. This setup can involve doing a BLKmode
3730 comparison or emitting a library call to perform the comparison if no insn
3731 is available to handle it.
3732 The values which are passed in through pointers can be modified; the caller
3733 should perform the comparison on the modified values. Constant
3734 comparisons must have already been folded. */
3737 prepare_cmp_insn (rtx x, rtx y, enum rtx_code comparison, rtx size,
3738 int unsignedp, enum optab_methods methods,
3739 rtx *ptest, machine_mode *pmode)
3741 machine_mode mode = *pmode;
3743 machine_mode cmp_mode;
3744 enum mode_class mclass;
3746 /* The other methods are not needed. */
3747 gcc_assert (methods == OPTAB_DIRECT || methods == OPTAB_WIDEN
3748 || methods == OPTAB_LIB_WIDEN);
3750 /* If we are optimizing, force expensive constants into a register. */
3751 if (CONSTANT_P (x) && optimize
3752 && (rtx_cost (x, mode, COMPARE, 0, optimize_insn_for_speed_p ())
3753 > COSTS_N_INSNS (1)))
3754 x = force_reg (mode, x);
3756 if (CONSTANT_P (y) && optimize
3757 && (rtx_cost (y, mode, COMPARE, 1, optimize_insn_for_speed_p ())
3758 > COSTS_N_INSNS (1)))
3759 y = force_reg (mode, y);
3762 /* Make sure if we have a canonical comparison. The RTL
3763 documentation states that canonical comparisons are required only
3764 for targets which have cc0. */
3765 gcc_assert (!CONSTANT_P (x) || CONSTANT_P (y));
3768 /* Don't let both operands fail to indicate the mode. */
3769 if (GET_MODE (x) == VOIDmode && GET_MODE (y) == VOIDmode)
3770 x = force_reg (mode, x);
3771 if (mode == VOIDmode)
3772 mode = GET_MODE (x) != VOIDmode ? GET_MODE (x) : GET_MODE (y);
3774 /* Handle all BLKmode compares. */
3776 if (mode == BLKmode)
3778 machine_mode result_mode;
3779 enum insn_code cmp_code;
3784 = GEN_INT (MIN (MEM_ALIGN (x), MEM_ALIGN (y)) / BITS_PER_UNIT);
3788 /* Try to use a memory block compare insn - either cmpstr
3789 or cmpmem will do. */
3790 for (cmp_mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
3791 cmp_mode != VOIDmode;
3792 cmp_mode = GET_MODE_WIDER_MODE (cmp_mode))
3794 cmp_code = direct_optab_handler (cmpmem_optab, cmp_mode);
3795 if (cmp_code == CODE_FOR_nothing)
3796 cmp_code = direct_optab_handler (cmpstr_optab, cmp_mode);
3797 if (cmp_code == CODE_FOR_nothing)
3798 cmp_code = direct_optab_handler (cmpstrn_optab, cmp_mode);
3799 if (cmp_code == CODE_FOR_nothing)
3802 /* Must make sure the size fits the insn's mode. */
3803 if ((CONST_INT_P (size)
3804 && INTVAL (size) >= (1 << GET_MODE_BITSIZE (cmp_mode)))
3805 || (GET_MODE_BITSIZE (GET_MODE (size))
3806 > GET_MODE_BITSIZE (cmp_mode)))
3809 result_mode = insn_data[cmp_code].operand[0].mode;
3810 result = gen_reg_rtx (result_mode);
3811 size = convert_to_mode (cmp_mode, size, 1);
3812 emit_insn (GEN_FCN (cmp_code) (result, x, y, size, opalign));
3814 *ptest = gen_rtx_fmt_ee (comparison, VOIDmode, result, const0_rtx);
3815 *pmode = result_mode;
3819 if (methods != OPTAB_LIB && methods != OPTAB_LIB_WIDEN)
3822 /* Otherwise call a library function, memcmp. */
3823 libfunc = memcmp_libfunc;
3824 length_type = sizetype;
3825 result_mode = TYPE_MODE (integer_type_node);
3826 cmp_mode = TYPE_MODE (length_type);
3827 size = convert_to_mode (TYPE_MODE (length_type), size,
3828 TYPE_UNSIGNED (length_type));
3830 result = emit_library_call_value (libfunc, 0, LCT_PURE,
3838 methods = OPTAB_LIB_WIDEN;
3842 /* Don't allow operands to the compare to trap, as that can put the
3843 compare and branch in different basic blocks. */
3844 if (cfun->can_throw_non_call_exceptions)
3847 x = force_reg (mode, x);
3849 y = force_reg (mode, y);
3852 if (GET_MODE_CLASS (mode) == MODE_CC)
3854 enum insn_code icode = optab_handler (cbranch_optab, CCmode);
3855 test = gen_rtx_fmt_ee (comparison, VOIDmode, x, y);
3856 gcc_assert (icode != CODE_FOR_nothing
3857 && insn_operand_matches (icode, 0, test));
3862 mclass = GET_MODE_CLASS (mode);
3863 test = gen_rtx_fmt_ee (comparison, VOIDmode, x, y);
3867 enum insn_code icode;
3868 icode = optab_handler (cbranch_optab, cmp_mode);
3869 if (icode != CODE_FOR_nothing
3870 && insn_operand_matches (icode, 0, test))
3872 rtx_insn *last = get_last_insn ();
3873 rtx op0 = prepare_operand (icode, x, 1, mode, cmp_mode, unsignedp);
3874 rtx op1 = prepare_operand (icode, y, 2, mode, cmp_mode, unsignedp);
3876 && insn_operand_matches (icode, 1, op0)
3877 && insn_operand_matches (icode, 2, op1))
3879 XEXP (test, 0) = op0;
3880 XEXP (test, 1) = op1;
3885 delete_insns_since (last);
3888 if (methods == OPTAB_DIRECT || !CLASS_HAS_WIDER_MODES_P (mclass))
3890 cmp_mode = GET_MODE_WIDER_MODE (cmp_mode);
3892 while (cmp_mode != VOIDmode);
3894 if (methods != OPTAB_LIB_WIDEN)
3897 if (!SCALAR_FLOAT_MODE_P (mode))
3900 machine_mode ret_mode;
3902 /* Handle a libcall just for the mode we are using. */
3903 libfunc = optab_libfunc (cmp_optab, mode);
3904 gcc_assert (libfunc);
3906 /* If we want unsigned, and this mode has a distinct unsigned
3907 comparison routine, use that. */
3910 rtx ulibfunc = optab_libfunc (ucmp_optab, mode);
3915 ret_mode = targetm.libgcc_cmp_return_mode ();
3916 result = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
3917 ret_mode, 2, x, mode, y, mode);
3919 /* There are two kinds of comparison routines. Biased routines
3920 return 0/1/2, and unbiased routines return -1/0/1. Other parts
3921 of gcc expect that the comparison operation is equivalent
3922 to the modified comparison. For signed comparisons compare the
3923 result against 1 in the biased case, and zero in the unbiased
3924 case. For unsigned comparisons always compare against 1 after
3925 biasing the unbiased result by adding 1. This gives us a way to
3927 The comparisons in the fixed-point helper library are always
3932 if (!TARGET_LIB_INT_CMP_BIASED && !ALL_FIXED_POINT_MODE_P (mode))
3935 x = plus_constant (ret_mode, result, 1);
3941 prepare_cmp_insn (x, y, comparison, NULL_RTX, unsignedp, methods,
3945 prepare_float_lib_cmp (x, y, comparison, ptest, pmode);
3953 /* Before emitting an insn with code ICODE, make sure that X, which is going
3954 to be used for operand OPNUM of the insn, is converted from mode MODE to
3955 WIDER_MODE (UNSIGNEDP determines whether it is an unsigned conversion), and
3956 that it is accepted by the operand predicate. Return the new value. */
3959 prepare_operand (enum insn_code icode, rtx x, int opnum, machine_mode mode,
3960 machine_mode wider_mode, int unsignedp)
3962 if (mode != wider_mode)
3963 x = convert_modes (wider_mode, mode, x, unsignedp);
3965 if (!insn_operand_matches (icode, opnum, x))
3967 machine_mode op_mode = insn_data[(int) icode].operand[opnum].mode;
3968 if (reload_completed)
3970 if (GET_MODE (x) != op_mode && GET_MODE (x) != VOIDmode)
3972 x = copy_to_mode_reg (op_mode, x);
3978 /* Subroutine of emit_cmp_and_jump_insns; this function is called when we know
3979 we can do the branch. */
3982 emit_cmp_and_jump_insn_1 (rtx test, machine_mode mode, rtx label, int prob)
3984 machine_mode optab_mode;
3985 enum mode_class mclass;
3986 enum insn_code icode;
3989 mclass = GET_MODE_CLASS (mode);
3990 optab_mode = (mclass == MODE_CC) ? CCmode : mode;
3991 icode = optab_handler (cbranch_optab, optab_mode);
3993 gcc_assert (icode != CODE_FOR_nothing);
3994 gcc_assert (insn_operand_matches (icode, 0, test));
3995 insn = emit_jump_insn (GEN_FCN (icode) (test, XEXP (test, 0),
3996 XEXP (test, 1), label));
3998 && profile_status_for_fn (cfun) != PROFILE_ABSENT
4001 && any_condjump_p (insn)
4002 && !find_reg_note (insn, REG_BR_PROB, 0))
4003 add_int_reg_note (insn, REG_BR_PROB, prob);
4006 /* Generate code to compare X with Y so that the condition codes are
4007 set and to jump to LABEL if the condition is true. If X is a
4008 constant and Y is not a constant, then the comparison is swapped to
4009 ensure that the comparison RTL has the canonical form.
4011 UNSIGNEDP nonzero says that X and Y are unsigned; this matters if they
4012 need to be widened. UNSIGNEDP is also used to select the proper
4013 branch condition code.
4015 If X and Y have mode BLKmode, then SIZE specifies the size of both X and Y.
4017 MODE is the mode of the inputs (in case they are const_int).
4019 COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.).
4020 It will be potentially converted into an unsigned variant based on
4021 UNSIGNEDP to select a proper jump instruction.
4023 PROB is the probability of jumping to LABEL. */
4026 emit_cmp_and_jump_insns (rtx x, rtx y, enum rtx_code comparison, rtx size,
4027 machine_mode mode, int unsignedp, rtx label,
4030 rtx op0 = x, op1 = y;
4033 /* Swap operands and condition to ensure canonical RTL. */
4034 if (swap_commutative_operands_p (x, y)
4035 && can_compare_p (swap_condition (comparison), mode, ccp_jump))
4038 comparison = swap_condition (comparison);
4041 /* If OP0 is still a constant, then both X and Y must be constants
4042 or the opposite comparison is not supported. Force X into a register
4043 to create canonical RTL. */
4044 if (CONSTANT_P (op0))
4045 op0 = force_reg (mode, op0);
4048 comparison = unsigned_condition (comparison);
4050 prepare_cmp_insn (op0, op1, comparison, size, unsignedp, OPTAB_LIB_WIDEN,
4052 emit_cmp_and_jump_insn_1 (test, mode, label, prob);
4056 /* Emit a library call comparison between floating point X and Y.
4057 COMPARISON is the rtl operator to compare with (EQ, NE, GT, etc.). */
4060 prepare_float_lib_cmp (rtx x, rtx y, enum rtx_code comparison,
4061 rtx *ptest, machine_mode *pmode)
4063 enum rtx_code swapped = swap_condition (comparison);
4064 enum rtx_code reversed = reverse_condition_maybe_unordered (comparison);
4065 machine_mode orig_mode = GET_MODE (x);
4066 machine_mode mode, cmp_mode;
4067 rtx true_rtx, false_rtx;
4068 rtx value, target, equiv;
4071 bool reversed_p = false;
4072 cmp_mode = targetm.libgcc_cmp_return_mode ();
4074 for (mode = orig_mode;
4076 mode = GET_MODE_WIDER_MODE (mode))
4078 if (code_to_optab (comparison)
4079 && (libfunc = optab_libfunc (code_to_optab (comparison), mode)))
4082 if (code_to_optab (swapped)
4083 && (libfunc = optab_libfunc (code_to_optab (swapped), mode)))
4086 comparison = swapped;
4090 if (code_to_optab (reversed)
4091 && (libfunc = optab_libfunc (code_to_optab (reversed), mode)))
4093 comparison = reversed;
4099 gcc_assert (mode != VOIDmode);
4101 if (mode != orig_mode)
4103 x = convert_to_mode (mode, x, 0);
4104 y = convert_to_mode (mode, y, 0);
4107 /* Attach a REG_EQUAL note describing the semantics of the libcall to
4108 the RTL. The allows the RTL optimizers to delete the libcall if the
4109 condition can be determined at compile-time. */
4110 if (comparison == UNORDERED
4111 || FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, comparison))
4113 true_rtx = const_true_rtx;
4114 false_rtx = const0_rtx;
4121 true_rtx = const0_rtx;
4122 false_rtx = const_true_rtx;
4126 true_rtx = const_true_rtx;
4127 false_rtx = const0_rtx;
4131 true_rtx = const1_rtx;
4132 false_rtx = const0_rtx;
4136 true_rtx = const0_rtx;
4137 false_rtx = constm1_rtx;
4141 true_rtx = constm1_rtx;
4142 false_rtx = const0_rtx;
4146 true_rtx = const0_rtx;
4147 false_rtx = const1_rtx;
4155 if (comparison == UNORDERED)
4157 rtx temp = simplify_gen_relational (NE, cmp_mode, mode, x, x);
4158 equiv = simplify_gen_relational (NE, cmp_mode, mode, y, y);
4159 equiv = simplify_gen_ternary (IF_THEN_ELSE, cmp_mode, cmp_mode,
4160 temp, const_true_rtx, equiv);
4164 equiv = simplify_gen_relational (comparison, cmp_mode, mode, x, y);
4165 if (! FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, comparison))
4166 equiv = simplify_gen_ternary (IF_THEN_ELSE, cmp_mode, cmp_mode,
4167 equiv, true_rtx, false_rtx);
4171 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
4172 cmp_mode, 2, x, mode, y, mode);
4173 insns = get_insns ();
4176 target = gen_reg_rtx (cmp_mode);
4177 emit_libcall_block (insns, target, value, equiv);
4179 if (comparison == UNORDERED
4180 || FLOAT_LIB_COMPARE_RETURNS_BOOL (mode, comparison)
4182 *ptest = gen_rtx_fmt_ee (reversed_p ? EQ : NE, VOIDmode, target, false_rtx);
4184 *ptest = gen_rtx_fmt_ee (comparison, VOIDmode, target, const0_rtx);
4189 /* Generate code to indirectly jump to a location given in the rtx LOC. */
4192 emit_indirect_jump (rtx loc)
4194 if (!targetm.have_indirect_jump ())
4195 sorry ("indirect jumps are not available on this target");
4198 struct expand_operand ops[1];
4199 create_address_operand (&ops[0], loc);
4200 expand_jump_insn (targetm.code_for_indirect_jump, 1, ops);
4206 /* Emit a conditional move instruction if the machine supports one for that
4207 condition and machine mode.
4209 OP0 and OP1 are the operands that should be compared using CODE. CMODE is
4210 the mode to use should they be constants. If it is VOIDmode, they cannot
4213 OP2 should be stored in TARGET if the comparison is true, otherwise OP3
4214 should be stored there. MODE is the mode to use should they be constants.
4215 If it is VOIDmode, they cannot both be constants.
4217 The result is either TARGET (perhaps modified) or NULL_RTX if the operation
4218 is not supported. */
4221 emit_conditional_move (rtx target, enum rtx_code code, rtx op0, rtx op1,
4222 machine_mode cmode, rtx op2, rtx op3,
4223 machine_mode mode, int unsignedp)
4227 enum insn_code icode;
4228 enum rtx_code reversed;
4230 /* If one operand is constant, make it the second one. Only do this
4231 if the other operand is not constant as well. */
4233 if (swap_commutative_operands_p (op0, op1))
4235 std::swap (op0, op1);
4236 code = swap_condition (code);
4239 /* get_condition will prefer to generate LT and GT even if the old
4240 comparison was against zero, so undo that canonicalization here since
4241 comparisons against zero are cheaper. */
4242 if (code == LT && op1 == const1_rtx)
4243 code = LE, op1 = const0_rtx;
4244 else if (code == GT && op1 == constm1_rtx)
4245 code = GE, op1 = const0_rtx;
4247 if (cmode == VOIDmode)
4248 cmode = GET_MODE (op0);
4250 if (swap_commutative_operands_p (op2, op3)
4251 && ((reversed = reversed_comparison_code_parts (code, op0, op1, NULL))
4254 std::swap (op2, op3);
4258 if (mode == VOIDmode)
4259 mode = GET_MODE (op2);
4261 icode = direct_optab_handler (movcc_optab, mode);
4263 if (icode == CODE_FOR_nothing)
4267 target = gen_reg_rtx (mode);
4269 code = unsignedp ? unsigned_condition (code) : code;
4270 comparison = simplify_gen_relational (code, VOIDmode, cmode, op0, op1);
4272 /* We can get const0_rtx or const_true_rtx in some circumstances. Just
4273 return NULL and let the caller figure out how best to deal with this
4275 if (!COMPARISON_P (comparison))
4278 saved_pending_stack_adjust save;
4279 save_pending_stack_adjust (&save);
4280 last = get_last_insn ();
4281 do_pending_stack_adjust ();
4282 prepare_cmp_insn (XEXP (comparison, 0), XEXP (comparison, 1),
4283 GET_CODE (comparison), NULL_RTX, unsignedp, OPTAB_WIDEN,
4284 &comparison, &cmode);
4287 struct expand_operand ops[4];
4289 create_output_operand (&ops[0], target, mode);
4290 create_fixed_operand (&ops[1], comparison);
4291 create_input_operand (&ops[2], op2, mode);
4292 create_input_operand (&ops[3], op3, mode);
4293 if (maybe_expand_insn (icode, 4, ops))
4295 if (ops[0].value != target)
4296 convert_move (target, ops[0].value, false);
4300 delete_insns_since (last);
4301 restore_pending_stack_adjust (&save);
4306 /* Emit a conditional negate or bitwise complement using the
4307 negcc or notcc optabs if available. Return NULL_RTX if such operations
4308 are not available. Otherwise return the RTX holding the result.
4309 TARGET is the desired destination of the result. COMP is the comparison
4310 on which to negate. If COND is true move into TARGET the negation
4311 or bitwise complement of OP1. Otherwise move OP2 into TARGET.
4312 CODE is either NEG or NOT. MODE is the machine mode in which the
4313 operation is performed. */
4316 emit_conditional_neg_or_complement (rtx target, rtx_code code,
4317 machine_mode mode, rtx cond, rtx op1,
4320 optab op = unknown_optab;
4323 else if (code == NOT)
4328 insn_code icode = direct_optab_handler (op, mode);
4330 if (icode == CODE_FOR_nothing)
4334 target = gen_reg_rtx (mode);
4336 rtx_insn *last = get_last_insn ();
4337 struct expand_operand ops[4];
4339 create_output_operand (&ops[0], target, mode);
4340 create_fixed_operand (&ops[1], cond);
4341 create_input_operand (&ops[2], op1, mode);
4342 create_input_operand (&ops[3], op2, mode);
4344 if (maybe_expand_insn (icode, 4, ops))
4346 if (ops[0].value != target)
4347 convert_move (target, ops[0].value, false);
4351 delete_insns_since (last);
4355 /* Emit a conditional addition instruction if the machine supports one for that
4356 condition and machine mode.
4358 OP0 and OP1 are the operands that should be compared using CODE. CMODE is
4359 the mode to use should they be constants. If it is VOIDmode, they cannot
4362 OP2 should be stored in TARGET if the comparison is false, otherwise OP2+OP3
4363 should be stored there. MODE is the mode to use should they be constants.
4364 If it is VOIDmode, they cannot both be constants.
4366 The result is either TARGET (perhaps modified) or NULL_RTX if the operation
4367 is not supported. */
4370 emit_conditional_add (rtx target, enum rtx_code code, rtx op0, rtx op1,
4371 machine_mode cmode, rtx op2, rtx op3,
4372 machine_mode mode, int unsignedp)
4376 enum insn_code icode;
4378 /* If one operand is constant, make it the second one. Only do this
4379 if the other operand is not constant as well. */
4381 if (swap_commutative_operands_p (op0, op1))
4383 std::swap (op0, op1);
4384 code = swap_condition (code);
4387 /* get_condition will prefer to generate LT and GT even if the old
4388 comparison was against zero, so undo that canonicalization here since
4389 comparisons against zero are cheaper. */
4390 if (code == LT && op1 == const1_rtx)
4391 code = LE, op1 = const0_rtx;
4392 else if (code == GT && op1 == constm1_rtx)
4393 code = GE, op1 = const0_rtx;
4395 if (cmode == VOIDmode)
4396 cmode = GET_MODE (op0);
4398 if (mode == VOIDmode)
4399 mode = GET_MODE (op2);
4401 icode = optab_handler (addcc_optab, mode);
4403 if (icode == CODE_FOR_nothing)
4407 target = gen_reg_rtx (mode);
4409 code = unsignedp ? unsigned_condition (code) : code;
4410 comparison = simplify_gen_relational (code, VOIDmode, cmode, op0, op1);
4412 /* We can get const0_rtx or const_true_rtx in some circumstances. Just
4413 return NULL and let the caller figure out how best to deal with this
4415 if (!COMPARISON_P (comparison))
4418 do_pending_stack_adjust ();
4419 last = get_last_insn ();
4420 prepare_cmp_insn (XEXP (comparison, 0), XEXP (comparison, 1),
4421 GET_CODE (comparison), NULL_RTX, unsignedp, OPTAB_WIDEN,
4422 &comparison, &cmode);
4425 struct expand_operand ops[4];
4427 create_output_operand (&ops[0], target, mode);
4428 create_fixed_operand (&ops[1], comparison);
4429 create_input_operand (&ops[2], op2, mode);
4430 create_input_operand (&ops[3], op3, mode);
4431 if (maybe_expand_insn (icode, 4, ops))
4433 if (ops[0].value != target)
4434 convert_move (target, ops[0].value, false);
4438 delete_insns_since (last);
4442 /* These functions attempt to generate an insn body, rather than
4443 emitting the insn, but if the gen function already emits them, we
4444 make no attempt to turn them back into naked patterns. */
4446 /* Generate and return an insn body to add Y to X. */
4449 gen_add2_insn (rtx x, rtx y)
4451 enum insn_code icode = optab_handler (add_optab, GET_MODE (x));
4453 gcc_assert (insn_operand_matches (icode, 0, x));
4454 gcc_assert (insn_operand_matches (icode, 1, x));
4455 gcc_assert (insn_operand_matches (icode, 2, y));
4457 return GEN_FCN (icode) (x, x, y);
4460 /* Generate and return an insn body to add r1 and c,
4461 storing the result in r0. */
4464 gen_add3_insn (rtx r0, rtx r1, rtx c)
4466 enum insn_code icode = optab_handler (add_optab, GET_MODE (r0));
4468 if (icode == CODE_FOR_nothing
4469 || !insn_operand_matches (icode, 0, r0)
4470 || !insn_operand_matches (icode, 1, r1)
4471 || !insn_operand_matches (icode, 2, c))
4474 return GEN_FCN (icode) (r0, r1, c);
4478 have_add2_insn (rtx x, rtx y)
4480 enum insn_code icode;
4482 gcc_assert (GET_MODE (x) != VOIDmode);
4484 icode = optab_handler (add_optab, GET_MODE (x));
4486 if (icode == CODE_FOR_nothing)
4489 if (!insn_operand_matches (icode, 0, x)
4490 || !insn_operand_matches (icode, 1, x)
4491 || !insn_operand_matches (icode, 2, y))
4497 /* Generate and return an insn body to add Y to X. */
4500 gen_addptr3_insn (rtx x, rtx y, rtx z)
4502 enum insn_code icode = optab_handler (addptr3_optab, GET_MODE (x));
4504 gcc_assert (insn_operand_matches (icode, 0, x));
4505 gcc_assert (insn_operand_matches (icode, 1, y));
4506 gcc_assert (insn_operand_matches (icode, 2, z));
4508 return GEN_FCN (icode) (x, y, z);
4511 /* Return true if the target implements an addptr pattern and X, Y,
4512 and Z are valid for the pattern predicates. */
4515 have_addptr3_insn (rtx x, rtx y, rtx z)
4517 enum insn_code icode;
4519 gcc_assert (GET_MODE (x) != VOIDmode);
4521 icode = optab_handler (addptr3_optab, GET_MODE (x));
4523 if (icode == CODE_FOR_nothing)
4526 if (!insn_operand_matches (icode, 0, x)
4527 || !insn_operand_matches (icode, 1, y)
4528 || !insn_operand_matches (icode, 2, z))
4534 /* Generate and return an insn body to subtract Y from X. */
4537 gen_sub2_insn (rtx x, rtx y)
4539 enum insn_code icode = optab_handler (sub_optab, GET_MODE (x));
4541 gcc_assert (insn_operand_matches (icode, 0, x));
4542 gcc_assert (insn_operand_matches (icode, 1, x));
4543 gcc_assert (insn_operand_matches (icode, 2, y));
4545 return GEN_FCN (icode) (x, x, y);
4548 /* Generate and return an insn body to subtract r1 and c,
4549 storing the result in r0. */
4552 gen_sub3_insn (rtx r0, rtx r1, rtx c)
4554 enum insn_code icode = optab_handler (sub_optab, GET_MODE (r0));
4556 if (icode == CODE_FOR_nothing
4557 || !insn_operand_matches (icode, 0, r0)
4558 || !insn_operand_matches (icode, 1, r1)
4559 || !insn_operand_matches (icode, 2, c))
4562 return GEN_FCN (icode) (r0, r1, c);
4566 have_sub2_insn (rtx x, rtx y)
4568 enum insn_code icode;
4570 gcc_assert (GET_MODE (x) != VOIDmode);
4572 icode = optab_handler (sub_optab, GET_MODE (x));
4574 if (icode == CODE_FOR_nothing)
4577 if (!insn_operand_matches (icode, 0, x)
4578 || !insn_operand_matches (icode, 1, x)
4579 || !insn_operand_matches (icode, 2, y))
4585 /* Generate the body of an insn to extend Y (with mode MFROM)
4586 into X (with mode MTO). Do zero-extension if UNSIGNEDP is nonzero. */
4589 gen_extend_insn (rtx x, rtx y, machine_mode mto,
4590 machine_mode mfrom, int unsignedp)
4592 enum insn_code icode = can_extend_p (mto, mfrom, unsignedp);
4593 return GEN_FCN (icode) (x, y);
4596 /* Generate code to convert FROM to floating point
4597 and store in TO. FROM must be fixed point and not VOIDmode.
4598 UNSIGNEDP nonzero means regard FROM as unsigned.
4599 Normally this is done by correcting the final value
4600 if it is negative. */
4603 expand_float (rtx to, rtx from, int unsignedp)
4605 enum insn_code icode;
4607 machine_mode fmode, imode;
4608 bool can_do_signed = false;
4610 /* Crash now, because we won't be able to decide which mode to use. */
4611 gcc_assert (GET_MODE (from) != VOIDmode);
4613 /* Look for an insn to do the conversion. Do it in the specified
4614 modes if possible; otherwise convert either input, output or both to
4615 wider mode. If the integer mode is wider than the mode of FROM,
4616 we can do the conversion signed even if the input is unsigned. */
4618 for (fmode = GET_MODE (to); fmode != VOIDmode;
4619 fmode = GET_MODE_WIDER_MODE (fmode))
4620 for (imode = GET_MODE (from); imode != VOIDmode;
4621 imode = GET_MODE_WIDER_MODE (imode))
4623 int doing_unsigned = unsignedp;
4625 if (fmode != GET_MODE (to)
4626 && significand_size (fmode) < GET_MODE_PRECISION (GET_MODE (from)))
4629 icode = can_float_p (fmode, imode, unsignedp);
4630 if (icode == CODE_FOR_nothing && unsignedp)
4632 enum insn_code scode = can_float_p (fmode, imode, 0);
4633 if (scode != CODE_FOR_nothing)
4634 can_do_signed = true;
4635 if (imode != GET_MODE (from))
4636 icode = scode, doing_unsigned = 0;
4639 if (icode != CODE_FOR_nothing)
4641 if (imode != GET_MODE (from))
4642 from = convert_to_mode (imode, from, unsignedp);
4644 if (fmode != GET_MODE (to))
4645 target = gen_reg_rtx (fmode);
4647 emit_unop_insn (icode, target, from,
4648 doing_unsigned ? UNSIGNED_FLOAT : FLOAT);
4651 convert_move (to, target, 0);
4656 /* Unsigned integer, and no way to convert directly. Convert as signed,
4657 then unconditionally adjust the result. */
4658 if (unsignedp && can_do_signed)
4660 rtx_code_label *label = gen_label_rtx ();
4662 REAL_VALUE_TYPE offset;
4664 /* Look for a usable floating mode FMODE wider than the source and at
4665 least as wide as the target. Using FMODE will avoid rounding woes
4666 with unsigned values greater than the signed maximum value. */
4668 for (fmode = GET_MODE (to); fmode != VOIDmode;
4669 fmode = GET_MODE_WIDER_MODE (fmode))
4670 if (GET_MODE_PRECISION (GET_MODE (from)) < GET_MODE_BITSIZE (fmode)
4671 && can_float_p (fmode, GET_MODE (from), 0) != CODE_FOR_nothing)
4674 if (fmode == VOIDmode)
4676 /* There is no such mode. Pretend the target is wide enough. */
4677 fmode = GET_MODE (to);
4679 /* Avoid double-rounding when TO is narrower than FROM. */
4680 if ((significand_size (fmode) + 1)
4681 < GET_MODE_PRECISION (GET_MODE (from)))
4684 rtx_code_label *neglabel = gen_label_rtx ();
4686 /* Don't use TARGET if it isn't a register, is a hard register,
4687 or is the wrong mode. */
4689 || REGNO (target) < FIRST_PSEUDO_REGISTER
4690 || GET_MODE (target) != fmode)
4691 target = gen_reg_rtx (fmode);
4693 imode = GET_MODE (from);
4694 do_pending_stack_adjust ();
4696 /* Test whether the sign bit is set. */
4697 emit_cmp_and_jump_insns (from, const0_rtx, LT, NULL_RTX, imode,
4700 /* The sign bit is not set. Convert as signed. */
4701 expand_float (target, from, 0);
4702 emit_jump_insn (targetm.gen_jump (label));
4705 /* The sign bit is set.
4706 Convert to a usable (positive signed) value by shifting right
4707 one bit, while remembering if a nonzero bit was shifted
4708 out; i.e., compute (from & 1) | (from >> 1). */
4710 emit_label (neglabel);
4711 temp = expand_binop (imode, and_optab, from, const1_rtx,
4712 NULL_RTX, 1, OPTAB_LIB_WIDEN);
4713 temp1 = expand_shift (RSHIFT_EXPR, imode, from, 1, NULL_RTX, 1);
4714 temp = expand_binop (imode, ior_optab, temp, temp1, temp, 1,
4716 expand_float (target, temp, 0);
4718 /* Multiply by 2 to undo the shift above. */
4719 temp = expand_binop (fmode, add_optab, target, target,
4720 target, 0, OPTAB_LIB_WIDEN);
4722 emit_move_insn (target, temp);
4724 do_pending_stack_adjust ();
4730 /* If we are about to do some arithmetic to correct for an
4731 unsigned operand, do it in a pseudo-register. */
4733 if (GET_MODE (to) != fmode
4734 || !REG_P (to) || REGNO (to) < FIRST_PSEUDO_REGISTER)
4735 target = gen_reg_rtx (fmode);
4737 /* Convert as signed integer to floating. */
4738 expand_float (target, from, 0);
4740 /* If FROM is negative (and therefore TO is negative),
4741 correct its value by 2**bitwidth. */
4743 do_pending_stack_adjust ();
4744 emit_cmp_and_jump_insns (from, const0_rtx, GE, NULL_RTX, GET_MODE (from),
4748 real_2expN (&offset, GET_MODE_PRECISION (GET_MODE (from)), fmode);
4749 temp = expand_binop (fmode, add_optab, target,
4750 const_double_from_real_value (offset, fmode),
4751 target, 0, OPTAB_LIB_WIDEN);
4753 emit_move_insn (target, temp);
4755 do_pending_stack_adjust ();
4760 /* No hardware instruction available; call a library routine. */
4765 convert_optab tab = unsignedp ? ufloat_optab : sfloat_optab;
4767 if (GET_MODE_PRECISION (GET_MODE (from)) < GET_MODE_PRECISION (SImode))
4768 from = convert_to_mode (SImode, from, unsignedp);
4770 libfunc = convert_optab_libfunc (tab, GET_MODE (to), GET_MODE (from));
4771 gcc_assert (libfunc);
4775 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
4776 GET_MODE (to), 1, from,
4778 insns = get_insns ();
4781 emit_libcall_block (insns, target, value,
4782 gen_rtx_fmt_e (unsignedp ? UNSIGNED_FLOAT : FLOAT,
4783 GET_MODE (to), from));
4788 /* Copy result to requested destination
4789 if we have been computing in a temp location. */
4793 if (GET_MODE (target) == GET_MODE (to))
4794 emit_move_insn (to, target);
4796 convert_move (to, target, 0);
4800 /* Generate code to convert FROM to fixed point and store in TO. FROM
4801 must be floating point. */
4804 expand_fix (rtx to, rtx from, int unsignedp)
4806 enum insn_code icode;
4808 machine_mode fmode, imode;
4809 bool must_trunc = false;
4811 /* We first try to find a pair of modes, one real and one integer, at
4812 least as wide as FROM and TO, respectively, in which we can open-code
4813 this conversion. If the integer mode is wider than the mode of TO,
4814 we can do the conversion either signed or unsigned. */
4816 for (fmode = GET_MODE (from); fmode != VOIDmode;
4817 fmode = GET_MODE_WIDER_MODE (fmode))
4818 for (imode = GET_MODE (to); imode != VOIDmode;
4819 imode = GET_MODE_WIDER_MODE (imode))
4821 int doing_unsigned = unsignedp;
4823 icode = can_fix_p (imode, fmode, unsignedp, &must_trunc);
4824 if (icode == CODE_FOR_nothing && imode != GET_MODE (to) && unsignedp)
4825 icode = can_fix_p (imode, fmode, 0, &must_trunc), doing_unsigned = 0;
4827 if (icode != CODE_FOR_nothing)
4829 rtx_insn *last = get_last_insn ();
4830 if (fmode != GET_MODE (from))
4831 from = convert_to_mode (fmode, from, 0);
4835 rtx temp = gen_reg_rtx (GET_MODE (from));
4836 from = expand_unop (GET_MODE (from), ftrunc_optab, from,
4840 if (imode != GET_MODE (to))
4841 target = gen_reg_rtx (imode);
4843 if (maybe_emit_unop_insn (icode, target, from,
4844 doing_unsigned ? UNSIGNED_FIX : FIX))
4847 convert_move (to, target, unsignedp);
4850 delete_insns_since (last);
4854 /* For an unsigned conversion, there is one more way to do it.
4855 If we have a signed conversion, we generate code that compares
4856 the real value to the largest representable positive number. If if
4857 is smaller, the conversion is done normally. Otherwise, subtract
4858 one plus the highest signed number, convert, and add it back.
4860 We only need to check all real modes, since we know we didn't find
4861 anything with a wider integer mode.
4863 This code used to extend FP value into mode wider than the destination.
4864 This is needed for decimal float modes which cannot accurately
4865 represent one plus the highest signed number of the same size, but
4866 not for binary modes. Consider, for instance conversion from SFmode
4869 The hot path through the code is dealing with inputs smaller than 2^63
4870 and doing just the conversion, so there is no bits to lose.
4872 In the other path we know the value is positive in the range 2^63..2^64-1
4873 inclusive. (as for other input overflow happens and result is undefined)
4874 So we know that the most important bit set in mantissa corresponds to
4875 2^63. The subtraction of 2^63 should not generate any rounding as it
4876 simply clears out that bit. The rest is trivial. */
4878 if (unsignedp && GET_MODE_PRECISION (GET_MODE (to)) <= HOST_BITS_PER_WIDE_INT)
4879 for (fmode = GET_MODE (from); fmode != VOIDmode;
4880 fmode = GET_MODE_WIDER_MODE (fmode))
4881 if (CODE_FOR_nothing != can_fix_p (GET_MODE (to), fmode, 0, &must_trunc)
4882 && (!DECIMAL_FLOAT_MODE_P (fmode)
4883 || GET_MODE_BITSIZE (fmode) > GET_MODE_PRECISION (GET_MODE (to))))
4886 REAL_VALUE_TYPE offset;
4888 rtx_code_label *lab1, *lab2;
4891 bitsize = GET_MODE_PRECISION (GET_MODE (to));
4892 real_2expN (&offset, bitsize - 1, fmode);
4893 limit = const_double_from_real_value (offset, fmode);
4894 lab1 = gen_label_rtx ();
4895 lab2 = gen_label_rtx ();
4897 if (fmode != GET_MODE (from))
4898 from = convert_to_mode (fmode, from, 0);
4900 /* See if we need to do the subtraction. */
4901 do_pending_stack_adjust ();
4902 emit_cmp_and_jump_insns (from, limit, GE, NULL_RTX, GET_MODE (from),
4905 /* If not, do the signed "fix" and branch around fixup code. */
4906 expand_fix (to, from, 0);
4907 emit_jump_insn (targetm.gen_jump (lab2));
4910 /* Otherwise, subtract 2**(N-1), convert to signed number,
4911 then add 2**(N-1). Do the addition using XOR since this
4912 will often generate better code. */
4914 target = expand_binop (GET_MODE (from), sub_optab, from, limit,
4915 NULL_RTX, 0, OPTAB_LIB_WIDEN);
4916 expand_fix (to, target, 0);
4917 target = expand_binop (GET_MODE (to), xor_optab, to,
4919 ((HOST_WIDE_INT) 1 << (bitsize - 1),
4921 to, 1, OPTAB_LIB_WIDEN);
4924 emit_move_insn (to, target);
4928 if (optab_handler (mov_optab, GET_MODE (to)) != CODE_FOR_nothing)
4930 /* Make a place for a REG_NOTE and add it. */
4931 insn = emit_move_insn (to, to);
4932 set_dst_reg_note (insn, REG_EQUAL,
4933 gen_rtx_fmt_e (UNSIGNED_FIX, GET_MODE (to),
4941 /* We can't do it with an insn, so use a library call. But first ensure
4942 that the mode of TO is at least as wide as SImode, since those are the
4943 only library calls we know about. */
4945 if (GET_MODE_PRECISION (GET_MODE (to)) < GET_MODE_PRECISION (SImode))
4947 target = gen_reg_rtx (SImode);
4949 expand_fix (target, from, unsignedp);
4957 convert_optab tab = unsignedp ? ufix_optab : sfix_optab;
4958 libfunc = convert_optab_libfunc (tab, GET_MODE (to), GET_MODE (from));
4959 gcc_assert (libfunc);
4963 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST,
4964 GET_MODE (to), 1, from,
4966 insns = get_insns ();
4969 emit_libcall_block (insns, target, value,
4970 gen_rtx_fmt_e (unsignedp ? UNSIGNED_FIX : FIX,
4971 GET_MODE (to), from));
4976 if (GET_MODE (to) == GET_MODE (target))
4977 emit_move_insn (to, target);
4979 convert_move (to, target, 0);
4984 /* Promote integer arguments for a libcall if necessary.
4985 emit_library_call_value cannot do the promotion because it does not
4986 know if it should do a signed or unsigned promotion. This is because
4987 there are no tree types defined for libcalls. */
4990 prepare_libcall_arg (rtx arg, int uintp)
4992 machine_mode mode = GET_MODE (arg);
4993 machine_mode arg_mode;
4994 if (SCALAR_INT_MODE_P (mode))
4996 /* If we need to promote the integer function argument we need to do
4997 it here instead of inside emit_library_call_value because in
4998 emit_library_call_value we don't know if we should do a signed or
4999 unsigned promotion. */
5002 arg_mode = promote_function_mode (NULL_TREE, mode,
5003 &unsigned_p, NULL_TREE, 0);
5004 if (arg_mode != mode)
5005 return convert_to_mode (arg_mode, arg, uintp);
5010 /* Generate code to convert FROM or TO a fixed-point.
5011 If UINTP is true, either TO or FROM is an unsigned integer.
5012 If SATP is true, we need to saturate the result. */
5015 expand_fixed_convert (rtx to, rtx from, int uintp, int satp)
5017 machine_mode to_mode = GET_MODE (to);
5018 machine_mode from_mode = GET_MODE (from);
5020 enum rtx_code this_code;
5021 enum insn_code code;
5026 if (to_mode == from_mode)
5028 emit_move_insn (to, from);
5034 tab = satp ? satfractuns_optab : fractuns_optab;
5035 this_code = satp ? UNSIGNED_SAT_FRACT : UNSIGNED_FRACT_CONVERT;
5039 tab = satp ? satfract_optab : fract_optab;
5040 this_code = satp ? SAT_FRACT : FRACT_CONVERT;
5042 code = convert_optab_handler (tab, to_mode, from_mode);
5043 if (code != CODE_FOR_nothing)
5045 emit_unop_insn (code, to, from, this_code);
5049 libfunc = convert_optab_libfunc (tab, to_mode, from_mode);
5050 gcc_assert (libfunc);
5052 from = prepare_libcall_arg (from, uintp);
5053 from_mode = GET_MODE (from);
5056 value = emit_library_call_value (libfunc, NULL_RTX, LCT_CONST, to_mode,
5057 1, from, from_mode);
5058 insns = get_insns ();
5061 emit_libcall_block (insns, to, value,
5062 gen_rtx_fmt_e (optab_to_code (tab), to_mode, from));
5065 /* Generate code to convert FROM to fixed point and store in TO. FROM
5066 must be floating point, TO must be signed. Use the conversion optab
5067 TAB to do the conversion. */
5070 expand_sfix_optab (rtx to, rtx from, convert_optab tab)
5072 enum insn_code icode;
5074 machine_mode fmode, imode;
5076 /* We first try to find a pair of modes, one real and one integer, at
5077 least as wide as FROM and TO, respectively, in which we can open-code
5078 this conversion. If the integer mode is wider than the mode of TO,
5079 we can do the conversion either signed or unsigned. */
5081 for (fmode = GET_MODE (from); fmode != VOIDmode;
5082 fmode = GET_MODE_WIDER_MODE (fmode))
5083 for (imode = GET_MODE (to); imode != VOIDmode;
5084 imode = GET_MODE_WIDER_MODE (imode))
5086 icode = convert_optab_handler (tab, imode, fmode);
5087 if (icode != CODE_FOR_nothing)
5089 rtx_insn *last = get_last_insn ();
5090 if (fmode != GET_MODE (from))
5091 from = convert_to_mode (fmode, from, 0);
5093 if (imode != GET_MODE (to))
5094 target = gen_reg_rtx (imode);
5096 if (!maybe_emit_unop_insn (icode, target, from, UNKNOWN))
5098 delete_insns_since (last);
5102 convert_move (to, target, 0);
5110 /* Report whether we have an instruction to perform the operation
5111 specified by CODE on operands of mode MODE. */
5113 have_insn_for (enum rtx_code code, machine_mode mode)
5115 return (code_to_optab (code)
5116 && (optab_handler (code_to_optab (code), mode)
5117 != CODE_FOR_nothing));
5120 /* Print information about the current contents of the optabs on
5124 debug_optab_libfuncs (void)
5128 /* Dump the arithmetic optabs. */
5129 for (i = FIRST_NORM_OPTAB; i <= LAST_NORMLIB_OPTAB; ++i)
5130 for (j = 0; j < NUM_MACHINE_MODES; ++j)
5132 rtx l = optab_libfunc ((optab) i, (machine_mode) j);
5135 gcc_assert (GET_CODE (l) == SYMBOL_REF);
5136 fprintf (stderr, "%s\t%s:\t%s\n",
5137 GET_RTX_NAME (optab_to_code ((optab) i)),
5143 /* Dump the conversion optabs. */
5144 for (i = FIRST_CONV_OPTAB; i <= LAST_CONVLIB_OPTAB; ++i)
5145 for (j = 0; j < NUM_MACHINE_MODES; ++j)
5146 for (k = 0; k < NUM_MACHINE_MODES; ++k)
5148 rtx l = convert_optab_libfunc ((optab) i, (machine_mode) j,
5152 gcc_assert (GET_CODE (l) == SYMBOL_REF);
5153 fprintf (stderr, "%s\t%s\t%s:\t%s\n",
5154 GET_RTX_NAME (optab_to_code ((optab) i)),
5162 /* Generate insns to trap with code TCODE if OP1 and OP2 satisfy condition
5163 CODE. Return 0 on failure. */
5166 gen_cond_trap (enum rtx_code code, rtx op1, rtx op2, rtx tcode)
5168 machine_mode mode = GET_MODE (op1);
5169 enum insn_code icode;
5173 if (mode == VOIDmode)
5176 icode = optab_handler (ctrap_optab, mode);
5177 if (icode == CODE_FOR_nothing)
5180 /* Some targets only accept a zero trap code. */
5181 if (!insn_operand_matches (icode, 3, tcode))
5184 do_pending_stack_adjust ();
5186 prepare_cmp_insn (op1, op2, code, NULL_RTX, false, OPTAB_DIRECT,
5191 insn = GEN_FCN (icode) (trap_rtx, XEXP (trap_rtx, 0), XEXP (trap_rtx, 1),
5194 /* If that failed, then give up. */
5202 insn = get_insns ();
5207 /* Return rtx code for TCODE. Use UNSIGNEDP to select signed
5208 or unsigned operation code. */
5211 get_rtx_code (enum tree_code tcode, bool unsignedp)
5223 code = unsignedp ? LTU : LT;
5226 code = unsignedp ? LEU : LE;
5229 code = unsignedp ? GTU : GT;
5232 code = unsignedp ? GEU : GE;
5235 case UNORDERED_EXPR:
5274 /* Return comparison rtx for COND. Use UNSIGNEDP to select signed or
5275 unsigned operators. OPNO holds an index of the first comparison
5276 operand in insn with code ICODE. Do not generate compare instruction. */
5279 vector_compare_rtx (enum tree_code tcode, tree t_op0, tree t_op1,
5280 bool unsignedp, enum insn_code icode,
5283 struct expand_operand ops[2];
5284 rtx rtx_op0, rtx_op1;
5285 machine_mode m0, m1;
5286 enum rtx_code rcode = get_rtx_code (tcode, unsignedp);
5288 gcc_assert (TREE_CODE_CLASS (tcode) == tcc_comparison);
5290 /* Expand operands. For vector types with scalar modes, e.g. where int64x1_t
5291 has mode DImode, this can produce a constant RTX of mode VOIDmode; in such
5292 cases, use the original mode. */
5293 rtx_op0 = expand_expr (t_op0, NULL_RTX, TYPE_MODE (TREE_TYPE (t_op0)),
5295 m0 = GET_MODE (rtx_op0);
5297 m0 = TYPE_MODE (TREE_TYPE (t_op0));
5299 rtx_op1 = expand_expr (t_op1, NULL_RTX, TYPE_MODE (TREE_TYPE (t_op1)),
5301 m1 = GET_MODE (rtx_op1);
5303 m1 = TYPE_MODE (TREE_TYPE (t_op1));
5305 create_input_operand (&ops[0], rtx_op0, m0);
5306 create_input_operand (&ops[1], rtx_op1, m1);
5307 if (!maybe_legitimize_operands (icode, opno, 2, ops))
5309 return gen_rtx_fmt_ee (rcode, VOIDmode, ops[0].value, ops[1].value);
5312 /* Checks if vec_perm mask SEL is a constant equivalent to a shift of the first
5313 vec_perm operand, assuming the second operand is a constant vector of zeroes.
5314 Return the shift distance in bits if so, or NULL_RTX if the vec_perm is not a
5317 shift_amt_for_vec_perm_mask (rtx sel)
5319 unsigned int i, first, nelt = GET_MODE_NUNITS (GET_MODE (sel));
5320 unsigned int bitsize = GET_MODE_UNIT_BITSIZE (GET_MODE (sel));
5322 if (GET_CODE (sel) != CONST_VECTOR)
5325 first = INTVAL (CONST_VECTOR_ELT (sel, 0));
5328 for (i = 1; i < nelt; i++)
5330 int idx = INTVAL (CONST_VECTOR_ELT (sel, i));
5331 unsigned int expected = i + first;
5332 /* Indices into the second vector are all equivalent. */
5333 if (idx < 0 || (MIN (nelt, (unsigned) idx) != MIN (nelt, expected)))
5337 return GEN_INT (first * bitsize);
5340 /* A subroutine of expand_vec_perm for expanding one vec_perm insn. */
5343 expand_vec_perm_1 (enum insn_code icode, rtx target,
5344 rtx v0, rtx v1, rtx sel)
5346 machine_mode tmode = GET_MODE (target);
5347 machine_mode smode = GET_MODE (sel);
5348 struct expand_operand ops[4];
5350 create_output_operand (&ops[0], target, tmode);
5351 create_input_operand (&ops[3], sel, smode);
5353 /* Make an effort to preserve v0 == v1. The target expander is able to
5354 rely on this to determine if we're permuting a single input operand. */
5355 if (rtx_equal_p (v0, v1))
5357 if (!insn_operand_matches (icode, 1, v0))
5358 v0 = force_reg (tmode, v0);
5359 gcc_checking_assert (insn_operand_matches (icode, 1, v0));
5360 gcc_checking_assert (insn_operand_matches (icode, 2, v0));
5362 create_fixed_operand (&ops[1], v0);
5363 create_fixed_operand (&ops[2], v0);
5367 create_input_operand (&ops[1], v0, tmode);
5368 create_input_operand (&ops[2], v1, tmode);
5371 if (maybe_expand_insn (icode, 4, ops))
5372 return ops[0].value;
5376 /* Generate instructions for vec_perm optab given its mode
5377 and three operands. */
5380 expand_vec_perm (machine_mode mode, rtx v0, rtx v1, rtx sel, rtx target)
5382 enum insn_code icode;
5383 machine_mode qimode;
5384 unsigned int i, w, e, u;
5385 rtx tmp, sel_qi = NULL;
5388 if (!target || GET_MODE (target) != mode)
5389 target = gen_reg_rtx (mode);
5391 w = GET_MODE_SIZE (mode);
5392 e = GET_MODE_NUNITS (mode);
5393 u = GET_MODE_UNIT_SIZE (mode);
5395 /* Set QIMODE to a different vector mode with byte elements.
5396 If no such mode, or if MODE already has byte elements, use VOIDmode. */
5398 if (GET_MODE_INNER (mode) != QImode)
5400 qimode = mode_for_vector (QImode, w);
5401 if (!VECTOR_MODE_P (qimode))
5405 /* If the input is a constant, expand it specially. */
5406 gcc_assert (GET_MODE_CLASS (GET_MODE (sel)) == MODE_VECTOR_INT);
5407 if (GET_CODE (sel) == CONST_VECTOR)
5409 /* See if this can be handled with a vec_shr. We only do this if the
5410 second vector is all zeroes. */
5411 enum insn_code shift_code = optab_handler (vec_shr_optab, mode);
5412 enum insn_code shift_code_qi = ((qimode != VOIDmode && qimode != mode)
5413 ? optab_handler (vec_shr_optab, qimode)
5414 : CODE_FOR_nothing);
5415 rtx shift_amt = NULL_RTX;
5416 if (v1 == CONST0_RTX (GET_MODE (v1))
5417 && (shift_code != CODE_FOR_nothing
5418 || shift_code_qi != CODE_FOR_nothing))
5420 shift_amt = shift_amt_for_vec_perm_mask (sel);
5423 struct expand_operand ops[3];
5424 if (shift_code != CODE_FOR_nothing)
5426 create_output_operand (&ops[0], target, mode);
5427 create_input_operand (&ops[1], v0, mode);
5428 create_convert_operand_from_type (&ops[2], shift_amt,
5430 if (maybe_expand_insn (shift_code, 3, ops))
5431 return ops[0].value;
5433 if (shift_code_qi != CODE_FOR_nothing)
5435 tmp = gen_reg_rtx (qimode);
5436 create_output_operand (&ops[0], tmp, qimode);
5437 create_input_operand (&ops[1], gen_lowpart (qimode, v0),
5439 create_convert_operand_from_type (&ops[2], shift_amt,
5441 if (maybe_expand_insn (shift_code_qi, 3, ops))
5442 return gen_lowpart (mode, ops[0].value);
5447 icode = direct_optab_handler (vec_perm_const_optab, mode);
5448 if (icode != CODE_FOR_nothing)
5450 tmp = expand_vec_perm_1 (icode, target, v0, v1, sel);
5455 /* Fall back to a constant byte-based permutation. */
5456 if (qimode != VOIDmode)
5458 vec = rtvec_alloc (w);
5459 for (i = 0; i < e; ++i)
5461 unsigned int j, this_e;
5463 this_e = INTVAL (CONST_VECTOR_ELT (sel, i));
5464 this_e &= 2 * e - 1;
5467 for (j = 0; j < u; ++j)
5468 RTVEC_ELT (vec, i * u + j) = GEN_INT (this_e + j);
5470 sel_qi = gen_rtx_CONST_VECTOR (qimode, vec);
5472 icode = direct_optab_handler (vec_perm_const_optab, qimode);
5473 if (icode != CODE_FOR_nothing)
5475 tmp = mode != qimode ? gen_reg_rtx (qimode) : target;
5476 tmp = expand_vec_perm_1 (icode, tmp, gen_lowpart (qimode, v0),
5477 gen_lowpart (qimode, v1), sel_qi);
5479 return gen_lowpart (mode, tmp);
5484 /* Otherwise expand as a fully variable permuation. */
5485 icode = direct_optab_handler (vec_perm_optab, mode);
5486 if (icode != CODE_FOR_nothing)
5488 tmp = expand_vec_perm_1 (icode, target, v0, v1, sel);
5493 /* As a special case to aid several targets, lower the element-based
5494 permutation to a byte-based permutation and try again. */
5495 if (qimode == VOIDmode)
5497 icode = direct_optab_handler (vec_perm_optab, qimode);
5498 if (icode == CODE_FOR_nothing)
5503 /* Multiply each element by its byte size. */
5504 machine_mode selmode = GET_MODE (sel);
5506 sel = expand_simple_binop (selmode, PLUS, sel, sel,
5507 NULL, 0, OPTAB_DIRECT);
5509 sel = expand_simple_binop (selmode, ASHIFT, sel,
5510 GEN_INT (exact_log2 (u)),
5511 NULL, 0, OPTAB_DIRECT);
5512 gcc_assert (sel != NULL);
5514 /* Broadcast the low byte each element into each of its bytes. */
5515 vec = rtvec_alloc (w);
5516 for (i = 0; i < w; ++i)
5518 int this_e = i / u * u;
5519 if (BYTES_BIG_ENDIAN)
5521 RTVEC_ELT (vec, i) = GEN_INT (this_e);
5523 tmp = gen_rtx_CONST_VECTOR (qimode, vec);
5524 sel = gen_lowpart (qimode, sel);
5525 sel = expand_vec_perm (qimode, sel, sel, tmp, NULL);
5526 gcc_assert (sel != NULL);
5528 /* Add the byte offset to each byte element. */
5529 /* Note that the definition of the indicies here is memory ordering,
5530 so there should be no difference between big and little endian. */
5531 vec = rtvec_alloc (w);
5532 for (i = 0; i < w; ++i)
5533 RTVEC_ELT (vec, i) = GEN_INT (i % u);
5534 tmp = gen_rtx_CONST_VECTOR (qimode, vec);
5535 sel_qi = expand_simple_binop (qimode, PLUS, sel, tmp,
5536 sel, 0, OPTAB_DIRECT);
5537 gcc_assert (sel_qi != NULL);
5540 tmp = mode != qimode ? gen_reg_rtx (qimode) : target;
5541 tmp = expand_vec_perm_1 (icode, tmp, gen_lowpart (qimode, v0),
5542 gen_lowpart (qimode, v1), sel_qi);
5544 tmp = gen_lowpart (mode, tmp);
5548 /* Generate insns for a VEC_COND_EXPR with mask, given its TYPE and its
5552 expand_vec_cond_mask_expr (tree vec_cond_type, tree op0, tree op1, tree op2,
5555 struct expand_operand ops[4];
5556 machine_mode mode = TYPE_MODE (vec_cond_type);
5557 machine_mode mask_mode = TYPE_MODE (TREE_TYPE (op0));
5558 enum insn_code icode = get_vcond_mask_icode (mode, mask_mode);
5559 rtx mask, rtx_op1, rtx_op2;
5561 if (icode == CODE_FOR_nothing)
5564 mask = expand_normal (op0);
5565 rtx_op1 = expand_normal (op1);
5566 rtx_op2 = expand_normal (op2);
5568 mask = force_reg (mask_mode, mask);
5569 rtx_op1 = force_reg (GET_MODE (rtx_op1), rtx_op1);
5571 create_output_operand (&ops[0], target, mode);
5572 create_input_operand (&ops[1], rtx_op1, mode);
5573 create_input_operand (&ops[2], rtx_op2, mode);
5574 create_input_operand (&ops[3], mask, mask_mode);
5575 expand_insn (icode, 4, ops);
5577 return ops[0].value;
5580 /* Generate insns for a VEC_COND_EXPR, given its TYPE and its
5584 expand_vec_cond_expr (tree vec_cond_type, tree op0, tree op1, tree op2,
5587 struct expand_operand ops[6];
5588 enum insn_code icode;
5589 rtx comparison, rtx_op1, rtx_op2;
5590 machine_mode mode = TYPE_MODE (vec_cond_type);
5591 machine_mode cmp_op_mode;
5594 enum tree_code tcode;
5596 if (COMPARISON_CLASS_P (op0))
5598 op0a = TREE_OPERAND (op0, 0);
5599 op0b = TREE_OPERAND (op0, 1);
5600 tcode = TREE_CODE (op0);
5604 gcc_assert (VECTOR_BOOLEAN_TYPE_P (TREE_TYPE (op0)));
5605 if (get_vcond_mask_icode (mode, TYPE_MODE (TREE_TYPE (op0)))
5606 != CODE_FOR_nothing)
5607 return expand_vec_cond_mask_expr (vec_cond_type, op0, op1,
5612 gcc_assert (GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (op0)))
5613 == MODE_VECTOR_INT);
5615 op0b = build_zero_cst (TREE_TYPE (op0));
5619 cmp_op_mode = TYPE_MODE (TREE_TYPE (op0a));
5620 unsignedp = TYPE_UNSIGNED (TREE_TYPE (op0a));
5623 gcc_assert (GET_MODE_SIZE (mode) == GET_MODE_SIZE (cmp_op_mode)
5624 && GET_MODE_NUNITS (mode) == GET_MODE_NUNITS (cmp_op_mode));
5626 icode = get_vcond_icode (mode, cmp_op_mode, unsignedp);
5627 if (icode == CODE_FOR_nothing)
5630 comparison = vector_compare_rtx (tcode, op0a, op0b, unsignedp, icode, 4);
5631 rtx_op1 = expand_normal (op1);
5632 rtx_op2 = expand_normal (op2);
5634 create_output_operand (&ops[0], target, mode);
5635 create_input_operand (&ops[1], rtx_op1, mode);
5636 create_input_operand (&ops[2], rtx_op2, mode);
5637 create_fixed_operand (&ops[3], comparison);
5638 create_fixed_operand (&ops[4], XEXP (comparison, 0));
5639 create_fixed_operand (&ops[5], XEXP (comparison, 1));
5640 expand_insn (icode, 6, ops);
5641 return ops[0].value;
5644 /* Generate insns for a vector comparison into a mask. */
5647 expand_vec_cmp_expr (tree type, tree exp, rtx target)
5649 struct expand_operand ops[4];
5650 enum insn_code icode;
5652 machine_mode mask_mode = TYPE_MODE (type);
5656 enum tree_code tcode;
5658 op0a = TREE_OPERAND (exp, 0);
5659 op0b = TREE_OPERAND (exp, 1);
5660 tcode = TREE_CODE (exp);
5662 unsignedp = TYPE_UNSIGNED (TREE_TYPE (op0a));
5663 vmode = TYPE_MODE (TREE_TYPE (op0a));
5665 icode = get_vec_cmp_icode (vmode, mask_mode, unsignedp);
5666 if (icode == CODE_FOR_nothing)
5669 comparison = vector_compare_rtx (tcode, op0a, op0b, unsignedp, icode, 2);
5670 create_output_operand (&ops[0], target, mask_mode);
5671 create_fixed_operand (&ops[1], comparison);
5672 create_fixed_operand (&ops[2], XEXP (comparison, 0));
5673 create_fixed_operand (&ops[3], XEXP (comparison, 1));
5674 expand_insn (icode, 4, ops);
5675 return ops[0].value;
5678 /* Expand a highpart multiply. */
5681 expand_mult_highpart (machine_mode mode, rtx op0, rtx op1,
5682 rtx target, bool uns_p)
5684 struct expand_operand eops[3];
5685 enum insn_code icode;
5686 int method, i, nunits;
5692 method = can_mult_highpart_p (mode, uns_p);
5698 tab1 = uns_p ? umul_highpart_optab : smul_highpart_optab;
5699 return expand_binop (mode, tab1, op0, op1, target, uns_p,
5702 tab1 = uns_p ? vec_widen_umult_even_optab : vec_widen_smult_even_optab;
5703 tab2 = uns_p ? vec_widen_umult_odd_optab : vec_widen_smult_odd_optab;
5706 tab1 = uns_p ? vec_widen_umult_lo_optab : vec_widen_smult_lo_optab;
5707 tab2 = uns_p ? vec_widen_umult_hi_optab : vec_widen_smult_hi_optab;
5708 if (BYTES_BIG_ENDIAN)
5709 std::swap (tab1, tab2);
5715 icode = optab_handler (tab1, mode);
5716 nunits = GET_MODE_NUNITS (mode);
5717 wmode = insn_data[icode].operand[0].mode;
5718 gcc_checking_assert (2 * GET_MODE_NUNITS (wmode) == nunits);
5719 gcc_checking_assert (GET_MODE_SIZE (wmode) == GET_MODE_SIZE (mode));
5721 create_output_operand (&eops[0], gen_reg_rtx (wmode), wmode);
5722 create_input_operand (&eops[1], op0, mode);
5723 create_input_operand (&eops[2], op1, mode);
5724 expand_insn (icode, 3, eops);
5725 m1 = gen_lowpart (mode, eops[0].value);
5727 create_output_operand (&eops[0], gen_reg_rtx (wmode), wmode);
5728 create_input_operand (&eops[1], op0, mode);
5729 create_input_operand (&eops[2], op1, mode);
5730 expand_insn (optab_handler (tab2, mode), 3, eops);
5731 m2 = gen_lowpart (mode, eops[0].value);
5733 v = rtvec_alloc (nunits);
5736 for (i = 0; i < nunits; ++i)
5737 RTVEC_ELT (v, i) = GEN_INT (!BYTES_BIG_ENDIAN + (i & ~1)
5738 + ((i & 1) ? nunits : 0));
5742 for (i = 0; i < nunits; ++i)
5743 RTVEC_ELT (v, i) = GEN_INT (2 * i + (BYTES_BIG_ENDIAN ? 0 : 1));
5745 perm = gen_rtx_CONST_VECTOR (mode, v);
5747 return expand_vec_perm (mode, m1, m2, perm, target);
5750 /* Helper function to find the MODE_CC set in a sync_compare_and_swap
5754 find_cc_set (rtx x, const_rtx pat, void *data)
5756 if (REG_P (x) && GET_MODE_CLASS (GET_MODE (x)) == MODE_CC
5757 && GET_CODE (pat) == SET)
5759 rtx *p_cc_reg = (rtx *) data;
5760 gcc_assert (!*p_cc_reg);
5765 /* This is a helper function for the other atomic operations. This function
5766 emits a loop that contains SEQ that iterates until a compare-and-swap
5767 operation at the end succeeds. MEM is the memory to be modified. SEQ is
5768 a set of instructions that takes a value from OLD_REG as an input and
5769 produces a value in NEW_REG as an output. Before SEQ, OLD_REG will be
5770 set to the current contents of MEM. After SEQ, a compare-and-swap will
5771 attempt to update MEM with NEW_REG. The function returns true when the
5772 loop was generated successfully. */
5775 expand_compare_and_swap_loop (rtx mem, rtx old_reg, rtx new_reg, rtx seq)
5777 machine_mode mode = GET_MODE (mem);
5778 rtx_code_label *label;
5779 rtx cmp_reg, success, oldval;
5781 /* The loop we want to generate looks like
5787 (success, cmp_reg) = compare-and-swap(mem, old_reg, new_reg)
5791 Note that we only do the plain load from memory once. Subsequent
5792 iterations use the value loaded by the compare-and-swap pattern. */
5794 label = gen_label_rtx ();
5795 cmp_reg = gen_reg_rtx (mode);
5797 emit_move_insn (cmp_reg, mem);
5799 emit_move_insn (old_reg, cmp_reg);
5805 if (!expand_atomic_compare_and_swap (&success, &oldval, mem, old_reg,
5806 new_reg, false, MEMMODEL_SYNC_SEQ_CST,
5810 if (oldval != cmp_reg)
5811 emit_move_insn (cmp_reg, oldval);
5813 /* Mark this jump predicted not taken. */
5814 emit_cmp_and_jump_insns (success, const0_rtx, EQ, const0_rtx,
5815 GET_MODE (success), 1, label, 0);
5820 /* This function tries to emit an atomic_exchange intruction. VAL is written
5821 to *MEM using memory model MODEL. The previous contents of *MEM are returned,
5822 using TARGET if possible. */
5825 maybe_emit_atomic_exchange (rtx target, rtx mem, rtx val, enum memmodel model)
5827 machine_mode mode = GET_MODE (mem);
5828 enum insn_code icode;
5830 /* If the target supports the exchange directly, great. */
5831 icode = direct_optab_handler (atomic_exchange_optab, mode);
5832 if (icode != CODE_FOR_nothing)
5834 struct expand_operand ops[4];
5836 create_output_operand (&ops[0], target, mode);
5837 create_fixed_operand (&ops[1], mem);
5838 create_input_operand (&ops[2], val, mode);
5839 create_integer_operand (&ops[3], model);
5840 if (maybe_expand_insn (icode, 4, ops))
5841 return ops[0].value;
5847 /* This function tries to implement an atomic exchange operation using
5848 __sync_lock_test_and_set. VAL is written to *MEM using memory model MODEL.
5849 The previous contents of *MEM are returned, using TARGET if possible.
5850 Since this instructionn is an acquire barrier only, stronger memory
5851 models may require additional barriers to be emitted. */
5854 maybe_emit_sync_lock_test_and_set (rtx target, rtx mem, rtx val,
5855 enum memmodel model)
5857 machine_mode mode = GET_MODE (mem);
5858 enum insn_code icode;
5859 rtx_insn *last_insn = get_last_insn ();
5861 icode = optab_handler (sync_lock_test_and_set_optab, mode);
5863 /* Legacy sync_lock_test_and_set is an acquire barrier. If the pattern
5864 exists, and the memory model is stronger than acquire, add a release
5865 barrier before the instruction. */
5867 if (is_mm_seq_cst (model) || is_mm_release (model) || is_mm_acq_rel (model))
5868 expand_mem_thread_fence (model);
5870 if (icode != CODE_FOR_nothing)
5872 struct expand_operand ops[3];
5873 create_output_operand (&ops[0], target, mode);
5874 create_fixed_operand (&ops[1], mem);
5875 create_input_operand (&ops[2], val, mode);
5876 if (maybe_expand_insn (icode, 3, ops))
5877 return ops[0].value;
5880 /* If an external test-and-set libcall is provided, use that instead of
5881 any external compare-and-swap that we might get from the compare-and-
5882 swap-loop expansion later. */
5883 if (!can_compare_and_swap_p (mode, false))
5885 rtx libfunc = optab_libfunc (sync_lock_test_and_set_optab, mode);
5886 if (libfunc != NULL)
5890 addr = convert_memory_address (ptr_mode, XEXP (mem, 0));
5891 return emit_library_call_value (libfunc, NULL_RTX, LCT_NORMAL,
5892 mode, 2, addr, ptr_mode,
5897 /* If the test_and_set can't be emitted, eliminate any barrier that might
5898 have been emitted. */
5899 delete_insns_since (last_insn);
5903 /* This function tries to implement an atomic exchange operation using a
5904 compare_and_swap loop. VAL is written to *MEM. The previous contents of
5905 *MEM are returned, using TARGET if possible. No memory model is required
5906 since a compare_and_swap loop is seq-cst. */
5909 maybe_emit_compare_and_swap_exchange_loop (rtx target, rtx mem, rtx val)
5911 machine_mode mode = GET_MODE (mem);
5913 if (can_compare_and_swap_p (mode, true))
5915 if (!target || !register_operand (target, mode))
5916 target = gen_reg_rtx (mode);
5917 if (expand_compare_and_swap_loop (mem, target, val, NULL_RTX))
5924 /* This function tries to implement an atomic test-and-set operation
5925 using the atomic_test_and_set instruction pattern. A boolean value
5926 is returned from the operation, using TARGET if possible. */
5929 maybe_emit_atomic_test_and_set (rtx target, rtx mem, enum memmodel model)
5931 machine_mode pat_bool_mode;
5932 struct expand_operand ops[3];
5934 if (!targetm.have_atomic_test_and_set ())
5937 /* While we always get QImode from __atomic_test_and_set, we get
5938 other memory modes from __sync_lock_test_and_set. Note that we
5939 use no endian adjustment here. This matches the 4.6 behavior
5940 in the Sparc backend. */
5941 enum insn_code icode = targetm.code_for_atomic_test_and_set;
5942 gcc_checking_assert (insn_data[icode].operand[1].mode == QImode);
5943 if (GET_MODE (mem) != QImode)
5944 mem = adjust_address_nv (mem, QImode, 0);
5946 pat_bool_mode = insn_data[icode].operand[0].mode;
5947 create_output_operand (&ops[0], target, pat_bool_mode);
5948 create_fixed_operand (&ops[1], mem);
5949 create_integer_operand (&ops[2], model);
5951 if (maybe_expand_insn (icode, 3, ops))
5952 return ops[0].value;
5956 /* This function expands the legacy _sync_lock test_and_set operation which is
5957 generally an atomic exchange. Some limited targets only allow the
5958 constant 1 to be stored. This is an ACQUIRE operation.
5960 TARGET is an optional place to stick the return value.
5961 MEM is where VAL is stored. */
5964 expand_sync_lock_test_and_set (rtx target, rtx mem, rtx val)
5968 /* Try an atomic_exchange first. */
5969 ret = maybe_emit_atomic_exchange (target, mem, val, MEMMODEL_SYNC_ACQUIRE);
5973 ret = maybe_emit_sync_lock_test_and_set (target, mem, val,
5974 MEMMODEL_SYNC_ACQUIRE);
5978 ret = maybe_emit_compare_and_swap_exchange_loop (target, mem, val);
5982 /* If there are no other options, try atomic_test_and_set if the value
5983 being stored is 1. */
5984 if (val == const1_rtx)
5985 ret = maybe_emit_atomic_test_and_set (target, mem, MEMMODEL_SYNC_ACQUIRE);
5990 /* This function expands the atomic test_and_set operation:
5991 atomically store a boolean TRUE into MEM and return the previous value.
5993 MEMMODEL is the memory model variant to use.
5994 TARGET is an optional place to stick the return value. */
5997 expand_atomic_test_and_set (rtx target, rtx mem, enum memmodel model)
5999 machine_mode mode = GET_MODE (mem);
6000 rtx ret, trueval, subtarget;
6002 ret = maybe_emit_atomic_test_and_set (target, mem, model);
6006 /* Be binary compatible with non-default settings of trueval, and different
6007 cpu revisions. E.g. one revision may have atomic-test-and-set, but
6008 another only has atomic-exchange. */
6009 if (targetm.atomic_test_and_set_trueval == 1)
6011 trueval = const1_rtx;
6012 subtarget = target ? target : gen_reg_rtx (mode);
6016 trueval = gen_int_mode (targetm.atomic_test_and_set_trueval, mode);
6017 subtarget = gen_reg_rtx (mode);
6020 /* Try the atomic-exchange optab... */
6021 ret = maybe_emit_atomic_exchange (subtarget, mem, trueval, model);
6023 /* ... then an atomic-compare-and-swap loop ... */
6025 ret = maybe_emit_compare_and_swap_exchange_loop (subtarget, mem, trueval);
6027 /* ... before trying the vaguely defined legacy lock_test_and_set. */
6029 ret = maybe_emit_sync_lock_test_and_set (subtarget, mem, trueval, model);
6031 /* Recall that the legacy lock_test_and_set optab was allowed to do magic
6032 things with the value 1. Thus we try again without trueval. */
6033 if (!ret && targetm.atomic_test_and_set_trueval != 1)
6034 ret = maybe_emit_sync_lock_test_and_set (subtarget, mem, const1_rtx, model);
6036 /* Failing all else, assume a single threaded environment and simply
6037 perform the operation. */
6040 /* If the result is ignored skip the move to target. */
6041 if (subtarget != const0_rtx)
6042 emit_move_insn (subtarget, mem);
6044 emit_move_insn (mem, trueval);
6048 /* Recall that have to return a boolean value; rectify if trueval
6049 is not exactly one. */
6050 if (targetm.atomic_test_and_set_trueval != 1)
6051 ret = emit_store_flag_force (target, NE, ret, const0_rtx, mode, 0, 1);
6056 /* This function expands the atomic exchange operation:
6057 atomically store VAL in MEM and return the previous value in MEM.
6059 MEMMODEL is the memory model variant to use.
6060 TARGET is an optional place to stick the return value. */
6063 expand_atomic_exchange (rtx target, rtx mem, rtx val, enum memmodel model)
6067 ret = maybe_emit_atomic_exchange (target, mem, val, model);
6069 /* Next try a compare-and-swap loop for the exchange. */
6071 ret = maybe_emit_compare_and_swap_exchange_loop (target, mem, val);
6076 /* This function expands the atomic compare exchange operation:
6078 *PTARGET_BOOL is an optional place to store the boolean success/failure.
6079 *PTARGET_OVAL is an optional place to store the old value from memory.
6080 Both target parameters may be NULL or const0_rtx to indicate that we do
6081 not care about that return value. Both target parameters are updated on
6082 success to the actual location of the corresponding result.
6084 MEMMODEL is the memory model variant to use.
6086 The return value of the function is true for success. */
6089 expand_atomic_compare_and_swap (rtx *ptarget_bool, rtx *ptarget_oval,
6090 rtx mem, rtx expected, rtx desired,
6091 bool is_weak, enum memmodel succ_model,
6092 enum memmodel fail_model)
6094 machine_mode mode = GET_MODE (mem);
6095 struct expand_operand ops[8];
6096 enum insn_code icode;
6097 rtx target_oval, target_bool = NULL_RTX;
6100 /* Load expected into a register for the compare and swap. */
6101 if (MEM_P (expected))
6102 expected = copy_to_reg (expected);
6104 /* Make sure we always have some place to put the return oldval.
6105 Further, make sure that place is distinct from the input expected,
6106 just in case we need that path down below. */
6107 if (ptarget_oval && *ptarget_oval == const0_rtx)
6108 ptarget_oval = NULL;
6110 if (ptarget_oval == NULL
6111 || (target_oval = *ptarget_oval) == NULL
6112 || reg_overlap_mentioned_p (expected, target_oval))
6113 target_oval = gen_reg_rtx (mode);
6115 icode = direct_optab_handler (atomic_compare_and_swap_optab, mode);
6116 if (icode != CODE_FOR_nothing)
6118 machine_mode bool_mode = insn_data[icode].operand[0].mode;
6120 if (ptarget_bool && *ptarget_bool == const0_rtx)
6121 ptarget_bool = NULL;
6123 /* Make sure we always have a place for the bool operand. */
6124 if (ptarget_bool == NULL
6125 || (target_bool = *ptarget_bool) == NULL
6126 || GET_MODE (target_bool) != bool_mode)
6127 target_bool = gen_reg_rtx (bool_mode);
6129 /* Emit the compare_and_swap. */
6130 create_output_operand (&ops[0], target_bool, bool_mode);
6131 create_output_operand (&ops[1], target_oval, mode);
6132 create_fixed_operand (&ops[2], mem);
6133 create_input_operand (&ops[3], expected, mode);
6134 create_input_operand (&ops[4], desired, mode);
6135 create_integer_operand (&ops[5], is_weak);
6136 create_integer_operand (&ops[6], succ_model);
6137 create_integer_operand (&ops[7], fail_model);
6138 if (maybe_expand_insn (icode, 8, ops))
6140 /* Return success/failure. */
6141 target_bool = ops[0].value;
6142 target_oval = ops[1].value;
6147 /* Otherwise fall back to the original __sync_val_compare_and_swap
6148 which is always seq-cst. */
6149 icode = optab_handler (sync_compare_and_swap_optab, mode);
6150 if (icode != CODE_FOR_nothing)
6154 create_output_operand (&ops[0], target_oval, mode);
6155 create_fixed_operand (&ops[1], mem);
6156 create_input_operand (&ops[2], expected, mode);
6157 create_input_operand (&ops[3], desired, mode);
6158 if (!maybe_expand_insn (icode, 4, ops))
6161 target_oval = ops[0].value;
6163 /* If the caller isn't interested in the boolean return value,
6164 skip the computation of it. */
6165 if (ptarget_bool == NULL)
6168 /* Otherwise, work out if the compare-and-swap succeeded. */
6170 if (have_insn_for (COMPARE, CCmode))
6171 note_stores (PATTERN (get_last_insn ()), find_cc_set, &cc_reg);
6174 target_bool = emit_store_flag_force (target_bool, EQ, cc_reg,
6175 const0_rtx, VOIDmode, 0, 1);
6178 goto success_bool_from_val;
6181 /* Also check for library support for __sync_val_compare_and_swap. */
6182 libfunc = optab_libfunc (sync_compare_and_swap_optab, mode);
6183 if (libfunc != NULL)
6185 rtx addr = convert_memory_address (ptr_mode, XEXP (mem, 0));
6186 rtx target = emit_library_call_value (libfunc, NULL_RTX, LCT_NORMAL,
6187 mode, 3, addr, ptr_mode,
6188 expected, mode, desired, mode);
6189 emit_move_insn (target_oval, target);
6191 /* Compute the boolean return value only if requested. */
6193 goto success_bool_from_val;
6201 success_bool_from_val:
6202 target_bool = emit_store_flag_force (target_bool, EQ, target_oval,
6203 expected, VOIDmode, 1, 1);
6205 /* Make sure that the oval output winds up where the caller asked. */
6207 *ptarget_oval = target_oval;
6209 *ptarget_bool = target_bool;
6213 /* Generate asm volatile("" : : : "memory") as the memory barrier. */
6216 expand_asm_memory_barrier (void)
6220 asm_op = gen_rtx_ASM_OPERANDS (VOIDmode, empty_string, empty_string, 0,
6221 rtvec_alloc (0), rtvec_alloc (0),
6222 rtvec_alloc (0), UNKNOWN_LOCATION);
6223 MEM_VOLATILE_P (asm_op) = 1;
6225 clob = gen_rtx_SCRATCH (VOIDmode);
6226 clob = gen_rtx_MEM (BLKmode, clob);
6227 clob = gen_rtx_CLOBBER (VOIDmode, clob);
6229 emit_insn (gen_rtx_PARALLEL (VOIDmode, gen_rtvec (2, asm_op, clob)));
6232 /* This routine will either emit the mem_thread_fence pattern or issue a
6233 sync_synchronize to generate a fence for memory model MEMMODEL. */
6236 expand_mem_thread_fence (enum memmodel model)
6238 if (targetm.have_mem_thread_fence ())
6239 emit_insn (targetm.gen_mem_thread_fence (GEN_INT (model)));
6240 else if (!is_mm_relaxed (model))
6242 if (targetm.have_memory_barrier ())
6243 emit_insn (targetm.gen_memory_barrier ());
6244 else if (synchronize_libfunc != NULL_RTX)
6245 emit_library_call (synchronize_libfunc, LCT_NORMAL, VOIDmode, 0);
6247 expand_asm_memory_barrier ();
6251 /* This routine will either emit the mem_signal_fence pattern or issue a
6252 sync_synchronize to generate a fence for memory model MEMMODEL. */
6255 expand_mem_signal_fence (enum memmodel model)
6257 if (targetm.have_mem_signal_fence ())
6258 emit_insn (targetm.gen_mem_signal_fence (GEN_INT (model)));
6259 else if (!is_mm_relaxed (model))
6261 /* By default targets are coherent between a thread and the signal
6262 handler running on the same thread. Thus this really becomes a
6263 compiler barrier, in that stores must not be sunk past
6264 (or raised above) a given point. */
6265 expand_asm_memory_barrier ();
6269 /* This function expands the atomic load operation:
6270 return the atomically loaded value in MEM.
6272 MEMMODEL is the memory model variant to use.
6273 TARGET is an option place to stick the return value. */
6276 expand_atomic_load (rtx target, rtx mem, enum memmodel model)
6278 machine_mode mode = GET_MODE (mem);
6279 enum insn_code icode;
6281 /* If the target supports the load directly, great. */
6282 icode = direct_optab_handler (atomic_load_optab, mode);
6283 if (icode != CODE_FOR_nothing)
6285 struct expand_operand ops[3];
6287 create_output_operand (&ops[0], target, mode);
6288 create_fixed_operand (&ops[1], mem);
6289 create_integer_operand (&ops[2], model);
6290 if (maybe_expand_insn (icode, 3, ops))
6291 return ops[0].value;
6294 /* If the size of the object is greater than word size on this target,
6295 then we assume that a load will not be atomic. */
6296 if (GET_MODE_PRECISION (mode) > BITS_PER_WORD)
6298 /* Issue val = compare_and_swap (mem, 0, 0).
6299 This may cause the occasional harmless store of 0 when the value is
6300 already 0, but it seems to be OK according to the standards guys. */
6301 if (expand_atomic_compare_and_swap (NULL, &target, mem, const0_rtx,
6302 const0_rtx, false, model, model))
6305 /* Otherwise there is no atomic load, leave the library call. */
6309 /* Otherwise assume loads are atomic, and emit the proper barriers. */
6310 if (!target || target == const0_rtx)
6311 target = gen_reg_rtx (mode);
6313 /* For SEQ_CST, emit a barrier before the load. */
6314 if (is_mm_seq_cst (model))
6315 expand_mem_thread_fence (model);
6317 emit_move_insn (target, mem);
6319 /* Emit the appropriate barrier after the load. */
6320 expand_mem_thread_fence (model);
6325 /* This function expands the atomic store operation:
6326 Atomically store VAL in MEM.
6327 MEMMODEL is the memory model variant to use.
6328 USE_RELEASE is true if __sync_lock_release can be used as a fall back.
6329 function returns const0_rtx if a pattern was emitted. */
6332 expand_atomic_store (rtx mem, rtx val, enum memmodel model, bool use_release)
6334 machine_mode mode = GET_MODE (mem);
6335 enum insn_code icode;
6336 struct expand_operand ops[3];
6338 /* If the target supports the store directly, great. */
6339 icode = direct_optab_handler (atomic_store_optab, mode);
6340 if (icode != CODE_FOR_nothing)
6342 create_fixed_operand (&ops[0], mem);
6343 create_input_operand (&ops[1], val, mode);
6344 create_integer_operand (&ops[2], model);
6345 if (maybe_expand_insn (icode, 3, ops))
6349 /* If using __sync_lock_release is a viable alternative, try it. */
6352 icode = direct_optab_handler (sync_lock_release_optab, mode);
6353 if (icode != CODE_FOR_nothing)
6355 create_fixed_operand (&ops[0], mem);
6356 create_input_operand (&ops[1], const0_rtx, mode);
6357 if (maybe_expand_insn (icode, 2, ops))
6359 /* lock_release is only a release barrier. */
6360 if (is_mm_seq_cst (model))
6361 expand_mem_thread_fence (model);
6367 /* If the size of the object is greater than word size on this target,
6368 a default store will not be atomic, Try a mem_exchange and throw away
6369 the result. If that doesn't work, don't do anything. */
6370 if (GET_MODE_PRECISION (mode) > BITS_PER_WORD)
6372 rtx target = maybe_emit_atomic_exchange (NULL_RTX, mem, val, model);
6374 target = maybe_emit_compare_and_swap_exchange_loop (NULL_RTX, mem, val);
6381 /* Otherwise assume stores are atomic, and emit the proper barriers. */
6382 expand_mem_thread_fence (model);
6384 emit_move_insn (mem, val);
6386 /* For SEQ_CST, also emit a barrier after the store. */
6387 if (is_mm_seq_cst (model))
6388 expand_mem_thread_fence (model);
6394 /* Structure containing the pointers and values required to process the
6395 various forms of the atomic_fetch_op and atomic_op_fetch builtins. */
6397 struct atomic_op_functions
6399 direct_optab mem_fetch_before;
6400 direct_optab mem_fetch_after;
6401 direct_optab mem_no_result;
6404 direct_optab no_result;
6405 enum rtx_code reverse_code;
6409 /* Fill in structure pointed to by OP with the various optab entries for an
6410 operation of type CODE. */
6413 get_atomic_op_for_code (struct atomic_op_functions *op, enum rtx_code code)
6415 gcc_assert (op!= NULL);
6417 /* If SWITCHABLE_TARGET is defined, then subtargets can be switched
6418 in the source code during compilation, and the optab entries are not
6419 computable until runtime. Fill in the values at runtime. */
6423 op->mem_fetch_before = atomic_fetch_add_optab;
6424 op->mem_fetch_after = atomic_add_fetch_optab;
6425 op->mem_no_result = atomic_add_optab;
6426 op->fetch_before = sync_old_add_optab;
6427 op->fetch_after = sync_new_add_optab;
6428 op->no_result = sync_add_optab;
6429 op->reverse_code = MINUS;
6432 op->mem_fetch_before = atomic_fetch_sub_optab;
6433 op->mem_fetch_after = atomic_sub_fetch_optab;
6434 op->mem_no_result = atomic_sub_optab;
6435 op->fetch_before = sync_old_sub_optab;
6436 op->fetch_after = sync_new_sub_optab;
6437 op->no_result = sync_sub_optab;
6438 op->reverse_code = PLUS;
6441 op->mem_fetch_before = atomic_fetch_xor_optab;
6442 op->mem_fetch_after = atomic_xor_fetch_optab;
6443 op->mem_no_result = atomic_xor_optab;
6444 op->fetch_before = sync_old_xor_optab;
6445 op->fetch_after = sync_new_xor_optab;
6446 op->no_result = sync_xor_optab;
6447 op->reverse_code = XOR;
6450 op->mem_fetch_before = atomic_fetch_and_optab;
6451 op->mem_fetch_after = atomic_and_fetch_optab;
6452 op->mem_no_result = atomic_and_optab;
6453 op->fetch_before = sync_old_and_optab;
6454 op->fetch_after = sync_new_and_optab;
6455 op->no_result = sync_and_optab;
6456 op->reverse_code = UNKNOWN;
6459 op->mem_fetch_before = atomic_fetch_or_optab;
6460 op->mem_fetch_after = atomic_or_fetch_optab;
6461 op->mem_no_result = atomic_or_optab;
6462 op->fetch_before = sync_old_ior_optab;
6463 op->fetch_after = sync_new_ior_optab;
6464 op->no_result = sync_ior_optab;
6465 op->reverse_code = UNKNOWN;
6468 op->mem_fetch_before = atomic_fetch_nand_optab;
6469 op->mem_fetch_after = atomic_nand_fetch_optab;
6470 op->mem_no_result = atomic_nand_optab;
6471 op->fetch_before = sync_old_nand_optab;
6472 op->fetch_after = sync_new_nand_optab;
6473 op->no_result = sync_nand_optab;
6474 op->reverse_code = UNKNOWN;
6481 /* See if there is a more optimal way to implement the operation "*MEM CODE VAL"
6482 using memory order MODEL. If AFTER is true the operation needs to return
6483 the value of *MEM after the operation, otherwise the previous value.
6484 TARGET is an optional place to place the result. The result is unused if
6486 Return the result if there is a better sequence, otherwise NULL_RTX. */
6489 maybe_optimize_fetch_op (rtx target, rtx mem, rtx val, enum rtx_code code,
6490 enum memmodel model, bool after)
6492 /* If the value is prefetched, or not used, it may be possible to replace
6493 the sequence with a native exchange operation. */
6494 if (!after || target == const0_rtx)
6496 /* fetch_and (&x, 0, m) can be replaced with exchange (&x, 0, m). */
6497 if (code == AND && val == const0_rtx)
6499 if (target == const0_rtx)
6500 target = gen_reg_rtx (GET_MODE (mem));
6501 return maybe_emit_atomic_exchange (target, mem, val, model);
6504 /* fetch_or (&x, -1, m) can be replaced with exchange (&x, -1, m). */
6505 if (code == IOR && val == constm1_rtx)
6507 if (target == const0_rtx)
6508 target = gen_reg_rtx (GET_MODE (mem));
6509 return maybe_emit_atomic_exchange (target, mem, val, model);
6516 /* Try to emit an instruction for a specific operation varaition.
6517 OPTAB contains the OP functions.
6518 TARGET is an optional place to return the result. const0_rtx means unused.
6519 MEM is the memory location to operate on.
6520 VAL is the value to use in the operation.
6521 USE_MEMMODEL is TRUE if the variation with a memory model should be tried.
6522 MODEL is the memory model, if used.
6523 AFTER is true if the returned result is the value after the operation. */
6526 maybe_emit_op (const struct atomic_op_functions *optab, rtx target, rtx mem,
6527 rtx val, bool use_memmodel, enum memmodel model, bool after)
6529 machine_mode mode = GET_MODE (mem);
6530 struct expand_operand ops[4];
6531 enum insn_code icode;
6535 /* Check to see if there is a result returned. */
6536 if (target == const0_rtx)
6540 icode = direct_optab_handler (optab->mem_no_result, mode);
6541 create_integer_operand (&ops[2], model);
6546 icode = direct_optab_handler (optab->no_result, mode);
6550 /* Otherwise, we need to generate a result. */
6555 icode = direct_optab_handler (after ? optab->mem_fetch_after
6556 : optab->mem_fetch_before, mode);
6557 create_integer_operand (&ops[3], model);
6562 icode = optab_handler (after ? optab->fetch_after
6563 : optab->fetch_before, mode);
6566 create_output_operand (&ops[op_counter++], target, mode);
6568 if (icode == CODE_FOR_nothing)
6571 create_fixed_operand (&ops[op_counter++], mem);
6572 /* VAL may have been promoted to a wider mode. Shrink it if so. */
6573 create_convert_operand_to (&ops[op_counter++], val, mode, true);
6575 if (maybe_expand_insn (icode, num_ops, ops))
6576 return (target == const0_rtx ? const0_rtx : ops[0].value);
6582 /* This function expands an atomic fetch_OP or OP_fetch operation:
6583 TARGET is an option place to stick the return value. const0_rtx indicates
6584 the result is unused.
6585 atomically fetch MEM, perform the operation with VAL and return it to MEM.
6586 CODE is the operation being performed (OP)
6587 MEMMODEL is the memory model variant to use.
6588 AFTER is true to return the result of the operation (OP_fetch).
6589 AFTER is false to return the value before the operation (fetch_OP).
6591 This function will *only* generate instructions if there is a direct
6592 optab. No compare and swap loops or libcalls will be generated. */
6595 expand_atomic_fetch_op_no_fallback (rtx target, rtx mem, rtx val,
6596 enum rtx_code code, enum memmodel model,
6599 machine_mode mode = GET_MODE (mem);
6600 struct atomic_op_functions optab;
6602 bool unused_result = (target == const0_rtx);
6604 get_atomic_op_for_code (&optab, code);
6606 /* Check to see if there are any better instructions. */
6607 result = maybe_optimize_fetch_op (target, mem, val, code, model, after);
6611 /* Check for the case where the result isn't used and try those patterns. */
6614 /* Try the memory model variant first. */
6615 result = maybe_emit_op (&optab, target, mem, val, true, model, true);
6619 /* Next try the old style withuot a memory model. */
6620 result = maybe_emit_op (&optab, target, mem, val, false, model, true);
6624 /* There is no no-result pattern, so try patterns with a result. */
6628 /* Try the __atomic version. */
6629 result = maybe_emit_op (&optab, target, mem, val, true, model, after);
6633 /* Try the older __sync version. */
6634 result = maybe_emit_op (&optab, target, mem, val, false, model, after);
6638 /* If the fetch value can be calculated from the other variation of fetch,
6639 try that operation. */
6640 if (after || unused_result || optab.reverse_code != UNKNOWN)
6642 /* Try the __atomic version, then the older __sync version. */
6643 result = maybe_emit_op (&optab, target, mem, val, true, model, !after);
6645 result = maybe_emit_op (&optab, target, mem, val, false, model, !after);
6649 /* If the result isn't used, no need to do compensation code. */
6653 /* Issue compensation code. Fetch_after == fetch_before OP val.
6654 Fetch_before == after REVERSE_OP val. */
6656 code = optab.reverse_code;
6659 result = expand_simple_binop (mode, AND, result, val, NULL_RTX,
6660 true, OPTAB_LIB_WIDEN);
6661 result = expand_simple_unop (mode, NOT, result, target, true);
6664 result = expand_simple_binop (mode, code, result, val, target,
6665 true, OPTAB_LIB_WIDEN);
6670 /* No direct opcode can be generated. */
6676 /* This function expands an atomic fetch_OP or OP_fetch operation:
6677 TARGET is an option place to stick the return value. const0_rtx indicates
6678 the result is unused.
6679 atomically fetch MEM, perform the operation with VAL and return it to MEM.
6680 CODE is the operation being performed (OP)
6681 MEMMODEL is the memory model variant to use.
6682 AFTER is true to return the result of the operation (OP_fetch).
6683 AFTER is false to return the value before the operation (fetch_OP). */
6685 expand_atomic_fetch_op (rtx target, rtx mem, rtx val, enum rtx_code code,
6686 enum memmodel model, bool after)
6688 machine_mode mode = GET_MODE (mem);
6690 bool unused_result = (target == const0_rtx);
6692 result = expand_atomic_fetch_op_no_fallback (target, mem, val, code, model,
6698 /* Add/sub can be implemented by doing the reverse operation with -(val). */
6699 if (code == PLUS || code == MINUS)
6702 enum rtx_code reverse = (code == PLUS ? MINUS : PLUS);
6705 tmp = expand_simple_unop (mode, NEG, val, NULL_RTX, true);
6706 result = expand_atomic_fetch_op_no_fallback (target, mem, tmp, reverse,
6710 /* PLUS worked so emit the insns and return. */
6717 /* PLUS did not work, so throw away the negation code and continue. */
6721 /* Try the __sync libcalls only if we can't do compare-and-swap inline. */
6722 if (!can_compare_and_swap_p (mode, false))
6726 enum rtx_code orig_code = code;
6727 struct atomic_op_functions optab;
6729 get_atomic_op_for_code (&optab, code);
6730 libfunc = optab_libfunc (after ? optab.fetch_after
6731 : optab.fetch_before, mode);
6733 && (after || unused_result || optab.reverse_code != UNKNOWN))
6737 code = optab.reverse_code;
6738 libfunc = optab_libfunc (after ? optab.fetch_before
6739 : optab.fetch_after, mode);
6741 if (libfunc != NULL)
6743 rtx addr = convert_memory_address (ptr_mode, XEXP (mem, 0));
6744 result = emit_library_call_value (libfunc, NULL, LCT_NORMAL, mode,
6745 2, addr, ptr_mode, val, mode);
6747 if (!unused_result && fixup)
6748 result = expand_simple_binop (mode, code, result, val, target,
6749 true, OPTAB_LIB_WIDEN);
6753 /* We need the original code for any further attempts. */
6757 /* If nothing else has succeeded, default to a compare and swap loop. */
6758 if (can_compare_and_swap_p (mode, true))
6761 rtx t0 = gen_reg_rtx (mode), t1;
6765 /* If the result is used, get a register for it. */
6768 if (!target || !register_operand (target, mode))
6769 target = gen_reg_rtx (mode);
6770 /* If fetch_before, copy the value now. */
6772 emit_move_insn (target, t0);
6775 target = const0_rtx;
6780 t1 = expand_simple_binop (mode, AND, t1, val, NULL_RTX,
6781 true, OPTAB_LIB_WIDEN);
6782 t1 = expand_simple_unop (mode, code, t1, NULL_RTX, true);
6785 t1 = expand_simple_binop (mode, code, t1, val, NULL_RTX, true,
6788 /* For after, copy the value now. */
6789 if (!unused_result && after)
6790 emit_move_insn (target, t1);
6791 insn = get_insns ();
6794 if (t1 != NULL && expand_compare_and_swap_loop (mem, t0, t1, insn))
6801 /* Return true if OPERAND is suitable for operand number OPNO of
6802 instruction ICODE. */
6805 insn_operand_matches (enum insn_code icode, unsigned int opno, rtx operand)
6807 return (!insn_data[(int) icode].operand[opno].predicate
6808 || (insn_data[(int) icode].operand[opno].predicate
6809 (operand, insn_data[(int) icode].operand[opno].mode)));
6812 /* TARGET is a target of a multiword operation that we are going to
6813 implement as a series of word-mode operations. Return true if
6814 TARGET is suitable for this purpose. */
6817 valid_multiword_target_p (rtx target)
6822 mode = GET_MODE (target);
6823 for (i = 0; i < GET_MODE_SIZE (mode); i += UNITS_PER_WORD)
6824 if (!validate_subreg (word_mode, mode, target, i))
6829 /* Like maybe_legitimize_operand, but do not change the code of the
6830 current rtx value. */
6833 maybe_legitimize_operand_same_code (enum insn_code icode, unsigned int opno,
6834 struct expand_operand *op)
6836 /* See if the operand matches in its current form. */
6837 if (insn_operand_matches (icode, opno, op->value))
6840 /* If the operand is a memory whose address has no side effects,
6841 try forcing the address into a non-virtual pseudo register.
6842 The check for side effects is important because copy_to_mode_reg
6843 cannot handle things like auto-modified addresses. */
6844 if (insn_data[(int) icode].operand[opno].allows_mem && MEM_P (op->value))
6849 addr = XEXP (mem, 0);
6850 if (!(REG_P (addr) && REGNO (addr) > LAST_VIRTUAL_REGISTER)
6851 && !side_effects_p (addr))
6856 last = get_last_insn ();
6857 mode = get_address_mode (mem);
6858 mem = replace_equiv_address (mem, copy_to_mode_reg (mode, addr));
6859 if (insn_operand_matches (icode, opno, mem))
6864 delete_insns_since (last);
6871 /* Try to make OP match operand OPNO of instruction ICODE. Return true
6872 on success, storing the new operand value back in OP. */
6875 maybe_legitimize_operand (enum insn_code icode, unsigned int opno,
6876 struct expand_operand *op)
6878 machine_mode mode, imode;
6879 bool old_volatile_ok, result;
6885 old_volatile_ok = volatile_ok;
6887 result = maybe_legitimize_operand_same_code (icode, opno, op);
6888 volatile_ok = old_volatile_ok;
6892 gcc_assert (mode != VOIDmode);
6894 && op->value != const0_rtx
6895 && GET_MODE (op->value) == mode
6896 && maybe_legitimize_operand_same_code (icode, opno, op))
6899 op->value = gen_reg_rtx (mode);
6904 gcc_assert (mode != VOIDmode);
6905 gcc_assert (GET_MODE (op->value) == VOIDmode
6906 || GET_MODE (op->value) == mode);
6907 if (maybe_legitimize_operand_same_code (icode, opno, op))
6910 op->value = copy_to_mode_reg (mode, op->value);
6913 case EXPAND_CONVERT_TO:
6914 gcc_assert (mode != VOIDmode);
6915 op->value = convert_to_mode (mode, op->value, op->unsigned_p);
6918 case EXPAND_CONVERT_FROM:
6919 if (GET_MODE (op->value) != VOIDmode)
6920 mode = GET_MODE (op->value);
6922 /* The caller must tell us what mode this value has. */
6923 gcc_assert (mode != VOIDmode);
6925 imode = insn_data[(int) icode].operand[opno].mode;
6926 if (imode != VOIDmode && imode != mode)
6928 op->value = convert_modes (imode, mode, op->value, op->unsigned_p);
6933 case EXPAND_ADDRESS:
6934 gcc_assert (mode != VOIDmode);
6935 op->value = convert_memory_address (mode, op->value);
6938 case EXPAND_INTEGER:
6939 mode = insn_data[(int) icode].operand[opno].mode;
6940 if (mode != VOIDmode && const_int_operand (op->value, mode))
6944 return insn_operand_matches (icode, opno, op->value);
6947 /* Make OP describe an input operand that should have the same value
6948 as VALUE, after any mode conversion that the target might request.
6949 TYPE is the type of VALUE. */
6952 create_convert_operand_from_type (struct expand_operand *op,
6953 rtx value, tree type)
6955 create_convert_operand_from (op, value, TYPE_MODE (type),
6956 TYPE_UNSIGNED (type));
6959 /* Try to make operands [OPS, OPS + NOPS) match operands [OPNO, OPNO + NOPS)
6960 of instruction ICODE. Return true on success, leaving the new operand
6961 values in the OPS themselves. Emit no code on failure. */
6964 maybe_legitimize_operands (enum insn_code icode, unsigned int opno,
6965 unsigned int nops, struct expand_operand *ops)
6970 last = get_last_insn ();
6971 for (i = 0; i < nops; i++)
6972 if (!maybe_legitimize_operand (icode, opno + i, &ops[i]))
6974 delete_insns_since (last);
6980 /* Try to generate instruction ICODE, using operands [OPS, OPS + NOPS)
6981 as its operands. Return the instruction pattern on success,
6982 and emit any necessary set-up code. Return null and emit no
6986 maybe_gen_insn (enum insn_code icode, unsigned int nops,
6987 struct expand_operand *ops)
6989 gcc_assert (nops == (unsigned int) insn_data[(int) icode].n_generator_args);
6990 if (!maybe_legitimize_operands (icode, 0, nops, ops))
6996 return GEN_FCN (icode) (ops[0].value);
6998 return GEN_FCN (icode) (ops[0].value, ops[1].value);
7000 return GEN_FCN (icode) (ops[0].value, ops[1].value, ops[2].value);
7002 return GEN_FCN (icode) (ops[0].value, ops[1].value, ops[2].value,
7005 return GEN_FCN (icode) (ops[0].value, ops[1].value, ops[2].value,
7006 ops[3].value, ops[4].value);
7008 return GEN_FCN (icode) (ops[0].value, ops[1].value, ops[2].value,
7009 ops[3].value, ops[4].value, ops[5].value);
7011 return GEN_FCN (icode) (ops[0].value, ops[1].value, ops[2].value,
7012 ops[3].value, ops[4].value, ops[5].value,
7015 return GEN_FCN (icode) (ops[0].value, ops[1].value, ops[2].value,
7016 ops[3].value, ops[4].value, ops[5].value,
7017 ops[6].value, ops[7].value);
7019 return GEN_FCN (icode) (ops[0].value, ops[1].value, ops[2].value,
7020 ops[3].value, ops[4].value, ops[5].value,
7021 ops[6].value, ops[7].value, ops[8].value);
7026 /* Try to emit instruction ICODE, using operands [OPS, OPS + NOPS)
7027 as its operands. Return true on success and emit no code on failure. */
7030 maybe_expand_insn (enum insn_code icode, unsigned int nops,
7031 struct expand_operand *ops)
7033 rtx_insn *pat = maybe_gen_insn (icode, nops, ops);
7042 /* Like maybe_expand_insn, but for jumps. */
7045 maybe_expand_jump_insn (enum insn_code icode, unsigned int nops,
7046 struct expand_operand *ops)
7048 rtx_insn *pat = maybe_gen_insn (icode, nops, ops);
7051 emit_jump_insn (pat);
7057 /* Emit instruction ICODE, using operands [OPS, OPS + NOPS)
7061 expand_insn (enum insn_code icode, unsigned int nops,
7062 struct expand_operand *ops)
7064 if (!maybe_expand_insn (icode, nops, ops))
7068 /* Like expand_insn, but for jumps. */
7071 expand_jump_insn (enum insn_code icode, unsigned int nops,
7072 struct expand_operand *ops)
7074 if (!maybe_expand_jump_insn (icode, nops, ops))