1 /* Convert tree expression to rtl instructions, for GNU compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
32 #include "hard-reg-set.h"
35 #include "insn-config.h"
36 #include "insn-attr.h"
37 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
44 #include "typeclass.h"
47 #include "langhooks.h"
50 #include "tree-iterator.h"
51 #include "tree-pass.h"
52 #include "tree-flow.h"
56 /* Decide whether a function's arguments should be processed
57 from first to last or from last to first.
59 They should if the stack and args grow in opposite directions, but
60 only if we have push insns. */
64 #ifndef PUSH_ARGS_REVERSED
65 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
66 #define PUSH_ARGS_REVERSED /* If it's last to first. */
72 #ifndef STACK_PUSH_CODE
73 #ifdef STACK_GROWS_DOWNWARD
74 #define STACK_PUSH_CODE PRE_DEC
76 #define STACK_PUSH_CODE PRE_INC
81 /* If this is nonzero, we do not bother generating VOLATILE
82 around volatile memory references, and we are willing to
83 output indirect addresses. If cse is to follow, we reject
84 indirect addresses so a useful potential cse is generated;
85 if it is used only once, instruction combination will produce
86 the same indirect address eventually. */
89 /* This structure is used by move_by_pieces to describe the move to
100 int explicit_inc_from;
101 unsigned HOST_WIDE_INT len;
102 HOST_WIDE_INT offset;
106 /* This structure is used by store_by_pieces to describe the clear to
109 struct store_by_pieces
115 unsigned HOST_WIDE_INT len;
116 HOST_WIDE_INT offset;
117 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode);
122 static unsigned HOST_WIDE_INT move_by_pieces_ninsns (unsigned HOST_WIDE_INT,
125 static void move_by_pieces_1 (rtx (*) (rtx, ...), enum machine_mode,
126 struct move_by_pieces *);
127 static bool block_move_libcall_safe_for_call_parm (void);
128 static bool emit_block_move_via_movmem (rtx, rtx, rtx, unsigned);
129 static rtx emit_block_move_via_libcall (rtx, rtx, rtx, bool);
130 static tree emit_block_move_libcall_fn (int);
131 static void emit_block_move_via_loop (rtx, rtx, rtx, unsigned);
132 static rtx clear_by_pieces_1 (void *, HOST_WIDE_INT, enum machine_mode);
133 static void clear_by_pieces (rtx, unsigned HOST_WIDE_INT, unsigned int);
134 static void store_by_pieces_1 (struct store_by_pieces *, unsigned int);
135 static void store_by_pieces_2 (rtx (*) (rtx, ...), enum machine_mode,
136 struct store_by_pieces *);
137 static bool clear_storage_via_clrmem (rtx, rtx, unsigned);
138 static rtx clear_storage_via_libcall (rtx, rtx, bool);
139 static tree clear_storage_libcall_fn (int);
140 static rtx compress_float_constant (rtx, rtx);
141 static rtx get_subtarget (rtx);
142 static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
143 HOST_WIDE_INT, enum machine_mode,
144 tree, tree, int, int);
145 static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
146 static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT, enum machine_mode,
149 static unsigned HOST_WIDE_INT highest_pow2_factor (tree);
150 static unsigned HOST_WIDE_INT highest_pow2_factor_for_target (tree, tree);
152 static int is_aligning_offset (tree, tree);
153 static void expand_operands (tree, tree, rtx, rtx*, rtx*,
154 enum expand_modifier);
155 static rtx reduce_to_bit_field_precision (rtx, rtx, tree);
156 static rtx do_store_flag (tree, rtx, enum machine_mode, int);
158 static void emit_single_push_insn (enum machine_mode, rtx, tree);
160 static void do_tablejump (rtx, enum machine_mode, rtx, rtx, rtx);
161 static rtx const_vector_from_tree (tree);
162 static void write_complex_part (rtx, rtx, bool);
164 /* Record for each mode whether we can move a register directly to or
165 from an object of that mode in memory. If we can't, we won't try
166 to use that mode directly when accessing a field of that mode. */
168 static char direct_load[NUM_MACHINE_MODES];
169 static char direct_store[NUM_MACHINE_MODES];
171 /* Record for each mode whether we can float-extend from memory. */
173 static bool float_extend_from_mem[NUM_MACHINE_MODES][NUM_MACHINE_MODES];
175 /* This macro is used to determine whether move_by_pieces should be called
176 to perform a structure copy. */
177 #ifndef MOVE_BY_PIECES_P
178 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
179 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
180 < (unsigned int) MOVE_RATIO)
183 /* This macro is used to determine whether clear_by_pieces should be
184 called to clear storage. */
185 #ifndef CLEAR_BY_PIECES_P
186 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
187 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
188 < (unsigned int) CLEAR_RATIO)
191 /* This macro is used to determine whether store_by_pieces should be
192 called to "memset" storage with byte values other than zero, or
193 to "memcpy" storage when the source is a constant string. */
194 #ifndef STORE_BY_PIECES_P
195 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
196 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
197 < (unsigned int) MOVE_RATIO)
200 /* This array records the insn_code of insns to perform block moves. */
201 enum insn_code movmem_optab[NUM_MACHINE_MODES];
203 /* This array records the insn_code of insns to perform block clears. */
204 enum insn_code clrmem_optab[NUM_MACHINE_MODES];
206 /* These arrays record the insn_code of two different kinds of insns
207 to perform block compares. */
208 enum insn_code cmpstr_optab[NUM_MACHINE_MODES];
209 enum insn_code cmpmem_optab[NUM_MACHINE_MODES];
211 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
213 #ifndef SLOW_UNALIGNED_ACCESS
214 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
217 /* This is run once per compilation to set up which modes can be used
218 directly in memory and to initialize the block move optab. */
221 init_expr_once (void)
224 enum machine_mode mode;
229 /* Try indexing by frame ptr and try by stack ptr.
230 It is known that on the Convex the stack ptr isn't a valid index.
231 With luck, one or the other is valid on any machine. */
232 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
233 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
235 /* A scratch register we can modify in-place below to avoid
236 useless RTL allocations. */
237 reg = gen_rtx_REG (VOIDmode, -1);
239 insn = rtx_alloc (INSN);
240 pat = gen_rtx_SET (0, NULL_RTX, NULL_RTX);
241 PATTERN (insn) = pat;
243 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
244 mode = (enum machine_mode) ((int) mode + 1))
248 direct_load[(int) mode] = direct_store[(int) mode] = 0;
249 PUT_MODE (mem, mode);
250 PUT_MODE (mem1, mode);
251 PUT_MODE (reg, mode);
253 /* See if there is some register that can be used in this mode and
254 directly loaded or stored from memory. */
256 if (mode != VOIDmode && mode != BLKmode)
257 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
258 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
261 if (! HARD_REGNO_MODE_OK (regno, mode))
267 SET_DEST (pat) = reg;
268 if (recog (pat, insn, &num_clobbers) >= 0)
269 direct_load[(int) mode] = 1;
271 SET_SRC (pat) = mem1;
272 SET_DEST (pat) = reg;
273 if (recog (pat, insn, &num_clobbers) >= 0)
274 direct_load[(int) mode] = 1;
277 SET_DEST (pat) = mem;
278 if (recog (pat, insn, &num_clobbers) >= 0)
279 direct_store[(int) mode] = 1;
282 SET_DEST (pat) = mem1;
283 if (recog (pat, insn, &num_clobbers) >= 0)
284 direct_store[(int) mode] = 1;
288 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
290 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
291 mode = GET_MODE_WIDER_MODE (mode))
293 enum machine_mode srcmode;
294 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
295 srcmode = GET_MODE_WIDER_MODE (srcmode))
299 ic = can_extend_p (mode, srcmode, 0);
300 if (ic == CODE_FOR_nothing)
303 PUT_MODE (mem, srcmode);
305 if ((*insn_data[ic].operand[1].predicate) (mem, srcmode))
306 float_extend_from_mem[mode][srcmode] = true;
311 /* This is run at the start of compiling a function. */
316 cfun->expr = ggc_alloc_cleared (sizeof (struct expr_status));
319 /* Copy data from FROM to TO, where the machine modes are not the same.
320 Both modes may be integer, or both may be floating.
321 UNSIGNEDP should be nonzero if FROM is an unsigned type.
322 This causes zero-extension instead of sign-extension. */
325 convert_move (rtx to, rtx from, int unsignedp)
327 enum machine_mode to_mode = GET_MODE (to);
328 enum machine_mode from_mode = GET_MODE (from);
329 int to_real = GET_MODE_CLASS (to_mode) == MODE_FLOAT;
330 int from_real = GET_MODE_CLASS (from_mode) == MODE_FLOAT;
334 /* rtx code for making an equivalent value. */
335 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
336 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
339 gcc_assert (to_real == from_real);
341 /* If the source and destination are already the same, then there's
346 /* If FROM is a SUBREG that indicates that we have already done at least
347 the required extension, strip it. We don't handle such SUBREGs as
350 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
351 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
352 >= GET_MODE_SIZE (to_mode))
353 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
354 from = gen_lowpart (to_mode, from), from_mode = to_mode;
356 gcc_assert (GET_CODE (to) != SUBREG || !SUBREG_PROMOTED_VAR_P (to));
358 if (to_mode == from_mode
359 || (from_mode == VOIDmode && CONSTANT_P (from)))
361 emit_move_insn (to, from);
365 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
367 gcc_assert (GET_MODE_BITSIZE (from_mode) == GET_MODE_BITSIZE (to_mode));
369 if (VECTOR_MODE_P (to_mode))
370 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
372 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
374 emit_move_insn (to, from);
378 if (GET_CODE (to) == CONCAT && GET_CODE (from) == CONCAT)
380 convert_move (XEXP (to, 0), XEXP (from, 0), unsignedp);
381 convert_move (XEXP (to, 1), XEXP (from, 1), unsignedp);
390 gcc_assert (GET_MODE_PRECISION (from_mode)
391 != GET_MODE_PRECISION (to_mode));
393 if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode))
398 /* Try converting directly if the insn is supported. */
400 code = tab->handlers[to_mode][from_mode].insn_code;
401 if (code != CODE_FOR_nothing)
403 emit_unop_insn (code, to, from,
404 tab == sext_optab ? FLOAT_EXTEND : FLOAT_TRUNCATE);
408 /* Otherwise use a libcall. */
409 libcall = tab->handlers[to_mode][from_mode].libfunc;
411 /* Is this conversion implemented yet? */
412 gcc_assert (libcall);
415 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
417 insns = get_insns ();
419 emit_libcall_block (insns, to, value,
420 tab == trunc_optab ? gen_rtx_FLOAT_TRUNCATE (to_mode,
422 : gen_rtx_FLOAT_EXTEND (to_mode, from));
426 /* Handle pointer conversion. */ /* SPEE 900220. */
427 /* Targets are expected to provide conversion insns between PxImode and
428 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
429 if (GET_MODE_CLASS (to_mode) == MODE_PARTIAL_INT)
431 enum machine_mode full_mode
432 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode), MODE_INT);
434 gcc_assert (trunc_optab->handlers[to_mode][full_mode].insn_code
435 != CODE_FOR_nothing);
437 if (full_mode != from_mode)
438 from = convert_to_mode (full_mode, from, unsignedp);
439 emit_unop_insn (trunc_optab->handlers[to_mode][full_mode].insn_code,
443 if (GET_MODE_CLASS (from_mode) == MODE_PARTIAL_INT)
445 enum machine_mode full_mode
446 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode), MODE_INT);
448 gcc_assert (sext_optab->handlers[full_mode][from_mode].insn_code
449 != CODE_FOR_nothing);
451 emit_unop_insn (sext_optab->handlers[full_mode][from_mode].insn_code,
453 if (to_mode == full_mode)
456 /* else proceed to integer conversions below. */
457 from_mode = full_mode;
460 /* Now both modes are integers. */
462 /* Handle expanding beyond a word. */
463 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
464 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
471 enum machine_mode lowpart_mode;
472 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
474 /* Try converting directly if the insn is supported. */
475 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
478 /* If FROM is a SUBREG, put it into a register. Do this
479 so that we always generate the same set of insns for
480 better cse'ing; if an intermediate assignment occurred,
481 we won't be doing the operation directly on the SUBREG. */
482 if (optimize > 0 && GET_CODE (from) == SUBREG)
483 from = force_reg (from_mode, from);
484 emit_unop_insn (code, to, from, equiv_code);
487 /* Next, try converting via full word. */
488 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
489 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
490 != CODE_FOR_nothing))
494 if (reg_overlap_mentioned_p (to, from))
495 from = force_reg (from_mode, from);
496 emit_insn (gen_rtx_CLOBBER (VOIDmode, to));
498 convert_move (gen_lowpart (word_mode, to), from, unsignedp);
499 emit_unop_insn (code, to,
500 gen_lowpart (word_mode, to), equiv_code);
504 /* No special multiword conversion insn; do it by hand. */
507 /* Since we will turn this into a no conflict block, we must ensure
508 that the source does not overlap the target. */
510 if (reg_overlap_mentioned_p (to, from))
511 from = force_reg (from_mode, from);
513 /* Get a copy of FROM widened to a word, if necessary. */
514 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
515 lowpart_mode = word_mode;
517 lowpart_mode = from_mode;
519 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
521 lowpart = gen_lowpart (lowpart_mode, to);
522 emit_move_insn (lowpart, lowfrom);
524 /* Compute the value to put in each remaining word. */
526 fill_value = const0_rtx;
531 && insn_data[(int) CODE_FOR_slt].operand[0].mode == word_mode
532 && STORE_FLAG_VALUE == -1)
534 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
536 fill_value = gen_reg_rtx (word_mode);
537 emit_insn (gen_slt (fill_value));
543 = expand_shift (RSHIFT_EXPR, lowpart_mode, lowfrom,
544 size_int (GET_MODE_BITSIZE (lowpart_mode) - 1),
546 fill_value = convert_to_mode (word_mode, fill_value, 1);
550 /* Fill the remaining words. */
551 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
553 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
554 rtx subword = operand_subword (to, index, 1, to_mode);
556 gcc_assert (subword);
558 if (fill_value != subword)
559 emit_move_insn (subword, fill_value);
562 insns = get_insns ();
565 emit_no_conflict_block (insns, to, from, NULL_RTX,
566 gen_rtx_fmt_e (equiv_code, to_mode, copy_rtx (from)));
570 /* Truncating multi-word to a word or less. */
571 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
572 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
575 && ! MEM_VOLATILE_P (from)
576 && direct_load[(int) to_mode]
577 && ! mode_dependent_address_p (XEXP (from, 0)))
579 || GET_CODE (from) == SUBREG))
580 from = force_reg (from_mode, from);
581 convert_move (to, gen_lowpart (word_mode, from), 0);
585 /* Now follow all the conversions between integers
586 no more than a word long. */
588 /* For truncation, usually we can just refer to FROM in a narrower mode. */
589 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
590 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
591 GET_MODE_BITSIZE (from_mode)))
594 && ! MEM_VOLATILE_P (from)
595 && direct_load[(int) to_mode]
596 && ! mode_dependent_address_p (XEXP (from, 0)))
598 || GET_CODE (from) == SUBREG))
599 from = force_reg (from_mode, from);
600 if (REG_P (from) && REGNO (from) < FIRST_PSEUDO_REGISTER
601 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
602 from = copy_to_reg (from);
603 emit_move_insn (to, gen_lowpart (to_mode, from));
607 /* Handle extension. */
608 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
610 /* Convert directly if that works. */
611 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
615 from = force_not_mem (from);
617 emit_unop_insn (code, to, from, equiv_code);
622 enum machine_mode intermediate;
626 /* Search for a mode to convert via. */
627 for (intermediate = from_mode; intermediate != VOIDmode;
628 intermediate = GET_MODE_WIDER_MODE (intermediate))
629 if (((can_extend_p (to_mode, intermediate, unsignedp)
631 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
632 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
633 GET_MODE_BITSIZE (intermediate))))
634 && (can_extend_p (intermediate, from_mode, unsignedp)
635 != CODE_FOR_nothing))
637 convert_move (to, convert_to_mode (intermediate, from,
638 unsignedp), unsignedp);
642 /* No suitable intermediate mode.
643 Generate what we need with shifts. */
644 shift_amount = build_int_cst (NULL_TREE,
645 GET_MODE_BITSIZE (to_mode)
646 - GET_MODE_BITSIZE (from_mode));
647 from = gen_lowpart (to_mode, force_reg (from_mode, from));
648 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
650 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
653 emit_move_insn (to, tmp);
658 /* Support special truncate insns for certain modes. */
659 if (trunc_optab->handlers[to_mode][from_mode].insn_code != CODE_FOR_nothing)
661 emit_unop_insn (trunc_optab->handlers[to_mode][from_mode].insn_code,
666 /* Handle truncation of volatile memrefs, and so on;
667 the things that couldn't be truncated directly,
668 and for which there was no special instruction.
670 ??? Code above formerly short-circuited this, for most integer
671 mode pairs, with a force_reg in from_mode followed by a recursive
672 call to this routine. Appears always to have been wrong. */
673 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
675 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
676 emit_move_insn (to, temp);
680 /* Mode combination is not recognized. */
684 /* Return an rtx for a value that would result
685 from converting X to mode MODE.
686 Both X and MODE may be floating, or both integer.
687 UNSIGNEDP is nonzero if X is an unsigned value.
688 This can be done by referring to a part of X in place
689 or by copying to a new temporary with conversion. */
692 convert_to_mode (enum machine_mode mode, rtx x, int unsignedp)
694 return convert_modes (mode, VOIDmode, x, unsignedp);
697 /* Return an rtx for a value that would result
698 from converting X from mode OLDMODE to mode MODE.
699 Both modes may be floating, or both integer.
700 UNSIGNEDP is nonzero if X is an unsigned value.
702 This can be done by referring to a part of X in place
703 or by copying to a new temporary with conversion.
705 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
708 convert_modes (enum machine_mode mode, enum machine_mode oldmode, rtx x, int unsignedp)
712 /* If FROM is a SUBREG that indicates that we have already done at least
713 the required extension, strip it. */
715 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
716 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
717 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
718 x = gen_lowpart (mode, x);
720 if (GET_MODE (x) != VOIDmode)
721 oldmode = GET_MODE (x);
726 /* There is one case that we must handle specially: If we are converting
727 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
728 we are to interpret the constant as unsigned, gen_lowpart will do
729 the wrong if the constant appears negative. What we want to do is
730 make the high-order word of the constant zero, not all ones. */
732 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
733 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
734 && GET_CODE (x) == CONST_INT && INTVAL (x) < 0)
736 HOST_WIDE_INT val = INTVAL (x);
738 if (oldmode != VOIDmode
739 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
741 int width = GET_MODE_BITSIZE (oldmode);
743 /* We need to zero extend VAL. */
744 val &= ((HOST_WIDE_INT) 1 << width) - 1;
747 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
750 /* We can do this with a gen_lowpart if both desired and current modes
751 are integer, and this is either a constant integer, a register, or a
752 non-volatile MEM. Except for the constant case where MODE is no
753 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
755 if ((GET_CODE (x) == CONST_INT
756 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
757 || (GET_MODE_CLASS (mode) == MODE_INT
758 && GET_MODE_CLASS (oldmode) == MODE_INT
759 && (GET_CODE (x) == CONST_DOUBLE
760 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
761 && ((MEM_P (x) && ! MEM_VOLATILE_P (x)
762 && direct_load[(int) mode])
764 && (! HARD_REGISTER_P (x)
765 || HARD_REGNO_MODE_OK (REGNO (x), mode))
766 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
767 GET_MODE_BITSIZE (GET_MODE (x)))))))))
769 /* ?? If we don't know OLDMODE, we have to assume here that
770 X does not need sign- or zero-extension. This may not be
771 the case, but it's the best we can do. */
772 if (GET_CODE (x) == CONST_INT && oldmode != VOIDmode
773 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
775 HOST_WIDE_INT val = INTVAL (x);
776 int width = GET_MODE_BITSIZE (oldmode);
778 /* We must sign or zero-extend in this case. Start by
779 zero-extending, then sign extend if we need to. */
780 val &= ((HOST_WIDE_INT) 1 << width) - 1;
782 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
783 val |= (HOST_WIDE_INT) (-1) << width;
785 return gen_int_mode (val, mode);
788 return gen_lowpart (mode, x);
791 /* Converting from integer constant into mode is always equivalent to an
793 if (VECTOR_MODE_P (mode) && GET_MODE (x) == VOIDmode)
795 gcc_assert (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (oldmode));
796 return simplify_gen_subreg (mode, x, oldmode, 0);
799 temp = gen_reg_rtx (mode);
800 convert_move (temp, x, unsignedp);
804 /* STORE_MAX_PIECES is the number of bytes at a time that we can
805 store efficiently. Due to internal GCC limitations, this is
806 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
807 for an immediate constant. */
809 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
811 /* Determine whether the LEN bytes can be moved by using several move
812 instructions. Return nonzero if a call to move_by_pieces should
816 can_move_by_pieces (unsigned HOST_WIDE_INT len,
817 unsigned int align ATTRIBUTE_UNUSED)
819 return MOVE_BY_PIECES_P (len, align);
822 /* Generate several move instructions to copy LEN bytes from block FROM to
823 block TO. (These are MEM rtx's with BLKmode).
825 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
826 used to push FROM to the stack.
828 ALIGN is maximum stack alignment we can assume.
830 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
831 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
835 move_by_pieces (rtx to, rtx from, unsigned HOST_WIDE_INT len,
836 unsigned int align, int endp)
838 struct move_by_pieces data;
839 rtx to_addr, from_addr = XEXP (from, 0);
840 unsigned int max_size = MOVE_MAX_PIECES + 1;
841 enum machine_mode mode = VOIDmode, tmode;
842 enum insn_code icode;
844 align = MIN (to ? MEM_ALIGN (to) : align, MEM_ALIGN (from));
847 data.from_addr = from_addr;
850 to_addr = XEXP (to, 0);
853 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
854 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
856 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
863 #ifdef STACK_GROWS_DOWNWARD
869 data.to_addr = to_addr;
872 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
873 || GET_CODE (from_addr) == POST_INC
874 || GET_CODE (from_addr) == POST_DEC);
876 data.explicit_inc_from = 0;
877 data.explicit_inc_to = 0;
878 if (data.reverse) data.offset = len;
881 /* If copying requires more than two move insns,
882 copy addresses to registers (to make displacements shorter)
883 and use post-increment if available. */
884 if (!(data.autinc_from && data.autinc_to)
885 && move_by_pieces_ninsns (len, align, max_size) > 2)
887 /* Find the mode of the largest move... */
888 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
889 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
890 if (GET_MODE_SIZE (tmode) < max_size)
893 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
895 data.from_addr = copy_addr_to_reg (plus_constant (from_addr, len));
896 data.autinc_from = 1;
897 data.explicit_inc_from = -1;
899 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
901 data.from_addr = copy_addr_to_reg (from_addr);
902 data.autinc_from = 1;
903 data.explicit_inc_from = 1;
905 if (!data.autinc_from && CONSTANT_P (from_addr))
906 data.from_addr = copy_addr_to_reg (from_addr);
907 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
909 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
911 data.explicit_inc_to = -1;
913 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
915 data.to_addr = copy_addr_to_reg (to_addr);
917 data.explicit_inc_to = 1;
919 if (!data.autinc_to && CONSTANT_P (to_addr))
920 data.to_addr = copy_addr_to_reg (to_addr);
923 tmode = mode_for_size (MOVE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
924 if (align >= GET_MODE_ALIGNMENT (tmode))
925 align = GET_MODE_ALIGNMENT (tmode);
928 enum machine_mode xmode;
930 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
932 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
933 if (GET_MODE_SIZE (tmode) > MOVE_MAX_PIECES
934 || SLOW_UNALIGNED_ACCESS (tmode, align))
937 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
940 /* First move what we can in the largest integer mode, then go to
941 successively smaller modes. */
945 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
946 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
947 if (GET_MODE_SIZE (tmode) < max_size)
950 if (mode == VOIDmode)
953 icode = mov_optab->handlers[(int) mode].insn_code;
954 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
955 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
957 max_size = GET_MODE_SIZE (mode);
960 /* The code above should have handled everything. */
961 gcc_assert (!data.len);
967 gcc_assert (!data.reverse);
972 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
973 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
975 data.to_addr = copy_addr_to_reg (plus_constant (data.to_addr,
978 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
985 to1 = adjust_address (data.to, QImode, data.offset);
993 /* Return number of insns required to move L bytes by pieces.
994 ALIGN (in bits) is maximum alignment we can assume. */
996 static unsigned HOST_WIDE_INT
997 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l, unsigned int align,
998 unsigned int max_size)
1000 unsigned HOST_WIDE_INT n_insns = 0;
1001 enum machine_mode tmode;
1003 tmode = mode_for_size (MOVE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
1004 if (align >= GET_MODE_ALIGNMENT (tmode))
1005 align = GET_MODE_ALIGNMENT (tmode);
1008 enum machine_mode tmode, xmode;
1010 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
1012 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
1013 if (GET_MODE_SIZE (tmode) > MOVE_MAX_PIECES
1014 || SLOW_UNALIGNED_ACCESS (tmode, align))
1017 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
1020 while (max_size > 1)
1022 enum machine_mode mode = VOIDmode;
1023 enum insn_code icode;
1025 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1026 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1027 if (GET_MODE_SIZE (tmode) < max_size)
1030 if (mode == VOIDmode)
1033 icode = mov_optab->handlers[(int) mode].insn_code;
1034 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1035 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1037 max_size = GET_MODE_SIZE (mode);
1044 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1045 with move instructions for mode MODE. GENFUN is the gen_... function
1046 to make a move insn for that mode. DATA has all the other info. */
1049 move_by_pieces_1 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
1050 struct move_by_pieces *data)
1052 unsigned int size = GET_MODE_SIZE (mode);
1053 rtx to1 = NULL_RTX, from1;
1055 while (data->len >= size)
1058 data->offset -= size;
1062 if (data->autinc_to)
1063 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1066 to1 = adjust_address (data->to, mode, data->offset);
1069 if (data->autinc_from)
1070 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1073 from1 = adjust_address (data->from, mode, data->offset);
1075 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1076 emit_insn (gen_add2_insn (data->to_addr,
1077 GEN_INT (-(HOST_WIDE_INT)size)));
1078 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1079 emit_insn (gen_add2_insn (data->from_addr,
1080 GEN_INT (-(HOST_WIDE_INT)size)));
1083 emit_insn ((*genfun) (to1, from1));
1086 #ifdef PUSH_ROUNDING
1087 emit_single_push_insn (mode, from1, NULL);
1093 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1094 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1095 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1096 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1098 if (! data->reverse)
1099 data->offset += size;
1105 /* Emit code to move a block Y to a block X. This may be done with
1106 string-move instructions, with multiple scalar move instructions,
1107 or with a library call.
1109 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1110 SIZE is an rtx that says how long they are.
1111 ALIGN is the maximum alignment we can assume they have.
1112 METHOD describes what kind of copy this is, and what mechanisms may be used.
1114 Return the address of the new block, if memcpy is called and returns it,
1118 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1126 case BLOCK_OP_NORMAL:
1127 case BLOCK_OP_TAILCALL:
1128 may_use_call = true;
1131 case BLOCK_OP_CALL_PARM:
1132 may_use_call = block_move_libcall_safe_for_call_parm ();
1134 /* Make inhibit_defer_pop nonzero around the library call
1135 to force it to pop the arguments right away. */
1139 case BLOCK_OP_NO_LIBCALL:
1140 may_use_call = false;
1147 align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1149 gcc_assert (MEM_P (x));
1150 gcc_assert (MEM_P (y));
1153 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1154 block copy is more efficient for other large modes, e.g. DCmode. */
1155 x = adjust_address (x, BLKmode, 0);
1156 y = adjust_address (y, BLKmode, 0);
1158 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1159 can be incorrect is coming from __builtin_memcpy. */
1160 if (GET_CODE (size) == CONST_INT)
1162 if (INTVAL (size) == 0)
1165 x = shallow_copy_rtx (x);
1166 y = shallow_copy_rtx (y);
1167 set_mem_size (x, size);
1168 set_mem_size (y, size);
1171 if (GET_CODE (size) == CONST_INT && MOVE_BY_PIECES_P (INTVAL (size), align))
1172 move_by_pieces (x, y, INTVAL (size), align, 0);
1173 else if (emit_block_move_via_movmem (x, y, size, align))
1175 else if (may_use_call)
1176 retval = emit_block_move_via_libcall (x, y, size,
1177 method == BLOCK_OP_TAILCALL);
1179 emit_block_move_via_loop (x, y, size, align);
1181 if (method == BLOCK_OP_CALL_PARM)
1187 /* A subroutine of emit_block_move. Returns true if calling the
1188 block move libcall will not clobber any parameters which may have
1189 already been placed on the stack. */
1192 block_move_libcall_safe_for_call_parm (void)
1194 /* If arguments are pushed on the stack, then they're safe. */
1198 /* If registers go on the stack anyway, any argument is sure to clobber
1199 an outgoing argument. */
1200 #if defined (REG_PARM_STACK_SPACE) && defined (OUTGOING_REG_PARM_STACK_SPACE)
1202 tree fn = emit_block_move_libcall_fn (false);
1204 if (REG_PARM_STACK_SPACE (fn) != 0)
1209 /* If any argument goes in memory, then it might clobber an outgoing
1212 CUMULATIVE_ARGS args_so_far;
1215 fn = emit_block_move_libcall_fn (false);
1216 INIT_CUMULATIVE_ARGS (args_so_far, TREE_TYPE (fn), NULL_RTX, 0, 3);
1218 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1219 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1221 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1222 rtx tmp = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
1223 if (!tmp || !REG_P (tmp))
1225 if (targetm.calls.arg_partial_bytes (&args_so_far, mode, NULL, 1))
1227 FUNCTION_ARG_ADVANCE (args_so_far, mode, NULL_TREE, 1);
1233 /* A subroutine of emit_block_move. Expand a movmem pattern;
1234 return true if successful. */
1237 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align)
1239 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1240 int save_volatile_ok = volatile_ok;
1241 enum machine_mode mode;
1243 /* Since this is a move insn, we don't care about volatility. */
1246 /* Try the most limited insn first, because there's no point
1247 including more than one in the machine description unless
1248 the more limited one has some advantage. */
1250 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1251 mode = GET_MODE_WIDER_MODE (mode))
1253 enum insn_code code = movmem_optab[(int) mode];
1254 insn_operand_predicate_fn pred;
1256 if (code != CODE_FOR_nothing
1257 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1258 here because if SIZE is less than the mode mask, as it is
1259 returned by the macro, it will definitely be less than the
1260 actual mode mask. */
1261 && ((GET_CODE (size) == CONST_INT
1262 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1263 <= (GET_MODE_MASK (mode) >> 1)))
1264 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1265 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1266 || (*pred) (x, BLKmode))
1267 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1268 || (*pred) (y, BLKmode))
1269 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1270 || (*pred) (opalign, VOIDmode)))
1273 rtx last = get_last_insn ();
1276 op2 = convert_to_mode (mode, size, 1);
1277 pred = insn_data[(int) code].operand[2].predicate;
1278 if (pred != 0 && ! (*pred) (op2, mode))
1279 op2 = copy_to_mode_reg (mode, op2);
1281 /* ??? When called via emit_block_move_for_call, it'd be
1282 nice if there were some way to inform the backend, so
1283 that it doesn't fail the expansion because it thinks
1284 emitting the libcall would be more efficient. */
1286 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1290 volatile_ok = save_volatile_ok;
1294 delete_insns_since (last);
1298 volatile_ok = save_volatile_ok;
1302 /* A subroutine of emit_block_move. Expand a call to memcpy.
1303 Return the return value from memcpy, 0 otherwise. */
1306 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1308 rtx dst_addr, src_addr;
1309 tree call_expr, arg_list, fn, src_tree, dst_tree, size_tree;
1310 enum machine_mode size_mode;
1313 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1314 pseudos. We can then place those new pseudos into a VAR_DECL and
1317 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1318 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1320 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1321 src_addr = convert_memory_address (ptr_mode, src_addr);
1323 dst_tree = make_tree (ptr_type_node, dst_addr);
1324 src_tree = make_tree (ptr_type_node, src_addr);
1326 size_mode = TYPE_MODE (sizetype);
1328 size = convert_to_mode (size_mode, size, 1);
1329 size = copy_to_mode_reg (size_mode, size);
1331 /* It is incorrect to use the libcall calling conventions to call
1332 memcpy in this context. This could be a user call to memcpy and
1333 the user may wish to examine the return value from memcpy. For
1334 targets where libcalls and normal calls have different conventions
1335 for returning pointers, we could end up generating incorrect code. */
1337 size_tree = make_tree (sizetype, size);
1339 fn = emit_block_move_libcall_fn (true);
1340 arg_list = tree_cons (NULL_TREE, size_tree, NULL_TREE);
1341 arg_list = tree_cons (NULL_TREE, src_tree, arg_list);
1342 arg_list = tree_cons (NULL_TREE, dst_tree, arg_list);
1344 /* Now we have to build up the CALL_EXPR itself. */
1345 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
1346 call_expr = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
1347 call_expr, arg_list, NULL_TREE);
1348 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1350 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
1355 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1356 for the function we use for block copies. The first time FOR_CALL
1357 is true, we call assemble_external. */
1359 static GTY(()) tree block_move_fn;
1362 init_block_move_fn (const char *asmspec)
1368 fn = get_identifier ("memcpy");
1369 args = build_function_type_list (ptr_type_node, ptr_type_node,
1370 const_ptr_type_node, sizetype,
1373 fn = build_decl (FUNCTION_DECL, fn, args);
1374 DECL_EXTERNAL (fn) = 1;
1375 TREE_PUBLIC (fn) = 1;
1376 DECL_ARTIFICIAL (fn) = 1;
1377 TREE_NOTHROW (fn) = 1;
1383 set_user_assembler_name (block_move_fn, asmspec);
1387 emit_block_move_libcall_fn (int for_call)
1389 static bool emitted_extern;
1392 init_block_move_fn (NULL);
1394 if (for_call && !emitted_extern)
1396 emitted_extern = true;
1397 make_decl_rtl (block_move_fn);
1398 assemble_external (block_move_fn);
1401 return block_move_fn;
1404 /* A subroutine of emit_block_move. Copy the data via an explicit
1405 loop. This is used only when libcalls are forbidden. */
1406 /* ??? It'd be nice to copy in hunks larger than QImode. */
1409 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1410 unsigned int align ATTRIBUTE_UNUSED)
1412 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1413 enum machine_mode iter_mode;
1415 iter_mode = GET_MODE (size);
1416 if (iter_mode == VOIDmode)
1417 iter_mode = word_mode;
1419 top_label = gen_label_rtx ();
1420 cmp_label = gen_label_rtx ();
1421 iter = gen_reg_rtx (iter_mode);
1423 emit_move_insn (iter, const0_rtx);
1425 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1426 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1427 do_pending_stack_adjust ();
1429 emit_jump (cmp_label);
1430 emit_label (top_label);
1432 tmp = convert_modes (Pmode, iter_mode, iter, true);
1433 x_addr = gen_rtx_PLUS (Pmode, x_addr, tmp);
1434 y_addr = gen_rtx_PLUS (Pmode, y_addr, tmp);
1435 x = change_address (x, QImode, x_addr);
1436 y = change_address (y, QImode, y_addr);
1438 emit_move_insn (x, y);
1440 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1441 true, OPTAB_LIB_WIDEN);
1443 emit_move_insn (iter, tmp);
1445 emit_label (cmp_label);
1447 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1451 /* Copy all or part of a value X into registers starting at REGNO.
1452 The number of registers to be filled is NREGS. */
1455 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1458 #ifdef HAVE_load_multiple
1466 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1467 x = validize_mem (force_const_mem (mode, x));
1469 /* See if the machine can do this with a load multiple insn. */
1470 #ifdef HAVE_load_multiple
1471 if (HAVE_load_multiple)
1473 last = get_last_insn ();
1474 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1482 delete_insns_since (last);
1486 for (i = 0; i < nregs; i++)
1487 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1488 operand_subword_force (x, i, mode));
1491 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1492 The number of registers to be filled is NREGS. */
1495 move_block_from_reg (int regno, rtx x, int nregs)
1502 /* See if the machine can do this with a store multiple insn. */
1503 #ifdef HAVE_store_multiple
1504 if (HAVE_store_multiple)
1506 rtx last = get_last_insn ();
1507 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1515 delete_insns_since (last);
1519 for (i = 0; i < nregs; i++)
1521 rtx tem = operand_subword (x, i, 1, BLKmode);
1525 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1529 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1530 ORIG, where ORIG is a non-consecutive group of registers represented by
1531 a PARALLEL. The clone is identical to the original except in that the
1532 original set of registers is replaced by a new set of pseudo registers.
1533 The new set has the same modes as the original set. */
1536 gen_group_rtx (rtx orig)
1541 gcc_assert (GET_CODE (orig) == PARALLEL);
1543 length = XVECLEN (orig, 0);
1544 tmps = alloca (sizeof (rtx) * length);
1546 /* Skip a NULL entry in first slot. */
1547 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1552 for (; i < length; i++)
1554 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1555 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1557 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1560 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1563 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1564 except that values are placed in TMPS[i], and must later be moved
1565 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1568 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1572 enum machine_mode m = GET_MODE (orig_src);
1574 gcc_assert (GET_CODE (dst) == PARALLEL);
1577 && !SCALAR_INT_MODE_P (m)
1578 && !MEM_P (orig_src)
1579 && GET_CODE (orig_src) != CONCAT)
1581 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1582 if (imode == BLKmode)
1583 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1585 src = gen_reg_rtx (imode);
1586 if (imode != BLKmode)
1587 src = gen_lowpart (GET_MODE (orig_src), src);
1588 emit_move_insn (src, orig_src);
1589 /* ...and back again. */
1590 if (imode != BLKmode)
1591 src = gen_lowpart (imode, src);
1592 emit_group_load_1 (tmps, dst, src, type, ssize);
1596 /* Check for a NULL entry, used to indicate that the parameter goes
1597 both on the stack and in registers. */
1598 if (XEXP (XVECEXP (dst, 0, 0), 0))
1603 /* Process the pieces. */
1604 for (i = start; i < XVECLEN (dst, 0); i++)
1606 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1607 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1608 unsigned int bytelen = GET_MODE_SIZE (mode);
1611 /* Handle trailing fragments that run over the size of the struct. */
1612 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1614 /* Arrange to shift the fragment to where it belongs.
1615 extract_bit_field loads to the lsb of the reg. */
1617 #ifdef BLOCK_REG_PADDING
1618 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1619 == (BYTES_BIG_ENDIAN ? upward : downward)
1624 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1625 bytelen = ssize - bytepos;
1626 gcc_assert (bytelen > 0);
1629 /* If we won't be loading directly from memory, protect the real source
1630 from strange tricks we might play; but make sure that the source can
1631 be loaded directly into the destination. */
1633 if (!MEM_P (orig_src)
1634 && (!CONSTANT_P (orig_src)
1635 || (GET_MODE (orig_src) != mode
1636 && GET_MODE (orig_src) != VOIDmode)))
1638 if (GET_MODE (orig_src) == VOIDmode)
1639 src = gen_reg_rtx (mode);
1641 src = gen_reg_rtx (GET_MODE (orig_src));
1643 emit_move_insn (src, orig_src);
1646 /* Optimize the access just a bit. */
1648 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1649 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1650 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1651 && bytelen == GET_MODE_SIZE (mode))
1653 tmps[i] = gen_reg_rtx (mode);
1654 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1656 else if (COMPLEX_MODE_P (mode)
1657 && GET_MODE (src) == mode
1658 && bytelen == GET_MODE_SIZE (mode))
1659 /* Let emit_move_complex do the bulk of the work. */
1661 else if (GET_CODE (src) == CONCAT)
1663 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1664 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1666 if ((bytepos == 0 && bytelen == slen0)
1667 || (bytepos != 0 && bytepos + bytelen <= slen))
1669 /* The following assumes that the concatenated objects all
1670 have the same size. In this case, a simple calculation
1671 can be used to determine the object and the bit field
1673 tmps[i] = XEXP (src, bytepos / slen0);
1674 if (! CONSTANT_P (tmps[i])
1675 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1676 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1677 (bytepos % slen0) * BITS_PER_UNIT,
1678 1, NULL_RTX, mode, mode);
1684 gcc_assert (!bytepos);
1685 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1686 emit_move_insn (mem, src);
1687 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1688 0, 1, NULL_RTX, mode, mode);
1691 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1692 SIMD register, which is currently broken. While we get GCC
1693 to emit proper RTL for these cases, let's dump to memory. */
1694 else if (VECTOR_MODE_P (GET_MODE (dst))
1697 int slen = GET_MODE_SIZE (GET_MODE (src));
1700 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1701 emit_move_insn (mem, src);
1702 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1704 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1705 && XVECLEN (dst, 0) > 1)
1706 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1707 else if (CONSTANT_P (src)
1708 || (REG_P (src) && GET_MODE (src) == mode))
1711 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1712 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
1716 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1717 build_int_cst (NULL_TREE, shift), tmps[i], 0);
1721 /* Emit code to move a block SRC of type TYPE to a block DST,
1722 where DST is non-consecutive registers represented by a PARALLEL.
1723 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1727 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1732 tmps = alloca (sizeof (rtx) * XVECLEN (dst, 0));
1733 emit_group_load_1 (tmps, dst, src, type, ssize);
1735 /* Copy the extracted pieces into the proper (probable) hard regs. */
1736 for (i = 0; i < XVECLEN (dst, 0); i++)
1738 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1741 emit_move_insn (d, tmps[i]);
1745 /* Similar, but load SRC into new pseudos in a format that looks like
1746 PARALLEL. This can later be fed to emit_group_move to get things
1747 in the right place. */
1750 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1755 vec = rtvec_alloc (XVECLEN (parallel, 0));
1756 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1758 /* Convert the vector to look just like the original PARALLEL, except
1759 with the computed values. */
1760 for (i = 0; i < XVECLEN (parallel, 0); i++)
1762 rtx e = XVECEXP (parallel, 0, i);
1763 rtx d = XEXP (e, 0);
1767 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1768 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1770 RTVEC_ELT (vec, i) = e;
1773 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1776 /* Emit code to move a block SRC to block DST, where SRC and DST are
1777 non-consecutive groups of registers, each represented by a PARALLEL. */
1780 emit_group_move (rtx dst, rtx src)
1784 gcc_assert (GET_CODE (src) == PARALLEL
1785 && GET_CODE (dst) == PARALLEL
1786 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1788 /* Skip first entry if NULL. */
1789 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1790 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1791 XEXP (XVECEXP (src, 0, i), 0));
1794 /* Move a group of registers represented by a PARALLEL into pseudos. */
1797 emit_group_move_into_temps (rtx src)
1799 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1802 for (i = 0; i < XVECLEN (src, 0); i++)
1804 rtx e = XVECEXP (src, 0, i);
1805 rtx d = XEXP (e, 0);
1808 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1809 RTVEC_ELT (vec, i) = e;
1812 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1815 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1816 where SRC is non-consecutive registers represented by a PARALLEL.
1817 SSIZE represents the total size of block ORIG_DST, or -1 if not
1821 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1825 enum machine_mode m = GET_MODE (orig_dst);
1827 gcc_assert (GET_CODE (src) == PARALLEL);
1829 if (!SCALAR_INT_MODE_P (m)
1830 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1832 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1833 if (imode == BLKmode)
1834 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1836 dst = gen_reg_rtx (imode);
1837 emit_group_store (dst, src, type, ssize);
1838 if (imode != BLKmode)
1839 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1840 emit_move_insn (orig_dst, dst);
1844 /* Check for a NULL entry, used to indicate that the parameter goes
1845 both on the stack and in registers. */
1846 if (XEXP (XVECEXP (src, 0, 0), 0))
1851 tmps = alloca (sizeof (rtx) * XVECLEN (src, 0));
1853 /* Copy the (probable) hard regs into pseudos. */
1854 for (i = start; i < XVECLEN (src, 0); i++)
1856 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1857 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1858 emit_move_insn (tmps[i], reg);
1861 /* If we won't be storing directly into memory, protect the real destination
1862 from strange tricks we might play. */
1864 if (GET_CODE (dst) == PARALLEL)
1868 /* We can get a PARALLEL dst if there is a conditional expression in
1869 a return statement. In that case, the dst and src are the same,
1870 so no action is necessary. */
1871 if (rtx_equal_p (dst, src))
1874 /* It is unclear if we can ever reach here, but we may as well handle
1875 it. Allocate a temporary, and split this into a store/load to/from
1878 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1879 emit_group_store (temp, src, type, ssize);
1880 emit_group_load (dst, temp, type, ssize);
1883 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1885 dst = gen_reg_rtx (GET_MODE (orig_dst));
1886 /* Make life a bit easier for combine. */
1887 emit_move_insn (dst, CONST0_RTX (GET_MODE (orig_dst)));
1890 /* Process the pieces. */
1891 for (i = start; i < XVECLEN (src, 0); i++)
1893 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
1894 enum machine_mode mode = GET_MODE (tmps[i]);
1895 unsigned int bytelen = GET_MODE_SIZE (mode);
1898 /* Handle trailing fragments that run over the size of the struct. */
1899 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1901 /* store_bit_field always takes its value from the lsb.
1902 Move the fragment to the lsb if it's not already there. */
1904 #ifdef BLOCK_REG_PADDING
1905 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
1906 == (BYTES_BIG_ENDIAN ? upward : downward)
1912 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1913 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
1914 build_int_cst (NULL_TREE, shift),
1917 bytelen = ssize - bytepos;
1920 if (GET_CODE (dst) == CONCAT)
1922 if (bytepos + bytelen <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
1923 dest = XEXP (dst, 0);
1924 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
1926 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
1927 dest = XEXP (dst, 1);
1931 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
1932 dest = assign_stack_temp (GET_MODE (dest),
1933 GET_MODE_SIZE (GET_MODE (dest)), 0);
1934 emit_move_insn (adjust_address (dest, GET_MODE (tmps[i]), bytepos),
1941 /* Optimize the access just a bit. */
1943 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
1944 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
1945 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1946 && bytelen == GET_MODE_SIZE (mode))
1947 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
1949 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
1953 /* Copy from the pseudo into the (probable) hard reg. */
1954 if (orig_dst != dst)
1955 emit_move_insn (orig_dst, dst);
1958 /* Generate code to copy a BLKmode object of TYPE out of a
1959 set of registers starting with SRCREG into TGTBLK. If TGTBLK
1960 is null, a stack temporary is created. TGTBLK is returned.
1962 The purpose of this routine is to handle functions that return
1963 BLKmode structures in registers. Some machines (the PA for example)
1964 want to return all small structures in registers regardless of the
1965 structure's alignment. */
1968 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
1970 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
1971 rtx src = NULL, dst = NULL;
1972 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
1973 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
1977 tgtblk = assign_temp (build_qualified_type (type,
1979 | TYPE_QUAL_CONST)),
1981 preserve_temp_slots (tgtblk);
1984 /* This code assumes srcreg is at least a full word. If it isn't, copy it
1985 into a new pseudo which is a full word. */
1987 if (GET_MODE (srcreg) != BLKmode
1988 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
1989 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
1991 /* If the structure doesn't take up a whole number of words, see whether
1992 SRCREG is padded on the left or on the right. If it's on the left,
1993 set PADDING_CORRECTION to the number of bits to skip.
1995 In most ABIs, the structure will be returned at the least end of
1996 the register, which translates to right padding on little-endian
1997 targets and left padding on big-endian targets. The opposite
1998 holds if the structure is returned at the most significant
1999 end of the register. */
2000 if (bytes % UNITS_PER_WORD != 0
2001 && (targetm.calls.return_in_msb (type)
2003 : BYTES_BIG_ENDIAN))
2005 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2007 /* Copy the structure BITSIZE bites at a time.
2009 We could probably emit more efficient code for machines which do not use
2010 strict alignment, but it doesn't seem worth the effort at the current
2012 for (bitpos = 0, xbitpos = padding_correction;
2013 bitpos < bytes * BITS_PER_UNIT;
2014 bitpos += bitsize, xbitpos += bitsize)
2016 /* We need a new source operand each time xbitpos is on a
2017 word boundary and when xbitpos == padding_correction
2018 (the first time through). */
2019 if (xbitpos % BITS_PER_WORD == 0
2020 || xbitpos == padding_correction)
2021 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2024 /* We need a new destination operand each time bitpos is on
2026 if (bitpos % BITS_PER_WORD == 0)
2027 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2029 /* Use xbitpos for the source extraction (right justified) and
2030 xbitpos for the destination store (left justified). */
2031 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2032 extract_bit_field (src, bitsize,
2033 xbitpos % BITS_PER_WORD, 1,
2034 NULL_RTX, word_mode, word_mode));
2040 /* Add a USE expression for REG to the (possibly empty) list pointed
2041 to by CALL_FUSAGE. REG must denote a hard register. */
2044 use_reg (rtx *call_fusage, rtx reg)
2046 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2049 = gen_rtx_EXPR_LIST (VOIDmode,
2050 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2053 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2054 starting at REGNO. All of these registers must be hard registers. */
2057 use_regs (rtx *call_fusage, int regno, int nregs)
2061 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2063 for (i = 0; i < nregs; i++)
2064 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2067 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2068 PARALLEL REGS. This is for calls that pass values in multiple
2069 non-contiguous locations. The Irix 6 ABI has examples of this. */
2072 use_group_regs (rtx *call_fusage, rtx regs)
2076 for (i = 0; i < XVECLEN (regs, 0); i++)
2078 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2080 /* A NULL entry means the parameter goes both on the stack and in
2081 registers. This can also be a MEM for targets that pass values
2082 partially on the stack and partially in registers. */
2083 if (reg != 0 && REG_P (reg))
2084 use_reg (call_fusage, reg);
2089 /* Determine whether the LEN bytes generated by CONSTFUN can be
2090 stored to memory using several move instructions. CONSTFUNDATA is
2091 a pointer which will be passed as argument in every CONSTFUN call.
2092 ALIGN is maximum alignment we can assume. Return nonzero if a
2093 call to store_by_pieces should succeed. */
2096 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2097 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2098 void *constfundata, unsigned int align)
2100 unsigned HOST_WIDE_INT l;
2101 unsigned int max_size;
2102 HOST_WIDE_INT offset = 0;
2103 enum machine_mode mode, tmode;
2104 enum insn_code icode;
2111 if (! STORE_BY_PIECES_P (len, align))
2114 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2115 if (align >= GET_MODE_ALIGNMENT (tmode))
2116 align = GET_MODE_ALIGNMENT (tmode);
2119 enum machine_mode xmode;
2121 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2123 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2124 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2125 || SLOW_UNALIGNED_ACCESS (tmode, align))
2128 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2131 /* We would first store what we can in the largest integer mode, then go to
2132 successively smaller modes. */
2135 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2140 max_size = STORE_MAX_PIECES + 1;
2141 while (max_size > 1)
2143 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2144 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2145 if (GET_MODE_SIZE (tmode) < max_size)
2148 if (mode == VOIDmode)
2151 icode = mov_optab->handlers[(int) mode].insn_code;
2152 if (icode != CODE_FOR_nothing
2153 && align >= GET_MODE_ALIGNMENT (mode))
2155 unsigned int size = GET_MODE_SIZE (mode);
2162 cst = (*constfun) (constfundata, offset, mode);
2163 if (!LEGITIMATE_CONSTANT_P (cst))
2173 max_size = GET_MODE_SIZE (mode);
2176 /* The code above should have handled everything. */
2183 /* Generate several move instructions to store LEN bytes generated by
2184 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2185 pointer which will be passed as argument in every CONSTFUN call.
2186 ALIGN is maximum alignment we can assume.
2187 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2188 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2192 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2193 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2194 void *constfundata, unsigned int align, int endp)
2196 struct store_by_pieces data;
2200 gcc_assert (endp != 2);
2204 gcc_assert (STORE_BY_PIECES_P (len, align));
2205 data.constfun = constfun;
2206 data.constfundata = constfundata;
2209 store_by_pieces_1 (&data, align);
2214 gcc_assert (!data.reverse);
2219 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2220 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2222 data.to_addr = copy_addr_to_reg (plus_constant (data.to_addr,
2225 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2232 to1 = adjust_address (data.to, QImode, data.offset);
2240 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2241 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2244 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2246 struct store_by_pieces data;
2251 data.constfun = clear_by_pieces_1;
2252 data.constfundata = NULL;
2255 store_by_pieces_1 (&data, align);
2258 /* Callback routine for clear_by_pieces.
2259 Return const0_rtx unconditionally. */
2262 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2263 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2264 enum machine_mode mode ATTRIBUTE_UNUSED)
2269 /* Subroutine of clear_by_pieces and store_by_pieces.
2270 Generate several move instructions to store LEN bytes of block TO. (A MEM
2271 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2274 store_by_pieces_1 (struct store_by_pieces *data ATTRIBUTE_UNUSED,
2275 unsigned int align ATTRIBUTE_UNUSED)
2277 rtx to_addr = XEXP (data->to, 0);
2278 unsigned int max_size = STORE_MAX_PIECES + 1;
2279 enum machine_mode mode = VOIDmode, tmode;
2280 enum insn_code icode;
2283 data->to_addr = to_addr;
2285 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2286 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2288 data->explicit_inc_to = 0;
2290 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2292 data->offset = data->len;
2294 /* If storing requires more than two move insns,
2295 copy addresses to registers (to make displacements shorter)
2296 and use post-increment if available. */
2297 if (!data->autinc_to
2298 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2300 /* Determine the main mode we'll be using. */
2301 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2302 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2303 if (GET_MODE_SIZE (tmode) < max_size)
2306 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2308 data->to_addr = copy_addr_to_reg (plus_constant (to_addr, data->len));
2309 data->autinc_to = 1;
2310 data->explicit_inc_to = -1;
2313 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2314 && ! data->autinc_to)
2316 data->to_addr = copy_addr_to_reg (to_addr);
2317 data->autinc_to = 1;
2318 data->explicit_inc_to = 1;
2321 if ( !data->autinc_to && CONSTANT_P (to_addr))
2322 data->to_addr = copy_addr_to_reg (to_addr);
2325 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2326 if (align >= GET_MODE_ALIGNMENT (tmode))
2327 align = GET_MODE_ALIGNMENT (tmode);
2330 enum machine_mode xmode;
2332 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2334 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2335 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2336 || SLOW_UNALIGNED_ACCESS (tmode, align))
2339 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2342 /* First store what we can in the largest integer mode, then go to
2343 successively smaller modes. */
2345 while (max_size > 1)
2347 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2348 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2349 if (GET_MODE_SIZE (tmode) < max_size)
2352 if (mode == VOIDmode)
2355 icode = mov_optab->handlers[(int) mode].insn_code;
2356 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2357 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2359 max_size = GET_MODE_SIZE (mode);
2362 /* The code above should have handled everything. */
2363 gcc_assert (!data->len);
2366 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2367 with move instructions for mode MODE. GENFUN is the gen_... function
2368 to make a move insn for that mode. DATA has all the other info. */
2371 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2372 struct store_by_pieces *data)
2374 unsigned int size = GET_MODE_SIZE (mode);
2377 while (data->len >= size)
2380 data->offset -= size;
2382 if (data->autinc_to)
2383 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2386 to1 = adjust_address (data->to, mode, data->offset);
2388 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2389 emit_insn (gen_add2_insn (data->to_addr,
2390 GEN_INT (-(HOST_WIDE_INT) size)));
2392 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2393 emit_insn ((*genfun) (to1, cst));
2395 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2396 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2398 if (! data->reverse)
2399 data->offset += size;
2405 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2406 its length in bytes. */
2409 clear_storage (rtx object, rtx size, enum block_op_methods method)
2411 enum machine_mode mode = GET_MODE (object);
2414 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2416 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2417 just move a zero. Otherwise, do this a piece at a time. */
2419 && GET_CODE (size) == CONST_INT
2420 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2422 rtx zero = CONST0_RTX (mode);
2425 emit_move_insn (object, zero);
2429 if (COMPLEX_MODE_P (mode))
2431 zero = CONST0_RTX (GET_MODE_INNER (mode));
2434 write_complex_part (object, zero, 0);
2435 write_complex_part (object, zero, 1);
2441 if (size == const0_rtx)
2444 align = MEM_ALIGN (object);
2446 if (GET_CODE (size) == CONST_INT
2447 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2448 clear_by_pieces (object, INTVAL (size), align);
2449 else if (clear_storage_via_clrmem (object, size, align))
2452 return clear_storage_via_libcall (object, size,
2453 method == BLOCK_OP_TAILCALL);
2458 /* A subroutine of clear_storage. Expand a clrmem pattern;
2459 return true if successful. */
2462 clear_storage_via_clrmem (rtx object, rtx size, unsigned int align)
2464 /* Try the most limited insn first, because there's no point
2465 including more than one in the machine description unless
2466 the more limited one has some advantage. */
2468 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2469 enum machine_mode mode;
2471 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2472 mode = GET_MODE_WIDER_MODE (mode))
2474 enum insn_code code = clrmem_optab[(int) mode];
2475 insn_operand_predicate_fn pred;
2477 if (code != CODE_FOR_nothing
2478 /* We don't need MODE to be narrower than
2479 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2480 the mode mask, as it is returned by the macro, it will
2481 definitely be less than the actual mode mask. */
2482 && ((GET_CODE (size) == CONST_INT
2483 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2484 <= (GET_MODE_MASK (mode) >> 1)))
2485 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2486 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2487 || (*pred) (object, BLKmode))
2488 && ((pred = insn_data[(int) code].operand[2].predicate) == 0
2489 || (*pred) (opalign, VOIDmode)))
2492 rtx last = get_last_insn ();
2495 op1 = convert_to_mode (mode, size, 1);
2496 pred = insn_data[(int) code].operand[1].predicate;
2497 if (pred != 0 && ! (*pred) (op1, mode))
2498 op1 = copy_to_mode_reg (mode, op1);
2500 pat = GEN_FCN ((int) code) (object, op1, opalign);
2507 delete_insns_since (last);
2514 /* A subroutine of clear_storage. Expand a call to memset.
2515 Return the return value of memset, 0 otherwise. */
2518 clear_storage_via_libcall (rtx object, rtx size, bool tailcall)
2520 tree call_expr, arg_list, fn, object_tree, size_tree;
2521 enum machine_mode size_mode;
2524 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2525 place those into new pseudos into a VAR_DECL and use them later. */
2527 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2529 size_mode = TYPE_MODE (sizetype);
2530 size = convert_to_mode (size_mode, size, 1);
2531 size = copy_to_mode_reg (size_mode, size);
2533 /* It is incorrect to use the libcall calling conventions to call
2534 memset in this context. This could be a user call to memset and
2535 the user may wish to examine the return value from memset. For
2536 targets where libcalls and normal calls have different conventions
2537 for returning pointers, we could end up generating incorrect code. */
2539 object_tree = make_tree (ptr_type_node, object);
2540 size_tree = make_tree (sizetype, size);
2542 fn = clear_storage_libcall_fn (true);
2543 arg_list = tree_cons (NULL_TREE, size_tree, NULL_TREE);
2544 arg_list = tree_cons (NULL_TREE, integer_zero_node, arg_list);
2545 arg_list = tree_cons (NULL_TREE, object_tree, arg_list);
2547 /* Now we have to build up the CALL_EXPR itself. */
2548 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2549 call_expr = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
2550 call_expr, arg_list, NULL_TREE);
2551 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2553 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
2558 /* A subroutine of clear_storage_via_libcall. Create the tree node
2559 for the function we use for block clears. The first time FOR_CALL
2560 is true, we call assemble_external. */
2562 static GTY(()) tree block_clear_fn;
2565 init_block_clear_fn (const char *asmspec)
2567 if (!block_clear_fn)
2571 fn = get_identifier ("memset");
2572 args = build_function_type_list (ptr_type_node, ptr_type_node,
2573 integer_type_node, sizetype,
2576 fn = build_decl (FUNCTION_DECL, fn, args);
2577 DECL_EXTERNAL (fn) = 1;
2578 TREE_PUBLIC (fn) = 1;
2579 DECL_ARTIFICIAL (fn) = 1;
2580 TREE_NOTHROW (fn) = 1;
2582 block_clear_fn = fn;
2586 set_user_assembler_name (block_clear_fn, asmspec);
2590 clear_storage_libcall_fn (int for_call)
2592 static bool emitted_extern;
2594 if (!block_clear_fn)
2595 init_block_clear_fn (NULL);
2597 if (for_call && !emitted_extern)
2599 emitted_extern = true;
2600 make_decl_rtl (block_clear_fn);
2601 assemble_external (block_clear_fn);
2604 return block_clear_fn;
2607 /* Write to one of the components of the complex value CPLX. Write VAL to
2608 the real part if IMAG_P is false, and the imaginary part if its true. */
2611 write_complex_part (rtx cplx, rtx val, bool imag_p)
2613 enum machine_mode cmode;
2614 enum machine_mode imode;
2617 if (GET_CODE (cplx) == CONCAT)
2619 emit_move_insn (XEXP (cplx, imag_p), val);
2623 cmode = GET_MODE (cplx);
2624 imode = GET_MODE_INNER (cmode);
2625 ibitsize = GET_MODE_BITSIZE (imode);
2627 /* If the sub-object is at least word sized, then we know that subregging
2628 will work. This special case is important, since store_bit_field
2629 wants to operate on integer modes, and there's rarely an OImode to
2630 correspond to TCmode. */
2631 if (ibitsize >= BITS_PER_WORD
2632 /* For hard regs we have exact predicates. Assume we can split
2633 the original object if it spans an even number of hard regs.
2634 This special case is important for SCmode on 64-bit platforms
2635 where the natural size of floating-point regs is 32-bit. */
2636 || (GET_CODE (cplx) == REG
2637 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2638 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0)
2639 /* For MEMs we always try to make a "subreg", that is to adjust
2640 the MEM, because store_bit_field may generate overly
2641 convoluted RTL for sub-word fields. */
2644 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2645 imag_p ? GET_MODE_SIZE (imode) : 0);
2648 emit_move_insn (part, val);
2652 /* simplify_gen_subreg may fail for sub-word MEMs. */
2653 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2656 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2659 /* Extract one of the components of the complex value CPLX. Extract the
2660 real part if IMAG_P is false, and the imaginary part if it's true. */
2663 read_complex_part (rtx cplx, bool imag_p)
2665 enum machine_mode cmode, imode;
2668 if (GET_CODE (cplx) == CONCAT)
2669 return XEXP (cplx, imag_p);
2671 cmode = GET_MODE (cplx);
2672 imode = GET_MODE_INNER (cmode);
2673 ibitsize = GET_MODE_BITSIZE (imode);
2675 /* Special case reads from complex constants that got spilled to memory. */
2676 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2678 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2679 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2681 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2682 if (CONSTANT_CLASS_P (part))
2683 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2687 /* If the sub-object is at least word sized, then we know that subregging
2688 will work. This special case is important, since extract_bit_field
2689 wants to operate on integer modes, and there's rarely an OImode to
2690 correspond to TCmode. */
2691 if (ibitsize >= BITS_PER_WORD
2692 /* For hard regs we have exact predicates. Assume we can split
2693 the original object if it spans an even number of hard regs.
2694 This special case is important for SCmode on 64-bit platforms
2695 where the natural size of floating-point regs is 32-bit. */
2696 || (GET_CODE (cplx) == REG
2697 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2698 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0)
2699 /* For MEMs we always try to make a "subreg", that is to adjust
2700 the MEM, because extract_bit_field may generate overly
2701 convoluted RTL for sub-word fields. */
2704 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2705 imag_p ? GET_MODE_SIZE (imode) : 0);
2709 /* simplify_gen_subreg may fail for sub-word MEMs. */
2710 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2713 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2714 true, NULL_RTX, imode, imode);
2717 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2718 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2719 represented in NEW_MODE. If FORCE is true, this will never happen, as
2720 we'll force-create a SUBREG if needed. */
2723 emit_move_change_mode (enum machine_mode new_mode,
2724 enum machine_mode old_mode, rtx x, bool force)
2728 if (reload_in_progress && MEM_P (x))
2730 /* We can't use gen_lowpart here because it may call change_address
2731 which is not appropriate if we were called when a reload was in
2732 progress. We don't have to worry about changing the address since
2733 the size in bytes is supposed to be the same. Copy the MEM to
2734 change the mode and move any substitutions from the old MEM to
2737 ret = adjust_address_nv (x, new_mode, 0);
2738 copy_replacements (x, ret);
2742 /* Note that we do want simplify_subreg's behavior of validating
2743 that the new mode is ok for a hard register. If we were to use
2744 simplify_gen_subreg, we would create the subreg, but would
2745 probably run into the target not being able to implement it. */
2746 /* Except, of course, when FORCE is true, when this is exactly what
2747 we want. Which is needed for CCmodes on some targets. */
2749 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
2751 ret = simplify_subreg (new_mode, x, old_mode, 0);
2757 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
2758 an integer mode of the same size as MODE. Returns the instruction
2759 emitted, or NULL if such a move could not be generated. */
2762 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y)
2764 enum machine_mode imode;
2765 enum insn_code code;
2767 /* There must exist a mode of the exact size we require. */
2768 imode = int_mode_for_mode (mode);
2769 if (imode == BLKmode)
2772 /* The target must support moves in this mode. */
2773 code = mov_optab->handlers[imode].insn_code;
2774 if (code == CODE_FOR_nothing)
2777 x = emit_move_change_mode (imode, mode, x, false);
2780 y = emit_move_change_mode (imode, mode, y, false);
2783 return emit_insn (GEN_FCN (code) (x, y));
2786 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
2787 Return an equivalent MEM that does not use an auto-increment. */
2790 emit_move_resolve_push (enum machine_mode mode, rtx x)
2792 enum rtx_code code = GET_CODE (XEXP (x, 0));
2793 HOST_WIDE_INT adjust;
2796 adjust = GET_MODE_SIZE (mode);
2797 #ifdef PUSH_ROUNDING
2798 adjust = PUSH_ROUNDING (adjust);
2800 if (code == PRE_DEC || code == POST_DEC)
2803 /* Do not use anti_adjust_stack, since we don't want to update
2804 stack_pointer_delta. */
2805 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
2806 GEN_INT (adjust), stack_pointer_rtx,
2807 0, OPTAB_LIB_WIDEN);
2808 if (temp != stack_pointer_rtx)
2809 emit_move_insn (stack_pointer_rtx, temp);
2815 temp = stack_pointer_rtx;
2818 temp = plus_constant (stack_pointer_rtx, -GET_MODE_SIZE (mode));
2821 temp = plus_constant (stack_pointer_rtx, GET_MODE_SIZE (mode));
2827 return replace_equiv_address (x, temp);
2830 /* A subroutine of emit_move_complex. Generate a move from Y into X.
2831 X is known to satisfy push_operand, and MODE is known to be complex.
2832 Returns the last instruction emitted. */
2835 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
2837 enum machine_mode submode = GET_MODE_INNER (mode);
2840 #ifdef PUSH_ROUNDING
2841 unsigned int submodesize = GET_MODE_SIZE (submode);
2843 /* In case we output to the stack, but the size is smaller than the
2844 machine can push exactly, we need to use move instructions. */
2845 if (PUSH_ROUNDING (submodesize) != submodesize)
2847 x = emit_move_resolve_push (mode, x);
2848 return emit_move_insn (x, y);
2852 /* Note that the real part always precedes the imag part in memory
2853 regardless of machine's endianness. */
2854 switch (GET_CODE (XEXP (x, 0)))
2868 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
2869 read_complex_part (y, imag_first));
2870 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
2871 read_complex_part (y, !imag_first));
2874 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
2875 MODE is known to be complex. Returns the last instruction emitted. */
2878 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
2882 /* Need to take special care for pushes, to maintain proper ordering
2883 of the data, and possibly extra padding. */
2884 if (push_operand (x, mode))
2885 return emit_move_complex_push (mode, x, y);
2887 /* See if we can coerce the target into moving both values at once. */
2889 /* Move floating point as parts. */
2890 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
2891 && mov_optab->handlers[GET_MODE_INNER (mode)].insn_code != CODE_FOR_nothing)
2893 /* Not possible if the values are inherently not adjacent. */
2894 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
2896 /* Is possible if both are registers (or subregs of registers). */
2897 else if (register_operand (x, mode) && register_operand (y, mode))
2899 /* If one of the operands is a memory, and alignment constraints
2900 are friendly enough, we may be able to do combined memory operations.
2901 We do not attempt this if Y is a constant because that combination is
2902 usually better with the by-parts thing below. */
2903 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
2904 && (!STRICT_ALIGNMENT
2905 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
2914 /* For memory to memory moves, optimal behavior can be had with the
2915 existing block move logic. */
2916 if (MEM_P (x) && MEM_P (y))
2918 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
2919 BLOCK_OP_NO_LIBCALL);
2920 return get_last_insn ();
2923 ret = emit_move_via_integer (mode, x, y);
2928 /* Show the output dies here. This is necessary for SUBREGs
2929 of pseudos since we cannot track their lifetimes correctly;
2930 hard regs shouldn't appear here except as return values. */
2931 if (!reload_completed && !reload_in_progress
2932 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
2933 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
2935 write_complex_part (x, read_complex_part (y, false), false);
2936 write_complex_part (x, read_complex_part (y, true), true);
2937 return get_last_insn ();
2940 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
2941 MODE is known to be MODE_CC. Returns the last instruction emitted. */
2944 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
2948 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
2951 enum insn_code code = mov_optab->handlers[CCmode].insn_code;
2952 if (code != CODE_FOR_nothing)
2954 x = emit_move_change_mode (CCmode, mode, x, true);
2955 y = emit_move_change_mode (CCmode, mode, y, true);
2956 return emit_insn (GEN_FCN (code) (x, y));
2960 /* Otherwise, find the MODE_INT mode of the same width. */
2961 ret = emit_move_via_integer (mode, x, y);
2962 gcc_assert (ret != NULL);
2966 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
2967 MODE is any multi-word or full-word mode that lacks a move_insn
2968 pattern. Note that you will get better code if you define such
2969 patterns, even if they must turn into multiple assembler instructions. */
2972 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
2979 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
2981 /* If X is a push on the stack, do the push now and replace
2982 X with a reference to the stack pointer. */
2983 if (push_operand (x, mode))
2984 x = emit_move_resolve_push (mode, x);
2986 /* If we are in reload, see if either operand is a MEM whose address
2987 is scheduled for replacement. */
2988 if (reload_in_progress && MEM_P (x)
2989 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
2990 x = replace_equiv_address_nv (x, inner);
2991 if (reload_in_progress && MEM_P (y)
2992 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
2993 y = replace_equiv_address_nv (y, inner);
2997 need_clobber = false;
2999 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3002 rtx xpart = operand_subword (x, i, 1, mode);
3003 rtx ypart = operand_subword (y, i, 1, mode);
3005 /* If we can't get a part of Y, put Y into memory if it is a
3006 constant. Otherwise, force it into a register. If we still
3007 can't get a part of Y, abort. */
3008 if (ypart == 0 && CONSTANT_P (y))
3010 y = force_const_mem (mode, y);
3011 ypart = operand_subword (y, i, 1, mode);
3013 else if (ypart == 0)
3014 ypart = operand_subword_force (y, i, mode);
3016 gcc_assert (xpart && ypart);
3018 need_clobber |= (GET_CODE (xpart) == SUBREG);
3020 last_insn = emit_move_insn (xpart, ypart);
3026 /* Show the output dies here. This is necessary for SUBREGs
3027 of pseudos since we cannot track their lifetimes correctly;
3028 hard regs shouldn't appear here except as return values.
3029 We never want to emit such a clobber after reload. */
3031 && ! (reload_in_progress || reload_completed)
3032 && need_clobber != 0)
3033 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3040 /* Low level part of emit_move_insn.
3041 Called just like emit_move_insn, but assumes X and Y
3042 are basically valid. */
3045 emit_move_insn_1 (rtx x, rtx y)
3047 enum machine_mode mode = GET_MODE (x);
3048 enum insn_code code;
3050 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3052 code = mov_optab->handlers[mode].insn_code;
3053 if (code != CODE_FOR_nothing)
3054 return emit_insn (GEN_FCN (code) (x, y));
3056 /* Expand complex moves by moving real part and imag part. */
3057 if (COMPLEX_MODE_P (mode))
3058 return emit_move_complex (mode, x, y);
3060 if (GET_MODE_CLASS (mode) == MODE_CC)
3061 return emit_move_ccmode (mode, x, y);
3063 /* Try using a move pattern for the corresponding integer mode. This is
3064 only safe when simplify_subreg can convert MODE constants into integer
3065 constants. At present, it can only do this reliably if the value
3066 fits within a HOST_WIDE_INT. */
3067 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3069 rtx ret = emit_move_via_integer (mode, x, y);
3074 return emit_move_multi_word (mode, x, y);
3077 /* Generate code to copy Y into X.
3078 Both Y and X must have the same mode, except that
3079 Y can be a constant with VOIDmode.
3080 This mode cannot be BLKmode; use emit_block_move for that.
3082 Return the last instruction emitted. */
3085 emit_move_insn (rtx x, rtx y)
3087 enum machine_mode mode = GET_MODE (x);
3088 rtx y_cst = NULL_RTX;
3091 gcc_assert (mode != BLKmode
3092 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3097 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3098 && (last_insn = compress_float_constant (x, y)))
3103 if (!LEGITIMATE_CONSTANT_P (y))
3105 y = force_const_mem (mode, y);
3107 /* If the target's cannot_force_const_mem prevented the spill,
3108 assume that the target's move expanders will also take care
3109 of the non-legitimate constant. */
3115 /* If X or Y are memory references, verify that their addresses are valid
3118 && ((! memory_address_p (GET_MODE (x), XEXP (x, 0))
3119 && ! push_operand (x, GET_MODE (x)))
3121 && CONSTANT_ADDRESS_P (XEXP (x, 0)))))
3122 x = validize_mem (x);
3125 && (! memory_address_p (GET_MODE (y), XEXP (y, 0))
3127 && CONSTANT_ADDRESS_P (XEXP (y, 0)))))
3128 y = validize_mem (y);
3130 gcc_assert (mode != BLKmode);
3132 last_insn = emit_move_insn_1 (x, y);
3134 if (y_cst && REG_P (x)
3135 && (set = single_set (last_insn)) != NULL_RTX
3136 && SET_DEST (set) == x
3137 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3138 set_unique_reg_note (last_insn, REG_EQUAL, y_cst);
3143 /* If Y is representable exactly in a narrower mode, and the target can
3144 perform the extension directly from constant or memory, then emit the
3145 move as an extension. */
3148 compress_float_constant (rtx x, rtx y)
3150 enum machine_mode dstmode = GET_MODE (x);
3151 enum machine_mode orig_srcmode = GET_MODE (y);
3152 enum machine_mode srcmode;
3155 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3157 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3158 srcmode != orig_srcmode;
3159 srcmode = GET_MODE_WIDER_MODE (srcmode))
3162 rtx trunc_y, last_insn;
3164 /* Skip if the target can't extend this way. */
3165 ic = can_extend_p (dstmode, srcmode, 0);
3166 if (ic == CODE_FOR_nothing)
3169 /* Skip if the narrowed value isn't exact. */
3170 if (! exact_real_truncate (srcmode, &r))
3173 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3175 if (LEGITIMATE_CONSTANT_P (trunc_y))
3177 /* Skip if the target needs extra instructions to perform
3179 if (! (*insn_data[ic].operand[1].predicate) (trunc_y, srcmode))
3182 else if (float_extend_from_mem[dstmode][srcmode])
3183 trunc_y = validize_mem (force_const_mem (srcmode, trunc_y));
3187 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3188 last_insn = get_last_insn ();
3191 set_unique_reg_note (last_insn, REG_EQUAL, y);
3199 /* Pushing data onto the stack. */
3201 /* Push a block of length SIZE (perhaps variable)
3202 and return an rtx to address the beginning of the block.
3203 The value may be virtual_outgoing_args_rtx.
3205 EXTRA is the number of bytes of padding to push in addition to SIZE.
3206 BELOW nonzero means this padding comes at low addresses;
3207 otherwise, the padding comes at high addresses. */
3210 push_block (rtx size, int extra, int below)
3214 size = convert_modes (Pmode, ptr_mode, size, 1);
3215 if (CONSTANT_P (size))
3216 anti_adjust_stack (plus_constant (size, extra));
3217 else if (REG_P (size) && extra == 0)
3218 anti_adjust_stack (size);
3221 temp = copy_to_mode_reg (Pmode, size);
3223 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3224 temp, 0, OPTAB_LIB_WIDEN);
3225 anti_adjust_stack (temp);
3228 #ifndef STACK_GROWS_DOWNWARD
3234 temp = virtual_outgoing_args_rtx;
3235 if (extra != 0 && below)
3236 temp = plus_constant (temp, extra);
3240 if (GET_CODE (size) == CONST_INT)
3241 temp = plus_constant (virtual_outgoing_args_rtx,
3242 -INTVAL (size) - (below ? 0 : extra));
3243 else if (extra != 0 && !below)
3244 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3245 negate_rtx (Pmode, plus_constant (size, extra)));
3247 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3248 negate_rtx (Pmode, size));
3251 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3254 #ifdef PUSH_ROUNDING
3256 /* Emit single push insn. */
3259 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3262 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3264 enum insn_code icode;
3265 insn_operand_predicate_fn pred;
3267 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3268 /* If there is push pattern, use it. Otherwise try old way of throwing
3269 MEM representing push operation to move expander. */
3270 icode = push_optab->handlers[(int) mode].insn_code;
3271 if (icode != CODE_FOR_nothing)
3273 if (((pred = insn_data[(int) icode].operand[0].predicate)
3274 && !((*pred) (x, mode))))
3275 x = force_reg (mode, x);
3276 emit_insn (GEN_FCN (icode) (x));
3279 if (GET_MODE_SIZE (mode) == rounded_size)
3280 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3281 /* If we are to pad downward, adjust the stack pointer first and
3282 then store X into the stack location using an offset. This is
3283 because emit_move_insn does not know how to pad; it does not have
3285 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3287 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3288 HOST_WIDE_INT offset;
3290 emit_move_insn (stack_pointer_rtx,
3291 expand_binop (Pmode,
3292 #ifdef STACK_GROWS_DOWNWARD
3298 GEN_INT (rounded_size),
3299 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3301 offset = (HOST_WIDE_INT) padding_size;
3302 #ifdef STACK_GROWS_DOWNWARD
3303 if (STACK_PUSH_CODE == POST_DEC)
3304 /* We have already decremented the stack pointer, so get the
3306 offset += (HOST_WIDE_INT) rounded_size;
3308 if (STACK_PUSH_CODE == POST_INC)
3309 /* We have already incremented the stack pointer, so get the
3311 offset -= (HOST_WIDE_INT) rounded_size;
3313 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3317 #ifdef STACK_GROWS_DOWNWARD
3318 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3319 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3320 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3322 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3323 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3324 GEN_INT (rounded_size));
3326 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3329 dest = gen_rtx_MEM (mode, dest_addr);
3333 set_mem_attributes (dest, type, 1);
3335 if (flag_optimize_sibling_calls)
3336 /* Function incoming arguments may overlap with sibling call
3337 outgoing arguments and we cannot allow reordering of reads
3338 from function arguments with stores to outgoing arguments
3339 of sibling calls. */
3340 set_mem_alias_set (dest, 0);
3342 emit_move_insn (dest, x);
3346 /* Generate code to push X onto the stack, assuming it has mode MODE and
3348 MODE is redundant except when X is a CONST_INT (since they don't
3350 SIZE is an rtx for the size of data to be copied (in bytes),
3351 needed only if X is BLKmode.
3353 ALIGN (in bits) is maximum alignment we can assume.
3355 If PARTIAL and REG are both nonzero, then copy that many of the first
3356 bytes of X into registers starting with REG, and push the rest of X.
3357 The amount of space pushed is decreased by PARTIAL bytes.
3358 REG must be a hard register in this case.
3359 If REG is zero but PARTIAL is not, take any all others actions for an
3360 argument partially in registers, but do not actually load any
3363 EXTRA is the amount in bytes of extra space to leave next to this arg.
3364 This is ignored if an argument block has already been allocated.
3366 On a machine that lacks real push insns, ARGS_ADDR is the address of
3367 the bottom of the argument block for this call. We use indexing off there
3368 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3369 argument block has not been preallocated.
3371 ARGS_SO_FAR is the size of args previously pushed for this call.
3373 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3374 for arguments passed in registers. If nonzero, it will be the number
3375 of bytes required. */
3378 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3379 unsigned int align, int partial, rtx reg, int extra,
3380 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3384 enum direction stack_direction
3385 #ifdef STACK_GROWS_DOWNWARD
3391 /* Decide where to pad the argument: `downward' for below,
3392 `upward' for above, or `none' for don't pad it.
3393 Default is below for small data on big-endian machines; else above. */
3394 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3396 /* Invert direction if stack is post-decrement.
3398 if (STACK_PUSH_CODE == POST_DEC)
3399 if (where_pad != none)
3400 where_pad = (where_pad == downward ? upward : downward);
3404 if (mode == BLKmode)
3406 /* Copy a block into the stack, entirely or partially. */
3413 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3414 used = partial - offset;
3418 /* USED is now the # of bytes we need not copy to the stack
3419 because registers will take care of them. */
3422 xinner = adjust_address (xinner, BLKmode, used);
3424 /* If the partial register-part of the arg counts in its stack size,
3425 skip the part of stack space corresponding to the registers.
3426 Otherwise, start copying to the beginning of the stack space,
3427 by setting SKIP to 0. */
3428 skip = (reg_parm_stack_space == 0) ? 0 : used;
3430 #ifdef PUSH_ROUNDING
3431 /* Do it with several push insns if that doesn't take lots of insns
3432 and if there is no difficulty with push insns that skip bytes
3433 on the stack for alignment purposes. */
3436 && GET_CODE (size) == CONST_INT
3438 && MEM_ALIGN (xinner) >= align
3439 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3440 /* Here we avoid the case of a structure whose weak alignment
3441 forces many pushes of a small amount of data,
3442 and such small pushes do rounding that causes trouble. */
3443 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3444 || align >= BIGGEST_ALIGNMENT
3445 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3446 == (align / BITS_PER_UNIT)))
3447 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3449 /* Push padding now if padding above and stack grows down,
3450 or if padding below and stack grows up.
3451 But if space already allocated, this has already been done. */
3452 if (extra && args_addr == 0
3453 && where_pad != none && where_pad != stack_direction)
3454 anti_adjust_stack (GEN_INT (extra));
3456 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3459 #endif /* PUSH_ROUNDING */
3463 /* Otherwise make space on the stack and copy the data
3464 to the address of that space. */
3466 /* Deduct words put into registers from the size we must copy. */
3469 if (GET_CODE (size) == CONST_INT)
3470 size = GEN_INT (INTVAL (size) - used);
3472 size = expand_binop (GET_MODE (size), sub_optab, size,
3473 GEN_INT (used), NULL_RTX, 0,
3477 /* Get the address of the stack space.
3478 In this case, we do not deal with EXTRA separately.
3479 A single stack adjust will do. */
3482 temp = push_block (size, extra, where_pad == downward);
3485 else if (GET_CODE (args_so_far) == CONST_INT)
3486 temp = memory_address (BLKmode,
3487 plus_constant (args_addr,
3488 skip + INTVAL (args_so_far)));
3490 temp = memory_address (BLKmode,
3491 plus_constant (gen_rtx_PLUS (Pmode,
3496 if (!ACCUMULATE_OUTGOING_ARGS)
3498 /* If the source is referenced relative to the stack pointer,
3499 copy it to another register to stabilize it. We do not need
3500 to do this if we know that we won't be changing sp. */
3502 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3503 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3504 temp = copy_to_reg (temp);
3507 target = gen_rtx_MEM (BLKmode, temp);
3509 /* We do *not* set_mem_attributes here, because incoming arguments
3510 may overlap with sibling call outgoing arguments and we cannot
3511 allow reordering of reads from function arguments with stores
3512 to outgoing arguments of sibling calls. We do, however, want
3513 to record the alignment of the stack slot. */
3514 /* ALIGN may well be better aligned than TYPE, e.g. due to
3515 PARM_BOUNDARY. Assume the caller isn't lying. */
3516 set_mem_align (target, align);
3518 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3521 else if (partial > 0)
3523 /* Scalar partly in registers. */
3525 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3528 /* # bytes of start of argument
3529 that we must make space for but need not store. */
3530 int offset = partial % (PARM_BOUNDARY / BITS_PER_WORD);
3531 int args_offset = INTVAL (args_so_far);
3534 /* Push padding now if padding above and stack grows down,
3535 or if padding below and stack grows up.
3536 But if space already allocated, this has already been done. */
3537 if (extra && args_addr == 0
3538 && where_pad != none && where_pad != stack_direction)
3539 anti_adjust_stack (GEN_INT (extra));
3541 /* If we make space by pushing it, we might as well push
3542 the real data. Otherwise, we can leave OFFSET nonzero
3543 and leave the space uninitialized. */
3547 /* Now NOT_STACK gets the number of words that we don't need to
3548 allocate on the stack. */
3549 not_stack = (partial - offset) / UNITS_PER_WORD;
3551 /* If the partial register-part of the arg counts in its stack size,
3552 skip the part of stack space corresponding to the registers.
3553 Otherwise, start copying to the beginning of the stack space,
3554 by setting SKIP to 0. */
3555 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3557 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3558 x = validize_mem (force_const_mem (mode, x));
3560 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3561 SUBREGs of such registers are not allowed. */
3562 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3563 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3564 x = copy_to_reg (x);
3566 /* Loop over all the words allocated on the stack for this arg. */
3567 /* We can do it by words, because any scalar bigger than a word
3568 has a size a multiple of a word. */
3569 #ifndef PUSH_ARGS_REVERSED
3570 for (i = not_stack; i < size; i++)
3572 for (i = size - 1; i >= not_stack; i--)
3574 if (i >= not_stack + offset)
3575 emit_push_insn (operand_subword_force (x, i, mode),
3576 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3578 GEN_INT (args_offset + ((i - not_stack + skip)
3580 reg_parm_stack_space, alignment_pad);
3587 /* Push padding now if padding above and stack grows down,
3588 or if padding below and stack grows up.
3589 But if space already allocated, this has already been done. */
3590 if (extra && args_addr == 0
3591 && where_pad != none && where_pad != stack_direction)
3592 anti_adjust_stack (GEN_INT (extra));
3594 #ifdef PUSH_ROUNDING
3595 if (args_addr == 0 && PUSH_ARGS)
3596 emit_single_push_insn (mode, x, type);
3600 if (GET_CODE (args_so_far) == CONST_INT)
3602 = memory_address (mode,
3603 plus_constant (args_addr,
3604 INTVAL (args_so_far)));
3606 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3608 dest = gen_rtx_MEM (mode, addr);
3610 /* We do *not* set_mem_attributes here, because incoming arguments
3611 may overlap with sibling call outgoing arguments and we cannot
3612 allow reordering of reads from function arguments with stores
3613 to outgoing arguments of sibling calls. We do, however, want
3614 to record the alignment of the stack slot. */
3615 /* ALIGN may well be better aligned than TYPE, e.g. due to
3616 PARM_BOUNDARY. Assume the caller isn't lying. */
3617 set_mem_align (dest, align);
3619 emit_move_insn (dest, x);
3623 /* If part should go in registers, copy that part
3624 into the appropriate registers. Do this now, at the end,
3625 since mem-to-mem copies above may do function calls. */
3626 if (partial > 0 && reg != 0)
3628 /* Handle calls that pass values in multiple non-contiguous locations.
3629 The Irix 6 ABI has examples of this. */
3630 if (GET_CODE (reg) == PARALLEL)
3631 emit_group_load (reg, x, type, -1);
3634 gcc_assert (partial % UNITS_PER_WORD == 0);
3635 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
3639 if (extra && args_addr == 0 && where_pad == stack_direction)
3640 anti_adjust_stack (GEN_INT (extra));
3642 if (alignment_pad && args_addr == 0)
3643 anti_adjust_stack (alignment_pad);
3646 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3650 get_subtarget (rtx x)
3654 /* Only registers can be subtargets. */
3656 /* Don't use hard regs to avoid extending their life. */
3657 || REGNO (x) < FIRST_PSEUDO_REGISTER
3661 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
3662 FIELD is a bitfield. Returns true if the optimization was successful,
3663 and there's nothing else to do. */
3666 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
3667 unsigned HOST_WIDE_INT bitpos,
3668 enum machine_mode mode1, rtx str_rtx,
3671 enum machine_mode str_mode = GET_MODE (str_rtx);
3672 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
3677 if (mode1 != VOIDmode
3678 || bitsize >= BITS_PER_WORD
3679 || str_bitsize > BITS_PER_WORD
3680 || TREE_SIDE_EFFECTS (to)
3681 || TREE_THIS_VOLATILE (to))
3685 if (!BINARY_CLASS_P (src)
3686 || TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
3689 op0 = TREE_OPERAND (src, 0);
3690 op1 = TREE_OPERAND (src, 1);
3693 if (!operand_equal_p (to, op0, 0))
3696 if (MEM_P (str_rtx))
3698 unsigned HOST_WIDE_INT offset1;
3700 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
3701 str_mode = word_mode;
3702 str_mode = get_best_mode (bitsize, bitpos,
3703 MEM_ALIGN (str_rtx), str_mode, 0);
3704 if (str_mode == VOIDmode)
3706 str_bitsize = GET_MODE_BITSIZE (str_mode);
3709 bitpos %= str_bitsize;
3710 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
3711 str_rtx = adjust_address (str_rtx, str_mode, offset1);
3713 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
3716 /* If the bit field covers the whole REG/MEM, store_field
3717 will likely generate better code. */
3718 if (bitsize >= str_bitsize)
3721 /* We can't handle fields split across multiple entities. */
3722 if (bitpos + bitsize > str_bitsize)
3725 if (BYTES_BIG_ENDIAN)
3726 bitpos = str_bitsize - bitpos - bitsize;
3728 switch (TREE_CODE (src))
3732 /* For now, just optimize the case of the topmost bitfield
3733 where we don't need to do any masking and also
3734 1 bit bitfields where xor can be used.
3735 We might win by one instruction for the other bitfields
3736 too if insv/extv instructions aren't used, so that
3737 can be added later. */
3738 if (bitpos + bitsize != str_bitsize
3739 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
3742 value = expand_expr (op1, NULL_RTX, str_mode, 0);
3743 value = convert_modes (str_mode,
3744 TYPE_MODE (TREE_TYPE (op1)), value,
3745 TYPE_UNSIGNED (TREE_TYPE (op1)));
3747 /* We may be accessing data outside the field, which means
3748 we can alias adjacent data. */
3749 if (MEM_P (str_rtx))
3751 str_rtx = shallow_copy_rtx (str_rtx);
3752 set_mem_alias_set (str_rtx, 0);
3753 set_mem_expr (str_rtx, 0);
3756 binop = TREE_CODE (src) == PLUS_EXPR ? add_optab : sub_optab;
3757 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
3759 value = expand_and (str_mode, value, const1_rtx, NULL);
3762 value = expand_shift (LSHIFT_EXPR, str_mode, value,
3763 build_int_cst (NULL_TREE, bitpos),
3765 result = expand_binop (str_mode, binop, str_rtx,
3766 value, str_rtx, 1, OPTAB_WIDEN);
3767 if (result != str_rtx)
3768 emit_move_insn (str_rtx, result);
3779 /* Expand an assignment that stores the value of FROM into TO. */
3782 expand_assignment (tree to, tree from)
3787 /* Don't crash if the lhs of the assignment was erroneous. */
3789 if (TREE_CODE (to) == ERROR_MARK)
3791 result = expand_expr (from, NULL_RTX, VOIDmode, 0);
3795 /* Assignment of a structure component needs special treatment
3796 if the structure component's rtx is not simply a MEM.
3797 Assignment of an array element at a constant index, and assignment of
3798 an array element in an unaligned packed structure field, has the same
3800 if (handled_component_p (to)
3801 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
3803 enum machine_mode mode1;
3804 HOST_WIDE_INT bitsize, bitpos;
3812 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
3813 &unsignedp, &volatilep, true);
3815 /* If we are going to use store_bit_field and extract_bit_field,
3816 make sure to_rtx will be safe for multiple use. */
3818 orig_to_rtx = to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, 0);
3822 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
3824 gcc_assert (MEM_P (to_rtx));
3826 #ifdef POINTERS_EXTEND_UNSIGNED
3827 if (GET_MODE (offset_rtx) != Pmode)
3828 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
3830 if (GET_MODE (offset_rtx) != ptr_mode)
3831 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
3834 /* A constant address in TO_RTX can have VOIDmode, we must not try
3835 to call force_reg for that case. Avoid that case. */
3837 && GET_MODE (to_rtx) == BLKmode
3838 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
3840 && (bitpos % bitsize) == 0
3841 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
3842 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
3844 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
3848 to_rtx = offset_address (to_rtx, offset_rtx,
3849 highest_pow2_factor_for_target (to,
3853 /* Handle expand_expr of a complex value returning a CONCAT. */
3854 if (GET_CODE (to_rtx) == CONCAT)
3856 if (TREE_CODE (TREE_TYPE (from)) == COMPLEX_TYPE)
3858 gcc_assert (bitpos == 0);
3859 result = store_expr (from, to_rtx, false);
3863 gcc_assert (bitpos == 0 || bitpos == GET_MODE_BITSIZE (mode1));
3864 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false);
3871 /* If the field is at offset zero, we could have been given the
3872 DECL_RTX of the parent struct. Don't munge it. */
3873 to_rtx = shallow_copy_rtx (to_rtx);
3875 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
3877 /* Deal with volatile and readonly fields. The former is only
3878 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
3880 MEM_VOLATILE_P (to_rtx) = 1;
3881 if (component_uses_parent_alias_set (to))
3882 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
3885 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
3889 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
3890 TREE_TYPE (tem), get_alias_set (to));
3894 preserve_temp_slots (result);
3900 /* If the rhs is a function call and its value is not an aggregate,
3901 call the function before we start to compute the lhs.
3902 This is needed for correct code for cases such as
3903 val = setjmp (buf) on machines where reference to val
3904 requires loading up part of an address in a separate insn.
3906 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
3907 since it might be a promoted variable where the zero- or sign- extension
3908 needs to be done. Handling this in the normal way is safe because no
3909 computation is done before the call. */
3910 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
3911 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
3912 && ! ((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
3913 && REG_P (DECL_RTL (to))))
3918 value = expand_expr (from, NULL_RTX, VOIDmode, 0);
3920 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
3922 /* Handle calls that return values in multiple non-contiguous locations.
3923 The Irix 6 ABI has examples of this. */
3924 if (GET_CODE (to_rtx) == PARALLEL)
3925 emit_group_load (to_rtx, value, TREE_TYPE (from),
3926 int_size_in_bytes (TREE_TYPE (from)));
3927 else if (GET_MODE (to_rtx) == BLKmode)
3928 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
3931 if (POINTER_TYPE_P (TREE_TYPE (to)))
3932 value = convert_memory_address (GET_MODE (to_rtx), value);
3933 emit_move_insn (to_rtx, value);
3935 preserve_temp_slots (to_rtx);
3941 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
3942 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
3945 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
3947 /* Don't move directly into a return register. */
3948 if (TREE_CODE (to) == RESULT_DECL
3949 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
3954 temp = expand_expr (from, 0, GET_MODE (to_rtx), 0);
3956 if (GET_CODE (to_rtx) == PARALLEL)
3957 emit_group_load (to_rtx, temp, TREE_TYPE (from),
3958 int_size_in_bytes (TREE_TYPE (from)));
3960 emit_move_insn (to_rtx, temp);
3962 preserve_temp_slots (to_rtx);
3968 /* In case we are returning the contents of an object which overlaps
3969 the place the value is being stored, use a safe function when copying
3970 a value through a pointer into a structure value return block. */
3971 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
3972 && current_function_returns_struct
3973 && !current_function_returns_pcc_struct)
3978 size = expr_size (from);
3979 from_rtx = expand_expr (from, NULL_RTX, VOIDmode, 0);
3981 emit_library_call (memmove_libfunc, LCT_NORMAL,
3982 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
3983 XEXP (from_rtx, 0), Pmode,
3984 convert_to_mode (TYPE_MODE (sizetype),
3985 size, TYPE_UNSIGNED (sizetype)),
3986 TYPE_MODE (sizetype));
3988 preserve_temp_slots (to_rtx);
3994 /* Compute FROM and store the value in the rtx we got. */
3997 result = store_expr (from, to_rtx, 0);
3998 preserve_temp_slots (result);
4004 /* Generate code for computing expression EXP,
4005 and storing the value into TARGET.
4007 If the mode is BLKmode then we may return TARGET itself.
4008 It turns out that in BLKmode it doesn't cause a problem.
4009 because C has no operators that could combine two different
4010 assignments into the same BLKmode object with different values
4011 with no sequence point. Will other languages need this to
4014 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4015 stack, and block moves may need to be treated specially. */
4018 store_expr (tree exp, rtx target, int call_param_p)
4021 rtx alt_rtl = NULL_RTX;
4022 int dont_return_target = 0;
4024 if (VOID_TYPE_P (TREE_TYPE (exp)))
4026 /* C++ can generate ?: expressions with a throw expression in one
4027 branch and an rvalue in the other. Here, we resolve attempts to
4028 store the throw expression's nonexistent result. */
4029 gcc_assert (!call_param_p);
4030 expand_expr (exp, const0_rtx, VOIDmode, 0);
4033 if (TREE_CODE (exp) == COMPOUND_EXPR)
4035 /* Perform first part of compound expression, then assign from second
4037 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4038 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4039 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p);
4041 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4043 /* For conditional expression, get safe form of the target. Then
4044 test the condition, doing the appropriate assignment on either
4045 side. This avoids the creation of unnecessary temporaries.
4046 For non-BLKmode, it is more efficient not to do this. */
4048 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4050 do_pending_stack_adjust ();
4052 jumpifnot (TREE_OPERAND (exp, 0), lab1);
4053 store_expr (TREE_OPERAND (exp, 1), target, call_param_p);
4054 emit_jump_insn (gen_jump (lab2));
4057 store_expr (TREE_OPERAND (exp, 2), target, call_param_p);
4063 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4064 /* If this is a scalar in a register that is stored in a wider mode
4065 than the declared mode, compute the result into its declared mode
4066 and then convert to the wider mode. Our value is the computed
4069 rtx inner_target = 0;
4071 /* We can do the conversion inside EXP, which will often result
4072 in some optimizations. Do the conversion in two steps: first
4073 change the signedness, if needed, then the extend. But don't
4074 do this if the type of EXP is a subtype of something else
4075 since then the conversion might involve more than just
4076 converting modes. */
4077 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4078 && TREE_TYPE (TREE_TYPE (exp)) == 0
4079 && (!lang_hooks.reduce_bit_field_operations
4080 || (GET_MODE_PRECISION (GET_MODE (target))
4081 == TYPE_PRECISION (TREE_TYPE (exp)))))
4083 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4084 != SUBREG_PROMOTED_UNSIGNED_P (target))
4086 (lang_hooks.types.signed_or_unsigned_type
4087 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)), exp);
4089 exp = convert (lang_hooks.types.type_for_mode
4090 (GET_MODE (SUBREG_REG (target)),
4091 SUBREG_PROMOTED_UNSIGNED_P (target)),
4094 inner_target = SUBREG_REG (target);
4097 temp = expand_expr (exp, inner_target, VOIDmode,
4098 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4100 /* If TEMP is a VOIDmode constant, use convert_modes to make
4101 sure that we properly convert it. */
4102 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4104 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4105 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4106 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4107 GET_MODE (target), temp,
4108 SUBREG_PROMOTED_UNSIGNED_P (target));
4111 convert_move (SUBREG_REG (target), temp,
4112 SUBREG_PROMOTED_UNSIGNED_P (target));
4118 temp = expand_expr_real (exp, target, GET_MODE (target),
4120 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4122 /* Return TARGET if it's a specified hardware register.
4123 If TARGET is a volatile mem ref, either return TARGET
4124 or return a reg copied *from* TARGET; ANSI requires this.
4126 Otherwise, if TEMP is not TARGET, return TEMP
4127 if it is constant (for efficiency),
4128 or if we really want the correct value. */
4129 if (!(target && REG_P (target)
4130 && REGNO (target) < FIRST_PSEUDO_REGISTER)
4131 && !(MEM_P (target) && MEM_VOLATILE_P (target))
4132 && ! rtx_equal_p (temp, target)
4133 && CONSTANT_P (temp))
4134 dont_return_target = 1;
4137 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4138 the same as that of TARGET, adjust the constant. This is needed, for
4139 example, in case it is a CONST_DOUBLE and we want only a word-sized
4141 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4142 && TREE_CODE (exp) != ERROR_MARK
4143 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4144 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4145 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4147 /* If value was not generated in the target, store it there.
4148 Convert the value to TARGET's type first if necessary and emit the
4149 pending incrementations that have been queued when expanding EXP.
4150 Note that we cannot emit the whole queue blindly because this will
4151 effectively disable the POST_INC optimization later.
4153 If TEMP and TARGET compare equal according to rtx_equal_p, but
4154 one or both of them are volatile memory refs, we have to distinguish
4156 - expand_expr has used TARGET. In this case, we must not generate
4157 another copy. This can be detected by TARGET being equal according
4159 - expand_expr has not used TARGET - that means that the source just
4160 happens to have the same RTX form. Since temp will have been created
4161 by expand_expr, it will compare unequal according to == .
4162 We must generate a copy in this case, to reach the correct number
4163 of volatile memory references. */
4165 if ((! rtx_equal_p (temp, target)
4166 || (temp != target && (side_effects_p (temp)
4167 || side_effects_p (target))))
4168 && TREE_CODE (exp) != ERROR_MARK
4169 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4170 but TARGET is not valid memory reference, TEMP will differ
4171 from TARGET although it is really the same location. */
4172 && !(alt_rtl && rtx_equal_p (alt_rtl, target))
4173 /* If there's nothing to copy, don't bother. Don't call expr_size
4174 unless necessary, because some front-ends (C++) expr_size-hook
4175 aborts on objects that are not supposed to be bit-copied or
4177 && expr_size (exp) != const0_rtx)
4179 if (GET_MODE (temp) != GET_MODE (target)
4180 && GET_MODE (temp) != VOIDmode)
4182 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4183 if (dont_return_target)
4185 /* In this case, we will return TEMP,
4186 so make sure it has the proper mode.
4187 But don't forget to store the value into TARGET. */
4188 temp = convert_to_mode (GET_MODE (target), temp, unsignedp);
4189 emit_move_insn (target, temp);
4192 convert_move (target, temp, unsignedp);
4195 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4197 /* Handle copying a string constant into an array. The string
4198 constant may be shorter than the array. So copy just the string's
4199 actual length, and clear the rest. First get the size of the data
4200 type of the string, which is actually the size of the target. */
4201 rtx size = expr_size (exp);
4203 if (GET_CODE (size) == CONST_INT
4204 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4205 emit_block_move (target, temp, size,
4207 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4210 /* Compute the size of the data to copy from the string. */
4212 = size_binop (MIN_EXPR,
4213 make_tree (sizetype, size),
4214 size_int (TREE_STRING_LENGTH (exp)));
4216 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4218 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4221 /* Copy that much. */
4222 copy_size_rtx = convert_to_mode (ptr_mode, copy_size_rtx,
4223 TYPE_UNSIGNED (sizetype));
4224 emit_block_move (target, temp, copy_size_rtx,
4226 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4228 /* Figure out how much is left in TARGET that we have to clear.
4229 Do all calculations in ptr_mode. */
4230 if (GET_CODE (copy_size_rtx) == CONST_INT)
4232 size = plus_constant (size, -INTVAL (copy_size_rtx));
4233 target = adjust_address (target, BLKmode,
4234 INTVAL (copy_size_rtx));
4238 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4239 copy_size_rtx, NULL_RTX, 0,
4242 #ifdef POINTERS_EXTEND_UNSIGNED
4243 if (GET_MODE (copy_size_rtx) != Pmode)
4244 copy_size_rtx = convert_to_mode (Pmode, copy_size_rtx,
4245 TYPE_UNSIGNED (sizetype));
4248 target = offset_address (target, copy_size_rtx,
4249 highest_pow2_factor (copy_size));
4250 label = gen_label_rtx ();
4251 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4252 GET_MODE (size), 0, label);
4255 if (size != const0_rtx)
4256 clear_storage (target, size, BLOCK_OP_NORMAL);
4262 /* Handle calls that return values in multiple non-contiguous locations.
4263 The Irix 6 ABI has examples of this. */
4264 else if (GET_CODE (target) == PARALLEL)
4265 emit_group_load (target, temp, TREE_TYPE (exp),
4266 int_size_in_bytes (TREE_TYPE (exp)));
4267 else if (GET_MODE (temp) == BLKmode)
4268 emit_block_move (target, temp, expr_size (exp),
4270 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4273 temp = force_operand (temp, target);
4275 emit_move_insn (target, temp);
4282 /* Examine CTOR to discover:
4283 * how many scalar fields are set to nonzero values,
4284 and place it in *P_NZ_ELTS;
4285 * how many scalar fields are set to non-constant values,
4286 and place it in *P_NC_ELTS; and
4287 * how many scalar fields in total are in CTOR,
4288 and place it in *P_ELT_COUNT.
4289 * if a type is a union, and the initializer from the constructor
4290 is not the largest element in the union, then set *p_must_clear. */
4293 categorize_ctor_elements_1 (tree ctor, HOST_WIDE_INT *p_nz_elts,
4294 HOST_WIDE_INT *p_nc_elts,
4295 HOST_WIDE_INT *p_elt_count,
4298 HOST_WIDE_INT nz_elts, nc_elts, elt_count;
4305 for (list = CONSTRUCTOR_ELTS (ctor); list; list = TREE_CHAIN (list))
4307 tree value = TREE_VALUE (list);
4308 tree purpose = TREE_PURPOSE (list);
4312 if (TREE_CODE (purpose) == RANGE_EXPR)
4314 tree lo_index = TREE_OPERAND (purpose, 0);
4315 tree hi_index = TREE_OPERAND (purpose, 1);
4317 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
4318 mult = (tree_low_cst (hi_index, 1)
4319 - tree_low_cst (lo_index, 1) + 1);
4322 switch (TREE_CODE (value))
4326 HOST_WIDE_INT nz = 0, nc = 0, ic = 0;
4327 categorize_ctor_elements_1 (value, &nz, &nc, &ic, p_must_clear);
4328 nz_elts += mult * nz;
4329 nc_elts += mult * nc;
4330 elt_count += mult * ic;
4336 if (!initializer_zerop (value))
4342 nz_elts += mult * TREE_STRING_LENGTH (value);
4343 elt_count += mult * TREE_STRING_LENGTH (value);
4347 if (!initializer_zerop (TREE_REALPART (value)))
4349 if (!initializer_zerop (TREE_IMAGPART (value)))
4357 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
4359 if (!initializer_zerop (TREE_VALUE (v)))
4369 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
4376 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4377 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
4380 bool clear_this = true;
4382 list = CONSTRUCTOR_ELTS (ctor);
4385 /* We don't expect more than one element of the union to be
4386 initialized. Not sure what we should do otherwise... */
4387 gcc_assert (TREE_CHAIN (list) == NULL);
4389 init_sub_type = TREE_TYPE (TREE_VALUE (list));
4391 /* ??? We could look at each element of the union, and find the
4392 largest element. Which would avoid comparing the size of the
4393 initialized element against any tail padding in the union.
4394 Doesn't seem worth the effort... */
4395 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
4396 TYPE_SIZE (init_sub_type)) == 1)
4398 /* And now we have to find out if the element itself is fully
4399 constructed. E.g. for union { struct { int a, b; } s; } u
4400 = { .s = { .a = 1 } }. */
4401 if (elt_count == count_type_elements (init_sub_type))
4406 *p_must_clear = clear_this;
4409 *p_nz_elts += nz_elts;
4410 *p_nc_elts += nc_elts;
4411 *p_elt_count += elt_count;
4415 categorize_ctor_elements (tree ctor, HOST_WIDE_INT *p_nz_elts,
4416 HOST_WIDE_INT *p_nc_elts,
4417 HOST_WIDE_INT *p_elt_count,
4423 *p_must_clear = false;
4424 categorize_ctor_elements_1 (ctor, p_nz_elts, p_nc_elts, p_elt_count,
4428 /* Count the number of scalars in TYPE. Return -1 on overflow or
4432 count_type_elements (tree type)
4434 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
4435 switch (TREE_CODE (type))
4439 tree telts = array_type_nelts (type);
4440 if (telts && host_integerp (telts, 1))
4442 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
4443 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type));
4446 else if (max / n > m)
4454 HOST_WIDE_INT n = 0, t;
4457 for (f = TYPE_FIELDS (type); f ; f = TREE_CHAIN (f))
4458 if (TREE_CODE (f) == FIELD_DECL)
4460 t = count_type_elements (TREE_TYPE (f));
4470 case QUAL_UNION_TYPE:
4472 /* Ho hum. How in the world do we guess here? Clearly it isn't
4473 right to count the fields. Guess based on the number of words. */
4474 HOST_WIDE_INT n = int_size_in_bytes (type);
4477 return n / UNITS_PER_WORD;
4484 return TYPE_VECTOR_SUBPARTS (type);
4493 case REFERENCE_TYPE:
4506 /* Return 1 if EXP contains mostly (3/4) zeros. */
4509 mostly_zeros_p (tree exp)
4511 if (TREE_CODE (exp) == CONSTRUCTOR)
4514 HOST_WIDE_INT nz_elts, nc_elts, count, elts;
4517 categorize_ctor_elements (exp, &nz_elts, &nc_elts, &count, &must_clear);
4521 elts = count_type_elements (TREE_TYPE (exp));
4523 return nz_elts < elts / 4;
4526 return initializer_zerop (exp);
4529 /* Helper function for store_constructor.
4530 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4531 TYPE is the type of the CONSTRUCTOR, not the element type.
4532 CLEARED is as for store_constructor.
4533 ALIAS_SET is the alias set to use for any stores.
4535 This provides a recursive shortcut back to store_constructor when it isn't
4536 necessary to go through store_field. This is so that we can pass through
4537 the cleared field to let store_constructor know that we may not have to
4538 clear a substructure if the outer structure has already been cleared. */
4541 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
4542 HOST_WIDE_INT bitpos, enum machine_mode mode,
4543 tree exp, tree type, int cleared, int alias_set)
4545 if (TREE_CODE (exp) == CONSTRUCTOR
4546 /* We can only call store_constructor recursively if the size and
4547 bit position are on a byte boundary. */
4548 && bitpos % BITS_PER_UNIT == 0
4549 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
4550 /* If we have a nonzero bitpos for a register target, then we just
4551 let store_field do the bitfield handling. This is unlikely to
4552 generate unnecessary clear instructions anyways. */
4553 && (bitpos == 0 || MEM_P (target)))
4557 = adjust_address (target,
4558 GET_MODE (target) == BLKmode
4560 % GET_MODE_ALIGNMENT (GET_MODE (target)))
4561 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
4564 /* Update the alias set, if required. */
4565 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
4566 && MEM_ALIAS_SET (target) != 0)
4568 target = copy_rtx (target);
4569 set_mem_alias_set (target, alias_set);
4572 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
4575 store_field (target, bitsize, bitpos, mode, exp, type, alias_set);
4578 /* Store the value of constructor EXP into the rtx TARGET.
4579 TARGET is either a REG or a MEM; we know it cannot conflict, since
4580 safe_from_p has been called.
4581 CLEARED is true if TARGET is known to have been zero'd.
4582 SIZE is the number of bytes of TARGET we are allowed to modify: this
4583 may not be the same as the size of EXP if we are assigning to a field
4584 which has been packed to exclude padding bits. */
4587 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
4589 tree type = TREE_TYPE (exp);
4590 #ifdef WORD_REGISTER_OPERATIONS
4591 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
4594 switch (TREE_CODE (type))
4598 case QUAL_UNION_TYPE:
4602 /* If size is zero or the target is already cleared, do nothing. */
4603 if (size == 0 || cleared)
4605 /* We either clear the aggregate or indicate the value is dead. */
4606 else if ((TREE_CODE (type) == UNION_TYPE
4607 || TREE_CODE (type) == QUAL_UNION_TYPE)
4608 && ! CONSTRUCTOR_ELTS (exp))
4609 /* If the constructor is empty, clear the union. */
4611 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
4615 /* If we are building a static constructor into a register,
4616 set the initial value as zero so we can fold the value into
4617 a constant. But if more than one register is involved,
4618 this probably loses. */
4619 else if (REG_P (target) && TREE_STATIC (exp)
4620 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
4622 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4626 /* If the constructor has fewer fields than the structure or
4627 if we are initializing the structure to mostly zeros, clear
4628 the whole structure first. Don't do this if TARGET is a
4629 register whose mode size isn't equal to SIZE since
4630 clear_storage can't handle this case. */
4632 && ((list_length (CONSTRUCTOR_ELTS (exp))
4633 != fields_length (type))
4634 || mostly_zeros_p (exp))
4636 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
4639 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
4644 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4646 /* Store each element of the constructor into the
4647 corresponding field of TARGET. */
4649 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4651 tree field = TREE_PURPOSE (elt);
4652 tree value = TREE_VALUE (elt);
4653 enum machine_mode mode;
4654 HOST_WIDE_INT bitsize;
4655 HOST_WIDE_INT bitpos = 0;
4657 rtx to_rtx = target;
4659 /* Just ignore missing fields. We cleared the whole
4660 structure, above, if any fields are missing. */
4664 if (cleared && initializer_zerop (value))
4667 if (host_integerp (DECL_SIZE (field), 1))
4668 bitsize = tree_low_cst (DECL_SIZE (field), 1);
4672 mode = DECL_MODE (field);
4673 if (DECL_BIT_FIELD (field))
4676 offset = DECL_FIELD_OFFSET (field);
4677 if (host_integerp (offset, 0)
4678 && host_integerp (bit_position (field), 0))
4680 bitpos = int_bit_position (field);
4684 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
4691 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
4692 make_tree (TREE_TYPE (exp),
4695 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
4696 gcc_assert (MEM_P (to_rtx));
4698 #ifdef POINTERS_EXTEND_UNSIGNED
4699 if (GET_MODE (offset_rtx) != Pmode)
4700 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
4702 if (GET_MODE (offset_rtx) != ptr_mode)
4703 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
4706 to_rtx = offset_address (to_rtx, offset_rtx,
4707 highest_pow2_factor (offset));
4710 #ifdef WORD_REGISTER_OPERATIONS
4711 /* If this initializes a field that is smaller than a
4712 word, at the start of a word, try to widen it to a full
4713 word. This special case allows us to output C++ member
4714 function initializations in a form that the optimizers
4717 && bitsize < BITS_PER_WORD
4718 && bitpos % BITS_PER_WORD == 0
4719 && GET_MODE_CLASS (mode) == MODE_INT
4720 && TREE_CODE (value) == INTEGER_CST
4722 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
4724 tree type = TREE_TYPE (value);
4726 if (TYPE_PRECISION (type) < BITS_PER_WORD)
4728 type = lang_hooks.types.type_for_size
4729 (BITS_PER_WORD, TYPE_UNSIGNED (type));
4730 value = convert (type, value);
4733 if (BYTES_BIG_ENDIAN)
4735 = fold (build2 (LSHIFT_EXPR, type, value,
4736 build_int_cst (NULL_TREE,
4737 BITS_PER_WORD - bitsize)));
4738 bitsize = BITS_PER_WORD;
4743 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
4744 && DECL_NONADDRESSABLE_P (field))
4746 to_rtx = copy_rtx (to_rtx);
4747 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4750 store_constructor_field (to_rtx, bitsize, bitpos, mode,
4751 value, type, cleared,
4752 get_alias_set (TREE_TYPE (field)));
4762 tree elttype = TREE_TYPE (type);
4764 HOST_WIDE_INT minelt = 0;
4765 HOST_WIDE_INT maxelt = 0;
4767 domain = TYPE_DOMAIN (type);
4768 const_bounds_p = (TYPE_MIN_VALUE (domain)
4769 && TYPE_MAX_VALUE (domain)
4770 && host_integerp (TYPE_MIN_VALUE (domain), 0)
4771 && host_integerp (TYPE_MAX_VALUE (domain), 0));
4773 /* If we have constant bounds for the range of the type, get them. */
4776 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
4777 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
4780 /* If the constructor has fewer elements than the array, clear
4781 the whole array first. Similarly if this is static
4782 constructor of a non-BLKmode object. */
4785 else if (REG_P (target) && TREE_STATIC (exp))
4789 HOST_WIDE_INT count = 0, zero_count = 0;
4790 need_to_clear = ! const_bounds_p;
4792 /* This loop is a more accurate version of the loop in
4793 mostly_zeros_p (it handles RANGE_EXPR in an index). It
4794 is also needed to check for missing elements. */
4795 for (elt = CONSTRUCTOR_ELTS (exp);
4796 elt != NULL_TREE && ! need_to_clear;
4797 elt = TREE_CHAIN (elt))
4799 tree index = TREE_PURPOSE (elt);
4800 HOST_WIDE_INT this_node_count;
4802 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4804 tree lo_index = TREE_OPERAND (index, 0);
4805 tree hi_index = TREE_OPERAND (index, 1);
4807 if (! host_integerp (lo_index, 1)
4808 || ! host_integerp (hi_index, 1))
4814 this_node_count = (tree_low_cst (hi_index, 1)
4815 - tree_low_cst (lo_index, 1) + 1);
4818 this_node_count = 1;
4820 count += this_node_count;
4821 if (mostly_zeros_p (TREE_VALUE (elt)))
4822 zero_count += this_node_count;
4825 /* Clear the entire array first if there are any missing
4826 elements, or if the incidence of zero elements is >=
4829 && (count < maxelt - minelt + 1
4830 || 4 * zero_count >= 3 * count))
4834 if (need_to_clear && size > 0)
4837 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4839 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
4843 if (!cleared && REG_P (target))
4844 /* Inform later passes that the old value is dead. */
4845 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4847 /* Store each element of the constructor into the
4848 corresponding element of TARGET, determined by counting the
4850 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
4852 elt = TREE_CHAIN (elt), i++)
4854 enum machine_mode mode;
4855 HOST_WIDE_INT bitsize;
4856 HOST_WIDE_INT bitpos;
4858 tree value = TREE_VALUE (elt);
4859 tree index = TREE_PURPOSE (elt);
4860 rtx xtarget = target;
4862 if (cleared && initializer_zerop (value))
4865 unsignedp = TYPE_UNSIGNED (elttype);
4866 mode = TYPE_MODE (elttype);
4867 if (mode == BLKmode)
4868 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
4869 ? tree_low_cst (TYPE_SIZE (elttype), 1)
4872 bitsize = GET_MODE_BITSIZE (mode);
4874 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4876 tree lo_index = TREE_OPERAND (index, 0);
4877 tree hi_index = TREE_OPERAND (index, 1);
4878 rtx index_r, pos_rtx;
4879 HOST_WIDE_INT lo, hi, count;
4882 /* If the range is constant and "small", unroll the loop. */
4884 && host_integerp (lo_index, 0)
4885 && host_integerp (hi_index, 0)
4886 && (lo = tree_low_cst (lo_index, 0),
4887 hi = tree_low_cst (hi_index, 0),
4888 count = hi - lo + 1,
4891 || (host_integerp (TYPE_SIZE (elttype), 1)
4892 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
4895 lo -= minelt; hi -= minelt;
4896 for (; lo <= hi; lo++)
4898 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
4901 && !MEM_KEEP_ALIAS_SET_P (target)
4902 && TREE_CODE (type) == ARRAY_TYPE
4903 && TYPE_NONALIASED_COMPONENT (type))
4905 target = copy_rtx (target);
4906 MEM_KEEP_ALIAS_SET_P (target) = 1;
4909 store_constructor_field
4910 (target, bitsize, bitpos, mode, value, type, cleared,
4911 get_alias_set (elttype));
4916 rtx loop_start = gen_label_rtx ();
4917 rtx loop_end = gen_label_rtx ();
4920 expand_expr (hi_index, NULL_RTX, VOIDmode, 0);
4921 unsignedp = TYPE_UNSIGNED (domain);
4923 index = build_decl (VAR_DECL, NULL_TREE, domain);
4926 = gen_reg_rtx (promote_mode (domain, DECL_MODE (index),
4928 SET_DECL_RTL (index, index_r);
4929 store_expr (lo_index, index_r, 0);
4931 /* Build the head of the loop. */
4932 do_pending_stack_adjust ();
4933 emit_label (loop_start);
4935 /* Assign value to element index. */
4937 = convert (ssizetype,
4938 fold (build2 (MINUS_EXPR, TREE_TYPE (index),
4939 index, TYPE_MIN_VALUE (domain))));
4940 position = size_binop (MULT_EXPR, position,
4942 TYPE_SIZE_UNIT (elttype)));
4944 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
4945 xtarget = offset_address (target, pos_rtx,
4946 highest_pow2_factor (position));
4947 xtarget = adjust_address (xtarget, mode, 0);
4948 if (TREE_CODE (value) == CONSTRUCTOR)
4949 store_constructor (value, xtarget, cleared,
4950 bitsize / BITS_PER_UNIT);
4952 store_expr (value, xtarget, 0);
4954 /* Generate a conditional jump to exit the loop. */
4955 exit_cond = build2 (LT_EXPR, integer_type_node,
4957 jumpif (exit_cond, loop_end);
4959 /* Update the loop counter, and jump to the head of
4961 expand_assignment (index,
4962 build2 (PLUS_EXPR, TREE_TYPE (index),
4963 index, integer_one_node));
4965 emit_jump (loop_start);
4967 /* Build the end of the loop. */
4968 emit_label (loop_end);
4971 else if ((index != 0 && ! host_integerp (index, 0))
4972 || ! host_integerp (TYPE_SIZE (elttype), 1))
4977 index = ssize_int (1);
4980 index = fold_convert (ssizetype,
4981 fold (build2 (MINUS_EXPR,
4984 TYPE_MIN_VALUE (domain))));
4986 position = size_binop (MULT_EXPR, index,
4988 TYPE_SIZE_UNIT (elttype)));
4989 xtarget = offset_address (target,
4990 expand_expr (position, 0, VOIDmode, 0),
4991 highest_pow2_factor (position));
4992 xtarget = adjust_address (xtarget, mode, 0);
4993 store_expr (value, xtarget, 0);
4998 bitpos = ((tree_low_cst (index, 0) - minelt)
4999 * tree_low_cst (TYPE_SIZE (elttype), 1));
5001 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5003 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5004 && TREE_CODE (type) == ARRAY_TYPE
5005 && TYPE_NONALIASED_COMPONENT (type))
5007 target = copy_rtx (target);
5008 MEM_KEEP_ALIAS_SET_P (target) = 1;
5010 store_constructor_field (target, bitsize, bitpos, mode, value,
5011 type, cleared, get_alias_set (elttype));
5023 tree elttype = TREE_TYPE (type);
5024 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5025 enum machine_mode eltmode = TYPE_MODE (elttype);
5026 HOST_WIDE_INT bitsize;
5027 HOST_WIDE_INT bitpos;
5028 rtvec vector = NULL;
5031 gcc_assert (eltmode != BLKmode);
5033 n_elts = TYPE_VECTOR_SUBPARTS (type);
5034 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5036 enum machine_mode mode = GET_MODE (target);
5038 icode = (int) vec_init_optab->handlers[mode].insn_code;
5039 if (icode != CODE_FOR_nothing)
5043 vector = rtvec_alloc (n_elts);
5044 for (i = 0; i < n_elts; i++)
5045 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5049 /* If the constructor has fewer elements than the vector,
5050 clear the whole array first. Similarly if this is static
5051 constructor of a non-BLKmode object. */
5054 else if (REG_P (target) && TREE_STATIC (exp))
5058 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5060 for (elt = CONSTRUCTOR_ELTS (exp);
5062 elt = TREE_CHAIN (elt))
5064 int n_elts_here = tree_low_cst
5065 (int_const_binop (TRUNC_DIV_EXPR,
5066 TYPE_SIZE (TREE_TYPE (TREE_VALUE (elt))),
5067 TYPE_SIZE (elttype), 0), 1);
5069 count += n_elts_here;
5070 if (mostly_zeros_p (TREE_VALUE (elt)))
5071 zero_count += n_elts_here;
5074 /* Clear the entire vector first if there are any missing elements,
5075 or if the incidence of zero elements is >= 75%. */
5076 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5079 if (need_to_clear && size > 0 && !vector)
5082 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5084 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5088 if (!cleared && REG_P (target))
5089 /* Inform later passes that the old value is dead. */
5090 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
5092 /* Store each element of the constructor into the corresponding
5093 element of TARGET, determined by counting the elements. */
5094 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
5096 elt = TREE_CHAIN (elt), i += bitsize / elt_size)
5098 tree value = TREE_VALUE (elt);
5099 tree index = TREE_PURPOSE (elt);
5100 HOST_WIDE_INT eltpos;
5102 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5103 if (cleared && initializer_zerop (value))
5107 eltpos = tree_low_cst (index, 1);
5113 /* Vector CONSTRUCTORs should only be built from smaller
5114 vectors in the case of BLKmode vectors. */
5115 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5116 RTVEC_ELT (vector, eltpos)
5117 = expand_expr (value, NULL_RTX, VOIDmode, 0);
5121 enum machine_mode value_mode =
5122 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5123 ? TYPE_MODE (TREE_TYPE (value))
5125 bitpos = eltpos * elt_size;
5126 store_constructor_field (target, bitsize, bitpos,
5127 value_mode, value, type,
5128 cleared, get_alias_set (elttype));
5133 emit_insn (GEN_FCN (icode)
5135 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5144 /* Store the value of EXP (an expression tree)
5145 into a subfield of TARGET which has mode MODE and occupies
5146 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5147 If MODE is VOIDmode, it means that we are storing into a bit-field.
5149 Always return const0_rtx unless we have something particular to
5152 TYPE is the type of the underlying object,
5154 ALIAS_SET is the alias set for the destination. This value will
5155 (in general) be different from that for TARGET, since TARGET is a
5156 reference to the containing structure. */
5159 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5160 enum machine_mode mode, tree exp, tree type, int alias_set)
5162 HOST_WIDE_INT width_mask = 0;
5164 if (TREE_CODE (exp) == ERROR_MARK)
5167 /* If we have nothing to store, do nothing unless the expression has
5170 return expand_expr (exp, const0_rtx, VOIDmode, 0);
5171 else if (bitsize >= 0 && bitsize < HOST_BITS_PER_WIDE_INT)
5172 width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
5174 /* If we are storing into an unaligned field of an aligned union that is
5175 in a register, we may have the mode of TARGET being an integer mode but
5176 MODE == BLKmode. In that case, get an aligned object whose size and
5177 alignment are the same as TARGET and store TARGET into it (we can avoid
5178 the store if the field being stored is the entire width of TARGET). Then
5179 call ourselves recursively to store the field into a BLKmode version of
5180 that object. Finally, load from the object into TARGET. This is not
5181 very efficient in general, but should only be slightly more expensive
5182 than the otherwise-required unaligned accesses. Perhaps this can be
5183 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5184 twice, once with emit_move_insn and once via store_field. */
5187 && (REG_P (target) || GET_CODE (target) == SUBREG))
5189 rtx object = assign_temp (type, 0, 1, 1);
5190 rtx blk_object = adjust_address (object, BLKmode, 0);
5192 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5193 emit_move_insn (object, target);
5195 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set);
5197 emit_move_insn (target, object);
5199 /* We want to return the BLKmode version of the data. */
5203 if (GET_CODE (target) == CONCAT)
5205 /* We're storing into a struct containing a single __complex. */
5207 gcc_assert (!bitpos);
5208 return store_expr (exp, target, 0);
5211 /* If the structure is in a register or if the component
5212 is a bit field, we cannot use addressing to access it.
5213 Use bit-field techniques or SUBREG to store in it. */
5215 if (mode == VOIDmode
5216 || (mode != BLKmode && ! direct_store[(int) mode]
5217 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5218 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5220 || GET_CODE (target) == SUBREG
5221 /* If the field isn't aligned enough to store as an ordinary memref,
5222 store it as a bit field. */
5224 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5225 || bitpos % GET_MODE_ALIGNMENT (mode))
5226 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5227 || (bitpos % BITS_PER_UNIT != 0)))
5228 /* If the RHS and field are a constant size and the size of the
5229 RHS isn't the same size as the bitfield, we must use bitfield
5232 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5233 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5237 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5238 implies a mask operation. If the precision is the same size as
5239 the field we're storing into, that mask is redundant. This is
5240 particularly common with bit field assignments generated by the
5242 if (TREE_CODE (exp) == NOP_EXPR)
5244 tree type = TREE_TYPE (exp);
5245 if (INTEGRAL_TYPE_P (type)
5246 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
5247 && bitsize == TYPE_PRECISION (type))
5249 type = TREE_TYPE (TREE_OPERAND (exp, 0));
5250 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
5251 exp = TREE_OPERAND (exp, 0);
5255 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
5257 /* If BITSIZE is narrower than the size of the type of EXP
5258 we will be narrowing TEMP. Normally, what's wanted are the
5259 low-order bits. However, if EXP's type is a record and this is
5260 big-endian machine, we want the upper BITSIZE bits. */
5261 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5262 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5263 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5264 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5265 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5269 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5271 if (mode != VOIDmode && mode != BLKmode
5272 && mode != TYPE_MODE (TREE_TYPE (exp)))
5273 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5275 /* If the modes of TARGET and TEMP are both BLKmode, both
5276 must be in memory and BITPOS must be aligned on a byte
5277 boundary. If so, we simply do a block copy. */
5278 if (GET_MODE (target) == BLKmode && GET_MODE (temp) == BLKmode)
5280 gcc_assert (MEM_P (target) && MEM_P (temp)
5281 && !(bitpos % BITS_PER_UNIT));
5283 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5284 emit_block_move (target, temp,
5285 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5292 /* Store the value in the bitfield. */
5293 store_bit_field (target, bitsize, bitpos, mode, temp);
5299 /* Now build a reference to just the desired component. */
5300 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5302 if (to_rtx == target)
5303 to_rtx = copy_rtx (to_rtx);
5305 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5306 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5307 set_mem_alias_set (to_rtx, alias_set);
5309 return store_expr (exp, to_rtx, 0);
5313 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5314 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5315 codes and find the ultimate containing object, which we return.
5317 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5318 bit position, and *PUNSIGNEDP to the signedness of the field.
5319 If the position of the field is variable, we store a tree
5320 giving the variable offset (in units) in *POFFSET.
5321 This offset is in addition to the bit position.
5322 If the position is not variable, we store 0 in *POFFSET.
5324 If any of the extraction expressions is volatile,
5325 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5327 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5328 is a mode that can be used to access the field. In that case, *PBITSIZE
5331 If the field describes a variable-sized object, *PMODE is set to
5332 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5333 this case, but the address of the object can be found.
5335 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5336 look through nodes that serve as markers of a greater alignment than
5337 the one that can be deduced from the expression. These nodes make it
5338 possible for front-ends to prevent temporaries from being created by
5339 the middle-end on alignment considerations. For that purpose, the
5340 normal operating mode at high-level is to always pass FALSE so that
5341 the ultimate containing object is really returned; moreover, the
5342 associated predicate handled_component_p will always return TRUE
5343 on these nodes, thus indicating that they are essentially handled
5344 by get_inner_reference. TRUE should only be passed when the caller
5345 is scanning the expression in order to build another representation
5346 and specifically knows how to handle these nodes; as such, this is
5347 the normal operating mode in the RTL expanders. */
5350 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
5351 HOST_WIDE_INT *pbitpos, tree *poffset,
5352 enum machine_mode *pmode, int *punsignedp,
5353 int *pvolatilep, bool keep_aligning)
5356 enum machine_mode mode = VOIDmode;
5357 tree offset = size_zero_node;
5358 tree bit_offset = bitsize_zero_node;
5361 /* First get the mode, signedness, and size. We do this from just the
5362 outermost expression. */
5363 if (TREE_CODE (exp) == COMPONENT_REF)
5365 size_tree = DECL_SIZE (TREE_OPERAND (exp, 1));
5366 if (! DECL_BIT_FIELD (TREE_OPERAND (exp, 1)))
5367 mode = DECL_MODE (TREE_OPERAND (exp, 1));
5369 *punsignedp = DECL_UNSIGNED (TREE_OPERAND (exp, 1));
5371 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5373 size_tree = TREE_OPERAND (exp, 1);
5374 *punsignedp = BIT_FIELD_REF_UNSIGNED (exp);
5378 mode = TYPE_MODE (TREE_TYPE (exp));
5379 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
5381 if (mode == BLKmode)
5382 size_tree = TYPE_SIZE (TREE_TYPE (exp));
5384 *pbitsize = GET_MODE_BITSIZE (mode);
5389 if (! host_integerp (size_tree, 1))
5390 mode = BLKmode, *pbitsize = -1;
5392 *pbitsize = tree_low_cst (size_tree, 1);
5395 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5396 and find the ultimate containing object. */
5399 switch (TREE_CODE (exp))
5402 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5403 TREE_OPERAND (exp, 2));
5408 tree field = TREE_OPERAND (exp, 1);
5409 tree this_offset = component_ref_field_offset (exp);
5411 /* If this field hasn't been filled in yet, don't go past it.
5412 This should only happen when folding expressions made during
5413 type construction. */
5414 if (this_offset == 0)
5417 offset = size_binop (PLUS_EXPR, offset, this_offset);
5418 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5419 DECL_FIELD_BIT_OFFSET (field));
5421 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
5426 case ARRAY_RANGE_REF:
5428 tree index = TREE_OPERAND (exp, 1);
5429 tree low_bound = array_ref_low_bound (exp);
5430 tree unit_size = array_ref_element_size (exp);
5432 /* We assume all arrays have sizes that are a multiple of a byte.
5433 First subtract the lower bound, if any, in the type of the
5434 index, then convert to sizetype and multiply by the size of
5435 the array element. */
5436 if (! integer_zerop (low_bound))
5437 index = fold (build2 (MINUS_EXPR, TREE_TYPE (index),
5440 offset = size_binop (PLUS_EXPR, offset,
5441 size_binop (MULT_EXPR,
5442 convert (sizetype, index),
5451 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5452 bitsize_int (*pbitsize));
5455 case VIEW_CONVERT_EXPR:
5456 if (keep_aligning && STRICT_ALIGNMENT
5457 && (TYPE_ALIGN (TREE_TYPE (exp))
5458 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
5459 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
5460 < BIGGEST_ALIGNMENT)
5461 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
5462 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
5470 /* If any reference in the chain is volatile, the effect is volatile. */
5471 if (TREE_THIS_VOLATILE (exp))
5474 exp = TREE_OPERAND (exp, 0);
5478 /* If OFFSET is constant, see if we can return the whole thing as a
5479 constant bit position. Otherwise, split it up. */
5480 if (host_integerp (offset, 0)
5481 && 0 != (tem = size_binop (MULT_EXPR, convert (bitsizetype, offset),
5483 && 0 != (tem = size_binop (PLUS_EXPR, tem, bit_offset))
5484 && host_integerp (tem, 0))
5485 *pbitpos = tree_low_cst (tem, 0), *poffset = 0;
5487 *pbitpos = tree_low_cst (bit_offset, 0), *poffset = offset;
5493 /* Return a tree of sizetype representing the size, in bytes, of the element
5494 of EXP, an ARRAY_REF. */
5497 array_ref_element_size (tree exp)
5499 tree aligned_size = TREE_OPERAND (exp, 3);
5500 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5502 /* If a size was specified in the ARRAY_REF, it's the size measured
5503 in alignment units of the element type. So multiply by that value. */
5506 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
5507 sizetype from another type of the same width and signedness. */
5508 if (TREE_TYPE (aligned_size) != sizetype)
5509 aligned_size = fold_convert (sizetype, aligned_size);
5510 return size_binop (MULT_EXPR, aligned_size,
5511 size_int (TYPE_ALIGN_UNIT (elmt_type)));
5514 /* Otherwise, take the size from that of the element type. Substitute
5515 any PLACEHOLDER_EXPR that we have. */
5517 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
5520 /* Return a tree representing the lower bound of the array mentioned in
5521 EXP, an ARRAY_REF. */
5524 array_ref_low_bound (tree exp)
5526 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
5528 /* If a lower bound is specified in EXP, use it. */
5529 if (TREE_OPERAND (exp, 2))
5530 return TREE_OPERAND (exp, 2);
5532 /* Otherwise, if there is a domain type and it has a lower bound, use it,
5533 substituting for a PLACEHOLDER_EXPR as needed. */
5534 if (domain_type && TYPE_MIN_VALUE (domain_type))
5535 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
5537 /* Otherwise, return a zero of the appropriate type. */
5538 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
5541 /* Return a tree representing the upper bound of the array mentioned in
5542 EXP, an ARRAY_REF. */
5545 array_ref_up_bound (tree exp)
5547 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
5549 /* If there is a domain type and it has an upper bound, use it, substituting
5550 for a PLACEHOLDER_EXPR as needed. */
5551 if (domain_type && TYPE_MAX_VALUE (domain_type))
5552 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
5554 /* Otherwise fail. */
5558 /* Return a tree representing the offset, in bytes, of the field referenced
5559 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5562 component_ref_field_offset (tree exp)
5564 tree aligned_offset = TREE_OPERAND (exp, 2);
5565 tree field = TREE_OPERAND (exp, 1);
5567 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
5568 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
5572 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
5573 sizetype from another type of the same width and signedness. */
5574 if (TREE_TYPE (aligned_offset) != sizetype)
5575 aligned_offset = fold_convert (sizetype, aligned_offset);
5576 return size_binop (MULT_EXPR, aligned_offset,
5577 size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT));
5580 /* Otherwise, take the offset from that of the field. Substitute
5581 any PLACEHOLDER_EXPR that we have. */
5583 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
5586 /* Return 1 if T is an expression that get_inner_reference handles. */
5589 handled_component_p (tree t)
5591 switch (TREE_CODE (t))
5596 case ARRAY_RANGE_REF:
5597 case VIEW_CONVERT_EXPR:
5607 /* Given an rtx VALUE that may contain additions and multiplications, return
5608 an equivalent value that just refers to a register, memory, or constant.
5609 This is done by generating instructions to perform the arithmetic and
5610 returning a pseudo-register containing the value.
5612 The returned value may be a REG, SUBREG, MEM or constant. */
5615 force_operand (rtx value, rtx target)
5618 /* Use subtarget as the target for operand 0 of a binary operation. */
5619 rtx subtarget = get_subtarget (target);
5620 enum rtx_code code = GET_CODE (value);
5622 /* Check for subreg applied to an expression produced by loop optimizer. */
5624 && !REG_P (SUBREG_REG (value))
5625 && !MEM_P (SUBREG_REG (value)))
5627 value = simplify_gen_subreg (GET_MODE (value),
5628 force_reg (GET_MODE (SUBREG_REG (value)),
5629 force_operand (SUBREG_REG (value),
5631 GET_MODE (SUBREG_REG (value)),
5632 SUBREG_BYTE (value));
5633 code = GET_CODE (value);
5636 /* Check for a PIC address load. */
5637 if ((code == PLUS || code == MINUS)
5638 && XEXP (value, 0) == pic_offset_table_rtx
5639 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
5640 || GET_CODE (XEXP (value, 1)) == LABEL_REF
5641 || GET_CODE (XEXP (value, 1)) == CONST))
5644 subtarget = gen_reg_rtx (GET_MODE (value));
5645 emit_move_insn (subtarget, value);
5649 if (code == ZERO_EXTEND || code == SIGN_EXTEND)
5652 target = gen_reg_rtx (GET_MODE (value));
5653 convert_move (target, force_operand (XEXP (value, 0), NULL),
5654 code == ZERO_EXTEND);
5658 if (ARITHMETIC_P (value))
5660 op2 = XEXP (value, 1);
5661 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
5663 if (code == MINUS && GET_CODE (op2) == CONST_INT)
5666 op2 = negate_rtx (GET_MODE (value), op2);
5669 /* Check for an addition with OP2 a constant integer and our first
5670 operand a PLUS of a virtual register and something else. In that
5671 case, we want to emit the sum of the virtual register and the
5672 constant first and then add the other value. This allows virtual
5673 register instantiation to simply modify the constant rather than
5674 creating another one around this addition. */
5675 if (code == PLUS && GET_CODE (op2) == CONST_INT
5676 && GET_CODE (XEXP (value, 0)) == PLUS
5677 && REG_P (XEXP (XEXP (value, 0), 0))
5678 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5679 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
5681 rtx temp = expand_simple_binop (GET_MODE (value), code,
5682 XEXP (XEXP (value, 0), 0), op2,
5683 subtarget, 0, OPTAB_LIB_WIDEN);
5684 return expand_simple_binop (GET_MODE (value), code, temp,
5685 force_operand (XEXP (XEXP (value,
5687 target, 0, OPTAB_LIB_WIDEN);
5690 op1 = force_operand (XEXP (value, 0), subtarget);
5691 op2 = force_operand (op2, NULL_RTX);
5695 return expand_mult (GET_MODE (value), op1, op2, target, 1);
5697 if (!INTEGRAL_MODE_P (GET_MODE (value)))
5698 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5699 target, 1, OPTAB_LIB_WIDEN);
5701 return expand_divmod (0,
5702 FLOAT_MODE_P (GET_MODE (value))
5703 ? RDIV_EXPR : TRUNC_DIV_EXPR,
5704 GET_MODE (value), op1, op2, target, 0);
5707 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
5711 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
5715 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
5719 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5720 target, 0, OPTAB_LIB_WIDEN);
5723 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5724 target, 1, OPTAB_LIB_WIDEN);
5727 if (UNARY_P (value))
5729 op1 = force_operand (XEXP (value, 0), NULL_RTX);
5730 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
5733 #ifdef INSN_SCHEDULING
5734 /* On machines that have insn scheduling, we want all memory reference to be
5735 explicit, so we need to deal with such paradoxical SUBREGs. */
5736 if (GET_CODE (value) == SUBREG && MEM_P (SUBREG_REG (value))
5737 && (GET_MODE_SIZE (GET_MODE (value))
5738 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
5740 = simplify_gen_subreg (GET_MODE (value),
5741 force_reg (GET_MODE (SUBREG_REG (value)),
5742 force_operand (SUBREG_REG (value),
5744 GET_MODE (SUBREG_REG (value)),
5745 SUBREG_BYTE (value));
5751 /* Subroutine of expand_expr: return nonzero iff there is no way that
5752 EXP can reference X, which is being modified. TOP_P is nonzero if this
5753 call is going to be used to determine whether we need a temporary
5754 for EXP, as opposed to a recursive call to this function.
5756 It is always safe for this routine to return zero since it merely
5757 searches for optimization opportunities. */
5760 safe_from_p (rtx x, tree exp, int top_p)
5766 /* If EXP has varying size, we MUST use a target since we currently
5767 have no way of allocating temporaries of variable size
5768 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
5769 So we assume here that something at a higher level has prevented a
5770 clash. This is somewhat bogus, but the best we can do. Only
5771 do this when X is BLKmode and when we are at the top level. */
5772 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
5773 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
5774 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
5775 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
5776 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
5778 && GET_MODE (x) == BLKmode)
5779 /* If X is in the outgoing argument area, it is always safe. */
5781 && (XEXP (x, 0) == virtual_outgoing_args_rtx
5782 || (GET_CODE (XEXP (x, 0)) == PLUS
5783 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
5786 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
5787 find the underlying pseudo. */
5788 if (GET_CODE (x) == SUBREG)
5791 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
5795 /* Now look at our tree code and possibly recurse. */
5796 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
5798 case tcc_declaration:
5799 exp_rtl = DECL_RTL_IF_SET (exp);
5805 case tcc_exceptional:
5806 if (TREE_CODE (exp) == TREE_LIST)
5810 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
5812 exp = TREE_CHAIN (exp);
5815 if (TREE_CODE (exp) != TREE_LIST)
5816 return safe_from_p (x, exp, 0);
5819 else if (TREE_CODE (exp) == ERROR_MARK)
5820 return 1; /* An already-visited SAVE_EXPR? */
5825 /* The only case we look at here is the DECL_INITIAL inside a
5827 return (TREE_CODE (exp) != DECL_EXPR
5828 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
5829 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
5830 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
5833 case tcc_comparison:
5834 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
5839 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5841 case tcc_expression:
5843 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
5844 the expression. If it is set, we conflict iff we are that rtx or
5845 both are in memory. Otherwise, we check all operands of the
5846 expression recursively. */
5848 switch (TREE_CODE (exp))
5851 /* If the operand is static or we are static, we can't conflict.
5852 Likewise if we don't conflict with the operand at all. */
5853 if (staticp (TREE_OPERAND (exp, 0))
5854 || TREE_STATIC (exp)
5855 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
5858 /* Otherwise, the only way this can conflict is if we are taking
5859 the address of a DECL a that address if part of X, which is
5861 exp = TREE_OPERAND (exp, 0);
5864 if (!DECL_RTL_SET_P (exp)
5865 || !MEM_P (DECL_RTL (exp)))
5868 exp_rtl = XEXP (DECL_RTL (exp), 0);
5872 case MISALIGNED_INDIRECT_REF:
5873 case ALIGN_INDIRECT_REF:
5876 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
5877 get_alias_set (exp)))
5882 /* Assume that the call will clobber all hard registers and
5884 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
5889 case WITH_CLEANUP_EXPR:
5890 case CLEANUP_POINT_EXPR:
5891 /* Lowered by gimplify.c. */
5895 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5901 /* If we have an rtx, we do not need to scan our operands. */
5905 nops = TREE_CODE_LENGTH (TREE_CODE (exp));
5906 for (i = 0; i < nops; i++)
5907 if (TREE_OPERAND (exp, i) != 0
5908 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
5911 /* If this is a language-specific tree code, it may require
5912 special handling. */
5913 if ((unsigned int) TREE_CODE (exp)
5914 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
5915 && !lang_hooks.safe_from_p (x, exp))
5920 /* Should never get a type here. */
5924 /* If we have an rtl, find any enclosed object. Then see if we conflict
5928 if (GET_CODE (exp_rtl) == SUBREG)
5930 exp_rtl = SUBREG_REG (exp_rtl);
5932 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
5936 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
5937 are memory and they conflict. */
5938 return ! (rtx_equal_p (x, exp_rtl)
5939 || (MEM_P (x) && MEM_P (exp_rtl)
5940 && true_dependence (exp_rtl, VOIDmode, x,
5941 rtx_addr_varies_p)));
5944 /* If we reach here, it is safe. */
5949 /* Return the highest power of two that EXP is known to be a multiple of.
5950 This is used in updating alignment of MEMs in array references. */
5952 static unsigned HOST_WIDE_INT
5953 highest_pow2_factor (tree exp)
5955 unsigned HOST_WIDE_INT c0, c1;
5957 switch (TREE_CODE (exp))
5960 /* We can find the lowest bit that's a one. If the low
5961 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
5962 We need to handle this case since we can find it in a COND_EXPR,
5963 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
5964 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
5966 if (TREE_CONSTANT_OVERFLOW (exp))
5967 return BIGGEST_ALIGNMENT;
5970 /* Note: tree_low_cst is intentionally not used here,
5971 we don't care about the upper bits. */
5972 c0 = TREE_INT_CST_LOW (exp);
5974 return c0 ? c0 : BIGGEST_ALIGNMENT;
5978 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
5979 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
5980 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
5981 return MIN (c0, c1);
5984 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
5985 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
5988 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
5990 if (integer_pow2p (TREE_OPERAND (exp, 1))
5991 && host_integerp (TREE_OPERAND (exp, 1), 1))
5993 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
5994 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
5995 return MAX (1, c0 / c1);
5999 case NON_LVALUE_EXPR: case NOP_EXPR: case CONVERT_EXPR:
6001 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6004 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6007 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6008 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6009 return MIN (c0, c1);
6018 /* Similar, except that the alignment requirements of TARGET are
6019 taken into account. Assume it is at least as aligned as its
6020 type, unless it is a COMPONENT_REF in which case the layout of
6021 the structure gives the alignment. */
6023 static unsigned HOST_WIDE_INT
6024 highest_pow2_factor_for_target (tree target, tree exp)
6026 unsigned HOST_WIDE_INT target_align, factor;
6028 factor = highest_pow2_factor (exp);
6029 if (TREE_CODE (target) == COMPONENT_REF)
6030 target_align = DECL_ALIGN_UNIT (TREE_OPERAND (target, 1));
6032 target_align = TYPE_ALIGN_UNIT (TREE_TYPE (target));
6033 return MAX (factor, target_align);
6036 /* Expands variable VAR. */
6039 expand_var (tree var)
6041 if (DECL_EXTERNAL (var))
6044 if (TREE_STATIC (var))
6045 /* If this is an inlined copy of a static local variable,
6046 look up the original decl. */
6047 var = DECL_ORIGIN (var);
6049 if (TREE_STATIC (var)
6050 ? !TREE_ASM_WRITTEN (var)
6051 : !DECL_RTL_SET_P (var))
6053 if (TREE_CODE (var) == VAR_DECL && DECL_VALUE_EXPR (var))
6054 /* Should be ignored. */;
6055 else if (lang_hooks.expand_decl (var))
6057 else if (TREE_CODE (var) == VAR_DECL && !TREE_STATIC (var))
6059 else if (TREE_CODE (var) == VAR_DECL && TREE_STATIC (var))
6060 rest_of_decl_compilation (var, 0, 0);
6062 /* No expansion needed. */
6063 gcc_assert (TREE_CODE (var) == TYPE_DECL
6064 || TREE_CODE (var) == CONST_DECL
6065 || TREE_CODE (var) == FUNCTION_DECL
6066 || TREE_CODE (var) == LABEL_DECL);
6070 /* Subroutine of expand_expr. Expand the two operands of a binary
6071 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6072 The value may be stored in TARGET if TARGET is nonzero. The
6073 MODIFIER argument is as documented by expand_expr. */
6076 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6077 enum expand_modifier modifier)
6079 if (! safe_from_p (target, exp1, 1))
6081 if (operand_equal_p (exp0, exp1, 0))
6083 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6084 *op1 = copy_rtx (*op0);
6088 /* If we need to preserve evaluation order, copy exp0 into its own
6089 temporary variable so that it can't be clobbered by exp1. */
6090 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6091 exp0 = save_expr (exp0);
6092 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6093 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6098 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6099 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6102 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
6103 enum expand_modifier modifier)
6105 rtx result, subtarget;
6107 HOST_WIDE_INT bitsize, bitpos;
6108 int volatilep, unsignedp;
6109 enum machine_mode mode1;
6111 /* If we are taking the address of a constant and are at the top level,
6112 we have to use output_constant_def since we can't call force_const_mem
6114 /* ??? This should be considered a front-end bug. We should not be
6115 generating ADDR_EXPR of something that isn't an LVALUE. The only
6116 exception here is STRING_CST. */
6117 if (TREE_CODE (exp) == CONSTRUCTOR
6118 || CONSTANT_CLASS_P (exp))
6119 return XEXP (output_constant_def (exp, 0), 0);
6121 /* Everything must be something allowed by is_gimple_addressable. */
6122 switch (TREE_CODE (exp))
6125 /* This case will happen via recursion for &a->b. */
6126 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, EXPAND_NORMAL);
6129 /* Recurse and make the output_constant_def clause above handle this. */
6130 return expand_expr_addr_expr_1 (DECL_INITIAL (exp), target,
6134 /* The real part of the complex number is always first, therefore
6135 the address is the same as the address of the parent object. */
6138 inner = TREE_OPERAND (exp, 0);
6142 /* The imaginary part of the complex number is always second.
6143 The expression is therefore always offset by the size of the
6146 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
6147 inner = TREE_OPERAND (exp, 0);
6151 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6152 expand_expr, as that can have various side effects; LABEL_DECLs for
6153 example, may not have their DECL_RTL set yet. Assume language
6154 specific tree nodes can be expanded in some interesting way. */
6156 || TREE_CODE (exp) >= LAST_AND_UNUSED_TREE_CODE)
6158 result = expand_expr (exp, target, tmode,
6159 modifier == EXPAND_INITIALIZER
6160 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
6162 /* If the DECL isn't in memory, then the DECL wasn't properly
6163 marked TREE_ADDRESSABLE, which will be either a front-end
6164 or a tree optimizer bug. */
6165 gcc_assert (GET_CODE (result) == MEM);
6166 result = XEXP (result, 0);
6168 /* ??? Is this needed anymore? */
6169 if (DECL_P (exp) && !TREE_USED (exp) == 0)
6171 assemble_external (exp);
6172 TREE_USED (exp) = 1;
6175 if (modifier != EXPAND_INITIALIZER
6176 && modifier != EXPAND_CONST_ADDRESS)
6177 result = force_operand (result, target);
6181 /* Pass FALSE as the last argument to get_inner_reference although
6182 we are expanding to RTL. The rationale is that we know how to
6183 handle "aligning nodes" here: we can just bypass them because
6184 they won't change the final object whose address will be returned
6185 (they actually exist only for that purpose). */
6186 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6187 &mode1, &unsignedp, &volatilep, false);
6191 /* We must have made progress. */
6192 gcc_assert (inner != exp);
6194 subtarget = offset || bitpos ? NULL_RTX : target;
6195 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier);
6201 if (modifier != EXPAND_NORMAL)
6202 result = force_operand (result, NULL);
6203 tmp = expand_expr (offset, NULL, tmode, EXPAND_NORMAL);
6205 result = convert_memory_address (tmode, result);
6206 tmp = convert_memory_address (tmode, tmp);
6208 if (modifier == EXPAND_SUM)
6209 result = gen_rtx_PLUS (tmode, result, tmp);
6212 subtarget = bitpos ? NULL_RTX : target;
6213 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
6214 1, OPTAB_LIB_WIDEN);
6220 /* Someone beforehand should have rejected taking the address
6221 of such an object. */
6222 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
6224 result = plus_constant (result, bitpos / BITS_PER_UNIT);
6225 if (modifier < EXPAND_SUM)
6226 result = force_operand (result, target);
6232 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
6233 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6236 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
6237 enum expand_modifier modifier)
6239 enum machine_mode rmode;
6242 /* Target mode of VOIDmode says "whatever's natural". */
6243 if (tmode == VOIDmode)
6244 tmode = TYPE_MODE (TREE_TYPE (exp));
6246 /* We can get called with some Weird Things if the user does silliness
6247 like "(short) &a". In that case, convert_memory_address won't do
6248 the right thing, so ignore the given target mode. */
6249 if (tmode != Pmode && tmode != ptr_mode)
6252 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
6255 /* Despite expand_expr claims concerning ignoring TMODE when not
6256 strictly convenient, stuff breaks if we don't honor it. Note
6257 that combined with the above, we only do this for pointer modes. */
6258 rmode = GET_MODE (result);
6259 if (rmode == VOIDmode)
6262 result = convert_memory_address (tmode, result);
6268 /* expand_expr: generate code for computing expression EXP.
6269 An rtx for the computed value is returned. The value is never null.
6270 In the case of a void EXP, const0_rtx is returned.
6272 The value may be stored in TARGET if TARGET is nonzero.
6273 TARGET is just a suggestion; callers must assume that
6274 the rtx returned may not be the same as TARGET.
6276 If TARGET is CONST0_RTX, it means that the value will be ignored.
6278 If TMODE is not VOIDmode, it suggests generating the
6279 result in mode TMODE. But this is done only when convenient.
6280 Otherwise, TMODE is ignored and the value generated in its natural mode.
6281 TMODE is just a suggestion; callers must assume that
6282 the rtx returned may not have mode TMODE.
6284 Note that TARGET may have neither TMODE nor MODE. In that case, it
6285 probably will not be used.
6287 If MODIFIER is EXPAND_SUM then when EXP is an addition
6288 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
6289 or a nest of (PLUS ...) and (MINUS ...) where the terms are
6290 products as above, or REG or MEM, or constant.
6291 Ordinarily in such cases we would output mul or add instructions
6292 and then return a pseudo reg containing the sum.
6294 EXPAND_INITIALIZER is much like EXPAND_SUM except that
6295 it also marks a label as absolutely required (it can't be dead).
6296 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
6297 This is used for outputting expressions used in initializers.
6299 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
6300 with a constant address even if that address is not normally legitimate.
6301 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
6303 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
6304 a call parameter. Such targets require special care as we haven't yet
6305 marked TARGET so that it's safe from being trashed by libcalls. We
6306 don't want to use TARGET for anything but the final result;
6307 Intermediate values must go elsewhere. Additionally, calls to
6308 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
6310 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
6311 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
6312 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
6313 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
6316 static rtx expand_expr_real_1 (tree, rtx, enum machine_mode,
6317 enum expand_modifier, rtx *);
6320 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
6321 enum expand_modifier modifier, rtx *alt_rtl)
6324 rtx ret, last = NULL;
6326 /* Handle ERROR_MARK before anybody tries to access its type. */
6327 if (TREE_CODE (exp) == ERROR_MARK
6328 || TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK)
6330 ret = CONST0_RTX (tmode);
6331 return ret ? ret : const0_rtx;
6334 if (flag_non_call_exceptions)
6336 rn = lookup_stmt_eh_region (exp);
6337 /* If rn < 0, then either (1) tree-ssa not used or (2) doesn't throw. */
6339 last = get_last_insn ();
6342 /* If this is an expression of some kind and it has an associated line
6343 number, then emit the line number before expanding the expression.
6345 We need to save and restore the file and line information so that
6346 errors discovered during expansion are emitted with the right
6347 information. It would be better of the diagnostic routines
6348 used the file/line information embedded in the tree nodes rather
6350 if (cfun && EXPR_HAS_LOCATION (exp))
6352 location_t saved_location = input_location;
6353 input_location = EXPR_LOCATION (exp);
6354 emit_line_note (input_location);
6356 /* Record where the insns produced belong. */
6357 record_block_change (TREE_BLOCK (exp));
6359 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
6361 input_location = saved_location;
6365 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
6368 /* If using non-call exceptions, mark all insns that may trap.
6369 expand_call() will mark CALL_INSNs before we get to this code,
6370 but it doesn't handle libcalls, and these may trap. */
6374 for (insn = next_real_insn (last); insn;
6375 insn = next_real_insn (insn))
6377 if (! find_reg_note (insn, REG_EH_REGION, NULL_RTX)
6378 /* If we want exceptions for non-call insns, any
6379 may_trap_p instruction may throw. */
6380 && GET_CODE (PATTERN (insn)) != CLOBBER
6381 && GET_CODE (PATTERN (insn)) != USE
6382 && (CALL_P (insn) || may_trap_p (PATTERN (insn))))
6384 REG_NOTES (insn) = alloc_EXPR_LIST (REG_EH_REGION, GEN_INT (rn),
6394 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
6395 enum expand_modifier modifier, rtx *alt_rtl)
6398 tree type = TREE_TYPE (exp);
6400 enum machine_mode mode;
6401 enum tree_code code = TREE_CODE (exp);
6403 rtx subtarget, original_target;
6406 bool reduce_bit_field = false;
6407 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field && !ignore \
6408 ? reduce_to_bit_field_precision ((expr), \
6413 mode = TYPE_MODE (type);
6414 unsignedp = TYPE_UNSIGNED (type);
6415 if (lang_hooks.reduce_bit_field_operations
6416 && TREE_CODE (type) == INTEGER_TYPE
6417 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type))
6419 /* An operation in what may be a bit-field type needs the
6420 result to be reduced to the precision of the bit-field type,
6421 which is narrower than that of the type's mode. */
6422 reduce_bit_field = true;
6423 if (modifier == EXPAND_STACK_PARM)
6427 /* Use subtarget as the target for operand 0 of a binary operation. */
6428 subtarget = get_subtarget (target);
6429 original_target = target;
6430 ignore = (target == const0_rtx
6431 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
6432 || code == CONVERT_EXPR || code == COND_EXPR
6433 || code == VIEW_CONVERT_EXPR)
6434 && TREE_CODE (type) == VOID_TYPE));
6436 /* If we are going to ignore this result, we need only do something
6437 if there is a side-effect somewhere in the expression. If there
6438 is, short-circuit the most common cases here. Note that we must
6439 not call expand_expr with anything but const0_rtx in case this
6440 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
6444 if (! TREE_SIDE_EFFECTS (exp))
6447 /* Ensure we reference a volatile object even if value is ignored, but
6448 don't do this if all we are doing is taking its address. */
6449 if (TREE_THIS_VOLATILE (exp)
6450 && TREE_CODE (exp) != FUNCTION_DECL
6451 && mode != VOIDmode && mode != BLKmode
6452 && modifier != EXPAND_CONST_ADDRESS)
6454 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
6456 temp = copy_to_reg (temp);
6460 if (TREE_CODE_CLASS (code) == tcc_unary
6461 || code == COMPONENT_REF || code == INDIRECT_REF)
6462 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6465 else if (TREE_CODE_CLASS (code) == tcc_binary
6466 || TREE_CODE_CLASS (code) == tcc_comparison
6467 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
6469 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6470 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6473 else if (code == BIT_FIELD_REF)
6475 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6476 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6477 expand_expr (TREE_OPERAND (exp, 2), const0_rtx, VOIDmode, modifier);
6484 /* If will do cse, generate all results into pseudo registers
6485 since 1) that allows cse to find more things
6486 and 2) otherwise cse could produce an insn the machine
6487 cannot support. An exception is a CONSTRUCTOR into a multi-word
6488 MEM: that's much more likely to be most efficient into the MEM.
6489 Another is a CALL_EXPR which must return in memory. */
6491 if (! cse_not_expected && mode != BLKmode && target
6492 && (!REG_P (target) || REGNO (target) < FIRST_PSEUDO_REGISTER)
6493 && ! (code == CONSTRUCTOR && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
6494 && ! (code == CALL_EXPR && aggregate_value_p (exp, exp)))
6501 tree function = decl_function_context (exp);
6503 temp = label_rtx (exp);
6504 temp = gen_rtx_LABEL_REF (Pmode, temp);
6506 if (function != current_function_decl
6508 LABEL_REF_NONLOCAL_P (temp) = 1;
6510 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
6515 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier,
6520 /* If a static var's type was incomplete when the decl was written,
6521 but the type is complete now, lay out the decl now. */
6522 if (DECL_SIZE (exp) == 0
6523 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
6524 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
6525 layout_decl (exp, 0);
6527 /* ... fall through ... */
6531 gcc_assert (DECL_RTL (exp));
6533 /* Ensure variable marked as used even if it doesn't go through
6534 a parser. If it hasn't be used yet, write out an external
6536 if (! TREE_USED (exp))
6538 assemble_external (exp);
6539 TREE_USED (exp) = 1;
6542 /* Show we haven't gotten RTL for this yet. */
6545 /* Variables inherited from containing functions should have
6546 been lowered by this point. */
6547 context = decl_function_context (exp);
6548 gcc_assert (!context
6549 || context == current_function_decl
6550 || TREE_STATIC (exp)
6551 /* ??? C++ creates functions that are not TREE_STATIC. */
6552 || TREE_CODE (exp) == FUNCTION_DECL);
6554 /* This is the case of an array whose size is to be determined
6555 from its initializer, while the initializer is still being parsed.
6558 if (MEM_P (DECL_RTL (exp))
6559 && REG_P (XEXP (DECL_RTL (exp), 0)))
6560 temp = validize_mem (DECL_RTL (exp));
6562 /* If DECL_RTL is memory, we are in the normal case and either
6563 the address is not valid or it is not a register and -fforce-addr
6564 is specified, get the address into a register. */
6566 else if (MEM_P (DECL_RTL (exp))
6567 && modifier != EXPAND_CONST_ADDRESS
6568 && modifier != EXPAND_SUM
6569 && modifier != EXPAND_INITIALIZER
6570 && (! memory_address_p (DECL_MODE (exp),
6571 XEXP (DECL_RTL (exp), 0))
6573 && !REG_P (XEXP (DECL_RTL (exp), 0)))))
6576 *alt_rtl = DECL_RTL (exp);
6577 temp = replace_equiv_address (DECL_RTL (exp),
6578 copy_rtx (XEXP (DECL_RTL (exp), 0)));
6581 /* If we got something, return it. But first, set the alignment
6582 if the address is a register. */
6585 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
6586 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
6591 /* If the mode of DECL_RTL does not match that of the decl, it
6592 must be a promoted value. We return a SUBREG of the wanted mode,
6593 but mark it so that we know that it was already extended. */
6595 if (REG_P (DECL_RTL (exp))
6596 && GET_MODE (DECL_RTL (exp)) != DECL_MODE (exp))
6598 enum machine_mode pmode;
6600 /* Get the signedness used for this variable. Ensure we get the
6601 same mode we got when the variable was declared. */
6602 pmode = promote_mode (type, DECL_MODE (exp), &unsignedp,
6603 (TREE_CODE (exp) == RESULT_DECL ? 1 : 0));
6604 gcc_assert (GET_MODE (DECL_RTL (exp)) == pmode);
6606 temp = gen_lowpart_SUBREG (mode, DECL_RTL (exp));
6607 SUBREG_PROMOTED_VAR_P (temp) = 1;
6608 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
6612 return DECL_RTL (exp);
6615 temp = immed_double_const (TREE_INT_CST_LOW (exp),
6616 TREE_INT_CST_HIGH (exp), mode);
6618 /* ??? If overflow is set, fold will have done an incomplete job,
6619 which can result in (plus xx (const_int 0)), which can get
6620 simplified by validate_replace_rtx during virtual register
6621 instantiation, which can result in unrecognizable insns.
6622 Avoid this by forcing all overflows into registers. */
6623 if (TREE_CONSTANT_OVERFLOW (exp)
6624 && modifier != EXPAND_INITIALIZER)
6625 temp = force_reg (mode, temp);
6630 if (GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (exp))) == MODE_VECTOR_INT
6631 || GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (exp))) == MODE_VECTOR_FLOAT)
6632 return const_vector_from_tree (exp);
6634 return expand_expr (build1 (CONSTRUCTOR, TREE_TYPE (exp),
6635 TREE_VECTOR_CST_ELTS (exp)),
6636 ignore ? const0_rtx : target, tmode, modifier);
6639 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
6642 /* If optimized, generate immediate CONST_DOUBLE
6643 which will be turned into memory by reload if necessary.
6645 We used to force a register so that loop.c could see it. But
6646 this does not allow gen_* patterns to perform optimizations with
6647 the constants. It also produces two insns in cases like "x = 1.0;".
6648 On most machines, floating-point constants are not permitted in
6649 many insns, so we'd end up copying it to a register in any case.
6651 Now, we do the copying in expand_binop, if appropriate. */
6652 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
6653 TYPE_MODE (TREE_TYPE (exp)));
6656 /* Handle evaluating a complex constant in a CONCAT target. */
6657 if (original_target && GET_CODE (original_target) == CONCAT)
6659 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
6662 rtarg = XEXP (original_target, 0);
6663 itarg = XEXP (original_target, 1);
6665 /* Move the real and imaginary parts separately. */
6666 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, 0);
6667 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, 0);
6670 emit_move_insn (rtarg, op0);
6672 emit_move_insn (itarg, op1);
6674 return original_target;
6677 /* ... fall through ... */
6680 temp = output_constant_def (exp, 1);
6682 /* temp contains a constant address.
6683 On RISC machines where a constant address isn't valid,
6684 make some insns to get that address into a register. */
6685 if (modifier != EXPAND_CONST_ADDRESS
6686 && modifier != EXPAND_INITIALIZER
6687 && modifier != EXPAND_SUM
6688 && (! memory_address_p (mode, XEXP (temp, 0))
6689 || flag_force_addr))
6690 return replace_equiv_address (temp,
6691 copy_rtx (XEXP (temp, 0)));
6696 tree val = TREE_OPERAND (exp, 0);
6697 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
6699 if (!SAVE_EXPR_RESOLVED_P (exp))
6701 /* We can indeed still hit this case, typically via builtin
6702 expanders calling save_expr immediately before expanding
6703 something. Assume this means that we only have to deal
6704 with non-BLKmode values. */
6705 gcc_assert (GET_MODE (ret) != BLKmode);
6707 val = build_decl (VAR_DECL, NULL, TREE_TYPE (exp));
6708 DECL_ARTIFICIAL (val) = 1;
6709 DECL_IGNORED_P (val) = 1;
6710 TREE_OPERAND (exp, 0) = val;
6711 SAVE_EXPR_RESOLVED_P (exp) = 1;
6713 if (!CONSTANT_P (ret))
6714 ret = copy_to_reg (ret);
6715 SET_DECL_RTL (val, ret);
6722 if (TREE_CODE (TREE_OPERAND (exp, 0)) == LABEL_DECL)
6723 expand_goto (TREE_OPERAND (exp, 0));
6725 expand_computed_goto (TREE_OPERAND (exp, 0));
6729 /* If we don't need the result, just ensure we evaluate any
6735 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
6736 expand_expr (TREE_VALUE (elt), const0_rtx, VOIDmode, 0);
6741 /* All elts simple constants => refer to a constant in memory. But
6742 if this is a non-BLKmode mode, let it store a field at a time
6743 since that should make a CONST_INT or CONST_DOUBLE when we
6744 fold. Likewise, if we have a target we can use, it is best to
6745 store directly into the target unless the type is large enough
6746 that memcpy will be used. If we are making an initializer and
6747 all operands are constant, put it in memory as well.
6749 FIXME: Avoid trying to fill vector constructors piece-meal.
6750 Output them with output_constant_def below unless we're sure
6751 they're zeros. This should go away when vector initializers
6752 are treated like VECTOR_CST instead of arrays.
6754 else if ((TREE_STATIC (exp)
6755 && ((mode == BLKmode
6756 && ! (target != 0 && safe_from_p (target, exp, 1)))
6757 || TREE_ADDRESSABLE (exp)
6758 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
6759 && (! MOVE_BY_PIECES_P
6760 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
6762 && ! mostly_zeros_p (exp))))
6763 || ((modifier == EXPAND_INITIALIZER
6764 || modifier == EXPAND_CONST_ADDRESS)
6765 && TREE_CONSTANT (exp)))
6767 rtx constructor = output_constant_def (exp, 1);
6769 if (modifier != EXPAND_CONST_ADDRESS
6770 && modifier != EXPAND_INITIALIZER
6771 && modifier != EXPAND_SUM)
6772 constructor = validize_mem (constructor);
6778 /* Handle calls that pass values in multiple non-contiguous
6779 locations. The Irix 6 ABI has examples of this. */
6780 if (target == 0 || ! safe_from_p (target, exp, 1)
6781 || GET_CODE (target) == PARALLEL
6782 || modifier == EXPAND_STACK_PARM)
6784 = assign_temp (build_qualified_type (type,
6786 | (TREE_READONLY (exp)
6787 * TYPE_QUAL_CONST))),
6788 0, TREE_ADDRESSABLE (exp), 1);
6790 store_constructor (exp, target, 0, int_expr_size (exp));
6794 case MISALIGNED_INDIRECT_REF:
6795 case ALIGN_INDIRECT_REF:
6798 tree exp1 = TREE_OPERAND (exp, 0);
6801 if (modifier != EXPAND_WRITE)
6805 t = fold_read_from_constant_string (exp);
6807 return expand_expr (t, target, tmode, modifier);
6810 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
6811 op0 = memory_address (mode, op0);
6813 if (code == ALIGN_INDIRECT_REF)
6815 int align = TYPE_ALIGN_UNIT (type);
6816 op0 = gen_rtx_AND (Pmode, op0, GEN_INT (-align));
6817 op0 = memory_address (mode, op0);
6820 temp = gen_rtx_MEM (mode, op0);
6822 orig = REF_ORIGINAL (exp);
6825 set_mem_attributes (temp, orig, 0);
6827 /* Resolve the misalignment now, so that we don't have to remember
6828 to resolve it later. Of course, this only works for reads. */
6829 /* ??? When we get around to supporting writes, we'll have to handle
6830 this in store_expr directly. The vectorizer isn't generating
6831 those yet, however. */
6832 if (code == MISALIGNED_INDIRECT_REF)
6837 gcc_assert (modifier == EXPAND_NORMAL);
6839 /* The vectorizer should have already checked the mode. */
6840 icode = movmisalign_optab->handlers[mode].insn_code;
6841 gcc_assert (icode != CODE_FOR_nothing);
6843 /* We've already validated the memory, and we're creating a
6844 new pseudo destination. The predicates really can't fail. */
6845 reg = gen_reg_rtx (mode);
6847 /* Nor can the insn generator. */
6848 insn = GEN_FCN (icode) (reg, temp);
6860 tree array = TREE_OPERAND (exp, 0);
6861 tree index = TREE_OPERAND (exp, 1);
6863 /* Fold an expression like: "foo"[2].
6864 This is not done in fold so it won't happen inside &.
6865 Don't fold if this is for wide characters since it's too
6866 difficult to do correctly and this is a very rare case. */
6868 if (modifier != EXPAND_CONST_ADDRESS
6869 && modifier != EXPAND_INITIALIZER
6870 && modifier != EXPAND_MEMORY)
6872 tree t = fold_read_from_constant_string (exp);
6875 return expand_expr (t, target, tmode, modifier);
6878 /* If this is a constant index into a constant array,
6879 just get the value from the array. Handle both the cases when
6880 we have an explicit constructor and when our operand is a variable
6881 that was declared const. */
6883 if (modifier != EXPAND_CONST_ADDRESS
6884 && modifier != EXPAND_INITIALIZER
6885 && modifier != EXPAND_MEMORY
6886 && TREE_CODE (array) == CONSTRUCTOR
6887 && ! TREE_SIDE_EFFECTS (array)
6888 && TREE_CODE (index) == INTEGER_CST)
6892 for (elem = CONSTRUCTOR_ELTS (array);
6893 (elem && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
6894 elem = TREE_CHAIN (elem))
6897 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
6898 return expand_expr (fold (TREE_VALUE (elem)), target, tmode,
6902 else if (optimize >= 1
6903 && modifier != EXPAND_CONST_ADDRESS
6904 && modifier != EXPAND_INITIALIZER
6905 && modifier != EXPAND_MEMORY
6906 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
6907 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
6908 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
6909 && targetm.binds_local_p (array))
6911 if (TREE_CODE (index) == INTEGER_CST)
6913 tree init = DECL_INITIAL (array);
6915 if (TREE_CODE (init) == CONSTRUCTOR)
6919 for (elem = CONSTRUCTOR_ELTS (init);
6921 && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
6922 elem = TREE_CHAIN (elem))
6925 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
6926 return expand_expr (fold (TREE_VALUE (elem)), target,
6929 else if (TREE_CODE (init) == STRING_CST
6930 && 0 > compare_tree_int (index,
6931 TREE_STRING_LENGTH (init)))
6933 tree type = TREE_TYPE (TREE_TYPE (init));
6934 enum machine_mode mode = TYPE_MODE (type);
6936 if (GET_MODE_CLASS (mode) == MODE_INT
6937 && GET_MODE_SIZE (mode) == 1)
6938 return gen_int_mode (TREE_STRING_POINTER (init)
6939 [TREE_INT_CST_LOW (index)], mode);
6944 goto normal_inner_ref;
6947 /* If the operand is a CONSTRUCTOR, we can just extract the
6948 appropriate field if it is present. */
6949 if (TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR)
6953 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
6954 elt = TREE_CHAIN (elt))
6955 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1)
6956 /* We can normally use the value of the field in the
6957 CONSTRUCTOR. However, if this is a bitfield in
6958 an integral mode that we can fit in a HOST_WIDE_INT,
6959 we must mask only the number of bits in the bitfield,
6960 since this is done implicitly by the constructor. If
6961 the bitfield does not meet either of those conditions,
6962 we can't do this optimization. */
6963 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt))
6964 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt)))
6966 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt)))
6967 <= HOST_BITS_PER_WIDE_INT))))
6969 if (DECL_BIT_FIELD (TREE_PURPOSE (elt))
6970 && modifier == EXPAND_STACK_PARM)
6972 op0 = expand_expr (TREE_VALUE (elt), target, tmode, modifier);
6973 if (DECL_BIT_FIELD (TREE_PURPOSE (elt)))
6975 HOST_WIDE_INT bitsize
6976 = TREE_INT_CST_LOW (DECL_SIZE (TREE_PURPOSE (elt)));
6977 enum machine_mode imode
6978 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt)));
6980 if (TYPE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt))))
6982 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
6983 op0 = expand_and (imode, op0, op1, target);
6988 = build_int_cst (NULL_TREE,
6989 GET_MODE_BITSIZE (imode) - bitsize);
6991 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
6993 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
7001 goto normal_inner_ref;
7004 case ARRAY_RANGE_REF:
7007 enum machine_mode mode1;
7008 HOST_WIDE_INT bitsize, bitpos;
7011 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
7012 &mode1, &unsignedp, &volatilep, true);
7015 /* If we got back the original object, something is wrong. Perhaps
7016 we are evaluating an expression too early. In any event, don't
7017 infinitely recurse. */
7018 gcc_assert (tem != exp);
7020 /* If TEM's type is a union of variable size, pass TARGET to the inner
7021 computation, since it will need a temporary and TARGET is known
7022 to have to do. This occurs in unchecked conversion in Ada. */
7026 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
7027 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
7029 && modifier != EXPAND_STACK_PARM
7030 ? target : NULL_RTX),
7032 (modifier == EXPAND_INITIALIZER
7033 || modifier == EXPAND_CONST_ADDRESS
7034 || modifier == EXPAND_STACK_PARM)
7035 ? modifier : EXPAND_NORMAL);
7037 /* If this is a constant, put it into a register if it is a
7038 legitimate constant and OFFSET is 0 and memory if it isn't. */
7039 if (CONSTANT_P (op0))
7041 enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
7042 if (mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
7044 op0 = force_reg (mode, op0);
7046 op0 = validize_mem (force_const_mem (mode, op0));
7049 /* Otherwise, if this object not in memory and we either have an
7050 offset or a BLKmode result, put it there. This case can't occur in
7051 C, but can in Ada if we have unchecked conversion of an expression
7052 from a scalar type to an array or record type or for an
7053 ARRAY_RANGE_REF whose type is BLKmode. */
7054 else if (!MEM_P (op0)
7056 || (code == ARRAY_RANGE_REF && mode == BLKmode)))
7058 tree nt = build_qualified_type (TREE_TYPE (tem),
7059 (TYPE_QUALS (TREE_TYPE (tem))
7060 | TYPE_QUAL_CONST));
7061 rtx memloc = assign_temp (nt, 1, 1, 1);
7063 emit_move_insn (memloc, op0);
7069 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
7072 gcc_assert (MEM_P (op0));
7074 #ifdef POINTERS_EXTEND_UNSIGNED
7075 if (GET_MODE (offset_rtx) != Pmode)
7076 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
7078 if (GET_MODE (offset_rtx) != ptr_mode)
7079 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
7082 if (GET_MODE (op0) == BLKmode
7083 /* A constant address in OP0 can have VOIDmode, we must
7084 not try to call force_reg in that case. */
7085 && GET_MODE (XEXP (op0, 0)) != VOIDmode
7087 && (bitpos % bitsize) == 0
7088 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
7089 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
7091 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7095 op0 = offset_address (op0, offset_rtx,
7096 highest_pow2_factor (offset));
7099 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
7100 record its alignment as BIGGEST_ALIGNMENT. */
7101 if (MEM_P (op0) && bitpos == 0 && offset != 0
7102 && is_aligning_offset (offset, tem))
7103 set_mem_align (op0, BIGGEST_ALIGNMENT);
7105 /* Don't forget about volatility even if this is a bitfield. */
7106 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
7108 if (op0 == orig_op0)
7109 op0 = copy_rtx (op0);
7111 MEM_VOLATILE_P (op0) = 1;
7114 /* The following code doesn't handle CONCAT.
7115 Assume only bitpos == 0 can be used for CONCAT, due to
7116 one element arrays having the same mode as its element. */
7117 if (GET_CODE (op0) == CONCAT)
7119 gcc_assert (bitpos == 0
7120 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)));
7124 /* In cases where an aligned union has an unaligned object
7125 as a field, we might be extracting a BLKmode value from
7126 an integer-mode (e.g., SImode) object. Handle this case
7127 by doing the extract into an object as wide as the field
7128 (which we know to be the width of a basic mode), then
7129 storing into memory, and changing the mode to BLKmode. */
7130 if (mode1 == VOIDmode
7131 || REG_P (op0) || GET_CODE (op0) == SUBREG
7132 || (mode1 != BLKmode && ! direct_load[(int) mode1]
7133 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7134 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
7135 && modifier != EXPAND_CONST_ADDRESS
7136 && modifier != EXPAND_INITIALIZER)
7137 /* If the field isn't aligned enough to fetch as a memref,
7138 fetch it as a bit field. */
7139 || (mode1 != BLKmode
7140 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
7141 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
7143 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
7144 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
7145 && ((modifier == EXPAND_CONST_ADDRESS
7146 || modifier == EXPAND_INITIALIZER)
7148 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
7149 || (bitpos % BITS_PER_UNIT != 0)))
7150 /* If the type and the field are a constant size and the
7151 size of the type isn't the same size as the bitfield,
7152 we must use bitfield operations. */
7154 && TYPE_SIZE (TREE_TYPE (exp))
7155 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
7156 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
7159 enum machine_mode ext_mode = mode;
7161 if (ext_mode == BLKmode
7162 && ! (target != 0 && MEM_P (op0)
7164 && bitpos % BITS_PER_UNIT == 0))
7165 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
7167 if (ext_mode == BLKmode)
7170 target = assign_temp (type, 0, 1, 1);
7175 /* In this case, BITPOS must start at a byte boundary and
7176 TARGET, if specified, must be a MEM. */
7177 gcc_assert (MEM_P (op0)
7178 && (!target || MEM_P (target))
7179 && !(bitpos % BITS_PER_UNIT));
7181 emit_block_move (target,
7182 adjust_address (op0, VOIDmode,
7183 bitpos / BITS_PER_UNIT),
7184 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
7186 (modifier == EXPAND_STACK_PARM
7187 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
7192 op0 = validize_mem (op0);
7194 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
7195 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7197 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp,
7198 (modifier == EXPAND_STACK_PARM
7199 ? NULL_RTX : target),
7200 ext_mode, ext_mode);
7202 /* If the result is a record type and BITSIZE is narrower than
7203 the mode of OP0, an integral mode, and this is a big endian
7204 machine, we must put the field into the high-order bits. */
7205 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
7206 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7207 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
7208 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
7209 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
7213 /* If the result type is BLKmode, store the data into a temporary
7214 of the appropriate type, but with the mode corresponding to the
7215 mode for the data we have (op0's mode). It's tempting to make
7216 this a constant type, since we know it's only being stored once,
7217 but that can cause problems if we are taking the address of this
7218 COMPONENT_REF because the MEM of any reference via that address
7219 will have flags corresponding to the type, which will not
7220 necessarily be constant. */
7221 if (mode == BLKmode)
7224 = assign_stack_temp_for_type
7225 (ext_mode, GET_MODE_BITSIZE (ext_mode), 0, type);
7227 emit_move_insn (new, op0);
7228 op0 = copy_rtx (new);
7229 PUT_MODE (op0, BLKmode);
7230 set_mem_attributes (op0, exp, 1);
7236 /* If the result is BLKmode, use that to access the object
7238 if (mode == BLKmode)
7241 /* Get a reference to just this component. */
7242 if (modifier == EXPAND_CONST_ADDRESS
7243 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7244 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
7246 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7248 if (op0 == orig_op0)
7249 op0 = copy_rtx (op0);
7251 set_mem_attributes (op0, exp, 0);
7252 if (REG_P (XEXP (op0, 0)))
7253 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7255 MEM_VOLATILE_P (op0) |= volatilep;
7256 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
7257 || modifier == EXPAND_CONST_ADDRESS
7258 || modifier == EXPAND_INITIALIZER)
7260 else if (target == 0)
7261 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7263 convert_move (target, op0, unsignedp);
7268 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
7271 /* Check for a built-in function. */
7272 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
7273 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7275 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7277 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7278 == BUILT_IN_FRONTEND)
7279 return lang_hooks.expand_expr (exp, original_target,
7283 return expand_builtin (exp, target, subtarget, tmode, ignore);
7286 return expand_call (exp, target, ignore);
7288 case NON_LVALUE_EXPR:
7291 if (TREE_OPERAND (exp, 0) == error_mark_node)
7294 if (TREE_CODE (type) == UNION_TYPE)
7296 tree valtype = TREE_TYPE (TREE_OPERAND (exp, 0));
7298 /* If both input and output are BLKmode, this conversion isn't doing
7299 anything except possibly changing memory attribute. */
7300 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7302 rtx result = expand_expr (TREE_OPERAND (exp, 0), target, tmode,
7305 result = copy_rtx (result);
7306 set_mem_attributes (result, exp, 0);
7312 if (TYPE_MODE (type) != BLKmode)
7313 target = gen_reg_rtx (TYPE_MODE (type));
7315 target = assign_temp (type, 0, 1, 1);
7319 /* Store data into beginning of memory target. */
7320 store_expr (TREE_OPERAND (exp, 0),
7321 adjust_address (target, TYPE_MODE (valtype), 0),
7322 modifier == EXPAND_STACK_PARM);
7326 gcc_assert (REG_P (target));
7328 /* Store this field into a union of the proper type. */
7329 store_field (target,
7330 MIN ((int_size_in_bytes (TREE_TYPE
7331 (TREE_OPERAND (exp, 0)))
7333 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7334 0, TYPE_MODE (valtype), TREE_OPERAND (exp, 0),
7338 /* Return the entire union. */
7342 if (mode == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))
7344 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode,
7347 /* If the signedness of the conversion differs and OP0 is
7348 a promoted SUBREG, clear that indication since we now
7349 have to do the proper extension. */
7350 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) != unsignedp
7351 && GET_CODE (op0) == SUBREG)
7352 SUBREG_PROMOTED_VAR_P (op0) = 0;
7354 return REDUCE_BIT_FIELD (op0);
7357 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7358 if (GET_MODE (op0) == mode)
7361 /* If OP0 is a constant, just convert it into the proper mode. */
7362 else if (CONSTANT_P (op0))
7364 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7365 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7367 if (modifier == EXPAND_INITIALIZER)
7368 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7369 subreg_lowpart_offset (mode,
7372 op0= convert_modes (mode, inner_mode, op0,
7373 TYPE_UNSIGNED (inner_type));
7376 else if (modifier == EXPAND_INITIALIZER)
7377 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7379 else if (target == 0)
7380 op0 = convert_to_mode (mode, op0,
7381 TYPE_UNSIGNED (TREE_TYPE
7382 (TREE_OPERAND (exp, 0))));
7385 convert_move (target, op0,
7386 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7390 return REDUCE_BIT_FIELD (op0);
7392 case VIEW_CONVERT_EXPR:
7393 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7395 /* If the input and output modes are both the same, we are done.
7396 Otherwise, if neither mode is BLKmode and both are integral and within
7397 a word, we can use gen_lowpart. If neither is true, make sure the
7398 operand is in memory and convert the MEM to the new mode. */
7399 if (TYPE_MODE (type) == GET_MODE (op0))
7401 else if (TYPE_MODE (type) != BLKmode && GET_MODE (op0) != BLKmode
7402 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7403 && GET_MODE_CLASS (TYPE_MODE (type)) == MODE_INT
7404 && GET_MODE_SIZE (TYPE_MODE (type)) <= UNITS_PER_WORD
7405 && GET_MODE_SIZE (GET_MODE (op0)) <= UNITS_PER_WORD)
7406 op0 = gen_lowpart (TYPE_MODE (type), op0);
7407 else if (!MEM_P (op0))
7409 /* If the operand is not a MEM, force it into memory. Since we
7410 are going to be be changing the mode of the MEM, don't call
7411 force_const_mem for constants because we don't allow pool
7412 constants to change mode. */
7413 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7415 gcc_assert (!TREE_ADDRESSABLE (exp));
7417 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
7419 = assign_stack_temp_for_type
7420 (TYPE_MODE (inner_type),
7421 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
7423 emit_move_insn (target, op0);
7427 /* At this point, OP0 is in the correct mode. If the output type is such
7428 that the operand is known to be aligned, indicate that it is.
7429 Otherwise, we need only be concerned about alignment for non-BLKmode
7433 op0 = copy_rtx (op0);
7435 if (TYPE_ALIGN_OK (type))
7436 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
7437 else if (TYPE_MODE (type) != BLKmode && STRICT_ALIGNMENT
7438 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (TYPE_MODE (type)))
7440 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7441 HOST_WIDE_INT temp_size
7442 = MAX (int_size_in_bytes (inner_type),
7443 (HOST_WIDE_INT) GET_MODE_SIZE (TYPE_MODE (type)));
7444 rtx new = assign_stack_temp_for_type (TYPE_MODE (type),
7445 temp_size, 0, type);
7446 rtx new_with_op0_mode = adjust_address (new, GET_MODE (op0), 0);
7448 gcc_assert (!TREE_ADDRESSABLE (exp));
7450 if (GET_MODE (op0) == BLKmode)
7451 emit_block_move (new_with_op0_mode, op0,
7452 GEN_INT (GET_MODE_SIZE (TYPE_MODE (type))),
7453 (modifier == EXPAND_STACK_PARM
7454 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
7456 emit_move_insn (new_with_op0_mode, op0);
7461 op0 = adjust_address (op0, TYPE_MODE (type), 0);
7467 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7468 something else, make sure we add the register to the constant and
7469 then to the other thing. This case can occur during strength
7470 reduction and doing it this way will produce better code if the
7471 frame pointer or argument pointer is eliminated.
7473 fold-const.c will ensure that the constant is always in the inner
7474 PLUS_EXPR, so the only case we need to do anything about is if
7475 sp, ap, or fp is our second argument, in which case we must swap
7476 the innermost first argument and our second argument. */
7478 if (TREE_CODE (TREE_OPERAND (exp, 0)) == PLUS_EXPR
7479 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 1)) == INTEGER_CST
7480 && TREE_CODE (TREE_OPERAND (exp, 1)) == VAR_DECL
7481 && (DECL_RTL (TREE_OPERAND (exp, 1)) == frame_pointer_rtx
7482 || DECL_RTL (TREE_OPERAND (exp, 1)) == stack_pointer_rtx
7483 || DECL_RTL (TREE_OPERAND (exp, 1)) == arg_pointer_rtx))
7485 tree t = TREE_OPERAND (exp, 1);
7487 TREE_OPERAND (exp, 1) = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
7488 TREE_OPERAND (TREE_OPERAND (exp, 0), 0) = t;
7491 /* If the result is to be ptr_mode and we are adding an integer to
7492 something, we might be forming a constant. So try to use
7493 plus_constant. If it produces a sum and we can't accept it,
7494 use force_operand. This allows P = &ARR[const] to generate
7495 efficient code on machines where a SYMBOL_REF is not a valid
7498 If this is an EXPAND_SUM call, always return the sum. */
7499 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7500 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7502 if (modifier == EXPAND_STACK_PARM)
7504 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
7505 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7506 && TREE_CONSTANT (TREE_OPERAND (exp, 1)))
7510 op1 = expand_expr (TREE_OPERAND (exp, 1), subtarget, VOIDmode,
7512 /* Use immed_double_const to ensure that the constant is
7513 truncated according to the mode of OP1, then sign extended
7514 to a HOST_WIDE_INT. Using the constant directly can result
7515 in non-canonical RTL in a 64x32 cross compile. */
7517 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 0)),
7519 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))));
7520 op1 = plus_constant (op1, INTVAL (constant_part));
7521 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7522 op1 = force_operand (op1, target);
7523 return REDUCE_BIT_FIELD (op1);
7526 else if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7527 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_INT
7528 && TREE_CONSTANT (TREE_OPERAND (exp, 0)))
7532 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7533 (modifier == EXPAND_INITIALIZER
7534 ? EXPAND_INITIALIZER : EXPAND_SUM));
7535 if (! CONSTANT_P (op0))
7537 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7538 VOIDmode, modifier);
7539 /* Return a PLUS if modifier says it's OK. */
7540 if (modifier == EXPAND_SUM
7541 || modifier == EXPAND_INITIALIZER)
7542 return simplify_gen_binary (PLUS, mode, op0, op1);
7545 /* Use immed_double_const to ensure that the constant is
7546 truncated according to the mode of OP1, then sign extended
7547 to a HOST_WIDE_INT. Using the constant directly can result
7548 in non-canonical RTL in a 64x32 cross compile. */
7550 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)),
7552 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))));
7553 op0 = plus_constant (op0, INTVAL (constant_part));
7554 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7555 op0 = force_operand (op0, target);
7556 return REDUCE_BIT_FIELD (op0);
7560 /* No sense saving up arithmetic to be done
7561 if it's all in the wrong mode to form part of an address.
7562 And force_operand won't know whether to sign-extend or
7564 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7565 || mode != ptr_mode)
7567 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7568 subtarget, &op0, &op1, 0);
7569 if (op0 == const0_rtx)
7571 if (op1 == const0_rtx)
7576 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7577 subtarget, &op0, &op1, modifier);
7578 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7581 /* For initializers, we are allowed to return a MINUS of two
7582 symbolic constants. Here we handle all cases when both operands
7584 /* Handle difference of two symbolic constants,
7585 for the sake of an initializer. */
7586 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7587 && really_constant_p (TREE_OPERAND (exp, 0))
7588 && really_constant_p (TREE_OPERAND (exp, 1)))
7590 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7591 NULL_RTX, &op0, &op1, modifier);
7593 /* If the last operand is a CONST_INT, use plus_constant of
7594 the negated constant. Else make the MINUS. */
7595 if (GET_CODE (op1) == CONST_INT)
7596 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7598 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7601 /* No sense saving up arithmetic to be done
7602 if it's all in the wrong mode to form part of an address.
7603 And force_operand won't know whether to sign-extend or
7605 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7606 || mode != ptr_mode)
7609 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7610 subtarget, &op0, &op1, modifier);
7612 /* Convert A - const to A + (-const). */
7613 if (GET_CODE (op1) == CONST_INT)
7615 op1 = negate_rtx (mode, op1);
7616 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7622 /* If first operand is constant, swap them.
7623 Thus the following special case checks need only
7624 check the second operand. */
7625 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
7627 tree t1 = TREE_OPERAND (exp, 0);
7628 TREE_OPERAND (exp, 0) = TREE_OPERAND (exp, 1);
7629 TREE_OPERAND (exp, 1) = t1;
7632 /* Attempt to return something suitable for generating an
7633 indexed address, for machines that support that. */
7635 if (modifier == EXPAND_SUM && mode == ptr_mode
7636 && host_integerp (TREE_OPERAND (exp, 1), 0))
7638 tree exp1 = TREE_OPERAND (exp, 1);
7640 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7644 op0 = force_operand (op0, NULL_RTX);
7646 op0 = copy_to_mode_reg (mode, op0);
7648 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7649 gen_int_mode (tree_low_cst (exp1, 0),
7650 TYPE_MODE (TREE_TYPE (exp1)))));
7653 if (modifier == EXPAND_STACK_PARM)
7656 /* Check for multiplying things that have been extended
7657 from a narrower type. If this machine supports multiplying
7658 in that narrower type with a result in the desired type,
7659 do it that way, and avoid the explicit type-conversion. */
7660 if (TREE_CODE (TREE_OPERAND (exp, 0)) == NOP_EXPR
7661 && TREE_CODE (type) == INTEGER_TYPE
7662 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7663 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))
7664 && ((TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7665 && int_fits_type_p (TREE_OPERAND (exp, 1),
7666 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7667 /* Don't use a widening multiply if a shift will do. */
7668 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))))
7669 > HOST_BITS_PER_WIDE_INT)
7670 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))) < 0))
7672 (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7673 && (TYPE_PRECISION (TREE_TYPE
7674 (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7675 == TYPE_PRECISION (TREE_TYPE
7677 (TREE_OPERAND (exp, 0), 0))))
7678 /* If both operands are extended, they must either both
7679 be zero-extended or both be sign-extended. */
7680 && (TYPE_UNSIGNED (TREE_TYPE
7681 (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7682 == TYPE_UNSIGNED (TREE_TYPE
7684 (TREE_OPERAND (exp, 0), 0)))))))
7686 tree op0type = TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0));
7687 enum machine_mode innermode = TYPE_MODE (op0type);
7688 bool zextend_p = TYPE_UNSIGNED (op0type);
7689 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7690 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7692 if (mode == GET_MODE_WIDER_MODE (innermode))
7694 if (this_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
7696 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7697 expand_operands (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7698 TREE_OPERAND (exp, 1),
7699 NULL_RTX, &op0, &op1, 0);
7701 expand_operands (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7702 TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7703 NULL_RTX, &op0, &op1, 0);
7706 else if (other_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
7707 && innermode == word_mode)
7710 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7711 NULL_RTX, VOIDmode, 0);
7712 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7713 op1 = convert_modes (innermode, mode,
7714 expand_expr (TREE_OPERAND (exp, 1),
7715 NULL_RTX, VOIDmode, 0),
7718 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7719 NULL_RTX, VOIDmode, 0);
7720 temp = expand_binop (mode, other_optab, op0, op1, target,
7721 unsignedp, OPTAB_LIB_WIDEN);
7722 hipart = gen_highpart (innermode, temp);
7723 htem = expand_mult_highpart_adjust (innermode, hipart,
7727 emit_move_insn (hipart, htem);
7728 return REDUCE_BIT_FIELD (temp);
7732 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7733 subtarget, &op0, &op1, 0);
7734 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7736 case TRUNC_DIV_EXPR:
7737 case FLOOR_DIV_EXPR:
7739 case ROUND_DIV_EXPR:
7740 case EXACT_DIV_EXPR:
7741 if (modifier == EXPAND_STACK_PARM)
7743 /* Possible optimization: compute the dividend with EXPAND_SUM
7744 then if the divisor is constant can optimize the case
7745 where some terms of the dividend have coeffs divisible by it. */
7746 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7747 subtarget, &op0, &op1, 0);
7748 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7751 /* Emit a/b as a*(1/b). Later we may manage CSE the reciprocal saving
7752 expensive divide. If not, combine will rebuild the original
7754 if (flag_unsafe_math_optimizations && optimize && !optimize_size
7755 && TREE_CODE (type) == REAL_TYPE
7756 && !real_onep (TREE_OPERAND (exp, 0)))
7757 return expand_expr (build2 (MULT_EXPR, type, TREE_OPERAND (exp, 0),
7758 build2 (RDIV_EXPR, type,
7759 build_real (type, dconst1),
7760 TREE_OPERAND (exp, 1))),
7761 target, tmode, modifier);
7765 case TRUNC_MOD_EXPR:
7766 case FLOOR_MOD_EXPR:
7768 case ROUND_MOD_EXPR:
7769 if (modifier == EXPAND_STACK_PARM)
7771 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7772 subtarget, &op0, &op1, 0);
7773 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7775 case FIX_ROUND_EXPR:
7776 case FIX_FLOOR_EXPR:
7778 gcc_unreachable (); /* Not used for C. */
7780 case FIX_TRUNC_EXPR:
7781 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7782 if (target == 0 || modifier == EXPAND_STACK_PARM)
7783 target = gen_reg_rtx (mode);
7784 expand_fix (target, op0, unsignedp);
7788 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7789 if (target == 0 || modifier == EXPAND_STACK_PARM)
7790 target = gen_reg_rtx (mode);
7791 /* expand_float can't figure out what to do if FROM has VOIDmode.
7792 So give it the correct mode. With -O, cse will optimize this. */
7793 if (GET_MODE (op0) == VOIDmode)
7794 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7796 expand_float (target, op0,
7797 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7801 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7802 if (modifier == EXPAND_STACK_PARM)
7804 temp = expand_unop (mode,
7805 optab_for_tree_code (NEGATE_EXPR, type),
7808 return REDUCE_BIT_FIELD (temp);
7811 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7812 if (modifier == EXPAND_STACK_PARM)
7815 /* ABS_EXPR is not valid for complex arguments. */
7816 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7817 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
7819 /* Unsigned abs is simply the operand. Testing here means we don't
7820 risk generating incorrect code below. */
7821 if (TYPE_UNSIGNED (type))
7824 return expand_abs (mode, op0, target, unsignedp,
7825 safe_from_p (target, TREE_OPERAND (exp, 0), 1));
7829 target = original_target;
7831 || modifier == EXPAND_STACK_PARM
7832 || (MEM_P (target) && MEM_VOLATILE_P (target))
7833 || GET_MODE (target) != mode
7835 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7836 target = gen_reg_rtx (mode);
7837 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7838 target, &op0, &op1, 0);
7840 /* First try to do it with a special MIN or MAX instruction.
7841 If that does not win, use a conditional jump to select the proper
7843 this_optab = optab_for_tree_code (code, type);
7844 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7849 /* At this point, a MEM target is no longer useful; we will get better
7852 if (! REG_P (target))
7853 target = gen_reg_rtx (mode);
7855 /* If op1 was placed in target, swap op0 and op1. */
7856 if (target != op0 && target == op1)
7863 /* We generate better code and avoid problems with op1 mentioning
7864 target by forcing op1 into a pseudo if it isn't a constant. */
7865 if (! CONSTANT_P (op1))
7866 op1 = force_reg (mode, op1);
7869 emit_move_insn (target, op0);
7871 op0 = gen_label_rtx ();
7873 /* If this mode is an integer too wide to compare properly,
7874 compare word by word. Rely on cse to optimize constant cases. */
7875 if (GET_MODE_CLASS (mode) == MODE_INT
7876 && ! can_compare_p (GE, mode, ccp_jump))
7878 if (code == MAX_EXPR)
7879 do_jump_by_parts_greater_rtx (mode, unsignedp, target, op1,
7882 do_jump_by_parts_greater_rtx (mode, unsignedp, op1, target,
7887 do_compare_rtx_and_jump (target, op1, code == MAX_EXPR ? GE : LE,
7888 unsignedp, mode, NULL_RTX, NULL_RTX, op0);
7890 emit_move_insn (target, op1);
7895 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7896 if (modifier == EXPAND_STACK_PARM)
7898 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
7902 /* ??? Can optimize bitwise operations with one arg constant.
7903 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
7904 and (a bitwise1 b) bitwise2 b (etc)
7905 but that is probably not worth while. */
7907 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
7908 boolean values when we want in all cases to compute both of them. In
7909 general it is fastest to do TRUTH_AND_EXPR by computing both operands
7910 as actual zero-or-1 values and then bitwise anding. In cases where
7911 there cannot be any side effects, better code would be made by
7912 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
7913 how to recognize those cases. */
7915 case TRUTH_AND_EXPR:
7916 code = BIT_AND_EXPR;
7921 code = BIT_IOR_EXPR;
7925 case TRUTH_XOR_EXPR:
7926 code = BIT_XOR_EXPR;
7934 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7936 if (modifier == EXPAND_STACK_PARM)
7938 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7939 return expand_shift (code, mode, op0, TREE_OPERAND (exp, 1), target,
7942 /* Could determine the answer when only additive constants differ. Also,
7943 the addition of one can be handled by changing the condition. */
7950 case UNORDERED_EXPR:
7958 temp = do_store_flag (exp,
7959 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
7960 tmode != VOIDmode ? tmode : mode, 0);
7964 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
7965 if (code == NE_EXPR && integer_zerop (TREE_OPERAND (exp, 1))
7967 && REG_P (original_target)
7968 && (GET_MODE (original_target)
7969 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))))
7971 temp = expand_expr (TREE_OPERAND (exp, 0), original_target,
7974 /* If temp is constant, we can just compute the result. */
7975 if (GET_CODE (temp) == CONST_INT)
7977 if (INTVAL (temp) != 0)
7978 emit_move_insn (target, const1_rtx);
7980 emit_move_insn (target, const0_rtx);
7985 if (temp != original_target)
7987 enum machine_mode mode1 = GET_MODE (temp);
7988 if (mode1 == VOIDmode)
7989 mode1 = tmode != VOIDmode ? tmode : mode;
7991 temp = copy_to_mode_reg (mode1, temp);
7994 op1 = gen_label_rtx ();
7995 emit_cmp_and_jump_insns (temp, const0_rtx, EQ, NULL_RTX,
7996 GET_MODE (temp), unsignedp, op1);
7997 emit_move_insn (temp, const1_rtx);
8002 /* If no set-flag instruction, must generate a conditional store
8003 into a temporary variable. Drop through and handle this
8008 || modifier == EXPAND_STACK_PARM
8009 || ! safe_from_p (target, exp, 1)
8010 /* Make sure we don't have a hard reg (such as function's return
8011 value) live across basic blocks, if not optimizing. */
8012 || (!optimize && REG_P (target)
8013 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8014 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8017 emit_move_insn (target, const0_rtx);
8019 op1 = gen_label_rtx ();
8020 jumpifnot (exp, op1);
8023 emit_move_insn (target, const1_rtx);
8026 return ignore ? const0_rtx : target;
8028 case TRUTH_NOT_EXPR:
8029 if (modifier == EXPAND_STACK_PARM)
8031 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
8032 /* The parser is careful to generate TRUTH_NOT_EXPR
8033 only with operands that are always zero or one. */
8034 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8035 target, 1, OPTAB_LIB_WIDEN);
8039 case STATEMENT_LIST:
8041 tree_stmt_iterator iter;
8043 gcc_assert (ignore);
8045 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
8046 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
8051 /* A COND_EXPR with its type being VOID_TYPE represents a
8052 conditional jump and is handled in
8053 expand_gimple_cond_expr. */
8054 gcc_assert (!VOID_TYPE_P (TREE_TYPE (exp)));
8056 /* Note that COND_EXPRs whose type is a structure or union
8057 are required to be constructed to contain assignments of
8058 a temporary variable, so that we can evaluate them here
8059 for side effect only. If type is void, we must do likewise. */
8061 gcc_assert (!TREE_ADDRESSABLE (type)
8063 && TREE_TYPE (TREE_OPERAND (exp, 1)) != void_type_node
8064 && TREE_TYPE (TREE_OPERAND (exp, 2)) != void_type_node);
8066 /* If we are not to produce a result, we have no target. Otherwise,
8067 if a target was specified use it; it will not be used as an
8068 intermediate target unless it is safe. If no target, use a
8071 if (modifier != EXPAND_STACK_PARM
8073 && safe_from_p (original_target, TREE_OPERAND (exp, 0), 1)
8074 && GET_MODE (original_target) == mode
8075 #ifdef HAVE_conditional_move
8076 && (! can_conditionally_move_p (mode)
8077 || REG_P (original_target))
8079 && !MEM_P (original_target))
8080 temp = original_target;
8082 temp = assign_temp (type, 0, 0, 1);
8084 do_pending_stack_adjust ();
8086 op0 = gen_label_rtx ();
8087 op1 = gen_label_rtx ();
8088 jumpifnot (TREE_OPERAND (exp, 0), op0);
8089 store_expr (TREE_OPERAND (exp, 1), temp,
8090 modifier == EXPAND_STACK_PARM);
8092 emit_jump_insn (gen_jump (op1));
8095 store_expr (TREE_OPERAND (exp, 2), temp,
8096 modifier == EXPAND_STACK_PARM);
8103 target = expand_vec_cond_expr (exp, target);
8108 tree lhs = TREE_OPERAND (exp, 0);
8109 tree rhs = TREE_OPERAND (exp, 1);
8111 gcc_assert (ignore);
8113 /* Check for |= or &= of a bitfield of size one into another bitfield
8114 of size 1. In this case, (unless we need the result of the
8115 assignment) we can do this more efficiently with a
8116 test followed by an assignment, if necessary.
8118 ??? At this point, we can't get a BIT_FIELD_REF here. But if
8119 things change so we do, this code should be enhanced to
8121 if (TREE_CODE (lhs) == COMPONENT_REF
8122 && (TREE_CODE (rhs) == BIT_IOR_EXPR
8123 || TREE_CODE (rhs) == BIT_AND_EXPR)
8124 && TREE_OPERAND (rhs, 0) == lhs
8125 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
8126 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
8127 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
8129 rtx label = gen_label_rtx ();
8131 do_jump (TREE_OPERAND (rhs, 1),
8132 TREE_CODE (rhs) == BIT_IOR_EXPR ? label : 0,
8133 TREE_CODE (rhs) == BIT_AND_EXPR ? label : 0);
8134 expand_assignment (lhs, convert (TREE_TYPE (rhs),
8135 (TREE_CODE (rhs) == BIT_IOR_EXPR
8137 : integer_zero_node)));
8138 do_pending_stack_adjust ();
8143 expand_assignment (lhs, rhs);
8149 if (!TREE_OPERAND (exp, 0))
8150 expand_null_return ();
8152 expand_return (TREE_OPERAND (exp, 0));
8156 return expand_expr_addr_expr (exp, target, tmode, modifier);
8159 /* Get the rtx code of the operands. */
8160 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8161 op1 = expand_expr (TREE_OPERAND (exp, 1), 0, VOIDmode, 0);
8164 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
8166 /* Move the real (op0) and imaginary (op1) parts to their location. */
8167 write_complex_part (target, op0, false);
8168 write_complex_part (target, op1, true);
8173 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8174 return read_complex_part (op0, false);
8177 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8178 return read_complex_part (op0, true);
8181 expand_resx_expr (exp);
8184 case TRY_CATCH_EXPR:
8186 case EH_FILTER_EXPR:
8187 case TRY_FINALLY_EXPR:
8188 /* Lowered by tree-eh.c. */
8191 case WITH_CLEANUP_EXPR:
8192 case CLEANUP_POINT_EXPR:
8194 case CASE_LABEL_EXPR:
8200 case PREINCREMENT_EXPR:
8201 case PREDECREMENT_EXPR:
8202 case POSTINCREMENT_EXPR:
8203 case POSTDECREMENT_EXPR:
8206 case TRUTH_ANDIF_EXPR:
8207 case TRUTH_ORIF_EXPR:
8208 /* Lowered by gimplify.c. */
8212 return get_exception_pointer (cfun);
8215 return get_exception_filter (cfun);
8218 /* Function descriptors are not valid except for as
8219 initialization constants, and should not be expanded. */
8227 expand_label (TREE_OPERAND (exp, 0));
8231 expand_asm_expr (exp);
8234 case WITH_SIZE_EXPR:
8235 /* WITH_SIZE_EXPR expands to its first argument. The caller should
8236 have pulled out the size to use in whatever context it needed. */
8237 return expand_expr_real (TREE_OPERAND (exp, 0), original_target, tmode,
8240 case REALIGN_LOAD_EXPR:
8242 tree oprnd0 = TREE_OPERAND (exp, 0);
8243 tree oprnd1 = TREE_OPERAND (exp, 1);
8244 tree oprnd2 = TREE_OPERAND (exp, 2);
8247 this_optab = optab_for_tree_code (code, type);
8248 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, 0);
8249 op2 = expand_expr (oprnd2, NULL_RTX, VOIDmode, 0);
8250 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
8259 return lang_hooks.expand_expr (exp, original_target, tmode,
8263 /* Here to do an ordinary binary operator. */
8265 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
8266 subtarget, &op0, &op1, 0);
8268 this_optab = optab_for_tree_code (code, type);
8270 if (modifier == EXPAND_STACK_PARM)
8272 temp = expand_binop (mode, this_optab, op0, op1, target,
8273 unsignedp, OPTAB_LIB_WIDEN);
8275 return REDUCE_BIT_FIELD (temp);
8277 #undef REDUCE_BIT_FIELD
8279 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
8280 signedness of TYPE), possibly returning the result in TARGET. */
8282 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
8284 HOST_WIDE_INT prec = TYPE_PRECISION (type);
8285 if (target && GET_MODE (target) != GET_MODE (exp))
8287 if (TYPE_UNSIGNED (type))
8290 if (prec < HOST_BITS_PER_WIDE_INT)
8291 mask = immed_double_const (((unsigned HOST_WIDE_INT) 1 << prec) - 1, 0,
8294 mask = immed_double_const ((unsigned HOST_WIDE_INT) -1,
8295 ((unsigned HOST_WIDE_INT) 1
8296 << (prec - HOST_BITS_PER_WIDE_INT)) - 1,
8298 return expand_and (GET_MODE (exp), exp, mask, target);
8302 tree count = build_int_cst (NULL_TREE,
8303 GET_MODE_BITSIZE (GET_MODE (exp)) - prec);
8304 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
8305 return expand_shift (RSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
8309 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
8310 when applied to the address of EXP produces an address known to be
8311 aligned more than BIGGEST_ALIGNMENT. */
8314 is_aligning_offset (tree offset, tree exp)
8316 /* Strip off any conversions. */
8317 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8318 || TREE_CODE (offset) == NOP_EXPR
8319 || TREE_CODE (offset) == CONVERT_EXPR)
8320 offset = TREE_OPERAND (offset, 0);
8322 /* We must now have a BIT_AND_EXPR with a constant that is one less than
8323 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
8324 if (TREE_CODE (offset) != BIT_AND_EXPR
8325 || !host_integerp (TREE_OPERAND (offset, 1), 1)
8326 || compare_tree_int (TREE_OPERAND (offset, 1),
8327 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
8328 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
8331 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
8332 It must be NEGATE_EXPR. Then strip any more conversions. */
8333 offset = TREE_OPERAND (offset, 0);
8334 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8335 || TREE_CODE (offset) == NOP_EXPR
8336 || TREE_CODE (offset) == CONVERT_EXPR)
8337 offset = TREE_OPERAND (offset, 0);
8339 if (TREE_CODE (offset) != NEGATE_EXPR)
8342 offset = TREE_OPERAND (offset, 0);
8343 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8344 || TREE_CODE (offset) == NOP_EXPR
8345 || TREE_CODE (offset) == CONVERT_EXPR)
8346 offset = TREE_OPERAND (offset, 0);
8348 /* This must now be the address of EXP. */
8349 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
8352 /* Return the tree node if an ARG corresponds to a string constant or zero
8353 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
8354 in bytes within the string that ARG is accessing. The type of the
8355 offset will be `sizetype'. */
8358 string_constant (tree arg, tree *ptr_offset)
8363 if (TREE_CODE (arg) == ADDR_EXPR)
8365 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
8367 *ptr_offset = size_zero_node;
8368 return TREE_OPERAND (arg, 0);
8370 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
8372 array = TREE_OPERAND (arg, 0);
8373 offset = size_zero_node;
8375 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
8377 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
8378 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
8379 if (TREE_CODE (array) != STRING_CST
8380 && TREE_CODE (array) != VAR_DECL)
8386 else if (TREE_CODE (arg) == PLUS_EXPR)
8388 tree arg0 = TREE_OPERAND (arg, 0);
8389 tree arg1 = TREE_OPERAND (arg, 1);
8394 if (TREE_CODE (arg0) == ADDR_EXPR
8395 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
8396 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
8398 array = TREE_OPERAND (arg0, 0);
8401 else if (TREE_CODE (arg1) == ADDR_EXPR
8402 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
8403 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
8405 array = TREE_OPERAND (arg1, 0);
8414 if (TREE_CODE (array) == STRING_CST)
8416 *ptr_offset = convert (sizetype, offset);
8419 else if (TREE_CODE (array) == VAR_DECL)
8423 /* Variables initialized to string literals can be handled too. */
8424 if (DECL_INITIAL (array) == NULL_TREE
8425 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
8428 /* If they are read-only, non-volatile and bind locally. */
8429 if (! TREE_READONLY (array)
8430 || TREE_SIDE_EFFECTS (array)
8431 || ! targetm.binds_local_p (array))
8434 /* Avoid const char foo[4] = "abcde"; */
8435 if (DECL_SIZE_UNIT (array) == NULL_TREE
8436 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
8437 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
8438 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
8441 /* If variable is bigger than the string literal, OFFSET must be constant
8442 and inside of the bounds of the string literal. */
8443 offset = convert (sizetype, offset);
8444 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
8445 && (! host_integerp (offset, 1)
8446 || compare_tree_int (offset, length) >= 0))
8449 *ptr_offset = offset;
8450 return DECL_INITIAL (array);
8456 /* Generate code to calculate EXP using a store-flag instruction
8457 and return an rtx for the result. EXP is either a comparison
8458 or a TRUTH_NOT_EXPR whose operand is a comparison.
8460 If TARGET is nonzero, store the result there if convenient.
8462 If ONLY_CHEAP is nonzero, only do this if it is likely to be very
8465 Return zero if there is no suitable set-flag instruction
8466 available on this machine.
8468 Once expand_expr has been called on the arguments of the comparison,
8469 we are committed to doing the store flag, since it is not safe to
8470 re-evaluate the expression. We emit the store-flag insn by calling
8471 emit_store_flag, but only expand the arguments if we have a reason
8472 to believe that emit_store_flag will be successful. If we think that
8473 it will, but it isn't, we have to simulate the store-flag with a
8474 set/jump/set sequence. */
8477 do_store_flag (tree exp, rtx target, enum machine_mode mode, int only_cheap)
8480 tree arg0, arg1, type;
8482 enum machine_mode operand_mode;
8486 enum insn_code icode;
8487 rtx subtarget = target;
8490 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
8491 result at the end. We can't simply invert the test since it would
8492 have already been inverted if it were valid. This case occurs for
8493 some floating-point comparisons. */
8495 if (TREE_CODE (exp) == TRUTH_NOT_EXPR)
8496 invert = 1, exp = TREE_OPERAND (exp, 0);
8498 arg0 = TREE_OPERAND (exp, 0);
8499 arg1 = TREE_OPERAND (exp, 1);
8501 /* Don't crash if the comparison was erroneous. */
8502 if (arg0 == error_mark_node || arg1 == error_mark_node)
8505 type = TREE_TYPE (arg0);
8506 operand_mode = TYPE_MODE (type);
8507 unsignedp = TYPE_UNSIGNED (type);
8509 /* We won't bother with BLKmode store-flag operations because it would mean
8510 passing a lot of information to emit_store_flag. */
8511 if (operand_mode == BLKmode)
8514 /* We won't bother with store-flag operations involving function pointers
8515 when function pointers must be canonicalized before comparisons. */
8516 #ifdef HAVE_canonicalize_funcptr_for_compare
8517 if (HAVE_canonicalize_funcptr_for_compare
8518 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
8519 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
8521 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
8522 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
8523 == FUNCTION_TYPE))))
8530 /* Get the rtx comparison code to use. We know that EXP is a comparison
8531 operation of some type. Some comparisons against 1 and -1 can be
8532 converted to comparisons with zero. Do so here so that the tests
8533 below will be aware that we have a comparison with zero. These
8534 tests will not catch constants in the first operand, but constants
8535 are rarely passed as the first operand. */
8537 switch (TREE_CODE (exp))
8546 if (integer_onep (arg1))
8547 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
8549 code = unsignedp ? LTU : LT;
8552 if (! unsignedp && integer_all_onesp (arg1))
8553 arg1 = integer_zero_node, code = LT;
8555 code = unsignedp ? LEU : LE;
8558 if (! unsignedp && integer_all_onesp (arg1))
8559 arg1 = integer_zero_node, code = GE;
8561 code = unsignedp ? GTU : GT;
8564 if (integer_onep (arg1))
8565 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
8567 code = unsignedp ? GEU : GE;
8570 case UNORDERED_EXPR:
8599 /* Put a constant second. */
8600 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST)
8602 tem = arg0; arg0 = arg1; arg1 = tem;
8603 code = swap_condition (code);
8606 /* If this is an equality or inequality test of a single bit, we can
8607 do this by shifting the bit being tested to the low-order bit and
8608 masking the result with the constant 1. If the condition was EQ,
8609 we xor it with 1. This does not require an scc insn and is faster
8610 than an scc insn even if we have it.
8612 The code to make this transformation was moved into fold_single_bit_test,
8613 so we just call into the folder and expand its result. */
8615 if ((code == NE || code == EQ)
8616 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
8617 && integer_pow2p (TREE_OPERAND (arg0, 1)))
8619 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
8620 return expand_expr (fold_single_bit_test (code == NE ? NE_EXPR : EQ_EXPR,
8622 target, VOIDmode, EXPAND_NORMAL);
8625 /* Now see if we are likely to be able to do this. Return if not. */
8626 if (! can_compare_p (code, operand_mode, ccp_store_flag))
8629 icode = setcc_gen_code[(int) code];
8630 if (icode == CODE_FOR_nothing
8631 || (only_cheap && insn_data[(int) icode].operand[0].mode != mode))
8633 /* We can only do this if it is one of the special cases that
8634 can be handled without an scc insn. */
8635 if ((code == LT && integer_zerop (arg1))
8636 || (! only_cheap && code == GE && integer_zerop (arg1)))
8638 else if (BRANCH_COST >= 0
8639 && ! only_cheap && (code == NE || code == EQ)
8640 && TREE_CODE (type) != REAL_TYPE
8641 && ((abs_optab->handlers[(int) operand_mode].insn_code
8642 != CODE_FOR_nothing)
8643 || (ffs_optab->handlers[(int) operand_mode].insn_code
8644 != CODE_FOR_nothing)))
8650 if (! get_subtarget (target)
8651 || GET_MODE (subtarget) != operand_mode)
8654 expand_operands (arg0, arg1, subtarget, &op0, &op1, 0);
8657 target = gen_reg_rtx (mode);
8659 result = emit_store_flag (target, code, op0, op1,
8660 operand_mode, unsignedp, 1);
8665 result = expand_binop (mode, xor_optab, result, const1_rtx,
8666 result, 0, OPTAB_LIB_WIDEN);
8670 /* If this failed, we have to do this with set/compare/jump/set code. */
8672 || reg_mentioned_p (target, op0) || reg_mentioned_p (target, op1))
8673 target = gen_reg_rtx (GET_MODE (target));
8675 emit_move_insn (target, invert ? const0_rtx : const1_rtx);
8676 result = compare_from_rtx (op0, op1, code, unsignedp,
8677 operand_mode, NULL_RTX);
8678 if (GET_CODE (result) == CONST_INT)
8679 return (((result == const0_rtx && ! invert)
8680 || (result != const0_rtx && invert))
8681 ? const0_rtx : const1_rtx);
8683 /* The code of RESULT may not match CODE if compare_from_rtx
8684 decided to swap its operands and reverse the original code.
8686 We know that compare_from_rtx returns either a CONST_INT or
8687 a new comparison code, so it is safe to just extract the
8688 code from RESULT. */
8689 code = GET_CODE (result);
8691 label = gen_label_rtx ();
8692 gcc_assert (bcc_gen_fctn[(int) code]);
8694 emit_jump_insn ((*bcc_gen_fctn[(int) code]) (label));
8695 emit_move_insn (target, invert ? const1_rtx : const0_rtx);
8702 /* Stubs in case we haven't got a casesi insn. */
8704 # define HAVE_casesi 0
8705 # define gen_casesi(a, b, c, d, e) (0)
8706 # define CODE_FOR_casesi CODE_FOR_nothing
8709 /* If the machine does not have a case insn that compares the bounds,
8710 this means extra overhead for dispatch tables, which raises the
8711 threshold for using them. */
8712 #ifndef CASE_VALUES_THRESHOLD
8713 #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5)
8714 #endif /* CASE_VALUES_THRESHOLD */
8717 case_values_threshold (void)
8719 return CASE_VALUES_THRESHOLD;
8722 /* Attempt to generate a casesi instruction. Returns 1 if successful,
8723 0 otherwise (i.e. if there is no casesi instruction). */
8725 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
8726 rtx table_label ATTRIBUTE_UNUSED, rtx default_label)
8728 enum machine_mode index_mode = SImode;
8729 int index_bits = GET_MODE_BITSIZE (index_mode);
8730 rtx op1, op2, index;
8731 enum machine_mode op_mode;
8736 /* Convert the index to SImode. */
8737 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
8739 enum machine_mode omode = TYPE_MODE (index_type);
8740 rtx rangertx = expand_expr (range, NULL_RTX, VOIDmode, 0);
8742 /* We must handle the endpoints in the original mode. */
8743 index_expr = build2 (MINUS_EXPR, index_type,
8744 index_expr, minval);
8745 minval = integer_zero_node;
8746 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
8747 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
8748 omode, 1, default_label);
8749 /* Now we can safely truncate. */
8750 index = convert_to_mode (index_mode, index, 0);
8754 if (TYPE_MODE (index_type) != index_mode)
8756 index_expr = convert (lang_hooks.types.type_for_size
8757 (index_bits, 0), index_expr);
8758 index_type = TREE_TYPE (index_expr);
8761 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
8764 do_pending_stack_adjust ();
8766 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
8767 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
8769 index = copy_to_mode_reg (op_mode, index);
8771 op1 = expand_expr (minval, NULL_RTX, VOIDmode, 0);
8773 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
8774 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
8775 op1, TYPE_UNSIGNED (TREE_TYPE (minval)));
8776 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
8778 op1 = copy_to_mode_reg (op_mode, op1);
8780 op2 = expand_expr (range, NULL_RTX, VOIDmode, 0);
8782 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
8783 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
8784 op2, TYPE_UNSIGNED (TREE_TYPE (range)));
8785 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
8787 op2 = copy_to_mode_reg (op_mode, op2);
8789 emit_jump_insn (gen_casesi (index, op1, op2,
8790 table_label, default_label));
8794 /* Attempt to generate a tablejump instruction; same concept. */
8795 #ifndef HAVE_tablejump
8796 #define HAVE_tablejump 0
8797 #define gen_tablejump(x, y) (0)
8800 /* Subroutine of the next function.
8802 INDEX is the value being switched on, with the lowest value
8803 in the table already subtracted.
8804 MODE is its expected mode (needed if INDEX is constant).
8805 RANGE is the length of the jump table.
8806 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
8808 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
8809 index value is out of range. */
8812 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
8817 if (INTVAL (range) > cfun->max_jumptable_ents)
8818 cfun->max_jumptable_ents = INTVAL (range);
8820 /* Do an unsigned comparison (in the proper mode) between the index
8821 expression and the value which represents the length of the range.
8822 Since we just finished subtracting the lower bound of the range
8823 from the index expression, this comparison allows us to simultaneously
8824 check that the original index expression value is both greater than
8825 or equal to the minimum value of the range and less than or equal to
8826 the maximum value of the range. */
8828 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
8831 /* If index is in range, it must fit in Pmode.
8832 Convert to Pmode so we can index with it. */
8834 index = convert_to_mode (Pmode, index, 1);
8836 /* Don't let a MEM slip through, because then INDEX that comes
8837 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
8838 and break_out_memory_refs will go to work on it and mess it up. */
8839 #ifdef PIC_CASE_VECTOR_ADDRESS
8840 if (flag_pic && !REG_P (index))
8841 index = copy_to_mode_reg (Pmode, index);
8844 /* If flag_force_addr were to affect this address
8845 it could interfere with the tricky assumptions made
8846 about addresses that contain label-refs,
8847 which may be valid only very near the tablejump itself. */
8848 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
8849 GET_MODE_SIZE, because this indicates how large insns are. The other
8850 uses should all be Pmode, because they are addresses. This code
8851 could fail if addresses and insns are not the same size. */
8852 index = gen_rtx_PLUS (Pmode,
8853 gen_rtx_MULT (Pmode, index,
8854 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
8855 gen_rtx_LABEL_REF (Pmode, table_label));
8856 #ifdef PIC_CASE_VECTOR_ADDRESS
8858 index = PIC_CASE_VECTOR_ADDRESS (index);
8861 index = memory_address_noforce (CASE_VECTOR_MODE, index);
8862 temp = gen_reg_rtx (CASE_VECTOR_MODE);
8863 vector = gen_const_mem (CASE_VECTOR_MODE, index);
8864 convert_move (temp, vector, 0);
8866 emit_jump_insn (gen_tablejump (temp, table_label));
8868 /* If we are generating PIC code or if the table is PC-relative, the
8869 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
8870 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
8875 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
8876 rtx table_label, rtx default_label)
8880 if (! HAVE_tablejump)
8883 index_expr = fold (build2 (MINUS_EXPR, index_type,
8884 convert (index_type, index_expr),
8885 convert (index_type, minval)));
8886 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
8887 do_pending_stack_adjust ();
8889 do_tablejump (index, TYPE_MODE (index_type),
8890 convert_modes (TYPE_MODE (index_type),
8891 TYPE_MODE (TREE_TYPE (range)),
8892 expand_expr (range, NULL_RTX,
8894 TYPE_UNSIGNED (TREE_TYPE (range))),
8895 table_label, default_label);
8899 /* Nonzero if the mode is a valid vector mode for this architecture.
8900 This returns nonzero even if there is no hardware support for the
8901 vector mode, but we can emulate with narrower modes. */
8904 vector_mode_valid_p (enum machine_mode mode)
8906 enum mode_class class = GET_MODE_CLASS (mode);
8907 enum machine_mode innermode;
8909 /* Doh! What's going on? */
8910 if (class != MODE_VECTOR_INT
8911 && class != MODE_VECTOR_FLOAT)
8914 /* Hardware support. Woo hoo! */
8915 if (targetm.vector_mode_supported_p (mode))
8918 innermode = GET_MODE_INNER (mode);
8920 /* We should probably return 1 if requesting V4DI and we have no DI,
8921 but we have V2DI, but this is probably very unlikely. */
8923 /* If we have support for the inner mode, we can safely emulate it.
8924 We may not have V2DI, but me can emulate with a pair of DIs. */
8925 return targetm.scalar_mode_supported_p (innermode);
8928 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
8930 const_vector_from_tree (tree exp)
8935 enum machine_mode inner, mode;
8937 mode = TYPE_MODE (TREE_TYPE (exp));
8939 if (initializer_zerop (exp))
8940 return CONST0_RTX (mode);
8942 units = GET_MODE_NUNITS (mode);
8943 inner = GET_MODE_INNER (mode);
8945 v = rtvec_alloc (units);
8947 link = TREE_VECTOR_CST_ELTS (exp);
8948 for (i = 0; link; link = TREE_CHAIN (link), ++i)
8950 elt = TREE_VALUE (link);
8952 if (TREE_CODE (elt) == REAL_CST)
8953 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
8956 RTVEC_ELT (v, i) = immed_double_const (TREE_INT_CST_LOW (elt),
8957 TREE_INT_CST_HIGH (elt),
8961 /* Initialize remaining elements to 0. */
8962 for (; i < units; ++i)
8963 RTVEC_ELT (v, i) = CONST0_RTX (inner);
8965 return gen_rtx_CONST_VECTOR (mode, v);
8967 #include "gt-expr.h"