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, 2006, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
31 #include "hard-reg-set.h"
34 #include "insn-config.h"
35 #include "insn-attr.h"
36 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
43 #include "typeclass.h"
45 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "tree-pass.h"
50 #include "tree-flow.h"
54 #include "diagnostic.h"
55 #include "ssaexpand.h"
56 #include "target-globals.h"
58 /* Decide whether a function's arguments should be processed
59 from first to last or from last to first.
61 They should if the stack and args grow in opposite directions, but
62 only if we have push insns. */
66 #ifndef PUSH_ARGS_REVERSED
67 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
68 #define PUSH_ARGS_REVERSED /* If it's last to first. */
74 #ifndef STACK_PUSH_CODE
75 #ifdef STACK_GROWS_DOWNWARD
76 #define STACK_PUSH_CODE PRE_DEC
78 #define STACK_PUSH_CODE PRE_INC
83 /* If this is nonzero, we do not bother generating VOLATILE
84 around volatile memory references, and we are willing to
85 output indirect addresses. If cse is to follow, we reject
86 indirect addresses so a useful potential cse is generated;
87 if it is used only once, instruction combination will produce
88 the same indirect address eventually. */
91 /* This structure is used by move_by_pieces to describe the move to
93 struct move_by_pieces_d
102 int explicit_inc_from;
103 unsigned HOST_WIDE_INT len;
104 HOST_WIDE_INT offset;
108 /* This structure is used by store_by_pieces to describe the clear to
111 struct store_by_pieces_d
117 unsigned HOST_WIDE_INT len;
118 HOST_WIDE_INT offset;
119 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode);
124 static unsigned HOST_WIDE_INT move_by_pieces_ninsns (unsigned HOST_WIDE_INT,
127 static void move_by_pieces_1 (rtx (*) (rtx, ...), enum machine_mode,
128 struct move_by_pieces_d *);
129 static bool block_move_libcall_safe_for_call_parm (void);
130 static bool emit_block_move_via_movmem (rtx, rtx, rtx, unsigned, unsigned, HOST_WIDE_INT);
131 static tree emit_block_move_libcall_fn (int);
132 static void emit_block_move_via_loop (rtx, rtx, rtx, unsigned);
133 static rtx clear_by_pieces_1 (void *, HOST_WIDE_INT, enum machine_mode);
134 static void clear_by_pieces (rtx, unsigned HOST_WIDE_INT, unsigned int);
135 static void store_by_pieces_1 (struct store_by_pieces_d *, unsigned int);
136 static void store_by_pieces_2 (rtx (*) (rtx, ...), enum machine_mode,
137 struct store_by_pieces_d *);
138 static tree clear_storage_libcall_fn (int);
139 static rtx compress_float_constant (rtx, rtx);
140 static rtx get_subtarget (rtx);
141 static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
142 HOST_WIDE_INT, enum machine_mode,
143 tree, tree, int, alias_set_type);
144 static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
145 static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT, enum machine_mode,
146 tree, tree, alias_set_type, bool);
148 static unsigned HOST_WIDE_INT highest_pow2_factor_for_target (const_tree, const_tree);
150 static int is_aligning_offset (const_tree, const_tree);
151 static void expand_operands (tree, tree, rtx, rtx*, rtx*,
152 enum expand_modifier);
153 static rtx reduce_to_bit_field_precision (rtx, rtx, tree);
154 static rtx do_store_flag (sepops, rtx, enum machine_mode);
156 static void emit_single_push_insn (enum machine_mode, rtx, tree);
158 static void do_tablejump (rtx, enum machine_mode, rtx, rtx, rtx);
159 static rtx const_vector_from_tree (tree);
160 static void write_complex_part (rtx, rtx, bool);
162 /* This macro is used to determine whether move_by_pieces should be called
163 to perform a structure copy. */
164 #ifndef MOVE_BY_PIECES_P
165 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
166 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
167 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
170 /* This macro is used to determine whether clear_by_pieces should be
171 called to clear storage. */
172 #ifndef CLEAR_BY_PIECES_P
173 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
174 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
175 < (unsigned int) CLEAR_RATIO (optimize_insn_for_speed_p ()))
178 /* This macro is used to determine whether store_by_pieces should be
179 called to "memset" storage with byte values other than zero. */
180 #ifndef SET_BY_PIECES_P
181 #define SET_BY_PIECES_P(SIZE, ALIGN) \
182 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
183 < (unsigned int) SET_RATIO (optimize_insn_for_speed_p ()))
186 /* This macro is used to determine whether store_by_pieces should be
187 called to "memcpy" storage when the source is a constant string. */
188 #ifndef STORE_BY_PIECES_P
189 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
190 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
191 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
194 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
196 #ifndef SLOW_UNALIGNED_ACCESS
197 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
200 /* This is run to set up which modes can be used
201 directly in memory and to initialize the block move optab. It is run
202 at the beginning of compilation and when the target is reinitialized. */
205 init_expr_target (void)
208 enum machine_mode mode;
213 /* Try indexing by frame ptr and try by stack ptr.
214 It is known that on the Convex the stack ptr isn't a valid index.
215 With luck, one or the other is valid on any machine. */
216 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
217 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
219 /* A scratch register we can modify in-place below to avoid
220 useless RTL allocations. */
221 reg = gen_rtx_REG (VOIDmode, -1);
223 insn = rtx_alloc (INSN);
224 pat = gen_rtx_SET (VOIDmode, NULL_RTX, NULL_RTX);
225 PATTERN (insn) = pat;
227 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
228 mode = (enum machine_mode) ((int) mode + 1))
232 direct_load[(int) mode] = direct_store[(int) mode] = 0;
233 PUT_MODE (mem, mode);
234 PUT_MODE (mem1, mode);
235 PUT_MODE (reg, mode);
237 /* See if there is some register that can be used in this mode and
238 directly loaded or stored from memory. */
240 if (mode != VOIDmode && mode != BLKmode)
241 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
242 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
245 if (! HARD_REGNO_MODE_OK (regno, mode))
248 SET_REGNO (reg, regno);
251 SET_DEST (pat) = reg;
252 if (recog (pat, insn, &num_clobbers) >= 0)
253 direct_load[(int) mode] = 1;
255 SET_SRC (pat) = mem1;
256 SET_DEST (pat) = reg;
257 if (recog (pat, insn, &num_clobbers) >= 0)
258 direct_load[(int) mode] = 1;
261 SET_DEST (pat) = mem;
262 if (recog (pat, insn, &num_clobbers) >= 0)
263 direct_store[(int) mode] = 1;
266 SET_DEST (pat) = mem1;
267 if (recog (pat, insn, &num_clobbers) >= 0)
268 direct_store[(int) mode] = 1;
272 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
274 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
275 mode = GET_MODE_WIDER_MODE (mode))
277 enum machine_mode srcmode;
278 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
279 srcmode = GET_MODE_WIDER_MODE (srcmode))
283 ic = can_extend_p (mode, srcmode, 0);
284 if (ic == CODE_FOR_nothing)
287 PUT_MODE (mem, srcmode);
289 if ((*insn_data[ic].operand[1].predicate) (mem, srcmode))
290 float_extend_from_mem[mode][srcmode] = true;
295 /* This is run at the start of compiling a function. */
300 memset (&crtl->expr, 0, sizeof (crtl->expr));
303 /* Copy data from FROM to TO, where the machine modes are not the same.
304 Both modes may be integer, or both may be floating, or both may be
306 UNSIGNEDP should be nonzero if FROM is an unsigned type.
307 This causes zero-extension instead of sign-extension. */
310 convert_move (rtx to, rtx from, int unsignedp)
312 enum machine_mode to_mode = GET_MODE (to);
313 enum machine_mode from_mode = GET_MODE (from);
314 int to_real = SCALAR_FLOAT_MODE_P (to_mode);
315 int from_real = SCALAR_FLOAT_MODE_P (from_mode);
319 /* rtx code for making an equivalent value. */
320 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
321 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
324 gcc_assert (to_real == from_real);
325 gcc_assert (to_mode != BLKmode);
326 gcc_assert (from_mode != BLKmode);
328 /* If the source and destination are already the same, then there's
333 /* If FROM is a SUBREG that indicates that we have already done at least
334 the required extension, strip it. We don't handle such SUBREGs as
337 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
338 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
339 >= GET_MODE_SIZE (to_mode))
340 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
341 from = gen_lowpart (to_mode, from), from_mode = to_mode;
343 gcc_assert (GET_CODE (to) != SUBREG || !SUBREG_PROMOTED_VAR_P (to));
345 if (to_mode == from_mode
346 || (from_mode == VOIDmode && CONSTANT_P (from)))
348 emit_move_insn (to, from);
352 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
354 gcc_assert (GET_MODE_BITSIZE (from_mode) == GET_MODE_BITSIZE (to_mode));
356 if (VECTOR_MODE_P (to_mode))
357 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
359 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
361 emit_move_insn (to, from);
365 if (GET_CODE (to) == CONCAT && GET_CODE (from) == CONCAT)
367 convert_move (XEXP (to, 0), XEXP (from, 0), unsignedp);
368 convert_move (XEXP (to, 1), XEXP (from, 1), unsignedp);
377 gcc_assert ((GET_MODE_PRECISION (from_mode)
378 != GET_MODE_PRECISION (to_mode))
379 || (DECIMAL_FLOAT_MODE_P (from_mode)
380 != DECIMAL_FLOAT_MODE_P (to_mode)));
382 if (GET_MODE_PRECISION (from_mode) == GET_MODE_PRECISION (to_mode))
383 /* Conversion between decimal float and binary float, same size. */
384 tab = DECIMAL_FLOAT_MODE_P (from_mode) ? trunc_optab : sext_optab;
385 else if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode))
390 /* Try converting directly if the insn is supported. */
392 code = convert_optab_handler (tab, to_mode, from_mode);
393 if (code != CODE_FOR_nothing)
395 emit_unop_insn (code, to, from,
396 tab == sext_optab ? FLOAT_EXTEND : FLOAT_TRUNCATE);
400 /* Otherwise use a libcall. */
401 libcall = convert_optab_libfunc (tab, to_mode, from_mode);
403 /* Is this conversion implemented yet? */
404 gcc_assert (libcall);
407 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
409 insns = get_insns ();
411 emit_libcall_block (insns, to, value,
412 tab == trunc_optab ? gen_rtx_FLOAT_TRUNCATE (to_mode,
414 : gen_rtx_FLOAT_EXTEND (to_mode, from));
418 /* Handle pointer conversion. */ /* SPEE 900220. */
419 /* Targets are expected to provide conversion insns between PxImode and
420 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
421 if (GET_MODE_CLASS (to_mode) == MODE_PARTIAL_INT)
423 enum machine_mode full_mode
424 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode), MODE_INT);
426 gcc_assert (convert_optab_handler (trunc_optab, to_mode, full_mode)
427 != CODE_FOR_nothing);
429 if (full_mode != from_mode)
430 from = convert_to_mode (full_mode, from, unsignedp);
431 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, full_mode),
435 if (GET_MODE_CLASS (from_mode) == MODE_PARTIAL_INT)
438 enum machine_mode full_mode
439 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode), MODE_INT);
441 gcc_assert (convert_optab_handler (sext_optab, full_mode, from_mode)
442 != CODE_FOR_nothing);
444 if (to_mode == full_mode)
446 emit_unop_insn (convert_optab_handler (sext_optab, full_mode,
452 new_from = gen_reg_rtx (full_mode);
453 emit_unop_insn (convert_optab_handler (sext_optab, full_mode, from_mode),
454 new_from, from, UNKNOWN);
456 /* else proceed to integer conversions below. */
457 from_mode = full_mode;
461 /* Make sure both are fixed-point modes or both are not. */
462 gcc_assert (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode) ==
463 ALL_SCALAR_FIXED_POINT_MODE_P (to_mode));
464 if (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode))
466 /* If we widen from_mode to to_mode and they are in the same class,
467 we won't saturate the result.
468 Otherwise, always saturate the result to play safe. */
469 if (GET_MODE_CLASS (from_mode) == GET_MODE_CLASS (to_mode)
470 && GET_MODE_SIZE (from_mode) < GET_MODE_SIZE (to_mode))
471 expand_fixed_convert (to, from, 0, 0);
473 expand_fixed_convert (to, from, 0, 1);
477 /* Now both modes are integers. */
479 /* Handle expanding beyond a word. */
480 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
481 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
488 enum machine_mode lowpart_mode;
489 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
491 /* Try converting directly if the insn is supported. */
492 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
495 /* If FROM is a SUBREG, put it into a register. Do this
496 so that we always generate the same set of insns for
497 better cse'ing; if an intermediate assignment occurred,
498 we won't be doing the operation directly on the SUBREG. */
499 if (optimize > 0 && GET_CODE (from) == SUBREG)
500 from = force_reg (from_mode, from);
501 emit_unop_insn (code, to, from, equiv_code);
504 /* Next, try converting via full word. */
505 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
506 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
507 != CODE_FOR_nothing))
509 rtx word_to = gen_reg_rtx (word_mode);
512 if (reg_overlap_mentioned_p (to, from))
513 from = force_reg (from_mode, from);
516 convert_move (word_to, from, unsignedp);
517 emit_unop_insn (code, to, word_to, equiv_code);
521 /* No special multiword conversion insn; do it by hand. */
524 /* Since we will turn this into a no conflict block, we must ensure
525 that the source does not overlap the target. */
527 if (reg_overlap_mentioned_p (to, from))
528 from = force_reg (from_mode, from);
530 /* Get a copy of FROM widened to a word, if necessary. */
531 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
532 lowpart_mode = word_mode;
534 lowpart_mode = from_mode;
536 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
538 lowpart = gen_lowpart (lowpart_mode, to);
539 emit_move_insn (lowpart, lowfrom);
541 /* Compute the value to put in each remaining word. */
543 fill_value = const0_rtx;
545 fill_value = emit_store_flag (gen_reg_rtx (word_mode),
546 LT, lowfrom, const0_rtx,
549 /* Fill the remaining words. */
550 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
552 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
553 rtx subword = operand_subword (to, index, 1, to_mode);
555 gcc_assert (subword);
557 if (fill_value != subword)
558 emit_move_insn (subword, fill_value);
561 insns = get_insns ();
568 /* Truncating multi-word to a word or less. */
569 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
570 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
573 && ! MEM_VOLATILE_P (from)
574 && direct_load[(int) to_mode]
575 && ! mode_dependent_address_p (XEXP (from, 0)))
577 || GET_CODE (from) == SUBREG))
578 from = force_reg (from_mode, from);
579 convert_move (to, gen_lowpart (word_mode, from), 0);
583 /* Now follow all the conversions between integers
584 no more than a word long. */
586 /* For truncation, usually we can just refer to FROM in a narrower mode. */
587 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
588 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
589 GET_MODE_BITSIZE (from_mode)))
592 && ! MEM_VOLATILE_P (from)
593 && direct_load[(int) to_mode]
594 && ! mode_dependent_address_p (XEXP (from, 0)))
596 || GET_CODE (from) == SUBREG))
597 from = force_reg (from_mode, from);
598 if (REG_P (from) && REGNO (from) < FIRST_PSEUDO_REGISTER
599 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
600 from = copy_to_reg (from);
601 emit_move_insn (to, gen_lowpart (to_mode, from));
605 /* Handle extension. */
606 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
608 /* Convert directly if that works. */
609 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
612 emit_unop_insn (code, to, from, equiv_code);
617 enum machine_mode intermediate;
621 /* Search for a mode to convert via. */
622 for (intermediate = from_mode; intermediate != VOIDmode;
623 intermediate = GET_MODE_WIDER_MODE (intermediate))
624 if (((can_extend_p (to_mode, intermediate, unsignedp)
626 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
627 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
628 GET_MODE_BITSIZE (intermediate))))
629 && (can_extend_p (intermediate, from_mode, unsignedp)
630 != CODE_FOR_nothing))
632 convert_move (to, convert_to_mode (intermediate, from,
633 unsignedp), unsignedp);
637 /* No suitable intermediate mode.
638 Generate what we need with shifts. */
639 shift_amount = build_int_cst (NULL_TREE,
640 GET_MODE_BITSIZE (to_mode)
641 - GET_MODE_BITSIZE (from_mode));
642 from = gen_lowpart (to_mode, force_reg (from_mode, from));
643 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
645 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
648 emit_move_insn (to, tmp);
653 /* Support special truncate insns for certain modes. */
654 if (convert_optab_handler (trunc_optab, to_mode,
655 from_mode) != CODE_FOR_nothing)
657 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, from_mode),
662 /* Handle truncation of volatile memrefs, and so on;
663 the things that couldn't be truncated directly,
664 and for which there was no special instruction.
666 ??? Code above formerly short-circuited this, for most integer
667 mode pairs, with a force_reg in from_mode followed by a recursive
668 call to this routine. Appears always to have been wrong. */
669 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
671 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
672 emit_move_insn (to, temp);
676 /* Mode combination is not recognized. */
680 /* Return an rtx for a value that would result
681 from converting X to mode MODE.
682 Both X and MODE may be floating, or both integer.
683 UNSIGNEDP is nonzero if X is an unsigned value.
684 This can be done by referring to a part of X in place
685 or by copying to a new temporary with conversion. */
688 convert_to_mode (enum machine_mode mode, rtx x, int unsignedp)
690 return convert_modes (mode, VOIDmode, x, unsignedp);
693 /* Return an rtx for a value that would result
694 from converting X from mode OLDMODE to mode MODE.
695 Both modes may be floating, or both integer.
696 UNSIGNEDP is nonzero if X is an unsigned value.
698 This can be done by referring to a part of X in place
699 or by copying to a new temporary with conversion.
701 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
704 convert_modes (enum machine_mode mode, enum machine_mode oldmode, rtx x, int unsignedp)
708 /* If FROM is a SUBREG that indicates that we have already done at least
709 the required extension, strip it. */
711 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
712 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
713 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
714 x = gen_lowpart (mode, x);
716 if (GET_MODE (x) != VOIDmode)
717 oldmode = GET_MODE (x);
722 /* There is one case that we must handle specially: If we are converting
723 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
724 we are to interpret the constant as unsigned, gen_lowpart will do
725 the wrong if the constant appears negative. What we want to do is
726 make the high-order word of the constant zero, not all ones. */
728 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
729 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
730 && CONST_INT_P (x) && INTVAL (x) < 0)
732 double_int val = uhwi_to_double_int (INTVAL (x));
734 /* We need to zero extend VAL. */
735 if (oldmode != VOIDmode)
736 val = double_int_zext (val, GET_MODE_BITSIZE (oldmode));
738 return immed_double_int_const (val, mode);
741 /* We can do this with a gen_lowpart if both desired and current modes
742 are integer, and this is either a constant integer, a register, or a
743 non-volatile MEM. Except for the constant case where MODE is no
744 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
747 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
748 || (GET_MODE_CLASS (mode) == MODE_INT
749 && GET_MODE_CLASS (oldmode) == MODE_INT
750 && (GET_CODE (x) == CONST_DOUBLE
751 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
752 && ((MEM_P (x) && ! MEM_VOLATILE_P (x)
753 && direct_load[(int) mode])
755 && (! HARD_REGISTER_P (x)
756 || HARD_REGNO_MODE_OK (REGNO (x), mode))
757 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
758 GET_MODE_BITSIZE (GET_MODE (x)))))))))
760 /* ?? If we don't know OLDMODE, we have to assume here that
761 X does not need sign- or zero-extension. This may not be
762 the case, but it's the best we can do. */
763 if (CONST_INT_P (x) && oldmode != VOIDmode
764 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
766 HOST_WIDE_INT val = INTVAL (x);
767 int width = GET_MODE_BITSIZE (oldmode);
769 /* We must sign or zero-extend in this case. Start by
770 zero-extending, then sign extend if we need to. */
771 val &= ((HOST_WIDE_INT) 1 << width) - 1;
773 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
774 val |= (HOST_WIDE_INT) (-1) << width;
776 return gen_int_mode (val, mode);
779 return gen_lowpart (mode, x);
782 /* Converting from integer constant into mode is always equivalent to an
784 if (VECTOR_MODE_P (mode) && GET_MODE (x) == VOIDmode)
786 gcc_assert (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (oldmode));
787 return simplify_gen_subreg (mode, x, oldmode, 0);
790 temp = gen_reg_rtx (mode);
791 convert_move (temp, x, unsignedp);
795 /* Return the largest alignment we can use for doing a move (or store)
796 of MAX_PIECES. ALIGN is the largest alignment we could use. */
799 alignment_for_piecewise_move (unsigned int max_pieces, unsigned int align)
801 enum machine_mode tmode;
803 tmode = mode_for_size (max_pieces * BITS_PER_UNIT, MODE_INT, 1);
804 if (align >= GET_MODE_ALIGNMENT (tmode))
805 align = GET_MODE_ALIGNMENT (tmode);
808 enum machine_mode tmode, xmode;
810 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
812 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
813 if (GET_MODE_SIZE (tmode) > max_pieces
814 || SLOW_UNALIGNED_ACCESS (tmode, align))
817 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
823 /* Return the widest integer mode no wider than SIZE. If no such mode
824 can be found, return VOIDmode. */
826 static enum machine_mode
827 widest_int_mode_for_size (unsigned int size)
829 enum machine_mode tmode, mode = VOIDmode;
831 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
832 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
833 if (GET_MODE_SIZE (tmode) < size)
839 /* STORE_MAX_PIECES is the number of bytes at a time that we can
840 store efficiently. Due to internal GCC limitations, this is
841 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
842 for an immediate constant. */
844 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
846 /* Determine whether the LEN bytes can be moved by using several move
847 instructions. Return nonzero if a call to move_by_pieces should
851 can_move_by_pieces (unsigned HOST_WIDE_INT len,
852 unsigned int align ATTRIBUTE_UNUSED)
854 return MOVE_BY_PIECES_P (len, align);
857 /* Generate several move instructions to copy LEN bytes from block FROM to
858 block TO. (These are MEM rtx's with BLKmode).
860 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
861 used to push FROM to the stack.
863 ALIGN is maximum stack alignment we can assume.
865 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
866 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
870 move_by_pieces (rtx to, rtx from, unsigned HOST_WIDE_INT len,
871 unsigned int align, int endp)
873 struct move_by_pieces_d data;
874 enum machine_mode to_addr_mode, from_addr_mode
875 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (from));
876 rtx to_addr, from_addr = XEXP (from, 0);
877 unsigned int max_size = MOVE_MAX_PIECES + 1;
878 enum insn_code icode;
880 align = MIN (to ? MEM_ALIGN (to) : align, MEM_ALIGN (from));
883 data.from_addr = from_addr;
886 to_addr_mode = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
887 to_addr = XEXP (to, 0);
890 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
891 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
893 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
897 to_addr_mode = VOIDmode;
901 #ifdef STACK_GROWS_DOWNWARD
907 data.to_addr = to_addr;
910 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
911 || GET_CODE (from_addr) == POST_INC
912 || GET_CODE (from_addr) == POST_DEC);
914 data.explicit_inc_from = 0;
915 data.explicit_inc_to = 0;
916 if (data.reverse) data.offset = len;
919 /* If copying requires more than two move insns,
920 copy addresses to registers (to make displacements shorter)
921 and use post-increment if available. */
922 if (!(data.autinc_from && data.autinc_to)
923 && move_by_pieces_ninsns (len, align, max_size) > 2)
925 /* Find the mode of the largest move...
926 MODE might not be used depending on the definitions of the
927 USE_* macros below. */
928 enum machine_mode mode ATTRIBUTE_UNUSED
929 = widest_int_mode_for_size (max_size);
931 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
933 data.from_addr = copy_to_mode_reg (from_addr_mode,
934 plus_constant (from_addr, len));
935 data.autinc_from = 1;
936 data.explicit_inc_from = -1;
938 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
940 data.from_addr = copy_to_mode_reg (from_addr_mode, from_addr);
941 data.autinc_from = 1;
942 data.explicit_inc_from = 1;
944 if (!data.autinc_from && CONSTANT_P (from_addr))
945 data.from_addr = copy_to_mode_reg (from_addr_mode, from_addr);
946 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
948 data.to_addr = copy_to_mode_reg (to_addr_mode,
949 plus_constant (to_addr, len));
951 data.explicit_inc_to = -1;
953 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
955 data.to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
957 data.explicit_inc_to = 1;
959 if (!data.autinc_to && CONSTANT_P (to_addr))
960 data.to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
963 align = alignment_for_piecewise_move (MOVE_MAX_PIECES, align);
965 /* First move what we can in the largest integer mode, then go to
966 successively smaller modes. */
970 enum machine_mode mode = widest_int_mode_for_size (max_size);
972 if (mode == VOIDmode)
975 icode = optab_handler (mov_optab, mode);
976 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
977 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
979 max_size = GET_MODE_SIZE (mode);
982 /* The code above should have handled everything. */
983 gcc_assert (!data.len);
989 gcc_assert (!data.reverse);
994 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
995 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
997 data.to_addr = copy_to_mode_reg (to_addr_mode,
998 plus_constant (data.to_addr,
1001 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
1008 to1 = adjust_address (data.to, QImode, data.offset);
1016 /* Return number of insns required to move L bytes by pieces.
1017 ALIGN (in bits) is maximum alignment we can assume. */
1019 static unsigned HOST_WIDE_INT
1020 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l, unsigned int align,
1021 unsigned int max_size)
1023 unsigned HOST_WIDE_INT n_insns = 0;
1025 align = alignment_for_piecewise_move (MOVE_MAX_PIECES, align);
1027 while (max_size > 1)
1029 enum machine_mode mode;
1030 enum insn_code icode;
1032 mode = widest_int_mode_for_size (max_size);
1034 if (mode == VOIDmode)
1037 icode = optab_handler (mov_optab, mode);
1038 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1039 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1041 max_size = GET_MODE_SIZE (mode);
1048 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1049 with move instructions for mode MODE. GENFUN is the gen_... function
1050 to make a move insn for that mode. DATA has all the other info. */
1053 move_by_pieces_1 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
1054 struct move_by_pieces_d *data)
1056 unsigned int size = GET_MODE_SIZE (mode);
1057 rtx to1 = NULL_RTX, from1;
1059 while (data->len >= size)
1062 data->offset -= size;
1066 if (data->autinc_to)
1067 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1070 to1 = adjust_address (data->to, mode, data->offset);
1073 if (data->autinc_from)
1074 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1077 from1 = adjust_address (data->from, mode, data->offset);
1079 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1080 emit_insn (gen_add2_insn (data->to_addr,
1081 GEN_INT (-(HOST_WIDE_INT)size)));
1082 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1083 emit_insn (gen_add2_insn (data->from_addr,
1084 GEN_INT (-(HOST_WIDE_INT)size)));
1087 emit_insn ((*genfun) (to1, from1));
1090 #ifdef PUSH_ROUNDING
1091 emit_single_push_insn (mode, from1, NULL);
1097 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1098 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1099 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1100 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1102 if (! data->reverse)
1103 data->offset += size;
1109 /* Emit code to move a block Y to a block X. This may be done with
1110 string-move instructions, with multiple scalar move instructions,
1111 or with a library call.
1113 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1114 SIZE is an rtx that says how long they are.
1115 ALIGN is the maximum alignment we can assume they have.
1116 METHOD describes what kind of copy this is, and what mechanisms may be used.
1118 Return the address of the new block, if memcpy is called and returns it,
1122 emit_block_move_hints (rtx x, rtx y, rtx size, enum block_op_methods method,
1123 unsigned int expected_align, HOST_WIDE_INT expected_size)
1130 if (CONST_INT_P (size)
1131 && INTVAL (size) == 0)
1136 case BLOCK_OP_NORMAL:
1137 case BLOCK_OP_TAILCALL:
1138 may_use_call = true;
1141 case BLOCK_OP_CALL_PARM:
1142 may_use_call = block_move_libcall_safe_for_call_parm ();
1144 /* Make inhibit_defer_pop nonzero around the library call
1145 to force it to pop the arguments right away. */
1149 case BLOCK_OP_NO_LIBCALL:
1150 may_use_call = false;
1157 gcc_assert (MEM_P (x) && MEM_P (y));
1158 align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1159 gcc_assert (align >= BITS_PER_UNIT);
1161 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1162 block copy is more efficient for other large modes, e.g. DCmode. */
1163 x = adjust_address (x, BLKmode, 0);
1164 y = adjust_address (y, BLKmode, 0);
1166 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1167 can be incorrect is coming from __builtin_memcpy. */
1168 if (CONST_INT_P (size))
1170 x = shallow_copy_rtx (x);
1171 y = shallow_copy_rtx (y);
1172 set_mem_size (x, size);
1173 set_mem_size (y, size);
1176 if (CONST_INT_P (size) && MOVE_BY_PIECES_P (INTVAL (size), align))
1177 move_by_pieces (x, y, INTVAL (size), align, 0);
1178 else if (emit_block_move_via_movmem (x, y, size, align,
1179 expected_align, expected_size))
1181 else if (may_use_call
1182 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (x))
1183 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (y)))
1184 retval = emit_block_move_via_libcall (x, y, size,
1185 method == BLOCK_OP_TAILCALL);
1187 emit_block_move_via_loop (x, y, size, align);
1189 if (method == BLOCK_OP_CALL_PARM)
1196 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1198 return emit_block_move_hints (x, y, size, method, 0, -1);
1201 /* A subroutine of emit_block_move. Returns true if calling the
1202 block move libcall will not clobber any parameters which may have
1203 already been placed on the stack. */
1206 block_move_libcall_safe_for_call_parm (void)
1208 #if defined (REG_PARM_STACK_SPACE)
1212 /* If arguments are pushed on the stack, then they're safe. */
1216 /* If registers go on the stack anyway, any argument is sure to clobber
1217 an outgoing argument. */
1218 #if defined (REG_PARM_STACK_SPACE)
1219 fn = emit_block_move_libcall_fn (false);
1220 /* Avoid set but not used warning if *REG_PARM_STACK_SPACE doesn't
1221 depend on its argument. */
1223 if (OUTGOING_REG_PARM_STACK_SPACE ((!fn ? NULL_TREE : TREE_TYPE (fn)))
1224 && REG_PARM_STACK_SPACE (fn) != 0)
1228 /* If any argument goes in memory, then it might clobber an outgoing
1231 CUMULATIVE_ARGS args_so_far;
1234 fn = emit_block_move_libcall_fn (false);
1235 INIT_CUMULATIVE_ARGS (args_so_far, TREE_TYPE (fn), NULL_RTX, 0, 3);
1237 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1238 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1240 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1241 rtx tmp = targetm.calls.function_arg (&args_so_far, mode,
1243 if (!tmp || !REG_P (tmp))
1245 if (targetm.calls.arg_partial_bytes (&args_so_far, mode, NULL, 1))
1247 targetm.calls.function_arg_advance (&args_so_far, mode,
1254 /* A subroutine of emit_block_move. Expand a movmem pattern;
1255 return true if successful. */
1258 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align,
1259 unsigned int expected_align, HOST_WIDE_INT expected_size)
1261 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1262 int save_volatile_ok = volatile_ok;
1263 enum machine_mode mode;
1265 if (expected_align < align)
1266 expected_align = align;
1268 /* Since this is a move insn, we don't care about volatility. */
1271 /* Try the most limited insn first, because there's no point
1272 including more than one in the machine description unless
1273 the more limited one has some advantage. */
1275 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1276 mode = GET_MODE_WIDER_MODE (mode))
1278 enum insn_code code = direct_optab_handler (movmem_optab, mode);
1279 insn_operand_predicate_fn pred;
1281 if (code != CODE_FOR_nothing
1282 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1283 here because if SIZE is less than the mode mask, as it is
1284 returned by the macro, it will definitely be less than the
1285 actual mode mask. */
1286 && ((CONST_INT_P (size)
1287 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1288 <= (GET_MODE_MASK (mode) >> 1)))
1289 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1290 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1291 || (*pred) (x, BLKmode))
1292 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1293 || (*pred) (y, BLKmode))
1294 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1295 || (*pred) (opalign, VOIDmode)))
1298 rtx last = get_last_insn ();
1301 op2 = convert_to_mode (mode, size, 1);
1302 pred = insn_data[(int) code].operand[2].predicate;
1303 if (pred != 0 && ! (*pred) (op2, mode))
1304 op2 = copy_to_mode_reg (mode, op2);
1306 /* ??? When called via emit_block_move_for_call, it'd be
1307 nice if there were some way to inform the backend, so
1308 that it doesn't fail the expansion because it thinks
1309 emitting the libcall would be more efficient. */
1311 if (insn_data[(int) code].n_operands == 4)
1312 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1314 pat = GEN_FCN ((int) code) (x, y, op2, opalign,
1315 GEN_INT (expected_align
1317 GEN_INT (expected_size));
1321 volatile_ok = save_volatile_ok;
1325 delete_insns_since (last);
1329 volatile_ok = save_volatile_ok;
1333 /* A subroutine of emit_block_move. Expand a call to memcpy.
1334 Return the return value from memcpy, 0 otherwise. */
1337 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1339 rtx dst_addr, src_addr;
1340 tree call_expr, fn, src_tree, dst_tree, size_tree;
1341 enum machine_mode size_mode;
1344 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1345 pseudos. We can then place those new pseudos into a VAR_DECL and
1348 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1349 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1351 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1352 src_addr = convert_memory_address (ptr_mode, src_addr);
1354 dst_tree = make_tree (ptr_type_node, dst_addr);
1355 src_tree = make_tree (ptr_type_node, src_addr);
1357 size_mode = TYPE_MODE (sizetype);
1359 size = convert_to_mode (size_mode, size, 1);
1360 size = copy_to_mode_reg (size_mode, size);
1362 /* It is incorrect to use the libcall calling conventions to call
1363 memcpy in this context. This could be a user call to memcpy and
1364 the user may wish to examine the return value from memcpy. For
1365 targets where libcalls and normal calls have different conventions
1366 for returning pointers, we could end up generating incorrect code. */
1368 size_tree = make_tree (sizetype, size);
1370 fn = emit_block_move_libcall_fn (true);
1371 call_expr = build_call_expr (fn, 3, dst_tree, src_tree, size_tree);
1372 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1374 retval = expand_normal (call_expr);
1379 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1380 for the function we use for block copies. The first time FOR_CALL
1381 is true, we call assemble_external. */
1383 static GTY(()) tree block_move_fn;
1386 init_block_move_fn (const char *asmspec)
1392 fn = get_identifier ("memcpy");
1393 args = build_function_type_list (ptr_type_node, ptr_type_node,
1394 const_ptr_type_node, sizetype,
1397 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
1398 DECL_EXTERNAL (fn) = 1;
1399 TREE_PUBLIC (fn) = 1;
1400 DECL_ARTIFICIAL (fn) = 1;
1401 TREE_NOTHROW (fn) = 1;
1402 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
1403 DECL_VISIBILITY_SPECIFIED (fn) = 1;
1409 set_user_assembler_name (block_move_fn, asmspec);
1413 emit_block_move_libcall_fn (int for_call)
1415 static bool emitted_extern;
1418 init_block_move_fn (NULL);
1420 if (for_call && !emitted_extern)
1422 emitted_extern = true;
1423 make_decl_rtl (block_move_fn);
1424 assemble_external (block_move_fn);
1427 return block_move_fn;
1430 /* A subroutine of emit_block_move. Copy the data via an explicit
1431 loop. This is used only when libcalls are forbidden. */
1432 /* ??? It'd be nice to copy in hunks larger than QImode. */
1435 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1436 unsigned int align ATTRIBUTE_UNUSED)
1438 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1439 enum machine_mode x_addr_mode
1440 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (x));
1441 enum machine_mode y_addr_mode
1442 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (y));
1443 enum machine_mode iter_mode;
1445 iter_mode = GET_MODE (size);
1446 if (iter_mode == VOIDmode)
1447 iter_mode = word_mode;
1449 top_label = gen_label_rtx ();
1450 cmp_label = gen_label_rtx ();
1451 iter = gen_reg_rtx (iter_mode);
1453 emit_move_insn (iter, const0_rtx);
1455 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1456 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1457 do_pending_stack_adjust ();
1459 emit_jump (cmp_label);
1460 emit_label (top_label);
1462 tmp = convert_modes (x_addr_mode, iter_mode, iter, true);
1463 x_addr = gen_rtx_PLUS (x_addr_mode, x_addr, tmp);
1465 if (x_addr_mode != y_addr_mode)
1466 tmp = convert_modes (y_addr_mode, iter_mode, iter, true);
1467 y_addr = gen_rtx_PLUS (y_addr_mode, y_addr, tmp);
1469 x = change_address (x, QImode, x_addr);
1470 y = change_address (y, QImode, y_addr);
1472 emit_move_insn (x, y);
1474 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1475 true, OPTAB_LIB_WIDEN);
1477 emit_move_insn (iter, tmp);
1479 emit_label (cmp_label);
1481 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1485 /* Copy all or part of a value X into registers starting at REGNO.
1486 The number of registers to be filled is NREGS. */
1489 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1492 #ifdef HAVE_load_multiple
1500 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1501 x = validize_mem (force_const_mem (mode, x));
1503 /* See if the machine can do this with a load multiple insn. */
1504 #ifdef HAVE_load_multiple
1505 if (HAVE_load_multiple)
1507 last = get_last_insn ();
1508 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1516 delete_insns_since (last);
1520 for (i = 0; i < nregs; i++)
1521 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1522 operand_subword_force (x, i, mode));
1525 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1526 The number of registers to be filled is NREGS. */
1529 move_block_from_reg (int regno, rtx x, int nregs)
1536 /* See if the machine can do this with a store multiple insn. */
1537 #ifdef HAVE_store_multiple
1538 if (HAVE_store_multiple)
1540 rtx last = get_last_insn ();
1541 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1549 delete_insns_since (last);
1553 for (i = 0; i < nregs; i++)
1555 rtx tem = operand_subword (x, i, 1, BLKmode);
1559 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1563 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1564 ORIG, where ORIG is a non-consecutive group of registers represented by
1565 a PARALLEL. The clone is identical to the original except in that the
1566 original set of registers is replaced by a new set of pseudo registers.
1567 The new set has the same modes as the original set. */
1570 gen_group_rtx (rtx orig)
1575 gcc_assert (GET_CODE (orig) == PARALLEL);
1577 length = XVECLEN (orig, 0);
1578 tmps = XALLOCAVEC (rtx, length);
1580 /* Skip a NULL entry in first slot. */
1581 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1586 for (; i < length; i++)
1588 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1589 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1591 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1594 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1597 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1598 except that values are placed in TMPS[i], and must later be moved
1599 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1602 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1606 enum machine_mode m = GET_MODE (orig_src);
1608 gcc_assert (GET_CODE (dst) == PARALLEL);
1611 && !SCALAR_INT_MODE_P (m)
1612 && !MEM_P (orig_src)
1613 && GET_CODE (orig_src) != CONCAT)
1615 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1616 if (imode == BLKmode)
1617 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1619 src = gen_reg_rtx (imode);
1620 if (imode != BLKmode)
1621 src = gen_lowpart (GET_MODE (orig_src), src);
1622 emit_move_insn (src, orig_src);
1623 /* ...and back again. */
1624 if (imode != BLKmode)
1625 src = gen_lowpart (imode, src);
1626 emit_group_load_1 (tmps, dst, src, type, ssize);
1630 /* Check for a NULL entry, used to indicate that the parameter goes
1631 both on the stack and in registers. */
1632 if (XEXP (XVECEXP (dst, 0, 0), 0))
1637 /* Process the pieces. */
1638 for (i = start; i < XVECLEN (dst, 0); i++)
1640 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1641 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1642 unsigned int bytelen = GET_MODE_SIZE (mode);
1645 /* Handle trailing fragments that run over the size of the struct. */
1646 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1648 /* Arrange to shift the fragment to where it belongs.
1649 extract_bit_field loads to the lsb of the reg. */
1651 #ifdef BLOCK_REG_PADDING
1652 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1653 == (BYTES_BIG_ENDIAN ? upward : downward)
1658 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1659 bytelen = ssize - bytepos;
1660 gcc_assert (bytelen > 0);
1663 /* If we won't be loading directly from memory, protect the real source
1664 from strange tricks we might play; but make sure that the source can
1665 be loaded directly into the destination. */
1667 if (!MEM_P (orig_src)
1668 && (!CONSTANT_P (orig_src)
1669 || (GET_MODE (orig_src) != mode
1670 && GET_MODE (orig_src) != VOIDmode)))
1672 if (GET_MODE (orig_src) == VOIDmode)
1673 src = gen_reg_rtx (mode);
1675 src = gen_reg_rtx (GET_MODE (orig_src));
1677 emit_move_insn (src, orig_src);
1680 /* Optimize the access just a bit. */
1682 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1683 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1684 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1685 && bytelen == GET_MODE_SIZE (mode))
1687 tmps[i] = gen_reg_rtx (mode);
1688 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1690 else if (COMPLEX_MODE_P (mode)
1691 && GET_MODE (src) == mode
1692 && bytelen == GET_MODE_SIZE (mode))
1693 /* Let emit_move_complex do the bulk of the work. */
1695 else if (GET_CODE (src) == CONCAT)
1697 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1698 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1700 if ((bytepos == 0 && bytelen == slen0)
1701 || (bytepos != 0 && bytepos + bytelen <= slen))
1703 /* The following assumes that the concatenated objects all
1704 have the same size. In this case, a simple calculation
1705 can be used to determine the object and the bit field
1707 tmps[i] = XEXP (src, bytepos / slen0);
1708 if (! CONSTANT_P (tmps[i])
1709 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1710 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1711 (bytepos % slen0) * BITS_PER_UNIT,
1712 1, false, NULL_RTX, mode, mode);
1718 gcc_assert (!bytepos);
1719 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1720 emit_move_insn (mem, src);
1721 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1722 0, 1, false, NULL_RTX, mode, mode);
1725 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1726 SIMD register, which is currently broken. While we get GCC
1727 to emit proper RTL for these cases, let's dump to memory. */
1728 else if (VECTOR_MODE_P (GET_MODE (dst))
1731 int slen = GET_MODE_SIZE (GET_MODE (src));
1734 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1735 emit_move_insn (mem, src);
1736 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1738 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1739 && XVECLEN (dst, 0) > 1)
1740 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1741 else if (CONSTANT_P (src))
1743 HOST_WIDE_INT len = (HOST_WIDE_INT) bytelen;
1751 gcc_assert (2 * len == ssize);
1752 split_double (src, &first, &second);
1759 else if (REG_P (src) && GET_MODE (src) == mode)
1762 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1763 bytepos * BITS_PER_UNIT, 1, false, NULL_RTX,
1767 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1768 build_int_cst (NULL_TREE, shift), tmps[i], 0);
1772 /* Emit code to move a block SRC of type TYPE to a block DST,
1773 where DST is non-consecutive registers represented by a PARALLEL.
1774 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1778 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1783 tmps = XALLOCAVEC (rtx, XVECLEN (dst, 0));
1784 emit_group_load_1 (tmps, dst, src, type, ssize);
1786 /* Copy the extracted pieces into the proper (probable) hard regs. */
1787 for (i = 0; i < XVECLEN (dst, 0); i++)
1789 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1792 emit_move_insn (d, tmps[i]);
1796 /* Similar, but load SRC into new pseudos in a format that looks like
1797 PARALLEL. This can later be fed to emit_group_move to get things
1798 in the right place. */
1801 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1806 vec = rtvec_alloc (XVECLEN (parallel, 0));
1807 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1809 /* Convert the vector to look just like the original PARALLEL, except
1810 with the computed values. */
1811 for (i = 0; i < XVECLEN (parallel, 0); i++)
1813 rtx e = XVECEXP (parallel, 0, i);
1814 rtx d = XEXP (e, 0);
1818 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1819 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1821 RTVEC_ELT (vec, i) = e;
1824 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1827 /* Emit code to move a block SRC to block DST, where SRC and DST are
1828 non-consecutive groups of registers, each represented by a PARALLEL. */
1831 emit_group_move (rtx dst, rtx src)
1835 gcc_assert (GET_CODE (src) == PARALLEL
1836 && GET_CODE (dst) == PARALLEL
1837 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1839 /* Skip first entry if NULL. */
1840 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1841 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1842 XEXP (XVECEXP (src, 0, i), 0));
1845 /* Move a group of registers represented by a PARALLEL into pseudos. */
1848 emit_group_move_into_temps (rtx src)
1850 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1853 for (i = 0; i < XVECLEN (src, 0); i++)
1855 rtx e = XVECEXP (src, 0, i);
1856 rtx d = XEXP (e, 0);
1859 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1860 RTVEC_ELT (vec, i) = e;
1863 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1866 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1867 where SRC is non-consecutive registers represented by a PARALLEL.
1868 SSIZE represents the total size of block ORIG_DST, or -1 if not
1872 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1875 int start, finish, i;
1876 enum machine_mode m = GET_MODE (orig_dst);
1878 gcc_assert (GET_CODE (src) == PARALLEL);
1880 if (!SCALAR_INT_MODE_P (m)
1881 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1883 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1884 if (imode == BLKmode)
1885 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1887 dst = gen_reg_rtx (imode);
1888 emit_group_store (dst, src, type, ssize);
1889 if (imode != BLKmode)
1890 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1891 emit_move_insn (orig_dst, dst);
1895 /* Check for a NULL entry, used to indicate that the parameter goes
1896 both on the stack and in registers. */
1897 if (XEXP (XVECEXP (src, 0, 0), 0))
1901 finish = XVECLEN (src, 0);
1903 tmps = XALLOCAVEC (rtx, finish);
1905 /* Copy the (probable) hard regs into pseudos. */
1906 for (i = start; i < finish; i++)
1908 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1909 if (!REG_P (reg) || REGNO (reg) < FIRST_PSEUDO_REGISTER)
1911 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1912 emit_move_insn (tmps[i], reg);
1918 /* If we won't be storing directly into memory, protect the real destination
1919 from strange tricks we might play. */
1921 if (GET_CODE (dst) == PARALLEL)
1925 /* We can get a PARALLEL dst if there is a conditional expression in
1926 a return statement. In that case, the dst and src are the same,
1927 so no action is necessary. */
1928 if (rtx_equal_p (dst, src))
1931 /* It is unclear if we can ever reach here, but we may as well handle
1932 it. Allocate a temporary, and split this into a store/load to/from
1935 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1936 emit_group_store (temp, src, type, ssize);
1937 emit_group_load (dst, temp, type, ssize);
1940 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1942 enum machine_mode outer = GET_MODE (dst);
1943 enum machine_mode inner;
1944 HOST_WIDE_INT bytepos;
1948 if (!REG_P (dst) || REGNO (dst) < FIRST_PSEUDO_REGISTER)
1949 dst = gen_reg_rtx (outer);
1951 /* Make life a bit easier for combine. */
1952 /* If the first element of the vector is the low part
1953 of the destination mode, use a paradoxical subreg to
1954 initialize the destination. */
1957 inner = GET_MODE (tmps[start]);
1958 bytepos = subreg_lowpart_offset (inner, outer);
1959 if (INTVAL (XEXP (XVECEXP (src, 0, start), 1)) == bytepos)
1961 temp = simplify_gen_subreg (outer, tmps[start],
1965 emit_move_insn (dst, temp);
1972 /* If the first element wasn't the low part, try the last. */
1974 && start < finish - 1)
1976 inner = GET_MODE (tmps[finish - 1]);
1977 bytepos = subreg_lowpart_offset (inner, outer);
1978 if (INTVAL (XEXP (XVECEXP (src, 0, finish - 1), 1)) == bytepos)
1980 temp = simplify_gen_subreg (outer, tmps[finish - 1],
1984 emit_move_insn (dst, temp);
1991 /* Otherwise, simply initialize the result to zero. */
1993 emit_move_insn (dst, CONST0_RTX (outer));
1996 /* Process the pieces. */
1997 for (i = start; i < finish; i++)
1999 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2000 enum machine_mode mode = GET_MODE (tmps[i]);
2001 unsigned int bytelen = GET_MODE_SIZE (mode);
2002 unsigned int adj_bytelen = bytelen;
2005 /* Handle trailing fragments that run over the size of the struct. */
2006 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2007 adj_bytelen = ssize - bytepos;
2009 if (GET_CODE (dst) == CONCAT)
2011 if (bytepos + adj_bytelen
2012 <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2013 dest = XEXP (dst, 0);
2014 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2016 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2017 dest = XEXP (dst, 1);
2021 enum machine_mode dest_mode = GET_MODE (dest);
2022 enum machine_mode tmp_mode = GET_MODE (tmps[i]);
2024 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
2026 if (GET_MODE_ALIGNMENT (dest_mode)
2027 >= GET_MODE_ALIGNMENT (tmp_mode))
2029 dest = assign_stack_temp (dest_mode,
2030 GET_MODE_SIZE (dest_mode),
2032 emit_move_insn (adjust_address (dest,
2040 dest = assign_stack_temp (tmp_mode,
2041 GET_MODE_SIZE (tmp_mode),
2043 emit_move_insn (dest, tmps[i]);
2044 dst = adjust_address (dest, dest_mode, bytepos);
2050 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2052 /* store_bit_field always takes its value from the lsb.
2053 Move the fragment to the lsb if it's not already there. */
2055 #ifdef BLOCK_REG_PADDING
2056 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
2057 == (BYTES_BIG_ENDIAN ? upward : downward)
2063 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2064 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
2065 build_int_cst (NULL_TREE, shift),
2068 bytelen = adj_bytelen;
2071 /* Optimize the access just a bit. */
2073 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
2074 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
2075 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2076 && bytelen == GET_MODE_SIZE (mode))
2077 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2079 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2083 /* Copy from the pseudo into the (probable) hard reg. */
2084 if (orig_dst != dst)
2085 emit_move_insn (orig_dst, dst);
2088 /* Generate code to copy a BLKmode object of TYPE out of a
2089 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2090 is null, a stack temporary is created. TGTBLK is returned.
2092 The purpose of this routine is to handle functions that return
2093 BLKmode structures in registers. Some machines (the PA for example)
2094 want to return all small structures in registers regardless of the
2095 structure's alignment. */
2098 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
2100 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2101 rtx src = NULL, dst = NULL;
2102 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2103 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
2104 enum machine_mode copy_mode;
2108 tgtblk = assign_temp (build_qualified_type (type,
2110 | TYPE_QUAL_CONST)),
2112 preserve_temp_slots (tgtblk);
2115 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2116 into a new pseudo which is a full word. */
2118 if (GET_MODE (srcreg) != BLKmode
2119 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2120 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
2122 /* If the structure doesn't take up a whole number of words, see whether
2123 SRCREG is padded on the left or on the right. If it's on the left,
2124 set PADDING_CORRECTION to the number of bits to skip.
2126 In most ABIs, the structure will be returned at the least end of
2127 the register, which translates to right padding on little-endian
2128 targets and left padding on big-endian targets. The opposite
2129 holds if the structure is returned at the most significant
2130 end of the register. */
2131 if (bytes % UNITS_PER_WORD != 0
2132 && (targetm.calls.return_in_msb (type)
2134 : BYTES_BIG_ENDIAN))
2136 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2138 /* Copy the structure BITSIZE bits at a time. If the target lives in
2139 memory, take care of not reading/writing past its end by selecting
2140 a copy mode suited to BITSIZE. This should always be possible given
2143 We could probably emit more efficient code for machines which do not use
2144 strict alignment, but it doesn't seem worth the effort at the current
2147 copy_mode = word_mode;
2150 enum machine_mode mem_mode = mode_for_size (bitsize, MODE_INT, 1);
2151 if (mem_mode != BLKmode)
2152 copy_mode = mem_mode;
2155 for (bitpos = 0, xbitpos = padding_correction;
2156 bitpos < bytes * BITS_PER_UNIT;
2157 bitpos += bitsize, xbitpos += bitsize)
2159 /* We need a new source operand each time xbitpos is on a
2160 word boundary and when xbitpos == padding_correction
2161 (the first time through). */
2162 if (xbitpos % BITS_PER_WORD == 0
2163 || xbitpos == padding_correction)
2164 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2167 /* We need a new destination operand each time bitpos is on
2169 if (bitpos % BITS_PER_WORD == 0)
2170 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2172 /* Use xbitpos for the source extraction (right justified) and
2173 bitpos for the destination store (left justified). */
2174 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, copy_mode,
2175 extract_bit_field (src, bitsize,
2176 xbitpos % BITS_PER_WORD, 1, false,
2177 NULL_RTX, copy_mode, copy_mode));
2183 /* Copy BLKmode value SRC into a register of mode MODE. Return the
2184 register if it contains any data, otherwise return null.
2186 This is used on targets that return BLKmode values in registers. */
2189 copy_blkmode_to_reg (enum machine_mode mode, tree src)
2192 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0, bytes;
2193 unsigned int bitsize;
2194 rtx *dst_words, dst, x, src_word = NULL_RTX, dst_word = NULL_RTX;
2195 enum machine_mode dst_mode;
2197 gcc_assert (TYPE_MODE (TREE_TYPE (src)) == BLKmode);
2199 x = expand_normal (src);
2201 bytes = int_size_in_bytes (TREE_TYPE (src));
2205 /* If the structure doesn't take up a whole number of words, see
2206 whether the register value should be padded on the left or on
2207 the right. Set PADDING_CORRECTION to the number of padding
2208 bits needed on the left side.
2210 In most ABIs, the structure will be returned at the least end of
2211 the register, which translates to right padding on little-endian
2212 targets and left padding on big-endian targets. The opposite
2213 holds if the structure is returned at the most significant
2214 end of the register. */
2215 if (bytes % UNITS_PER_WORD != 0
2216 && (targetm.calls.return_in_msb (TREE_TYPE (src))
2218 : BYTES_BIG_ENDIAN))
2219 padding_correction = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD)
2222 n_regs = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD;
2223 dst_words = XALLOCAVEC (rtx, n_regs);
2224 bitsize = MIN (TYPE_ALIGN (TREE_TYPE (src)), BITS_PER_WORD);
2226 /* Copy the structure BITSIZE bits at a time. */
2227 for (bitpos = 0, xbitpos = padding_correction;
2228 bitpos < bytes * BITS_PER_UNIT;
2229 bitpos += bitsize, xbitpos += bitsize)
2231 /* We need a new destination pseudo each time xbitpos is
2232 on a word boundary and when xbitpos == padding_correction
2233 (the first time through). */
2234 if (xbitpos % BITS_PER_WORD == 0
2235 || xbitpos == padding_correction)
2237 /* Generate an appropriate register. */
2238 dst_word = gen_reg_rtx (word_mode);
2239 dst_words[xbitpos / BITS_PER_WORD] = dst_word;
2241 /* Clear the destination before we move anything into it. */
2242 emit_move_insn (dst_word, CONST0_RTX (word_mode));
2245 /* We need a new source operand each time bitpos is on a word
2247 if (bitpos % BITS_PER_WORD == 0)
2248 src_word = operand_subword_force (x, bitpos / BITS_PER_WORD, BLKmode);
2250 /* Use bitpos for the source extraction (left justified) and
2251 xbitpos for the destination store (right justified). */
2252 store_bit_field (dst_word, bitsize, xbitpos % BITS_PER_WORD, word_mode,
2253 extract_bit_field (src_word, bitsize,
2254 bitpos % BITS_PER_WORD, 1, false,
2255 NULL_RTX, word_mode, word_mode));
2258 if (mode == BLKmode)
2260 /* Find the smallest integer mode large enough to hold the
2261 entire structure. */
2262 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2264 mode = GET_MODE_WIDER_MODE (mode))
2265 /* Have we found a large enough mode? */
2266 if (GET_MODE_SIZE (mode) >= bytes)
2269 /* A suitable mode should have been found. */
2270 gcc_assert (mode != VOIDmode);
2273 if (GET_MODE_SIZE (mode) < GET_MODE_SIZE (word_mode))
2274 dst_mode = word_mode;
2277 dst = gen_reg_rtx (dst_mode);
2279 for (i = 0; i < n_regs; i++)
2280 emit_move_insn (operand_subword (dst, i, 0, dst_mode), dst_words[i]);
2282 if (mode != dst_mode)
2283 dst = gen_lowpart (mode, dst);
2288 /* Add a USE expression for REG to the (possibly empty) list pointed
2289 to by CALL_FUSAGE. REG must denote a hard register. */
2292 use_reg (rtx *call_fusage, rtx reg)
2294 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2297 = gen_rtx_EXPR_LIST (VOIDmode,
2298 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2301 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2302 starting at REGNO. All of these registers must be hard registers. */
2305 use_regs (rtx *call_fusage, int regno, int nregs)
2309 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2311 for (i = 0; i < nregs; i++)
2312 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2315 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2316 PARALLEL REGS. This is for calls that pass values in multiple
2317 non-contiguous locations. The Irix 6 ABI has examples of this. */
2320 use_group_regs (rtx *call_fusage, rtx regs)
2324 for (i = 0; i < XVECLEN (regs, 0); i++)
2326 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2328 /* A NULL entry means the parameter goes both on the stack and in
2329 registers. This can also be a MEM for targets that pass values
2330 partially on the stack and partially in registers. */
2331 if (reg != 0 && REG_P (reg))
2332 use_reg (call_fusage, reg);
2336 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2337 assigment and the code of the expresion on the RHS is CODE. Return
2341 get_def_for_expr (tree name, enum tree_code code)
2345 if (TREE_CODE (name) != SSA_NAME)
2348 def_stmt = get_gimple_for_ssa_name (name);
2350 || gimple_assign_rhs_code (def_stmt) != code)
2357 /* Determine whether the LEN bytes generated by CONSTFUN can be
2358 stored to memory using several move instructions. CONSTFUNDATA is
2359 a pointer which will be passed as argument in every CONSTFUN call.
2360 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2361 a memset operation and false if it's a copy of a constant string.
2362 Return nonzero if a call to store_by_pieces should succeed. */
2365 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2366 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2367 void *constfundata, unsigned int align, bool memsetp)
2369 unsigned HOST_WIDE_INT l;
2370 unsigned int max_size;
2371 HOST_WIDE_INT offset = 0;
2372 enum machine_mode mode;
2373 enum insn_code icode;
2375 /* cst is set but not used if LEGITIMATE_CONSTANT doesn't use it. */
2376 rtx cst ATTRIBUTE_UNUSED;
2382 ? SET_BY_PIECES_P (len, align)
2383 : STORE_BY_PIECES_P (len, align)))
2386 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2388 /* We would first store what we can in the largest integer mode, then go to
2389 successively smaller modes. */
2392 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2396 max_size = STORE_MAX_PIECES + 1;
2397 while (max_size > 1)
2399 mode = widest_int_mode_for_size (max_size);
2401 if (mode == VOIDmode)
2404 icode = optab_handler (mov_optab, mode);
2405 if (icode != CODE_FOR_nothing
2406 && align >= GET_MODE_ALIGNMENT (mode))
2408 unsigned int size = GET_MODE_SIZE (mode);
2415 cst = (*constfun) (constfundata, offset, mode);
2416 if (!LEGITIMATE_CONSTANT_P (cst))
2426 max_size = GET_MODE_SIZE (mode);
2429 /* The code above should have handled everything. */
2436 /* Generate several move instructions to store LEN bytes generated by
2437 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2438 pointer which will be passed as argument in every CONSTFUN call.
2439 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2440 a memset operation and false if it's a copy of a constant string.
2441 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2442 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2446 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2447 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2448 void *constfundata, unsigned int align, bool memsetp, int endp)
2450 enum machine_mode to_addr_mode
2451 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
2452 struct store_by_pieces_d data;
2456 gcc_assert (endp != 2);
2461 ? SET_BY_PIECES_P (len, align)
2462 : STORE_BY_PIECES_P (len, align));
2463 data.constfun = constfun;
2464 data.constfundata = constfundata;
2467 store_by_pieces_1 (&data, align);
2472 gcc_assert (!data.reverse);
2477 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2478 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2480 data.to_addr = copy_to_mode_reg (to_addr_mode,
2481 plus_constant (data.to_addr,
2484 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2491 to1 = adjust_address (data.to, QImode, data.offset);
2499 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2500 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2503 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2505 struct store_by_pieces_d data;
2510 data.constfun = clear_by_pieces_1;
2511 data.constfundata = NULL;
2514 store_by_pieces_1 (&data, align);
2517 /* Callback routine for clear_by_pieces.
2518 Return const0_rtx unconditionally. */
2521 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2522 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2523 enum machine_mode mode ATTRIBUTE_UNUSED)
2528 /* Subroutine of clear_by_pieces and store_by_pieces.
2529 Generate several move instructions to store LEN bytes of block TO. (A MEM
2530 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2533 store_by_pieces_1 (struct store_by_pieces_d *data ATTRIBUTE_UNUSED,
2534 unsigned int align ATTRIBUTE_UNUSED)
2536 enum machine_mode to_addr_mode
2537 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (data->to));
2538 rtx to_addr = XEXP (data->to, 0);
2539 unsigned int max_size = STORE_MAX_PIECES + 1;
2540 enum insn_code icode;
2543 data->to_addr = to_addr;
2545 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2546 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2548 data->explicit_inc_to = 0;
2550 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2552 data->offset = data->len;
2554 /* If storing requires more than two move insns,
2555 copy addresses to registers (to make displacements shorter)
2556 and use post-increment if available. */
2557 if (!data->autinc_to
2558 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2560 /* Determine the main mode we'll be using.
2561 MODE might not be used depending on the definitions of the
2562 USE_* macros below. */
2563 enum machine_mode mode ATTRIBUTE_UNUSED
2564 = widest_int_mode_for_size (max_size);
2566 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2568 data->to_addr = copy_to_mode_reg (to_addr_mode,
2569 plus_constant (to_addr, data->len));
2570 data->autinc_to = 1;
2571 data->explicit_inc_to = -1;
2574 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2575 && ! data->autinc_to)
2577 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2578 data->autinc_to = 1;
2579 data->explicit_inc_to = 1;
2582 if ( !data->autinc_to && CONSTANT_P (to_addr))
2583 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2586 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2588 /* First store what we can in the largest integer mode, then go to
2589 successively smaller modes. */
2591 while (max_size > 1)
2593 enum machine_mode mode = widest_int_mode_for_size (max_size);
2595 if (mode == VOIDmode)
2598 icode = optab_handler (mov_optab, mode);
2599 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2600 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2602 max_size = GET_MODE_SIZE (mode);
2605 /* The code above should have handled everything. */
2606 gcc_assert (!data->len);
2609 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2610 with move instructions for mode MODE. GENFUN is the gen_... function
2611 to make a move insn for that mode. DATA has all the other info. */
2614 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2615 struct store_by_pieces_d *data)
2617 unsigned int size = GET_MODE_SIZE (mode);
2620 while (data->len >= size)
2623 data->offset -= size;
2625 if (data->autinc_to)
2626 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2629 to1 = adjust_address (data->to, mode, data->offset);
2631 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2632 emit_insn (gen_add2_insn (data->to_addr,
2633 GEN_INT (-(HOST_WIDE_INT) size)));
2635 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2636 emit_insn ((*genfun) (to1, cst));
2638 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2639 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2641 if (! data->reverse)
2642 data->offset += size;
2648 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2649 its length in bytes. */
2652 clear_storage_hints (rtx object, rtx size, enum block_op_methods method,
2653 unsigned int expected_align, HOST_WIDE_INT expected_size)
2655 enum machine_mode mode = GET_MODE (object);
2658 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2660 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2661 just move a zero. Otherwise, do this a piece at a time. */
2663 && CONST_INT_P (size)
2664 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2666 rtx zero = CONST0_RTX (mode);
2669 emit_move_insn (object, zero);
2673 if (COMPLEX_MODE_P (mode))
2675 zero = CONST0_RTX (GET_MODE_INNER (mode));
2678 write_complex_part (object, zero, 0);
2679 write_complex_part (object, zero, 1);
2685 if (size == const0_rtx)
2688 align = MEM_ALIGN (object);
2690 if (CONST_INT_P (size)
2691 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2692 clear_by_pieces (object, INTVAL (size), align);
2693 else if (set_storage_via_setmem (object, size, const0_rtx, align,
2694 expected_align, expected_size))
2696 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object)))
2697 return set_storage_via_libcall (object, size, const0_rtx,
2698 method == BLOCK_OP_TAILCALL);
2706 clear_storage (rtx object, rtx size, enum block_op_methods method)
2708 return clear_storage_hints (object, size, method, 0, -1);
2712 /* A subroutine of clear_storage. Expand a call to memset.
2713 Return the return value of memset, 0 otherwise. */
2716 set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
2718 tree call_expr, fn, object_tree, size_tree, val_tree;
2719 enum machine_mode size_mode;
2722 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2723 place those into new pseudos into a VAR_DECL and use them later. */
2725 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2727 size_mode = TYPE_MODE (sizetype);
2728 size = convert_to_mode (size_mode, size, 1);
2729 size = copy_to_mode_reg (size_mode, size);
2731 /* It is incorrect to use the libcall calling conventions to call
2732 memset in this context. This could be a user call to memset and
2733 the user may wish to examine the return value from memset. For
2734 targets where libcalls and normal calls have different conventions
2735 for returning pointers, we could end up generating incorrect code. */
2737 object_tree = make_tree (ptr_type_node, object);
2738 if (!CONST_INT_P (val))
2739 val = convert_to_mode (TYPE_MODE (integer_type_node), val, 1);
2740 size_tree = make_tree (sizetype, size);
2741 val_tree = make_tree (integer_type_node, val);
2743 fn = clear_storage_libcall_fn (true);
2744 call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
2745 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2747 retval = expand_normal (call_expr);
2752 /* A subroutine of set_storage_via_libcall. Create the tree node
2753 for the function we use for block clears. The first time FOR_CALL
2754 is true, we call assemble_external. */
2756 tree block_clear_fn;
2759 init_block_clear_fn (const char *asmspec)
2761 if (!block_clear_fn)
2765 fn = get_identifier ("memset");
2766 args = build_function_type_list (ptr_type_node, ptr_type_node,
2767 integer_type_node, sizetype,
2770 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
2771 DECL_EXTERNAL (fn) = 1;
2772 TREE_PUBLIC (fn) = 1;
2773 DECL_ARTIFICIAL (fn) = 1;
2774 TREE_NOTHROW (fn) = 1;
2775 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
2776 DECL_VISIBILITY_SPECIFIED (fn) = 1;
2778 block_clear_fn = fn;
2782 set_user_assembler_name (block_clear_fn, asmspec);
2786 clear_storage_libcall_fn (int for_call)
2788 static bool emitted_extern;
2790 if (!block_clear_fn)
2791 init_block_clear_fn (NULL);
2793 if (for_call && !emitted_extern)
2795 emitted_extern = true;
2796 make_decl_rtl (block_clear_fn);
2797 assemble_external (block_clear_fn);
2800 return block_clear_fn;
2803 /* Expand a setmem pattern; return true if successful. */
2806 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align,
2807 unsigned int expected_align, HOST_WIDE_INT expected_size)
2809 /* Try the most limited insn first, because there's no point
2810 including more than one in the machine description unless
2811 the more limited one has some advantage. */
2813 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2814 enum machine_mode mode;
2816 if (expected_align < align)
2817 expected_align = align;
2819 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2820 mode = GET_MODE_WIDER_MODE (mode))
2822 enum insn_code code = direct_optab_handler (setmem_optab, mode);
2823 insn_operand_predicate_fn pred;
2825 if (code != CODE_FOR_nothing
2826 /* We don't need MODE to be narrower than
2827 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2828 the mode mask, as it is returned by the macro, it will
2829 definitely be less than the actual mode mask. */
2830 && ((CONST_INT_P (size)
2831 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2832 <= (GET_MODE_MASK (mode) >> 1)))
2833 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2834 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2835 || (*pred) (object, BLKmode))
2836 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
2837 || (*pred) (opalign, VOIDmode)))
2840 enum machine_mode char_mode;
2841 rtx last = get_last_insn ();
2844 opsize = convert_to_mode (mode, size, 1);
2845 pred = insn_data[(int) code].operand[1].predicate;
2846 if (pred != 0 && ! (*pred) (opsize, mode))
2847 opsize = copy_to_mode_reg (mode, opsize);
2850 char_mode = insn_data[(int) code].operand[2].mode;
2851 if (char_mode != VOIDmode)
2853 opchar = convert_to_mode (char_mode, opchar, 1);
2854 pred = insn_data[(int) code].operand[2].predicate;
2855 if (pred != 0 && ! (*pred) (opchar, char_mode))
2856 opchar = copy_to_mode_reg (char_mode, opchar);
2859 if (insn_data[(int) code].n_operands == 4)
2860 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign);
2862 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign,
2863 GEN_INT (expected_align
2865 GEN_INT (expected_size));
2872 delete_insns_since (last);
2880 /* Write to one of the components of the complex value CPLX. Write VAL to
2881 the real part if IMAG_P is false, and the imaginary part if its true. */
2884 write_complex_part (rtx cplx, rtx val, bool imag_p)
2886 enum machine_mode cmode;
2887 enum machine_mode imode;
2890 if (GET_CODE (cplx) == CONCAT)
2892 emit_move_insn (XEXP (cplx, imag_p), val);
2896 cmode = GET_MODE (cplx);
2897 imode = GET_MODE_INNER (cmode);
2898 ibitsize = GET_MODE_BITSIZE (imode);
2900 /* For MEMs simplify_gen_subreg may generate an invalid new address
2901 because, e.g., the original address is considered mode-dependent
2902 by the target, which restricts simplify_subreg from invoking
2903 adjust_address_nv. Instead of preparing fallback support for an
2904 invalid address, we call adjust_address_nv directly. */
2907 emit_move_insn (adjust_address_nv (cplx, imode,
2908 imag_p ? GET_MODE_SIZE (imode) : 0),
2913 /* If the sub-object is at least word sized, then we know that subregging
2914 will work. This special case is important, since store_bit_field
2915 wants to operate on integer modes, and there's rarely an OImode to
2916 correspond to TCmode. */
2917 if (ibitsize >= BITS_PER_WORD
2918 /* For hard regs we have exact predicates. Assume we can split
2919 the original object if it spans an even number of hard regs.
2920 This special case is important for SCmode on 64-bit platforms
2921 where the natural size of floating-point regs is 32-bit. */
2923 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2924 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2926 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2927 imag_p ? GET_MODE_SIZE (imode) : 0);
2930 emit_move_insn (part, val);
2934 /* simplify_gen_subreg may fail for sub-word MEMs. */
2935 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2938 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2941 /* Extract one of the components of the complex value CPLX. Extract the
2942 real part if IMAG_P is false, and the imaginary part if it's true. */
2945 read_complex_part (rtx cplx, bool imag_p)
2947 enum machine_mode cmode, imode;
2950 if (GET_CODE (cplx) == CONCAT)
2951 return XEXP (cplx, imag_p);
2953 cmode = GET_MODE (cplx);
2954 imode = GET_MODE_INNER (cmode);
2955 ibitsize = GET_MODE_BITSIZE (imode);
2957 /* Special case reads from complex constants that got spilled to memory. */
2958 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2960 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2961 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2963 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2964 if (CONSTANT_CLASS_P (part))
2965 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2969 /* For MEMs simplify_gen_subreg may generate an invalid new address
2970 because, e.g., the original address is considered mode-dependent
2971 by the target, which restricts simplify_subreg from invoking
2972 adjust_address_nv. Instead of preparing fallback support for an
2973 invalid address, we call adjust_address_nv directly. */
2975 return adjust_address_nv (cplx, imode,
2976 imag_p ? GET_MODE_SIZE (imode) : 0);
2978 /* If the sub-object is at least word sized, then we know that subregging
2979 will work. This special case is important, since extract_bit_field
2980 wants to operate on integer modes, and there's rarely an OImode to
2981 correspond to TCmode. */
2982 if (ibitsize >= BITS_PER_WORD
2983 /* For hard regs we have exact predicates. Assume we can split
2984 the original object if it spans an even number of hard regs.
2985 This special case is important for SCmode on 64-bit platforms
2986 where the natural size of floating-point regs is 32-bit. */
2988 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2989 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2991 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2992 imag_p ? GET_MODE_SIZE (imode) : 0);
2996 /* simplify_gen_subreg may fail for sub-word MEMs. */
2997 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
3000 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
3001 true, false, NULL_RTX, imode, imode);
3004 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
3005 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
3006 represented in NEW_MODE. If FORCE is true, this will never happen, as
3007 we'll force-create a SUBREG if needed. */
3010 emit_move_change_mode (enum machine_mode new_mode,
3011 enum machine_mode old_mode, rtx x, bool force)
3015 if (push_operand (x, GET_MODE (x)))
3017 ret = gen_rtx_MEM (new_mode, XEXP (x, 0));
3018 MEM_COPY_ATTRIBUTES (ret, x);
3022 /* We don't have to worry about changing the address since the
3023 size in bytes is supposed to be the same. */
3024 if (reload_in_progress)
3026 /* Copy the MEM to change the mode and move any
3027 substitutions from the old MEM to the new one. */
3028 ret = adjust_address_nv (x, new_mode, 0);
3029 copy_replacements (x, ret);
3032 ret = adjust_address (x, new_mode, 0);
3036 /* Note that we do want simplify_subreg's behavior of validating
3037 that the new mode is ok for a hard register. If we were to use
3038 simplify_gen_subreg, we would create the subreg, but would
3039 probably run into the target not being able to implement it. */
3040 /* Except, of course, when FORCE is true, when this is exactly what
3041 we want. Which is needed for CCmodes on some targets. */
3043 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
3045 ret = simplify_subreg (new_mode, x, old_mode, 0);
3051 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
3052 an integer mode of the same size as MODE. Returns the instruction
3053 emitted, or NULL if such a move could not be generated. */
3056 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y, bool force)
3058 enum machine_mode imode;
3059 enum insn_code code;
3061 /* There must exist a mode of the exact size we require. */
3062 imode = int_mode_for_mode (mode);
3063 if (imode == BLKmode)
3066 /* The target must support moves in this mode. */
3067 code = optab_handler (mov_optab, imode);
3068 if (code == CODE_FOR_nothing)
3071 x = emit_move_change_mode (imode, mode, x, force);
3074 y = emit_move_change_mode (imode, mode, y, force);
3077 return emit_insn (GEN_FCN (code) (x, y));
3080 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
3081 Return an equivalent MEM that does not use an auto-increment. */
3084 emit_move_resolve_push (enum machine_mode mode, rtx x)
3086 enum rtx_code code = GET_CODE (XEXP (x, 0));
3087 HOST_WIDE_INT adjust;
3090 adjust = GET_MODE_SIZE (mode);
3091 #ifdef PUSH_ROUNDING
3092 adjust = PUSH_ROUNDING (adjust);
3094 if (code == PRE_DEC || code == POST_DEC)
3096 else if (code == PRE_MODIFY || code == POST_MODIFY)
3098 rtx expr = XEXP (XEXP (x, 0), 1);
3101 gcc_assert (GET_CODE (expr) == PLUS || GET_CODE (expr) == MINUS);
3102 gcc_assert (CONST_INT_P (XEXP (expr, 1)));
3103 val = INTVAL (XEXP (expr, 1));
3104 if (GET_CODE (expr) == MINUS)
3106 gcc_assert (adjust == val || adjust == -val);
3110 /* Do not use anti_adjust_stack, since we don't want to update
3111 stack_pointer_delta. */
3112 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
3113 GEN_INT (adjust), stack_pointer_rtx,
3114 0, OPTAB_LIB_WIDEN);
3115 if (temp != stack_pointer_rtx)
3116 emit_move_insn (stack_pointer_rtx, temp);
3123 temp = stack_pointer_rtx;
3128 temp = plus_constant (stack_pointer_rtx, -adjust);
3134 return replace_equiv_address (x, temp);
3137 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3138 X is known to satisfy push_operand, and MODE is known to be complex.
3139 Returns the last instruction emitted. */
3142 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
3144 enum machine_mode submode = GET_MODE_INNER (mode);
3147 #ifdef PUSH_ROUNDING
3148 unsigned int submodesize = GET_MODE_SIZE (submode);
3150 /* In case we output to the stack, but the size is smaller than the
3151 machine can push exactly, we need to use move instructions. */
3152 if (PUSH_ROUNDING (submodesize) != submodesize)
3154 x = emit_move_resolve_push (mode, x);
3155 return emit_move_insn (x, y);
3159 /* Note that the real part always precedes the imag part in memory
3160 regardless of machine's endianness. */
3161 switch (GET_CODE (XEXP (x, 0)))
3175 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3176 read_complex_part (y, imag_first));
3177 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3178 read_complex_part (y, !imag_first));
3181 /* A subroutine of emit_move_complex. Perform the move from Y to X
3182 via two moves of the parts. Returns the last instruction emitted. */
3185 emit_move_complex_parts (rtx x, rtx y)
3187 /* Show the output dies here. This is necessary for SUBREGs
3188 of pseudos since we cannot track their lifetimes correctly;
3189 hard regs shouldn't appear here except as return values. */
3190 if (!reload_completed && !reload_in_progress
3191 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
3194 write_complex_part (x, read_complex_part (y, false), false);
3195 write_complex_part (x, read_complex_part (y, true), true);
3197 return get_last_insn ();
3200 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3201 MODE is known to be complex. Returns the last instruction emitted. */
3204 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
3208 /* Need to take special care for pushes, to maintain proper ordering
3209 of the data, and possibly extra padding. */
3210 if (push_operand (x, mode))
3211 return emit_move_complex_push (mode, x, y);
3213 /* See if we can coerce the target into moving both values at once. */
3215 /* Move floating point as parts. */
3216 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
3217 && optab_handler (mov_optab, GET_MODE_INNER (mode)) != CODE_FOR_nothing)
3219 /* Not possible if the values are inherently not adjacent. */
3220 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
3222 /* Is possible if both are registers (or subregs of registers). */
3223 else if (register_operand (x, mode) && register_operand (y, mode))
3225 /* If one of the operands is a memory, and alignment constraints
3226 are friendly enough, we may be able to do combined memory operations.
3227 We do not attempt this if Y is a constant because that combination is
3228 usually better with the by-parts thing below. */
3229 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
3230 && (!STRICT_ALIGNMENT
3231 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
3240 /* For memory to memory moves, optimal behavior can be had with the
3241 existing block move logic. */
3242 if (MEM_P (x) && MEM_P (y))
3244 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
3245 BLOCK_OP_NO_LIBCALL);
3246 return get_last_insn ();
3249 ret = emit_move_via_integer (mode, x, y, true);
3254 return emit_move_complex_parts (x, y);
3257 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3258 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3261 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
3265 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3268 enum insn_code code = optab_handler (mov_optab, CCmode);
3269 if (code != CODE_FOR_nothing)
3271 x = emit_move_change_mode (CCmode, mode, x, true);
3272 y = emit_move_change_mode (CCmode, mode, y, true);
3273 return emit_insn (GEN_FCN (code) (x, y));
3277 /* Otherwise, find the MODE_INT mode of the same width. */
3278 ret = emit_move_via_integer (mode, x, y, false);
3279 gcc_assert (ret != NULL);
3283 /* Return true if word I of OP lies entirely in the
3284 undefined bits of a paradoxical subreg. */
3287 undefined_operand_subword_p (const_rtx op, int i)
3289 enum machine_mode innermode, innermostmode;
3291 if (GET_CODE (op) != SUBREG)
3293 innermode = GET_MODE (op);
3294 innermostmode = GET_MODE (SUBREG_REG (op));
3295 offset = i * UNITS_PER_WORD + SUBREG_BYTE (op);
3296 /* The SUBREG_BYTE represents offset, as if the value were stored in
3297 memory, except for a paradoxical subreg where we define
3298 SUBREG_BYTE to be 0; undo this exception as in
3300 if (SUBREG_BYTE (op) == 0
3301 && GET_MODE_SIZE (innermostmode) < GET_MODE_SIZE (innermode))
3303 int difference = (GET_MODE_SIZE (innermostmode) - GET_MODE_SIZE (innermode));
3304 if (WORDS_BIG_ENDIAN)
3305 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
3306 if (BYTES_BIG_ENDIAN)
3307 offset += difference % UNITS_PER_WORD;
3309 if (offset >= GET_MODE_SIZE (innermostmode)
3310 || offset <= -GET_MODE_SIZE (word_mode))
3315 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3316 MODE is any multi-word or full-word mode that lacks a move_insn
3317 pattern. Note that you will get better code if you define such
3318 patterns, even if they must turn into multiple assembler instructions. */
3321 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3328 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3330 /* If X is a push on the stack, do the push now and replace
3331 X with a reference to the stack pointer. */
3332 if (push_operand (x, mode))
3333 x = emit_move_resolve_push (mode, x);
3335 /* If we are in reload, see if either operand is a MEM whose address
3336 is scheduled for replacement. */
3337 if (reload_in_progress && MEM_P (x)
3338 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3339 x = replace_equiv_address_nv (x, inner);
3340 if (reload_in_progress && MEM_P (y)
3341 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3342 y = replace_equiv_address_nv (y, inner);
3346 need_clobber = false;
3348 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3351 rtx xpart = operand_subword (x, i, 1, mode);
3354 /* Do not generate code for a move if it would come entirely
3355 from the undefined bits of a paradoxical subreg. */
3356 if (undefined_operand_subword_p (y, i))
3359 ypart = operand_subword (y, i, 1, mode);
3361 /* If we can't get a part of Y, put Y into memory if it is a
3362 constant. Otherwise, force it into a register. Then we must
3363 be able to get a part of Y. */
3364 if (ypart == 0 && CONSTANT_P (y))
3366 y = use_anchored_address (force_const_mem (mode, y));
3367 ypart = operand_subword (y, i, 1, mode);
3369 else if (ypart == 0)
3370 ypart = operand_subword_force (y, i, mode);
3372 gcc_assert (xpart && ypart);
3374 need_clobber |= (GET_CODE (xpart) == SUBREG);
3376 last_insn = emit_move_insn (xpart, ypart);
3382 /* Show the output dies here. This is necessary for SUBREGs
3383 of pseudos since we cannot track their lifetimes correctly;
3384 hard regs shouldn't appear here except as return values.
3385 We never want to emit such a clobber after reload. */
3387 && ! (reload_in_progress || reload_completed)
3388 && need_clobber != 0)
3396 /* Low level part of emit_move_insn.
3397 Called just like emit_move_insn, but assumes X and Y
3398 are basically valid. */
3401 emit_move_insn_1 (rtx x, rtx y)
3403 enum machine_mode mode = GET_MODE (x);
3404 enum insn_code code;
3406 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3408 code = optab_handler (mov_optab, mode);
3409 if (code != CODE_FOR_nothing)
3410 return emit_insn (GEN_FCN (code) (x, y));
3412 /* Expand complex moves by moving real part and imag part. */
3413 if (COMPLEX_MODE_P (mode))
3414 return emit_move_complex (mode, x, y);
3416 if (GET_MODE_CLASS (mode) == MODE_DECIMAL_FLOAT
3417 || ALL_FIXED_POINT_MODE_P (mode))
3419 rtx result = emit_move_via_integer (mode, x, y, true);
3421 /* If we can't find an integer mode, use multi words. */
3425 return emit_move_multi_word (mode, x, y);
3428 if (GET_MODE_CLASS (mode) == MODE_CC)
3429 return emit_move_ccmode (mode, x, y);
3431 /* Try using a move pattern for the corresponding integer mode. This is
3432 only safe when simplify_subreg can convert MODE constants into integer
3433 constants. At present, it can only do this reliably if the value
3434 fits within a HOST_WIDE_INT. */
3435 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3437 rtx ret = emit_move_via_integer (mode, x, y, false);
3442 return emit_move_multi_word (mode, x, y);
3445 /* Generate code to copy Y into X.
3446 Both Y and X must have the same mode, except that
3447 Y can be a constant with VOIDmode.
3448 This mode cannot be BLKmode; use emit_block_move for that.
3450 Return the last instruction emitted. */
3453 emit_move_insn (rtx x, rtx y)
3455 enum machine_mode mode = GET_MODE (x);
3456 rtx y_cst = NULL_RTX;
3459 gcc_assert (mode != BLKmode
3460 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3465 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3466 && (last_insn = compress_float_constant (x, y)))
3471 if (!LEGITIMATE_CONSTANT_P (y))
3473 y = force_const_mem (mode, y);
3475 /* If the target's cannot_force_const_mem prevented the spill,
3476 assume that the target's move expanders will also take care
3477 of the non-legitimate constant. */
3481 y = use_anchored_address (y);
3485 /* If X or Y are memory references, verify that their addresses are valid
3488 && (! memory_address_addr_space_p (GET_MODE (x), XEXP (x, 0),
3490 && ! push_operand (x, GET_MODE (x))))
3491 x = validize_mem (x);
3494 && ! memory_address_addr_space_p (GET_MODE (y), XEXP (y, 0),
3495 MEM_ADDR_SPACE (y)))
3496 y = validize_mem (y);
3498 gcc_assert (mode != BLKmode);
3500 last_insn = emit_move_insn_1 (x, y);
3502 if (y_cst && REG_P (x)
3503 && (set = single_set (last_insn)) != NULL_RTX
3504 && SET_DEST (set) == x
3505 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3506 set_unique_reg_note (last_insn, REG_EQUAL, copy_rtx (y_cst));
3511 /* If Y is representable exactly in a narrower mode, and the target can
3512 perform the extension directly from constant or memory, then emit the
3513 move as an extension. */
3516 compress_float_constant (rtx x, rtx y)
3518 enum machine_mode dstmode = GET_MODE (x);
3519 enum machine_mode orig_srcmode = GET_MODE (y);
3520 enum machine_mode srcmode;
3522 int oldcost, newcost;
3523 bool speed = optimize_insn_for_speed_p ();
3525 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3527 if (LEGITIMATE_CONSTANT_P (y))
3528 oldcost = rtx_cost (y, SET, speed);
3530 oldcost = rtx_cost (force_const_mem (dstmode, y), SET, speed);
3532 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3533 srcmode != orig_srcmode;
3534 srcmode = GET_MODE_WIDER_MODE (srcmode))
3537 rtx trunc_y, last_insn;
3539 /* Skip if the target can't extend this way. */
3540 ic = can_extend_p (dstmode, srcmode, 0);
3541 if (ic == CODE_FOR_nothing)
3544 /* Skip if the narrowed value isn't exact. */
3545 if (! exact_real_truncate (srcmode, &r))
3548 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3550 if (LEGITIMATE_CONSTANT_P (trunc_y))
3552 /* Skip if the target needs extra instructions to perform
3554 if (! (*insn_data[ic].operand[1].predicate) (trunc_y, srcmode))
3556 /* This is valid, but may not be cheaper than the original. */
3557 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3558 if (oldcost < newcost)
3561 else if (float_extend_from_mem[dstmode][srcmode])
3563 trunc_y = force_const_mem (srcmode, trunc_y);
3564 /* This is valid, but may not be cheaper than the original. */
3565 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3566 if (oldcost < newcost)
3568 trunc_y = validize_mem (trunc_y);
3573 /* For CSE's benefit, force the compressed constant pool entry
3574 into a new pseudo. This constant may be used in different modes,
3575 and if not, combine will put things back together for us. */
3576 trunc_y = force_reg (srcmode, trunc_y);
3577 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3578 last_insn = get_last_insn ();
3581 set_unique_reg_note (last_insn, REG_EQUAL, y);
3589 /* Pushing data onto the stack. */
3591 /* Push a block of length SIZE (perhaps variable)
3592 and return an rtx to address the beginning of the block.
3593 The value may be virtual_outgoing_args_rtx.
3595 EXTRA is the number of bytes of padding to push in addition to SIZE.
3596 BELOW nonzero means this padding comes at low addresses;
3597 otherwise, the padding comes at high addresses. */
3600 push_block (rtx size, int extra, int below)
3604 size = convert_modes (Pmode, ptr_mode, size, 1);
3605 if (CONSTANT_P (size))
3606 anti_adjust_stack (plus_constant (size, extra));
3607 else if (REG_P (size) && extra == 0)
3608 anti_adjust_stack (size);
3611 temp = copy_to_mode_reg (Pmode, size);
3613 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3614 temp, 0, OPTAB_LIB_WIDEN);
3615 anti_adjust_stack (temp);
3618 #ifndef STACK_GROWS_DOWNWARD
3624 temp = virtual_outgoing_args_rtx;
3625 if (extra != 0 && below)
3626 temp = plus_constant (temp, extra);
3630 if (CONST_INT_P (size))
3631 temp = plus_constant (virtual_outgoing_args_rtx,
3632 -INTVAL (size) - (below ? 0 : extra));
3633 else if (extra != 0 && !below)
3634 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3635 negate_rtx (Pmode, plus_constant (size, extra)));
3637 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3638 negate_rtx (Pmode, size));
3641 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3644 #ifdef PUSH_ROUNDING
3646 /* Emit single push insn. */
3649 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3652 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3654 enum insn_code icode;
3655 insn_operand_predicate_fn pred;
3657 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3658 /* If there is push pattern, use it. Otherwise try old way of throwing
3659 MEM representing push operation to move expander. */
3660 icode = optab_handler (push_optab, mode);
3661 if (icode != CODE_FOR_nothing)
3663 if (((pred = insn_data[(int) icode].operand[0].predicate)
3664 && !((*pred) (x, mode))))
3665 x = force_reg (mode, x);
3666 emit_insn (GEN_FCN (icode) (x));
3669 if (GET_MODE_SIZE (mode) == rounded_size)
3670 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3671 /* If we are to pad downward, adjust the stack pointer first and
3672 then store X into the stack location using an offset. This is
3673 because emit_move_insn does not know how to pad; it does not have
3675 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3677 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3678 HOST_WIDE_INT offset;
3680 emit_move_insn (stack_pointer_rtx,
3681 expand_binop (Pmode,
3682 #ifdef STACK_GROWS_DOWNWARD
3688 GEN_INT (rounded_size),
3689 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3691 offset = (HOST_WIDE_INT) padding_size;
3692 #ifdef STACK_GROWS_DOWNWARD
3693 if (STACK_PUSH_CODE == POST_DEC)
3694 /* We have already decremented the stack pointer, so get the
3696 offset += (HOST_WIDE_INT) rounded_size;
3698 if (STACK_PUSH_CODE == POST_INC)
3699 /* We have already incremented the stack pointer, so get the
3701 offset -= (HOST_WIDE_INT) rounded_size;
3703 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3707 #ifdef STACK_GROWS_DOWNWARD
3708 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3709 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3710 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3712 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3713 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3714 GEN_INT (rounded_size));
3716 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3719 dest = gen_rtx_MEM (mode, dest_addr);
3723 set_mem_attributes (dest, type, 1);
3725 if (flag_optimize_sibling_calls)
3726 /* Function incoming arguments may overlap with sibling call
3727 outgoing arguments and we cannot allow reordering of reads
3728 from function arguments with stores to outgoing arguments
3729 of sibling calls. */
3730 set_mem_alias_set (dest, 0);
3732 emit_move_insn (dest, x);
3736 /* Generate code to push X onto the stack, assuming it has mode MODE and
3738 MODE is redundant except when X is a CONST_INT (since they don't
3740 SIZE is an rtx for the size of data to be copied (in bytes),
3741 needed only if X is BLKmode.
3743 ALIGN (in bits) is maximum alignment we can assume.
3745 If PARTIAL and REG are both nonzero, then copy that many of the first
3746 bytes of X into registers starting with REG, and push the rest of X.
3747 The amount of space pushed is decreased by PARTIAL bytes.
3748 REG must be a hard register in this case.
3749 If REG is zero but PARTIAL is not, take any all others actions for an
3750 argument partially in registers, but do not actually load any
3753 EXTRA is the amount in bytes of extra space to leave next to this arg.
3754 This is ignored if an argument block has already been allocated.
3756 On a machine that lacks real push insns, ARGS_ADDR is the address of
3757 the bottom of the argument block for this call. We use indexing off there
3758 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3759 argument block has not been preallocated.
3761 ARGS_SO_FAR is the size of args previously pushed for this call.
3763 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3764 for arguments passed in registers. If nonzero, it will be the number
3765 of bytes required. */
3768 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3769 unsigned int align, int partial, rtx reg, int extra,
3770 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3774 enum direction stack_direction
3775 #ifdef STACK_GROWS_DOWNWARD
3781 /* Decide where to pad the argument: `downward' for below,
3782 `upward' for above, or `none' for don't pad it.
3783 Default is below for small data on big-endian machines; else above. */
3784 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3786 /* Invert direction if stack is post-decrement.
3788 if (STACK_PUSH_CODE == POST_DEC)
3789 if (where_pad != none)
3790 where_pad = (where_pad == downward ? upward : downward);
3795 || (STRICT_ALIGNMENT && align < GET_MODE_ALIGNMENT (mode)))
3797 /* Copy a block into the stack, entirely or partially. */
3804 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3805 used = partial - offset;
3807 if (mode != BLKmode)
3809 /* A value is to be stored in an insufficiently aligned
3810 stack slot; copy via a suitably aligned slot if
3812 size = GEN_INT (GET_MODE_SIZE (mode));
3813 if (!MEM_P (xinner))
3815 temp = assign_temp (type, 0, 1, 1);
3816 emit_move_insn (temp, xinner);
3823 /* USED is now the # of bytes we need not copy to the stack
3824 because registers will take care of them. */
3827 xinner = adjust_address (xinner, BLKmode, used);
3829 /* If the partial register-part of the arg counts in its stack size,
3830 skip the part of stack space corresponding to the registers.
3831 Otherwise, start copying to the beginning of the stack space,
3832 by setting SKIP to 0. */
3833 skip = (reg_parm_stack_space == 0) ? 0 : used;
3835 #ifdef PUSH_ROUNDING
3836 /* Do it with several push insns if that doesn't take lots of insns
3837 and if there is no difficulty with push insns that skip bytes
3838 on the stack for alignment purposes. */
3841 && CONST_INT_P (size)
3843 && MEM_ALIGN (xinner) >= align
3844 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3845 /* Here we avoid the case of a structure whose weak alignment
3846 forces many pushes of a small amount of data,
3847 and such small pushes do rounding that causes trouble. */
3848 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3849 || align >= BIGGEST_ALIGNMENT
3850 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3851 == (align / BITS_PER_UNIT)))
3852 && (HOST_WIDE_INT) PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3854 /* Push padding now if padding above and stack grows down,
3855 or if padding below and stack grows up.
3856 But if space already allocated, this has already been done. */
3857 if (extra && args_addr == 0
3858 && where_pad != none && where_pad != stack_direction)
3859 anti_adjust_stack (GEN_INT (extra));
3861 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3864 #endif /* PUSH_ROUNDING */
3868 /* Otherwise make space on the stack and copy the data
3869 to the address of that space. */
3871 /* Deduct words put into registers from the size we must copy. */
3874 if (CONST_INT_P (size))
3875 size = GEN_INT (INTVAL (size) - used);
3877 size = expand_binop (GET_MODE (size), sub_optab, size,
3878 GEN_INT (used), NULL_RTX, 0,
3882 /* Get the address of the stack space.
3883 In this case, we do not deal with EXTRA separately.
3884 A single stack adjust will do. */
3887 temp = push_block (size, extra, where_pad == downward);
3890 else if (CONST_INT_P (args_so_far))
3891 temp = memory_address (BLKmode,
3892 plus_constant (args_addr,
3893 skip + INTVAL (args_so_far)));
3895 temp = memory_address (BLKmode,
3896 plus_constant (gen_rtx_PLUS (Pmode,
3901 if (!ACCUMULATE_OUTGOING_ARGS)
3903 /* If the source is referenced relative to the stack pointer,
3904 copy it to another register to stabilize it. We do not need
3905 to do this if we know that we won't be changing sp. */
3907 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3908 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3909 temp = copy_to_reg (temp);
3912 target = gen_rtx_MEM (BLKmode, temp);
3914 /* We do *not* set_mem_attributes here, because incoming arguments
3915 may overlap with sibling call outgoing arguments and we cannot
3916 allow reordering of reads from function arguments with stores
3917 to outgoing arguments of sibling calls. We do, however, want
3918 to record the alignment of the stack slot. */
3919 /* ALIGN may well be better aligned than TYPE, e.g. due to
3920 PARM_BOUNDARY. Assume the caller isn't lying. */
3921 set_mem_align (target, align);
3923 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3926 else if (partial > 0)
3928 /* Scalar partly in registers. */
3930 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3933 /* # bytes of start of argument
3934 that we must make space for but need not store. */
3935 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3936 int args_offset = INTVAL (args_so_far);
3939 /* Push padding now if padding above and stack grows down,
3940 or if padding below and stack grows up.
3941 But if space already allocated, this has already been done. */
3942 if (extra && args_addr == 0
3943 && where_pad != none && where_pad != stack_direction)
3944 anti_adjust_stack (GEN_INT (extra));
3946 /* If we make space by pushing it, we might as well push
3947 the real data. Otherwise, we can leave OFFSET nonzero
3948 and leave the space uninitialized. */
3952 /* Now NOT_STACK gets the number of words that we don't need to
3953 allocate on the stack. Convert OFFSET to words too. */
3954 not_stack = (partial - offset) / UNITS_PER_WORD;
3955 offset /= UNITS_PER_WORD;
3957 /* If the partial register-part of the arg counts in its stack size,
3958 skip the part of stack space corresponding to the registers.
3959 Otherwise, start copying to the beginning of the stack space,
3960 by setting SKIP to 0. */
3961 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3963 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3964 x = validize_mem (force_const_mem (mode, x));
3966 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3967 SUBREGs of such registers are not allowed. */
3968 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3969 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3970 x = copy_to_reg (x);
3972 /* Loop over all the words allocated on the stack for this arg. */
3973 /* We can do it by words, because any scalar bigger than a word
3974 has a size a multiple of a word. */
3975 #ifndef PUSH_ARGS_REVERSED
3976 for (i = not_stack; i < size; i++)
3978 for (i = size - 1; i >= not_stack; i--)
3980 if (i >= not_stack + offset)
3981 emit_push_insn (operand_subword_force (x, i, mode),
3982 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3984 GEN_INT (args_offset + ((i - not_stack + skip)
3986 reg_parm_stack_space, alignment_pad);
3993 /* Push padding now if padding above and stack grows down,
3994 or if padding below and stack grows up.
3995 But if space already allocated, this has already been done. */
3996 if (extra && args_addr == 0
3997 && where_pad != none && where_pad != stack_direction)
3998 anti_adjust_stack (GEN_INT (extra));
4000 #ifdef PUSH_ROUNDING
4001 if (args_addr == 0 && PUSH_ARGS)
4002 emit_single_push_insn (mode, x, type);
4006 if (CONST_INT_P (args_so_far))
4008 = memory_address (mode,
4009 plus_constant (args_addr,
4010 INTVAL (args_so_far)));
4012 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
4014 dest = gen_rtx_MEM (mode, addr);
4016 /* We do *not* set_mem_attributes here, because incoming arguments
4017 may overlap with sibling call outgoing arguments and we cannot
4018 allow reordering of reads from function arguments with stores
4019 to outgoing arguments of sibling calls. We do, however, want
4020 to record the alignment of the stack slot. */
4021 /* ALIGN may well be better aligned than TYPE, e.g. due to
4022 PARM_BOUNDARY. Assume the caller isn't lying. */
4023 set_mem_align (dest, align);
4025 emit_move_insn (dest, x);
4029 /* If part should go in registers, copy that part
4030 into the appropriate registers. Do this now, at the end,
4031 since mem-to-mem copies above may do function calls. */
4032 if (partial > 0 && reg != 0)
4034 /* Handle calls that pass values in multiple non-contiguous locations.
4035 The Irix 6 ABI has examples of this. */
4036 if (GET_CODE (reg) == PARALLEL)
4037 emit_group_load (reg, x, type, -1);
4040 gcc_assert (partial % UNITS_PER_WORD == 0);
4041 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
4045 if (extra && args_addr == 0 && where_pad == stack_direction)
4046 anti_adjust_stack (GEN_INT (extra));
4048 if (alignment_pad && args_addr == 0)
4049 anti_adjust_stack (alignment_pad);
4052 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4056 get_subtarget (rtx x)
4060 /* Only registers can be subtargets. */
4062 /* Don't use hard regs to avoid extending their life. */
4063 || REGNO (x) < FIRST_PSEUDO_REGISTER
4067 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
4068 FIELD is a bitfield. Returns true if the optimization was successful,
4069 and there's nothing else to do. */
4072 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
4073 unsigned HOST_WIDE_INT bitpos,
4074 enum machine_mode mode1, rtx str_rtx,
4077 enum machine_mode str_mode = GET_MODE (str_rtx);
4078 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
4083 if (mode1 != VOIDmode
4084 || bitsize >= BITS_PER_WORD
4085 || str_bitsize > BITS_PER_WORD
4086 || TREE_SIDE_EFFECTS (to)
4087 || TREE_THIS_VOLATILE (to))
4091 if (!BINARY_CLASS_P (src)
4092 || TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
4095 op0 = TREE_OPERAND (src, 0);
4096 op1 = TREE_OPERAND (src, 1);
4099 if (!operand_equal_p (to, op0, 0))
4102 if (MEM_P (str_rtx))
4104 unsigned HOST_WIDE_INT offset1;
4106 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
4107 str_mode = word_mode;
4108 str_mode = get_best_mode (bitsize, bitpos,
4109 MEM_ALIGN (str_rtx), str_mode, 0);
4110 if (str_mode == VOIDmode)
4112 str_bitsize = GET_MODE_BITSIZE (str_mode);
4115 bitpos %= str_bitsize;
4116 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
4117 str_rtx = adjust_address (str_rtx, str_mode, offset1);
4119 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
4122 /* If the bit field covers the whole REG/MEM, store_field
4123 will likely generate better code. */
4124 if (bitsize >= str_bitsize)
4127 /* We can't handle fields split across multiple entities. */
4128 if (bitpos + bitsize > str_bitsize)
4131 if (BYTES_BIG_ENDIAN)
4132 bitpos = str_bitsize - bitpos - bitsize;
4134 switch (TREE_CODE (src))
4138 /* For now, just optimize the case of the topmost bitfield
4139 where we don't need to do any masking and also
4140 1 bit bitfields where xor can be used.
4141 We might win by one instruction for the other bitfields
4142 too if insv/extv instructions aren't used, so that
4143 can be added later. */
4144 if (bitpos + bitsize != str_bitsize
4145 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
4148 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4149 value = convert_modes (str_mode,
4150 TYPE_MODE (TREE_TYPE (op1)), value,
4151 TYPE_UNSIGNED (TREE_TYPE (op1)));
4153 /* We may be accessing data outside the field, which means
4154 we can alias adjacent data. */
4155 if (MEM_P (str_rtx))
4157 str_rtx = shallow_copy_rtx (str_rtx);
4158 set_mem_alias_set (str_rtx, 0);
4159 set_mem_expr (str_rtx, 0);
4162 binop = TREE_CODE (src) == PLUS_EXPR ? add_optab : sub_optab;
4163 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
4165 value = expand_and (str_mode, value, const1_rtx, NULL);
4168 value = expand_shift (LSHIFT_EXPR, str_mode, value,
4169 build_int_cst (NULL_TREE, bitpos),
4171 result = expand_binop (str_mode, binop, str_rtx,
4172 value, str_rtx, 1, OPTAB_WIDEN);
4173 if (result != str_rtx)
4174 emit_move_insn (str_rtx, result);
4179 if (TREE_CODE (op1) != INTEGER_CST)
4181 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), EXPAND_NORMAL);
4182 value = convert_modes (GET_MODE (str_rtx),
4183 TYPE_MODE (TREE_TYPE (op1)), value,
4184 TYPE_UNSIGNED (TREE_TYPE (op1)));
4186 /* We may be accessing data outside the field, which means
4187 we can alias adjacent data. */
4188 if (MEM_P (str_rtx))
4190 str_rtx = shallow_copy_rtx (str_rtx);
4191 set_mem_alias_set (str_rtx, 0);
4192 set_mem_expr (str_rtx, 0);
4195 binop = TREE_CODE (src) == BIT_IOR_EXPR ? ior_optab : xor_optab;
4196 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
4198 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
4200 value = expand_and (GET_MODE (str_rtx), value, mask,
4203 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
4204 build_int_cst (NULL_TREE, bitpos),
4206 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
4207 value, str_rtx, 1, OPTAB_WIDEN);
4208 if (result != str_rtx)
4209 emit_move_insn (str_rtx, result);
4220 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4221 is true, try generating a nontemporal store. */
4224 expand_assignment (tree to, tree from, bool nontemporal)
4228 enum machine_mode mode;
4231 /* Don't crash if the lhs of the assignment was erroneous. */
4232 if (TREE_CODE (to) == ERROR_MARK)
4234 result = expand_normal (from);
4238 /* Optimize away no-op moves without side-effects. */
4239 if (operand_equal_p (to, from, 0))
4242 mode = TYPE_MODE (TREE_TYPE (to));
4243 if ((TREE_CODE (to) == MEM_REF
4244 || TREE_CODE (to) == TARGET_MEM_REF)
4246 && ((align = MAX (TYPE_ALIGN (TREE_TYPE (to)),
4247 get_object_alignment (to, BIGGEST_ALIGNMENT)))
4248 < (signed) GET_MODE_ALIGNMENT (mode))
4249 && ((icode = optab_handler (movmisalign_optab, mode))
4250 != CODE_FOR_nothing))
4252 enum machine_mode address_mode, op_mode1;
4253 rtx insn, reg, op0, mem;
4255 reg = expand_expr (from, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4256 reg = force_not_mem (reg);
4258 if (TREE_CODE (to) == MEM_REF)
4261 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (to, 1))));
4262 tree base = TREE_OPERAND (to, 0);
4263 address_mode = targetm.addr_space.address_mode (as);
4264 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4265 op0 = convert_memory_address_addr_space (address_mode, op0, as);
4266 if (!integer_zerop (TREE_OPERAND (to, 1)))
4269 = immed_double_int_const (mem_ref_offset (to), address_mode);
4270 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
4272 op0 = memory_address_addr_space (mode, op0, as);
4273 mem = gen_rtx_MEM (mode, op0);
4274 set_mem_attributes (mem, to, 0);
4275 set_mem_addr_space (mem, as);
4277 else if (TREE_CODE (to) == TARGET_MEM_REF)
4279 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (to));
4280 struct mem_address addr;
4282 get_address_description (to, &addr);
4283 op0 = addr_for_mem_ref (&addr, as, true);
4284 op0 = memory_address_addr_space (mode, op0, as);
4285 mem = gen_rtx_MEM (mode, op0);
4286 set_mem_attributes (mem, to, 0);
4287 set_mem_addr_space (mem, as);
4291 if (TREE_THIS_VOLATILE (to))
4292 MEM_VOLATILE_P (mem) = 1;
4294 op_mode1 = insn_data[icode].operand[1].mode;
4295 if (! (*insn_data[icode].operand[1].predicate) (reg, op_mode1)
4296 && op_mode1 != VOIDmode)
4297 reg = copy_to_mode_reg (op_mode1, reg);
4299 insn = GEN_FCN (icode) (mem, reg);
4300 /* The movmisalign<mode> pattern cannot fail, else the assignment would
4301 silently be omitted. */
4302 gcc_assert (insn != NULL_RTX);
4307 /* Assignment of a structure component needs special treatment
4308 if the structure component's rtx is not simply a MEM.
4309 Assignment of an array element at a constant index, and assignment of
4310 an array element in an unaligned packed structure field, has the same
4312 if (handled_component_p (to)
4313 /* ??? We only need to handle MEM_REF here if the access is not
4314 a full access of the base object. */
4315 || (TREE_CODE (to) == MEM_REF
4316 && TREE_CODE (TREE_OPERAND (to, 0)) == ADDR_EXPR)
4317 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4319 enum machine_mode mode1;
4320 HOST_WIDE_INT bitsize, bitpos;
4327 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4328 &unsignedp, &volatilep, true);
4330 /* If we are going to use store_bit_field and extract_bit_field,
4331 make sure to_rtx will be safe for multiple use. */
4333 to_rtx = expand_normal (tem);
4335 /* If the bitfield is volatile, we want to access it in the
4336 field's mode, not the computed mode.
4337 If a MEM has VOIDmode (external with incomplete type),
4338 use BLKmode for it instead. */
4341 if (volatilep && flag_strict_volatile_bitfields > 0)
4342 to_rtx = adjust_address (to_rtx, mode1, 0);
4343 else if (GET_MODE (to_rtx) == VOIDmode)
4344 to_rtx = adjust_address (to_rtx, BLKmode, 0);
4349 enum machine_mode address_mode;
4352 if (!MEM_P (to_rtx))
4354 /* We can get constant negative offsets into arrays with broken
4355 user code. Translate this to a trap instead of ICEing. */
4356 gcc_assert (TREE_CODE (offset) == INTEGER_CST);
4357 expand_builtin_trap ();
4358 to_rtx = gen_rtx_MEM (BLKmode, const0_rtx);
4361 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4363 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
4364 if (GET_MODE (offset_rtx) != address_mode)
4365 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
4367 /* A constant address in TO_RTX can have VOIDmode, we must not try
4368 to call force_reg for that case. Avoid that case. */
4370 && GET_MODE (to_rtx) == BLKmode
4371 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4373 && (bitpos % bitsize) == 0
4374 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4375 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4377 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4381 to_rtx = offset_address (to_rtx, offset_rtx,
4382 highest_pow2_factor_for_target (to,
4386 /* No action is needed if the target is not a memory and the field
4387 lies completely outside that target. This can occur if the source
4388 code contains an out-of-bounds access to a small array. */
4390 && GET_MODE (to_rtx) != BLKmode
4391 && (unsigned HOST_WIDE_INT) bitpos
4392 >= GET_MODE_BITSIZE (GET_MODE (to_rtx)))
4394 expand_normal (from);
4397 /* Handle expand_expr of a complex value returning a CONCAT. */
4398 else if (GET_CODE (to_rtx) == CONCAT)
4400 unsigned short mode_bitsize = GET_MODE_BITSIZE (GET_MODE (to_rtx));
4401 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from)))
4403 && bitsize == mode_bitsize)
4404 result = store_expr (from, to_rtx, false, nontemporal);
4405 else if (bitsize == mode_bitsize / 2
4406 && (bitpos == 0 || bitpos == mode_bitsize / 2))
4407 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false,
4409 else if (bitpos + bitsize <= mode_bitsize / 2)
4410 result = store_field (XEXP (to_rtx, 0), bitsize, bitpos,
4411 mode1, from, TREE_TYPE (tem),
4412 get_alias_set (to), nontemporal);
4413 else if (bitpos >= mode_bitsize / 2)
4414 result = store_field (XEXP (to_rtx, 1), bitsize,
4415 bitpos - mode_bitsize / 2, mode1, from,
4416 TREE_TYPE (tem), get_alias_set (to),
4418 else if (bitpos == 0 && bitsize == mode_bitsize)
4421 result = expand_normal (from);
4422 from_rtx = simplify_gen_subreg (GET_MODE (to_rtx), result,
4423 TYPE_MODE (TREE_TYPE (from)), 0);
4424 emit_move_insn (XEXP (to_rtx, 0),
4425 read_complex_part (from_rtx, false));
4426 emit_move_insn (XEXP (to_rtx, 1),
4427 read_complex_part (from_rtx, true));
4431 rtx temp = assign_stack_temp (GET_MODE (to_rtx),
4432 GET_MODE_SIZE (GET_MODE (to_rtx)),
4434 write_complex_part (temp, XEXP (to_rtx, 0), false);
4435 write_complex_part (temp, XEXP (to_rtx, 1), true);
4436 result = store_field (temp, bitsize, bitpos, mode1, from,
4437 TREE_TYPE (tem), get_alias_set (to),
4439 emit_move_insn (XEXP (to_rtx, 0), read_complex_part (temp, false));
4440 emit_move_insn (XEXP (to_rtx, 1), read_complex_part (temp, true));
4447 /* If the field is at offset zero, we could have been given the
4448 DECL_RTX of the parent struct. Don't munge it. */
4449 to_rtx = shallow_copy_rtx (to_rtx);
4451 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4453 /* Deal with volatile and readonly fields. The former is only
4454 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4456 MEM_VOLATILE_P (to_rtx) = 1;
4457 if (component_uses_parent_alias_set (to))
4458 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4461 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
4465 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
4466 TREE_TYPE (tem), get_alias_set (to),
4471 preserve_temp_slots (result);
4477 /* If the rhs is a function call and its value is not an aggregate,
4478 call the function before we start to compute the lhs.
4479 This is needed for correct code for cases such as
4480 val = setjmp (buf) on machines where reference to val
4481 requires loading up part of an address in a separate insn.
4483 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4484 since it might be a promoted variable where the zero- or sign- extension
4485 needs to be done. Handling this in the normal way is safe because no
4486 computation is done before the call. The same is true for SSA names. */
4487 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
4488 && COMPLETE_TYPE_P (TREE_TYPE (from))
4489 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4490 && ! (((TREE_CODE (to) == VAR_DECL
4491 || TREE_CODE (to) == PARM_DECL
4492 || TREE_CODE (to) == RESULT_DECL)
4493 && REG_P (DECL_RTL (to)))
4494 || TREE_CODE (to) == SSA_NAME))
4499 value = expand_normal (from);
4501 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4503 /* Handle calls that return values in multiple non-contiguous locations.
4504 The Irix 6 ABI has examples of this. */
4505 if (GET_CODE (to_rtx) == PARALLEL)
4506 emit_group_load (to_rtx, value, TREE_TYPE (from),
4507 int_size_in_bytes (TREE_TYPE (from)));
4508 else if (GET_MODE (to_rtx) == BLKmode)
4509 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4512 if (POINTER_TYPE_P (TREE_TYPE (to)))
4513 value = convert_memory_address_addr_space
4514 (GET_MODE (to_rtx), value,
4515 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to))));
4517 emit_move_insn (to_rtx, value);
4519 preserve_temp_slots (to_rtx);
4525 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4526 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4529 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4531 /* Don't move directly into a return register. */
4532 if (TREE_CODE (to) == RESULT_DECL
4533 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4538 if (REG_P (to_rtx) && TYPE_MODE (TREE_TYPE (from)) == BLKmode)
4539 temp = copy_blkmode_to_reg (GET_MODE (to_rtx), from);
4541 temp = expand_expr (from, NULL_RTX, GET_MODE (to_rtx), EXPAND_NORMAL);
4543 if (GET_CODE (to_rtx) == PARALLEL)
4544 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4545 int_size_in_bytes (TREE_TYPE (from)));
4547 emit_move_insn (to_rtx, temp);
4549 preserve_temp_slots (to_rtx);
4555 /* In case we are returning the contents of an object which overlaps
4556 the place the value is being stored, use a safe function when copying
4557 a value through a pointer into a structure value return block. */
4558 if (TREE_CODE (to) == RESULT_DECL
4559 && TREE_CODE (from) == INDIRECT_REF
4560 && ADDR_SPACE_GENERIC_P
4561 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from, 0)))))
4562 && refs_may_alias_p (to, from)
4563 && cfun->returns_struct
4564 && !cfun->returns_pcc_struct)
4569 size = expr_size (from);
4570 from_rtx = expand_normal (from);
4572 emit_library_call (memmove_libfunc, LCT_NORMAL,
4573 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4574 XEXP (from_rtx, 0), Pmode,
4575 convert_to_mode (TYPE_MODE (sizetype),
4576 size, TYPE_UNSIGNED (sizetype)),
4577 TYPE_MODE (sizetype));
4579 preserve_temp_slots (to_rtx);
4585 /* Compute FROM and store the value in the rtx we got. */
4588 result = store_expr (from, to_rtx, 0, nontemporal);
4589 preserve_temp_slots (result);
4595 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4596 succeeded, false otherwise. */
4599 emit_storent_insn (rtx to, rtx from)
4601 enum machine_mode mode = GET_MODE (to), imode;
4602 enum insn_code code = optab_handler (storent_optab, mode);
4605 if (code == CODE_FOR_nothing)
4608 imode = insn_data[code].operand[0].mode;
4609 if (!insn_data[code].operand[0].predicate (to, imode))
4612 imode = insn_data[code].operand[1].mode;
4613 if (!insn_data[code].operand[1].predicate (from, imode))
4615 from = copy_to_mode_reg (imode, from);
4616 if (!insn_data[code].operand[1].predicate (from, imode))
4620 pattern = GEN_FCN (code) (to, from);
4621 if (pattern == NULL_RTX)
4624 emit_insn (pattern);
4628 /* Generate code for computing expression EXP,
4629 and storing the value into TARGET.
4631 If the mode is BLKmode then we may return TARGET itself.
4632 It turns out that in BLKmode it doesn't cause a problem.
4633 because C has no operators that could combine two different
4634 assignments into the same BLKmode object with different values
4635 with no sequence point. Will other languages need this to
4638 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4639 stack, and block moves may need to be treated specially.
4641 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4644 store_expr (tree exp, rtx target, int call_param_p, bool nontemporal)
4647 rtx alt_rtl = NULL_RTX;
4648 location_t loc = EXPR_LOCATION (exp);
4650 if (VOID_TYPE_P (TREE_TYPE (exp)))
4652 /* C++ can generate ?: expressions with a throw expression in one
4653 branch and an rvalue in the other. Here, we resolve attempts to
4654 store the throw expression's nonexistent result. */
4655 gcc_assert (!call_param_p);
4656 expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4659 if (TREE_CODE (exp) == COMPOUND_EXPR)
4661 /* Perform first part of compound expression, then assign from second
4663 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4664 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4665 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4668 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4670 /* For conditional expression, get safe form of the target. Then
4671 test the condition, doing the appropriate assignment on either
4672 side. This avoids the creation of unnecessary temporaries.
4673 For non-BLKmode, it is more efficient not to do this. */
4675 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4677 do_pending_stack_adjust ();
4679 jumpifnot (TREE_OPERAND (exp, 0), lab1, -1);
4680 store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4682 emit_jump_insn (gen_jump (lab2));
4685 store_expr (TREE_OPERAND (exp, 2), target, call_param_p,
4692 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4693 /* If this is a scalar in a register that is stored in a wider mode
4694 than the declared mode, compute the result into its declared mode
4695 and then convert to the wider mode. Our value is the computed
4698 rtx inner_target = 0;
4700 /* We can do the conversion inside EXP, which will often result
4701 in some optimizations. Do the conversion in two steps: first
4702 change the signedness, if needed, then the extend. But don't
4703 do this if the type of EXP is a subtype of something else
4704 since then the conversion might involve more than just
4705 converting modes. */
4706 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4707 && TREE_TYPE (TREE_TYPE (exp)) == 0
4708 && GET_MODE_PRECISION (GET_MODE (target))
4709 == TYPE_PRECISION (TREE_TYPE (exp)))
4711 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4712 != SUBREG_PROMOTED_UNSIGNED_P (target))
4714 /* Some types, e.g. Fortran's logical*4, won't have a signed
4715 version, so use the mode instead. */
4717 = (signed_or_unsigned_type_for
4718 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)));
4720 ntype = lang_hooks.types.type_for_mode
4721 (TYPE_MODE (TREE_TYPE (exp)),
4722 SUBREG_PROMOTED_UNSIGNED_P (target));
4724 exp = fold_convert_loc (loc, ntype, exp);
4727 exp = fold_convert_loc (loc, lang_hooks.types.type_for_mode
4728 (GET_MODE (SUBREG_REG (target)),
4729 SUBREG_PROMOTED_UNSIGNED_P (target)),
4732 inner_target = SUBREG_REG (target);
4735 temp = expand_expr (exp, inner_target, VOIDmode,
4736 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4738 /* If TEMP is a VOIDmode constant, use convert_modes to make
4739 sure that we properly convert it. */
4740 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4742 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4743 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4744 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4745 GET_MODE (target), temp,
4746 SUBREG_PROMOTED_UNSIGNED_P (target));
4749 convert_move (SUBREG_REG (target), temp,
4750 SUBREG_PROMOTED_UNSIGNED_P (target));
4754 else if ((TREE_CODE (exp) == STRING_CST
4755 || (TREE_CODE (exp) == MEM_REF
4756 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
4757 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4759 && integer_zerop (TREE_OPERAND (exp, 1))))
4760 && !nontemporal && !call_param_p
4763 /* Optimize initialization of an array with a STRING_CST. */
4764 HOST_WIDE_INT exp_len, str_copy_len;
4766 tree str = TREE_CODE (exp) == STRING_CST
4767 ? exp : TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
4769 exp_len = int_expr_size (exp);
4773 if (TREE_STRING_LENGTH (str) <= 0)
4776 str_copy_len = strlen (TREE_STRING_POINTER (str));
4777 if (str_copy_len < TREE_STRING_LENGTH (str) - 1)
4780 str_copy_len = TREE_STRING_LENGTH (str);
4781 if ((STORE_MAX_PIECES & (STORE_MAX_PIECES - 1)) == 0
4782 && TREE_STRING_POINTER (str)[TREE_STRING_LENGTH (str) - 1] == '\0')
4784 str_copy_len += STORE_MAX_PIECES - 1;
4785 str_copy_len &= ~(STORE_MAX_PIECES - 1);
4787 str_copy_len = MIN (str_copy_len, exp_len);
4788 if (!can_store_by_pieces (str_copy_len, builtin_strncpy_read_str,
4789 CONST_CAST (char *, TREE_STRING_POINTER (str)),
4790 MEM_ALIGN (target), false))
4795 dest_mem = store_by_pieces (dest_mem,
4796 str_copy_len, builtin_strncpy_read_str,
4798 TREE_STRING_POINTER (str)),
4799 MEM_ALIGN (target), false,
4800 exp_len > str_copy_len ? 1 : 0);
4801 if (exp_len > str_copy_len)
4802 clear_storage (adjust_address (dest_mem, BLKmode, 0),
4803 GEN_INT (exp_len - str_copy_len),
4812 /* If we want to use a nontemporal store, force the value to
4814 tmp_target = nontemporal ? NULL_RTX : target;
4815 temp = expand_expr_real (exp, tmp_target, GET_MODE (target),
4817 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4821 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4822 the same as that of TARGET, adjust the constant. This is needed, for
4823 example, in case it is a CONST_DOUBLE and we want only a word-sized
4825 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4826 && TREE_CODE (exp) != ERROR_MARK
4827 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4828 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4829 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4831 /* If value was not generated in the target, store it there.
4832 Convert the value to TARGET's type first if necessary and emit the
4833 pending incrementations that have been queued when expanding EXP.
4834 Note that we cannot emit the whole queue blindly because this will
4835 effectively disable the POST_INC optimization later.
4837 If TEMP and TARGET compare equal according to rtx_equal_p, but
4838 one or both of them are volatile memory refs, we have to distinguish
4840 - expand_expr has used TARGET. In this case, we must not generate
4841 another copy. This can be detected by TARGET being equal according
4843 - expand_expr has not used TARGET - that means that the source just
4844 happens to have the same RTX form. Since temp will have been created
4845 by expand_expr, it will compare unequal according to == .
4846 We must generate a copy in this case, to reach the correct number
4847 of volatile memory references. */
4849 if ((! rtx_equal_p (temp, target)
4850 || (temp != target && (side_effects_p (temp)
4851 || side_effects_p (target))))
4852 && TREE_CODE (exp) != ERROR_MARK
4853 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4854 but TARGET is not valid memory reference, TEMP will differ
4855 from TARGET although it is really the same location. */
4857 && rtx_equal_p (alt_rtl, target)
4858 && !side_effects_p (alt_rtl)
4859 && !side_effects_p (target))
4860 /* If there's nothing to copy, don't bother. Don't call
4861 expr_size unless necessary, because some front-ends (C++)
4862 expr_size-hook must not be given objects that are not
4863 supposed to be bit-copied or bit-initialized. */
4864 && expr_size (exp) != const0_rtx)
4866 if (GET_MODE (temp) != GET_MODE (target)
4867 && GET_MODE (temp) != VOIDmode)
4869 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4870 if (GET_MODE (target) == BLKmode
4871 && GET_MODE (temp) == BLKmode)
4872 emit_block_move (target, temp, expr_size (exp),
4874 ? BLOCK_OP_CALL_PARM
4875 : BLOCK_OP_NORMAL));
4876 else if (GET_MODE (target) == BLKmode)
4877 store_bit_field (target, INTVAL (expr_size (exp)) * BITS_PER_UNIT,
4878 0, GET_MODE (temp), temp);
4880 convert_move (target, temp, unsignedp);
4883 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4885 /* Handle copying a string constant into an array. The string
4886 constant may be shorter than the array. So copy just the string's
4887 actual length, and clear the rest. First get the size of the data
4888 type of the string, which is actually the size of the target. */
4889 rtx size = expr_size (exp);
4891 if (CONST_INT_P (size)
4892 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4893 emit_block_move (target, temp, size,
4895 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4898 enum machine_mode pointer_mode
4899 = targetm.addr_space.pointer_mode (MEM_ADDR_SPACE (target));
4900 enum machine_mode address_mode
4901 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (target));
4903 /* Compute the size of the data to copy from the string. */
4905 = size_binop_loc (loc, MIN_EXPR,
4906 make_tree (sizetype, size),
4907 size_int (TREE_STRING_LENGTH (exp)));
4909 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4911 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4914 /* Copy that much. */
4915 copy_size_rtx = convert_to_mode (pointer_mode, copy_size_rtx,
4916 TYPE_UNSIGNED (sizetype));
4917 emit_block_move (target, temp, copy_size_rtx,
4919 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4921 /* Figure out how much is left in TARGET that we have to clear.
4922 Do all calculations in pointer_mode. */
4923 if (CONST_INT_P (copy_size_rtx))
4925 size = plus_constant (size, -INTVAL (copy_size_rtx));
4926 target = adjust_address (target, BLKmode,
4927 INTVAL (copy_size_rtx));
4931 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4932 copy_size_rtx, NULL_RTX, 0,
4935 if (GET_MODE (copy_size_rtx) != address_mode)
4936 copy_size_rtx = convert_to_mode (address_mode,
4938 TYPE_UNSIGNED (sizetype));
4940 target = offset_address (target, copy_size_rtx,
4941 highest_pow2_factor (copy_size));
4942 label = gen_label_rtx ();
4943 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4944 GET_MODE (size), 0, label);
4947 if (size != const0_rtx)
4948 clear_storage (target, size, BLOCK_OP_NORMAL);
4954 /* Handle calls that return values in multiple non-contiguous locations.
4955 The Irix 6 ABI has examples of this. */
4956 else if (GET_CODE (target) == PARALLEL)
4957 emit_group_load (target, temp, TREE_TYPE (exp),
4958 int_size_in_bytes (TREE_TYPE (exp)));
4959 else if (GET_MODE (temp) == BLKmode)
4960 emit_block_move (target, temp, expr_size (exp),
4962 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4963 else if (nontemporal
4964 && emit_storent_insn (target, temp))
4965 /* If we managed to emit a nontemporal store, there is nothing else to
4970 temp = force_operand (temp, target);
4972 emit_move_insn (target, temp);
4979 /* Helper for categorize_ctor_elements. Identical interface. */
4982 categorize_ctor_elements_1 (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4983 HOST_WIDE_INT *p_elt_count,
4986 unsigned HOST_WIDE_INT idx;
4987 HOST_WIDE_INT nz_elts, elt_count;
4988 tree value, purpose;
4990 /* Whether CTOR is a valid constant initializer, in accordance with what
4991 initializer_constant_valid_p does. If inferred from the constructor
4992 elements, true until proven otherwise. */
4993 bool const_from_elts_p = constructor_static_from_elts_p (ctor);
4994 bool const_p = const_from_elts_p ? true : TREE_STATIC (ctor);
4999 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), idx, purpose, value)
5001 HOST_WIDE_INT mult = 1;
5003 if (TREE_CODE (purpose) == RANGE_EXPR)
5005 tree lo_index = TREE_OPERAND (purpose, 0);
5006 tree hi_index = TREE_OPERAND (purpose, 1);
5008 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
5009 mult = (tree_low_cst (hi_index, 1)
5010 - tree_low_cst (lo_index, 1) + 1);
5013 switch (TREE_CODE (value))
5017 HOST_WIDE_INT nz = 0, ic = 0;
5020 = categorize_ctor_elements_1 (value, &nz, &ic, p_must_clear);
5022 nz_elts += mult * nz;
5023 elt_count += mult * ic;
5025 if (const_from_elts_p && const_p)
5026 const_p = const_elt_p;
5033 if (!initializer_zerop (value))
5039 nz_elts += mult * TREE_STRING_LENGTH (value);
5040 elt_count += mult * TREE_STRING_LENGTH (value);
5044 if (!initializer_zerop (TREE_REALPART (value)))
5046 if (!initializer_zerop (TREE_IMAGPART (value)))
5054 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
5056 if (!initializer_zerop (TREE_VALUE (v)))
5065 HOST_WIDE_INT tc = count_type_elements (TREE_TYPE (value), true);
5068 nz_elts += mult * tc;
5069 elt_count += mult * tc;
5071 if (const_from_elts_p && const_p)
5072 const_p = initializer_constant_valid_p (value, TREE_TYPE (value))
5080 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
5081 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
5084 bool clear_this = true;
5086 if (!VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (ctor)))
5088 /* We don't expect more than one element of the union to be
5089 initialized. Not sure what we should do otherwise... */
5090 gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ctor))
5093 init_sub_type = TREE_TYPE (VEC_index (constructor_elt,
5094 CONSTRUCTOR_ELTS (ctor),
5097 /* ??? We could look at each element of the union, and find the
5098 largest element. Which would avoid comparing the size of the
5099 initialized element against any tail padding in the union.
5100 Doesn't seem worth the effort... */
5101 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
5102 TYPE_SIZE (init_sub_type)) == 1)
5104 /* And now we have to find out if the element itself is fully
5105 constructed. E.g. for union { struct { int a, b; } s; } u
5106 = { .s = { .a = 1 } }. */
5107 if (elt_count == count_type_elements (init_sub_type, false))
5112 *p_must_clear = clear_this;
5115 *p_nz_elts += nz_elts;
5116 *p_elt_count += elt_count;
5121 /* Examine CTOR to discover:
5122 * how many scalar fields are set to nonzero values,
5123 and place it in *P_NZ_ELTS;
5124 * how many scalar fields in total are in CTOR,
5125 and place it in *P_ELT_COUNT.
5126 * if a type is a union, and the initializer from the constructor
5127 is not the largest element in the union, then set *p_must_clear.
5129 Return whether or not CTOR is a valid static constant initializer, the same
5130 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
5133 categorize_ctor_elements (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
5134 HOST_WIDE_INT *p_elt_count,
5139 *p_must_clear = false;
5142 categorize_ctor_elements_1 (ctor, p_nz_elts, p_elt_count, p_must_clear);
5145 /* Count the number of scalars in TYPE. Return -1 on overflow or
5146 variable-sized. If ALLOW_FLEXARR is true, don't count flexible
5147 array member at the end of the structure. */
5150 count_type_elements (const_tree type, bool allow_flexarr)
5152 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
5153 switch (TREE_CODE (type))
5157 tree telts = array_type_nelts (type);
5158 if (telts && host_integerp (telts, 1))
5160 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
5161 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type), false);
5164 else if (max / n > m)
5172 HOST_WIDE_INT n = 0, t;
5175 for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f))
5176 if (TREE_CODE (f) == FIELD_DECL)
5178 t = count_type_elements (TREE_TYPE (f), false);
5181 /* Check for structures with flexible array member. */
5182 tree tf = TREE_TYPE (f);
5184 && DECL_CHAIN (f) == NULL
5185 && TREE_CODE (tf) == ARRAY_TYPE
5187 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf))
5188 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf)))
5189 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf))
5190 && int_size_in_bytes (type) >= 0)
5202 case QUAL_UNION_TYPE:
5209 return TYPE_VECTOR_SUBPARTS (type);
5213 case FIXED_POINT_TYPE:
5218 case REFERENCE_TYPE:
5233 /* Return 1 if EXP contains mostly (3/4) zeros. */
5236 mostly_zeros_p (const_tree exp)
5238 if (TREE_CODE (exp) == CONSTRUCTOR)
5241 HOST_WIDE_INT nz_elts, count, elts;
5244 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5248 elts = count_type_elements (TREE_TYPE (exp), false);
5250 return nz_elts < elts / 4;
5253 return initializer_zerop (exp);
5256 /* Return 1 if EXP contains all zeros. */
5259 all_zeros_p (const_tree exp)
5261 if (TREE_CODE (exp) == CONSTRUCTOR)
5264 HOST_WIDE_INT nz_elts, count;
5267 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5268 return nz_elts == 0;
5271 return initializer_zerop (exp);
5274 /* Helper function for store_constructor.
5275 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5276 TYPE is the type of the CONSTRUCTOR, not the element type.
5277 CLEARED is as for store_constructor.
5278 ALIAS_SET is the alias set to use for any stores.
5280 This provides a recursive shortcut back to store_constructor when it isn't
5281 necessary to go through store_field. This is so that we can pass through
5282 the cleared field to let store_constructor know that we may not have to
5283 clear a substructure if the outer structure has already been cleared. */
5286 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
5287 HOST_WIDE_INT bitpos, enum machine_mode mode,
5288 tree exp, tree type, int cleared,
5289 alias_set_type alias_set)
5291 if (TREE_CODE (exp) == CONSTRUCTOR
5292 /* We can only call store_constructor recursively if the size and
5293 bit position are on a byte boundary. */
5294 && bitpos % BITS_PER_UNIT == 0
5295 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
5296 /* If we have a nonzero bitpos for a register target, then we just
5297 let store_field do the bitfield handling. This is unlikely to
5298 generate unnecessary clear instructions anyways. */
5299 && (bitpos == 0 || MEM_P (target)))
5303 = adjust_address (target,
5304 GET_MODE (target) == BLKmode
5306 % GET_MODE_ALIGNMENT (GET_MODE (target)))
5307 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
5310 /* Update the alias set, if required. */
5311 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
5312 && MEM_ALIAS_SET (target) != 0)
5314 target = copy_rtx (target);
5315 set_mem_alias_set (target, alias_set);
5318 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
5321 store_field (target, bitsize, bitpos, mode, exp, type, alias_set, false);
5324 /* Store the value of constructor EXP into the rtx TARGET.
5325 TARGET is either a REG or a MEM; we know it cannot conflict, since
5326 safe_from_p has been called.
5327 CLEARED is true if TARGET is known to have been zero'd.
5328 SIZE is the number of bytes of TARGET we are allowed to modify: this
5329 may not be the same as the size of EXP if we are assigning to a field
5330 which has been packed to exclude padding bits. */
5333 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
5335 tree type = TREE_TYPE (exp);
5336 #ifdef WORD_REGISTER_OPERATIONS
5337 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
5340 switch (TREE_CODE (type))
5344 case QUAL_UNION_TYPE:
5346 unsigned HOST_WIDE_INT idx;
5349 /* If size is zero or the target is already cleared, do nothing. */
5350 if (size == 0 || cleared)
5352 /* We either clear the aggregate or indicate the value is dead. */
5353 else if ((TREE_CODE (type) == UNION_TYPE
5354 || TREE_CODE (type) == QUAL_UNION_TYPE)
5355 && ! CONSTRUCTOR_ELTS (exp))
5356 /* If the constructor is empty, clear the union. */
5358 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
5362 /* If we are building a static constructor into a register,
5363 set the initial value as zero so we can fold the value into
5364 a constant. But if more than one register is involved,
5365 this probably loses. */
5366 else if (REG_P (target) && TREE_STATIC (exp)
5367 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
5369 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5373 /* If the constructor has fewer fields than the structure or
5374 if we are initializing the structure to mostly zeros, clear
5375 the whole structure first. Don't do this if TARGET is a
5376 register whose mode size isn't equal to SIZE since
5377 clear_storage can't handle this case. */
5379 && (((int)VEC_length (constructor_elt, CONSTRUCTOR_ELTS (exp))
5380 != fields_length (type))
5381 || mostly_zeros_p (exp))
5383 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
5386 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5390 if (REG_P (target) && !cleared)
5391 emit_clobber (target);
5393 /* Store each element of the constructor into the
5394 corresponding field of TARGET. */
5395 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, field, value)
5397 enum machine_mode mode;
5398 HOST_WIDE_INT bitsize;
5399 HOST_WIDE_INT bitpos = 0;
5401 rtx to_rtx = target;
5403 /* Just ignore missing fields. We cleared the whole
5404 structure, above, if any fields are missing. */
5408 if (cleared && initializer_zerop (value))
5411 if (host_integerp (DECL_SIZE (field), 1))
5412 bitsize = tree_low_cst (DECL_SIZE (field), 1);
5416 mode = DECL_MODE (field);
5417 if (DECL_BIT_FIELD (field))
5420 offset = DECL_FIELD_OFFSET (field);
5421 if (host_integerp (offset, 0)
5422 && host_integerp (bit_position (field), 0))
5424 bitpos = int_bit_position (field);
5428 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
5432 enum machine_mode address_mode;
5436 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
5437 make_tree (TREE_TYPE (exp),
5440 offset_rtx = expand_normal (offset);
5441 gcc_assert (MEM_P (to_rtx));
5444 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
5445 if (GET_MODE (offset_rtx) != address_mode)
5446 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
5448 to_rtx = offset_address (to_rtx, offset_rtx,
5449 highest_pow2_factor (offset));
5452 #ifdef WORD_REGISTER_OPERATIONS
5453 /* If this initializes a field that is smaller than a
5454 word, at the start of a word, try to widen it to a full
5455 word. This special case allows us to output C++ member
5456 function initializations in a form that the optimizers
5459 && bitsize < BITS_PER_WORD
5460 && bitpos % BITS_PER_WORD == 0
5461 && GET_MODE_CLASS (mode) == MODE_INT
5462 && TREE_CODE (value) == INTEGER_CST
5464 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5466 tree type = TREE_TYPE (value);
5468 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5470 type = lang_hooks.types.type_for_size
5471 (BITS_PER_WORD, TYPE_UNSIGNED (type));
5472 value = fold_convert (type, value);
5475 if (BYTES_BIG_ENDIAN)
5477 = fold_build2 (LSHIFT_EXPR, type, value,
5478 build_int_cst (type,
5479 BITS_PER_WORD - bitsize));
5480 bitsize = BITS_PER_WORD;
5485 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5486 && DECL_NONADDRESSABLE_P (field))
5488 to_rtx = copy_rtx (to_rtx);
5489 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5492 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5493 value, type, cleared,
5494 get_alias_set (TREE_TYPE (field)));
5501 unsigned HOST_WIDE_INT i;
5504 tree elttype = TREE_TYPE (type);
5506 HOST_WIDE_INT minelt = 0;
5507 HOST_WIDE_INT maxelt = 0;
5509 domain = TYPE_DOMAIN (type);
5510 const_bounds_p = (TYPE_MIN_VALUE (domain)
5511 && TYPE_MAX_VALUE (domain)
5512 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5513 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5515 /* If we have constant bounds for the range of the type, get them. */
5518 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5519 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5522 /* If the constructor has fewer elements than the array, clear
5523 the whole array first. Similarly if this is static
5524 constructor of a non-BLKmode object. */
5527 else if (REG_P (target) && TREE_STATIC (exp))
5531 unsigned HOST_WIDE_INT idx;
5533 HOST_WIDE_INT count = 0, zero_count = 0;
5534 need_to_clear = ! const_bounds_p;
5536 /* This loop is a more accurate version of the loop in
5537 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5538 is also needed to check for missing elements. */
5539 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, index, value)
5541 HOST_WIDE_INT this_node_count;
5546 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5548 tree lo_index = TREE_OPERAND (index, 0);
5549 tree hi_index = TREE_OPERAND (index, 1);
5551 if (! host_integerp (lo_index, 1)
5552 || ! host_integerp (hi_index, 1))
5558 this_node_count = (tree_low_cst (hi_index, 1)
5559 - tree_low_cst (lo_index, 1) + 1);
5562 this_node_count = 1;
5564 count += this_node_count;
5565 if (mostly_zeros_p (value))
5566 zero_count += this_node_count;
5569 /* Clear the entire array first if there are any missing
5570 elements, or if the incidence of zero elements is >=
5573 && (count < maxelt - minelt + 1
5574 || 4 * zero_count >= 3 * count))
5578 if (need_to_clear && size > 0)
5581 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5583 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5587 if (!cleared && REG_P (target))
5588 /* Inform later passes that the old value is dead. */
5589 emit_clobber (target);
5591 /* Store each element of the constructor into the
5592 corresponding element of TARGET, determined by counting the
5594 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), i, index, value)
5596 enum machine_mode mode;
5597 HOST_WIDE_INT bitsize;
5598 HOST_WIDE_INT bitpos;
5599 rtx xtarget = target;
5601 if (cleared && initializer_zerop (value))
5604 mode = TYPE_MODE (elttype);
5605 if (mode == BLKmode)
5606 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
5607 ? tree_low_cst (TYPE_SIZE (elttype), 1)
5610 bitsize = GET_MODE_BITSIZE (mode);
5612 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5614 tree lo_index = TREE_OPERAND (index, 0);
5615 tree hi_index = TREE_OPERAND (index, 1);
5616 rtx index_r, pos_rtx;
5617 HOST_WIDE_INT lo, hi, count;
5620 /* If the range is constant and "small", unroll the loop. */
5622 && host_integerp (lo_index, 0)
5623 && host_integerp (hi_index, 0)
5624 && (lo = tree_low_cst (lo_index, 0),
5625 hi = tree_low_cst (hi_index, 0),
5626 count = hi - lo + 1,
5629 || (host_integerp (TYPE_SIZE (elttype), 1)
5630 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
5633 lo -= minelt; hi -= minelt;
5634 for (; lo <= hi; lo++)
5636 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
5639 && !MEM_KEEP_ALIAS_SET_P (target)
5640 && TREE_CODE (type) == ARRAY_TYPE
5641 && TYPE_NONALIASED_COMPONENT (type))
5643 target = copy_rtx (target);
5644 MEM_KEEP_ALIAS_SET_P (target) = 1;
5647 store_constructor_field
5648 (target, bitsize, bitpos, mode, value, type, cleared,
5649 get_alias_set (elttype));
5654 rtx loop_start = gen_label_rtx ();
5655 rtx loop_end = gen_label_rtx ();
5658 expand_normal (hi_index);
5660 index = build_decl (EXPR_LOCATION (exp),
5661 VAR_DECL, NULL_TREE, domain);
5662 index_r = gen_reg_rtx (promote_decl_mode (index, NULL));
5663 SET_DECL_RTL (index, index_r);
5664 store_expr (lo_index, index_r, 0, false);
5666 /* Build the head of the loop. */
5667 do_pending_stack_adjust ();
5668 emit_label (loop_start);
5670 /* Assign value to element index. */
5672 fold_convert (ssizetype,
5673 fold_build2 (MINUS_EXPR,
5676 TYPE_MIN_VALUE (domain)));
5679 size_binop (MULT_EXPR, position,
5680 fold_convert (ssizetype,
5681 TYPE_SIZE_UNIT (elttype)));
5683 pos_rtx = expand_normal (position);
5684 xtarget = offset_address (target, pos_rtx,
5685 highest_pow2_factor (position));
5686 xtarget = adjust_address (xtarget, mode, 0);
5687 if (TREE_CODE (value) == CONSTRUCTOR)
5688 store_constructor (value, xtarget, cleared,
5689 bitsize / BITS_PER_UNIT);
5691 store_expr (value, xtarget, 0, false);
5693 /* Generate a conditional jump to exit the loop. */
5694 exit_cond = build2 (LT_EXPR, integer_type_node,
5696 jumpif (exit_cond, loop_end, -1);
5698 /* Update the loop counter, and jump to the head of
5700 expand_assignment (index,
5701 build2 (PLUS_EXPR, TREE_TYPE (index),
5702 index, integer_one_node),
5705 emit_jump (loop_start);
5707 /* Build the end of the loop. */
5708 emit_label (loop_end);
5711 else if ((index != 0 && ! host_integerp (index, 0))
5712 || ! host_integerp (TYPE_SIZE (elttype), 1))
5717 index = ssize_int (1);
5720 index = fold_convert (ssizetype,
5721 fold_build2 (MINUS_EXPR,
5724 TYPE_MIN_VALUE (domain)));
5727 size_binop (MULT_EXPR, index,
5728 fold_convert (ssizetype,
5729 TYPE_SIZE_UNIT (elttype)));
5730 xtarget = offset_address (target,
5731 expand_normal (position),
5732 highest_pow2_factor (position));
5733 xtarget = adjust_address (xtarget, mode, 0);
5734 store_expr (value, xtarget, 0, false);
5739 bitpos = ((tree_low_cst (index, 0) - minelt)
5740 * tree_low_cst (TYPE_SIZE (elttype), 1));
5742 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5744 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5745 && TREE_CODE (type) == ARRAY_TYPE
5746 && TYPE_NONALIASED_COMPONENT (type))
5748 target = copy_rtx (target);
5749 MEM_KEEP_ALIAS_SET_P (target) = 1;
5751 store_constructor_field (target, bitsize, bitpos, mode, value,
5752 type, cleared, get_alias_set (elttype));
5760 unsigned HOST_WIDE_INT idx;
5761 constructor_elt *ce;
5765 tree elttype = TREE_TYPE (type);
5766 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5767 enum machine_mode eltmode = TYPE_MODE (elttype);
5768 HOST_WIDE_INT bitsize;
5769 HOST_WIDE_INT bitpos;
5770 rtvec vector = NULL;
5772 alias_set_type alias;
5774 gcc_assert (eltmode != BLKmode);
5776 n_elts = TYPE_VECTOR_SUBPARTS (type);
5777 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5779 enum machine_mode mode = GET_MODE (target);
5781 icode = (int) optab_handler (vec_init_optab, mode);
5782 if (icode != CODE_FOR_nothing)
5786 vector = rtvec_alloc (n_elts);
5787 for (i = 0; i < n_elts; i++)
5788 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5792 /* If the constructor has fewer elements than the vector,
5793 clear the whole array first. Similarly if this is static
5794 constructor of a non-BLKmode object. */
5797 else if (REG_P (target) && TREE_STATIC (exp))
5801 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5804 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
5806 int n_elts_here = tree_low_cst
5807 (int_const_binop (TRUNC_DIV_EXPR,
5808 TYPE_SIZE (TREE_TYPE (value)),
5809 TYPE_SIZE (elttype), 0), 1);
5811 count += n_elts_here;
5812 if (mostly_zeros_p (value))
5813 zero_count += n_elts_here;
5816 /* Clear the entire vector first if there are any missing elements,
5817 or if the incidence of zero elements is >= 75%. */
5818 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5821 if (need_to_clear && size > 0 && !vector)
5824 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5826 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5830 /* Inform later passes that the old value is dead. */
5831 if (!cleared && !vector && REG_P (target))
5832 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5835 alias = MEM_ALIAS_SET (target);
5837 alias = get_alias_set (elttype);
5839 /* Store each element of the constructor into the corresponding
5840 element of TARGET, determined by counting the elements. */
5841 for (idx = 0, i = 0;
5842 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
5843 idx++, i += bitsize / elt_size)
5845 HOST_WIDE_INT eltpos;
5846 tree value = ce->value;
5848 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5849 if (cleared && initializer_zerop (value))
5853 eltpos = tree_low_cst (ce->index, 1);
5859 /* Vector CONSTRUCTORs should only be built from smaller
5860 vectors in the case of BLKmode vectors. */
5861 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5862 RTVEC_ELT (vector, eltpos)
5863 = expand_normal (value);
5867 enum machine_mode value_mode =
5868 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5869 ? TYPE_MODE (TREE_TYPE (value))
5871 bitpos = eltpos * elt_size;
5872 store_constructor_field (target, bitsize, bitpos,
5873 value_mode, value, type,
5879 emit_insn (GEN_FCN (icode)
5881 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5890 /* Store the value of EXP (an expression tree)
5891 into a subfield of TARGET which has mode MODE and occupies
5892 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5893 If MODE is VOIDmode, it means that we are storing into a bit-field.
5895 Always return const0_rtx unless we have something particular to
5898 TYPE is the type of the underlying object,
5900 ALIAS_SET is the alias set for the destination. This value will
5901 (in general) be different from that for TARGET, since TARGET is a
5902 reference to the containing structure.
5904 If NONTEMPORAL is true, try generating a nontemporal store. */
5907 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5908 enum machine_mode mode, tree exp, tree type,
5909 alias_set_type alias_set, bool nontemporal)
5911 if (TREE_CODE (exp) == ERROR_MARK)
5914 /* If we have nothing to store, do nothing unless the expression has
5917 return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5919 /* If we are storing into an unaligned field of an aligned union that is
5920 in a register, we may have the mode of TARGET being an integer mode but
5921 MODE == BLKmode. In that case, get an aligned object whose size and
5922 alignment are the same as TARGET and store TARGET into it (we can avoid
5923 the store if the field being stored is the entire width of TARGET). Then
5924 call ourselves recursively to store the field into a BLKmode version of
5925 that object. Finally, load from the object into TARGET. This is not
5926 very efficient in general, but should only be slightly more expensive
5927 than the otherwise-required unaligned accesses. Perhaps this can be
5928 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5929 twice, once with emit_move_insn and once via store_field. */
5932 && (REG_P (target) || GET_CODE (target) == SUBREG))
5934 rtx object = assign_temp (type, 0, 1, 1);
5935 rtx blk_object = adjust_address (object, BLKmode, 0);
5937 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5938 emit_move_insn (object, target);
5940 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set,
5943 emit_move_insn (target, object);
5945 /* We want to return the BLKmode version of the data. */
5949 if (GET_CODE (target) == CONCAT)
5951 /* We're storing into a struct containing a single __complex. */
5953 gcc_assert (!bitpos);
5954 return store_expr (exp, target, 0, nontemporal);
5957 /* If the structure is in a register or if the component
5958 is a bit field, we cannot use addressing to access it.
5959 Use bit-field techniques or SUBREG to store in it. */
5961 if (mode == VOIDmode
5962 || (mode != BLKmode && ! direct_store[(int) mode]
5963 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5964 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5966 || GET_CODE (target) == SUBREG
5967 /* If the field isn't aligned enough to store as an ordinary memref,
5968 store it as a bit field. */
5970 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5971 || bitpos % GET_MODE_ALIGNMENT (mode))
5972 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5973 || (bitpos % BITS_PER_UNIT != 0)))
5974 || (bitsize >= 0 && mode != BLKmode
5975 && GET_MODE_BITSIZE (mode) > bitsize)
5976 /* If the RHS and field are a constant size and the size of the
5977 RHS isn't the same size as the bitfield, we must use bitfield
5980 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5981 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0)
5982 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
5983 decl we must use bitfield operations. */
5985 && TREE_CODE (exp) == MEM_REF
5986 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
5987 && DECL_P (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
5988 && !TREE_ADDRESSABLE (TREE_OPERAND (TREE_OPERAND (exp, 0),0 ))
5989 && DECL_MODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) != BLKmode))
5994 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5995 implies a mask operation. If the precision is the same size as
5996 the field we're storing into, that mask is redundant. This is
5997 particularly common with bit field assignments generated by the
5999 nop_def = get_def_for_expr (exp, NOP_EXPR);
6002 tree type = TREE_TYPE (exp);
6003 if (INTEGRAL_TYPE_P (type)
6004 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
6005 && bitsize == TYPE_PRECISION (type))
6007 tree op = gimple_assign_rhs1 (nop_def);
6008 type = TREE_TYPE (op);
6009 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
6014 temp = expand_normal (exp);
6016 /* If BITSIZE is narrower than the size of the type of EXP
6017 we will be narrowing TEMP. Normally, what's wanted are the
6018 low-order bits. However, if EXP's type is a record and this is
6019 big-endian machine, we want the upper BITSIZE bits. */
6020 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
6021 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
6022 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
6023 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
6024 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
6028 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
6030 if (mode != VOIDmode && mode != BLKmode
6031 && mode != TYPE_MODE (TREE_TYPE (exp)))
6032 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
6034 /* If the modes of TEMP and TARGET are both BLKmode, both
6035 must be in memory and BITPOS must be aligned on a byte
6036 boundary. If so, we simply do a block copy. Likewise
6037 for a BLKmode-like TARGET. */
6038 if (GET_MODE (temp) == BLKmode
6039 && (GET_MODE (target) == BLKmode
6041 && GET_MODE_CLASS (GET_MODE (target)) == MODE_INT
6042 && (bitpos % BITS_PER_UNIT) == 0
6043 && (bitsize % BITS_PER_UNIT) == 0)))
6045 gcc_assert (MEM_P (target) && MEM_P (temp)
6046 && (bitpos % BITS_PER_UNIT) == 0);
6048 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
6049 emit_block_move (target, temp,
6050 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
6057 /* Store the value in the bitfield. */
6058 store_bit_field (target, bitsize, bitpos, mode, temp);
6064 /* Now build a reference to just the desired component. */
6065 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
6067 if (to_rtx == target)
6068 to_rtx = copy_rtx (to_rtx);
6070 if (!MEM_SCALAR_P (to_rtx))
6071 MEM_IN_STRUCT_P (to_rtx) = 1;
6072 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
6073 set_mem_alias_set (to_rtx, alias_set);
6075 return store_expr (exp, to_rtx, 0, nontemporal);
6079 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
6080 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
6081 codes and find the ultimate containing object, which we return.
6083 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
6084 bit position, and *PUNSIGNEDP to the signedness of the field.
6085 If the position of the field is variable, we store a tree
6086 giving the variable offset (in units) in *POFFSET.
6087 This offset is in addition to the bit position.
6088 If the position is not variable, we store 0 in *POFFSET.
6090 If any of the extraction expressions is volatile,
6091 we store 1 in *PVOLATILEP. Otherwise we don't change that.
6093 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
6094 Otherwise, it is a mode that can be used to access the field.
6096 If the field describes a variable-sized object, *PMODE is set to
6097 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
6098 this case, but the address of the object can be found.
6100 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
6101 look through nodes that serve as markers of a greater alignment than
6102 the one that can be deduced from the expression. These nodes make it
6103 possible for front-ends to prevent temporaries from being created by
6104 the middle-end on alignment considerations. For that purpose, the
6105 normal operating mode at high-level is to always pass FALSE so that
6106 the ultimate containing object is really returned; moreover, the
6107 associated predicate handled_component_p will always return TRUE
6108 on these nodes, thus indicating that they are essentially handled
6109 by get_inner_reference. TRUE should only be passed when the caller
6110 is scanning the expression in order to build another representation
6111 and specifically knows how to handle these nodes; as such, this is
6112 the normal operating mode in the RTL expanders. */
6115 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
6116 HOST_WIDE_INT *pbitpos, tree *poffset,
6117 enum machine_mode *pmode, int *punsignedp,
6118 int *pvolatilep, bool keep_aligning)
6121 enum machine_mode mode = VOIDmode;
6122 bool blkmode_bitfield = false;
6123 tree offset = size_zero_node;
6124 double_int bit_offset = double_int_zero;
6126 /* First get the mode, signedness, and size. We do this from just the
6127 outermost expression. */
6129 if (TREE_CODE (exp) == COMPONENT_REF)
6131 tree field = TREE_OPERAND (exp, 1);
6132 size_tree = DECL_SIZE (field);
6133 if (!DECL_BIT_FIELD (field))
6134 mode = DECL_MODE (field);
6135 else if (DECL_MODE (field) == BLKmode)
6136 blkmode_bitfield = true;
6137 else if (TREE_THIS_VOLATILE (exp)
6138 && flag_strict_volatile_bitfields > 0)
6139 /* Volatile bitfields should be accessed in the mode of the
6140 field's type, not the mode computed based on the bit
6142 mode = TYPE_MODE (DECL_BIT_FIELD_TYPE (field));
6144 *punsignedp = DECL_UNSIGNED (field);
6146 else if (TREE_CODE (exp) == BIT_FIELD_REF)
6148 size_tree = TREE_OPERAND (exp, 1);
6149 *punsignedp = (! INTEGRAL_TYPE_P (TREE_TYPE (exp))
6150 || TYPE_UNSIGNED (TREE_TYPE (exp)));
6152 /* For vector types, with the correct size of access, use the mode of
6154 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == VECTOR_TYPE
6155 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))
6156 && tree_int_cst_equal (size_tree, TYPE_SIZE (TREE_TYPE (exp))))
6157 mode = TYPE_MODE (TREE_TYPE (exp));
6161 mode = TYPE_MODE (TREE_TYPE (exp));
6162 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
6164 if (mode == BLKmode)
6165 size_tree = TYPE_SIZE (TREE_TYPE (exp));
6167 *pbitsize = GET_MODE_BITSIZE (mode);
6172 if (! host_integerp (size_tree, 1))
6173 mode = BLKmode, *pbitsize = -1;
6175 *pbitsize = tree_low_cst (size_tree, 1);
6178 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6179 and find the ultimate containing object. */
6182 switch (TREE_CODE (exp))
6186 = double_int_add (bit_offset,
6187 tree_to_double_int (TREE_OPERAND (exp, 2)));
6192 tree field = TREE_OPERAND (exp, 1);
6193 tree this_offset = component_ref_field_offset (exp);
6195 /* If this field hasn't been filled in yet, don't go past it.
6196 This should only happen when folding expressions made during
6197 type construction. */
6198 if (this_offset == 0)
6201 offset = size_binop (PLUS_EXPR, offset, this_offset);
6202 bit_offset = double_int_add (bit_offset,
6204 (DECL_FIELD_BIT_OFFSET (field)));
6206 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6211 case ARRAY_RANGE_REF:
6213 tree index = TREE_OPERAND (exp, 1);
6214 tree low_bound = array_ref_low_bound (exp);
6215 tree unit_size = array_ref_element_size (exp);
6217 /* We assume all arrays have sizes that are a multiple of a byte.
6218 First subtract the lower bound, if any, in the type of the
6219 index, then convert to sizetype and multiply by the size of
6220 the array element. */
6221 if (! integer_zerop (low_bound))
6222 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
6225 offset = size_binop (PLUS_EXPR, offset,
6226 size_binop (MULT_EXPR,
6227 fold_convert (sizetype, index),
6236 bit_offset = double_int_add (bit_offset,
6237 uhwi_to_double_int (*pbitsize));
6240 case VIEW_CONVERT_EXPR:
6241 if (keep_aligning && STRICT_ALIGNMENT
6242 && (TYPE_ALIGN (TREE_TYPE (exp))
6243 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
6244 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
6245 < BIGGEST_ALIGNMENT)
6246 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
6247 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
6252 /* Hand back the decl for MEM[&decl, off]. */
6253 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)
6255 tree off = TREE_OPERAND (exp, 1);
6256 if (!integer_zerop (off))
6258 double_int boff, coff = mem_ref_offset (exp);
6259 boff = double_int_lshift (coff,
6261 ? 3 : exact_log2 (BITS_PER_UNIT),
6262 HOST_BITS_PER_DOUBLE_INT, true);
6263 bit_offset = double_int_add (bit_offset, boff);
6265 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
6273 /* If any reference in the chain is volatile, the effect is volatile. */
6274 if (TREE_THIS_VOLATILE (exp))
6277 exp = TREE_OPERAND (exp, 0);
6281 /* If OFFSET is constant, see if we can return the whole thing as a
6282 constant bit position. Make sure to handle overflow during
6284 if (host_integerp (offset, 0))
6286 double_int tem = double_int_lshift (tree_to_double_int (offset),
6288 ? 3 : exact_log2 (BITS_PER_UNIT),
6289 HOST_BITS_PER_DOUBLE_INT, true);
6290 tem = double_int_add (tem, bit_offset);
6291 if (double_int_fits_in_shwi_p (tem))
6293 *pbitpos = double_int_to_shwi (tem);
6294 *poffset = offset = NULL_TREE;
6298 /* Otherwise, split it up. */
6301 /* Avoid returning a negative bitpos as this may wreak havoc later. */
6302 if (double_int_negative_p (bit_offset))
6305 = double_int_mask (BITS_PER_UNIT == 8
6306 ? 3 : exact_log2 (BITS_PER_UNIT));
6307 double_int tem = double_int_and_not (bit_offset, mask);
6308 /* TEM is the bitpos rounded to BITS_PER_UNIT towards -Inf.
6309 Subtract it to BIT_OFFSET and add it (scaled) to OFFSET. */
6310 bit_offset = double_int_sub (bit_offset, tem);
6311 tem = double_int_rshift (tem,
6313 ? 3 : exact_log2 (BITS_PER_UNIT),
6314 HOST_BITS_PER_DOUBLE_INT, true);
6315 offset = size_binop (PLUS_EXPR, offset,
6316 double_int_to_tree (sizetype, tem));
6319 *pbitpos = double_int_to_shwi (bit_offset);
6323 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6324 if (mode == VOIDmode
6326 && (*pbitpos % BITS_PER_UNIT) == 0
6327 && (*pbitsize % BITS_PER_UNIT) == 0)
6335 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
6336 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
6337 EXP is marked as PACKED. */
6340 contains_packed_reference (const_tree exp)
6342 bool packed_p = false;
6346 switch (TREE_CODE (exp))
6350 tree field = TREE_OPERAND (exp, 1);
6351 packed_p = DECL_PACKED (field)
6352 || TYPE_PACKED (TREE_TYPE (field))
6353 || TYPE_PACKED (TREE_TYPE (exp));
6361 case ARRAY_RANGE_REF:
6364 case VIEW_CONVERT_EXPR:
6370 exp = TREE_OPERAND (exp, 0);
6376 /* Return a tree of sizetype representing the size, in bytes, of the element
6377 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6380 array_ref_element_size (tree exp)
6382 tree aligned_size = TREE_OPERAND (exp, 3);
6383 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6384 location_t loc = EXPR_LOCATION (exp);
6386 /* If a size was specified in the ARRAY_REF, it's the size measured
6387 in alignment units of the element type. So multiply by that value. */
6390 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6391 sizetype from another type of the same width and signedness. */
6392 if (TREE_TYPE (aligned_size) != sizetype)
6393 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
6394 return size_binop_loc (loc, MULT_EXPR, aligned_size,
6395 size_int (TYPE_ALIGN_UNIT (elmt_type)));
6398 /* Otherwise, take the size from that of the element type. Substitute
6399 any PLACEHOLDER_EXPR that we have. */
6401 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
6404 /* Return a tree representing the lower bound of the array mentioned in
6405 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6408 array_ref_low_bound (tree exp)
6410 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6412 /* If a lower bound is specified in EXP, use it. */
6413 if (TREE_OPERAND (exp, 2))
6414 return TREE_OPERAND (exp, 2);
6416 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6417 substituting for a PLACEHOLDER_EXPR as needed. */
6418 if (domain_type && TYPE_MIN_VALUE (domain_type))
6419 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
6421 /* Otherwise, return a zero of the appropriate type. */
6422 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
6425 /* Return a tree representing the upper bound of the array mentioned in
6426 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6429 array_ref_up_bound (tree exp)
6431 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6433 /* If there is a domain type and it has an upper bound, use it, substituting
6434 for a PLACEHOLDER_EXPR as needed. */
6435 if (domain_type && TYPE_MAX_VALUE (domain_type))
6436 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
6438 /* Otherwise fail. */
6442 /* Return a tree representing the offset, in bytes, of the field referenced
6443 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6446 component_ref_field_offset (tree exp)
6448 tree aligned_offset = TREE_OPERAND (exp, 2);
6449 tree field = TREE_OPERAND (exp, 1);
6450 location_t loc = EXPR_LOCATION (exp);
6452 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6453 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6457 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6458 sizetype from another type of the same width and signedness. */
6459 if (TREE_TYPE (aligned_offset) != sizetype)
6460 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
6461 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
6462 size_int (DECL_OFFSET_ALIGN (field)
6466 /* Otherwise, take the offset from that of the field. Substitute
6467 any PLACEHOLDER_EXPR that we have. */
6469 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
6472 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6474 static unsigned HOST_WIDE_INT
6475 target_align (const_tree target)
6477 /* We might have a chain of nested references with intermediate misaligning
6478 bitfields components, so need to recurse to find out. */
6480 unsigned HOST_WIDE_INT this_align, outer_align;
6482 switch (TREE_CODE (target))
6488 this_align = DECL_ALIGN (TREE_OPERAND (target, 1));
6489 outer_align = target_align (TREE_OPERAND (target, 0));
6490 return MIN (this_align, outer_align);
6493 case ARRAY_RANGE_REF:
6494 this_align = TYPE_ALIGN (TREE_TYPE (target));
6495 outer_align = target_align (TREE_OPERAND (target, 0));
6496 return MIN (this_align, outer_align);
6499 case NON_LVALUE_EXPR:
6500 case VIEW_CONVERT_EXPR:
6501 this_align = TYPE_ALIGN (TREE_TYPE (target));
6502 outer_align = target_align (TREE_OPERAND (target, 0));
6503 return MAX (this_align, outer_align);
6506 return TYPE_ALIGN (TREE_TYPE (target));
6511 /* Given an rtx VALUE that may contain additions and multiplications, return
6512 an equivalent value that just refers to a register, memory, or constant.
6513 This is done by generating instructions to perform the arithmetic and
6514 returning a pseudo-register containing the value.
6516 The returned value may be a REG, SUBREG, MEM or constant. */
6519 force_operand (rtx value, rtx target)
6522 /* Use subtarget as the target for operand 0 of a binary operation. */
6523 rtx subtarget = get_subtarget (target);
6524 enum rtx_code code = GET_CODE (value);
6526 /* Check for subreg applied to an expression produced by loop optimizer. */
6528 && !REG_P (SUBREG_REG (value))
6529 && !MEM_P (SUBREG_REG (value)))
6532 = simplify_gen_subreg (GET_MODE (value),
6533 force_reg (GET_MODE (SUBREG_REG (value)),
6534 force_operand (SUBREG_REG (value),
6536 GET_MODE (SUBREG_REG (value)),
6537 SUBREG_BYTE (value));
6538 code = GET_CODE (value);
6541 /* Check for a PIC address load. */
6542 if ((code == PLUS || code == MINUS)
6543 && XEXP (value, 0) == pic_offset_table_rtx
6544 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
6545 || GET_CODE (XEXP (value, 1)) == LABEL_REF
6546 || GET_CODE (XEXP (value, 1)) == CONST))
6549 subtarget = gen_reg_rtx (GET_MODE (value));
6550 emit_move_insn (subtarget, value);
6554 if (ARITHMETIC_P (value))
6556 op2 = XEXP (value, 1);
6557 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
6559 if (code == MINUS && CONST_INT_P (op2))
6562 op2 = negate_rtx (GET_MODE (value), op2);
6565 /* Check for an addition with OP2 a constant integer and our first
6566 operand a PLUS of a virtual register and something else. In that
6567 case, we want to emit the sum of the virtual register and the
6568 constant first and then add the other value. This allows virtual
6569 register instantiation to simply modify the constant rather than
6570 creating another one around this addition. */
6571 if (code == PLUS && CONST_INT_P (op2)
6572 && GET_CODE (XEXP (value, 0)) == PLUS
6573 && REG_P (XEXP (XEXP (value, 0), 0))
6574 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6575 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
6577 rtx temp = expand_simple_binop (GET_MODE (value), code,
6578 XEXP (XEXP (value, 0), 0), op2,
6579 subtarget, 0, OPTAB_LIB_WIDEN);
6580 return expand_simple_binop (GET_MODE (value), code, temp,
6581 force_operand (XEXP (XEXP (value,
6583 target, 0, OPTAB_LIB_WIDEN);
6586 op1 = force_operand (XEXP (value, 0), subtarget);
6587 op2 = force_operand (op2, NULL_RTX);
6591 return expand_mult (GET_MODE (value), op1, op2, target, 1);
6593 if (!INTEGRAL_MODE_P (GET_MODE (value)))
6594 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6595 target, 1, OPTAB_LIB_WIDEN);
6597 return expand_divmod (0,
6598 FLOAT_MODE_P (GET_MODE (value))
6599 ? RDIV_EXPR : TRUNC_DIV_EXPR,
6600 GET_MODE (value), op1, op2, target, 0);
6602 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6605 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
6608 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6611 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6612 target, 0, OPTAB_LIB_WIDEN);
6614 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6615 target, 1, OPTAB_LIB_WIDEN);
6618 if (UNARY_P (value))
6621 target = gen_reg_rtx (GET_MODE (value));
6622 op1 = force_operand (XEXP (value, 0), NULL_RTX);
6629 case FLOAT_TRUNCATE:
6630 convert_move (target, op1, code == ZERO_EXTEND);
6635 expand_fix (target, op1, code == UNSIGNED_FIX);
6639 case UNSIGNED_FLOAT:
6640 expand_float (target, op1, code == UNSIGNED_FLOAT);
6644 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
6648 #ifdef INSN_SCHEDULING
6649 /* On machines that have insn scheduling, we want all memory reference to be
6650 explicit, so we need to deal with such paradoxical SUBREGs. */
6651 if (GET_CODE (value) == SUBREG && MEM_P (SUBREG_REG (value))
6652 && (GET_MODE_SIZE (GET_MODE (value))
6653 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
6655 = simplify_gen_subreg (GET_MODE (value),
6656 force_reg (GET_MODE (SUBREG_REG (value)),
6657 force_operand (SUBREG_REG (value),
6659 GET_MODE (SUBREG_REG (value)),
6660 SUBREG_BYTE (value));
6666 /* Subroutine of expand_expr: return nonzero iff there is no way that
6667 EXP can reference X, which is being modified. TOP_P is nonzero if this
6668 call is going to be used to determine whether we need a temporary
6669 for EXP, as opposed to a recursive call to this function.
6671 It is always safe for this routine to return zero since it merely
6672 searches for optimization opportunities. */
6675 safe_from_p (const_rtx x, tree exp, int top_p)
6681 /* If EXP has varying size, we MUST use a target since we currently
6682 have no way of allocating temporaries of variable size
6683 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6684 So we assume here that something at a higher level has prevented a
6685 clash. This is somewhat bogus, but the best we can do. Only
6686 do this when X is BLKmode and when we are at the top level. */
6687 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6688 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
6689 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
6690 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
6691 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
6693 && GET_MODE (x) == BLKmode)
6694 /* If X is in the outgoing argument area, it is always safe. */
6696 && (XEXP (x, 0) == virtual_outgoing_args_rtx
6697 || (GET_CODE (XEXP (x, 0)) == PLUS
6698 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
6701 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6702 find the underlying pseudo. */
6703 if (GET_CODE (x) == SUBREG)
6706 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6710 /* Now look at our tree code and possibly recurse. */
6711 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
6713 case tcc_declaration:
6714 exp_rtl = DECL_RTL_IF_SET (exp);
6720 case tcc_exceptional:
6721 if (TREE_CODE (exp) == TREE_LIST)
6725 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
6727 exp = TREE_CHAIN (exp);
6730 if (TREE_CODE (exp) != TREE_LIST)
6731 return safe_from_p (x, exp, 0);
6734 else if (TREE_CODE (exp) == CONSTRUCTOR)
6736 constructor_elt *ce;
6737 unsigned HOST_WIDE_INT idx;
6739 FOR_EACH_VEC_ELT (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce)
6740 if ((ce->index != NULL_TREE && !safe_from_p (x, ce->index, 0))
6741 || !safe_from_p (x, ce->value, 0))
6745 else if (TREE_CODE (exp) == ERROR_MARK)
6746 return 1; /* An already-visited SAVE_EXPR? */
6751 /* The only case we look at here is the DECL_INITIAL inside a
6753 return (TREE_CODE (exp) != DECL_EXPR
6754 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
6755 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
6756 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
6759 case tcc_comparison:
6760 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
6765 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6767 case tcc_expression:
6770 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6771 the expression. If it is set, we conflict iff we are that rtx or
6772 both are in memory. Otherwise, we check all operands of the
6773 expression recursively. */
6775 switch (TREE_CODE (exp))
6778 /* If the operand is static or we are static, we can't conflict.
6779 Likewise if we don't conflict with the operand at all. */
6780 if (staticp (TREE_OPERAND (exp, 0))
6781 || TREE_STATIC (exp)
6782 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
6785 /* Otherwise, the only way this can conflict is if we are taking
6786 the address of a DECL a that address if part of X, which is
6788 exp = TREE_OPERAND (exp, 0);
6791 if (!DECL_RTL_SET_P (exp)
6792 || !MEM_P (DECL_RTL (exp)))
6795 exp_rtl = XEXP (DECL_RTL (exp), 0);
6801 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
6802 get_alias_set (exp)))
6807 /* Assume that the call will clobber all hard registers and
6809 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6814 case WITH_CLEANUP_EXPR:
6815 case CLEANUP_POINT_EXPR:
6816 /* Lowered by gimplify.c. */
6820 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6826 /* If we have an rtx, we do not need to scan our operands. */
6830 nops = TREE_OPERAND_LENGTH (exp);
6831 for (i = 0; i < nops; i++)
6832 if (TREE_OPERAND (exp, i) != 0
6833 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
6839 /* Should never get a type here. */
6843 /* If we have an rtl, find any enclosed object. Then see if we conflict
6847 if (GET_CODE (exp_rtl) == SUBREG)
6849 exp_rtl = SUBREG_REG (exp_rtl);
6851 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
6855 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6856 are memory and they conflict. */
6857 return ! (rtx_equal_p (x, exp_rtl)
6858 || (MEM_P (x) && MEM_P (exp_rtl)
6859 && true_dependence (exp_rtl, VOIDmode, x,
6860 rtx_addr_varies_p)));
6863 /* If we reach here, it is safe. */
6868 /* Return the highest power of two that EXP is known to be a multiple of.
6869 This is used in updating alignment of MEMs in array references. */
6871 unsigned HOST_WIDE_INT
6872 highest_pow2_factor (const_tree exp)
6874 unsigned HOST_WIDE_INT c0, c1;
6876 switch (TREE_CODE (exp))
6879 /* We can find the lowest bit that's a one. If the low
6880 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6881 We need to handle this case since we can find it in a COND_EXPR,
6882 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
6883 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6885 if (TREE_OVERFLOW (exp))
6886 return BIGGEST_ALIGNMENT;
6889 /* Note: tree_low_cst is intentionally not used here,
6890 we don't care about the upper bits. */
6891 c0 = TREE_INT_CST_LOW (exp);
6893 return c0 ? c0 : BIGGEST_ALIGNMENT;
6897 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6898 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6899 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6900 return MIN (c0, c1);
6903 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6904 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6907 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6909 if (integer_pow2p (TREE_OPERAND (exp, 1))
6910 && host_integerp (TREE_OPERAND (exp, 1), 1))
6912 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6913 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6914 return MAX (1, c0 / c1);
6919 /* The highest power of two of a bit-and expression is the maximum of
6920 that of its operands. We typically get here for a complex LHS and
6921 a constant negative power of two on the RHS to force an explicit
6922 alignment, so don't bother looking at the LHS. */
6923 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6927 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6930 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6933 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6934 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6935 return MIN (c0, c1);
6944 /* Similar, except that the alignment requirements of TARGET are
6945 taken into account. Assume it is at least as aligned as its
6946 type, unless it is a COMPONENT_REF in which case the layout of
6947 the structure gives the alignment. */
6949 static unsigned HOST_WIDE_INT
6950 highest_pow2_factor_for_target (const_tree target, const_tree exp)
6952 unsigned HOST_WIDE_INT talign = target_align (target) / BITS_PER_UNIT;
6953 unsigned HOST_WIDE_INT factor = highest_pow2_factor (exp);
6955 return MAX (factor, talign);
6958 /* Subroutine of expand_expr. Expand the two operands of a binary
6959 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6960 The value may be stored in TARGET if TARGET is nonzero. The
6961 MODIFIER argument is as documented by expand_expr. */
6964 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6965 enum expand_modifier modifier)
6967 if (! safe_from_p (target, exp1, 1))
6969 if (operand_equal_p (exp0, exp1, 0))
6971 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6972 *op1 = copy_rtx (*op0);
6976 /* If we need to preserve evaluation order, copy exp0 into its own
6977 temporary variable so that it can't be clobbered by exp1. */
6978 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6979 exp0 = save_expr (exp0);
6980 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6981 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6986 /* Return a MEM that contains constant EXP. DEFER is as for
6987 output_constant_def and MODIFIER is as for expand_expr. */
6990 expand_expr_constant (tree exp, int defer, enum expand_modifier modifier)
6994 mem = output_constant_def (exp, defer);
6995 if (modifier != EXPAND_INITIALIZER)
6996 mem = use_anchored_address (mem);
7000 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
7001 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7004 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
7005 enum expand_modifier modifier, addr_space_t as)
7007 rtx result, subtarget;
7009 HOST_WIDE_INT bitsize, bitpos;
7010 int volatilep, unsignedp;
7011 enum machine_mode mode1;
7013 /* If we are taking the address of a constant and are at the top level,
7014 we have to use output_constant_def since we can't call force_const_mem
7016 /* ??? This should be considered a front-end bug. We should not be
7017 generating ADDR_EXPR of something that isn't an LVALUE. The only
7018 exception here is STRING_CST. */
7019 if (CONSTANT_CLASS_P (exp))
7021 result = XEXP (expand_expr_constant (exp, 0, modifier), 0);
7022 if (modifier < EXPAND_SUM)
7023 result = force_operand (result, target);
7027 /* Everything must be something allowed by is_gimple_addressable. */
7028 switch (TREE_CODE (exp))
7031 /* This case will happen via recursion for &a->b. */
7032 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7036 tree tem = TREE_OPERAND (exp, 0);
7037 if (!integer_zerop (TREE_OPERAND (exp, 1)))
7038 tem = build2 (POINTER_PLUS_EXPR, TREE_TYPE (TREE_OPERAND (exp, 1)),
7040 double_int_to_tree (sizetype, mem_ref_offset (exp)));
7041 return expand_expr (tem, target, tmode, modifier);
7045 /* Expand the initializer like constants above. */
7046 result = XEXP (expand_expr_constant (DECL_INITIAL (exp),
7048 if (modifier < EXPAND_SUM)
7049 result = force_operand (result, target);
7053 /* The real part of the complex number is always first, therefore
7054 the address is the same as the address of the parent object. */
7057 inner = TREE_OPERAND (exp, 0);
7061 /* The imaginary part of the complex number is always second.
7062 The expression is therefore always offset by the size of the
7065 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
7066 inner = TREE_OPERAND (exp, 0);
7070 /* If the object is a DECL, then expand it for its rtl. Don't bypass
7071 expand_expr, as that can have various side effects; LABEL_DECLs for
7072 example, may not have their DECL_RTL set yet. Expand the rtl of
7073 CONSTRUCTORs too, which should yield a memory reference for the
7074 constructor's contents. Assume language specific tree nodes can
7075 be expanded in some interesting way. */
7076 gcc_assert (TREE_CODE (exp) < LAST_AND_UNUSED_TREE_CODE);
7078 || TREE_CODE (exp) == CONSTRUCTOR
7079 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
7081 result = expand_expr (exp, target, tmode,
7082 modifier == EXPAND_INITIALIZER
7083 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
7085 if (TREE_ADDRESSABLE (exp)
7087 && ! targetm.calls.allocate_stack_slots_for_args ())
7089 error ("local frame unavailable (naked function?)");
7093 /* If the DECL isn't in memory, then the DECL wasn't properly
7094 marked TREE_ADDRESSABLE, which will be either a front-end
7095 or a tree optimizer bug. */
7096 gcc_assert (MEM_P (result));
7097 result = XEXP (result, 0);
7099 /* ??? Is this needed anymore? */
7100 if (DECL_P (exp) && !TREE_USED (exp) == 0)
7102 assemble_external (exp);
7103 TREE_USED (exp) = 1;
7106 if (modifier != EXPAND_INITIALIZER
7107 && modifier != EXPAND_CONST_ADDRESS)
7108 result = force_operand (result, target);
7112 /* Pass FALSE as the last argument to get_inner_reference although
7113 we are expanding to RTL. The rationale is that we know how to
7114 handle "aligning nodes" here: we can just bypass them because
7115 they won't change the final object whose address will be returned
7116 (they actually exist only for that purpose). */
7117 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
7118 &mode1, &unsignedp, &volatilep, false);
7122 /* We must have made progress. */
7123 gcc_assert (inner != exp);
7125 subtarget = offset || bitpos ? NULL_RTX : target;
7126 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
7127 inner alignment, force the inner to be sufficiently aligned. */
7128 if (CONSTANT_CLASS_P (inner)
7129 && TYPE_ALIGN (TREE_TYPE (inner)) < TYPE_ALIGN (TREE_TYPE (exp)))
7131 inner = copy_node (inner);
7132 TREE_TYPE (inner) = copy_node (TREE_TYPE (inner));
7133 TYPE_ALIGN (TREE_TYPE (inner)) = TYPE_ALIGN (TREE_TYPE (exp));
7134 TYPE_USER_ALIGN (TREE_TYPE (inner)) = 1;
7136 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier, as);
7142 if (modifier != EXPAND_NORMAL)
7143 result = force_operand (result, NULL);
7144 tmp = expand_expr (offset, NULL_RTX, tmode,
7145 modifier == EXPAND_INITIALIZER
7146 ? EXPAND_INITIALIZER : EXPAND_NORMAL);
7148 result = convert_memory_address_addr_space (tmode, result, as);
7149 tmp = convert_memory_address_addr_space (tmode, tmp, as);
7151 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7152 result = simplify_gen_binary (PLUS, tmode, result, tmp);
7155 subtarget = bitpos ? NULL_RTX : target;
7156 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
7157 1, OPTAB_LIB_WIDEN);
7163 /* Someone beforehand should have rejected taking the address
7164 of such an object. */
7165 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
7167 result = plus_constant (result, bitpos / BITS_PER_UNIT);
7168 if (modifier < EXPAND_SUM)
7169 result = force_operand (result, target);
7175 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
7176 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7179 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
7180 enum expand_modifier modifier)
7182 addr_space_t as = ADDR_SPACE_GENERIC;
7183 enum machine_mode address_mode = Pmode;
7184 enum machine_mode pointer_mode = ptr_mode;
7185 enum machine_mode rmode;
7188 /* Target mode of VOIDmode says "whatever's natural". */
7189 if (tmode == VOIDmode)
7190 tmode = TYPE_MODE (TREE_TYPE (exp));
7192 if (POINTER_TYPE_P (TREE_TYPE (exp)))
7194 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
7195 address_mode = targetm.addr_space.address_mode (as);
7196 pointer_mode = targetm.addr_space.pointer_mode (as);
7199 /* We can get called with some Weird Things if the user does silliness
7200 like "(short) &a". In that case, convert_memory_address won't do
7201 the right thing, so ignore the given target mode. */
7202 if (tmode != address_mode && tmode != pointer_mode)
7203 tmode = address_mode;
7205 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
7206 tmode, modifier, as);
7208 /* Despite expand_expr claims concerning ignoring TMODE when not
7209 strictly convenient, stuff breaks if we don't honor it. Note
7210 that combined with the above, we only do this for pointer modes. */
7211 rmode = GET_MODE (result);
7212 if (rmode == VOIDmode)
7215 result = convert_memory_address_addr_space (tmode, result, as);
7220 /* Generate code for computing CONSTRUCTOR EXP.
7221 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7222 is TRUE, instead of creating a temporary variable in memory
7223 NULL is returned and the caller needs to handle it differently. */
7226 expand_constructor (tree exp, rtx target, enum expand_modifier modifier,
7227 bool avoid_temp_mem)
7229 tree type = TREE_TYPE (exp);
7230 enum machine_mode mode = TYPE_MODE (type);
7232 /* Try to avoid creating a temporary at all. This is possible
7233 if all of the initializer is zero.
7234 FIXME: try to handle all [0..255] initializers we can handle
7236 if (TREE_STATIC (exp)
7237 && !TREE_ADDRESSABLE (exp)
7238 && target != 0 && mode == BLKmode
7239 && all_zeros_p (exp))
7241 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
7245 /* All elts simple constants => refer to a constant in memory. But
7246 if this is a non-BLKmode mode, let it store a field at a time
7247 since that should make a CONST_INT or CONST_DOUBLE when we
7248 fold. Likewise, if we have a target we can use, it is best to
7249 store directly into the target unless the type is large enough
7250 that memcpy will be used. If we are making an initializer and
7251 all operands are constant, put it in memory as well.
7253 FIXME: Avoid trying to fill vector constructors piece-meal.
7254 Output them with output_constant_def below unless we're sure
7255 they're zeros. This should go away when vector initializers
7256 are treated like VECTOR_CST instead of arrays. */
7257 if ((TREE_STATIC (exp)
7258 && ((mode == BLKmode
7259 && ! (target != 0 && safe_from_p (target, exp, 1)))
7260 || TREE_ADDRESSABLE (exp)
7261 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7262 && (! MOVE_BY_PIECES_P
7263 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7265 && ! mostly_zeros_p (exp))))
7266 || ((modifier == EXPAND_INITIALIZER || modifier == EXPAND_CONST_ADDRESS)
7267 && TREE_CONSTANT (exp)))
7274 constructor = expand_expr_constant (exp, 1, modifier);
7276 if (modifier != EXPAND_CONST_ADDRESS
7277 && modifier != EXPAND_INITIALIZER
7278 && modifier != EXPAND_SUM)
7279 constructor = validize_mem (constructor);
7284 /* Handle calls that pass values in multiple non-contiguous
7285 locations. The Irix 6 ABI has examples of this. */
7286 if (target == 0 || ! safe_from_p (target, exp, 1)
7287 || GET_CODE (target) == PARALLEL || modifier == EXPAND_STACK_PARM)
7293 = assign_temp (build_qualified_type (type, (TYPE_QUALS (type)
7294 | (TREE_READONLY (exp)
7295 * TYPE_QUAL_CONST))),
7296 0, TREE_ADDRESSABLE (exp), 1);
7299 store_constructor (exp, target, 0, int_expr_size (exp));
7304 /* expand_expr: generate code for computing expression EXP.
7305 An rtx for the computed value is returned. The value is never null.
7306 In the case of a void EXP, const0_rtx is returned.
7308 The value may be stored in TARGET if TARGET is nonzero.
7309 TARGET is just a suggestion; callers must assume that
7310 the rtx returned may not be the same as TARGET.
7312 If TARGET is CONST0_RTX, it means that the value will be ignored.
7314 If TMODE is not VOIDmode, it suggests generating the
7315 result in mode TMODE. But this is done only when convenient.
7316 Otherwise, TMODE is ignored and the value generated in its natural mode.
7317 TMODE is just a suggestion; callers must assume that
7318 the rtx returned may not have mode TMODE.
7320 Note that TARGET may have neither TMODE nor MODE. In that case, it
7321 probably will not be used.
7323 If MODIFIER is EXPAND_SUM then when EXP is an addition
7324 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7325 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7326 products as above, or REG or MEM, or constant.
7327 Ordinarily in such cases we would output mul or add instructions
7328 and then return a pseudo reg containing the sum.
7330 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7331 it also marks a label as absolutely required (it can't be dead).
7332 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7333 This is used for outputting expressions used in initializers.
7335 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7336 with a constant address even if that address is not normally legitimate.
7337 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7339 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7340 a call parameter. Such targets require special care as we haven't yet
7341 marked TARGET so that it's safe from being trashed by libcalls. We
7342 don't want to use TARGET for anything but the final result;
7343 Intermediate values must go elsewhere. Additionally, calls to
7344 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7346 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7347 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7348 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7349 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7353 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
7354 enum expand_modifier modifier, rtx *alt_rtl)
7358 /* Handle ERROR_MARK before anybody tries to access its type. */
7359 if (TREE_CODE (exp) == ERROR_MARK
7360 || (TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK))
7362 ret = CONST0_RTX (tmode);
7363 return ret ? ret : const0_rtx;
7366 /* If this is an expression of some kind and it has an associated line
7367 number, then emit the line number before expanding the expression.
7369 We need to save and restore the file and line information so that
7370 errors discovered during expansion are emitted with the right
7371 information. It would be better of the diagnostic routines
7372 used the file/line information embedded in the tree nodes rather
7374 if (cfun && EXPR_HAS_LOCATION (exp))
7376 location_t saved_location = input_location;
7377 location_t saved_curr_loc = get_curr_insn_source_location ();
7378 tree saved_block = get_curr_insn_block ();
7379 input_location = EXPR_LOCATION (exp);
7380 set_curr_insn_source_location (input_location);
7382 /* Record where the insns produced belong. */
7383 set_curr_insn_block (TREE_BLOCK (exp));
7385 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7387 input_location = saved_location;
7388 set_curr_insn_block (saved_block);
7389 set_curr_insn_source_location (saved_curr_loc);
7393 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7400 expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
7401 enum expand_modifier modifier)
7403 rtx op0, op1, op2, temp;
7406 enum machine_mode mode;
7407 enum tree_code code = ops->code;
7409 rtx subtarget, original_target;
7411 bool reduce_bit_field;
7412 location_t loc = ops->location;
7413 tree treeop0, treeop1, treeop2;
7414 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
7415 ? reduce_to_bit_field_precision ((expr), \
7421 mode = TYPE_MODE (type);
7422 unsignedp = TYPE_UNSIGNED (type);
7428 /* We should be called only on simple (binary or unary) expressions,
7429 exactly those that are valid in gimple expressions that aren't
7430 GIMPLE_SINGLE_RHS (or invalid). */
7431 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS
7432 || get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS
7433 || get_gimple_rhs_class (code) == GIMPLE_TERNARY_RHS);
7435 ignore = (target == const0_rtx
7436 || ((CONVERT_EXPR_CODE_P (code)
7437 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
7438 && TREE_CODE (type) == VOID_TYPE));
7440 /* We should be called only if we need the result. */
7441 gcc_assert (!ignore);
7443 /* An operation in what may be a bit-field type needs the
7444 result to be reduced to the precision of the bit-field type,
7445 which is narrower than that of the type's mode. */
7446 reduce_bit_field = (TREE_CODE (type) == INTEGER_TYPE
7447 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
7449 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
7452 /* Use subtarget as the target for operand 0 of a binary operation. */
7453 subtarget = get_subtarget (target);
7454 original_target = target;
7458 case NON_LVALUE_EXPR:
7461 if (treeop0 == error_mark_node)
7464 if (TREE_CODE (type) == UNION_TYPE)
7466 tree valtype = TREE_TYPE (treeop0);
7468 /* If both input and output are BLKmode, this conversion isn't doing
7469 anything except possibly changing memory attribute. */
7470 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7472 rtx result = expand_expr (treeop0, target, tmode,
7475 result = copy_rtx (result);
7476 set_mem_attributes (result, type, 0);
7482 if (TYPE_MODE (type) != BLKmode)
7483 target = gen_reg_rtx (TYPE_MODE (type));
7485 target = assign_temp (type, 0, 1, 1);
7489 /* Store data into beginning of memory target. */
7490 store_expr (treeop0,
7491 adjust_address (target, TYPE_MODE (valtype), 0),
7492 modifier == EXPAND_STACK_PARM,
7497 gcc_assert (REG_P (target));
7499 /* Store this field into a union of the proper type. */
7500 store_field (target,
7501 MIN ((int_size_in_bytes (TREE_TYPE
7504 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7505 0, TYPE_MODE (valtype), treeop0,
7509 /* Return the entire union. */
7513 if (mode == TYPE_MODE (TREE_TYPE (treeop0)))
7515 op0 = expand_expr (treeop0, target, VOIDmode,
7518 /* If the signedness of the conversion differs and OP0 is
7519 a promoted SUBREG, clear that indication since we now
7520 have to do the proper extension. */
7521 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)) != unsignedp
7522 && GET_CODE (op0) == SUBREG)
7523 SUBREG_PROMOTED_VAR_P (op0) = 0;
7525 return REDUCE_BIT_FIELD (op0);
7528 op0 = expand_expr (treeop0, NULL_RTX, mode,
7529 modifier == EXPAND_SUM ? EXPAND_NORMAL : modifier);
7530 if (GET_MODE (op0) == mode)
7533 /* If OP0 is a constant, just convert it into the proper mode. */
7534 else if (CONSTANT_P (op0))
7536 tree inner_type = TREE_TYPE (treeop0);
7537 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7539 if (modifier == EXPAND_INITIALIZER)
7540 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7541 subreg_lowpart_offset (mode,
7544 op0= convert_modes (mode, inner_mode, op0,
7545 TYPE_UNSIGNED (inner_type));
7548 else if (modifier == EXPAND_INITIALIZER)
7549 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7551 else if (target == 0)
7552 op0 = convert_to_mode (mode, op0,
7553 TYPE_UNSIGNED (TREE_TYPE
7557 convert_move (target, op0,
7558 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7562 return REDUCE_BIT_FIELD (op0);
7564 case ADDR_SPACE_CONVERT_EXPR:
7566 tree treeop0_type = TREE_TYPE (treeop0);
7568 addr_space_t as_from;
7570 gcc_assert (POINTER_TYPE_P (type));
7571 gcc_assert (POINTER_TYPE_P (treeop0_type));
7573 as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
7574 as_from = TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type));
7576 /* Conversions between pointers to the same address space should
7577 have been implemented via CONVERT_EXPR / NOP_EXPR. */
7578 gcc_assert (as_to != as_from);
7580 /* Ask target code to handle conversion between pointers
7581 to overlapping address spaces. */
7582 if (targetm.addr_space.subset_p (as_to, as_from)
7583 || targetm.addr_space.subset_p (as_from, as_to))
7585 op0 = expand_expr (treeop0, NULL_RTX, VOIDmode, modifier);
7586 op0 = targetm.addr_space.convert (op0, treeop0_type, type);
7591 /* For disjoint address spaces, converting anything but
7592 a null pointer invokes undefined behaviour. We simply
7593 always return a null pointer here. */
7594 return CONST0_RTX (mode);
7597 case POINTER_PLUS_EXPR:
7598 /* Even though the sizetype mode and the pointer's mode can be different
7599 expand is able to handle this correctly and get the correct result out
7600 of the PLUS_EXPR code. */
7601 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
7602 if sizetype precision is smaller than pointer precision. */
7603 if (TYPE_PRECISION (sizetype) < TYPE_PRECISION (type))
7604 treeop1 = fold_convert_loc (loc, type,
7605 fold_convert_loc (loc, ssizetype,
7608 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7609 something else, make sure we add the register to the constant and
7610 then to the other thing. This case can occur during strength
7611 reduction and doing it this way will produce better code if the
7612 frame pointer or argument pointer is eliminated.
7614 fold-const.c will ensure that the constant is always in the inner
7615 PLUS_EXPR, so the only case we need to do anything about is if
7616 sp, ap, or fp is our second argument, in which case we must swap
7617 the innermost first argument and our second argument. */
7619 if (TREE_CODE (treeop0) == PLUS_EXPR
7620 && TREE_CODE (TREE_OPERAND (treeop0, 1)) == INTEGER_CST
7621 && TREE_CODE (treeop1) == VAR_DECL
7622 && (DECL_RTL (treeop1) == frame_pointer_rtx
7623 || DECL_RTL (treeop1) == stack_pointer_rtx
7624 || DECL_RTL (treeop1) == arg_pointer_rtx))
7628 treeop1 = TREE_OPERAND (treeop0, 0);
7629 TREE_OPERAND (treeop0, 0) = t;
7632 /* If the result is to be ptr_mode and we are adding an integer to
7633 something, we might be forming a constant. So try to use
7634 plus_constant. If it produces a sum and we can't accept it,
7635 use force_operand. This allows P = &ARR[const] to generate
7636 efficient code on machines where a SYMBOL_REF is not a valid
7639 If this is an EXPAND_SUM call, always return the sum. */
7640 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7641 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7643 if (modifier == EXPAND_STACK_PARM)
7645 if (TREE_CODE (treeop0) == INTEGER_CST
7646 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7647 && TREE_CONSTANT (treeop1))
7651 op1 = expand_expr (treeop1, subtarget, VOIDmode,
7653 /* Use immed_double_const to ensure that the constant is
7654 truncated according to the mode of OP1, then sign extended
7655 to a HOST_WIDE_INT. Using the constant directly can result
7656 in non-canonical RTL in a 64x32 cross compile. */
7658 = immed_double_const (TREE_INT_CST_LOW (treeop0),
7660 TYPE_MODE (TREE_TYPE (treeop1)));
7661 op1 = plus_constant (op1, INTVAL (constant_part));
7662 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7663 op1 = force_operand (op1, target);
7664 return REDUCE_BIT_FIELD (op1);
7667 else if (TREE_CODE (treeop1) == INTEGER_CST
7668 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7669 && TREE_CONSTANT (treeop0))
7673 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7674 (modifier == EXPAND_INITIALIZER
7675 ? EXPAND_INITIALIZER : EXPAND_SUM));
7676 if (! CONSTANT_P (op0))
7678 op1 = expand_expr (treeop1, NULL_RTX,
7679 VOIDmode, modifier);
7680 /* Return a PLUS if modifier says it's OK. */
7681 if (modifier == EXPAND_SUM
7682 || modifier == EXPAND_INITIALIZER)
7683 return simplify_gen_binary (PLUS, mode, op0, op1);
7686 /* Use immed_double_const to ensure that the constant is
7687 truncated according to the mode of OP1, then sign extended
7688 to a HOST_WIDE_INT. Using the constant directly can result
7689 in non-canonical RTL in a 64x32 cross compile. */
7691 = immed_double_const (TREE_INT_CST_LOW (treeop1),
7693 TYPE_MODE (TREE_TYPE (treeop0)));
7694 op0 = plus_constant (op0, INTVAL (constant_part));
7695 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7696 op0 = force_operand (op0, target);
7697 return REDUCE_BIT_FIELD (op0);
7701 /* Use TER to expand pointer addition of a negated value
7702 as pointer subtraction. */
7703 if ((POINTER_TYPE_P (TREE_TYPE (treeop0))
7704 || (TREE_CODE (TREE_TYPE (treeop0)) == VECTOR_TYPE
7705 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0)))))
7706 && TREE_CODE (treeop1) == SSA_NAME
7707 && TYPE_MODE (TREE_TYPE (treeop0))
7708 == TYPE_MODE (TREE_TYPE (treeop1)))
7710 gimple def = get_def_for_expr (treeop1, NEGATE_EXPR);
7713 treeop1 = gimple_assign_rhs1 (def);
7719 /* No sense saving up arithmetic to be done
7720 if it's all in the wrong mode to form part of an address.
7721 And force_operand won't know whether to sign-extend or
7723 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7724 || mode != ptr_mode)
7726 expand_operands (treeop0, treeop1,
7727 subtarget, &op0, &op1, EXPAND_NORMAL);
7728 if (op0 == const0_rtx)
7730 if (op1 == const0_rtx)
7735 expand_operands (treeop0, treeop1,
7736 subtarget, &op0, &op1, modifier);
7737 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7741 /* For initializers, we are allowed to return a MINUS of two
7742 symbolic constants. Here we handle all cases when both operands
7744 /* Handle difference of two symbolic constants,
7745 for the sake of an initializer. */
7746 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7747 && really_constant_p (treeop0)
7748 && really_constant_p (treeop1))
7750 expand_operands (treeop0, treeop1,
7751 NULL_RTX, &op0, &op1, modifier);
7753 /* If the last operand is a CONST_INT, use plus_constant of
7754 the negated constant. Else make the MINUS. */
7755 if (CONST_INT_P (op1))
7756 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7758 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7761 /* No sense saving up arithmetic to be done
7762 if it's all in the wrong mode to form part of an address.
7763 And force_operand won't know whether to sign-extend or
7765 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7766 || mode != ptr_mode)
7769 expand_operands (treeop0, treeop1,
7770 subtarget, &op0, &op1, modifier);
7772 /* Convert A - const to A + (-const). */
7773 if (CONST_INT_P (op1))
7775 op1 = negate_rtx (mode, op1);
7776 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7781 case WIDEN_MULT_PLUS_EXPR:
7782 case WIDEN_MULT_MINUS_EXPR:
7783 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
7784 op2 = expand_normal (treeop2);
7785 target = expand_widen_pattern_expr (ops, op0, op1, op2,
7789 case WIDEN_MULT_EXPR:
7790 /* If first operand is constant, swap them.
7791 Thus the following special case checks need only
7792 check the second operand. */
7793 if (TREE_CODE (treeop0) == INTEGER_CST)
7800 /* First, check if we have a multiplication of one signed and one
7801 unsigned operand. */
7802 if (TREE_CODE (treeop1) != INTEGER_CST
7803 && (TYPE_UNSIGNED (TREE_TYPE (treeop0))
7804 != TYPE_UNSIGNED (TREE_TYPE (treeop1))))
7806 enum machine_mode innermode = TYPE_MODE (TREE_TYPE (treeop0));
7807 this_optab = usmul_widen_optab;
7808 if (mode == GET_MODE_2XWIDER_MODE (innermode))
7810 if (optab_handler (this_optab, mode) != CODE_FOR_nothing)
7812 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7813 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
7816 expand_operands (treeop0, treeop1, NULL_RTX, &op1, &op0,
7822 /* Check for a multiplication with matching signedness. */
7823 else if ((TREE_CODE (treeop1) == INTEGER_CST
7824 && int_fits_type_p (treeop1, TREE_TYPE (treeop0)))
7825 || (TYPE_UNSIGNED (TREE_TYPE (treeop1))
7826 == TYPE_UNSIGNED (TREE_TYPE (treeop0))))
7828 tree op0type = TREE_TYPE (treeop0);
7829 enum machine_mode innermode = TYPE_MODE (op0type);
7830 bool zextend_p = TYPE_UNSIGNED (op0type);
7831 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7832 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7834 if (mode == GET_MODE_2XWIDER_MODE (innermode)
7835 && TREE_CODE (treeop0) != INTEGER_CST)
7837 if (optab_handler (this_optab, mode) != CODE_FOR_nothing)
7839 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
7841 temp = expand_widening_mult (mode, op0, op1, target,
7842 unsignedp, this_optab);
7843 return REDUCE_BIT_FIELD (temp);
7845 if (optab_handler (other_optab, mode) != CODE_FOR_nothing
7846 && innermode == word_mode)
7849 op0 = expand_normal (treeop0);
7850 if (TREE_CODE (treeop1) == INTEGER_CST)
7851 op1 = convert_modes (innermode, mode,
7852 expand_normal (treeop1), unsignedp);
7854 op1 = expand_normal (treeop1);
7855 temp = expand_binop (mode, other_optab, op0, op1, target,
7856 unsignedp, OPTAB_LIB_WIDEN);
7857 hipart = gen_highpart (innermode, temp);
7858 htem = expand_mult_highpart_adjust (innermode, hipart,
7862 emit_move_insn (hipart, htem);
7863 return REDUCE_BIT_FIELD (temp);
7867 treeop0 = fold_build1 (CONVERT_EXPR, type, treeop0);
7868 treeop1 = fold_build1 (CONVERT_EXPR, type, treeop1);
7869 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
7870 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7874 optab opt = fma_optab;
7877 /* If there is no insn for FMA, emit it as __builtin_fma{,f,l}
7879 if (optab_handler (fma_optab, mode) == CODE_FOR_nothing)
7881 tree fn = mathfn_built_in (TREE_TYPE (treeop0), BUILT_IN_FMA);
7884 gcc_assert (fn != NULL_TREE);
7885 call_expr = build_call_expr (fn, 3, treeop0, treeop1, treeop2);
7886 return expand_builtin (call_expr, target, subtarget, mode, false);
7889 def0 = get_def_for_expr (treeop0, NEGATE_EXPR);
7890 def2 = get_def_for_expr (treeop2, NEGATE_EXPR);
7895 && optab_handler (fnms_optab, mode) != CODE_FOR_nothing)
7898 op0 = expand_normal (gimple_assign_rhs1 (def0));
7899 op2 = expand_normal (gimple_assign_rhs1 (def2));
7902 && optab_handler (fnma_optab, mode) != CODE_FOR_nothing)
7905 op0 = expand_normal (gimple_assign_rhs1 (def0));
7908 && optab_handler (fms_optab, mode) != CODE_FOR_nothing)
7911 op2 = expand_normal (gimple_assign_rhs1 (def2));
7915 op0 = expand_expr (treeop0, subtarget, VOIDmode, EXPAND_NORMAL);
7917 op2 = expand_normal (treeop2);
7918 op1 = expand_normal (treeop1);
7920 return expand_ternary_op (TYPE_MODE (type), opt,
7921 op0, op1, op2, target, 0);
7925 /* If this is a fixed-point operation, then we cannot use the code
7926 below because "expand_mult" doesn't support sat/no-sat fixed-point
7928 if (ALL_FIXED_POINT_MODE_P (mode))
7931 /* If first operand is constant, swap them.
7932 Thus the following special case checks need only
7933 check the second operand. */
7934 if (TREE_CODE (treeop0) == INTEGER_CST)
7941 /* Attempt to return something suitable for generating an
7942 indexed address, for machines that support that. */
7944 if (modifier == EXPAND_SUM && mode == ptr_mode
7945 && host_integerp (treeop1, 0))
7947 tree exp1 = treeop1;
7949 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7953 op0 = force_operand (op0, NULL_RTX);
7955 op0 = copy_to_mode_reg (mode, op0);
7957 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7958 gen_int_mode (tree_low_cst (exp1, 0),
7959 TYPE_MODE (TREE_TYPE (exp1)))));
7962 if (modifier == EXPAND_STACK_PARM)
7965 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
7966 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7968 case TRUNC_DIV_EXPR:
7969 case FLOOR_DIV_EXPR:
7971 case ROUND_DIV_EXPR:
7972 case EXACT_DIV_EXPR:
7973 /* If this is a fixed-point operation, then we cannot use the code
7974 below because "expand_divmod" doesn't support sat/no-sat fixed-point
7976 if (ALL_FIXED_POINT_MODE_P (mode))
7979 if (modifier == EXPAND_STACK_PARM)
7981 /* Possible optimization: compute the dividend with EXPAND_SUM
7982 then if the divisor is constant can optimize the case
7983 where some terms of the dividend have coeffs divisible by it. */
7984 expand_operands (treeop0, treeop1,
7985 subtarget, &op0, &op1, EXPAND_NORMAL);
7986 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7991 case TRUNC_MOD_EXPR:
7992 case FLOOR_MOD_EXPR:
7994 case ROUND_MOD_EXPR:
7995 if (modifier == EXPAND_STACK_PARM)
7997 expand_operands (treeop0, treeop1,
7998 subtarget, &op0, &op1, EXPAND_NORMAL);
7999 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
8001 case FIXED_CONVERT_EXPR:
8002 op0 = expand_normal (treeop0);
8003 if (target == 0 || modifier == EXPAND_STACK_PARM)
8004 target = gen_reg_rtx (mode);
8006 if ((TREE_CODE (TREE_TYPE (treeop0)) == INTEGER_TYPE
8007 && TYPE_UNSIGNED (TREE_TYPE (treeop0)))
8008 || (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type)))
8009 expand_fixed_convert (target, op0, 1, TYPE_SATURATING (type));
8011 expand_fixed_convert (target, op0, 0, TYPE_SATURATING (type));
8014 case FIX_TRUNC_EXPR:
8015 op0 = expand_normal (treeop0);
8016 if (target == 0 || modifier == EXPAND_STACK_PARM)
8017 target = gen_reg_rtx (mode);
8018 expand_fix (target, op0, unsignedp);
8022 op0 = expand_normal (treeop0);
8023 if (target == 0 || modifier == EXPAND_STACK_PARM)
8024 target = gen_reg_rtx (mode);
8025 /* expand_float can't figure out what to do if FROM has VOIDmode.
8026 So give it the correct mode. With -O, cse will optimize this. */
8027 if (GET_MODE (op0) == VOIDmode)
8028 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0)),
8030 expand_float (target, op0,
8031 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8035 op0 = expand_expr (treeop0, subtarget,
8036 VOIDmode, EXPAND_NORMAL);
8037 if (modifier == EXPAND_STACK_PARM)
8039 temp = expand_unop (mode,
8040 optab_for_tree_code (NEGATE_EXPR, type,
8044 return REDUCE_BIT_FIELD (temp);
8047 op0 = expand_expr (treeop0, subtarget,
8048 VOIDmode, EXPAND_NORMAL);
8049 if (modifier == EXPAND_STACK_PARM)
8052 /* ABS_EXPR is not valid for complex arguments. */
8053 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
8054 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
8056 /* Unsigned abs is simply the operand. Testing here means we don't
8057 risk generating incorrect code below. */
8058 if (TYPE_UNSIGNED (type))
8061 return expand_abs (mode, op0, target, unsignedp,
8062 safe_from_p (target, treeop0, 1));
8066 target = original_target;
8068 || modifier == EXPAND_STACK_PARM
8069 || (MEM_P (target) && MEM_VOLATILE_P (target))
8070 || GET_MODE (target) != mode
8072 && REGNO (target) < FIRST_PSEUDO_REGISTER))
8073 target = gen_reg_rtx (mode);
8074 expand_operands (treeop0, treeop1,
8075 target, &op0, &op1, EXPAND_NORMAL);
8077 /* First try to do it with a special MIN or MAX instruction.
8078 If that does not win, use a conditional jump to select the proper
8080 this_optab = optab_for_tree_code (code, type, optab_default);
8081 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8086 /* At this point, a MEM target is no longer useful; we will get better
8089 if (! REG_P (target))
8090 target = gen_reg_rtx (mode);
8092 /* If op1 was placed in target, swap op0 and op1. */
8093 if (target != op0 && target == op1)
8100 /* We generate better code and avoid problems with op1 mentioning
8101 target by forcing op1 into a pseudo if it isn't a constant. */
8102 if (! CONSTANT_P (op1))
8103 op1 = force_reg (mode, op1);
8106 enum rtx_code comparison_code;
8109 if (code == MAX_EXPR)
8110 comparison_code = unsignedp ? GEU : GE;
8112 comparison_code = unsignedp ? LEU : LE;
8114 /* Canonicalize to comparisons against 0. */
8115 if (op1 == const1_rtx)
8117 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
8118 or (a != 0 ? a : 1) for unsigned.
8119 For MIN we are safe converting (a <= 1 ? a : 1)
8120 into (a <= 0 ? a : 1) */
8121 cmpop1 = const0_rtx;
8122 if (code == MAX_EXPR)
8123 comparison_code = unsignedp ? NE : GT;
8125 if (op1 == constm1_rtx && !unsignedp)
8127 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
8128 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
8129 cmpop1 = const0_rtx;
8130 if (code == MIN_EXPR)
8131 comparison_code = LT;
8133 #ifdef HAVE_conditional_move
8134 /* Use a conditional move if possible. */
8135 if (can_conditionally_move_p (mode))
8139 /* ??? Same problem as in expmed.c: emit_conditional_move
8140 forces a stack adjustment via compare_from_rtx, and we
8141 lose the stack adjustment if the sequence we are about
8142 to create is discarded. */
8143 do_pending_stack_adjust ();
8147 /* Try to emit the conditional move. */
8148 insn = emit_conditional_move (target, comparison_code,
8153 /* If we could do the conditional move, emit the sequence,
8157 rtx seq = get_insns ();
8163 /* Otherwise discard the sequence and fall back to code with
8169 emit_move_insn (target, op0);
8171 temp = gen_label_rtx ();
8172 do_compare_rtx_and_jump (target, cmpop1, comparison_code,
8173 unsignedp, mode, NULL_RTX, NULL_RTX, temp,
8176 emit_move_insn (target, op1);
8181 op0 = expand_expr (treeop0, subtarget,
8182 VOIDmode, EXPAND_NORMAL);
8183 if (modifier == EXPAND_STACK_PARM)
8185 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8189 /* ??? Can optimize bitwise operations with one arg constant.
8190 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8191 and (a bitwise1 b) bitwise2 b (etc)
8192 but that is probably not worth while. */
8194 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8195 boolean values when we want in all cases to compute both of them. In
8196 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8197 as actual zero-or-1 values and then bitwise anding. In cases where
8198 there cannot be any side effects, better code would be made by
8199 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8200 how to recognize those cases. */
8202 case TRUTH_AND_EXPR:
8203 code = BIT_AND_EXPR;
8208 code = BIT_IOR_EXPR;
8212 case TRUTH_XOR_EXPR:
8213 code = BIT_XOR_EXPR;
8219 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type))
8220 || (GET_MODE_PRECISION (TYPE_MODE (type))
8221 == TYPE_PRECISION (type)));
8226 /* If this is a fixed-point operation, then we cannot use the code
8227 below because "expand_shift" doesn't support sat/no-sat fixed-point
8229 if (ALL_FIXED_POINT_MODE_P (mode))
8232 if (! safe_from_p (subtarget, treeop1, 1))
8234 if (modifier == EXPAND_STACK_PARM)
8236 op0 = expand_expr (treeop0, subtarget,
8237 VOIDmode, EXPAND_NORMAL);
8238 temp = expand_shift (code, mode, op0, treeop1, target,
8240 if (code == LSHIFT_EXPR)
8241 temp = REDUCE_BIT_FIELD (temp);
8244 /* Could determine the answer when only additive constants differ. Also,
8245 the addition of one can be handled by changing the condition. */
8252 case UNORDERED_EXPR:
8260 temp = do_store_flag (ops,
8261 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8262 tmode != VOIDmode ? tmode : mode);
8266 /* Use a compare and a jump for BLKmode comparisons, or for function
8267 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8270 || modifier == EXPAND_STACK_PARM
8271 || ! safe_from_p (target, treeop0, 1)
8272 || ! safe_from_p (target, treeop1, 1)
8273 /* Make sure we don't have a hard reg (such as function's return
8274 value) live across basic blocks, if not optimizing. */
8275 || (!optimize && REG_P (target)
8276 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8277 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8279 emit_move_insn (target, const0_rtx);
8281 op1 = gen_label_rtx ();
8282 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
8284 if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
8285 emit_move_insn (target, constm1_rtx);
8287 emit_move_insn (target, const1_rtx);
8292 case TRUTH_NOT_EXPR:
8293 if (modifier == EXPAND_STACK_PARM)
8295 op0 = expand_expr (treeop0, target,
8296 VOIDmode, EXPAND_NORMAL);
8297 /* The parser is careful to generate TRUTH_NOT_EXPR
8298 only with operands that are always zero or one. */
8299 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8300 target, 1, OPTAB_LIB_WIDEN);
8305 /* Get the rtx code of the operands. */
8306 op0 = expand_normal (treeop0);
8307 op1 = expand_normal (treeop1);
8310 target = gen_reg_rtx (TYPE_MODE (type));
8312 /* Move the real (op0) and imaginary (op1) parts to their location. */
8313 write_complex_part (target, op0, false);
8314 write_complex_part (target, op1, true);
8318 case WIDEN_SUM_EXPR:
8320 tree oprnd0 = treeop0;
8321 tree oprnd1 = treeop1;
8323 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8324 target = expand_widen_pattern_expr (ops, op0, NULL_RTX, op1,
8329 case REDUC_MAX_EXPR:
8330 case REDUC_MIN_EXPR:
8331 case REDUC_PLUS_EXPR:
8333 op0 = expand_normal (treeop0);
8334 this_optab = optab_for_tree_code (code, type, optab_default);
8335 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8340 case VEC_EXTRACT_EVEN_EXPR:
8341 case VEC_EXTRACT_ODD_EXPR:
8343 expand_operands (treeop0, treeop1,
8344 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8345 this_optab = optab_for_tree_code (code, type, optab_default);
8346 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8352 case VEC_INTERLEAVE_HIGH_EXPR:
8353 case VEC_INTERLEAVE_LOW_EXPR:
8355 expand_operands (treeop0, treeop1,
8356 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8357 this_optab = optab_for_tree_code (code, type, optab_default);
8358 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8364 case VEC_LSHIFT_EXPR:
8365 case VEC_RSHIFT_EXPR:
8367 target = expand_vec_shift_expr (ops, target);
8371 case VEC_UNPACK_HI_EXPR:
8372 case VEC_UNPACK_LO_EXPR:
8374 op0 = expand_normal (treeop0);
8375 this_optab = optab_for_tree_code (code, type, optab_default);
8376 temp = expand_widen_pattern_expr (ops, op0, NULL_RTX, NULL_RTX,
8382 case VEC_UNPACK_FLOAT_HI_EXPR:
8383 case VEC_UNPACK_FLOAT_LO_EXPR:
8385 op0 = expand_normal (treeop0);
8386 /* The signedness is determined from input operand. */
8387 this_optab = optab_for_tree_code (code,
8388 TREE_TYPE (treeop0),
8390 temp = expand_widen_pattern_expr
8391 (ops, op0, NULL_RTX, NULL_RTX,
8392 target, TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8398 case VEC_WIDEN_MULT_HI_EXPR:
8399 case VEC_WIDEN_MULT_LO_EXPR:
8401 tree oprnd0 = treeop0;
8402 tree oprnd1 = treeop1;
8404 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8405 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8407 gcc_assert (target);
8411 case VEC_PACK_TRUNC_EXPR:
8412 case VEC_PACK_SAT_EXPR:
8413 case VEC_PACK_FIX_TRUNC_EXPR:
8414 mode = TYPE_MODE (TREE_TYPE (treeop0));
8421 /* Here to do an ordinary binary operator. */
8423 expand_operands (treeop0, treeop1,
8424 subtarget, &op0, &op1, EXPAND_NORMAL);
8426 this_optab = optab_for_tree_code (code, type, optab_default);
8428 if (modifier == EXPAND_STACK_PARM)
8430 temp = expand_binop (mode, this_optab, op0, op1, target,
8431 unsignedp, OPTAB_LIB_WIDEN);
8433 return REDUCE_BIT_FIELD (temp);
8435 #undef REDUCE_BIT_FIELD
8438 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
8439 enum expand_modifier modifier, rtx *alt_rtl)
8441 rtx op0, op1, temp, decl_rtl;
8444 enum machine_mode mode;
8445 enum tree_code code = TREE_CODE (exp);
8447 rtx subtarget, original_target;
8450 bool reduce_bit_field;
8451 location_t loc = EXPR_LOCATION (exp);
8452 struct separate_ops ops;
8453 tree treeop0, treeop1, treeop2;
8454 tree ssa_name = NULL_TREE;
8457 type = TREE_TYPE (exp);
8458 mode = TYPE_MODE (type);
8459 unsignedp = TYPE_UNSIGNED (type);
8461 treeop0 = treeop1 = treeop2 = NULL_TREE;
8462 if (!VL_EXP_CLASS_P (exp))
8463 switch (TREE_CODE_LENGTH (code))
8466 case 3: treeop2 = TREE_OPERAND (exp, 2);
8467 case 2: treeop1 = TREE_OPERAND (exp, 1);
8468 case 1: treeop0 = TREE_OPERAND (exp, 0);
8478 ignore = (target == const0_rtx
8479 || ((CONVERT_EXPR_CODE_P (code)
8480 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
8481 && TREE_CODE (type) == VOID_TYPE));
8483 /* An operation in what may be a bit-field type needs the
8484 result to be reduced to the precision of the bit-field type,
8485 which is narrower than that of the type's mode. */
8486 reduce_bit_field = (!ignore
8487 && TREE_CODE (type) == INTEGER_TYPE
8488 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
8490 /* If we are going to ignore this result, we need only do something
8491 if there is a side-effect somewhere in the expression. If there
8492 is, short-circuit the most common cases here. Note that we must
8493 not call expand_expr with anything but const0_rtx in case this
8494 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
8498 if (! TREE_SIDE_EFFECTS (exp))
8501 /* Ensure we reference a volatile object even if value is ignored, but
8502 don't do this if all we are doing is taking its address. */
8503 if (TREE_THIS_VOLATILE (exp)
8504 && TREE_CODE (exp) != FUNCTION_DECL
8505 && mode != VOIDmode && mode != BLKmode
8506 && modifier != EXPAND_CONST_ADDRESS)
8508 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
8510 temp = copy_to_reg (temp);
8514 if (TREE_CODE_CLASS (code) == tcc_unary
8515 || code == COMPONENT_REF || code == INDIRECT_REF)
8516 return expand_expr (treeop0, const0_rtx, VOIDmode,
8519 else if (TREE_CODE_CLASS (code) == tcc_binary
8520 || TREE_CODE_CLASS (code) == tcc_comparison
8521 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
8523 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8524 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8527 else if (code == BIT_FIELD_REF)
8529 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8530 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8531 expand_expr (treeop2, const0_rtx, VOIDmode, modifier);
8538 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
8541 /* Use subtarget as the target for operand 0 of a binary operation. */
8542 subtarget = get_subtarget (target);
8543 original_target = target;
8549 tree function = decl_function_context (exp);
8551 temp = label_rtx (exp);
8552 temp = gen_rtx_LABEL_REF (Pmode, temp);
8554 if (function != current_function_decl
8556 LABEL_REF_NONLOCAL_P (temp) = 1;
8558 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
8563 /* ??? ivopts calls expander, without any preparation from
8564 out-of-ssa. So fake instructions as if this was an access to the
8565 base variable. This unnecessarily allocates a pseudo, see how we can
8566 reuse it, if partition base vars have it set already. */
8567 if (!currently_expanding_to_rtl)
8568 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier,
8571 g = get_gimple_for_ssa_name (exp);
8572 /* For EXPAND_INITIALIZER try harder to get something simpler. */
8574 && modifier == EXPAND_INITIALIZER
8575 && !SSA_NAME_IS_DEFAULT_DEF (exp)
8576 && (optimize || DECL_IGNORED_P (SSA_NAME_VAR (exp)))
8577 && stmt_is_replaceable_p (SSA_NAME_DEF_STMT (exp)))
8578 g = SSA_NAME_DEF_STMT (exp);
8580 return expand_expr_real (gimple_assign_rhs_to_tree (g), target, tmode,
8584 decl_rtl = get_rtx_for_ssa_name (ssa_name);
8585 exp = SSA_NAME_VAR (ssa_name);
8586 goto expand_decl_rtl;
8590 /* If a static var's type was incomplete when the decl was written,
8591 but the type is complete now, lay out the decl now. */
8592 if (DECL_SIZE (exp) == 0
8593 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
8594 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
8595 layout_decl (exp, 0);
8597 /* ... fall through ... */
8601 decl_rtl = DECL_RTL (exp);
8603 gcc_assert (decl_rtl);
8604 decl_rtl = copy_rtx (decl_rtl);
8605 /* Record writes to register variables. */
8606 if (modifier == EXPAND_WRITE && REG_P (decl_rtl)
8607 && REGNO (decl_rtl) < FIRST_PSEUDO_REGISTER)
8609 int i = REGNO (decl_rtl);
8610 int nregs = hard_regno_nregs[i][GET_MODE (decl_rtl)];
8613 SET_HARD_REG_BIT (crtl->asm_clobbers, i);
8619 /* Ensure variable marked as used even if it doesn't go through
8620 a parser. If it hasn't be used yet, write out an external
8622 if (! TREE_USED (exp))
8624 assemble_external (exp);
8625 TREE_USED (exp) = 1;
8628 /* Show we haven't gotten RTL for this yet. */
8631 /* Variables inherited from containing functions should have
8632 been lowered by this point. */
8633 context = decl_function_context (exp);
8634 gcc_assert (!context
8635 || context == current_function_decl
8636 || TREE_STATIC (exp)
8637 || DECL_EXTERNAL (exp)
8638 /* ??? C++ creates functions that are not TREE_STATIC. */
8639 || TREE_CODE (exp) == FUNCTION_DECL);
8641 /* This is the case of an array whose size is to be determined
8642 from its initializer, while the initializer is still being parsed.
8645 if (MEM_P (decl_rtl) && REG_P (XEXP (decl_rtl, 0)))
8646 temp = validize_mem (decl_rtl);
8648 /* If DECL_RTL is memory, we are in the normal case and the
8649 address is not valid, get the address into a register. */
8651 else if (MEM_P (decl_rtl) && modifier != EXPAND_INITIALIZER)
8654 *alt_rtl = decl_rtl;
8655 decl_rtl = use_anchored_address (decl_rtl);
8656 if (modifier != EXPAND_CONST_ADDRESS
8657 && modifier != EXPAND_SUM
8658 && !memory_address_addr_space_p (DECL_MODE (exp),
8660 MEM_ADDR_SPACE (decl_rtl)))
8661 temp = replace_equiv_address (decl_rtl,
8662 copy_rtx (XEXP (decl_rtl, 0)));
8665 /* If we got something, return it. But first, set the alignment
8666 if the address is a register. */
8669 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
8670 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
8675 /* If the mode of DECL_RTL does not match that of the decl,
8676 there are two cases: we are dealing with a BLKmode value
8677 that is returned in a register, or we are dealing with
8678 a promoted value. In the latter case, return a SUBREG
8679 of the wanted mode, but mark it so that we know that it
8680 was already extended. */
8681 if (REG_P (decl_rtl)
8682 && DECL_MODE (exp) != BLKmode
8683 && GET_MODE (decl_rtl) != DECL_MODE (exp))
8685 enum machine_mode pmode;
8687 /* Get the signedness to be used for this variable. Ensure we get
8688 the same mode we got when the variable was declared. */
8689 if (code == SSA_NAME
8690 && (g = SSA_NAME_DEF_STMT (ssa_name))
8691 && gimple_code (g) == GIMPLE_CALL)
8692 pmode = promote_function_mode (type, mode, &unsignedp,
8694 (TREE_TYPE (gimple_call_fn (g))),
8697 pmode = promote_decl_mode (exp, &unsignedp);
8698 gcc_assert (GET_MODE (decl_rtl) == pmode);
8700 temp = gen_lowpart_SUBREG (mode, decl_rtl);
8701 SUBREG_PROMOTED_VAR_P (temp) = 1;
8702 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
8709 temp = immed_double_const (TREE_INT_CST_LOW (exp),
8710 TREE_INT_CST_HIGH (exp), mode);
8716 tree tmp = NULL_TREE;
8717 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
8718 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT
8719 || GET_MODE_CLASS (mode) == MODE_VECTOR_FRACT
8720 || GET_MODE_CLASS (mode) == MODE_VECTOR_UFRACT
8721 || GET_MODE_CLASS (mode) == MODE_VECTOR_ACCUM
8722 || GET_MODE_CLASS (mode) == MODE_VECTOR_UACCUM)
8723 return const_vector_from_tree (exp);
8724 if (GET_MODE_CLASS (mode) == MODE_INT)
8726 tree type_for_mode = lang_hooks.types.type_for_mode (mode, 1);
8728 tmp = fold_unary_loc (loc, VIEW_CONVERT_EXPR, type_for_mode, exp);
8731 tmp = build_constructor_from_list (type,
8732 TREE_VECTOR_CST_ELTS (exp));
8733 return expand_expr (tmp, ignore ? const0_rtx : target,
8738 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
8741 /* If optimized, generate immediate CONST_DOUBLE
8742 which will be turned into memory by reload if necessary.
8744 We used to force a register so that loop.c could see it. But
8745 this does not allow gen_* patterns to perform optimizations with
8746 the constants. It also produces two insns in cases like "x = 1.0;".
8747 On most machines, floating-point constants are not permitted in
8748 many insns, so we'd end up copying it to a register in any case.
8750 Now, we do the copying in expand_binop, if appropriate. */
8751 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
8752 TYPE_MODE (TREE_TYPE (exp)));
8755 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp),
8756 TYPE_MODE (TREE_TYPE (exp)));
8759 /* Handle evaluating a complex constant in a CONCAT target. */
8760 if (original_target && GET_CODE (original_target) == CONCAT)
8762 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8765 rtarg = XEXP (original_target, 0);
8766 itarg = XEXP (original_target, 1);
8768 /* Move the real and imaginary parts separately. */
8769 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, EXPAND_NORMAL);
8770 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, EXPAND_NORMAL);
8773 emit_move_insn (rtarg, op0);
8775 emit_move_insn (itarg, op1);
8777 return original_target;
8780 /* ... fall through ... */
8783 temp = expand_expr_constant (exp, 1, modifier);
8785 /* temp contains a constant address.
8786 On RISC machines where a constant address isn't valid,
8787 make some insns to get that address into a register. */
8788 if (modifier != EXPAND_CONST_ADDRESS
8789 && modifier != EXPAND_INITIALIZER
8790 && modifier != EXPAND_SUM
8791 && ! memory_address_addr_space_p (mode, XEXP (temp, 0),
8792 MEM_ADDR_SPACE (temp)))
8793 return replace_equiv_address (temp,
8794 copy_rtx (XEXP (temp, 0)));
8800 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
8802 if (!SAVE_EXPR_RESOLVED_P (exp))
8804 /* We can indeed still hit this case, typically via builtin
8805 expanders calling save_expr immediately before expanding
8806 something. Assume this means that we only have to deal
8807 with non-BLKmode values. */
8808 gcc_assert (GET_MODE (ret) != BLKmode);
8810 val = build_decl (EXPR_LOCATION (exp),
8811 VAR_DECL, NULL, TREE_TYPE (exp));
8812 DECL_ARTIFICIAL (val) = 1;
8813 DECL_IGNORED_P (val) = 1;
8815 TREE_OPERAND (exp, 0) = treeop0;
8816 SAVE_EXPR_RESOLVED_P (exp) = 1;
8818 if (!CONSTANT_P (ret))
8819 ret = copy_to_reg (ret);
8820 SET_DECL_RTL (val, ret);
8828 /* If we don't need the result, just ensure we evaluate any
8832 unsigned HOST_WIDE_INT idx;
8835 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
8836 expand_expr (value, const0_rtx, VOIDmode, EXPAND_NORMAL);
8841 return expand_constructor (exp, target, modifier, false);
8843 case TARGET_MEM_REF:
8845 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (exp));
8846 struct mem_address addr;
8849 get_address_description (exp, &addr);
8850 op0 = addr_for_mem_ref (&addr, as, true);
8851 op0 = memory_address_addr_space (mode, op0, as);
8852 temp = gen_rtx_MEM (mode, op0);
8853 set_mem_attributes (temp, exp, 0);
8854 set_mem_addr_space (temp, as);
8855 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)),
8856 get_object_alignment (exp, BIGGEST_ALIGNMENT));
8858 && (unsigned) align < GET_MODE_ALIGNMENT (mode)
8859 /* If the target does not have special handling for unaligned
8860 loads of mode then it can use regular moves for them. */
8861 && ((icode = optab_handler (movmisalign_optab, mode))
8862 != CODE_FOR_nothing))
8866 /* We've already validated the memory, and we're creating a
8867 new pseudo destination. The predicates really can't fail. */
8868 reg = gen_reg_rtx (mode);
8870 /* Nor can the insn generator. */
8871 insn = GEN_FCN (icode) (reg, temp);
8872 gcc_assert (insn != NULL_RTX);
8883 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))));
8884 enum machine_mode address_mode;
8885 tree base = TREE_OPERAND (exp, 0);
8888 /* Handle expansion of non-aliased memory with non-BLKmode. That
8889 might end up in a register. */
8890 if (TREE_CODE (base) == ADDR_EXPR)
8892 HOST_WIDE_INT offset = mem_ref_offset (exp).low;
8894 base = TREE_OPERAND (base, 0);
8898 base = get_addr_base_and_unit_offset (base, &off);
8902 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
8903 decl we must use bitfield operations. */
8905 && !TREE_ADDRESSABLE (base)
8906 && DECL_MODE (base) != BLKmode
8907 && DECL_RTL_SET_P (base)
8908 && !MEM_P (DECL_RTL (base)))
8912 && host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)
8913 && (GET_MODE_BITSIZE (DECL_MODE (base))
8914 == TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp)))))
8915 return expand_expr (build1 (VIEW_CONVERT_EXPR,
8916 TREE_TYPE (exp), base),
8917 target, tmode, modifier);
8918 bit_offset = bitsize_int (offset * BITS_PER_UNIT);
8919 bftype = TREE_TYPE (base);
8920 if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode)
8921 bftype = TREE_TYPE (exp);
8922 return expand_expr (build3 (BIT_FIELD_REF, bftype,
8924 TYPE_SIZE (TREE_TYPE (exp)),
8926 target, tmode, modifier);
8929 address_mode = targetm.addr_space.address_mode (as);
8930 base = TREE_OPERAND (exp, 0);
8931 if ((def_stmt = get_def_for_expr (base, BIT_AND_EXPR)))
8933 tree mask = gimple_assign_rhs2 (def_stmt);
8934 base = build2 (BIT_AND_EXPR, TREE_TYPE (base),
8935 gimple_assign_rhs1 (def_stmt), mask);
8936 TREE_OPERAND (exp, 0) = base;
8938 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)),
8939 get_object_alignment (exp, BIGGEST_ALIGNMENT));
8940 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_SUM);
8941 op0 = memory_address_addr_space (address_mode, op0, as);
8942 if (!integer_zerop (TREE_OPERAND (exp, 1)))
8945 = immed_double_int_const (mem_ref_offset (exp), address_mode);
8946 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
8948 op0 = memory_address_addr_space (mode, op0, as);
8949 temp = gen_rtx_MEM (mode, op0);
8950 set_mem_attributes (temp, exp, 0);
8951 set_mem_addr_space (temp, as);
8952 if (TREE_THIS_VOLATILE (exp))
8953 MEM_VOLATILE_P (temp) = 1;
8955 && (unsigned) align < GET_MODE_ALIGNMENT (mode)
8956 /* If the target does not have special handling for unaligned
8957 loads of mode then it can use regular moves for them. */
8958 && ((icode = optab_handler (movmisalign_optab, mode))
8959 != CODE_FOR_nothing))
8963 /* We've already validated the memory, and we're creating a
8964 new pseudo destination. The predicates really can't fail. */
8965 reg = gen_reg_rtx (mode);
8967 /* Nor can the insn generator. */
8968 insn = GEN_FCN (icode) (reg, temp);
8979 tree array = treeop0;
8980 tree index = treeop1;
8982 /* Fold an expression like: "foo"[2].
8983 This is not done in fold so it won't happen inside &.
8984 Don't fold if this is for wide characters since it's too
8985 difficult to do correctly and this is a very rare case. */
8987 if (modifier != EXPAND_CONST_ADDRESS
8988 && modifier != EXPAND_INITIALIZER
8989 && modifier != EXPAND_MEMORY)
8991 tree t = fold_read_from_constant_string (exp);
8994 return expand_expr (t, target, tmode, modifier);
8997 /* If this is a constant index into a constant array,
8998 just get the value from the array. Handle both the cases when
8999 we have an explicit constructor and when our operand is a variable
9000 that was declared const. */
9002 if (modifier != EXPAND_CONST_ADDRESS
9003 && modifier != EXPAND_INITIALIZER
9004 && modifier != EXPAND_MEMORY
9005 && TREE_CODE (array) == CONSTRUCTOR
9006 && ! TREE_SIDE_EFFECTS (array)
9007 && TREE_CODE (index) == INTEGER_CST)
9009 unsigned HOST_WIDE_INT ix;
9012 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array), ix,
9014 if (tree_int_cst_equal (field, index))
9016 if (!TREE_SIDE_EFFECTS (value))
9017 return expand_expr (fold (value), target, tmode, modifier);
9022 else if (optimize >= 1
9023 && modifier != EXPAND_CONST_ADDRESS
9024 && modifier != EXPAND_INITIALIZER
9025 && modifier != EXPAND_MEMORY
9026 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
9027 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
9028 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
9029 && const_value_known_p (array))
9031 if (TREE_CODE (index) == INTEGER_CST)
9033 tree init = DECL_INITIAL (array);
9035 if (TREE_CODE (init) == CONSTRUCTOR)
9037 unsigned HOST_WIDE_INT ix;
9040 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), ix,
9042 if (tree_int_cst_equal (field, index))
9044 if (TREE_SIDE_EFFECTS (value))
9047 if (TREE_CODE (value) == CONSTRUCTOR)
9049 /* If VALUE is a CONSTRUCTOR, this
9050 optimization is only useful if
9051 this doesn't store the CONSTRUCTOR
9052 into memory. If it does, it is more
9053 efficient to just load the data from
9054 the array directly. */
9055 rtx ret = expand_constructor (value, target,
9057 if (ret == NULL_RTX)
9061 return expand_expr (fold (value), target, tmode,
9065 else if(TREE_CODE (init) == STRING_CST)
9067 tree index1 = index;
9068 tree low_bound = array_ref_low_bound (exp);
9069 index1 = fold_convert_loc (loc, sizetype,
9072 /* Optimize the special-case of a zero lower bound.
9074 We convert the low_bound to sizetype to avoid some problems
9075 with constant folding. (E.g. suppose the lower bound is 1,
9076 and its mode is QI. Without the conversion,l (ARRAY
9077 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
9078 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
9080 if (! integer_zerop (low_bound))
9081 index1 = size_diffop_loc (loc, index1,
9082 fold_convert_loc (loc, sizetype,
9085 if (0 > compare_tree_int (index1,
9086 TREE_STRING_LENGTH (init)))
9088 tree type = TREE_TYPE (TREE_TYPE (init));
9089 enum machine_mode mode = TYPE_MODE (type);
9091 if (GET_MODE_CLASS (mode) == MODE_INT
9092 && GET_MODE_SIZE (mode) == 1)
9093 return gen_int_mode (TREE_STRING_POINTER (init)
9094 [TREE_INT_CST_LOW (index1)],
9101 goto normal_inner_ref;
9104 /* If the operand is a CONSTRUCTOR, we can just extract the
9105 appropriate field if it is present. */
9106 if (TREE_CODE (treeop0) == CONSTRUCTOR)
9108 unsigned HOST_WIDE_INT idx;
9111 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0),
9113 if (field == treeop1
9114 /* We can normally use the value of the field in the
9115 CONSTRUCTOR. However, if this is a bitfield in
9116 an integral mode that we can fit in a HOST_WIDE_INT,
9117 we must mask only the number of bits in the bitfield,
9118 since this is done implicitly by the constructor. If
9119 the bitfield does not meet either of those conditions,
9120 we can't do this optimization. */
9121 && (! DECL_BIT_FIELD (field)
9122 || ((GET_MODE_CLASS (DECL_MODE (field)) == MODE_INT)
9123 && (GET_MODE_BITSIZE (DECL_MODE (field))
9124 <= HOST_BITS_PER_WIDE_INT))))
9126 if (DECL_BIT_FIELD (field)
9127 && modifier == EXPAND_STACK_PARM)
9129 op0 = expand_expr (value, target, tmode, modifier);
9130 if (DECL_BIT_FIELD (field))
9132 HOST_WIDE_INT bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
9133 enum machine_mode imode = TYPE_MODE (TREE_TYPE (field));
9135 if (TYPE_UNSIGNED (TREE_TYPE (field)))
9137 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
9138 op0 = expand_and (imode, op0, op1, target);
9143 = build_int_cst (NULL_TREE,
9144 GET_MODE_BITSIZE (imode) - bitsize);
9146 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
9148 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
9156 goto normal_inner_ref;
9159 case ARRAY_RANGE_REF:
9162 enum machine_mode mode1, mode2;
9163 HOST_WIDE_INT bitsize, bitpos;
9165 int volatilep = 0, must_force_mem;
9166 bool packedp = false;
9167 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
9168 &mode1, &unsignedp, &volatilep, true);
9169 rtx orig_op0, memloc;
9171 /* If we got back the original object, something is wrong. Perhaps
9172 we are evaluating an expression too early. In any event, don't
9173 infinitely recurse. */
9174 gcc_assert (tem != exp);
9176 if (TYPE_PACKED (TREE_TYPE (TREE_OPERAND (exp, 0)))
9177 || (TREE_CODE (TREE_OPERAND (exp, 1)) == FIELD_DECL
9178 && DECL_PACKED (TREE_OPERAND (exp, 1))))
9181 /* If TEM's type is a union of variable size, pass TARGET to the inner
9182 computation, since it will need a temporary and TARGET is known
9183 to have to do. This occurs in unchecked conversion in Ada. */
9186 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9187 && COMPLETE_TYPE_P (TREE_TYPE (tem))
9188 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9190 && modifier != EXPAND_STACK_PARM
9191 ? target : NULL_RTX),
9193 (modifier == EXPAND_INITIALIZER
9194 || modifier == EXPAND_CONST_ADDRESS
9195 || modifier == EXPAND_STACK_PARM)
9196 ? modifier : EXPAND_NORMAL);
9199 /* If the bitfield is volatile, we want to access it in the
9200 field's mode, not the computed mode.
9201 If a MEM has VOIDmode (external with incomplete type),
9202 use BLKmode for it instead. */
9205 if (volatilep && flag_strict_volatile_bitfields > 0)
9206 op0 = adjust_address (op0, mode1, 0);
9207 else if (GET_MODE (op0) == VOIDmode)
9208 op0 = adjust_address (op0, BLKmode, 0);
9212 = CONSTANT_P (op0) ? TYPE_MODE (TREE_TYPE (tem)) : GET_MODE (op0);
9214 /* If we have either an offset, a BLKmode result, or a reference
9215 outside the underlying object, we must force it to memory.
9216 Such a case can occur in Ada if we have unchecked conversion
9217 of an expression from a scalar type to an aggregate type or
9218 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
9219 passed a partially uninitialized object or a view-conversion
9220 to a larger size. */
9221 must_force_mem = (offset
9223 || bitpos + bitsize > GET_MODE_BITSIZE (mode2));
9225 /* Handle CONCAT first. */
9226 if (GET_CODE (op0) == CONCAT && !must_force_mem)
9229 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
9232 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9235 op0 = XEXP (op0, 0);
9236 mode2 = GET_MODE (op0);
9238 else if (bitpos == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9239 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 1)))
9243 op0 = XEXP (op0, 1);
9245 mode2 = GET_MODE (op0);
9248 /* Otherwise force into memory. */
9252 /* If this is a constant, put it in a register if it is a legitimate
9253 constant and we don't need a memory reference. */
9254 if (CONSTANT_P (op0)
9256 && LEGITIMATE_CONSTANT_P (op0)
9258 op0 = force_reg (mode2, op0);
9260 /* Otherwise, if this is a constant, try to force it to the constant
9261 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9262 is a legitimate constant. */
9263 else if (CONSTANT_P (op0) && (memloc = force_const_mem (mode2, op0)))
9264 op0 = validize_mem (memloc);
9266 /* Otherwise, if this is a constant or the object is not in memory
9267 and need be, put it there. */
9268 else if (CONSTANT_P (op0) || (!MEM_P (op0) && must_force_mem))
9270 tree nt = build_qualified_type (TREE_TYPE (tem),
9271 (TYPE_QUALS (TREE_TYPE (tem))
9272 | TYPE_QUAL_CONST));
9273 memloc = assign_temp (nt, 1, 1, 1);
9274 emit_move_insn (memloc, op0);
9280 enum machine_mode address_mode;
9281 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
9284 gcc_assert (MEM_P (op0));
9287 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (op0));
9288 if (GET_MODE (offset_rtx) != address_mode)
9289 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
9291 if (GET_MODE (op0) == BLKmode
9292 /* A constant address in OP0 can have VOIDmode, we must
9293 not try to call force_reg in that case. */
9294 && GET_MODE (XEXP (op0, 0)) != VOIDmode
9296 && (bitpos % bitsize) == 0
9297 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
9298 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
9300 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9304 op0 = offset_address (op0, offset_rtx,
9305 highest_pow2_factor (offset));
9308 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9309 record its alignment as BIGGEST_ALIGNMENT. */
9310 if (MEM_P (op0) && bitpos == 0 && offset != 0
9311 && is_aligning_offset (offset, tem))
9312 set_mem_align (op0, BIGGEST_ALIGNMENT);
9314 /* Don't forget about volatility even if this is a bitfield. */
9315 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
9317 if (op0 == orig_op0)
9318 op0 = copy_rtx (op0);
9320 MEM_VOLATILE_P (op0) = 1;
9323 /* In cases where an aligned union has an unaligned object
9324 as a field, we might be extracting a BLKmode value from
9325 an integer-mode (e.g., SImode) object. Handle this case
9326 by doing the extract into an object as wide as the field
9327 (which we know to be the width of a basic mode), then
9328 storing into memory, and changing the mode to BLKmode. */
9329 if (mode1 == VOIDmode
9330 || REG_P (op0) || GET_CODE (op0) == SUBREG
9331 || (mode1 != BLKmode && ! direct_load[(int) mode1]
9332 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
9333 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
9334 && modifier != EXPAND_CONST_ADDRESS
9335 && modifier != EXPAND_INITIALIZER)
9336 /* If the field is volatile, we always want an aligned
9337 access. Do this in following two situations:
9338 1. the access is not already naturally
9339 aligned, otherwise "normal" (non-bitfield) volatile fields
9340 become non-addressable.
9341 2. the bitsize is narrower than the access size. Need
9342 to extract bitfields from the access. */
9343 || (volatilep && flag_strict_volatile_bitfields > 0
9344 && (bitpos % GET_MODE_ALIGNMENT (mode) != 0
9345 || (mode1 != BLKmode
9346 && bitsize < GET_MODE_SIZE (mode1) * BITS_PER_UNIT)))
9347 /* If the field isn't aligned enough to fetch as a memref,
9348 fetch it as a bit field. */
9349 || (mode1 != BLKmode
9350 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
9351 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
9353 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
9354 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
9355 && ((modifier == EXPAND_CONST_ADDRESS
9356 || modifier == EXPAND_INITIALIZER)
9358 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
9359 || (bitpos % BITS_PER_UNIT != 0)))
9360 /* If the type and the field are a constant size and the
9361 size of the type isn't the same size as the bitfield,
9362 we must use bitfield operations. */
9364 && TYPE_SIZE (TREE_TYPE (exp))
9365 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9366 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
9369 enum machine_mode ext_mode = mode;
9371 if (ext_mode == BLKmode
9372 && ! (target != 0 && MEM_P (op0)
9374 && bitpos % BITS_PER_UNIT == 0))
9375 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
9377 if (ext_mode == BLKmode)
9380 target = assign_temp (type, 0, 1, 1);
9385 /* In this case, BITPOS must start at a byte boundary and
9386 TARGET, if specified, must be a MEM. */
9387 gcc_assert (MEM_P (op0)
9388 && (!target || MEM_P (target))
9389 && !(bitpos % BITS_PER_UNIT));
9391 emit_block_move (target,
9392 adjust_address (op0, VOIDmode,
9393 bitpos / BITS_PER_UNIT),
9394 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
9396 (modifier == EXPAND_STACK_PARM
9397 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9402 op0 = validize_mem (op0);
9404 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
9405 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9407 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp, packedp,
9408 (modifier == EXPAND_STACK_PARM
9409 ? NULL_RTX : target),
9410 ext_mode, ext_mode);
9412 /* If the result is a record type and BITSIZE is narrower than
9413 the mode of OP0, an integral mode, and this is a big endian
9414 machine, we must put the field into the high-order bits. */
9415 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
9416 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
9417 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
9418 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
9419 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
9423 /* If the result type is BLKmode, store the data into a temporary
9424 of the appropriate type, but with the mode corresponding to the
9425 mode for the data we have (op0's mode). It's tempting to make
9426 this a constant type, since we know it's only being stored once,
9427 but that can cause problems if we are taking the address of this
9428 COMPONENT_REF because the MEM of any reference via that address
9429 will have flags corresponding to the type, which will not
9430 necessarily be constant. */
9431 if (mode == BLKmode)
9433 HOST_WIDE_INT size = GET_MODE_BITSIZE (ext_mode);
9436 /* If the reference doesn't use the alias set of its type,
9437 we cannot create the temporary using that type. */
9438 if (component_uses_parent_alias_set (exp))
9440 new_rtx = assign_stack_local (ext_mode, size, 0);
9441 set_mem_alias_set (new_rtx, get_alias_set (exp));
9444 new_rtx = assign_stack_temp_for_type (ext_mode, size, 0, type);
9446 emit_move_insn (new_rtx, op0);
9447 op0 = copy_rtx (new_rtx);
9448 PUT_MODE (op0, BLKmode);
9449 set_mem_attributes (op0, exp, 1);
9455 /* If the result is BLKmode, use that to access the object
9457 if (mode == BLKmode)
9460 /* Get a reference to just this component. */
9461 if (modifier == EXPAND_CONST_ADDRESS
9462 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
9463 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
9465 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9467 if (op0 == orig_op0)
9468 op0 = copy_rtx (op0);
9470 set_mem_attributes (op0, exp, 0);
9471 if (REG_P (XEXP (op0, 0)))
9472 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9474 MEM_VOLATILE_P (op0) |= volatilep;
9475 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
9476 || modifier == EXPAND_CONST_ADDRESS
9477 || modifier == EXPAND_INITIALIZER)
9479 else if (target == 0)
9480 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9482 convert_move (target, op0, unsignedp);
9487 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
9490 /* All valid uses of __builtin_va_arg_pack () are removed during
9492 if (CALL_EXPR_VA_ARG_PACK (exp))
9493 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
9495 tree fndecl = get_callee_fndecl (exp), attr;
9498 && (attr = lookup_attribute ("error",
9499 DECL_ATTRIBUTES (fndecl))) != NULL)
9500 error ("%Kcall to %qs declared with attribute error: %s",
9501 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9502 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9504 && (attr = lookup_attribute ("warning",
9505 DECL_ATTRIBUTES (fndecl))) != NULL)
9506 warning_at (tree_nonartificial_location (exp),
9507 0, "%Kcall to %qs declared with attribute warning: %s",
9508 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9509 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9511 /* Check for a built-in function. */
9512 if (fndecl && DECL_BUILT_IN (fndecl))
9514 gcc_assert (DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_FRONTEND);
9515 return expand_builtin (exp, target, subtarget, tmode, ignore);
9518 return expand_call (exp, target, ignore);
9520 case VIEW_CONVERT_EXPR:
9523 /* If we are converting to BLKmode, try to avoid an intermediate
9524 temporary by fetching an inner memory reference. */
9526 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9527 && TYPE_MODE (TREE_TYPE (treeop0)) != BLKmode
9528 && handled_component_p (treeop0))
9530 enum machine_mode mode1;
9531 HOST_WIDE_INT bitsize, bitpos;
9536 = get_inner_reference (treeop0, &bitsize, &bitpos,
9537 &offset, &mode1, &unsignedp, &volatilep,
9541 /* ??? We should work harder and deal with non-zero offsets. */
9543 && (bitpos % BITS_PER_UNIT) == 0
9545 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) == 0)
9547 /* See the normal_inner_ref case for the rationale. */
9550 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9551 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9553 && modifier != EXPAND_STACK_PARM
9554 ? target : NULL_RTX),
9556 (modifier == EXPAND_INITIALIZER
9557 || modifier == EXPAND_CONST_ADDRESS
9558 || modifier == EXPAND_STACK_PARM)
9559 ? modifier : EXPAND_NORMAL);
9561 if (MEM_P (orig_op0))
9565 /* Get a reference to just this component. */
9566 if (modifier == EXPAND_CONST_ADDRESS
9567 || modifier == EXPAND_SUM
9568 || modifier == EXPAND_INITIALIZER)
9569 op0 = adjust_address_nv (op0, mode, bitpos / BITS_PER_UNIT);
9571 op0 = adjust_address (op0, mode, bitpos / BITS_PER_UNIT);
9573 if (op0 == orig_op0)
9574 op0 = copy_rtx (op0);
9576 set_mem_attributes (op0, treeop0, 0);
9577 if (REG_P (XEXP (op0, 0)))
9578 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9580 MEM_VOLATILE_P (op0) |= volatilep;
9586 op0 = expand_expr (treeop0,
9587 NULL_RTX, VOIDmode, modifier);
9589 /* If the input and output modes are both the same, we are done. */
9590 if (mode == GET_MODE (op0))
9592 /* If neither mode is BLKmode, and both modes are the same size
9593 then we can use gen_lowpart. */
9594 else if (mode != BLKmode && GET_MODE (op0) != BLKmode
9595 && GET_MODE_SIZE (mode) == GET_MODE_SIZE (GET_MODE (op0))
9596 && !COMPLEX_MODE_P (GET_MODE (op0)))
9598 if (GET_CODE (op0) == SUBREG)
9599 op0 = force_reg (GET_MODE (op0), op0);
9600 temp = gen_lowpart_common (mode, op0);
9605 if (!REG_P (op0) && !MEM_P (op0))
9606 op0 = force_reg (GET_MODE (op0), op0);
9607 op0 = gen_lowpart (mode, op0);
9610 /* If both types are integral, convert from one mode to the other. */
9611 else if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (TREE_TYPE (treeop0)))
9612 op0 = convert_modes (mode, GET_MODE (op0), op0,
9613 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
9614 /* As a last resort, spill op0 to memory, and reload it in a
9616 else if (!MEM_P (op0))
9618 /* If the operand is not a MEM, force it into memory. Since we
9619 are going to be changing the mode of the MEM, don't call
9620 force_const_mem for constants because we don't allow pool
9621 constants to change mode. */
9622 tree inner_type = TREE_TYPE (treeop0);
9624 gcc_assert (!TREE_ADDRESSABLE (exp));
9626 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
9628 = assign_stack_temp_for_type
9629 (TYPE_MODE (inner_type),
9630 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
9632 emit_move_insn (target, op0);
9636 /* At this point, OP0 is in the correct mode. If the output type is
9637 such that the operand is known to be aligned, indicate that it is.
9638 Otherwise, we need only be concerned about alignment for non-BLKmode
9642 enum insn_code icode;
9644 op0 = copy_rtx (op0);
9646 if (TYPE_ALIGN_OK (type))
9647 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
9648 else if (mode != BLKmode
9649 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode)
9650 /* If the target does have special handling for unaligned
9651 loads of mode then use them. */
9652 && ((icode = optab_handler (movmisalign_optab, mode))
9653 != CODE_FOR_nothing))
9657 op0 = adjust_address (op0, mode, 0);
9658 /* We've already validated the memory, and we're creating a
9659 new pseudo destination. The predicates really can't
9661 reg = gen_reg_rtx (mode);
9663 /* Nor can the insn generator. */
9664 insn = GEN_FCN (icode) (reg, op0);
9668 else if (STRICT_ALIGNMENT
9670 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode))
9672 tree inner_type = TREE_TYPE (treeop0);
9673 HOST_WIDE_INT temp_size
9674 = MAX (int_size_in_bytes (inner_type),
9675 (HOST_WIDE_INT) GET_MODE_SIZE (mode));
9677 = assign_stack_temp_for_type (mode, temp_size, 0, type);
9678 rtx new_with_op0_mode
9679 = adjust_address (new_rtx, GET_MODE (op0), 0);
9681 gcc_assert (!TREE_ADDRESSABLE (exp));
9683 if (GET_MODE (op0) == BLKmode)
9684 emit_block_move (new_with_op0_mode, op0,
9685 GEN_INT (GET_MODE_SIZE (mode)),
9686 (modifier == EXPAND_STACK_PARM
9687 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9689 emit_move_insn (new_with_op0_mode, op0);
9694 op0 = adjust_address (op0, mode, 0);
9699 /* Use a compare and a jump for BLKmode comparisons, or for function
9700 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
9702 /* Although TRUTH_{AND,OR}IF_EXPR aren't present in GIMPLE, they
9703 are occassionally created by folding during expansion. */
9704 case TRUTH_ANDIF_EXPR:
9705 case TRUTH_ORIF_EXPR:
9708 || modifier == EXPAND_STACK_PARM
9709 || ! safe_from_p (target, treeop0, 1)
9710 || ! safe_from_p (target, treeop1, 1)
9711 /* Make sure we don't have a hard reg (such as function's return
9712 value) live across basic blocks, if not optimizing. */
9713 || (!optimize && REG_P (target)
9714 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
9715 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9718 emit_move_insn (target, const0_rtx);
9720 op1 = gen_label_rtx ();
9721 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
9724 emit_move_insn (target, const1_rtx);
9727 return ignore ? const0_rtx : target;
9729 case STATEMENT_LIST:
9731 tree_stmt_iterator iter;
9733 gcc_assert (ignore);
9735 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
9736 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
9741 /* A COND_EXPR with its type being VOID_TYPE represents a
9742 conditional jump and is handled in
9743 expand_gimple_cond_expr. */
9744 gcc_assert (!VOID_TYPE_P (type));
9746 /* Note that COND_EXPRs whose type is a structure or union
9747 are required to be constructed to contain assignments of
9748 a temporary variable, so that we can evaluate them here
9749 for side effect only. If type is void, we must do likewise. */
9751 gcc_assert (!TREE_ADDRESSABLE (type)
9753 && TREE_TYPE (treeop1) != void_type_node
9754 && TREE_TYPE (treeop2) != void_type_node);
9756 /* If we are not to produce a result, we have no target. Otherwise,
9757 if a target was specified use it; it will not be used as an
9758 intermediate target unless it is safe. If no target, use a
9761 if (modifier != EXPAND_STACK_PARM
9763 && safe_from_p (original_target, treeop0, 1)
9764 && GET_MODE (original_target) == mode
9765 #ifdef HAVE_conditional_move
9766 && (! can_conditionally_move_p (mode)
9767 || REG_P (original_target))
9769 && !MEM_P (original_target))
9770 temp = original_target;
9772 temp = assign_temp (type, 0, 0, 1);
9774 do_pending_stack_adjust ();
9776 op0 = gen_label_rtx ();
9777 op1 = gen_label_rtx ();
9778 jumpifnot (treeop0, op0, -1);
9779 store_expr (treeop1, temp,
9780 modifier == EXPAND_STACK_PARM,
9783 emit_jump_insn (gen_jump (op1));
9786 store_expr (treeop2, temp,
9787 modifier == EXPAND_STACK_PARM,
9795 target = expand_vec_cond_expr (type, treeop0, treeop1, treeop2, target);
9802 gcc_assert (ignore);
9804 /* Check for |= or &= of a bitfield of size one into another bitfield
9805 of size 1. In this case, (unless we need the result of the
9806 assignment) we can do this more efficiently with a
9807 test followed by an assignment, if necessary.
9809 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9810 things change so we do, this code should be enhanced to
9812 if (TREE_CODE (lhs) == COMPONENT_REF
9813 && (TREE_CODE (rhs) == BIT_IOR_EXPR
9814 || TREE_CODE (rhs) == BIT_AND_EXPR)
9815 && TREE_OPERAND (rhs, 0) == lhs
9816 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
9817 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
9818 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
9820 rtx label = gen_label_rtx ();
9821 int value = TREE_CODE (rhs) == BIT_IOR_EXPR;
9822 do_jump (TREE_OPERAND (rhs, 1),
9824 value ? 0 : label, -1);
9825 expand_assignment (lhs, build_int_cst (TREE_TYPE (rhs), value),
9826 MOVE_NONTEMPORAL (exp));
9827 do_pending_stack_adjust ();
9832 expand_assignment (lhs, rhs, MOVE_NONTEMPORAL (exp));
9837 return expand_expr_addr_expr (exp, target, tmode, modifier);
9840 op0 = expand_normal (treeop0);
9841 return read_complex_part (op0, false);
9844 op0 = expand_normal (treeop0);
9845 return read_complex_part (op0, true);
9852 /* Expanded in cfgexpand.c. */
9855 case TRY_CATCH_EXPR:
9857 case EH_FILTER_EXPR:
9858 case TRY_FINALLY_EXPR:
9859 /* Lowered by tree-eh.c. */
9862 case WITH_CLEANUP_EXPR:
9863 case CLEANUP_POINT_EXPR:
9865 case CASE_LABEL_EXPR:
9871 case PREINCREMENT_EXPR:
9872 case PREDECREMENT_EXPR:
9873 case POSTINCREMENT_EXPR:
9874 case POSTDECREMENT_EXPR:
9877 /* Lowered by gimplify.c. */
9881 /* Function descriptors are not valid except for as
9882 initialization constants, and should not be expanded. */
9885 case WITH_SIZE_EXPR:
9886 /* WITH_SIZE_EXPR expands to its first argument. The caller should
9887 have pulled out the size to use in whatever context it needed. */
9888 return expand_expr_real (treeop0, original_target, tmode,
9891 case REALIGN_LOAD_EXPR:
9893 tree oprnd0 = treeop0;
9894 tree oprnd1 = treeop1;
9895 tree oprnd2 = treeop2;
9898 this_optab = optab_for_tree_code (code, type, optab_default);
9899 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
9900 op2 = expand_normal (oprnd2);
9901 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
9909 tree oprnd0 = treeop0;
9910 tree oprnd1 = treeop1;
9911 tree oprnd2 = treeop2;
9914 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
9915 op2 = expand_normal (oprnd2);
9916 target = expand_widen_pattern_expr (&ops, op0, op1, op2,
9921 case COMPOUND_LITERAL_EXPR:
9923 /* Initialize the anonymous variable declared in the compound
9924 literal, then return the variable. */
9925 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
9927 /* Create RTL for this variable. */
9928 if (!DECL_RTL_SET_P (decl))
9930 if (DECL_HARD_REGISTER (decl))
9931 /* The user specified an assembler name for this variable.
9933 rest_of_decl_compilation (decl, 0, 0);
9938 return expand_expr_real (decl, original_target, tmode,
9943 return expand_expr_real_2 (&ops, target, tmode, modifier);
9947 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
9948 signedness of TYPE), possibly returning the result in TARGET. */
9950 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
9952 HOST_WIDE_INT prec = TYPE_PRECISION (type);
9953 if (target && GET_MODE (target) != GET_MODE (exp))
9955 /* For constant values, reduce using build_int_cst_type. */
9956 if (CONST_INT_P (exp))
9958 HOST_WIDE_INT value = INTVAL (exp);
9959 tree t = build_int_cst_type (type, value);
9960 return expand_expr (t, target, VOIDmode, EXPAND_NORMAL);
9962 else if (TYPE_UNSIGNED (type))
9964 rtx mask = immed_double_int_const (double_int_mask (prec),
9966 return expand_and (GET_MODE (exp), exp, mask, target);
9970 tree count = build_int_cst (NULL_TREE,
9971 GET_MODE_BITSIZE (GET_MODE (exp)) - prec);
9972 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9973 return expand_shift (RSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9977 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9978 when applied to the address of EXP produces an address known to be
9979 aligned more than BIGGEST_ALIGNMENT. */
9982 is_aligning_offset (const_tree offset, const_tree exp)
9984 /* Strip off any conversions. */
9985 while (CONVERT_EXPR_P (offset))
9986 offset = TREE_OPERAND (offset, 0);
9988 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9989 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9990 if (TREE_CODE (offset) != BIT_AND_EXPR
9991 || !host_integerp (TREE_OPERAND (offset, 1), 1)
9992 || compare_tree_int (TREE_OPERAND (offset, 1),
9993 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
9994 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
9997 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9998 It must be NEGATE_EXPR. Then strip any more conversions. */
9999 offset = TREE_OPERAND (offset, 0);
10000 while (CONVERT_EXPR_P (offset))
10001 offset = TREE_OPERAND (offset, 0);
10003 if (TREE_CODE (offset) != NEGATE_EXPR)
10006 offset = TREE_OPERAND (offset, 0);
10007 while (CONVERT_EXPR_P (offset))
10008 offset = TREE_OPERAND (offset, 0);
10010 /* This must now be the address of EXP. */
10011 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
10014 /* Return the tree node if an ARG corresponds to a string constant or zero
10015 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
10016 in bytes within the string that ARG is accessing. The type of the
10017 offset will be `sizetype'. */
10020 string_constant (tree arg, tree *ptr_offset)
10022 tree array, offset, lower_bound;
10025 if (TREE_CODE (arg) == ADDR_EXPR)
10027 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
10029 *ptr_offset = size_zero_node;
10030 return TREE_OPERAND (arg, 0);
10032 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
10034 array = TREE_OPERAND (arg, 0);
10035 offset = size_zero_node;
10037 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
10039 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
10040 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
10041 if (TREE_CODE (array) != STRING_CST
10042 && TREE_CODE (array) != VAR_DECL)
10045 /* Check if the array has a nonzero lower bound. */
10046 lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
10047 if (!integer_zerop (lower_bound))
10049 /* If the offset and base aren't both constants, return 0. */
10050 if (TREE_CODE (lower_bound) != INTEGER_CST)
10052 if (TREE_CODE (offset) != INTEGER_CST)
10054 /* Adjust offset by the lower bound. */
10055 offset = size_diffop (fold_convert (sizetype, offset),
10056 fold_convert (sizetype, lower_bound));
10062 else if (TREE_CODE (arg) == PLUS_EXPR || TREE_CODE (arg) == POINTER_PLUS_EXPR)
10064 tree arg0 = TREE_OPERAND (arg, 0);
10065 tree arg1 = TREE_OPERAND (arg, 1);
10070 if (TREE_CODE (arg0) == ADDR_EXPR
10071 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
10072 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
10074 array = TREE_OPERAND (arg0, 0);
10077 else if (TREE_CODE (arg1) == ADDR_EXPR
10078 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
10079 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
10081 array = TREE_OPERAND (arg1, 0);
10090 if (TREE_CODE (array) == STRING_CST)
10092 *ptr_offset = fold_convert (sizetype, offset);
10095 else if (TREE_CODE (array) == VAR_DECL
10096 || TREE_CODE (array) == CONST_DECL)
10100 /* Variables initialized to string literals can be handled too. */
10101 if (!const_value_known_p (array)
10102 || !DECL_INITIAL (array)
10103 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
10106 /* Avoid const char foo[4] = "abcde"; */
10107 if (DECL_SIZE_UNIT (array) == NULL_TREE
10108 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
10109 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
10110 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
10113 /* If variable is bigger than the string literal, OFFSET must be constant
10114 and inside of the bounds of the string literal. */
10115 offset = fold_convert (sizetype, offset);
10116 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
10117 && (! host_integerp (offset, 1)
10118 || compare_tree_int (offset, length) >= 0))
10121 *ptr_offset = offset;
10122 return DECL_INITIAL (array);
10128 /* Generate code to calculate OPS, and exploded expression
10129 using a store-flag instruction and return an rtx for the result.
10130 OPS reflects a comparison.
10132 If TARGET is nonzero, store the result there if convenient.
10134 Return zero if there is no suitable set-flag instruction
10135 available on this machine.
10137 Once expand_expr has been called on the arguments of the comparison,
10138 we are committed to doing the store flag, since it is not safe to
10139 re-evaluate the expression. We emit the store-flag insn by calling
10140 emit_store_flag, but only expand the arguments if we have a reason
10141 to believe that emit_store_flag will be successful. If we think that
10142 it will, but it isn't, we have to simulate the store-flag with a
10143 set/jump/set sequence. */
10146 do_store_flag (sepops ops, rtx target, enum machine_mode mode)
10148 enum rtx_code code;
10149 tree arg0, arg1, type;
10151 enum machine_mode operand_mode;
10154 rtx subtarget = target;
10155 location_t loc = ops->location;
10160 /* Don't crash if the comparison was erroneous. */
10161 if (arg0 == error_mark_node || arg1 == error_mark_node)
10164 type = TREE_TYPE (arg0);
10165 operand_mode = TYPE_MODE (type);
10166 unsignedp = TYPE_UNSIGNED (type);
10168 /* We won't bother with BLKmode store-flag operations because it would mean
10169 passing a lot of information to emit_store_flag. */
10170 if (operand_mode == BLKmode)
10173 /* We won't bother with store-flag operations involving function pointers
10174 when function pointers must be canonicalized before comparisons. */
10175 #ifdef HAVE_canonicalize_funcptr_for_compare
10176 if (HAVE_canonicalize_funcptr_for_compare
10177 && ((TREE_CODE (TREE_TYPE (arg0)) == POINTER_TYPE
10178 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0)))
10180 || (TREE_CODE (TREE_TYPE (arg1)) == POINTER_TYPE
10181 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1)))
10182 == FUNCTION_TYPE))))
10189 /* Get the rtx comparison code to use. We know that EXP is a comparison
10190 operation of some type. Some comparisons against 1 and -1 can be
10191 converted to comparisons with zero. Do so here so that the tests
10192 below will be aware that we have a comparison with zero. These
10193 tests will not catch constants in the first operand, but constants
10194 are rarely passed as the first operand. */
10205 if (integer_onep (arg1))
10206 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
10208 code = unsignedp ? LTU : LT;
10211 if (! unsignedp && integer_all_onesp (arg1))
10212 arg1 = integer_zero_node, code = LT;
10214 code = unsignedp ? LEU : LE;
10217 if (! unsignedp && integer_all_onesp (arg1))
10218 arg1 = integer_zero_node, code = GE;
10220 code = unsignedp ? GTU : GT;
10223 if (integer_onep (arg1))
10224 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10226 code = unsignedp ? GEU : GE;
10229 case UNORDERED_EXPR:
10255 gcc_unreachable ();
10258 /* Put a constant second. */
10259 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST
10260 || TREE_CODE (arg0) == FIXED_CST)
10262 tem = arg0; arg0 = arg1; arg1 = tem;
10263 code = swap_condition (code);
10266 /* If this is an equality or inequality test of a single bit, we can
10267 do this by shifting the bit being tested to the low-order bit and
10268 masking the result with the constant 1. If the condition was EQ,
10269 we xor it with 1. This does not require an scc insn and is faster
10270 than an scc insn even if we have it.
10272 The code to make this transformation was moved into fold_single_bit_test,
10273 so we just call into the folder and expand its result. */
10275 if ((code == NE || code == EQ)
10276 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
10277 && integer_pow2p (TREE_OPERAND (arg0, 1))
10278 && (TYPE_PRECISION (ops->type) != 1 || TYPE_UNSIGNED (ops->type)))
10280 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
10281 return expand_expr (fold_single_bit_test (loc,
10282 code == NE ? NE_EXPR : EQ_EXPR,
10284 target, VOIDmode, EXPAND_NORMAL);
10287 if (! get_subtarget (target)
10288 || GET_MODE (subtarget) != operand_mode)
10291 expand_operands (arg0, arg1, subtarget, &op0, &op1, EXPAND_NORMAL);
10294 target = gen_reg_rtx (mode);
10296 /* Try a cstore if possible. */
10297 return emit_store_flag_force (target, code, op0, op1,
10298 operand_mode, unsignedp,
10299 (TYPE_PRECISION (ops->type) == 1
10300 && !TYPE_UNSIGNED (ops->type)) ? -1 : 1);
10304 /* Stubs in case we haven't got a casesi insn. */
10305 #ifndef HAVE_casesi
10306 # define HAVE_casesi 0
10307 # define gen_casesi(a, b, c, d, e) (0)
10308 # define CODE_FOR_casesi CODE_FOR_nothing
10311 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10312 0 otherwise (i.e. if there is no casesi instruction). */
10314 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
10315 rtx table_label ATTRIBUTE_UNUSED, rtx default_label,
10316 rtx fallback_label ATTRIBUTE_UNUSED)
10318 enum machine_mode index_mode = SImode;
10319 int index_bits = GET_MODE_BITSIZE (index_mode);
10320 rtx op1, op2, index;
10321 enum machine_mode op_mode;
10326 /* Convert the index to SImode. */
10327 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10329 enum machine_mode omode = TYPE_MODE (index_type);
10330 rtx rangertx = expand_normal (range);
10332 /* We must handle the endpoints in the original mode. */
10333 index_expr = build2 (MINUS_EXPR, index_type,
10334 index_expr, minval);
10335 minval = integer_zero_node;
10336 index = expand_normal (index_expr);
10338 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10339 omode, 1, default_label);
10340 /* Now we can safely truncate. */
10341 index = convert_to_mode (index_mode, index, 0);
10345 if (TYPE_MODE (index_type) != index_mode)
10347 index_type = lang_hooks.types.type_for_size (index_bits, 0);
10348 index_expr = fold_convert (index_type, index_expr);
10351 index = expand_normal (index_expr);
10354 do_pending_stack_adjust ();
10356 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
10357 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
10359 index = copy_to_mode_reg (op_mode, index);
10361 op1 = expand_normal (minval);
10363 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
10364 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
10365 op1, TYPE_UNSIGNED (TREE_TYPE (minval)));
10366 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
10368 op1 = copy_to_mode_reg (op_mode, op1);
10370 op2 = expand_normal (range);
10372 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
10373 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
10374 op2, TYPE_UNSIGNED (TREE_TYPE (range)));
10375 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
10377 op2 = copy_to_mode_reg (op_mode, op2);
10379 emit_jump_insn (gen_casesi (index, op1, op2,
10380 table_label, !default_label
10381 ? fallback_label : default_label));
10385 /* Attempt to generate a tablejump instruction; same concept. */
10386 #ifndef HAVE_tablejump
10387 #define HAVE_tablejump 0
10388 #define gen_tablejump(x, y) (0)
10391 /* Subroutine of the next function.
10393 INDEX is the value being switched on, with the lowest value
10394 in the table already subtracted.
10395 MODE is its expected mode (needed if INDEX is constant).
10396 RANGE is the length of the jump table.
10397 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10399 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10400 index value is out of range. */
10403 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
10408 if (INTVAL (range) > cfun->cfg->max_jumptable_ents)
10409 cfun->cfg->max_jumptable_ents = INTVAL (range);
10411 /* Do an unsigned comparison (in the proper mode) between the index
10412 expression and the value which represents the length of the range.
10413 Since we just finished subtracting the lower bound of the range
10414 from the index expression, this comparison allows us to simultaneously
10415 check that the original index expression value is both greater than
10416 or equal to the minimum value of the range and less than or equal to
10417 the maximum value of the range. */
10420 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10423 /* If index is in range, it must fit in Pmode.
10424 Convert to Pmode so we can index with it. */
10426 index = convert_to_mode (Pmode, index, 1);
10428 /* Don't let a MEM slip through, because then INDEX that comes
10429 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10430 and break_out_memory_refs will go to work on it and mess it up. */
10431 #ifdef PIC_CASE_VECTOR_ADDRESS
10432 if (flag_pic && !REG_P (index))
10433 index = copy_to_mode_reg (Pmode, index);
10436 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10437 GET_MODE_SIZE, because this indicates how large insns are. The other
10438 uses should all be Pmode, because they are addresses. This code
10439 could fail if addresses and insns are not the same size. */
10440 index = gen_rtx_PLUS (Pmode,
10441 gen_rtx_MULT (Pmode, index,
10442 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10443 gen_rtx_LABEL_REF (Pmode, table_label));
10444 #ifdef PIC_CASE_VECTOR_ADDRESS
10446 index = PIC_CASE_VECTOR_ADDRESS (index);
10449 index = memory_address (CASE_VECTOR_MODE, index);
10450 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10451 vector = gen_const_mem (CASE_VECTOR_MODE, index);
10452 convert_move (temp, vector, 0);
10454 emit_jump_insn (gen_tablejump (temp, table_label));
10456 /* If we are generating PIC code or if the table is PC-relative, the
10457 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10458 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10463 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
10464 rtx table_label, rtx default_label)
10468 if (! HAVE_tablejump)
10471 index_expr = fold_build2 (MINUS_EXPR, index_type,
10472 fold_convert (index_type, index_expr),
10473 fold_convert (index_type, minval));
10474 index = expand_normal (index_expr);
10475 do_pending_stack_adjust ();
10477 do_tablejump (index, TYPE_MODE (index_type),
10478 convert_modes (TYPE_MODE (index_type),
10479 TYPE_MODE (TREE_TYPE (range)),
10480 expand_normal (range),
10481 TYPE_UNSIGNED (TREE_TYPE (range))),
10482 table_label, default_label);
10486 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10488 const_vector_from_tree (tree exp)
10493 enum machine_mode inner, mode;
10495 mode = TYPE_MODE (TREE_TYPE (exp));
10497 if (initializer_zerop (exp))
10498 return CONST0_RTX (mode);
10500 units = GET_MODE_NUNITS (mode);
10501 inner = GET_MODE_INNER (mode);
10503 v = rtvec_alloc (units);
10505 link = TREE_VECTOR_CST_ELTS (exp);
10506 for (i = 0; link; link = TREE_CHAIN (link), ++i)
10508 elt = TREE_VALUE (link);
10510 if (TREE_CODE (elt) == REAL_CST)
10511 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
10513 else if (TREE_CODE (elt) == FIXED_CST)
10514 RTVEC_ELT (v, i) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt),
10517 RTVEC_ELT (v, i) = immed_double_int_const (tree_to_double_int (elt),
10521 /* Initialize remaining elements to 0. */
10522 for (; i < units; ++i)
10523 RTVEC_ELT (v, i) = CONST0_RTX (inner);
10525 return gen_rtx_CONST_VECTOR (mode, v);
10528 /* Build a decl for a personality function given a language prefix. */
10531 build_personality_function (const char *lang)
10533 const char *unwind_and_version;
10537 switch (targetm.except_unwind_info (&global_options))
10542 unwind_and_version = "_sj0";
10546 unwind_and_version = "_v0";
10549 gcc_unreachable ();
10552 name = ACONCAT (("__", lang, "_personality", unwind_and_version, NULL));
10554 type = build_function_type_list (integer_type_node, integer_type_node,
10555 long_long_unsigned_type_node,
10556 ptr_type_node, ptr_type_node, NULL_TREE);
10557 decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
10558 get_identifier (name), type);
10559 DECL_ARTIFICIAL (decl) = 1;
10560 DECL_EXTERNAL (decl) = 1;
10561 TREE_PUBLIC (decl) = 1;
10563 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
10564 are the flags assigned by targetm.encode_section_info. */
10565 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl), 0), NULL);
10570 /* Extracts the personality function of DECL and returns the corresponding
10574 get_personality_function (tree decl)
10576 tree personality = DECL_FUNCTION_PERSONALITY (decl);
10577 enum eh_personality_kind pk;
10579 pk = function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl));
10580 if (pk == eh_personality_none)
10584 && pk == eh_personality_any)
10585 personality = lang_hooks.eh_personality ();
10587 if (pk == eh_personality_lang)
10588 gcc_assert (personality != NULL_TREE);
10590 return XEXP (DECL_RTL (personality), 0);
10593 #include "gt-expr.h"