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_operand_matches (ic, 1, mem))
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 int save_volatile_ok = volatile_ok;
1262 enum machine_mode mode;
1264 if (expected_align < align)
1265 expected_align = align;
1267 /* Since this is a move insn, we don't care about volatility. */
1270 /* Try the most limited insn first, because there's no point
1271 including more than one in the machine description unless
1272 the more limited one has some advantage. */
1274 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1275 mode = GET_MODE_WIDER_MODE (mode))
1277 enum insn_code code = direct_optab_handler (movmem_optab, mode);
1279 if (code != CODE_FOR_nothing
1280 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1281 here because if SIZE is less than the mode mask, as it is
1282 returned by the macro, it will definitely be less than the
1283 actual mode mask. */
1284 && ((CONST_INT_P (size)
1285 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1286 <= (GET_MODE_MASK (mode) >> 1)))
1287 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD))
1289 struct expand_operand ops[6];
1292 /* ??? When called via emit_block_move_for_call, it'd be
1293 nice if there were some way to inform the backend, so
1294 that it doesn't fail the expansion because it thinks
1295 emitting the libcall would be more efficient. */
1296 nops = insn_data[(int) code].n_generator_args;
1297 gcc_assert (nops == 4 || nops == 6);
1299 create_fixed_operand (&ops[0], x);
1300 create_fixed_operand (&ops[1], y);
1301 /* The check above guarantees that this size conversion is valid. */
1302 create_convert_operand_to (&ops[2], size, mode, true);
1303 create_integer_operand (&ops[3], align / BITS_PER_UNIT);
1306 create_integer_operand (&ops[4], expected_align / BITS_PER_UNIT);
1307 create_integer_operand (&ops[5], expected_size);
1309 if (maybe_expand_insn (code, nops, ops))
1311 volatile_ok = save_volatile_ok;
1317 volatile_ok = save_volatile_ok;
1321 /* A subroutine of emit_block_move. Expand a call to memcpy.
1322 Return the return value from memcpy, 0 otherwise. */
1325 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1327 rtx dst_addr, src_addr;
1328 tree call_expr, fn, src_tree, dst_tree, size_tree;
1329 enum machine_mode size_mode;
1332 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1333 pseudos. We can then place those new pseudos into a VAR_DECL and
1336 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1337 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1339 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1340 src_addr = convert_memory_address (ptr_mode, src_addr);
1342 dst_tree = make_tree (ptr_type_node, dst_addr);
1343 src_tree = make_tree (ptr_type_node, src_addr);
1345 size_mode = TYPE_MODE (sizetype);
1347 size = convert_to_mode (size_mode, size, 1);
1348 size = copy_to_mode_reg (size_mode, size);
1350 /* It is incorrect to use the libcall calling conventions to call
1351 memcpy in this context. This could be a user call to memcpy and
1352 the user may wish to examine the return value from memcpy. For
1353 targets where libcalls and normal calls have different conventions
1354 for returning pointers, we could end up generating incorrect code. */
1356 size_tree = make_tree (sizetype, size);
1358 fn = emit_block_move_libcall_fn (true);
1359 call_expr = build_call_expr (fn, 3, dst_tree, src_tree, size_tree);
1360 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1362 retval = expand_normal (call_expr);
1367 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1368 for the function we use for block copies. The first time FOR_CALL
1369 is true, we call assemble_external. */
1371 static GTY(()) tree block_move_fn;
1374 init_block_move_fn (const char *asmspec)
1380 fn = get_identifier ("memcpy");
1381 args = build_function_type_list (ptr_type_node, ptr_type_node,
1382 const_ptr_type_node, sizetype,
1385 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
1386 DECL_EXTERNAL (fn) = 1;
1387 TREE_PUBLIC (fn) = 1;
1388 DECL_ARTIFICIAL (fn) = 1;
1389 TREE_NOTHROW (fn) = 1;
1390 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
1391 DECL_VISIBILITY_SPECIFIED (fn) = 1;
1397 set_user_assembler_name (block_move_fn, asmspec);
1401 emit_block_move_libcall_fn (int for_call)
1403 static bool emitted_extern;
1406 init_block_move_fn (NULL);
1408 if (for_call && !emitted_extern)
1410 emitted_extern = true;
1411 make_decl_rtl (block_move_fn);
1412 assemble_external (block_move_fn);
1415 return block_move_fn;
1418 /* A subroutine of emit_block_move. Copy the data via an explicit
1419 loop. This is used only when libcalls are forbidden. */
1420 /* ??? It'd be nice to copy in hunks larger than QImode. */
1423 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1424 unsigned int align ATTRIBUTE_UNUSED)
1426 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1427 enum machine_mode x_addr_mode
1428 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (x));
1429 enum machine_mode y_addr_mode
1430 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (y));
1431 enum machine_mode iter_mode;
1433 iter_mode = GET_MODE (size);
1434 if (iter_mode == VOIDmode)
1435 iter_mode = word_mode;
1437 top_label = gen_label_rtx ();
1438 cmp_label = gen_label_rtx ();
1439 iter = gen_reg_rtx (iter_mode);
1441 emit_move_insn (iter, const0_rtx);
1443 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1444 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1445 do_pending_stack_adjust ();
1447 emit_jump (cmp_label);
1448 emit_label (top_label);
1450 tmp = convert_modes (x_addr_mode, iter_mode, iter, true);
1451 x_addr = gen_rtx_PLUS (x_addr_mode, x_addr, tmp);
1453 if (x_addr_mode != y_addr_mode)
1454 tmp = convert_modes (y_addr_mode, iter_mode, iter, true);
1455 y_addr = gen_rtx_PLUS (y_addr_mode, y_addr, tmp);
1457 x = change_address (x, QImode, x_addr);
1458 y = change_address (y, QImode, y_addr);
1460 emit_move_insn (x, y);
1462 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1463 true, OPTAB_LIB_WIDEN);
1465 emit_move_insn (iter, tmp);
1467 emit_label (cmp_label);
1469 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1473 /* Copy all or part of a value X into registers starting at REGNO.
1474 The number of registers to be filled is NREGS. */
1477 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1480 #ifdef HAVE_load_multiple
1488 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1489 x = validize_mem (force_const_mem (mode, x));
1491 /* See if the machine can do this with a load multiple insn. */
1492 #ifdef HAVE_load_multiple
1493 if (HAVE_load_multiple)
1495 last = get_last_insn ();
1496 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1504 delete_insns_since (last);
1508 for (i = 0; i < nregs; i++)
1509 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1510 operand_subword_force (x, i, mode));
1513 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1514 The number of registers to be filled is NREGS. */
1517 move_block_from_reg (int regno, rtx x, int nregs)
1524 /* See if the machine can do this with a store multiple insn. */
1525 #ifdef HAVE_store_multiple
1526 if (HAVE_store_multiple)
1528 rtx last = get_last_insn ();
1529 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1537 delete_insns_since (last);
1541 for (i = 0; i < nregs; i++)
1543 rtx tem = operand_subword (x, i, 1, BLKmode);
1547 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1551 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1552 ORIG, where ORIG is a non-consecutive group of registers represented by
1553 a PARALLEL. The clone is identical to the original except in that the
1554 original set of registers is replaced by a new set of pseudo registers.
1555 The new set has the same modes as the original set. */
1558 gen_group_rtx (rtx orig)
1563 gcc_assert (GET_CODE (orig) == PARALLEL);
1565 length = XVECLEN (orig, 0);
1566 tmps = XALLOCAVEC (rtx, length);
1568 /* Skip a NULL entry in first slot. */
1569 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1574 for (; i < length; i++)
1576 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1577 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1579 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1582 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1585 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1586 except that values are placed in TMPS[i], and must later be moved
1587 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1590 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1594 enum machine_mode m = GET_MODE (orig_src);
1596 gcc_assert (GET_CODE (dst) == PARALLEL);
1599 && !SCALAR_INT_MODE_P (m)
1600 && !MEM_P (orig_src)
1601 && GET_CODE (orig_src) != CONCAT)
1603 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1604 if (imode == BLKmode)
1605 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1607 src = gen_reg_rtx (imode);
1608 if (imode != BLKmode)
1609 src = gen_lowpart (GET_MODE (orig_src), src);
1610 emit_move_insn (src, orig_src);
1611 /* ...and back again. */
1612 if (imode != BLKmode)
1613 src = gen_lowpart (imode, src);
1614 emit_group_load_1 (tmps, dst, src, type, ssize);
1618 /* Check for a NULL entry, used to indicate that the parameter goes
1619 both on the stack and in registers. */
1620 if (XEXP (XVECEXP (dst, 0, 0), 0))
1625 /* Process the pieces. */
1626 for (i = start; i < XVECLEN (dst, 0); i++)
1628 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1629 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1630 unsigned int bytelen = GET_MODE_SIZE (mode);
1633 /* Handle trailing fragments that run over the size of the struct. */
1634 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1636 /* Arrange to shift the fragment to where it belongs.
1637 extract_bit_field loads to the lsb of the reg. */
1639 #ifdef BLOCK_REG_PADDING
1640 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1641 == (BYTES_BIG_ENDIAN ? upward : downward)
1646 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1647 bytelen = ssize - bytepos;
1648 gcc_assert (bytelen > 0);
1651 /* If we won't be loading directly from memory, protect the real source
1652 from strange tricks we might play; but make sure that the source can
1653 be loaded directly into the destination. */
1655 if (!MEM_P (orig_src)
1656 && (!CONSTANT_P (orig_src)
1657 || (GET_MODE (orig_src) != mode
1658 && GET_MODE (orig_src) != VOIDmode)))
1660 if (GET_MODE (orig_src) == VOIDmode)
1661 src = gen_reg_rtx (mode);
1663 src = gen_reg_rtx (GET_MODE (orig_src));
1665 emit_move_insn (src, orig_src);
1668 /* Optimize the access just a bit. */
1670 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1671 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1672 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1673 && bytelen == GET_MODE_SIZE (mode))
1675 tmps[i] = gen_reg_rtx (mode);
1676 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1678 else if (COMPLEX_MODE_P (mode)
1679 && GET_MODE (src) == mode
1680 && bytelen == GET_MODE_SIZE (mode))
1681 /* Let emit_move_complex do the bulk of the work. */
1683 else if (GET_CODE (src) == CONCAT)
1685 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1686 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1688 if ((bytepos == 0 && bytelen == slen0)
1689 || (bytepos != 0 && bytepos + bytelen <= slen))
1691 /* The following assumes that the concatenated objects all
1692 have the same size. In this case, a simple calculation
1693 can be used to determine the object and the bit field
1695 tmps[i] = XEXP (src, bytepos / slen0);
1696 if (! CONSTANT_P (tmps[i])
1697 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1698 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1699 (bytepos % slen0) * BITS_PER_UNIT,
1700 1, false, NULL_RTX, mode, mode);
1706 gcc_assert (!bytepos);
1707 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1708 emit_move_insn (mem, src);
1709 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1710 0, 1, false, NULL_RTX, mode, mode);
1713 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1714 SIMD register, which is currently broken. While we get GCC
1715 to emit proper RTL for these cases, let's dump to memory. */
1716 else if (VECTOR_MODE_P (GET_MODE (dst))
1719 int slen = GET_MODE_SIZE (GET_MODE (src));
1722 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1723 emit_move_insn (mem, src);
1724 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1726 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1727 && XVECLEN (dst, 0) > 1)
1728 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1729 else if (CONSTANT_P (src))
1731 HOST_WIDE_INT len = (HOST_WIDE_INT) bytelen;
1739 gcc_assert (2 * len == ssize);
1740 split_double (src, &first, &second);
1747 else if (REG_P (src) && GET_MODE (src) == mode)
1750 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1751 bytepos * BITS_PER_UNIT, 1, false, NULL_RTX,
1755 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1756 build_int_cst (NULL_TREE, shift), tmps[i], 0);
1760 /* Emit code to move a block SRC of type TYPE to a block DST,
1761 where DST is non-consecutive registers represented by a PARALLEL.
1762 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1766 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1771 tmps = XALLOCAVEC (rtx, XVECLEN (dst, 0));
1772 emit_group_load_1 (tmps, dst, src, type, ssize);
1774 /* Copy the extracted pieces into the proper (probable) hard regs. */
1775 for (i = 0; i < XVECLEN (dst, 0); i++)
1777 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1780 emit_move_insn (d, tmps[i]);
1784 /* Similar, but load SRC into new pseudos in a format that looks like
1785 PARALLEL. This can later be fed to emit_group_move to get things
1786 in the right place. */
1789 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1794 vec = rtvec_alloc (XVECLEN (parallel, 0));
1795 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1797 /* Convert the vector to look just like the original PARALLEL, except
1798 with the computed values. */
1799 for (i = 0; i < XVECLEN (parallel, 0); i++)
1801 rtx e = XVECEXP (parallel, 0, i);
1802 rtx d = XEXP (e, 0);
1806 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1807 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1809 RTVEC_ELT (vec, i) = e;
1812 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1815 /* Emit code to move a block SRC to block DST, where SRC and DST are
1816 non-consecutive groups of registers, each represented by a PARALLEL. */
1819 emit_group_move (rtx dst, rtx src)
1823 gcc_assert (GET_CODE (src) == PARALLEL
1824 && GET_CODE (dst) == PARALLEL
1825 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1827 /* Skip first entry if NULL. */
1828 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1829 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1830 XEXP (XVECEXP (src, 0, i), 0));
1833 /* Move a group of registers represented by a PARALLEL into pseudos. */
1836 emit_group_move_into_temps (rtx src)
1838 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1841 for (i = 0; i < XVECLEN (src, 0); i++)
1843 rtx e = XVECEXP (src, 0, i);
1844 rtx d = XEXP (e, 0);
1847 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1848 RTVEC_ELT (vec, i) = e;
1851 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1854 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1855 where SRC is non-consecutive registers represented by a PARALLEL.
1856 SSIZE represents the total size of block ORIG_DST, or -1 if not
1860 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1863 int start, finish, i;
1864 enum machine_mode m = GET_MODE (orig_dst);
1866 gcc_assert (GET_CODE (src) == PARALLEL);
1868 if (!SCALAR_INT_MODE_P (m)
1869 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1871 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1872 if (imode == BLKmode)
1873 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1875 dst = gen_reg_rtx (imode);
1876 emit_group_store (dst, src, type, ssize);
1877 if (imode != BLKmode)
1878 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1879 emit_move_insn (orig_dst, dst);
1883 /* Check for a NULL entry, used to indicate that the parameter goes
1884 both on the stack and in registers. */
1885 if (XEXP (XVECEXP (src, 0, 0), 0))
1889 finish = XVECLEN (src, 0);
1891 tmps = XALLOCAVEC (rtx, finish);
1893 /* Copy the (probable) hard regs into pseudos. */
1894 for (i = start; i < finish; i++)
1896 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1897 if (!REG_P (reg) || REGNO (reg) < FIRST_PSEUDO_REGISTER)
1899 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1900 emit_move_insn (tmps[i], reg);
1906 /* If we won't be storing directly into memory, protect the real destination
1907 from strange tricks we might play. */
1909 if (GET_CODE (dst) == PARALLEL)
1913 /* We can get a PARALLEL dst if there is a conditional expression in
1914 a return statement. In that case, the dst and src are the same,
1915 so no action is necessary. */
1916 if (rtx_equal_p (dst, src))
1919 /* It is unclear if we can ever reach here, but we may as well handle
1920 it. Allocate a temporary, and split this into a store/load to/from
1923 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1924 emit_group_store (temp, src, type, ssize);
1925 emit_group_load (dst, temp, type, ssize);
1928 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1930 enum machine_mode outer = GET_MODE (dst);
1931 enum machine_mode inner;
1932 HOST_WIDE_INT bytepos;
1936 if (!REG_P (dst) || REGNO (dst) < FIRST_PSEUDO_REGISTER)
1937 dst = gen_reg_rtx (outer);
1939 /* Make life a bit easier for combine. */
1940 /* If the first element of the vector is the low part
1941 of the destination mode, use a paradoxical subreg to
1942 initialize the destination. */
1945 inner = GET_MODE (tmps[start]);
1946 bytepos = subreg_lowpart_offset (inner, outer);
1947 if (INTVAL (XEXP (XVECEXP (src, 0, start), 1)) == bytepos)
1949 temp = simplify_gen_subreg (outer, tmps[start],
1953 emit_move_insn (dst, temp);
1960 /* If the first element wasn't the low part, try the last. */
1962 && start < finish - 1)
1964 inner = GET_MODE (tmps[finish - 1]);
1965 bytepos = subreg_lowpart_offset (inner, outer);
1966 if (INTVAL (XEXP (XVECEXP (src, 0, finish - 1), 1)) == bytepos)
1968 temp = simplify_gen_subreg (outer, tmps[finish - 1],
1972 emit_move_insn (dst, temp);
1979 /* Otherwise, simply initialize the result to zero. */
1981 emit_move_insn (dst, CONST0_RTX (outer));
1984 /* Process the pieces. */
1985 for (i = start; i < finish; i++)
1987 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
1988 enum machine_mode mode = GET_MODE (tmps[i]);
1989 unsigned int bytelen = GET_MODE_SIZE (mode);
1990 unsigned int adj_bytelen = bytelen;
1993 /* Handle trailing fragments that run over the size of the struct. */
1994 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1995 adj_bytelen = ssize - bytepos;
1997 if (GET_CODE (dst) == CONCAT)
1999 if (bytepos + adj_bytelen
2000 <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2001 dest = XEXP (dst, 0);
2002 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2004 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2005 dest = XEXP (dst, 1);
2009 enum machine_mode dest_mode = GET_MODE (dest);
2010 enum machine_mode tmp_mode = GET_MODE (tmps[i]);
2012 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
2014 if (GET_MODE_ALIGNMENT (dest_mode)
2015 >= GET_MODE_ALIGNMENT (tmp_mode))
2017 dest = assign_stack_temp (dest_mode,
2018 GET_MODE_SIZE (dest_mode),
2020 emit_move_insn (adjust_address (dest,
2028 dest = assign_stack_temp (tmp_mode,
2029 GET_MODE_SIZE (tmp_mode),
2031 emit_move_insn (dest, tmps[i]);
2032 dst = adjust_address (dest, dest_mode, bytepos);
2038 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2040 /* store_bit_field always takes its value from the lsb.
2041 Move the fragment to the lsb if it's not already there. */
2043 #ifdef BLOCK_REG_PADDING
2044 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
2045 == (BYTES_BIG_ENDIAN ? upward : downward)
2051 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2052 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
2053 build_int_cst (NULL_TREE, shift),
2056 bytelen = adj_bytelen;
2059 /* Optimize the access just a bit. */
2061 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
2062 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
2063 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2064 && bytelen == GET_MODE_SIZE (mode))
2065 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2067 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2071 /* Copy from the pseudo into the (probable) hard reg. */
2072 if (orig_dst != dst)
2073 emit_move_insn (orig_dst, dst);
2076 /* Generate code to copy a BLKmode object of TYPE out of a
2077 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2078 is null, a stack temporary is created. TGTBLK is returned.
2080 The purpose of this routine is to handle functions that return
2081 BLKmode structures in registers. Some machines (the PA for example)
2082 want to return all small structures in registers regardless of the
2083 structure's alignment. */
2086 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
2088 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2089 rtx src = NULL, dst = NULL;
2090 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2091 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
2092 enum machine_mode copy_mode;
2096 tgtblk = assign_temp (build_qualified_type (type,
2098 | TYPE_QUAL_CONST)),
2100 preserve_temp_slots (tgtblk);
2103 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2104 into a new pseudo which is a full word. */
2106 if (GET_MODE (srcreg) != BLKmode
2107 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2108 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
2110 /* If the structure doesn't take up a whole number of words, see whether
2111 SRCREG is padded on the left or on the right. If it's on the left,
2112 set PADDING_CORRECTION to the number of bits to skip.
2114 In most ABIs, the structure will be returned at the least end of
2115 the register, which translates to right padding on little-endian
2116 targets and left padding on big-endian targets. The opposite
2117 holds if the structure is returned at the most significant
2118 end of the register. */
2119 if (bytes % UNITS_PER_WORD != 0
2120 && (targetm.calls.return_in_msb (type)
2122 : BYTES_BIG_ENDIAN))
2124 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2126 /* Copy the structure BITSIZE bits at a time. If the target lives in
2127 memory, take care of not reading/writing past its end by selecting
2128 a copy mode suited to BITSIZE. This should always be possible given
2131 We could probably emit more efficient code for machines which do not use
2132 strict alignment, but it doesn't seem worth the effort at the current
2135 copy_mode = word_mode;
2138 enum machine_mode mem_mode = mode_for_size (bitsize, MODE_INT, 1);
2139 if (mem_mode != BLKmode)
2140 copy_mode = mem_mode;
2143 for (bitpos = 0, xbitpos = padding_correction;
2144 bitpos < bytes * BITS_PER_UNIT;
2145 bitpos += bitsize, xbitpos += bitsize)
2147 /* We need a new source operand each time xbitpos is on a
2148 word boundary and when xbitpos == padding_correction
2149 (the first time through). */
2150 if (xbitpos % BITS_PER_WORD == 0
2151 || xbitpos == padding_correction)
2152 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2155 /* We need a new destination operand each time bitpos is on
2157 if (bitpos % BITS_PER_WORD == 0)
2158 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2160 /* Use xbitpos for the source extraction (right justified) and
2161 bitpos for the destination store (left justified). */
2162 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, copy_mode,
2163 extract_bit_field (src, bitsize,
2164 xbitpos % BITS_PER_WORD, 1, false,
2165 NULL_RTX, copy_mode, copy_mode));
2171 /* Add a USE expression for REG to the (possibly empty) list pointed
2172 to by CALL_FUSAGE. REG must denote a hard register. */
2175 use_reg (rtx *call_fusage, rtx reg)
2177 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2180 = gen_rtx_EXPR_LIST (VOIDmode,
2181 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2184 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2185 starting at REGNO. All of these registers must be hard registers. */
2188 use_regs (rtx *call_fusage, int regno, int nregs)
2192 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2194 for (i = 0; i < nregs; i++)
2195 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2198 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2199 PARALLEL REGS. This is for calls that pass values in multiple
2200 non-contiguous locations. The Irix 6 ABI has examples of this. */
2203 use_group_regs (rtx *call_fusage, rtx regs)
2207 for (i = 0; i < XVECLEN (regs, 0); i++)
2209 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2211 /* A NULL entry means the parameter goes both on the stack and in
2212 registers. This can also be a MEM for targets that pass values
2213 partially on the stack and partially in registers. */
2214 if (reg != 0 && REG_P (reg))
2215 use_reg (call_fusage, reg);
2219 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2220 assigment and the code of the expresion on the RHS is CODE. Return
2224 get_def_for_expr (tree name, enum tree_code code)
2228 if (TREE_CODE (name) != SSA_NAME)
2231 def_stmt = get_gimple_for_ssa_name (name);
2233 || gimple_assign_rhs_code (def_stmt) != code)
2240 /* Determine whether the LEN bytes generated by CONSTFUN can be
2241 stored to memory using several move instructions. CONSTFUNDATA is
2242 a pointer which will be passed as argument in every CONSTFUN call.
2243 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2244 a memset operation and false if it's a copy of a constant string.
2245 Return nonzero if a call to store_by_pieces should succeed. */
2248 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2249 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2250 void *constfundata, unsigned int align, bool memsetp)
2252 unsigned HOST_WIDE_INT l;
2253 unsigned int max_size;
2254 HOST_WIDE_INT offset = 0;
2255 enum machine_mode mode;
2256 enum insn_code icode;
2258 /* cst is set but not used if LEGITIMATE_CONSTANT doesn't use it. */
2259 rtx cst ATTRIBUTE_UNUSED;
2265 ? SET_BY_PIECES_P (len, align)
2266 : STORE_BY_PIECES_P (len, align)))
2269 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2271 /* We would first store what we can in the largest integer mode, then go to
2272 successively smaller modes. */
2275 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2279 max_size = STORE_MAX_PIECES + 1;
2280 while (max_size > 1)
2282 mode = widest_int_mode_for_size (max_size);
2284 if (mode == VOIDmode)
2287 icode = optab_handler (mov_optab, mode);
2288 if (icode != CODE_FOR_nothing
2289 && align >= GET_MODE_ALIGNMENT (mode))
2291 unsigned int size = GET_MODE_SIZE (mode);
2298 cst = (*constfun) (constfundata, offset, mode);
2299 if (!LEGITIMATE_CONSTANT_P (cst))
2309 max_size = GET_MODE_SIZE (mode);
2312 /* The code above should have handled everything. */
2319 /* Generate several move instructions to store LEN bytes generated by
2320 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2321 pointer which will be passed as argument in every CONSTFUN call.
2322 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2323 a memset operation and false if it's a copy of a constant string.
2324 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2325 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2329 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2330 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2331 void *constfundata, unsigned int align, bool memsetp, int endp)
2333 enum machine_mode to_addr_mode
2334 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
2335 struct store_by_pieces_d data;
2339 gcc_assert (endp != 2);
2344 ? SET_BY_PIECES_P (len, align)
2345 : STORE_BY_PIECES_P (len, align));
2346 data.constfun = constfun;
2347 data.constfundata = constfundata;
2350 store_by_pieces_1 (&data, align);
2355 gcc_assert (!data.reverse);
2360 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2361 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2363 data.to_addr = copy_to_mode_reg (to_addr_mode,
2364 plus_constant (data.to_addr,
2367 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2374 to1 = adjust_address (data.to, QImode, data.offset);
2382 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2383 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2386 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2388 struct store_by_pieces_d data;
2393 data.constfun = clear_by_pieces_1;
2394 data.constfundata = NULL;
2397 store_by_pieces_1 (&data, align);
2400 /* Callback routine for clear_by_pieces.
2401 Return const0_rtx unconditionally. */
2404 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2405 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2406 enum machine_mode mode ATTRIBUTE_UNUSED)
2411 /* Subroutine of clear_by_pieces and store_by_pieces.
2412 Generate several move instructions to store LEN bytes of block TO. (A MEM
2413 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2416 store_by_pieces_1 (struct store_by_pieces_d *data ATTRIBUTE_UNUSED,
2417 unsigned int align ATTRIBUTE_UNUSED)
2419 enum machine_mode to_addr_mode
2420 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (data->to));
2421 rtx to_addr = XEXP (data->to, 0);
2422 unsigned int max_size = STORE_MAX_PIECES + 1;
2423 enum insn_code icode;
2426 data->to_addr = to_addr;
2428 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2429 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2431 data->explicit_inc_to = 0;
2433 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2435 data->offset = data->len;
2437 /* If storing requires more than two move insns,
2438 copy addresses to registers (to make displacements shorter)
2439 and use post-increment if available. */
2440 if (!data->autinc_to
2441 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2443 /* Determine the main mode we'll be using.
2444 MODE might not be used depending on the definitions of the
2445 USE_* macros below. */
2446 enum machine_mode mode ATTRIBUTE_UNUSED
2447 = widest_int_mode_for_size (max_size);
2449 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2451 data->to_addr = copy_to_mode_reg (to_addr_mode,
2452 plus_constant (to_addr, data->len));
2453 data->autinc_to = 1;
2454 data->explicit_inc_to = -1;
2457 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2458 && ! data->autinc_to)
2460 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2461 data->autinc_to = 1;
2462 data->explicit_inc_to = 1;
2465 if ( !data->autinc_to && CONSTANT_P (to_addr))
2466 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2469 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2471 /* First store what we can in the largest integer mode, then go to
2472 successively smaller modes. */
2474 while (max_size > 1)
2476 enum machine_mode mode = widest_int_mode_for_size (max_size);
2478 if (mode == VOIDmode)
2481 icode = optab_handler (mov_optab, mode);
2482 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2483 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2485 max_size = GET_MODE_SIZE (mode);
2488 /* The code above should have handled everything. */
2489 gcc_assert (!data->len);
2492 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2493 with move instructions for mode MODE. GENFUN is the gen_... function
2494 to make a move insn for that mode. DATA has all the other info. */
2497 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2498 struct store_by_pieces_d *data)
2500 unsigned int size = GET_MODE_SIZE (mode);
2503 while (data->len >= size)
2506 data->offset -= size;
2508 if (data->autinc_to)
2509 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2512 to1 = adjust_address (data->to, mode, data->offset);
2514 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2515 emit_insn (gen_add2_insn (data->to_addr,
2516 GEN_INT (-(HOST_WIDE_INT) size)));
2518 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2519 emit_insn ((*genfun) (to1, cst));
2521 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2522 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2524 if (! data->reverse)
2525 data->offset += size;
2531 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2532 its length in bytes. */
2535 clear_storage_hints (rtx object, rtx size, enum block_op_methods method,
2536 unsigned int expected_align, HOST_WIDE_INT expected_size)
2538 enum machine_mode mode = GET_MODE (object);
2541 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2543 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2544 just move a zero. Otherwise, do this a piece at a time. */
2546 && CONST_INT_P (size)
2547 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2549 rtx zero = CONST0_RTX (mode);
2552 emit_move_insn (object, zero);
2556 if (COMPLEX_MODE_P (mode))
2558 zero = CONST0_RTX (GET_MODE_INNER (mode));
2561 write_complex_part (object, zero, 0);
2562 write_complex_part (object, zero, 1);
2568 if (size == const0_rtx)
2571 align = MEM_ALIGN (object);
2573 if (CONST_INT_P (size)
2574 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2575 clear_by_pieces (object, INTVAL (size), align);
2576 else if (set_storage_via_setmem (object, size, const0_rtx, align,
2577 expected_align, expected_size))
2579 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object)))
2580 return set_storage_via_libcall (object, size, const0_rtx,
2581 method == BLOCK_OP_TAILCALL);
2589 clear_storage (rtx object, rtx size, enum block_op_methods method)
2591 return clear_storage_hints (object, size, method, 0, -1);
2595 /* A subroutine of clear_storage. Expand a call to memset.
2596 Return the return value of memset, 0 otherwise. */
2599 set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
2601 tree call_expr, fn, object_tree, size_tree, val_tree;
2602 enum machine_mode size_mode;
2605 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2606 place those into new pseudos into a VAR_DECL and use them later. */
2608 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2610 size_mode = TYPE_MODE (sizetype);
2611 size = convert_to_mode (size_mode, size, 1);
2612 size = copy_to_mode_reg (size_mode, size);
2614 /* It is incorrect to use the libcall calling conventions to call
2615 memset in this context. This could be a user call to memset and
2616 the user may wish to examine the return value from memset. For
2617 targets where libcalls and normal calls have different conventions
2618 for returning pointers, we could end up generating incorrect code. */
2620 object_tree = make_tree (ptr_type_node, object);
2621 if (!CONST_INT_P (val))
2622 val = convert_to_mode (TYPE_MODE (integer_type_node), val, 1);
2623 size_tree = make_tree (sizetype, size);
2624 val_tree = make_tree (integer_type_node, val);
2626 fn = clear_storage_libcall_fn (true);
2627 call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
2628 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2630 retval = expand_normal (call_expr);
2635 /* A subroutine of set_storage_via_libcall. Create the tree node
2636 for the function we use for block clears. The first time FOR_CALL
2637 is true, we call assemble_external. */
2639 tree block_clear_fn;
2642 init_block_clear_fn (const char *asmspec)
2644 if (!block_clear_fn)
2648 fn = get_identifier ("memset");
2649 args = build_function_type_list (ptr_type_node, ptr_type_node,
2650 integer_type_node, sizetype,
2653 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
2654 DECL_EXTERNAL (fn) = 1;
2655 TREE_PUBLIC (fn) = 1;
2656 DECL_ARTIFICIAL (fn) = 1;
2657 TREE_NOTHROW (fn) = 1;
2658 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
2659 DECL_VISIBILITY_SPECIFIED (fn) = 1;
2661 block_clear_fn = fn;
2665 set_user_assembler_name (block_clear_fn, asmspec);
2669 clear_storage_libcall_fn (int for_call)
2671 static bool emitted_extern;
2673 if (!block_clear_fn)
2674 init_block_clear_fn (NULL);
2676 if (for_call && !emitted_extern)
2678 emitted_extern = true;
2679 make_decl_rtl (block_clear_fn);
2680 assemble_external (block_clear_fn);
2683 return block_clear_fn;
2686 /* Expand a setmem pattern; return true if successful. */
2689 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align,
2690 unsigned int expected_align, HOST_WIDE_INT expected_size)
2692 /* Try the most limited insn first, because there's no point
2693 including more than one in the machine description unless
2694 the more limited one has some advantage. */
2696 enum machine_mode mode;
2698 if (expected_align < align)
2699 expected_align = align;
2701 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2702 mode = GET_MODE_WIDER_MODE (mode))
2704 enum insn_code code = direct_optab_handler (setmem_optab, mode);
2706 if (code != CODE_FOR_nothing
2707 /* We don't need MODE to be narrower than
2708 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2709 the mode mask, as it is returned by the macro, it will
2710 definitely be less than the actual mode mask. */
2711 && ((CONST_INT_P (size)
2712 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2713 <= (GET_MODE_MASK (mode) >> 1)))
2714 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD))
2716 struct expand_operand ops[6];
2719 nops = insn_data[(int) code].n_generator_args;
2720 gcc_assert (nops == 4 || nops == 6);
2722 create_fixed_operand (&ops[0], object);
2723 /* The check above guarantees that this size conversion is valid. */
2724 create_convert_operand_to (&ops[1], size, mode, true);
2725 create_convert_operand_from (&ops[2], val, byte_mode, true);
2726 create_integer_operand (&ops[3], align / BITS_PER_UNIT);
2729 create_integer_operand (&ops[4], expected_align / BITS_PER_UNIT);
2730 create_integer_operand (&ops[5], expected_size);
2732 if (maybe_expand_insn (code, nops, ops))
2741 /* Write to one of the components of the complex value CPLX. Write VAL to
2742 the real part if IMAG_P is false, and the imaginary part if its true. */
2745 write_complex_part (rtx cplx, rtx val, bool imag_p)
2747 enum machine_mode cmode;
2748 enum machine_mode imode;
2751 if (GET_CODE (cplx) == CONCAT)
2753 emit_move_insn (XEXP (cplx, imag_p), val);
2757 cmode = GET_MODE (cplx);
2758 imode = GET_MODE_INNER (cmode);
2759 ibitsize = GET_MODE_BITSIZE (imode);
2761 /* For MEMs simplify_gen_subreg may generate an invalid new address
2762 because, e.g., the original address is considered mode-dependent
2763 by the target, which restricts simplify_subreg from invoking
2764 adjust_address_nv. Instead of preparing fallback support for an
2765 invalid address, we call adjust_address_nv directly. */
2768 emit_move_insn (adjust_address_nv (cplx, imode,
2769 imag_p ? GET_MODE_SIZE (imode) : 0),
2774 /* If the sub-object is at least word sized, then we know that subregging
2775 will work. This special case is important, since store_bit_field
2776 wants to operate on integer modes, and there's rarely an OImode to
2777 correspond to TCmode. */
2778 if (ibitsize >= BITS_PER_WORD
2779 /* For hard regs we have exact predicates. Assume we can split
2780 the original object if it spans an even number of hard regs.
2781 This special case is important for SCmode on 64-bit platforms
2782 where the natural size of floating-point regs is 32-bit. */
2784 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2785 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2787 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2788 imag_p ? GET_MODE_SIZE (imode) : 0);
2791 emit_move_insn (part, val);
2795 /* simplify_gen_subreg may fail for sub-word MEMs. */
2796 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2799 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2802 /* Extract one of the components of the complex value CPLX. Extract the
2803 real part if IMAG_P is false, and the imaginary part if it's true. */
2806 read_complex_part (rtx cplx, bool imag_p)
2808 enum machine_mode cmode, imode;
2811 if (GET_CODE (cplx) == CONCAT)
2812 return XEXP (cplx, imag_p);
2814 cmode = GET_MODE (cplx);
2815 imode = GET_MODE_INNER (cmode);
2816 ibitsize = GET_MODE_BITSIZE (imode);
2818 /* Special case reads from complex constants that got spilled to memory. */
2819 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2821 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2822 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2824 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2825 if (CONSTANT_CLASS_P (part))
2826 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2830 /* For MEMs simplify_gen_subreg may generate an invalid new address
2831 because, e.g., the original address is considered mode-dependent
2832 by the target, which restricts simplify_subreg from invoking
2833 adjust_address_nv. Instead of preparing fallback support for an
2834 invalid address, we call adjust_address_nv directly. */
2836 return adjust_address_nv (cplx, imode,
2837 imag_p ? GET_MODE_SIZE (imode) : 0);
2839 /* If the sub-object is at least word sized, then we know that subregging
2840 will work. This special case is important, since extract_bit_field
2841 wants to operate on integer modes, and there's rarely an OImode to
2842 correspond to TCmode. */
2843 if (ibitsize >= BITS_PER_WORD
2844 /* For hard regs we have exact predicates. Assume we can split
2845 the original object if it spans an even number of hard regs.
2846 This special case is important for SCmode on 64-bit platforms
2847 where the natural size of floating-point regs is 32-bit. */
2849 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2850 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2852 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2853 imag_p ? GET_MODE_SIZE (imode) : 0);
2857 /* simplify_gen_subreg may fail for sub-word MEMs. */
2858 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2861 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2862 true, false, NULL_RTX, imode, imode);
2865 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2866 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2867 represented in NEW_MODE. If FORCE is true, this will never happen, as
2868 we'll force-create a SUBREG if needed. */
2871 emit_move_change_mode (enum machine_mode new_mode,
2872 enum machine_mode old_mode, rtx x, bool force)
2876 if (push_operand (x, GET_MODE (x)))
2878 ret = gen_rtx_MEM (new_mode, XEXP (x, 0));
2879 MEM_COPY_ATTRIBUTES (ret, x);
2883 /* We don't have to worry about changing the address since the
2884 size in bytes is supposed to be the same. */
2885 if (reload_in_progress)
2887 /* Copy the MEM to change the mode and move any
2888 substitutions from the old MEM to the new one. */
2889 ret = adjust_address_nv (x, new_mode, 0);
2890 copy_replacements (x, ret);
2893 ret = adjust_address (x, new_mode, 0);
2897 /* Note that we do want simplify_subreg's behavior of validating
2898 that the new mode is ok for a hard register. If we were to use
2899 simplify_gen_subreg, we would create the subreg, but would
2900 probably run into the target not being able to implement it. */
2901 /* Except, of course, when FORCE is true, when this is exactly what
2902 we want. Which is needed for CCmodes on some targets. */
2904 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
2906 ret = simplify_subreg (new_mode, x, old_mode, 0);
2912 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
2913 an integer mode of the same size as MODE. Returns the instruction
2914 emitted, or NULL if such a move could not be generated. */
2917 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y, bool force)
2919 enum machine_mode imode;
2920 enum insn_code code;
2922 /* There must exist a mode of the exact size we require. */
2923 imode = int_mode_for_mode (mode);
2924 if (imode == BLKmode)
2927 /* The target must support moves in this mode. */
2928 code = optab_handler (mov_optab, imode);
2929 if (code == CODE_FOR_nothing)
2932 x = emit_move_change_mode (imode, mode, x, force);
2935 y = emit_move_change_mode (imode, mode, y, force);
2938 return emit_insn (GEN_FCN (code) (x, y));
2941 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
2942 Return an equivalent MEM that does not use an auto-increment. */
2945 emit_move_resolve_push (enum machine_mode mode, rtx x)
2947 enum rtx_code code = GET_CODE (XEXP (x, 0));
2948 HOST_WIDE_INT adjust;
2951 adjust = GET_MODE_SIZE (mode);
2952 #ifdef PUSH_ROUNDING
2953 adjust = PUSH_ROUNDING (adjust);
2955 if (code == PRE_DEC || code == POST_DEC)
2957 else if (code == PRE_MODIFY || code == POST_MODIFY)
2959 rtx expr = XEXP (XEXP (x, 0), 1);
2962 gcc_assert (GET_CODE (expr) == PLUS || GET_CODE (expr) == MINUS);
2963 gcc_assert (CONST_INT_P (XEXP (expr, 1)));
2964 val = INTVAL (XEXP (expr, 1));
2965 if (GET_CODE (expr) == MINUS)
2967 gcc_assert (adjust == val || adjust == -val);
2971 /* Do not use anti_adjust_stack, since we don't want to update
2972 stack_pointer_delta. */
2973 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
2974 GEN_INT (adjust), stack_pointer_rtx,
2975 0, OPTAB_LIB_WIDEN);
2976 if (temp != stack_pointer_rtx)
2977 emit_move_insn (stack_pointer_rtx, temp);
2984 temp = stack_pointer_rtx;
2989 temp = plus_constant (stack_pointer_rtx, -adjust);
2995 return replace_equiv_address (x, temp);
2998 /* A subroutine of emit_move_complex. Generate a move from Y into X.
2999 X is known to satisfy push_operand, and MODE is known to be complex.
3000 Returns the last instruction emitted. */
3003 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
3005 enum machine_mode submode = GET_MODE_INNER (mode);
3008 #ifdef PUSH_ROUNDING
3009 unsigned int submodesize = GET_MODE_SIZE (submode);
3011 /* In case we output to the stack, but the size is smaller than the
3012 machine can push exactly, we need to use move instructions. */
3013 if (PUSH_ROUNDING (submodesize) != submodesize)
3015 x = emit_move_resolve_push (mode, x);
3016 return emit_move_insn (x, y);
3020 /* Note that the real part always precedes the imag part in memory
3021 regardless of machine's endianness. */
3022 switch (GET_CODE (XEXP (x, 0)))
3036 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3037 read_complex_part (y, imag_first));
3038 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3039 read_complex_part (y, !imag_first));
3042 /* A subroutine of emit_move_complex. Perform the move from Y to X
3043 via two moves of the parts. Returns the last instruction emitted. */
3046 emit_move_complex_parts (rtx x, rtx y)
3048 /* Show the output dies here. This is necessary for SUBREGs
3049 of pseudos since we cannot track their lifetimes correctly;
3050 hard regs shouldn't appear here except as return values. */
3051 if (!reload_completed && !reload_in_progress
3052 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
3055 write_complex_part (x, read_complex_part (y, false), false);
3056 write_complex_part (x, read_complex_part (y, true), true);
3058 return get_last_insn ();
3061 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3062 MODE is known to be complex. Returns the last instruction emitted. */
3065 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
3069 /* Need to take special care for pushes, to maintain proper ordering
3070 of the data, and possibly extra padding. */
3071 if (push_operand (x, mode))
3072 return emit_move_complex_push (mode, x, y);
3074 /* See if we can coerce the target into moving both values at once. */
3076 /* Move floating point as parts. */
3077 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
3078 && optab_handler (mov_optab, GET_MODE_INNER (mode)) != CODE_FOR_nothing)
3080 /* Not possible if the values are inherently not adjacent. */
3081 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
3083 /* Is possible if both are registers (or subregs of registers). */
3084 else if (register_operand (x, mode) && register_operand (y, mode))
3086 /* If one of the operands is a memory, and alignment constraints
3087 are friendly enough, we may be able to do combined memory operations.
3088 We do not attempt this if Y is a constant because that combination is
3089 usually better with the by-parts thing below. */
3090 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
3091 && (!STRICT_ALIGNMENT
3092 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
3101 /* For memory to memory moves, optimal behavior can be had with the
3102 existing block move logic. */
3103 if (MEM_P (x) && MEM_P (y))
3105 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
3106 BLOCK_OP_NO_LIBCALL);
3107 return get_last_insn ();
3110 ret = emit_move_via_integer (mode, x, y, true);
3115 return emit_move_complex_parts (x, y);
3118 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3119 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3122 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
3126 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3129 enum insn_code code = optab_handler (mov_optab, CCmode);
3130 if (code != CODE_FOR_nothing)
3132 x = emit_move_change_mode (CCmode, mode, x, true);
3133 y = emit_move_change_mode (CCmode, mode, y, true);
3134 return emit_insn (GEN_FCN (code) (x, y));
3138 /* Otherwise, find the MODE_INT mode of the same width. */
3139 ret = emit_move_via_integer (mode, x, y, false);
3140 gcc_assert (ret != NULL);
3144 /* Return true if word I of OP lies entirely in the
3145 undefined bits of a paradoxical subreg. */
3148 undefined_operand_subword_p (const_rtx op, int i)
3150 enum machine_mode innermode, innermostmode;
3152 if (GET_CODE (op) != SUBREG)
3154 innermode = GET_MODE (op);
3155 innermostmode = GET_MODE (SUBREG_REG (op));
3156 offset = i * UNITS_PER_WORD + SUBREG_BYTE (op);
3157 /* The SUBREG_BYTE represents offset, as if the value were stored in
3158 memory, except for a paradoxical subreg where we define
3159 SUBREG_BYTE to be 0; undo this exception as in
3161 if (SUBREG_BYTE (op) == 0
3162 && GET_MODE_SIZE (innermostmode) < GET_MODE_SIZE (innermode))
3164 int difference = (GET_MODE_SIZE (innermostmode) - GET_MODE_SIZE (innermode));
3165 if (WORDS_BIG_ENDIAN)
3166 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
3167 if (BYTES_BIG_ENDIAN)
3168 offset += difference % UNITS_PER_WORD;
3170 if (offset >= GET_MODE_SIZE (innermostmode)
3171 || offset <= -GET_MODE_SIZE (word_mode))
3176 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3177 MODE is any multi-word or full-word mode that lacks a move_insn
3178 pattern. Note that you will get better code if you define such
3179 patterns, even if they must turn into multiple assembler instructions. */
3182 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3189 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3191 /* If X is a push on the stack, do the push now and replace
3192 X with a reference to the stack pointer. */
3193 if (push_operand (x, mode))
3194 x = emit_move_resolve_push (mode, x);
3196 /* If we are in reload, see if either operand is a MEM whose address
3197 is scheduled for replacement. */
3198 if (reload_in_progress && MEM_P (x)
3199 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3200 x = replace_equiv_address_nv (x, inner);
3201 if (reload_in_progress && MEM_P (y)
3202 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3203 y = replace_equiv_address_nv (y, inner);
3207 need_clobber = false;
3209 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3212 rtx xpart = operand_subword (x, i, 1, mode);
3215 /* Do not generate code for a move if it would come entirely
3216 from the undefined bits of a paradoxical subreg. */
3217 if (undefined_operand_subword_p (y, i))
3220 ypart = operand_subword (y, i, 1, mode);
3222 /* If we can't get a part of Y, put Y into memory if it is a
3223 constant. Otherwise, force it into a register. Then we must
3224 be able to get a part of Y. */
3225 if (ypart == 0 && CONSTANT_P (y))
3227 y = use_anchored_address (force_const_mem (mode, y));
3228 ypart = operand_subword (y, i, 1, mode);
3230 else if (ypart == 0)
3231 ypart = operand_subword_force (y, i, mode);
3233 gcc_assert (xpart && ypart);
3235 need_clobber |= (GET_CODE (xpart) == SUBREG);
3237 last_insn = emit_move_insn (xpart, ypart);
3243 /* Show the output dies here. This is necessary for SUBREGs
3244 of pseudos since we cannot track their lifetimes correctly;
3245 hard regs shouldn't appear here except as return values.
3246 We never want to emit such a clobber after reload. */
3248 && ! (reload_in_progress || reload_completed)
3249 && need_clobber != 0)
3257 /* Low level part of emit_move_insn.
3258 Called just like emit_move_insn, but assumes X and Y
3259 are basically valid. */
3262 emit_move_insn_1 (rtx x, rtx y)
3264 enum machine_mode mode = GET_MODE (x);
3265 enum insn_code code;
3267 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3269 code = optab_handler (mov_optab, mode);
3270 if (code != CODE_FOR_nothing)
3271 return emit_insn (GEN_FCN (code) (x, y));
3273 /* Expand complex moves by moving real part and imag part. */
3274 if (COMPLEX_MODE_P (mode))
3275 return emit_move_complex (mode, x, y);
3277 if (GET_MODE_CLASS (mode) == MODE_DECIMAL_FLOAT
3278 || ALL_FIXED_POINT_MODE_P (mode))
3280 rtx result = emit_move_via_integer (mode, x, y, true);
3282 /* If we can't find an integer mode, use multi words. */
3286 return emit_move_multi_word (mode, x, y);
3289 if (GET_MODE_CLASS (mode) == MODE_CC)
3290 return emit_move_ccmode (mode, x, y);
3292 /* Try using a move pattern for the corresponding integer mode. This is
3293 only safe when simplify_subreg can convert MODE constants into integer
3294 constants. At present, it can only do this reliably if the value
3295 fits within a HOST_WIDE_INT. */
3296 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3298 rtx ret = emit_move_via_integer (mode, x, y, false);
3303 return emit_move_multi_word (mode, x, y);
3306 /* Generate code to copy Y into X.
3307 Both Y and X must have the same mode, except that
3308 Y can be a constant with VOIDmode.
3309 This mode cannot be BLKmode; use emit_block_move for that.
3311 Return the last instruction emitted. */
3314 emit_move_insn (rtx x, rtx y)
3316 enum machine_mode mode = GET_MODE (x);
3317 rtx y_cst = NULL_RTX;
3320 gcc_assert (mode != BLKmode
3321 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3326 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3327 && (last_insn = compress_float_constant (x, y)))
3332 if (!LEGITIMATE_CONSTANT_P (y))
3334 y = force_const_mem (mode, y);
3336 /* If the target's cannot_force_const_mem prevented the spill,
3337 assume that the target's move expanders will also take care
3338 of the non-legitimate constant. */
3342 y = use_anchored_address (y);
3346 /* If X or Y are memory references, verify that their addresses are valid
3349 && (! memory_address_addr_space_p (GET_MODE (x), XEXP (x, 0),
3351 && ! push_operand (x, GET_MODE (x))))
3352 x = validize_mem (x);
3355 && ! memory_address_addr_space_p (GET_MODE (y), XEXP (y, 0),
3356 MEM_ADDR_SPACE (y)))
3357 y = validize_mem (y);
3359 gcc_assert (mode != BLKmode);
3361 last_insn = emit_move_insn_1 (x, y);
3363 if (y_cst && REG_P (x)
3364 && (set = single_set (last_insn)) != NULL_RTX
3365 && SET_DEST (set) == x
3366 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3367 set_unique_reg_note (last_insn, REG_EQUAL, copy_rtx (y_cst));
3372 /* If Y is representable exactly in a narrower mode, and the target can
3373 perform the extension directly from constant or memory, then emit the
3374 move as an extension. */
3377 compress_float_constant (rtx x, rtx y)
3379 enum machine_mode dstmode = GET_MODE (x);
3380 enum machine_mode orig_srcmode = GET_MODE (y);
3381 enum machine_mode srcmode;
3383 int oldcost, newcost;
3384 bool speed = optimize_insn_for_speed_p ();
3386 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3388 if (LEGITIMATE_CONSTANT_P (y))
3389 oldcost = rtx_cost (y, SET, speed);
3391 oldcost = rtx_cost (force_const_mem (dstmode, y), SET, speed);
3393 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3394 srcmode != orig_srcmode;
3395 srcmode = GET_MODE_WIDER_MODE (srcmode))
3398 rtx trunc_y, last_insn;
3400 /* Skip if the target can't extend this way. */
3401 ic = can_extend_p (dstmode, srcmode, 0);
3402 if (ic == CODE_FOR_nothing)
3405 /* Skip if the narrowed value isn't exact. */
3406 if (! exact_real_truncate (srcmode, &r))
3409 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3411 if (LEGITIMATE_CONSTANT_P (trunc_y))
3413 /* Skip if the target needs extra instructions to perform
3415 if (!insn_operand_matches (ic, 1, trunc_y))
3417 /* This is valid, but may not be cheaper than the original. */
3418 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3419 if (oldcost < newcost)
3422 else if (float_extend_from_mem[dstmode][srcmode])
3424 trunc_y = force_const_mem (srcmode, trunc_y);
3425 /* This is valid, but may not be cheaper than the original. */
3426 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3427 if (oldcost < newcost)
3429 trunc_y = validize_mem (trunc_y);
3434 /* For CSE's benefit, force the compressed constant pool entry
3435 into a new pseudo. This constant may be used in different modes,
3436 and if not, combine will put things back together for us. */
3437 trunc_y = force_reg (srcmode, trunc_y);
3438 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3439 last_insn = get_last_insn ();
3442 set_unique_reg_note (last_insn, REG_EQUAL, y);
3450 /* Pushing data onto the stack. */
3452 /* Push a block of length SIZE (perhaps variable)
3453 and return an rtx to address the beginning of the block.
3454 The value may be virtual_outgoing_args_rtx.
3456 EXTRA is the number of bytes of padding to push in addition to SIZE.
3457 BELOW nonzero means this padding comes at low addresses;
3458 otherwise, the padding comes at high addresses. */
3461 push_block (rtx size, int extra, int below)
3465 size = convert_modes (Pmode, ptr_mode, size, 1);
3466 if (CONSTANT_P (size))
3467 anti_adjust_stack (plus_constant (size, extra));
3468 else if (REG_P (size) && extra == 0)
3469 anti_adjust_stack (size);
3472 temp = copy_to_mode_reg (Pmode, size);
3474 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3475 temp, 0, OPTAB_LIB_WIDEN);
3476 anti_adjust_stack (temp);
3479 #ifndef STACK_GROWS_DOWNWARD
3485 temp = virtual_outgoing_args_rtx;
3486 if (extra != 0 && below)
3487 temp = plus_constant (temp, extra);
3491 if (CONST_INT_P (size))
3492 temp = plus_constant (virtual_outgoing_args_rtx,
3493 -INTVAL (size) - (below ? 0 : extra));
3494 else if (extra != 0 && !below)
3495 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3496 negate_rtx (Pmode, plus_constant (size, extra)));
3498 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3499 negate_rtx (Pmode, size));
3502 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3505 #ifdef PUSH_ROUNDING
3507 /* Emit single push insn. */
3510 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3513 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3515 enum insn_code icode;
3517 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3518 /* If there is push pattern, use it. Otherwise try old way of throwing
3519 MEM representing push operation to move expander. */
3520 icode = optab_handler (push_optab, mode);
3521 if (icode != CODE_FOR_nothing)
3523 struct expand_operand ops[1];
3525 create_input_operand (&ops[0], x, mode);
3526 if (maybe_expand_insn (icode, 1, ops))
3529 if (GET_MODE_SIZE (mode) == rounded_size)
3530 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3531 /* If we are to pad downward, adjust the stack pointer first and
3532 then store X into the stack location using an offset. This is
3533 because emit_move_insn does not know how to pad; it does not have
3535 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3537 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3538 HOST_WIDE_INT offset;
3540 emit_move_insn (stack_pointer_rtx,
3541 expand_binop (Pmode,
3542 #ifdef STACK_GROWS_DOWNWARD
3548 GEN_INT (rounded_size),
3549 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3551 offset = (HOST_WIDE_INT) padding_size;
3552 #ifdef STACK_GROWS_DOWNWARD
3553 if (STACK_PUSH_CODE == POST_DEC)
3554 /* We have already decremented the stack pointer, so get the
3556 offset += (HOST_WIDE_INT) rounded_size;
3558 if (STACK_PUSH_CODE == POST_INC)
3559 /* We have already incremented the stack pointer, so get the
3561 offset -= (HOST_WIDE_INT) rounded_size;
3563 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3567 #ifdef STACK_GROWS_DOWNWARD
3568 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3569 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3570 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3572 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3573 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3574 GEN_INT (rounded_size));
3576 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3579 dest = gen_rtx_MEM (mode, dest_addr);
3583 set_mem_attributes (dest, type, 1);
3585 if (flag_optimize_sibling_calls)
3586 /* Function incoming arguments may overlap with sibling call
3587 outgoing arguments and we cannot allow reordering of reads
3588 from function arguments with stores to outgoing arguments
3589 of sibling calls. */
3590 set_mem_alias_set (dest, 0);
3592 emit_move_insn (dest, x);
3596 /* Generate code to push X onto the stack, assuming it has mode MODE and
3598 MODE is redundant except when X is a CONST_INT (since they don't
3600 SIZE is an rtx for the size of data to be copied (in bytes),
3601 needed only if X is BLKmode.
3603 ALIGN (in bits) is maximum alignment we can assume.
3605 If PARTIAL and REG are both nonzero, then copy that many of the first
3606 bytes of X into registers starting with REG, and push the rest of X.
3607 The amount of space pushed is decreased by PARTIAL bytes.
3608 REG must be a hard register in this case.
3609 If REG is zero but PARTIAL is not, take any all others actions for an
3610 argument partially in registers, but do not actually load any
3613 EXTRA is the amount in bytes of extra space to leave next to this arg.
3614 This is ignored if an argument block has already been allocated.
3616 On a machine that lacks real push insns, ARGS_ADDR is the address of
3617 the bottom of the argument block for this call. We use indexing off there
3618 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3619 argument block has not been preallocated.
3621 ARGS_SO_FAR is the size of args previously pushed for this call.
3623 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3624 for arguments passed in registers. If nonzero, it will be the number
3625 of bytes required. */
3628 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3629 unsigned int align, int partial, rtx reg, int extra,
3630 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3634 enum direction stack_direction
3635 #ifdef STACK_GROWS_DOWNWARD
3641 /* Decide where to pad the argument: `downward' for below,
3642 `upward' for above, or `none' for don't pad it.
3643 Default is below for small data on big-endian machines; else above. */
3644 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3646 /* Invert direction if stack is post-decrement.
3648 if (STACK_PUSH_CODE == POST_DEC)
3649 if (where_pad != none)
3650 where_pad = (where_pad == downward ? upward : downward);
3655 || (STRICT_ALIGNMENT && align < GET_MODE_ALIGNMENT (mode)))
3657 /* Copy a block into the stack, entirely or partially. */
3664 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3665 used = partial - offset;
3667 if (mode != BLKmode)
3669 /* A value is to be stored in an insufficiently aligned
3670 stack slot; copy via a suitably aligned slot if
3672 size = GEN_INT (GET_MODE_SIZE (mode));
3673 if (!MEM_P (xinner))
3675 temp = assign_temp (type, 0, 1, 1);
3676 emit_move_insn (temp, xinner);
3683 /* USED is now the # of bytes we need not copy to the stack
3684 because registers will take care of them. */
3687 xinner = adjust_address (xinner, BLKmode, used);
3689 /* If the partial register-part of the arg counts in its stack size,
3690 skip the part of stack space corresponding to the registers.
3691 Otherwise, start copying to the beginning of the stack space,
3692 by setting SKIP to 0. */
3693 skip = (reg_parm_stack_space == 0) ? 0 : used;
3695 #ifdef PUSH_ROUNDING
3696 /* Do it with several push insns if that doesn't take lots of insns
3697 and if there is no difficulty with push insns that skip bytes
3698 on the stack for alignment purposes. */
3701 && CONST_INT_P (size)
3703 && MEM_ALIGN (xinner) >= align
3704 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3705 /* Here we avoid the case of a structure whose weak alignment
3706 forces many pushes of a small amount of data,
3707 and such small pushes do rounding that causes trouble. */
3708 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3709 || align >= BIGGEST_ALIGNMENT
3710 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3711 == (align / BITS_PER_UNIT)))
3712 && (HOST_WIDE_INT) PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3714 /* Push padding now if padding above and stack grows down,
3715 or if padding below and stack grows up.
3716 But if space already allocated, this has already been done. */
3717 if (extra && args_addr == 0
3718 && where_pad != none && where_pad != stack_direction)
3719 anti_adjust_stack (GEN_INT (extra));
3721 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3724 #endif /* PUSH_ROUNDING */
3728 /* Otherwise make space on the stack and copy the data
3729 to the address of that space. */
3731 /* Deduct words put into registers from the size we must copy. */
3734 if (CONST_INT_P (size))
3735 size = GEN_INT (INTVAL (size) - used);
3737 size = expand_binop (GET_MODE (size), sub_optab, size,
3738 GEN_INT (used), NULL_RTX, 0,
3742 /* Get the address of the stack space.
3743 In this case, we do not deal with EXTRA separately.
3744 A single stack adjust will do. */
3747 temp = push_block (size, extra, where_pad == downward);
3750 else if (CONST_INT_P (args_so_far))
3751 temp = memory_address (BLKmode,
3752 plus_constant (args_addr,
3753 skip + INTVAL (args_so_far)));
3755 temp = memory_address (BLKmode,
3756 plus_constant (gen_rtx_PLUS (Pmode,
3761 if (!ACCUMULATE_OUTGOING_ARGS)
3763 /* If the source is referenced relative to the stack pointer,
3764 copy it to another register to stabilize it. We do not need
3765 to do this if we know that we won't be changing sp. */
3767 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3768 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3769 temp = copy_to_reg (temp);
3772 target = gen_rtx_MEM (BLKmode, temp);
3774 /* We do *not* set_mem_attributes here, because incoming arguments
3775 may overlap with sibling call outgoing arguments and we cannot
3776 allow reordering of reads from function arguments with stores
3777 to outgoing arguments of sibling calls. We do, however, want
3778 to record the alignment of the stack slot. */
3779 /* ALIGN may well be better aligned than TYPE, e.g. due to
3780 PARM_BOUNDARY. Assume the caller isn't lying. */
3781 set_mem_align (target, align);
3783 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3786 else if (partial > 0)
3788 /* Scalar partly in registers. */
3790 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3793 /* # bytes of start of argument
3794 that we must make space for but need not store. */
3795 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3796 int args_offset = INTVAL (args_so_far);
3799 /* Push padding now if padding above and stack grows down,
3800 or if padding below and stack grows up.
3801 But if space already allocated, this has already been done. */
3802 if (extra && args_addr == 0
3803 && where_pad != none && where_pad != stack_direction)
3804 anti_adjust_stack (GEN_INT (extra));
3806 /* If we make space by pushing it, we might as well push
3807 the real data. Otherwise, we can leave OFFSET nonzero
3808 and leave the space uninitialized. */
3812 /* Now NOT_STACK gets the number of words that we don't need to
3813 allocate on the stack. Convert OFFSET to words too. */
3814 not_stack = (partial - offset) / UNITS_PER_WORD;
3815 offset /= UNITS_PER_WORD;
3817 /* If the partial register-part of the arg counts in its stack size,
3818 skip the part of stack space corresponding to the registers.
3819 Otherwise, start copying to the beginning of the stack space,
3820 by setting SKIP to 0. */
3821 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3823 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3824 x = validize_mem (force_const_mem (mode, x));
3826 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3827 SUBREGs of such registers are not allowed. */
3828 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3829 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3830 x = copy_to_reg (x);
3832 /* Loop over all the words allocated on the stack for this arg. */
3833 /* We can do it by words, because any scalar bigger than a word
3834 has a size a multiple of a word. */
3835 #ifndef PUSH_ARGS_REVERSED
3836 for (i = not_stack; i < size; i++)
3838 for (i = size - 1; i >= not_stack; i--)
3840 if (i >= not_stack + offset)
3841 emit_push_insn (operand_subword_force (x, i, mode),
3842 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3844 GEN_INT (args_offset + ((i - not_stack + skip)
3846 reg_parm_stack_space, alignment_pad);
3853 /* Push padding now if padding above and stack grows down,
3854 or if padding below and stack grows up.
3855 But if space already allocated, this has already been done. */
3856 if (extra && args_addr == 0
3857 && where_pad != none && where_pad != stack_direction)
3858 anti_adjust_stack (GEN_INT (extra));
3860 #ifdef PUSH_ROUNDING
3861 if (args_addr == 0 && PUSH_ARGS)
3862 emit_single_push_insn (mode, x, type);
3866 if (CONST_INT_P (args_so_far))
3868 = memory_address (mode,
3869 plus_constant (args_addr,
3870 INTVAL (args_so_far)));
3872 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3874 dest = gen_rtx_MEM (mode, addr);
3876 /* We do *not* set_mem_attributes here, because incoming arguments
3877 may overlap with sibling call outgoing arguments and we cannot
3878 allow reordering of reads from function arguments with stores
3879 to outgoing arguments of sibling calls. We do, however, want
3880 to record the alignment of the stack slot. */
3881 /* ALIGN may well be better aligned than TYPE, e.g. due to
3882 PARM_BOUNDARY. Assume the caller isn't lying. */
3883 set_mem_align (dest, align);
3885 emit_move_insn (dest, x);
3889 /* If part should go in registers, copy that part
3890 into the appropriate registers. Do this now, at the end,
3891 since mem-to-mem copies above may do function calls. */
3892 if (partial > 0 && reg != 0)
3894 /* Handle calls that pass values in multiple non-contiguous locations.
3895 The Irix 6 ABI has examples of this. */
3896 if (GET_CODE (reg) == PARALLEL)
3897 emit_group_load (reg, x, type, -1);
3900 gcc_assert (partial % UNITS_PER_WORD == 0);
3901 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
3905 if (extra && args_addr == 0 && where_pad == stack_direction)
3906 anti_adjust_stack (GEN_INT (extra));
3908 if (alignment_pad && args_addr == 0)
3909 anti_adjust_stack (alignment_pad);
3912 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3916 get_subtarget (rtx x)
3920 /* Only registers can be subtargets. */
3922 /* Don't use hard regs to avoid extending their life. */
3923 || REGNO (x) < FIRST_PSEUDO_REGISTER
3927 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
3928 FIELD is a bitfield. Returns true if the optimization was successful,
3929 and there's nothing else to do. */
3932 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
3933 unsigned HOST_WIDE_INT bitpos,
3934 enum machine_mode mode1, rtx str_rtx,
3937 enum machine_mode str_mode = GET_MODE (str_rtx);
3938 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
3943 enum tree_code code;
3945 if (mode1 != VOIDmode
3946 || bitsize >= BITS_PER_WORD
3947 || str_bitsize > BITS_PER_WORD
3948 || TREE_SIDE_EFFECTS (to)
3949 || TREE_THIS_VOLATILE (to))
3953 if (TREE_CODE (src) != SSA_NAME)
3955 if (TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
3958 srcstmt = get_gimple_for_ssa_name (src);
3960 || TREE_CODE_CLASS (gimple_assign_rhs_code (srcstmt)) != tcc_binary)
3963 code = gimple_assign_rhs_code (srcstmt);
3965 op0 = gimple_assign_rhs1 (srcstmt);
3967 /* If OP0 is an SSA_NAME, then we want to walk the use-def chain
3968 to find its initialization. Hopefully the initialization will
3969 be from a bitfield load. */
3970 if (TREE_CODE (op0) == SSA_NAME)
3972 gimple op0stmt = get_gimple_for_ssa_name (op0);
3974 /* We want to eventually have OP0 be the same as TO, which
3975 should be a bitfield. */
3977 || !is_gimple_assign (op0stmt)
3978 || gimple_assign_rhs_code (op0stmt) != TREE_CODE (to))
3980 op0 = gimple_assign_rhs1 (op0stmt);
3983 op1 = gimple_assign_rhs2 (srcstmt);
3985 if (!operand_equal_p (to, op0, 0))
3988 if (MEM_P (str_rtx))
3990 unsigned HOST_WIDE_INT offset1;
3992 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
3993 str_mode = word_mode;
3994 str_mode = get_best_mode (bitsize, bitpos,
3995 MEM_ALIGN (str_rtx), str_mode, 0);
3996 if (str_mode == VOIDmode)
3998 str_bitsize = GET_MODE_BITSIZE (str_mode);
4001 bitpos %= str_bitsize;
4002 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
4003 str_rtx = adjust_address (str_rtx, str_mode, offset1);
4005 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
4008 /* If the bit field covers the whole REG/MEM, store_field
4009 will likely generate better code. */
4010 if (bitsize >= str_bitsize)
4013 /* We can't handle fields split across multiple entities. */
4014 if (bitpos + bitsize > str_bitsize)
4017 if (BYTES_BIG_ENDIAN)
4018 bitpos = str_bitsize - bitpos - bitsize;
4024 /* For now, just optimize the case of the topmost bitfield
4025 where we don't need to do any masking and also
4026 1 bit bitfields where xor can be used.
4027 We might win by one instruction for the other bitfields
4028 too if insv/extv instructions aren't used, so that
4029 can be added later. */
4030 if (bitpos + bitsize != str_bitsize
4031 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
4034 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4035 value = convert_modes (str_mode,
4036 TYPE_MODE (TREE_TYPE (op1)), value,
4037 TYPE_UNSIGNED (TREE_TYPE (op1)));
4039 /* We may be accessing data outside the field, which means
4040 we can alias adjacent data. */
4041 if (MEM_P (str_rtx))
4043 str_rtx = shallow_copy_rtx (str_rtx);
4044 set_mem_alias_set (str_rtx, 0);
4045 set_mem_expr (str_rtx, 0);
4048 binop = code == PLUS_EXPR ? add_optab : sub_optab;
4049 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
4051 value = expand_and (str_mode, value, const1_rtx, NULL);
4054 value = expand_shift (LSHIFT_EXPR, str_mode, value,
4055 build_int_cst (NULL_TREE, bitpos),
4057 result = expand_binop (str_mode, binop, str_rtx,
4058 value, str_rtx, 1, OPTAB_WIDEN);
4059 if (result != str_rtx)
4060 emit_move_insn (str_rtx, result);
4065 if (TREE_CODE (op1) != INTEGER_CST)
4067 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), EXPAND_NORMAL);
4068 value = convert_modes (GET_MODE (str_rtx),
4069 TYPE_MODE (TREE_TYPE (op1)), value,
4070 TYPE_UNSIGNED (TREE_TYPE (op1)));
4072 /* We may be accessing data outside the field, which means
4073 we can alias adjacent data. */
4074 if (MEM_P (str_rtx))
4076 str_rtx = shallow_copy_rtx (str_rtx);
4077 set_mem_alias_set (str_rtx, 0);
4078 set_mem_expr (str_rtx, 0);
4081 binop = code == BIT_IOR_EXPR ? ior_optab : xor_optab;
4082 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
4084 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
4086 value = expand_and (GET_MODE (str_rtx), value, mask,
4089 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
4090 build_int_cst (NULL_TREE, bitpos),
4092 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
4093 value, str_rtx, 1, OPTAB_WIDEN);
4094 if (result != str_rtx)
4095 emit_move_insn (str_rtx, result);
4106 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4107 is true, try generating a nontemporal store. */
4110 expand_assignment (tree to, tree from, bool nontemporal)
4114 enum machine_mode mode;
4116 enum insn_code icode;
4118 /* Don't crash if the lhs of the assignment was erroneous. */
4119 if (TREE_CODE (to) == ERROR_MARK)
4121 expand_normal (from);
4125 /* Optimize away no-op moves without side-effects. */
4126 if (operand_equal_p (to, from, 0))
4129 mode = TYPE_MODE (TREE_TYPE (to));
4130 if ((TREE_CODE (to) == MEM_REF
4131 || TREE_CODE (to) == TARGET_MEM_REF)
4133 && ((align = MAX (TYPE_ALIGN (TREE_TYPE (to)),
4134 get_object_alignment (to, BIGGEST_ALIGNMENT)))
4135 < (signed) GET_MODE_ALIGNMENT (mode))
4136 && ((icode = optab_handler (movmisalign_optab, mode))
4137 != CODE_FOR_nothing))
4139 struct expand_operand ops[2];
4140 enum machine_mode address_mode;
4143 reg = expand_expr (from, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4144 reg = force_not_mem (reg);
4146 if (TREE_CODE (to) == MEM_REF)
4149 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (to, 1))));
4150 tree base = TREE_OPERAND (to, 0);
4151 address_mode = targetm.addr_space.address_mode (as);
4152 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4153 op0 = convert_memory_address_addr_space (address_mode, op0, as);
4154 if (!integer_zerop (TREE_OPERAND (to, 1)))
4157 = immed_double_int_const (mem_ref_offset (to), address_mode);
4158 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
4160 op0 = memory_address_addr_space (mode, op0, as);
4161 mem = gen_rtx_MEM (mode, op0);
4162 set_mem_attributes (mem, to, 0);
4163 set_mem_addr_space (mem, as);
4165 else if (TREE_CODE (to) == TARGET_MEM_REF)
4167 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (to));
4168 struct mem_address addr;
4170 get_address_description (to, &addr);
4171 op0 = addr_for_mem_ref (&addr, as, true);
4172 op0 = memory_address_addr_space (mode, op0, as);
4173 mem = gen_rtx_MEM (mode, op0);
4174 set_mem_attributes (mem, to, 0);
4175 set_mem_addr_space (mem, as);
4179 if (TREE_THIS_VOLATILE (to))
4180 MEM_VOLATILE_P (mem) = 1;
4182 create_fixed_operand (&ops[0], mem);
4183 create_input_operand (&ops[1], reg, mode);
4184 /* The movmisalign<mode> pattern cannot fail, else the assignment would
4185 silently be omitted. */
4186 expand_insn (icode, 2, ops);
4190 /* Assignment of a structure component needs special treatment
4191 if the structure component's rtx is not simply a MEM.
4192 Assignment of an array element at a constant index, and assignment of
4193 an array element in an unaligned packed structure field, has the same
4195 if (handled_component_p (to)
4196 /* ??? We only need to handle MEM_REF here if the access is not
4197 a full access of the base object. */
4198 || (TREE_CODE (to) == MEM_REF
4199 && TREE_CODE (TREE_OPERAND (to, 0)) == ADDR_EXPR)
4200 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4202 enum machine_mode mode1;
4203 HOST_WIDE_INT bitsize, bitpos;
4210 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4211 &unsignedp, &volatilep, true);
4213 /* If we are going to use store_bit_field and extract_bit_field,
4214 make sure to_rtx will be safe for multiple use. */
4216 to_rtx = expand_normal (tem);
4218 /* If the bitfield is volatile, we want to access it in the
4219 field's mode, not the computed mode.
4220 If a MEM has VOIDmode (external with incomplete type),
4221 use BLKmode for it instead. */
4224 if (volatilep && flag_strict_volatile_bitfields > 0)
4225 to_rtx = adjust_address (to_rtx, mode1, 0);
4226 else if (GET_MODE (to_rtx) == VOIDmode)
4227 to_rtx = adjust_address (to_rtx, BLKmode, 0);
4232 enum machine_mode address_mode;
4235 if (!MEM_P (to_rtx))
4237 /* We can get constant negative offsets into arrays with broken
4238 user code. Translate this to a trap instead of ICEing. */
4239 gcc_assert (TREE_CODE (offset) == INTEGER_CST);
4240 expand_builtin_trap ();
4241 to_rtx = gen_rtx_MEM (BLKmode, const0_rtx);
4244 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4246 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
4247 if (GET_MODE (offset_rtx) != address_mode)
4248 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
4250 /* A constant address in TO_RTX can have VOIDmode, we must not try
4251 to call force_reg for that case. Avoid that case. */
4253 && GET_MODE (to_rtx) == BLKmode
4254 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4256 && (bitpos % bitsize) == 0
4257 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4258 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4260 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4264 to_rtx = offset_address (to_rtx, offset_rtx,
4265 highest_pow2_factor_for_target (to,
4269 /* No action is needed if the target is not a memory and the field
4270 lies completely outside that target. This can occur if the source
4271 code contains an out-of-bounds access to a small array. */
4273 && GET_MODE (to_rtx) != BLKmode
4274 && (unsigned HOST_WIDE_INT) bitpos
4275 >= GET_MODE_BITSIZE (GET_MODE (to_rtx)))
4277 expand_normal (from);
4280 /* Handle expand_expr of a complex value returning a CONCAT. */
4281 else if (GET_CODE (to_rtx) == CONCAT)
4283 unsigned short mode_bitsize = GET_MODE_BITSIZE (GET_MODE (to_rtx));
4284 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from)))
4286 && bitsize == mode_bitsize)
4287 result = store_expr (from, to_rtx, false, nontemporal);
4288 else if (bitsize == mode_bitsize / 2
4289 && (bitpos == 0 || bitpos == mode_bitsize / 2))
4290 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false,
4292 else if (bitpos + bitsize <= mode_bitsize / 2)
4293 result = store_field (XEXP (to_rtx, 0), bitsize, bitpos,
4294 mode1, from, TREE_TYPE (tem),
4295 get_alias_set (to), nontemporal);
4296 else if (bitpos >= mode_bitsize / 2)
4297 result = store_field (XEXP (to_rtx, 1), bitsize,
4298 bitpos - mode_bitsize / 2, mode1, from,
4299 TREE_TYPE (tem), get_alias_set (to),
4301 else if (bitpos == 0 && bitsize == mode_bitsize)
4304 result = expand_normal (from);
4305 from_rtx = simplify_gen_subreg (GET_MODE (to_rtx), result,
4306 TYPE_MODE (TREE_TYPE (from)), 0);
4307 emit_move_insn (XEXP (to_rtx, 0),
4308 read_complex_part (from_rtx, false));
4309 emit_move_insn (XEXP (to_rtx, 1),
4310 read_complex_part (from_rtx, true));
4314 rtx temp = assign_stack_temp (GET_MODE (to_rtx),
4315 GET_MODE_SIZE (GET_MODE (to_rtx)),
4317 write_complex_part (temp, XEXP (to_rtx, 0), false);
4318 write_complex_part (temp, XEXP (to_rtx, 1), true);
4319 result = store_field (temp, bitsize, bitpos, mode1, from,
4320 TREE_TYPE (tem), get_alias_set (to),
4322 emit_move_insn (XEXP (to_rtx, 0), read_complex_part (temp, false));
4323 emit_move_insn (XEXP (to_rtx, 1), read_complex_part (temp, true));
4330 /* If the field is at offset zero, we could have been given the
4331 DECL_RTX of the parent struct. Don't munge it. */
4332 to_rtx = shallow_copy_rtx (to_rtx);
4334 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4336 /* Deal with volatile and readonly fields. The former is only
4337 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4339 MEM_VOLATILE_P (to_rtx) = 1;
4340 if (component_uses_parent_alias_set (to))
4341 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4344 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
4348 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
4349 TREE_TYPE (tem), get_alias_set (to),
4354 preserve_temp_slots (result);
4360 /* If the rhs is a function call and its value is not an aggregate,
4361 call the function before we start to compute the lhs.
4362 This is needed for correct code for cases such as
4363 val = setjmp (buf) on machines where reference to val
4364 requires loading up part of an address in a separate insn.
4366 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4367 since it might be a promoted variable where the zero- or sign- extension
4368 needs to be done. Handling this in the normal way is safe because no
4369 computation is done before the call. The same is true for SSA names. */
4370 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
4371 && COMPLETE_TYPE_P (TREE_TYPE (from))
4372 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4373 && ! (((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
4374 && REG_P (DECL_RTL (to)))
4375 || TREE_CODE (to) == SSA_NAME))
4380 value = expand_normal (from);
4382 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4384 /* Handle calls that return values in multiple non-contiguous locations.
4385 The Irix 6 ABI has examples of this. */
4386 if (GET_CODE (to_rtx) == PARALLEL)
4387 emit_group_load (to_rtx, value, TREE_TYPE (from),
4388 int_size_in_bytes (TREE_TYPE (from)));
4389 else if (GET_MODE (to_rtx) == BLKmode)
4390 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4393 if (POINTER_TYPE_P (TREE_TYPE (to)))
4394 value = convert_memory_address_addr_space
4395 (GET_MODE (to_rtx), value,
4396 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to))));
4398 emit_move_insn (to_rtx, value);
4400 preserve_temp_slots (to_rtx);
4406 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4407 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4410 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4412 /* Don't move directly into a return register. */
4413 if (TREE_CODE (to) == RESULT_DECL
4414 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4419 temp = expand_expr (from, NULL_RTX, GET_MODE (to_rtx), EXPAND_NORMAL);
4421 if (GET_CODE (to_rtx) == PARALLEL)
4422 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4423 int_size_in_bytes (TREE_TYPE (from)));
4425 emit_move_insn (to_rtx, temp);
4427 preserve_temp_slots (to_rtx);
4433 /* In case we are returning the contents of an object which overlaps
4434 the place the value is being stored, use a safe function when copying
4435 a value through a pointer into a structure value return block. */
4436 if (TREE_CODE (to) == RESULT_DECL
4437 && TREE_CODE (from) == INDIRECT_REF
4438 && ADDR_SPACE_GENERIC_P
4439 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from, 0)))))
4440 && refs_may_alias_p (to, from)
4441 && cfun->returns_struct
4442 && !cfun->returns_pcc_struct)
4447 size = expr_size (from);
4448 from_rtx = expand_normal (from);
4450 emit_library_call (memmove_libfunc, LCT_NORMAL,
4451 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4452 XEXP (from_rtx, 0), Pmode,
4453 convert_to_mode (TYPE_MODE (sizetype),
4454 size, TYPE_UNSIGNED (sizetype)),
4455 TYPE_MODE (sizetype));
4457 preserve_temp_slots (to_rtx);
4463 /* Compute FROM and store the value in the rtx we got. */
4466 result = store_expr (from, to_rtx, 0, nontemporal);
4467 preserve_temp_slots (result);
4473 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4474 succeeded, false otherwise. */
4477 emit_storent_insn (rtx to, rtx from)
4479 struct expand_operand ops[2];
4480 enum machine_mode mode = GET_MODE (to);
4481 enum insn_code code = optab_handler (storent_optab, mode);
4483 if (code == CODE_FOR_nothing)
4486 create_fixed_operand (&ops[0], to);
4487 create_input_operand (&ops[1], from, mode);
4488 return maybe_expand_insn (code, 2, ops);
4491 /* Generate code for computing expression EXP,
4492 and storing the value into TARGET.
4494 If the mode is BLKmode then we may return TARGET itself.
4495 It turns out that in BLKmode it doesn't cause a problem.
4496 because C has no operators that could combine two different
4497 assignments into the same BLKmode object with different values
4498 with no sequence point. Will other languages need this to
4501 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4502 stack, and block moves may need to be treated specially.
4504 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4507 store_expr (tree exp, rtx target, int call_param_p, bool nontemporal)
4510 rtx alt_rtl = NULL_RTX;
4511 location_t loc = EXPR_LOCATION (exp);
4513 if (VOID_TYPE_P (TREE_TYPE (exp)))
4515 /* C++ can generate ?: expressions with a throw expression in one
4516 branch and an rvalue in the other. Here, we resolve attempts to
4517 store the throw expression's nonexistent result. */
4518 gcc_assert (!call_param_p);
4519 expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4522 if (TREE_CODE (exp) == COMPOUND_EXPR)
4524 /* Perform first part of compound expression, then assign from second
4526 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4527 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4528 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4531 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4533 /* For conditional expression, get safe form of the target. Then
4534 test the condition, doing the appropriate assignment on either
4535 side. This avoids the creation of unnecessary temporaries.
4536 For non-BLKmode, it is more efficient not to do this. */
4538 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4540 do_pending_stack_adjust ();
4542 jumpifnot (TREE_OPERAND (exp, 0), lab1, -1);
4543 store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4545 emit_jump_insn (gen_jump (lab2));
4548 store_expr (TREE_OPERAND (exp, 2), target, call_param_p,
4555 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4556 /* If this is a scalar in a register that is stored in a wider mode
4557 than the declared mode, compute the result into its declared mode
4558 and then convert to the wider mode. Our value is the computed
4561 rtx inner_target = 0;
4563 /* We can do the conversion inside EXP, which will often result
4564 in some optimizations. Do the conversion in two steps: first
4565 change the signedness, if needed, then the extend. But don't
4566 do this if the type of EXP is a subtype of something else
4567 since then the conversion might involve more than just
4568 converting modes. */
4569 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4570 && TREE_TYPE (TREE_TYPE (exp)) == 0
4571 && GET_MODE_PRECISION (GET_MODE (target))
4572 == TYPE_PRECISION (TREE_TYPE (exp)))
4574 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4575 != SUBREG_PROMOTED_UNSIGNED_P (target))
4577 /* Some types, e.g. Fortran's logical*4, won't have a signed
4578 version, so use the mode instead. */
4580 = (signed_or_unsigned_type_for
4581 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)));
4583 ntype = lang_hooks.types.type_for_mode
4584 (TYPE_MODE (TREE_TYPE (exp)),
4585 SUBREG_PROMOTED_UNSIGNED_P (target));
4587 exp = fold_convert_loc (loc, ntype, exp);
4590 exp = fold_convert_loc (loc, lang_hooks.types.type_for_mode
4591 (GET_MODE (SUBREG_REG (target)),
4592 SUBREG_PROMOTED_UNSIGNED_P (target)),
4595 inner_target = SUBREG_REG (target);
4598 temp = expand_expr (exp, inner_target, VOIDmode,
4599 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4601 /* If TEMP is a VOIDmode constant, use convert_modes to make
4602 sure that we properly convert it. */
4603 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4605 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4606 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4607 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4608 GET_MODE (target), temp,
4609 SUBREG_PROMOTED_UNSIGNED_P (target));
4612 convert_move (SUBREG_REG (target), temp,
4613 SUBREG_PROMOTED_UNSIGNED_P (target));
4617 else if ((TREE_CODE (exp) == STRING_CST
4618 || (TREE_CODE (exp) == MEM_REF
4619 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
4620 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4622 && integer_zerop (TREE_OPERAND (exp, 1))))
4623 && !nontemporal && !call_param_p
4626 /* Optimize initialization of an array with a STRING_CST. */
4627 HOST_WIDE_INT exp_len, str_copy_len;
4629 tree str = TREE_CODE (exp) == STRING_CST
4630 ? exp : TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
4632 exp_len = int_expr_size (exp);
4636 if (TREE_STRING_LENGTH (str) <= 0)
4639 str_copy_len = strlen (TREE_STRING_POINTER (str));
4640 if (str_copy_len < TREE_STRING_LENGTH (str) - 1)
4643 str_copy_len = TREE_STRING_LENGTH (str);
4644 if ((STORE_MAX_PIECES & (STORE_MAX_PIECES - 1)) == 0
4645 && TREE_STRING_POINTER (str)[TREE_STRING_LENGTH (str) - 1] == '\0')
4647 str_copy_len += STORE_MAX_PIECES - 1;
4648 str_copy_len &= ~(STORE_MAX_PIECES - 1);
4650 str_copy_len = MIN (str_copy_len, exp_len);
4651 if (!can_store_by_pieces (str_copy_len, builtin_strncpy_read_str,
4652 CONST_CAST (char *, TREE_STRING_POINTER (str)),
4653 MEM_ALIGN (target), false))
4658 dest_mem = store_by_pieces (dest_mem,
4659 str_copy_len, builtin_strncpy_read_str,
4661 TREE_STRING_POINTER (str)),
4662 MEM_ALIGN (target), false,
4663 exp_len > str_copy_len ? 1 : 0);
4664 if (exp_len > str_copy_len)
4665 clear_storage (adjust_address (dest_mem, BLKmode, 0),
4666 GEN_INT (exp_len - str_copy_len),
4675 /* If we want to use a nontemporal store, force the value to
4677 tmp_target = nontemporal ? NULL_RTX : target;
4678 temp = expand_expr_real (exp, tmp_target, GET_MODE (target),
4680 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4684 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4685 the same as that of TARGET, adjust the constant. This is needed, for
4686 example, in case it is a CONST_DOUBLE and we want only a word-sized
4688 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4689 && TREE_CODE (exp) != ERROR_MARK
4690 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4691 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4692 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4694 /* If value was not generated in the target, store it there.
4695 Convert the value to TARGET's type first if necessary and emit the
4696 pending incrementations that have been queued when expanding EXP.
4697 Note that we cannot emit the whole queue blindly because this will
4698 effectively disable the POST_INC optimization later.
4700 If TEMP and TARGET compare equal according to rtx_equal_p, but
4701 one or both of them are volatile memory refs, we have to distinguish
4703 - expand_expr has used TARGET. In this case, we must not generate
4704 another copy. This can be detected by TARGET being equal according
4706 - expand_expr has not used TARGET - that means that the source just
4707 happens to have the same RTX form. Since temp will have been created
4708 by expand_expr, it will compare unequal according to == .
4709 We must generate a copy in this case, to reach the correct number
4710 of volatile memory references. */
4712 if ((! rtx_equal_p (temp, target)
4713 || (temp != target && (side_effects_p (temp)
4714 || side_effects_p (target))))
4715 && TREE_CODE (exp) != ERROR_MARK
4716 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4717 but TARGET is not valid memory reference, TEMP will differ
4718 from TARGET although it is really the same location. */
4720 && rtx_equal_p (alt_rtl, target)
4721 && !side_effects_p (alt_rtl)
4722 && !side_effects_p (target))
4723 /* If there's nothing to copy, don't bother. Don't call
4724 expr_size unless necessary, because some front-ends (C++)
4725 expr_size-hook must not be given objects that are not
4726 supposed to be bit-copied or bit-initialized. */
4727 && expr_size (exp) != const0_rtx)
4729 if (GET_MODE (temp) != GET_MODE (target)
4730 && GET_MODE (temp) != VOIDmode)
4732 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4733 if (GET_MODE (target) == BLKmode
4734 && GET_MODE (temp) == BLKmode)
4735 emit_block_move (target, temp, expr_size (exp),
4737 ? BLOCK_OP_CALL_PARM
4738 : BLOCK_OP_NORMAL));
4739 else if (GET_MODE (target) == BLKmode)
4740 store_bit_field (target, INTVAL (expr_size (exp)) * BITS_PER_UNIT,
4741 0, GET_MODE (temp), temp);
4743 convert_move (target, temp, unsignedp);
4746 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4748 /* Handle copying a string constant into an array. The string
4749 constant may be shorter than the array. So copy just the string's
4750 actual length, and clear the rest. First get the size of the data
4751 type of the string, which is actually the size of the target. */
4752 rtx size = expr_size (exp);
4754 if (CONST_INT_P (size)
4755 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4756 emit_block_move (target, temp, size,
4758 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4761 enum machine_mode pointer_mode
4762 = targetm.addr_space.pointer_mode (MEM_ADDR_SPACE (target));
4763 enum machine_mode address_mode
4764 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (target));
4766 /* Compute the size of the data to copy from the string. */
4768 = size_binop_loc (loc, MIN_EXPR,
4769 make_tree (sizetype, size),
4770 size_int (TREE_STRING_LENGTH (exp)));
4772 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4774 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4777 /* Copy that much. */
4778 copy_size_rtx = convert_to_mode (pointer_mode, copy_size_rtx,
4779 TYPE_UNSIGNED (sizetype));
4780 emit_block_move (target, temp, copy_size_rtx,
4782 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4784 /* Figure out how much is left in TARGET that we have to clear.
4785 Do all calculations in pointer_mode. */
4786 if (CONST_INT_P (copy_size_rtx))
4788 size = plus_constant (size, -INTVAL (copy_size_rtx));
4789 target = adjust_address (target, BLKmode,
4790 INTVAL (copy_size_rtx));
4794 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4795 copy_size_rtx, NULL_RTX, 0,
4798 if (GET_MODE (copy_size_rtx) != address_mode)
4799 copy_size_rtx = convert_to_mode (address_mode,
4801 TYPE_UNSIGNED (sizetype));
4803 target = offset_address (target, copy_size_rtx,
4804 highest_pow2_factor (copy_size));
4805 label = gen_label_rtx ();
4806 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4807 GET_MODE (size), 0, label);
4810 if (size != const0_rtx)
4811 clear_storage (target, size, BLOCK_OP_NORMAL);
4817 /* Handle calls that return values in multiple non-contiguous locations.
4818 The Irix 6 ABI has examples of this. */
4819 else if (GET_CODE (target) == PARALLEL)
4820 emit_group_load (target, temp, TREE_TYPE (exp),
4821 int_size_in_bytes (TREE_TYPE (exp)));
4822 else if (GET_MODE (temp) == BLKmode)
4823 emit_block_move (target, temp, expr_size (exp),
4825 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4826 else if (nontemporal
4827 && emit_storent_insn (target, temp))
4828 /* If we managed to emit a nontemporal store, there is nothing else to
4833 temp = force_operand (temp, target);
4835 emit_move_insn (target, temp);
4842 /* Helper for categorize_ctor_elements. Identical interface. */
4845 categorize_ctor_elements_1 (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4846 HOST_WIDE_INT *p_elt_count,
4849 unsigned HOST_WIDE_INT idx;
4850 HOST_WIDE_INT nz_elts, elt_count;
4851 tree value, purpose;
4853 /* Whether CTOR is a valid constant initializer, in accordance with what
4854 initializer_constant_valid_p does. If inferred from the constructor
4855 elements, true until proven otherwise. */
4856 bool const_from_elts_p = constructor_static_from_elts_p (ctor);
4857 bool const_p = const_from_elts_p ? true : TREE_STATIC (ctor);
4862 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), idx, purpose, value)
4864 HOST_WIDE_INT mult = 1;
4866 if (TREE_CODE (purpose) == RANGE_EXPR)
4868 tree lo_index = TREE_OPERAND (purpose, 0);
4869 tree hi_index = TREE_OPERAND (purpose, 1);
4871 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
4872 mult = (tree_low_cst (hi_index, 1)
4873 - tree_low_cst (lo_index, 1) + 1);
4876 switch (TREE_CODE (value))
4880 HOST_WIDE_INT nz = 0, ic = 0;
4883 = categorize_ctor_elements_1 (value, &nz, &ic, p_must_clear);
4885 nz_elts += mult * nz;
4886 elt_count += mult * ic;
4888 if (const_from_elts_p && const_p)
4889 const_p = const_elt_p;
4896 if (!initializer_zerop (value))
4902 nz_elts += mult * TREE_STRING_LENGTH (value);
4903 elt_count += mult * TREE_STRING_LENGTH (value);
4907 if (!initializer_zerop (TREE_REALPART (value)))
4909 if (!initializer_zerop (TREE_IMAGPART (value)))
4917 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
4919 if (!initializer_zerop (TREE_VALUE (v)))
4928 HOST_WIDE_INT tc = count_type_elements (TREE_TYPE (value), true);
4931 nz_elts += mult * tc;
4932 elt_count += mult * tc;
4934 if (const_from_elts_p && const_p)
4935 const_p = initializer_constant_valid_p (value, TREE_TYPE (value))
4943 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4944 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
4947 bool clear_this = true;
4949 if (!VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (ctor)))
4951 /* We don't expect more than one element of the union to be
4952 initialized. Not sure what we should do otherwise... */
4953 gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ctor))
4956 init_sub_type = TREE_TYPE (VEC_index (constructor_elt,
4957 CONSTRUCTOR_ELTS (ctor),
4960 /* ??? We could look at each element of the union, and find the
4961 largest element. Which would avoid comparing the size of the
4962 initialized element against any tail padding in the union.
4963 Doesn't seem worth the effort... */
4964 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
4965 TYPE_SIZE (init_sub_type)) == 1)
4967 /* And now we have to find out if the element itself is fully
4968 constructed. E.g. for union { struct { int a, b; } s; } u
4969 = { .s = { .a = 1 } }. */
4970 if (elt_count == count_type_elements (init_sub_type, false))
4975 *p_must_clear = clear_this;
4978 *p_nz_elts += nz_elts;
4979 *p_elt_count += elt_count;
4984 /* Examine CTOR to discover:
4985 * how many scalar fields are set to nonzero values,
4986 and place it in *P_NZ_ELTS;
4987 * how many scalar fields in total are in CTOR,
4988 and place it in *P_ELT_COUNT.
4989 * if a type is a union, and the initializer from the constructor
4990 is not the largest element in the union, then set *p_must_clear.
4992 Return whether or not CTOR is a valid static constant initializer, the same
4993 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4996 categorize_ctor_elements (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4997 HOST_WIDE_INT *p_elt_count,
5002 *p_must_clear = false;
5005 categorize_ctor_elements_1 (ctor, p_nz_elts, p_elt_count, p_must_clear);
5008 /* Count the number of scalars in TYPE. Return -1 on overflow or
5009 variable-sized. If ALLOW_FLEXARR is true, don't count flexible
5010 array member at the end of the structure. */
5013 count_type_elements (const_tree type, bool allow_flexarr)
5015 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
5016 switch (TREE_CODE (type))
5020 tree telts = array_type_nelts (type);
5021 if (telts && host_integerp (telts, 1))
5023 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
5024 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type), false);
5027 else if (max / n > m)
5035 HOST_WIDE_INT n = 0, t;
5038 for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f))
5039 if (TREE_CODE (f) == FIELD_DECL)
5041 t = count_type_elements (TREE_TYPE (f), false);
5044 /* Check for structures with flexible array member. */
5045 tree tf = TREE_TYPE (f);
5047 && DECL_CHAIN (f) == NULL
5048 && TREE_CODE (tf) == ARRAY_TYPE
5050 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf))
5051 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf)))
5052 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf))
5053 && int_size_in_bytes (type) >= 0)
5065 case QUAL_UNION_TYPE:
5072 return TYPE_VECTOR_SUBPARTS (type);
5076 case FIXED_POINT_TYPE:
5081 case REFERENCE_TYPE:
5096 /* Return 1 if EXP contains mostly (3/4) zeros. */
5099 mostly_zeros_p (const_tree exp)
5101 if (TREE_CODE (exp) == CONSTRUCTOR)
5104 HOST_WIDE_INT nz_elts, count, elts;
5107 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5111 elts = count_type_elements (TREE_TYPE (exp), false);
5113 return nz_elts < elts / 4;
5116 return initializer_zerop (exp);
5119 /* Return 1 if EXP contains all zeros. */
5122 all_zeros_p (const_tree exp)
5124 if (TREE_CODE (exp) == CONSTRUCTOR)
5127 HOST_WIDE_INT nz_elts, count;
5130 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5131 return nz_elts == 0;
5134 return initializer_zerop (exp);
5137 /* Helper function for store_constructor.
5138 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5139 TYPE is the type of the CONSTRUCTOR, not the element type.
5140 CLEARED is as for store_constructor.
5141 ALIAS_SET is the alias set to use for any stores.
5143 This provides a recursive shortcut back to store_constructor when it isn't
5144 necessary to go through store_field. This is so that we can pass through
5145 the cleared field to let store_constructor know that we may not have to
5146 clear a substructure if the outer structure has already been cleared. */
5149 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
5150 HOST_WIDE_INT bitpos, enum machine_mode mode,
5151 tree exp, tree type, int cleared,
5152 alias_set_type alias_set)
5154 if (TREE_CODE (exp) == CONSTRUCTOR
5155 /* We can only call store_constructor recursively if the size and
5156 bit position are on a byte boundary. */
5157 && bitpos % BITS_PER_UNIT == 0
5158 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
5159 /* If we have a nonzero bitpos for a register target, then we just
5160 let store_field do the bitfield handling. This is unlikely to
5161 generate unnecessary clear instructions anyways. */
5162 && (bitpos == 0 || MEM_P (target)))
5166 = adjust_address (target,
5167 GET_MODE (target) == BLKmode
5169 % GET_MODE_ALIGNMENT (GET_MODE (target)))
5170 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
5173 /* Update the alias set, if required. */
5174 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
5175 && MEM_ALIAS_SET (target) != 0)
5177 target = copy_rtx (target);
5178 set_mem_alias_set (target, alias_set);
5181 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
5184 store_field (target, bitsize, bitpos, mode, exp, type, alias_set, false);
5187 /* Store the value of constructor EXP into the rtx TARGET.
5188 TARGET is either a REG or a MEM; we know it cannot conflict, since
5189 safe_from_p has been called.
5190 CLEARED is true if TARGET is known to have been zero'd.
5191 SIZE is the number of bytes of TARGET we are allowed to modify: this
5192 may not be the same as the size of EXP if we are assigning to a field
5193 which has been packed to exclude padding bits. */
5196 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
5198 tree type = TREE_TYPE (exp);
5199 #ifdef WORD_REGISTER_OPERATIONS
5200 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
5203 switch (TREE_CODE (type))
5207 case QUAL_UNION_TYPE:
5209 unsigned HOST_WIDE_INT idx;
5212 /* If size is zero or the target is already cleared, do nothing. */
5213 if (size == 0 || cleared)
5215 /* We either clear the aggregate or indicate the value is dead. */
5216 else if ((TREE_CODE (type) == UNION_TYPE
5217 || TREE_CODE (type) == QUAL_UNION_TYPE)
5218 && ! CONSTRUCTOR_ELTS (exp))
5219 /* If the constructor is empty, clear the union. */
5221 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
5225 /* If we are building a static constructor into a register,
5226 set the initial value as zero so we can fold the value into
5227 a constant. But if more than one register is involved,
5228 this probably loses. */
5229 else if (REG_P (target) && TREE_STATIC (exp)
5230 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
5232 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5236 /* If the constructor has fewer fields than the structure or
5237 if we are initializing the structure to mostly zeros, clear
5238 the whole structure first. Don't do this if TARGET is a
5239 register whose mode size isn't equal to SIZE since
5240 clear_storage can't handle this case. */
5242 && (((int)VEC_length (constructor_elt, CONSTRUCTOR_ELTS (exp))
5243 != fields_length (type))
5244 || mostly_zeros_p (exp))
5246 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
5249 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5253 if (REG_P (target) && !cleared)
5254 emit_clobber (target);
5256 /* Store each element of the constructor into the
5257 corresponding field of TARGET. */
5258 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, field, value)
5260 enum machine_mode mode;
5261 HOST_WIDE_INT bitsize;
5262 HOST_WIDE_INT bitpos = 0;
5264 rtx to_rtx = target;
5266 /* Just ignore missing fields. We cleared the whole
5267 structure, above, if any fields are missing. */
5271 if (cleared && initializer_zerop (value))
5274 if (host_integerp (DECL_SIZE (field), 1))
5275 bitsize = tree_low_cst (DECL_SIZE (field), 1);
5279 mode = DECL_MODE (field);
5280 if (DECL_BIT_FIELD (field))
5283 offset = DECL_FIELD_OFFSET (field);
5284 if (host_integerp (offset, 0)
5285 && host_integerp (bit_position (field), 0))
5287 bitpos = int_bit_position (field);
5291 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
5295 enum machine_mode address_mode;
5299 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
5300 make_tree (TREE_TYPE (exp),
5303 offset_rtx = expand_normal (offset);
5304 gcc_assert (MEM_P (to_rtx));
5307 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
5308 if (GET_MODE (offset_rtx) != address_mode)
5309 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
5311 to_rtx = offset_address (to_rtx, offset_rtx,
5312 highest_pow2_factor (offset));
5315 #ifdef WORD_REGISTER_OPERATIONS
5316 /* If this initializes a field that is smaller than a
5317 word, at the start of a word, try to widen it to a full
5318 word. This special case allows us to output C++ member
5319 function initializations in a form that the optimizers
5322 && bitsize < BITS_PER_WORD
5323 && bitpos % BITS_PER_WORD == 0
5324 && GET_MODE_CLASS (mode) == MODE_INT
5325 && TREE_CODE (value) == INTEGER_CST
5327 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5329 tree type = TREE_TYPE (value);
5331 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5333 type = lang_hooks.types.type_for_size
5334 (BITS_PER_WORD, TYPE_UNSIGNED (type));
5335 value = fold_convert (type, value);
5338 if (BYTES_BIG_ENDIAN)
5340 = fold_build2 (LSHIFT_EXPR, type, value,
5341 build_int_cst (type,
5342 BITS_PER_WORD - bitsize));
5343 bitsize = BITS_PER_WORD;
5348 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5349 && DECL_NONADDRESSABLE_P (field))
5351 to_rtx = copy_rtx (to_rtx);
5352 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5355 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5356 value, type, cleared,
5357 get_alias_set (TREE_TYPE (field)));
5364 unsigned HOST_WIDE_INT i;
5367 tree elttype = TREE_TYPE (type);
5369 HOST_WIDE_INT minelt = 0;
5370 HOST_WIDE_INT maxelt = 0;
5372 domain = TYPE_DOMAIN (type);
5373 const_bounds_p = (TYPE_MIN_VALUE (domain)
5374 && TYPE_MAX_VALUE (domain)
5375 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5376 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5378 /* If we have constant bounds for the range of the type, get them. */
5381 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5382 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5385 /* If the constructor has fewer elements than the array, clear
5386 the whole array first. Similarly if this is static
5387 constructor of a non-BLKmode object. */
5390 else if (REG_P (target) && TREE_STATIC (exp))
5394 unsigned HOST_WIDE_INT idx;
5396 HOST_WIDE_INT count = 0, zero_count = 0;
5397 need_to_clear = ! const_bounds_p;
5399 /* This loop is a more accurate version of the loop in
5400 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5401 is also needed to check for missing elements. */
5402 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, index, value)
5404 HOST_WIDE_INT this_node_count;
5409 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5411 tree lo_index = TREE_OPERAND (index, 0);
5412 tree hi_index = TREE_OPERAND (index, 1);
5414 if (! host_integerp (lo_index, 1)
5415 || ! host_integerp (hi_index, 1))
5421 this_node_count = (tree_low_cst (hi_index, 1)
5422 - tree_low_cst (lo_index, 1) + 1);
5425 this_node_count = 1;
5427 count += this_node_count;
5428 if (mostly_zeros_p (value))
5429 zero_count += this_node_count;
5432 /* Clear the entire array first if there are any missing
5433 elements, or if the incidence of zero elements is >=
5436 && (count < maxelt - minelt + 1
5437 || 4 * zero_count >= 3 * count))
5441 if (need_to_clear && size > 0)
5444 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5446 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5450 if (!cleared && REG_P (target))
5451 /* Inform later passes that the old value is dead. */
5452 emit_clobber (target);
5454 /* Store each element of the constructor into the
5455 corresponding element of TARGET, determined by counting the
5457 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), i, index, value)
5459 enum machine_mode mode;
5460 HOST_WIDE_INT bitsize;
5461 HOST_WIDE_INT bitpos;
5462 rtx xtarget = target;
5464 if (cleared && initializer_zerop (value))
5467 mode = TYPE_MODE (elttype);
5468 if (mode == BLKmode)
5469 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
5470 ? tree_low_cst (TYPE_SIZE (elttype), 1)
5473 bitsize = GET_MODE_BITSIZE (mode);
5475 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5477 tree lo_index = TREE_OPERAND (index, 0);
5478 tree hi_index = TREE_OPERAND (index, 1);
5479 rtx index_r, pos_rtx;
5480 HOST_WIDE_INT lo, hi, count;
5483 /* If the range is constant and "small", unroll the loop. */
5485 && host_integerp (lo_index, 0)
5486 && host_integerp (hi_index, 0)
5487 && (lo = tree_low_cst (lo_index, 0),
5488 hi = tree_low_cst (hi_index, 0),
5489 count = hi - lo + 1,
5492 || (host_integerp (TYPE_SIZE (elttype), 1)
5493 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
5496 lo -= minelt; hi -= minelt;
5497 for (; lo <= hi; lo++)
5499 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
5502 && !MEM_KEEP_ALIAS_SET_P (target)
5503 && TREE_CODE (type) == ARRAY_TYPE
5504 && TYPE_NONALIASED_COMPONENT (type))
5506 target = copy_rtx (target);
5507 MEM_KEEP_ALIAS_SET_P (target) = 1;
5510 store_constructor_field
5511 (target, bitsize, bitpos, mode, value, type, cleared,
5512 get_alias_set (elttype));
5517 rtx loop_start = gen_label_rtx ();
5518 rtx loop_end = gen_label_rtx ();
5521 expand_normal (hi_index);
5523 index = build_decl (EXPR_LOCATION (exp),
5524 VAR_DECL, NULL_TREE, domain);
5525 index_r = gen_reg_rtx (promote_decl_mode (index, NULL));
5526 SET_DECL_RTL (index, index_r);
5527 store_expr (lo_index, index_r, 0, false);
5529 /* Build the head of the loop. */
5530 do_pending_stack_adjust ();
5531 emit_label (loop_start);
5533 /* Assign value to element index. */
5535 fold_convert (ssizetype,
5536 fold_build2 (MINUS_EXPR,
5539 TYPE_MIN_VALUE (domain)));
5542 size_binop (MULT_EXPR, position,
5543 fold_convert (ssizetype,
5544 TYPE_SIZE_UNIT (elttype)));
5546 pos_rtx = expand_normal (position);
5547 xtarget = offset_address (target, pos_rtx,
5548 highest_pow2_factor (position));
5549 xtarget = adjust_address (xtarget, mode, 0);
5550 if (TREE_CODE (value) == CONSTRUCTOR)
5551 store_constructor (value, xtarget, cleared,
5552 bitsize / BITS_PER_UNIT);
5554 store_expr (value, xtarget, 0, false);
5556 /* Generate a conditional jump to exit the loop. */
5557 exit_cond = build2 (LT_EXPR, integer_type_node,
5559 jumpif (exit_cond, loop_end, -1);
5561 /* Update the loop counter, and jump to the head of
5563 expand_assignment (index,
5564 build2 (PLUS_EXPR, TREE_TYPE (index),
5565 index, integer_one_node),
5568 emit_jump (loop_start);
5570 /* Build the end of the loop. */
5571 emit_label (loop_end);
5574 else if ((index != 0 && ! host_integerp (index, 0))
5575 || ! host_integerp (TYPE_SIZE (elttype), 1))
5580 index = ssize_int (1);
5583 index = fold_convert (ssizetype,
5584 fold_build2 (MINUS_EXPR,
5587 TYPE_MIN_VALUE (domain)));
5590 size_binop (MULT_EXPR, index,
5591 fold_convert (ssizetype,
5592 TYPE_SIZE_UNIT (elttype)));
5593 xtarget = offset_address (target,
5594 expand_normal (position),
5595 highest_pow2_factor (position));
5596 xtarget = adjust_address (xtarget, mode, 0);
5597 store_expr (value, xtarget, 0, false);
5602 bitpos = ((tree_low_cst (index, 0) - minelt)
5603 * tree_low_cst (TYPE_SIZE (elttype), 1));
5605 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5607 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5608 && TREE_CODE (type) == ARRAY_TYPE
5609 && TYPE_NONALIASED_COMPONENT (type))
5611 target = copy_rtx (target);
5612 MEM_KEEP_ALIAS_SET_P (target) = 1;
5614 store_constructor_field (target, bitsize, bitpos, mode, value,
5615 type, cleared, get_alias_set (elttype));
5623 unsigned HOST_WIDE_INT idx;
5624 constructor_elt *ce;
5628 tree elttype = TREE_TYPE (type);
5629 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5630 enum machine_mode eltmode = TYPE_MODE (elttype);
5631 HOST_WIDE_INT bitsize;
5632 HOST_WIDE_INT bitpos;
5633 rtvec vector = NULL;
5635 alias_set_type alias;
5637 gcc_assert (eltmode != BLKmode);
5639 n_elts = TYPE_VECTOR_SUBPARTS (type);
5640 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5642 enum machine_mode mode = GET_MODE (target);
5644 icode = (int) optab_handler (vec_init_optab, mode);
5645 if (icode != CODE_FOR_nothing)
5649 vector = rtvec_alloc (n_elts);
5650 for (i = 0; i < n_elts; i++)
5651 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5655 /* If the constructor has fewer elements than the vector,
5656 clear the whole array first. Similarly if this is static
5657 constructor of a non-BLKmode object. */
5660 else if (REG_P (target) && TREE_STATIC (exp))
5664 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5667 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
5669 int n_elts_here = tree_low_cst
5670 (int_const_binop (TRUNC_DIV_EXPR,
5671 TYPE_SIZE (TREE_TYPE (value)),
5672 TYPE_SIZE (elttype), 0), 1);
5674 count += n_elts_here;
5675 if (mostly_zeros_p (value))
5676 zero_count += n_elts_here;
5679 /* Clear the entire vector first if there are any missing elements,
5680 or if the incidence of zero elements is >= 75%. */
5681 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5684 if (need_to_clear && size > 0 && !vector)
5687 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5689 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5693 /* Inform later passes that the old value is dead. */
5694 if (!cleared && !vector && REG_P (target))
5695 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5698 alias = MEM_ALIAS_SET (target);
5700 alias = get_alias_set (elttype);
5702 /* Store each element of the constructor into the corresponding
5703 element of TARGET, determined by counting the elements. */
5704 for (idx = 0, i = 0;
5705 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
5706 idx++, i += bitsize / elt_size)
5708 HOST_WIDE_INT eltpos;
5709 tree value = ce->value;
5711 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5712 if (cleared && initializer_zerop (value))
5716 eltpos = tree_low_cst (ce->index, 1);
5722 /* Vector CONSTRUCTORs should only be built from smaller
5723 vectors in the case of BLKmode vectors. */
5724 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5725 RTVEC_ELT (vector, eltpos)
5726 = expand_normal (value);
5730 enum machine_mode value_mode =
5731 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5732 ? TYPE_MODE (TREE_TYPE (value))
5734 bitpos = eltpos * elt_size;
5735 store_constructor_field (target, bitsize, bitpos,
5736 value_mode, value, type,
5742 emit_insn (GEN_FCN (icode)
5744 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5753 /* Store the value of EXP (an expression tree)
5754 into a subfield of TARGET which has mode MODE and occupies
5755 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5756 If MODE is VOIDmode, it means that we are storing into a bit-field.
5758 Always return const0_rtx unless we have something particular to
5761 TYPE is the type of the underlying object,
5763 ALIAS_SET is the alias set for the destination. This value will
5764 (in general) be different from that for TARGET, since TARGET is a
5765 reference to the containing structure.
5767 If NONTEMPORAL is true, try generating a nontemporal store. */
5770 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5771 enum machine_mode mode, tree exp, tree type,
5772 alias_set_type alias_set, bool nontemporal)
5774 if (TREE_CODE (exp) == ERROR_MARK)
5777 /* If we have nothing to store, do nothing unless the expression has
5780 return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5782 /* If we are storing into an unaligned field of an aligned union that is
5783 in a register, we may have the mode of TARGET being an integer mode but
5784 MODE == BLKmode. In that case, get an aligned object whose size and
5785 alignment are the same as TARGET and store TARGET into it (we can avoid
5786 the store if the field being stored is the entire width of TARGET). Then
5787 call ourselves recursively to store the field into a BLKmode version of
5788 that object. Finally, load from the object into TARGET. This is not
5789 very efficient in general, but should only be slightly more expensive
5790 than the otherwise-required unaligned accesses. Perhaps this can be
5791 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5792 twice, once with emit_move_insn and once via store_field. */
5795 && (REG_P (target) || GET_CODE (target) == SUBREG))
5797 rtx object = assign_temp (type, 0, 1, 1);
5798 rtx blk_object = adjust_address (object, BLKmode, 0);
5800 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5801 emit_move_insn (object, target);
5803 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set,
5806 emit_move_insn (target, object);
5808 /* We want to return the BLKmode version of the data. */
5812 if (GET_CODE (target) == CONCAT)
5814 /* We're storing into a struct containing a single __complex. */
5816 gcc_assert (!bitpos);
5817 return store_expr (exp, target, 0, nontemporal);
5820 /* If the structure is in a register or if the component
5821 is a bit field, we cannot use addressing to access it.
5822 Use bit-field techniques or SUBREG to store in it. */
5824 if (mode == VOIDmode
5825 || (mode != BLKmode && ! direct_store[(int) mode]
5826 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5827 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5829 || GET_CODE (target) == SUBREG
5830 /* If the field isn't aligned enough to store as an ordinary memref,
5831 store it as a bit field. */
5833 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5834 || bitpos % GET_MODE_ALIGNMENT (mode))
5835 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5836 || (bitpos % BITS_PER_UNIT != 0)))
5837 /* If the RHS and field are a constant size and the size of the
5838 RHS isn't the same size as the bitfield, we must use bitfield
5841 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5842 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0)
5843 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
5844 decl we must use bitfield operations. */
5846 && TREE_CODE (exp) == MEM_REF
5847 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
5848 && DECL_P (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
5849 && !TREE_ADDRESSABLE (TREE_OPERAND (TREE_OPERAND (exp, 0),0 ))
5850 && DECL_MODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) != BLKmode))
5855 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5856 implies a mask operation. If the precision is the same size as
5857 the field we're storing into, that mask is redundant. This is
5858 particularly common with bit field assignments generated by the
5860 nop_def = get_def_for_expr (exp, NOP_EXPR);
5863 tree type = TREE_TYPE (exp);
5864 if (INTEGRAL_TYPE_P (type)
5865 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
5866 && bitsize == TYPE_PRECISION (type))
5868 tree op = gimple_assign_rhs1 (nop_def);
5869 type = TREE_TYPE (op);
5870 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
5875 temp = expand_normal (exp);
5877 /* If BITSIZE is narrower than the size of the type of EXP
5878 we will be narrowing TEMP. Normally, what's wanted are the
5879 low-order bits. However, if EXP's type is a record and this is
5880 big-endian machine, we want the upper BITSIZE bits. */
5881 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5882 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5883 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5884 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5885 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5889 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5891 if (mode != VOIDmode && mode != BLKmode
5892 && mode != TYPE_MODE (TREE_TYPE (exp)))
5893 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5895 /* If the modes of TEMP and TARGET are both BLKmode, both
5896 must be in memory and BITPOS must be aligned on a byte
5897 boundary. If so, we simply do a block copy. Likewise
5898 for a BLKmode-like TARGET. */
5899 if (GET_MODE (temp) == BLKmode
5900 && (GET_MODE (target) == BLKmode
5902 && GET_MODE_CLASS (GET_MODE (target)) == MODE_INT
5903 && (bitpos % BITS_PER_UNIT) == 0
5904 && (bitsize % BITS_PER_UNIT) == 0)))
5906 gcc_assert (MEM_P (target) && MEM_P (temp)
5907 && (bitpos % BITS_PER_UNIT) == 0);
5909 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5910 emit_block_move (target, temp,
5911 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5918 /* Store the value in the bitfield. */
5919 store_bit_field (target, bitsize, bitpos, mode, temp);
5925 /* Now build a reference to just the desired component. */
5926 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5928 if (to_rtx == target)
5929 to_rtx = copy_rtx (to_rtx);
5931 if (!MEM_SCALAR_P (to_rtx))
5932 MEM_IN_STRUCT_P (to_rtx) = 1;
5933 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5934 set_mem_alias_set (to_rtx, alias_set);
5936 return store_expr (exp, to_rtx, 0, nontemporal);
5940 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5941 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5942 codes and find the ultimate containing object, which we return.
5944 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5945 bit position, and *PUNSIGNEDP to the signedness of the field.
5946 If the position of the field is variable, we store a tree
5947 giving the variable offset (in units) in *POFFSET.
5948 This offset is in addition to the bit position.
5949 If the position is not variable, we store 0 in *POFFSET.
5951 If any of the extraction expressions is volatile,
5952 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5954 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
5955 Otherwise, it is a mode that can be used to access the field.
5957 If the field describes a variable-sized object, *PMODE is set to
5958 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
5959 this case, but the address of the object can be found.
5961 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5962 look through nodes that serve as markers of a greater alignment than
5963 the one that can be deduced from the expression. These nodes make it
5964 possible for front-ends to prevent temporaries from being created by
5965 the middle-end on alignment considerations. For that purpose, the
5966 normal operating mode at high-level is to always pass FALSE so that
5967 the ultimate containing object is really returned; moreover, the
5968 associated predicate handled_component_p will always return TRUE
5969 on these nodes, thus indicating that they are essentially handled
5970 by get_inner_reference. TRUE should only be passed when the caller
5971 is scanning the expression in order to build another representation
5972 and specifically knows how to handle these nodes; as such, this is
5973 the normal operating mode in the RTL expanders. */
5976 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
5977 HOST_WIDE_INT *pbitpos, tree *poffset,
5978 enum machine_mode *pmode, int *punsignedp,
5979 int *pvolatilep, bool keep_aligning)
5982 enum machine_mode mode = VOIDmode;
5983 bool blkmode_bitfield = false;
5984 tree offset = size_zero_node;
5985 double_int bit_offset = double_int_zero;
5987 /* First get the mode, signedness, and size. We do this from just the
5988 outermost expression. */
5990 if (TREE_CODE (exp) == COMPONENT_REF)
5992 tree field = TREE_OPERAND (exp, 1);
5993 size_tree = DECL_SIZE (field);
5994 if (!DECL_BIT_FIELD (field))
5995 mode = DECL_MODE (field);
5996 else if (DECL_MODE (field) == BLKmode)
5997 blkmode_bitfield = true;
5998 else if (TREE_THIS_VOLATILE (exp)
5999 && flag_strict_volatile_bitfields > 0)
6000 /* Volatile bitfields should be accessed in the mode of the
6001 field's type, not the mode computed based on the bit
6003 mode = TYPE_MODE (DECL_BIT_FIELD_TYPE (field));
6005 *punsignedp = DECL_UNSIGNED (field);
6007 else if (TREE_CODE (exp) == BIT_FIELD_REF)
6009 size_tree = TREE_OPERAND (exp, 1);
6010 *punsignedp = (! INTEGRAL_TYPE_P (TREE_TYPE (exp))
6011 || TYPE_UNSIGNED (TREE_TYPE (exp)));
6013 /* For vector types, with the correct size of access, use the mode of
6015 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == VECTOR_TYPE
6016 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))
6017 && tree_int_cst_equal (size_tree, TYPE_SIZE (TREE_TYPE (exp))))
6018 mode = TYPE_MODE (TREE_TYPE (exp));
6022 mode = TYPE_MODE (TREE_TYPE (exp));
6023 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
6025 if (mode == BLKmode)
6026 size_tree = TYPE_SIZE (TREE_TYPE (exp));
6028 *pbitsize = GET_MODE_BITSIZE (mode);
6033 if (! host_integerp (size_tree, 1))
6034 mode = BLKmode, *pbitsize = -1;
6036 *pbitsize = tree_low_cst (size_tree, 1);
6039 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6040 and find the ultimate containing object. */
6043 switch (TREE_CODE (exp))
6047 = double_int_add (bit_offset,
6048 tree_to_double_int (TREE_OPERAND (exp, 2)));
6053 tree field = TREE_OPERAND (exp, 1);
6054 tree this_offset = component_ref_field_offset (exp);
6056 /* If this field hasn't been filled in yet, don't go past it.
6057 This should only happen when folding expressions made during
6058 type construction. */
6059 if (this_offset == 0)
6062 offset = size_binop (PLUS_EXPR, offset, this_offset);
6063 bit_offset = double_int_add (bit_offset,
6065 (DECL_FIELD_BIT_OFFSET (field)));
6067 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6072 case ARRAY_RANGE_REF:
6074 tree index = TREE_OPERAND (exp, 1);
6075 tree low_bound = array_ref_low_bound (exp);
6076 tree unit_size = array_ref_element_size (exp);
6078 /* We assume all arrays have sizes that are a multiple of a byte.
6079 First subtract the lower bound, if any, in the type of the
6080 index, then convert to sizetype and multiply by the size of
6081 the array element. */
6082 if (! integer_zerop (low_bound))
6083 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
6086 offset = size_binop (PLUS_EXPR, offset,
6087 size_binop (MULT_EXPR,
6088 fold_convert (sizetype, index),
6097 bit_offset = double_int_add (bit_offset,
6098 uhwi_to_double_int (*pbitsize));
6101 case VIEW_CONVERT_EXPR:
6102 if (keep_aligning && STRICT_ALIGNMENT
6103 && (TYPE_ALIGN (TREE_TYPE (exp))
6104 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
6105 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
6106 < BIGGEST_ALIGNMENT)
6107 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
6108 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
6113 /* Hand back the decl for MEM[&decl, off]. */
6114 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)
6116 tree off = TREE_OPERAND (exp, 1);
6117 if (!integer_zerop (off))
6119 double_int boff, coff = mem_ref_offset (exp);
6120 boff = double_int_lshift (coff,
6122 ? 3 : exact_log2 (BITS_PER_UNIT),
6123 HOST_BITS_PER_DOUBLE_INT, true);
6124 bit_offset = double_int_add (bit_offset, boff);
6126 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
6134 /* If any reference in the chain is volatile, the effect is volatile. */
6135 if (TREE_THIS_VOLATILE (exp))
6138 exp = TREE_OPERAND (exp, 0);
6142 /* If OFFSET is constant, see if we can return the whole thing as a
6143 constant bit position. Make sure to handle overflow during
6145 if (host_integerp (offset, 0))
6147 double_int tem = double_int_lshift (tree_to_double_int (offset),
6149 ? 3 : exact_log2 (BITS_PER_UNIT),
6150 HOST_BITS_PER_DOUBLE_INT, true);
6151 tem = double_int_add (tem, bit_offset);
6152 if (double_int_fits_in_shwi_p (tem))
6154 *pbitpos = double_int_to_shwi (tem);
6155 *poffset = offset = NULL_TREE;
6159 /* Otherwise, split it up. */
6162 *pbitpos = double_int_to_shwi (bit_offset);
6166 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6167 if (mode == VOIDmode
6169 && (*pbitpos % BITS_PER_UNIT) == 0
6170 && (*pbitsize % BITS_PER_UNIT) == 0)
6178 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
6179 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
6180 EXP is marked as PACKED. */
6183 contains_packed_reference (const_tree exp)
6185 bool packed_p = false;
6189 switch (TREE_CODE (exp))
6193 tree field = TREE_OPERAND (exp, 1);
6194 packed_p = DECL_PACKED (field)
6195 || TYPE_PACKED (TREE_TYPE (field))
6196 || TYPE_PACKED (TREE_TYPE (exp));
6204 case ARRAY_RANGE_REF:
6207 case VIEW_CONVERT_EXPR:
6213 exp = TREE_OPERAND (exp, 0);
6219 /* Return a tree of sizetype representing the size, in bytes, of the element
6220 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6223 array_ref_element_size (tree exp)
6225 tree aligned_size = TREE_OPERAND (exp, 3);
6226 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6227 location_t loc = EXPR_LOCATION (exp);
6229 /* If a size was specified in the ARRAY_REF, it's the size measured
6230 in alignment units of the element type. So multiply by that value. */
6233 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6234 sizetype from another type of the same width and signedness. */
6235 if (TREE_TYPE (aligned_size) != sizetype)
6236 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
6237 return size_binop_loc (loc, MULT_EXPR, aligned_size,
6238 size_int (TYPE_ALIGN_UNIT (elmt_type)));
6241 /* Otherwise, take the size from that of the element type. Substitute
6242 any PLACEHOLDER_EXPR that we have. */
6244 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
6247 /* Return a tree representing the lower bound of the array mentioned in
6248 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6251 array_ref_low_bound (tree exp)
6253 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6255 /* If a lower bound is specified in EXP, use it. */
6256 if (TREE_OPERAND (exp, 2))
6257 return TREE_OPERAND (exp, 2);
6259 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6260 substituting for a PLACEHOLDER_EXPR as needed. */
6261 if (domain_type && TYPE_MIN_VALUE (domain_type))
6262 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
6264 /* Otherwise, return a zero of the appropriate type. */
6265 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
6268 /* Return a tree representing the upper bound of the array mentioned in
6269 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6272 array_ref_up_bound (tree exp)
6274 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6276 /* If there is a domain type and it has an upper bound, use it, substituting
6277 for a PLACEHOLDER_EXPR as needed. */
6278 if (domain_type && TYPE_MAX_VALUE (domain_type))
6279 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
6281 /* Otherwise fail. */
6285 /* Return a tree representing the offset, in bytes, of the field referenced
6286 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6289 component_ref_field_offset (tree exp)
6291 tree aligned_offset = TREE_OPERAND (exp, 2);
6292 tree field = TREE_OPERAND (exp, 1);
6293 location_t loc = EXPR_LOCATION (exp);
6295 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6296 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6300 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6301 sizetype from another type of the same width and signedness. */
6302 if (TREE_TYPE (aligned_offset) != sizetype)
6303 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
6304 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
6305 size_int (DECL_OFFSET_ALIGN (field)
6309 /* Otherwise, take the offset from that of the field. Substitute
6310 any PLACEHOLDER_EXPR that we have. */
6312 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
6315 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6317 static unsigned HOST_WIDE_INT
6318 target_align (const_tree target)
6320 /* We might have a chain of nested references with intermediate misaligning
6321 bitfields components, so need to recurse to find out. */
6323 unsigned HOST_WIDE_INT this_align, outer_align;
6325 switch (TREE_CODE (target))
6331 this_align = DECL_ALIGN (TREE_OPERAND (target, 1));
6332 outer_align = target_align (TREE_OPERAND (target, 0));
6333 return MIN (this_align, outer_align);
6336 case ARRAY_RANGE_REF:
6337 this_align = TYPE_ALIGN (TREE_TYPE (target));
6338 outer_align = target_align (TREE_OPERAND (target, 0));
6339 return MIN (this_align, outer_align);
6342 case NON_LVALUE_EXPR:
6343 case VIEW_CONVERT_EXPR:
6344 this_align = TYPE_ALIGN (TREE_TYPE (target));
6345 outer_align = target_align (TREE_OPERAND (target, 0));
6346 return MAX (this_align, outer_align);
6349 return TYPE_ALIGN (TREE_TYPE (target));
6354 /* Given an rtx VALUE that may contain additions and multiplications, return
6355 an equivalent value that just refers to a register, memory, or constant.
6356 This is done by generating instructions to perform the arithmetic and
6357 returning a pseudo-register containing the value.
6359 The returned value may be a REG, SUBREG, MEM or constant. */
6362 force_operand (rtx value, rtx target)
6365 /* Use subtarget as the target for operand 0 of a binary operation. */
6366 rtx subtarget = get_subtarget (target);
6367 enum rtx_code code = GET_CODE (value);
6369 /* Check for subreg applied to an expression produced by loop optimizer. */
6371 && !REG_P (SUBREG_REG (value))
6372 && !MEM_P (SUBREG_REG (value)))
6375 = simplify_gen_subreg (GET_MODE (value),
6376 force_reg (GET_MODE (SUBREG_REG (value)),
6377 force_operand (SUBREG_REG (value),
6379 GET_MODE (SUBREG_REG (value)),
6380 SUBREG_BYTE (value));
6381 code = GET_CODE (value);
6384 /* Check for a PIC address load. */
6385 if ((code == PLUS || code == MINUS)
6386 && XEXP (value, 0) == pic_offset_table_rtx
6387 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
6388 || GET_CODE (XEXP (value, 1)) == LABEL_REF
6389 || GET_CODE (XEXP (value, 1)) == CONST))
6392 subtarget = gen_reg_rtx (GET_MODE (value));
6393 emit_move_insn (subtarget, value);
6397 if (ARITHMETIC_P (value))
6399 op2 = XEXP (value, 1);
6400 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
6402 if (code == MINUS && CONST_INT_P (op2))
6405 op2 = negate_rtx (GET_MODE (value), op2);
6408 /* Check for an addition with OP2 a constant integer and our first
6409 operand a PLUS of a virtual register and something else. In that
6410 case, we want to emit the sum of the virtual register and the
6411 constant first and then add the other value. This allows virtual
6412 register instantiation to simply modify the constant rather than
6413 creating another one around this addition. */
6414 if (code == PLUS && CONST_INT_P (op2)
6415 && GET_CODE (XEXP (value, 0)) == PLUS
6416 && REG_P (XEXP (XEXP (value, 0), 0))
6417 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6418 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
6420 rtx temp = expand_simple_binop (GET_MODE (value), code,
6421 XEXP (XEXP (value, 0), 0), op2,
6422 subtarget, 0, OPTAB_LIB_WIDEN);
6423 return expand_simple_binop (GET_MODE (value), code, temp,
6424 force_operand (XEXP (XEXP (value,
6426 target, 0, OPTAB_LIB_WIDEN);
6429 op1 = force_operand (XEXP (value, 0), subtarget);
6430 op2 = force_operand (op2, NULL_RTX);
6434 return expand_mult (GET_MODE (value), op1, op2, target, 1);
6436 if (!INTEGRAL_MODE_P (GET_MODE (value)))
6437 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6438 target, 1, OPTAB_LIB_WIDEN);
6440 return expand_divmod (0,
6441 FLOAT_MODE_P (GET_MODE (value))
6442 ? RDIV_EXPR : TRUNC_DIV_EXPR,
6443 GET_MODE (value), op1, op2, target, 0);
6445 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6448 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
6451 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6454 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6455 target, 0, OPTAB_LIB_WIDEN);
6457 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6458 target, 1, OPTAB_LIB_WIDEN);
6461 if (UNARY_P (value))
6464 target = gen_reg_rtx (GET_MODE (value));
6465 op1 = force_operand (XEXP (value, 0), NULL_RTX);
6472 case FLOAT_TRUNCATE:
6473 convert_move (target, op1, code == ZERO_EXTEND);
6478 expand_fix (target, op1, code == UNSIGNED_FIX);
6482 case UNSIGNED_FLOAT:
6483 expand_float (target, op1, code == UNSIGNED_FLOAT);
6487 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
6491 #ifdef INSN_SCHEDULING
6492 /* On machines that have insn scheduling, we want all memory reference to be
6493 explicit, so we need to deal with such paradoxical SUBREGs. */
6494 if (GET_CODE (value) == SUBREG && MEM_P (SUBREG_REG (value))
6495 && (GET_MODE_SIZE (GET_MODE (value))
6496 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
6498 = simplify_gen_subreg (GET_MODE (value),
6499 force_reg (GET_MODE (SUBREG_REG (value)),
6500 force_operand (SUBREG_REG (value),
6502 GET_MODE (SUBREG_REG (value)),
6503 SUBREG_BYTE (value));
6509 /* Subroutine of expand_expr: return nonzero iff there is no way that
6510 EXP can reference X, which is being modified. TOP_P is nonzero if this
6511 call is going to be used to determine whether we need a temporary
6512 for EXP, as opposed to a recursive call to this function.
6514 It is always safe for this routine to return zero since it merely
6515 searches for optimization opportunities. */
6518 safe_from_p (const_rtx x, tree exp, int top_p)
6524 /* If EXP has varying size, we MUST use a target since we currently
6525 have no way of allocating temporaries of variable size
6526 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6527 So we assume here that something at a higher level has prevented a
6528 clash. This is somewhat bogus, but the best we can do. Only
6529 do this when X is BLKmode and when we are at the top level. */
6530 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6531 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
6532 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
6533 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
6534 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
6536 && GET_MODE (x) == BLKmode)
6537 /* If X is in the outgoing argument area, it is always safe. */
6539 && (XEXP (x, 0) == virtual_outgoing_args_rtx
6540 || (GET_CODE (XEXP (x, 0)) == PLUS
6541 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
6544 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6545 find the underlying pseudo. */
6546 if (GET_CODE (x) == SUBREG)
6549 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6553 /* Now look at our tree code and possibly recurse. */
6554 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
6556 case tcc_declaration:
6557 exp_rtl = DECL_RTL_IF_SET (exp);
6563 case tcc_exceptional:
6564 if (TREE_CODE (exp) == TREE_LIST)
6568 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
6570 exp = TREE_CHAIN (exp);
6573 if (TREE_CODE (exp) != TREE_LIST)
6574 return safe_from_p (x, exp, 0);
6577 else if (TREE_CODE (exp) == CONSTRUCTOR)
6579 constructor_elt *ce;
6580 unsigned HOST_WIDE_INT idx;
6582 FOR_EACH_VEC_ELT (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce)
6583 if ((ce->index != NULL_TREE && !safe_from_p (x, ce->index, 0))
6584 || !safe_from_p (x, ce->value, 0))
6588 else if (TREE_CODE (exp) == ERROR_MARK)
6589 return 1; /* An already-visited SAVE_EXPR? */
6594 /* The only case we look at here is the DECL_INITIAL inside a
6596 return (TREE_CODE (exp) != DECL_EXPR
6597 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
6598 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
6599 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
6602 case tcc_comparison:
6603 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
6608 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6610 case tcc_expression:
6613 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6614 the expression. If it is set, we conflict iff we are that rtx or
6615 both are in memory. Otherwise, we check all operands of the
6616 expression recursively. */
6618 switch (TREE_CODE (exp))
6621 /* If the operand is static or we are static, we can't conflict.
6622 Likewise if we don't conflict with the operand at all. */
6623 if (staticp (TREE_OPERAND (exp, 0))
6624 || TREE_STATIC (exp)
6625 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
6628 /* Otherwise, the only way this can conflict is if we are taking
6629 the address of a DECL a that address if part of X, which is
6631 exp = TREE_OPERAND (exp, 0);
6634 if (!DECL_RTL_SET_P (exp)
6635 || !MEM_P (DECL_RTL (exp)))
6638 exp_rtl = XEXP (DECL_RTL (exp), 0);
6644 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
6645 get_alias_set (exp)))
6650 /* Assume that the call will clobber all hard registers and
6652 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6657 case WITH_CLEANUP_EXPR:
6658 case CLEANUP_POINT_EXPR:
6659 /* Lowered by gimplify.c. */
6663 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6669 /* If we have an rtx, we do not need to scan our operands. */
6673 nops = TREE_OPERAND_LENGTH (exp);
6674 for (i = 0; i < nops; i++)
6675 if (TREE_OPERAND (exp, i) != 0
6676 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
6682 /* Should never get a type here. */
6686 /* If we have an rtl, find any enclosed object. Then see if we conflict
6690 if (GET_CODE (exp_rtl) == SUBREG)
6692 exp_rtl = SUBREG_REG (exp_rtl);
6694 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
6698 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6699 are memory and they conflict. */
6700 return ! (rtx_equal_p (x, exp_rtl)
6701 || (MEM_P (x) && MEM_P (exp_rtl)
6702 && true_dependence (exp_rtl, VOIDmode, x,
6703 rtx_addr_varies_p)));
6706 /* If we reach here, it is safe. */
6711 /* Return the highest power of two that EXP is known to be a multiple of.
6712 This is used in updating alignment of MEMs in array references. */
6714 unsigned HOST_WIDE_INT
6715 highest_pow2_factor (const_tree exp)
6717 unsigned HOST_WIDE_INT c0, c1;
6719 switch (TREE_CODE (exp))
6722 /* We can find the lowest bit that's a one. If the low
6723 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6724 We need to handle this case since we can find it in a COND_EXPR,
6725 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
6726 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6728 if (TREE_OVERFLOW (exp))
6729 return BIGGEST_ALIGNMENT;
6732 /* Note: tree_low_cst is intentionally not used here,
6733 we don't care about the upper bits. */
6734 c0 = TREE_INT_CST_LOW (exp);
6736 return c0 ? c0 : BIGGEST_ALIGNMENT;
6740 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6741 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6742 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6743 return MIN (c0, c1);
6746 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6747 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6750 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6752 if (integer_pow2p (TREE_OPERAND (exp, 1))
6753 && host_integerp (TREE_OPERAND (exp, 1), 1))
6755 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6756 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6757 return MAX (1, c0 / c1);
6762 /* The highest power of two of a bit-and expression is the maximum of
6763 that of its operands. We typically get here for a complex LHS and
6764 a constant negative power of two on the RHS to force an explicit
6765 alignment, so don't bother looking at the LHS. */
6766 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6770 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6773 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6776 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6777 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6778 return MIN (c0, c1);
6787 /* Similar, except that the alignment requirements of TARGET are
6788 taken into account. Assume it is at least as aligned as its
6789 type, unless it is a COMPONENT_REF in which case the layout of
6790 the structure gives the alignment. */
6792 static unsigned HOST_WIDE_INT
6793 highest_pow2_factor_for_target (const_tree target, const_tree exp)
6795 unsigned HOST_WIDE_INT talign = target_align (target) / BITS_PER_UNIT;
6796 unsigned HOST_WIDE_INT factor = highest_pow2_factor (exp);
6798 return MAX (factor, talign);
6801 /* Subroutine of expand_expr. Expand the two operands of a binary
6802 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6803 The value may be stored in TARGET if TARGET is nonzero. The
6804 MODIFIER argument is as documented by expand_expr. */
6807 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6808 enum expand_modifier modifier)
6810 if (! safe_from_p (target, exp1, 1))
6812 if (operand_equal_p (exp0, exp1, 0))
6814 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6815 *op1 = copy_rtx (*op0);
6819 /* If we need to preserve evaluation order, copy exp0 into its own
6820 temporary variable so that it can't be clobbered by exp1. */
6821 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6822 exp0 = save_expr (exp0);
6823 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6824 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6829 /* Return a MEM that contains constant EXP. DEFER is as for
6830 output_constant_def and MODIFIER is as for expand_expr. */
6833 expand_expr_constant (tree exp, int defer, enum expand_modifier modifier)
6837 mem = output_constant_def (exp, defer);
6838 if (modifier != EXPAND_INITIALIZER)
6839 mem = use_anchored_address (mem);
6843 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6844 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6847 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
6848 enum expand_modifier modifier, addr_space_t as)
6850 rtx result, subtarget;
6852 HOST_WIDE_INT bitsize, bitpos;
6853 int volatilep, unsignedp;
6854 enum machine_mode mode1;
6856 /* If we are taking the address of a constant and are at the top level,
6857 we have to use output_constant_def since we can't call force_const_mem
6859 /* ??? This should be considered a front-end bug. We should not be
6860 generating ADDR_EXPR of something that isn't an LVALUE. The only
6861 exception here is STRING_CST. */
6862 if (CONSTANT_CLASS_P (exp))
6863 return XEXP (expand_expr_constant (exp, 0, modifier), 0);
6865 /* Everything must be something allowed by is_gimple_addressable. */
6866 switch (TREE_CODE (exp))
6869 /* This case will happen via recursion for &a->b. */
6870 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6874 tree tem = TREE_OPERAND (exp, 0);
6875 if (!integer_zerop (TREE_OPERAND (exp, 1)))
6876 tem = build2 (POINTER_PLUS_EXPR, TREE_TYPE (TREE_OPERAND (exp, 1)),
6878 double_int_to_tree (sizetype, mem_ref_offset (exp)));
6879 return expand_expr (tem, target, tmode, modifier);
6883 /* Expand the initializer like constants above. */
6884 return XEXP (expand_expr_constant (DECL_INITIAL (exp), 0, modifier), 0);
6887 /* The real part of the complex number is always first, therefore
6888 the address is the same as the address of the parent object. */
6891 inner = TREE_OPERAND (exp, 0);
6895 /* The imaginary part of the complex number is always second.
6896 The expression is therefore always offset by the size of the
6899 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
6900 inner = TREE_OPERAND (exp, 0);
6904 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6905 expand_expr, as that can have various side effects; LABEL_DECLs for
6906 example, may not have their DECL_RTL set yet. Expand the rtl of
6907 CONSTRUCTORs too, which should yield a memory reference for the
6908 constructor's contents. Assume language specific tree nodes can
6909 be expanded in some interesting way. */
6910 gcc_assert (TREE_CODE (exp) < LAST_AND_UNUSED_TREE_CODE);
6912 || TREE_CODE (exp) == CONSTRUCTOR
6913 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
6915 result = expand_expr (exp, target, tmode,
6916 modifier == EXPAND_INITIALIZER
6917 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
6919 /* If the DECL isn't in memory, then the DECL wasn't properly
6920 marked TREE_ADDRESSABLE, which will be either a front-end
6921 or a tree optimizer bug. */
6922 gcc_assert (MEM_P (result));
6923 result = XEXP (result, 0);
6925 /* ??? Is this needed anymore? */
6926 if (DECL_P (exp) && !TREE_USED (exp) == 0)
6928 assemble_external (exp);
6929 TREE_USED (exp) = 1;
6932 if (modifier != EXPAND_INITIALIZER
6933 && modifier != EXPAND_CONST_ADDRESS)
6934 result = force_operand (result, target);
6938 /* Pass FALSE as the last argument to get_inner_reference although
6939 we are expanding to RTL. The rationale is that we know how to
6940 handle "aligning nodes" here: we can just bypass them because
6941 they won't change the final object whose address will be returned
6942 (they actually exist only for that purpose). */
6943 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6944 &mode1, &unsignedp, &volatilep, false);
6948 /* We must have made progress. */
6949 gcc_assert (inner != exp);
6951 subtarget = offset || bitpos ? NULL_RTX : target;
6952 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
6953 inner alignment, force the inner to be sufficiently aligned. */
6954 if (CONSTANT_CLASS_P (inner)
6955 && TYPE_ALIGN (TREE_TYPE (inner)) < TYPE_ALIGN (TREE_TYPE (exp)))
6957 inner = copy_node (inner);
6958 TREE_TYPE (inner) = copy_node (TREE_TYPE (inner));
6959 TYPE_ALIGN (TREE_TYPE (inner)) = TYPE_ALIGN (TREE_TYPE (exp));
6960 TYPE_USER_ALIGN (TREE_TYPE (inner)) = 1;
6962 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier, as);
6968 if (modifier != EXPAND_NORMAL)
6969 result = force_operand (result, NULL);
6970 tmp = expand_expr (offset, NULL_RTX, tmode,
6971 modifier == EXPAND_INITIALIZER
6972 ? EXPAND_INITIALIZER : EXPAND_NORMAL);
6974 result = convert_memory_address_addr_space (tmode, result, as);
6975 tmp = convert_memory_address_addr_space (tmode, tmp, as);
6977 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
6978 result = simplify_gen_binary (PLUS, tmode, result, tmp);
6981 subtarget = bitpos ? NULL_RTX : target;
6982 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
6983 1, OPTAB_LIB_WIDEN);
6989 /* Someone beforehand should have rejected taking the address
6990 of such an object. */
6991 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
6993 result = plus_constant (result, bitpos / BITS_PER_UNIT);
6994 if (modifier < EXPAND_SUM)
6995 result = force_operand (result, target);
7001 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
7002 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7005 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
7006 enum expand_modifier modifier)
7008 addr_space_t as = ADDR_SPACE_GENERIC;
7009 enum machine_mode address_mode = Pmode;
7010 enum machine_mode pointer_mode = ptr_mode;
7011 enum machine_mode rmode;
7014 /* Target mode of VOIDmode says "whatever's natural". */
7015 if (tmode == VOIDmode)
7016 tmode = TYPE_MODE (TREE_TYPE (exp));
7018 if (POINTER_TYPE_P (TREE_TYPE (exp)))
7020 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
7021 address_mode = targetm.addr_space.address_mode (as);
7022 pointer_mode = targetm.addr_space.pointer_mode (as);
7025 /* We can get called with some Weird Things if the user does silliness
7026 like "(short) &a". In that case, convert_memory_address won't do
7027 the right thing, so ignore the given target mode. */
7028 if (tmode != address_mode && tmode != pointer_mode)
7029 tmode = address_mode;
7031 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
7032 tmode, modifier, as);
7034 /* Despite expand_expr claims concerning ignoring TMODE when not
7035 strictly convenient, stuff breaks if we don't honor it. Note
7036 that combined with the above, we only do this for pointer modes. */
7037 rmode = GET_MODE (result);
7038 if (rmode == VOIDmode)
7041 result = convert_memory_address_addr_space (tmode, result, as);
7046 /* Generate code for computing CONSTRUCTOR EXP.
7047 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7048 is TRUE, instead of creating a temporary variable in memory
7049 NULL is returned and the caller needs to handle it differently. */
7052 expand_constructor (tree exp, rtx target, enum expand_modifier modifier,
7053 bool avoid_temp_mem)
7055 tree type = TREE_TYPE (exp);
7056 enum machine_mode mode = TYPE_MODE (type);
7058 /* Try to avoid creating a temporary at all. This is possible
7059 if all of the initializer is zero.
7060 FIXME: try to handle all [0..255] initializers we can handle
7062 if (TREE_STATIC (exp)
7063 && !TREE_ADDRESSABLE (exp)
7064 && target != 0 && mode == BLKmode
7065 && all_zeros_p (exp))
7067 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
7071 /* All elts simple constants => refer to a constant in memory. But
7072 if this is a non-BLKmode mode, let it store a field at a time
7073 since that should make a CONST_INT or CONST_DOUBLE when we
7074 fold. Likewise, if we have a target we can use, it is best to
7075 store directly into the target unless the type is large enough
7076 that memcpy will be used. If we are making an initializer and
7077 all operands are constant, put it in memory as well.
7079 FIXME: Avoid trying to fill vector constructors piece-meal.
7080 Output them with output_constant_def below unless we're sure
7081 they're zeros. This should go away when vector initializers
7082 are treated like VECTOR_CST instead of arrays. */
7083 if ((TREE_STATIC (exp)
7084 && ((mode == BLKmode
7085 && ! (target != 0 && safe_from_p (target, exp, 1)))
7086 || TREE_ADDRESSABLE (exp)
7087 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7088 && (! MOVE_BY_PIECES_P
7089 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7091 && ! mostly_zeros_p (exp))))
7092 || ((modifier == EXPAND_INITIALIZER || modifier == EXPAND_CONST_ADDRESS)
7093 && TREE_CONSTANT (exp)))
7100 constructor = expand_expr_constant (exp, 1, modifier);
7102 if (modifier != EXPAND_CONST_ADDRESS
7103 && modifier != EXPAND_INITIALIZER
7104 && modifier != EXPAND_SUM)
7105 constructor = validize_mem (constructor);
7110 /* Handle calls that pass values in multiple non-contiguous
7111 locations. The Irix 6 ABI has examples of this. */
7112 if (target == 0 || ! safe_from_p (target, exp, 1)
7113 || GET_CODE (target) == PARALLEL || modifier == EXPAND_STACK_PARM)
7119 = assign_temp (build_qualified_type (type, (TYPE_QUALS (type)
7120 | (TREE_READONLY (exp)
7121 * TYPE_QUAL_CONST))),
7122 0, TREE_ADDRESSABLE (exp), 1);
7125 store_constructor (exp, target, 0, int_expr_size (exp));
7130 /* expand_expr: generate code for computing expression EXP.
7131 An rtx for the computed value is returned. The value is never null.
7132 In the case of a void EXP, const0_rtx is returned.
7134 The value may be stored in TARGET if TARGET is nonzero.
7135 TARGET is just a suggestion; callers must assume that
7136 the rtx returned may not be the same as TARGET.
7138 If TARGET is CONST0_RTX, it means that the value will be ignored.
7140 If TMODE is not VOIDmode, it suggests generating the
7141 result in mode TMODE. But this is done only when convenient.
7142 Otherwise, TMODE is ignored and the value generated in its natural mode.
7143 TMODE is just a suggestion; callers must assume that
7144 the rtx returned may not have mode TMODE.
7146 Note that TARGET may have neither TMODE nor MODE. In that case, it
7147 probably will not be used.
7149 If MODIFIER is EXPAND_SUM then when EXP is an addition
7150 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7151 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7152 products as above, or REG or MEM, or constant.
7153 Ordinarily in such cases we would output mul or add instructions
7154 and then return a pseudo reg containing the sum.
7156 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7157 it also marks a label as absolutely required (it can't be dead).
7158 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7159 This is used for outputting expressions used in initializers.
7161 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7162 with a constant address even if that address is not normally legitimate.
7163 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7165 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7166 a call parameter. Such targets require special care as we haven't yet
7167 marked TARGET so that it's safe from being trashed by libcalls. We
7168 don't want to use TARGET for anything but the final result;
7169 Intermediate values must go elsewhere. Additionally, calls to
7170 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7172 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7173 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7174 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7175 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7179 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
7180 enum expand_modifier modifier, rtx *alt_rtl)
7184 /* Handle ERROR_MARK before anybody tries to access its type. */
7185 if (TREE_CODE (exp) == ERROR_MARK
7186 || (TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK))
7188 ret = CONST0_RTX (tmode);
7189 return ret ? ret : const0_rtx;
7192 /* If this is an expression of some kind and it has an associated line
7193 number, then emit the line number before expanding the expression.
7195 We need to save and restore the file and line information so that
7196 errors discovered during expansion are emitted with the right
7197 information. It would be better of the diagnostic routines
7198 used the file/line information embedded in the tree nodes rather
7200 if (cfun && EXPR_HAS_LOCATION (exp))
7202 location_t saved_location = input_location;
7203 location_t saved_curr_loc = get_curr_insn_source_location ();
7204 tree saved_block = get_curr_insn_block ();
7205 input_location = EXPR_LOCATION (exp);
7206 set_curr_insn_source_location (input_location);
7208 /* Record where the insns produced belong. */
7209 set_curr_insn_block (TREE_BLOCK (exp));
7211 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7213 input_location = saved_location;
7214 set_curr_insn_block (saved_block);
7215 set_curr_insn_source_location (saved_curr_loc);
7219 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7226 expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
7227 enum expand_modifier modifier)
7229 rtx op0, op1, op2, temp;
7232 enum machine_mode mode;
7233 enum tree_code code = ops->code;
7235 rtx subtarget, original_target;
7237 bool reduce_bit_field;
7238 location_t loc = ops->location;
7239 tree treeop0, treeop1, treeop2;
7240 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
7241 ? reduce_to_bit_field_precision ((expr), \
7247 mode = TYPE_MODE (type);
7248 unsignedp = TYPE_UNSIGNED (type);
7254 /* We should be called only on simple (binary or unary) expressions,
7255 exactly those that are valid in gimple expressions that aren't
7256 GIMPLE_SINGLE_RHS (or invalid). */
7257 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS
7258 || get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS
7259 || get_gimple_rhs_class (code) == GIMPLE_TERNARY_RHS);
7261 ignore = (target == const0_rtx
7262 || ((CONVERT_EXPR_CODE_P (code)
7263 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
7264 && TREE_CODE (type) == VOID_TYPE));
7266 /* We should be called only if we need the result. */
7267 gcc_assert (!ignore);
7269 /* An operation in what may be a bit-field type needs the
7270 result to be reduced to the precision of the bit-field type,
7271 which is narrower than that of the type's mode. */
7272 reduce_bit_field = (TREE_CODE (type) == INTEGER_TYPE
7273 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
7275 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
7278 /* Use subtarget as the target for operand 0 of a binary operation. */
7279 subtarget = get_subtarget (target);
7280 original_target = target;
7284 case NON_LVALUE_EXPR:
7287 if (treeop0 == error_mark_node)
7290 if (TREE_CODE (type) == UNION_TYPE)
7292 tree valtype = TREE_TYPE (treeop0);
7294 /* If both input and output are BLKmode, this conversion isn't doing
7295 anything except possibly changing memory attribute. */
7296 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7298 rtx result = expand_expr (treeop0, target, tmode,
7301 result = copy_rtx (result);
7302 set_mem_attributes (result, type, 0);
7308 if (TYPE_MODE (type) != BLKmode)
7309 target = gen_reg_rtx (TYPE_MODE (type));
7311 target = assign_temp (type, 0, 1, 1);
7315 /* Store data into beginning of memory target. */
7316 store_expr (treeop0,
7317 adjust_address (target, TYPE_MODE (valtype), 0),
7318 modifier == EXPAND_STACK_PARM,
7323 gcc_assert (REG_P (target));
7325 /* Store this field into a union of the proper type. */
7326 store_field (target,
7327 MIN ((int_size_in_bytes (TREE_TYPE
7330 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7331 0, TYPE_MODE (valtype), treeop0,
7335 /* Return the entire union. */
7339 if (mode == TYPE_MODE (TREE_TYPE (treeop0)))
7341 op0 = expand_expr (treeop0, target, VOIDmode,
7344 /* If the signedness of the conversion differs and OP0 is
7345 a promoted SUBREG, clear that indication since we now
7346 have to do the proper extension. */
7347 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)) != unsignedp
7348 && GET_CODE (op0) == SUBREG)
7349 SUBREG_PROMOTED_VAR_P (op0) = 0;
7351 return REDUCE_BIT_FIELD (op0);
7354 op0 = expand_expr (treeop0, NULL_RTX, mode,
7355 modifier == EXPAND_SUM ? EXPAND_NORMAL : modifier);
7356 if (GET_MODE (op0) == mode)
7359 /* If OP0 is a constant, just convert it into the proper mode. */
7360 else if (CONSTANT_P (op0))
7362 tree inner_type = TREE_TYPE (treeop0);
7363 enum machine_mode inner_mode = GET_MODE (op0);
7365 if (inner_mode == VOIDmode)
7366 inner_mode = TYPE_MODE (inner_type);
7368 if (modifier == EXPAND_INITIALIZER)
7369 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7370 subreg_lowpart_offset (mode,
7373 op0= convert_modes (mode, inner_mode, op0,
7374 TYPE_UNSIGNED (inner_type));
7377 else if (modifier == EXPAND_INITIALIZER)
7378 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7380 else if (target == 0)
7381 op0 = convert_to_mode (mode, op0,
7382 TYPE_UNSIGNED (TREE_TYPE
7386 convert_move (target, op0,
7387 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7391 return REDUCE_BIT_FIELD (op0);
7393 case ADDR_SPACE_CONVERT_EXPR:
7395 tree treeop0_type = TREE_TYPE (treeop0);
7397 addr_space_t as_from;
7399 gcc_assert (POINTER_TYPE_P (type));
7400 gcc_assert (POINTER_TYPE_P (treeop0_type));
7402 as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
7403 as_from = TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type));
7405 /* Conversions between pointers to the same address space should
7406 have been implemented via CONVERT_EXPR / NOP_EXPR. */
7407 gcc_assert (as_to != as_from);
7409 /* Ask target code to handle conversion between pointers
7410 to overlapping address spaces. */
7411 if (targetm.addr_space.subset_p (as_to, as_from)
7412 || targetm.addr_space.subset_p (as_from, as_to))
7414 op0 = expand_expr (treeop0, NULL_RTX, VOIDmode, modifier);
7415 op0 = targetm.addr_space.convert (op0, treeop0_type, type);
7420 /* For disjoint address spaces, converting anything but
7421 a null pointer invokes undefined behaviour. We simply
7422 always return a null pointer here. */
7423 return CONST0_RTX (mode);
7426 case POINTER_PLUS_EXPR:
7427 /* Even though the sizetype mode and the pointer's mode can be different
7428 expand is able to handle this correctly and get the correct result out
7429 of the PLUS_EXPR code. */
7430 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
7431 if sizetype precision is smaller than pointer precision. */
7432 if (TYPE_PRECISION (sizetype) < TYPE_PRECISION (type))
7433 treeop1 = fold_convert_loc (loc, type,
7434 fold_convert_loc (loc, ssizetype,
7437 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7438 something else, make sure we add the register to the constant and
7439 then to the other thing. This case can occur during strength
7440 reduction and doing it this way will produce better code if the
7441 frame pointer or argument pointer is eliminated.
7443 fold-const.c will ensure that the constant is always in the inner
7444 PLUS_EXPR, so the only case we need to do anything about is if
7445 sp, ap, or fp is our second argument, in which case we must swap
7446 the innermost first argument and our second argument. */
7448 if (TREE_CODE (treeop0) == PLUS_EXPR
7449 && TREE_CODE (TREE_OPERAND (treeop0, 1)) == INTEGER_CST
7450 && TREE_CODE (treeop1) == VAR_DECL
7451 && (DECL_RTL (treeop1) == frame_pointer_rtx
7452 || DECL_RTL (treeop1) == stack_pointer_rtx
7453 || DECL_RTL (treeop1) == arg_pointer_rtx))
7457 treeop1 = TREE_OPERAND (treeop0, 0);
7458 TREE_OPERAND (treeop0, 0) = t;
7461 /* If the result is to be ptr_mode and we are adding an integer to
7462 something, we might be forming a constant. So try to use
7463 plus_constant. If it produces a sum and we can't accept it,
7464 use force_operand. This allows P = &ARR[const] to generate
7465 efficient code on machines where a SYMBOL_REF is not a valid
7468 If this is an EXPAND_SUM call, always return the sum. */
7469 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7470 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7472 if (modifier == EXPAND_STACK_PARM)
7474 if (TREE_CODE (treeop0) == INTEGER_CST
7475 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7476 && TREE_CONSTANT (treeop1))
7480 op1 = expand_expr (treeop1, subtarget, VOIDmode,
7482 /* Use immed_double_const to ensure that the constant is
7483 truncated according to the mode of OP1, then sign extended
7484 to a HOST_WIDE_INT. Using the constant directly can result
7485 in non-canonical RTL in a 64x32 cross compile. */
7487 = immed_double_const (TREE_INT_CST_LOW (treeop0),
7489 TYPE_MODE (TREE_TYPE (treeop1)));
7490 op1 = plus_constant (op1, INTVAL (constant_part));
7491 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7492 op1 = force_operand (op1, target);
7493 return REDUCE_BIT_FIELD (op1);
7496 else if (TREE_CODE (treeop1) == INTEGER_CST
7497 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7498 && TREE_CONSTANT (treeop0))
7502 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7503 (modifier == EXPAND_INITIALIZER
7504 ? EXPAND_INITIALIZER : EXPAND_SUM));
7505 if (! CONSTANT_P (op0))
7507 op1 = expand_expr (treeop1, NULL_RTX,
7508 VOIDmode, modifier);
7509 /* Return a PLUS if modifier says it's OK. */
7510 if (modifier == EXPAND_SUM
7511 || modifier == EXPAND_INITIALIZER)
7512 return simplify_gen_binary (PLUS, mode, op0, op1);
7515 /* Use immed_double_const to ensure that the constant is
7516 truncated according to the mode of OP1, then sign extended
7517 to a HOST_WIDE_INT. Using the constant directly can result
7518 in non-canonical RTL in a 64x32 cross compile. */
7520 = immed_double_const (TREE_INT_CST_LOW (treeop1),
7522 TYPE_MODE (TREE_TYPE (treeop0)));
7523 op0 = plus_constant (op0, INTVAL (constant_part));
7524 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7525 op0 = force_operand (op0, target);
7526 return REDUCE_BIT_FIELD (op0);
7530 /* Use TER to expand pointer addition of a negated value
7531 as pointer subtraction. */
7532 if ((POINTER_TYPE_P (TREE_TYPE (treeop0))
7533 || (TREE_CODE (TREE_TYPE (treeop0)) == VECTOR_TYPE
7534 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0)))))
7535 && TREE_CODE (treeop1) == SSA_NAME
7536 && TYPE_MODE (TREE_TYPE (treeop0))
7537 == TYPE_MODE (TREE_TYPE (treeop1)))
7539 gimple def = get_def_for_expr (treeop1, NEGATE_EXPR);
7542 treeop1 = gimple_assign_rhs1 (def);
7548 /* No sense saving up arithmetic to be done
7549 if it's all in the wrong mode to form part of an address.
7550 And force_operand won't know whether to sign-extend or
7552 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7553 || mode != ptr_mode)
7555 expand_operands (treeop0, treeop1,
7556 subtarget, &op0, &op1, EXPAND_NORMAL);
7557 if (op0 == const0_rtx)
7559 if (op1 == const0_rtx)
7564 expand_operands (treeop0, treeop1,
7565 subtarget, &op0, &op1, modifier);
7566 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7570 /* For initializers, we are allowed to return a MINUS of two
7571 symbolic constants. Here we handle all cases when both operands
7573 /* Handle difference of two symbolic constants,
7574 for the sake of an initializer. */
7575 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7576 && really_constant_p (treeop0)
7577 && really_constant_p (treeop1))
7579 expand_operands (treeop0, treeop1,
7580 NULL_RTX, &op0, &op1, modifier);
7582 /* If the last operand is a CONST_INT, use plus_constant of
7583 the negated constant. Else make the MINUS. */
7584 if (CONST_INT_P (op1))
7585 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7587 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7590 /* No sense saving up arithmetic to be done
7591 if it's all in the wrong mode to form part of an address.
7592 And force_operand won't know whether to sign-extend or
7594 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7595 || mode != ptr_mode)
7598 expand_operands (treeop0, treeop1,
7599 subtarget, &op0, &op1, modifier);
7601 /* Convert A - const to A + (-const). */
7602 if (CONST_INT_P (op1))
7604 op1 = negate_rtx (mode, op1);
7605 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7610 case WIDEN_MULT_PLUS_EXPR:
7611 case WIDEN_MULT_MINUS_EXPR:
7612 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
7613 op2 = expand_normal (treeop2);
7614 target = expand_widen_pattern_expr (ops, op0, op1, op2,
7618 case WIDEN_MULT_EXPR:
7619 /* If first operand is constant, swap them.
7620 Thus the following special case checks need only
7621 check the second operand. */
7622 if (TREE_CODE (treeop0) == INTEGER_CST)
7629 /* First, check if we have a multiplication of one signed and one
7630 unsigned operand. */
7631 if (TREE_CODE (treeop1) != INTEGER_CST
7632 && (TYPE_UNSIGNED (TREE_TYPE (treeop0))
7633 != TYPE_UNSIGNED (TREE_TYPE (treeop1))))
7635 enum machine_mode innermode = TYPE_MODE (TREE_TYPE (treeop0));
7636 this_optab = usmul_widen_optab;
7637 if (mode == GET_MODE_2XWIDER_MODE (innermode))
7639 if (optab_handler (this_optab, mode) != CODE_FOR_nothing)
7641 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7642 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
7645 expand_operands (treeop0, treeop1, NULL_RTX, &op1, &op0,
7651 /* Check for a multiplication with matching signedness. */
7652 else if ((TREE_CODE (treeop1) == INTEGER_CST
7653 && int_fits_type_p (treeop1, TREE_TYPE (treeop0)))
7654 || (TYPE_UNSIGNED (TREE_TYPE (treeop1))
7655 == TYPE_UNSIGNED (TREE_TYPE (treeop0))))
7657 tree op0type = TREE_TYPE (treeop0);
7658 enum machine_mode innermode = TYPE_MODE (op0type);
7659 bool zextend_p = TYPE_UNSIGNED (op0type);
7660 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7661 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7663 if (mode == GET_MODE_2XWIDER_MODE (innermode)
7664 && TREE_CODE (treeop0) != INTEGER_CST)
7666 if (optab_handler (this_optab, mode) != CODE_FOR_nothing)
7668 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
7670 temp = expand_widening_mult (mode, op0, op1, target,
7671 unsignedp, this_optab);
7672 return REDUCE_BIT_FIELD (temp);
7674 if (optab_handler (other_optab, mode) != CODE_FOR_nothing
7675 && innermode == word_mode)
7678 op0 = expand_normal (treeop0);
7679 if (TREE_CODE (treeop1) == INTEGER_CST)
7680 op1 = convert_modes (innermode, mode,
7681 expand_normal (treeop1), unsignedp);
7683 op1 = expand_normal (treeop1);
7684 temp = expand_binop (mode, other_optab, op0, op1, target,
7685 unsignedp, OPTAB_LIB_WIDEN);
7686 hipart = gen_highpart (innermode, temp);
7687 htem = expand_mult_highpart_adjust (innermode, hipart,
7691 emit_move_insn (hipart, htem);
7692 return REDUCE_BIT_FIELD (temp);
7696 treeop0 = fold_build1 (CONVERT_EXPR, type, treeop0);
7697 treeop1 = fold_build1 (CONVERT_EXPR, type, treeop1);
7698 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
7699 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7703 optab opt = fma_optab;
7706 /* If there is no insn for FMA, emit it as __builtin_fma{,f,l}
7708 if (optab_handler (fma_optab, mode) == CODE_FOR_nothing)
7710 tree fn = mathfn_built_in (TREE_TYPE (treeop0), BUILT_IN_FMA);
7713 gcc_assert (fn != NULL_TREE);
7714 call_expr = build_call_expr (fn, 3, treeop0, treeop1, treeop2);
7715 return expand_builtin (call_expr, target, subtarget, mode, false);
7718 def0 = get_def_for_expr (treeop0, NEGATE_EXPR);
7719 def2 = get_def_for_expr (treeop2, NEGATE_EXPR);
7724 && optab_handler (fnms_optab, mode) != CODE_FOR_nothing)
7727 op0 = expand_normal (gimple_assign_rhs1 (def0));
7728 op2 = expand_normal (gimple_assign_rhs1 (def2));
7731 && optab_handler (fnma_optab, mode) != CODE_FOR_nothing)
7734 op0 = expand_normal (gimple_assign_rhs1 (def0));
7737 && optab_handler (fms_optab, mode) != CODE_FOR_nothing)
7740 op2 = expand_normal (gimple_assign_rhs1 (def2));
7744 op0 = expand_expr (treeop0, subtarget, VOIDmode, EXPAND_NORMAL);
7746 op2 = expand_normal (treeop2);
7747 op1 = expand_normal (treeop1);
7749 return expand_ternary_op (TYPE_MODE (type), opt,
7750 op0, op1, op2, target, 0);
7754 /* If this is a fixed-point operation, then we cannot use the code
7755 below because "expand_mult" doesn't support sat/no-sat fixed-point
7757 if (ALL_FIXED_POINT_MODE_P (mode))
7760 /* If first operand is constant, swap them.
7761 Thus the following special case checks need only
7762 check the second operand. */
7763 if (TREE_CODE (treeop0) == INTEGER_CST)
7770 /* Attempt to return something suitable for generating an
7771 indexed address, for machines that support that. */
7773 if (modifier == EXPAND_SUM && mode == ptr_mode
7774 && host_integerp (treeop1, 0))
7776 tree exp1 = treeop1;
7778 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7782 op0 = force_operand (op0, NULL_RTX);
7784 op0 = copy_to_mode_reg (mode, op0);
7786 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7787 gen_int_mode (tree_low_cst (exp1, 0),
7788 TYPE_MODE (TREE_TYPE (exp1)))));
7791 if (modifier == EXPAND_STACK_PARM)
7794 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
7795 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7797 case TRUNC_DIV_EXPR:
7798 case FLOOR_DIV_EXPR:
7800 case ROUND_DIV_EXPR:
7801 case EXACT_DIV_EXPR:
7802 /* If this is a fixed-point operation, then we cannot use the code
7803 below because "expand_divmod" doesn't support sat/no-sat fixed-point
7805 if (ALL_FIXED_POINT_MODE_P (mode))
7808 if (modifier == EXPAND_STACK_PARM)
7810 /* Possible optimization: compute the dividend with EXPAND_SUM
7811 then if the divisor is constant can optimize the case
7812 where some terms of the dividend have coeffs divisible by it. */
7813 expand_operands (treeop0, treeop1,
7814 subtarget, &op0, &op1, EXPAND_NORMAL);
7815 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7820 case TRUNC_MOD_EXPR:
7821 case FLOOR_MOD_EXPR:
7823 case ROUND_MOD_EXPR:
7824 if (modifier == EXPAND_STACK_PARM)
7826 expand_operands (treeop0, treeop1,
7827 subtarget, &op0, &op1, EXPAND_NORMAL);
7828 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7830 case FIXED_CONVERT_EXPR:
7831 op0 = expand_normal (treeop0);
7832 if (target == 0 || modifier == EXPAND_STACK_PARM)
7833 target = gen_reg_rtx (mode);
7835 if ((TREE_CODE (TREE_TYPE (treeop0)) == INTEGER_TYPE
7836 && TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7837 || (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type)))
7838 expand_fixed_convert (target, op0, 1, TYPE_SATURATING (type));
7840 expand_fixed_convert (target, op0, 0, TYPE_SATURATING (type));
7843 case FIX_TRUNC_EXPR:
7844 op0 = expand_normal (treeop0);
7845 if (target == 0 || modifier == EXPAND_STACK_PARM)
7846 target = gen_reg_rtx (mode);
7847 expand_fix (target, op0, unsignedp);
7851 op0 = expand_normal (treeop0);
7852 if (target == 0 || modifier == EXPAND_STACK_PARM)
7853 target = gen_reg_rtx (mode);
7854 /* expand_float can't figure out what to do if FROM has VOIDmode.
7855 So give it the correct mode. With -O, cse will optimize this. */
7856 if (GET_MODE (op0) == VOIDmode)
7857 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0)),
7859 expand_float (target, op0,
7860 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7864 op0 = expand_expr (treeop0, subtarget,
7865 VOIDmode, EXPAND_NORMAL);
7866 if (modifier == EXPAND_STACK_PARM)
7868 temp = expand_unop (mode,
7869 optab_for_tree_code (NEGATE_EXPR, type,
7873 return REDUCE_BIT_FIELD (temp);
7876 op0 = expand_expr (treeop0, subtarget,
7877 VOIDmode, EXPAND_NORMAL);
7878 if (modifier == EXPAND_STACK_PARM)
7881 /* ABS_EXPR is not valid for complex arguments. */
7882 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7883 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
7885 /* Unsigned abs is simply the operand. Testing here means we don't
7886 risk generating incorrect code below. */
7887 if (TYPE_UNSIGNED (type))
7890 return expand_abs (mode, op0, target, unsignedp,
7891 safe_from_p (target, treeop0, 1));
7895 target = original_target;
7897 || modifier == EXPAND_STACK_PARM
7898 || (MEM_P (target) && MEM_VOLATILE_P (target))
7899 || GET_MODE (target) != mode
7901 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7902 target = gen_reg_rtx (mode);
7903 expand_operands (treeop0, treeop1,
7904 target, &op0, &op1, EXPAND_NORMAL);
7906 /* First try to do it with a special MIN or MAX instruction.
7907 If that does not win, use a conditional jump to select the proper
7909 this_optab = optab_for_tree_code (code, type, optab_default);
7910 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7915 /* At this point, a MEM target is no longer useful; we will get better
7918 if (! REG_P (target))
7919 target = gen_reg_rtx (mode);
7921 /* If op1 was placed in target, swap op0 and op1. */
7922 if (target != op0 && target == op1)
7929 /* We generate better code and avoid problems with op1 mentioning
7930 target by forcing op1 into a pseudo if it isn't a constant. */
7931 if (! CONSTANT_P (op1))
7932 op1 = force_reg (mode, op1);
7935 enum rtx_code comparison_code;
7938 if (code == MAX_EXPR)
7939 comparison_code = unsignedp ? GEU : GE;
7941 comparison_code = unsignedp ? LEU : LE;
7943 /* Canonicalize to comparisons against 0. */
7944 if (op1 == const1_rtx)
7946 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
7947 or (a != 0 ? a : 1) for unsigned.
7948 For MIN we are safe converting (a <= 1 ? a : 1)
7949 into (a <= 0 ? a : 1) */
7950 cmpop1 = const0_rtx;
7951 if (code == MAX_EXPR)
7952 comparison_code = unsignedp ? NE : GT;
7954 if (op1 == constm1_rtx && !unsignedp)
7956 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
7957 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
7958 cmpop1 = const0_rtx;
7959 if (code == MIN_EXPR)
7960 comparison_code = LT;
7962 #ifdef HAVE_conditional_move
7963 /* Use a conditional move if possible. */
7964 if (can_conditionally_move_p (mode))
7968 /* ??? Same problem as in expmed.c: emit_conditional_move
7969 forces a stack adjustment via compare_from_rtx, and we
7970 lose the stack adjustment if the sequence we are about
7971 to create is discarded. */
7972 do_pending_stack_adjust ();
7976 /* Try to emit the conditional move. */
7977 insn = emit_conditional_move (target, comparison_code,
7982 /* If we could do the conditional move, emit the sequence,
7986 rtx seq = get_insns ();
7992 /* Otherwise discard the sequence and fall back to code with
7998 emit_move_insn (target, op0);
8000 temp = gen_label_rtx ();
8001 do_compare_rtx_and_jump (target, cmpop1, comparison_code,
8002 unsignedp, mode, NULL_RTX, NULL_RTX, temp,
8005 emit_move_insn (target, op1);
8010 op0 = expand_expr (treeop0, subtarget,
8011 VOIDmode, EXPAND_NORMAL);
8012 if (modifier == EXPAND_STACK_PARM)
8014 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8018 /* ??? Can optimize bitwise operations with one arg constant.
8019 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8020 and (a bitwise1 b) bitwise2 b (etc)
8021 but that is probably not worth while. */
8023 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8024 boolean values when we want in all cases to compute both of them. In
8025 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8026 as actual zero-or-1 values and then bitwise anding. In cases where
8027 there cannot be any side effects, better code would be made by
8028 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8029 how to recognize those cases. */
8031 case TRUTH_AND_EXPR:
8032 code = BIT_AND_EXPR;
8037 code = BIT_IOR_EXPR;
8041 case TRUTH_XOR_EXPR:
8042 code = BIT_XOR_EXPR;
8048 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type))
8049 || (GET_MODE_PRECISION (TYPE_MODE (type))
8050 == TYPE_PRECISION (type)));
8055 /* If this is a fixed-point operation, then we cannot use the code
8056 below because "expand_shift" doesn't support sat/no-sat fixed-point
8058 if (ALL_FIXED_POINT_MODE_P (mode))
8061 if (! safe_from_p (subtarget, treeop1, 1))
8063 if (modifier == EXPAND_STACK_PARM)
8065 op0 = expand_expr (treeop0, subtarget,
8066 VOIDmode, EXPAND_NORMAL);
8067 temp = expand_shift (code, mode, op0, treeop1, target,
8069 if (code == LSHIFT_EXPR)
8070 temp = REDUCE_BIT_FIELD (temp);
8073 /* Could determine the answer when only additive constants differ. Also,
8074 the addition of one can be handled by changing the condition. */
8081 case UNORDERED_EXPR:
8089 temp = do_store_flag (ops,
8090 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8091 tmode != VOIDmode ? tmode : mode);
8095 /* Use a compare and a jump for BLKmode comparisons, or for function
8096 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8099 || modifier == EXPAND_STACK_PARM
8100 || ! safe_from_p (target, treeop0, 1)
8101 || ! safe_from_p (target, treeop1, 1)
8102 /* Make sure we don't have a hard reg (such as function's return
8103 value) live across basic blocks, if not optimizing. */
8104 || (!optimize && REG_P (target)
8105 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8106 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8108 emit_move_insn (target, const0_rtx);
8110 op1 = gen_label_rtx ();
8111 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
8113 emit_move_insn (target, const1_rtx);
8118 case TRUTH_NOT_EXPR:
8119 if (modifier == EXPAND_STACK_PARM)
8121 op0 = expand_expr (treeop0, target,
8122 VOIDmode, EXPAND_NORMAL);
8123 /* The parser is careful to generate TRUTH_NOT_EXPR
8124 only with operands that are always zero or one. */
8125 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8126 target, 1, OPTAB_LIB_WIDEN);
8131 /* Get the rtx code of the operands. */
8132 op0 = expand_normal (treeop0);
8133 op1 = expand_normal (treeop1);
8136 target = gen_reg_rtx (TYPE_MODE (type));
8138 /* Move the real (op0) and imaginary (op1) parts to their location. */
8139 write_complex_part (target, op0, false);
8140 write_complex_part (target, op1, true);
8144 case WIDEN_SUM_EXPR:
8146 tree oprnd0 = treeop0;
8147 tree oprnd1 = treeop1;
8149 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8150 target = expand_widen_pattern_expr (ops, op0, NULL_RTX, op1,
8155 case REDUC_MAX_EXPR:
8156 case REDUC_MIN_EXPR:
8157 case REDUC_PLUS_EXPR:
8159 op0 = expand_normal (treeop0);
8160 this_optab = optab_for_tree_code (code, type, optab_default);
8161 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8166 case VEC_EXTRACT_EVEN_EXPR:
8167 case VEC_EXTRACT_ODD_EXPR:
8169 expand_operands (treeop0, treeop1,
8170 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8171 this_optab = optab_for_tree_code (code, type, optab_default);
8172 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8178 case VEC_INTERLEAVE_HIGH_EXPR:
8179 case VEC_INTERLEAVE_LOW_EXPR:
8181 expand_operands (treeop0, treeop1,
8182 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8183 this_optab = optab_for_tree_code (code, type, optab_default);
8184 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8190 case VEC_LSHIFT_EXPR:
8191 case VEC_RSHIFT_EXPR:
8193 target = expand_vec_shift_expr (ops, target);
8197 case VEC_UNPACK_HI_EXPR:
8198 case VEC_UNPACK_LO_EXPR:
8200 op0 = expand_normal (treeop0);
8201 temp = expand_widen_pattern_expr (ops, op0, NULL_RTX, NULL_RTX,
8207 case VEC_UNPACK_FLOAT_HI_EXPR:
8208 case VEC_UNPACK_FLOAT_LO_EXPR:
8210 op0 = expand_normal (treeop0);
8211 /* The signedness is determined from input operand. */
8212 temp = expand_widen_pattern_expr
8213 (ops, op0, NULL_RTX, NULL_RTX,
8214 target, TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8220 case VEC_WIDEN_MULT_HI_EXPR:
8221 case VEC_WIDEN_MULT_LO_EXPR:
8223 tree oprnd0 = treeop0;
8224 tree oprnd1 = treeop1;
8226 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8227 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8229 gcc_assert (target);
8233 case VEC_PACK_TRUNC_EXPR:
8234 case VEC_PACK_SAT_EXPR:
8235 case VEC_PACK_FIX_TRUNC_EXPR:
8236 mode = TYPE_MODE (TREE_TYPE (treeop0));
8241 tree oprnd0 = treeop0;
8242 tree oprnd1 = treeop1;
8243 tree oprnd2 = treeop2;
8246 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8247 op2 = expand_normal (oprnd2);
8248 target = expand_widen_pattern_expr (ops, op0, op1, op2,
8253 case REALIGN_LOAD_EXPR:
8255 tree oprnd0 = treeop0;
8256 tree oprnd1 = treeop1;
8257 tree oprnd2 = treeop2;
8260 this_optab = optab_for_tree_code (code, type, optab_default);
8261 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8262 op2 = expand_normal (oprnd2);
8263 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
8273 /* Here to do an ordinary binary operator. */
8275 expand_operands (treeop0, treeop1,
8276 subtarget, &op0, &op1, EXPAND_NORMAL);
8278 this_optab = optab_for_tree_code (code, type, optab_default);
8280 if (modifier == EXPAND_STACK_PARM)
8282 temp = expand_binop (mode, this_optab, op0, op1, target,
8283 unsignedp, OPTAB_LIB_WIDEN);
8285 return REDUCE_BIT_FIELD (temp);
8287 #undef REDUCE_BIT_FIELD
8290 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
8291 enum expand_modifier modifier, rtx *alt_rtl)
8293 rtx op0, op1, temp, decl_rtl;
8296 enum machine_mode mode;
8297 enum tree_code code = TREE_CODE (exp);
8298 rtx subtarget, original_target;
8301 bool reduce_bit_field;
8302 location_t loc = EXPR_LOCATION (exp);
8303 struct separate_ops ops;
8304 tree treeop0, treeop1, treeop2;
8305 tree ssa_name = NULL_TREE;
8308 type = TREE_TYPE (exp);
8309 mode = TYPE_MODE (type);
8310 unsignedp = TYPE_UNSIGNED (type);
8312 treeop0 = treeop1 = treeop2 = NULL_TREE;
8313 if (!VL_EXP_CLASS_P (exp))
8314 switch (TREE_CODE_LENGTH (code))
8317 case 3: treeop2 = TREE_OPERAND (exp, 2);
8318 case 2: treeop1 = TREE_OPERAND (exp, 1);
8319 case 1: treeop0 = TREE_OPERAND (exp, 0);
8329 ignore = (target == const0_rtx
8330 || ((CONVERT_EXPR_CODE_P (code)
8331 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
8332 && TREE_CODE (type) == VOID_TYPE));
8334 /* An operation in what may be a bit-field type needs the
8335 result to be reduced to the precision of the bit-field type,
8336 which is narrower than that of the type's mode. */
8337 reduce_bit_field = (!ignore
8338 && TREE_CODE (type) == INTEGER_TYPE
8339 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
8341 /* If we are going to ignore this result, we need only do something
8342 if there is a side-effect somewhere in the expression. If there
8343 is, short-circuit the most common cases here. Note that we must
8344 not call expand_expr with anything but const0_rtx in case this
8345 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
8349 if (! TREE_SIDE_EFFECTS (exp))
8352 /* Ensure we reference a volatile object even if value is ignored, but
8353 don't do this if all we are doing is taking its address. */
8354 if (TREE_THIS_VOLATILE (exp)
8355 && TREE_CODE (exp) != FUNCTION_DECL
8356 && mode != VOIDmode && mode != BLKmode
8357 && modifier != EXPAND_CONST_ADDRESS)
8359 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
8365 if (TREE_CODE_CLASS (code) == tcc_unary
8366 || code == COMPONENT_REF || code == INDIRECT_REF)
8367 return expand_expr (treeop0, const0_rtx, VOIDmode,
8370 else if (TREE_CODE_CLASS (code) == tcc_binary
8371 || TREE_CODE_CLASS (code) == tcc_comparison
8372 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
8374 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8375 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8378 else if (code == BIT_FIELD_REF)
8380 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8381 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8382 expand_expr (treeop2, const0_rtx, VOIDmode, modifier);
8389 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
8392 /* Use subtarget as the target for operand 0 of a binary operation. */
8393 subtarget = get_subtarget (target);
8394 original_target = target;
8400 tree function = decl_function_context (exp);
8402 temp = label_rtx (exp);
8403 temp = gen_rtx_LABEL_REF (Pmode, temp);
8405 if (function != current_function_decl
8407 LABEL_REF_NONLOCAL_P (temp) = 1;
8409 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
8414 /* ??? ivopts calls expander, without any preparation from
8415 out-of-ssa. So fake instructions as if this was an access to the
8416 base variable. This unnecessarily allocates a pseudo, see how we can
8417 reuse it, if partition base vars have it set already. */
8418 if (!currently_expanding_to_rtl)
8419 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier,
8422 g = get_gimple_for_ssa_name (exp);
8423 /* For EXPAND_INITIALIZER try harder to get something simpler. */
8425 && modifier == EXPAND_INITIALIZER
8426 && !SSA_NAME_IS_DEFAULT_DEF (exp)
8427 && (optimize || DECL_IGNORED_P (SSA_NAME_VAR (exp)))
8428 && stmt_is_replaceable_p (SSA_NAME_DEF_STMT (exp)))
8429 g = SSA_NAME_DEF_STMT (exp);
8431 return expand_expr_real (gimple_assign_rhs_to_tree (g), target, tmode,
8435 decl_rtl = get_rtx_for_ssa_name (ssa_name);
8436 exp = SSA_NAME_VAR (ssa_name);
8437 goto expand_decl_rtl;
8441 /* If a static var's type was incomplete when the decl was written,
8442 but the type is complete now, lay out the decl now. */
8443 if (DECL_SIZE (exp) == 0
8444 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
8445 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
8446 layout_decl (exp, 0);
8448 /* ... fall through ... */
8452 decl_rtl = DECL_RTL (exp);
8454 gcc_assert (decl_rtl);
8455 decl_rtl = copy_rtx (decl_rtl);
8456 /* Record writes to register variables. */
8457 if (modifier == EXPAND_WRITE
8459 && HARD_REGISTER_P (decl_rtl))
8460 add_to_hard_reg_set (&crtl->asm_clobbers,
8461 GET_MODE (decl_rtl), REGNO (decl_rtl));
8463 /* Ensure variable marked as used even if it doesn't go through
8464 a parser. If it hasn't be used yet, write out an external
8466 if (! TREE_USED (exp))
8468 assemble_external (exp);
8469 TREE_USED (exp) = 1;
8472 /* Show we haven't gotten RTL for this yet. */
8475 /* Variables inherited from containing functions should have
8476 been lowered by this point. */
8477 context = decl_function_context (exp);
8478 gcc_assert (!context
8479 || context == current_function_decl
8480 || TREE_STATIC (exp)
8481 || DECL_EXTERNAL (exp)
8482 /* ??? C++ creates functions that are not TREE_STATIC. */
8483 || TREE_CODE (exp) == FUNCTION_DECL);
8485 /* This is the case of an array whose size is to be determined
8486 from its initializer, while the initializer is still being parsed.
8489 if (MEM_P (decl_rtl) && REG_P (XEXP (decl_rtl, 0)))
8490 temp = validize_mem (decl_rtl);
8492 /* If DECL_RTL is memory, we are in the normal case and the
8493 address is not valid, get the address into a register. */
8495 else if (MEM_P (decl_rtl) && modifier != EXPAND_INITIALIZER)
8498 *alt_rtl = decl_rtl;
8499 decl_rtl = use_anchored_address (decl_rtl);
8500 if (modifier != EXPAND_CONST_ADDRESS
8501 && modifier != EXPAND_SUM
8502 && !memory_address_addr_space_p (DECL_MODE (exp),
8504 MEM_ADDR_SPACE (decl_rtl)))
8505 temp = replace_equiv_address (decl_rtl,
8506 copy_rtx (XEXP (decl_rtl, 0)));
8509 /* If we got something, return it. But first, set the alignment
8510 if the address is a register. */
8513 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
8514 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
8519 /* If the mode of DECL_RTL does not match that of the decl, it
8520 must be a promoted value. We return a SUBREG of the wanted mode,
8521 but mark it so that we know that it was already extended. */
8522 if (REG_P (decl_rtl) && GET_MODE (decl_rtl) != DECL_MODE (exp))
8524 enum machine_mode pmode;
8526 /* Get the signedness to be used for this variable. Ensure we get
8527 the same mode we got when the variable was declared. */
8528 if (code == SSA_NAME
8529 && (g = SSA_NAME_DEF_STMT (ssa_name))
8530 && gimple_code (g) == GIMPLE_CALL)
8532 gcc_assert (!gimple_call_internal_p (g));
8533 pmode = promote_function_mode (type, mode, &unsignedp,
8534 gimple_call_fntype (g),
8538 pmode = promote_decl_mode (exp, &unsignedp);
8539 gcc_assert (GET_MODE (decl_rtl) == pmode);
8541 temp = gen_lowpart_SUBREG (mode, decl_rtl);
8542 SUBREG_PROMOTED_VAR_P (temp) = 1;
8543 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
8550 temp = immed_double_const (TREE_INT_CST_LOW (exp),
8551 TREE_INT_CST_HIGH (exp), mode);
8557 tree tmp = NULL_TREE;
8558 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
8559 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT
8560 || GET_MODE_CLASS (mode) == MODE_VECTOR_FRACT
8561 || GET_MODE_CLASS (mode) == MODE_VECTOR_UFRACT
8562 || GET_MODE_CLASS (mode) == MODE_VECTOR_ACCUM
8563 || GET_MODE_CLASS (mode) == MODE_VECTOR_UACCUM)
8564 return const_vector_from_tree (exp);
8565 if (GET_MODE_CLASS (mode) == MODE_INT)
8567 tree type_for_mode = lang_hooks.types.type_for_mode (mode, 1);
8569 tmp = fold_unary_loc (loc, VIEW_CONVERT_EXPR, type_for_mode, exp);
8572 tmp = build_constructor_from_list (type,
8573 TREE_VECTOR_CST_ELTS (exp));
8574 return expand_expr (tmp, ignore ? const0_rtx : target,
8579 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
8582 /* If optimized, generate immediate CONST_DOUBLE
8583 which will be turned into memory by reload if necessary.
8585 We used to force a register so that loop.c could see it. But
8586 this does not allow gen_* patterns to perform optimizations with
8587 the constants. It also produces two insns in cases like "x = 1.0;".
8588 On most machines, floating-point constants are not permitted in
8589 many insns, so we'd end up copying it to a register in any case.
8591 Now, we do the copying in expand_binop, if appropriate. */
8592 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
8593 TYPE_MODE (TREE_TYPE (exp)));
8596 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp),
8597 TYPE_MODE (TREE_TYPE (exp)));
8600 /* Handle evaluating a complex constant in a CONCAT target. */
8601 if (original_target && GET_CODE (original_target) == CONCAT)
8603 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8606 rtarg = XEXP (original_target, 0);
8607 itarg = XEXP (original_target, 1);
8609 /* Move the real and imaginary parts separately. */
8610 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, EXPAND_NORMAL);
8611 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, EXPAND_NORMAL);
8614 emit_move_insn (rtarg, op0);
8616 emit_move_insn (itarg, op1);
8618 return original_target;
8621 /* ... fall through ... */
8624 temp = expand_expr_constant (exp, 1, modifier);
8626 /* temp contains a constant address.
8627 On RISC machines where a constant address isn't valid,
8628 make some insns to get that address into a register. */
8629 if (modifier != EXPAND_CONST_ADDRESS
8630 && modifier != EXPAND_INITIALIZER
8631 && modifier != EXPAND_SUM
8632 && ! memory_address_addr_space_p (mode, XEXP (temp, 0),
8633 MEM_ADDR_SPACE (temp)))
8634 return replace_equiv_address (temp,
8635 copy_rtx (XEXP (temp, 0)));
8641 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
8643 if (!SAVE_EXPR_RESOLVED_P (exp))
8645 /* We can indeed still hit this case, typically via builtin
8646 expanders calling save_expr immediately before expanding
8647 something. Assume this means that we only have to deal
8648 with non-BLKmode values. */
8649 gcc_assert (GET_MODE (ret) != BLKmode);
8651 val = build_decl (EXPR_LOCATION (exp),
8652 VAR_DECL, NULL, TREE_TYPE (exp));
8653 DECL_ARTIFICIAL (val) = 1;
8654 DECL_IGNORED_P (val) = 1;
8656 TREE_OPERAND (exp, 0) = treeop0;
8657 SAVE_EXPR_RESOLVED_P (exp) = 1;
8659 if (!CONSTANT_P (ret))
8660 ret = copy_to_reg (ret);
8661 SET_DECL_RTL (val, ret);
8669 /* If we don't need the result, just ensure we evaluate any
8673 unsigned HOST_WIDE_INT idx;
8676 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
8677 expand_expr (value, const0_rtx, VOIDmode, EXPAND_NORMAL);
8682 return expand_constructor (exp, target, modifier, false);
8684 case TARGET_MEM_REF:
8686 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (exp));
8687 struct mem_address addr;
8690 get_address_description (exp, &addr);
8691 op0 = addr_for_mem_ref (&addr, as, true);
8692 op0 = memory_address_addr_space (mode, op0, as);
8693 temp = gen_rtx_MEM (mode, op0);
8694 set_mem_attributes (temp, exp, 0);
8695 set_mem_addr_space (temp, as);
8696 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)),
8697 get_object_alignment (exp, BIGGEST_ALIGNMENT));
8699 && (unsigned) align < GET_MODE_ALIGNMENT (mode)
8700 /* If the target does not have special handling for unaligned
8701 loads of mode then it can use regular moves for them. */
8702 && ((icode = optab_handler (movmisalign_optab, mode))
8703 != CODE_FOR_nothing))
8707 /* We've already validated the memory, and we're creating a
8708 new pseudo destination. The predicates really can't fail. */
8709 reg = gen_reg_rtx (mode);
8711 /* Nor can the insn generator. */
8712 insn = GEN_FCN (icode) (reg, temp);
8713 gcc_assert (insn != NULL_RTX);
8724 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))));
8725 enum machine_mode address_mode;
8726 tree base = TREE_OPERAND (exp, 0);
8729 /* Handle expansion of non-aliased memory with non-BLKmode. That
8730 might end up in a register. */
8731 if (TREE_CODE (base) == ADDR_EXPR)
8733 HOST_WIDE_INT offset = mem_ref_offset (exp).low;
8735 base = TREE_OPERAND (base, 0);
8739 base = get_addr_base_and_unit_offset (base, &off);
8743 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
8744 decl we must use bitfield operations. */
8746 && !TREE_ADDRESSABLE (base)
8747 && DECL_MODE (base) != BLKmode
8748 && DECL_RTL_SET_P (base)
8749 && !MEM_P (DECL_RTL (base)))
8753 && host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)
8754 && (GET_MODE_BITSIZE (DECL_MODE (base))
8755 == TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp)))))
8756 return expand_expr (build1 (VIEW_CONVERT_EXPR,
8757 TREE_TYPE (exp), base),
8758 target, tmode, modifier);
8759 bit_offset = bitsize_int (offset * BITS_PER_UNIT);
8760 bftype = TREE_TYPE (base);
8761 if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode)
8762 bftype = TREE_TYPE (exp);
8763 return expand_expr (build3 (BIT_FIELD_REF, bftype,
8765 TYPE_SIZE (TREE_TYPE (exp)),
8767 target, tmode, modifier);
8770 address_mode = targetm.addr_space.address_mode (as);
8771 base = TREE_OPERAND (exp, 0);
8772 if ((def_stmt = get_def_for_expr (base, BIT_AND_EXPR)))
8774 tree mask = gimple_assign_rhs2 (def_stmt);
8775 base = build2 (BIT_AND_EXPR, TREE_TYPE (base),
8776 gimple_assign_rhs1 (def_stmt), mask);
8777 TREE_OPERAND (exp, 0) = base;
8779 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)),
8780 get_object_alignment (exp, BIGGEST_ALIGNMENT));
8781 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_SUM);
8782 op0 = memory_address_addr_space (address_mode, op0, as);
8783 if (!integer_zerop (TREE_OPERAND (exp, 1)))
8786 = immed_double_int_const (mem_ref_offset (exp), address_mode);
8787 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
8789 op0 = memory_address_addr_space (mode, op0, as);
8790 temp = gen_rtx_MEM (mode, op0);
8791 set_mem_attributes (temp, exp, 0);
8792 set_mem_addr_space (temp, as);
8793 if (TREE_THIS_VOLATILE (exp))
8794 MEM_VOLATILE_P (temp) = 1;
8796 && (unsigned) align < GET_MODE_ALIGNMENT (mode)
8797 /* If the target does not have special handling for unaligned
8798 loads of mode then it can use regular moves for them. */
8799 && ((icode = optab_handler (movmisalign_optab, mode))
8800 != CODE_FOR_nothing))
8804 /* We've already validated the memory, and we're creating a
8805 new pseudo destination. The predicates really can't fail. */
8806 reg = gen_reg_rtx (mode);
8808 /* Nor can the insn generator. */
8809 insn = GEN_FCN (icode) (reg, temp);
8820 tree array = treeop0;
8821 tree index = treeop1;
8823 /* Fold an expression like: "foo"[2].
8824 This is not done in fold so it won't happen inside &.
8825 Don't fold if this is for wide characters since it's too
8826 difficult to do correctly and this is a very rare case. */
8828 if (modifier != EXPAND_CONST_ADDRESS
8829 && modifier != EXPAND_INITIALIZER
8830 && modifier != EXPAND_MEMORY)
8832 tree t = fold_read_from_constant_string (exp);
8835 return expand_expr (t, target, tmode, modifier);
8838 /* If this is a constant index into a constant array,
8839 just get the value from the array. Handle both the cases when
8840 we have an explicit constructor and when our operand is a variable
8841 that was declared const. */
8843 if (modifier != EXPAND_CONST_ADDRESS
8844 && modifier != EXPAND_INITIALIZER
8845 && modifier != EXPAND_MEMORY
8846 && TREE_CODE (array) == CONSTRUCTOR
8847 && ! TREE_SIDE_EFFECTS (array)
8848 && TREE_CODE (index) == INTEGER_CST)
8850 unsigned HOST_WIDE_INT ix;
8853 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array), ix,
8855 if (tree_int_cst_equal (field, index))
8857 if (!TREE_SIDE_EFFECTS (value))
8858 return expand_expr (fold (value), target, tmode, modifier);
8863 else if (optimize >= 1
8864 && modifier != EXPAND_CONST_ADDRESS
8865 && modifier != EXPAND_INITIALIZER
8866 && modifier != EXPAND_MEMORY
8867 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
8868 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
8869 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
8870 && const_value_known_p (array))
8872 if (TREE_CODE (index) == INTEGER_CST)
8874 tree init = DECL_INITIAL (array);
8876 if (TREE_CODE (init) == CONSTRUCTOR)
8878 unsigned HOST_WIDE_INT ix;
8881 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), ix,
8883 if (tree_int_cst_equal (field, index))
8885 if (TREE_SIDE_EFFECTS (value))
8888 if (TREE_CODE (value) == CONSTRUCTOR)
8890 /* If VALUE is a CONSTRUCTOR, this
8891 optimization is only useful if
8892 this doesn't store the CONSTRUCTOR
8893 into memory. If it does, it is more
8894 efficient to just load the data from
8895 the array directly. */
8896 rtx ret = expand_constructor (value, target,
8898 if (ret == NULL_RTX)
8902 return expand_expr (fold (value), target, tmode,
8906 else if(TREE_CODE (init) == STRING_CST)
8908 tree index1 = index;
8909 tree low_bound = array_ref_low_bound (exp);
8910 index1 = fold_convert_loc (loc, sizetype,
8913 /* Optimize the special-case of a zero lower bound.
8915 We convert the low_bound to sizetype to avoid some problems
8916 with constant folding. (E.g. suppose the lower bound is 1,
8917 and its mode is QI. Without the conversion,l (ARRAY
8918 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
8919 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
8921 if (! integer_zerop (low_bound))
8922 index1 = size_diffop_loc (loc, index1,
8923 fold_convert_loc (loc, sizetype,
8926 if (0 > compare_tree_int (index1,
8927 TREE_STRING_LENGTH (init)))
8929 tree type = TREE_TYPE (TREE_TYPE (init));
8930 enum machine_mode mode = TYPE_MODE (type);
8932 if (GET_MODE_CLASS (mode) == MODE_INT
8933 && GET_MODE_SIZE (mode) == 1)
8934 return gen_int_mode (TREE_STRING_POINTER (init)
8935 [TREE_INT_CST_LOW (index1)],
8942 goto normal_inner_ref;
8945 /* If the operand is a CONSTRUCTOR, we can just extract the
8946 appropriate field if it is present. */
8947 if (TREE_CODE (treeop0) == CONSTRUCTOR)
8949 unsigned HOST_WIDE_INT idx;
8952 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0),
8954 if (field == treeop1
8955 /* We can normally use the value of the field in the
8956 CONSTRUCTOR. However, if this is a bitfield in
8957 an integral mode that we can fit in a HOST_WIDE_INT,
8958 we must mask only the number of bits in the bitfield,
8959 since this is done implicitly by the constructor. If
8960 the bitfield does not meet either of those conditions,
8961 we can't do this optimization. */
8962 && (! DECL_BIT_FIELD (field)
8963 || ((GET_MODE_CLASS (DECL_MODE (field)) == MODE_INT)
8964 && (GET_MODE_BITSIZE (DECL_MODE (field))
8965 <= HOST_BITS_PER_WIDE_INT))))
8967 if (DECL_BIT_FIELD (field)
8968 && modifier == EXPAND_STACK_PARM)
8970 op0 = expand_expr (value, target, tmode, modifier);
8971 if (DECL_BIT_FIELD (field))
8973 HOST_WIDE_INT bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
8974 enum machine_mode imode = TYPE_MODE (TREE_TYPE (field));
8976 if (TYPE_UNSIGNED (TREE_TYPE (field)))
8978 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
8979 op0 = expand_and (imode, op0, op1, target);
8984 = build_int_cst (NULL_TREE,
8985 GET_MODE_BITSIZE (imode) - bitsize);
8987 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
8989 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
8997 goto normal_inner_ref;
9000 case ARRAY_RANGE_REF:
9003 enum machine_mode mode1, mode2;
9004 HOST_WIDE_INT bitsize, bitpos;
9006 int volatilep = 0, must_force_mem;
9007 bool packedp = false;
9008 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
9009 &mode1, &unsignedp, &volatilep, true);
9010 rtx orig_op0, memloc;
9012 /* If we got back the original object, something is wrong. Perhaps
9013 we are evaluating an expression too early. In any event, don't
9014 infinitely recurse. */
9015 gcc_assert (tem != exp);
9017 if (TYPE_PACKED (TREE_TYPE (TREE_OPERAND (exp, 0)))
9018 || (TREE_CODE (TREE_OPERAND (exp, 1)) == FIELD_DECL
9019 && DECL_PACKED (TREE_OPERAND (exp, 1))))
9022 /* If TEM's type is a union of variable size, pass TARGET to the inner
9023 computation, since it will need a temporary and TARGET is known
9024 to have to do. This occurs in unchecked conversion in Ada. */
9027 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9028 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9030 && modifier != EXPAND_STACK_PARM
9031 ? target : NULL_RTX),
9033 (modifier == EXPAND_INITIALIZER
9034 || modifier == EXPAND_CONST_ADDRESS
9035 || modifier == EXPAND_STACK_PARM)
9036 ? modifier : EXPAND_NORMAL);
9039 /* If the bitfield is volatile, we want to access it in the
9040 field's mode, not the computed mode.
9041 If a MEM has VOIDmode (external with incomplete type),
9042 use BLKmode for it instead. */
9045 if (volatilep && flag_strict_volatile_bitfields > 0)
9046 op0 = adjust_address (op0, mode1, 0);
9047 else if (GET_MODE (op0) == VOIDmode)
9048 op0 = adjust_address (op0, BLKmode, 0);
9052 = CONSTANT_P (op0) ? TYPE_MODE (TREE_TYPE (tem)) : GET_MODE (op0);
9054 /* If we have either an offset, a BLKmode result, or a reference
9055 outside the underlying object, we must force it to memory.
9056 Such a case can occur in Ada if we have unchecked conversion
9057 of an expression from a scalar type to an aggregate type or
9058 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
9059 passed a partially uninitialized object or a view-conversion
9060 to a larger size. */
9061 must_force_mem = (offset
9063 || bitpos + bitsize > GET_MODE_BITSIZE (mode2));
9065 /* Handle CONCAT first. */
9066 if (GET_CODE (op0) == CONCAT && !must_force_mem)
9069 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
9072 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9075 op0 = XEXP (op0, 0);
9076 mode2 = GET_MODE (op0);
9078 else if (bitpos == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9079 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 1)))
9083 op0 = XEXP (op0, 1);
9085 mode2 = GET_MODE (op0);
9088 /* Otherwise force into memory. */
9092 /* If this is a constant, put it in a register if it is a legitimate
9093 constant and we don't need a memory reference. */
9094 if (CONSTANT_P (op0)
9096 && LEGITIMATE_CONSTANT_P (op0)
9098 op0 = force_reg (mode2, op0);
9100 /* Otherwise, if this is a constant, try to force it to the constant
9101 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9102 is a legitimate constant. */
9103 else if (CONSTANT_P (op0) && (memloc = force_const_mem (mode2, op0)))
9104 op0 = validize_mem (memloc);
9106 /* Otherwise, if this is a constant or the object is not in memory
9107 and need be, put it there. */
9108 else if (CONSTANT_P (op0) || (!MEM_P (op0) && must_force_mem))
9110 tree nt = build_qualified_type (TREE_TYPE (tem),
9111 (TYPE_QUALS (TREE_TYPE (tem))
9112 | TYPE_QUAL_CONST));
9113 memloc = assign_temp (nt, 1, 1, 1);
9114 emit_move_insn (memloc, op0);
9120 enum machine_mode address_mode;
9121 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
9124 gcc_assert (MEM_P (op0));
9127 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (op0));
9128 if (GET_MODE (offset_rtx) != address_mode)
9129 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
9131 if (GET_MODE (op0) == BLKmode
9132 /* A constant address in OP0 can have VOIDmode, we must
9133 not try to call force_reg in that case. */
9134 && GET_MODE (XEXP (op0, 0)) != VOIDmode
9136 && (bitpos % bitsize) == 0
9137 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
9138 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
9140 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9144 op0 = offset_address (op0, offset_rtx,
9145 highest_pow2_factor (offset));
9148 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9149 record its alignment as BIGGEST_ALIGNMENT. */
9150 if (MEM_P (op0) && bitpos == 0 && offset != 0
9151 && is_aligning_offset (offset, tem))
9152 set_mem_align (op0, BIGGEST_ALIGNMENT);
9154 /* Don't forget about volatility even if this is a bitfield. */
9155 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
9157 if (op0 == orig_op0)
9158 op0 = copy_rtx (op0);
9160 MEM_VOLATILE_P (op0) = 1;
9163 /* In cases where an aligned union has an unaligned object
9164 as a field, we might be extracting a BLKmode value from
9165 an integer-mode (e.g., SImode) object. Handle this case
9166 by doing the extract into an object as wide as the field
9167 (which we know to be the width of a basic mode), then
9168 storing into memory, and changing the mode to BLKmode. */
9169 if (mode1 == VOIDmode
9170 || REG_P (op0) || GET_CODE (op0) == SUBREG
9171 || (mode1 != BLKmode && ! direct_load[(int) mode1]
9172 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
9173 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
9174 && modifier != EXPAND_CONST_ADDRESS
9175 && modifier != EXPAND_INITIALIZER)
9176 /* If the field is volatile, we always want an aligned
9177 access. Only do this if the access is not already naturally
9178 aligned, otherwise "normal" (non-bitfield) volatile fields
9179 become non-addressable. */
9180 || (volatilep && flag_strict_volatile_bitfields > 0
9181 && (bitpos % GET_MODE_ALIGNMENT (mode) != 0))
9182 /* If the field isn't aligned enough to fetch as a memref,
9183 fetch it as a bit field. */
9184 || (mode1 != BLKmode
9185 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
9186 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
9188 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
9189 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
9190 && ((modifier == EXPAND_CONST_ADDRESS
9191 || modifier == EXPAND_INITIALIZER)
9193 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
9194 || (bitpos % BITS_PER_UNIT != 0)))
9195 /* If the type and the field are a constant size and the
9196 size of the type isn't the same size as the bitfield,
9197 we must use bitfield operations. */
9199 && TYPE_SIZE (TREE_TYPE (exp))
9200 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9201 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
9204 enum machine_mode ext_mode = mode;
9206 if (ext_mode == BLKmode
9207 && ! (target != 0 && MEM_P (op0)
9209 && bitpos % BITS_PER_UNIT == 0))
9210 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
9212 if (ext_mode == BLKmode)
9215 target = assign_temp (type, 0, 1, 1);
9220 /* In this case, BITPOS must start at a byte boundary and
9221 TARGET, if specified, must be a MEM. */
9222 gcc_assert (MEM_P (op0)
9223 && (!target || MEM_P (target))
9224 && !(bitpos % BITS_PER_UNIT));
9226 emit_block_move (target,
9227 adjust_address (op0, VOIDmode,
9228 bitpos / BITS_PER_UNIT),
9229 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
9231 (modifier == EXPAND_STACK_PARM
9232 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9237 op0 = validize_mem (op0);
9239 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
9240 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9242 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp, packedp,
9243 (modifier == EXPAND_STACK_PARM
9244 ? NULL_RTX : target),
9245 ext_mode, ext_mode);
9247 /* If the result is a record type and BITSIZE is narrower than
9248 the mode of OP0, an integral mode, and this is a big endian
9249 machine, we must put the field into the high-order bits. */
9250 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
9251 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
9252 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
9253 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
9254 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
9258 /* If the result type is BLKmode, store the data into a temporary
9259 of the appropriate type, but with the mode corresponding to the
9260 mode for the data we have (op0's mode). It's tempting to make
9261 this a constant type, since we know it's only being stored once,
9262 but that can cause problems if we are taking the address of this
9263 COMPONENT_REF because the MEM of any reference via that address
9264 will have flags corresponding to the type, which will not
9265 necessarily be constant. */
9266 if (mode == BLKmode)
9268 HOST_WIDE_INT size = GET_MODE_BITSIZE (ext_mode);
9271 /* If the reference doesn't use the alias set of its type,
9272 we cannot create the temporary using that type. */
9273 if (component_uses_parent_alias_set (exp))
9275 new_rtx = assign_stack_local (ext_mode, size, 0);
9276 set_mem_alias_set (new_rtx, get_alias_set (exp));
9279 new_rtx = assign_stack_temp_for_type (ext_mode, size, 0, type);
9281 emit_move_insn (new_rtx, op0);
9282 op0 = copy_rtx (new_rtx);
9283 PUT_MODE (op0, BLKmode);
9284 set_mem_attributes (op0, exp, 1);
9290 /* If the result is BLKmode, use that to access the object
9292 if (mode == BLKmode)
9295 /* Get a reference to just this component. */
9296 if (modifier == EXPAND_CONST_ADDRESS
9297 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
9298 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
9300 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9302 if (op0 == orig_op0)
9303 op0 = copy_rtx (op0);
9305 set_mem_attributes (op0, exp, 0);
9306 if (REG_P (XEXP (op0, 0)))
9307 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9309 MEM_VOLATILE_P (op0) |= volatilep;
9310 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
9311 || modifier == EXPAND_CONST_ADDRESS
9312 || modifier == EXPAND_INITIALIZER)
9314 else if (target == 0)
9315 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9317 convert_move (target, op0, unsignedp);
9322 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
9325 /* All valid uses of __builtin_va_arg_pack () are removed during
9327 if (CALL_EXPR_VA_ARG_PACK (exp))
9328 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
9330 tree fndecl = get_callee_fndecl (exp), attr;
9333 && (attr = lookup_attribute ("error",
9334 DECL_ATTRIBUTES (fndecl))) != NULL)
9335 error ("%Kcall to %qs declared with attribute error: %s",
9336 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9337 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9339 && (attr = lookup_attribute ("warning",
9340 DECL_ATTRIBUTES (fndecl))) != NULL)
9341 warning_at (tree_nonartificial_location (exp),
9342 0, "%Kcall to %qs declared with attribute warning: %s",
9343 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9344 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9346 /* Check for a built-in function. */
9347 if (fndecl && DECL_BUILT_IN (fndecl))
9349 gcc_assert (DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_FRONTEND);
9350 return expand_builtin (exp, target, subtarget, tmode, ignore);
9353 return expand_call (exp, target, ignore);
9355 case VIEW_CONVERT_EXPR:
9358 /* If we are converting to BLKmode, try to avoid an intermediate
9359 temporary by fetching an inner memory reference. */
9361 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9362 && TYPE_MODE (TREE_TYPE (treeop0)) != BLKmode
9363 && handled_component_p (treeop0))
9365 enum machine_mode mode1;
9366 HOST_WIDE_INT bitsize, bitpos;
9371 = get_inner_reference (treeop0, &bitsize, &bitpos,
9372 &offset, &mode1, &unsignedp, &volatilep,
9376 /* ??? We should work harder and deal with non-zero offsets. */
9378 && (bitpos % BITS_PER_UNIT) == 0
9380 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) == 0)
9382 /* See the normal_inner_ref case for the rationale. */
9385 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9386 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9388 && modifier != EXPAND_STACK_PARM
9389 ? target : NULL_RTX),
9391 (modifier == EXPAND_INITIALIZER
9392 || modifier == EXPAND_CONST_ADDRESS
9393 || modifier == EXPAND_STACK_PARM)
9394 ? modifier : EXPAND_NORMAL);
9396 if (MEM_P (orig_op0))
9400 /* Get a reference to just this component. */
9401 if (modifier == EXPAND_CONST_ADDRESS
9402 || modifier == EXPAND_SUM
9403 || modifier == EXPAND_INITIALIZER)
9404 op0 = adjust_address_nv (op0, mode, bitpos / BITS_PER_UNIT);
9406 op0 = adjust_address (op0, mode, bitpos / BITS_PER_UNIT);
9408 if (op0 == orig_op0)
9409 op0 = copy_rtx (op0);
9411 set_mem_attributes (op0, treeop0, 0);
9412 if (REG_P (XEXP (op0, 0)))
9413 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9415 MEM_VOLATILE_P (op0) |= volatilep;
9421 op0 = expand_expr (treeop0,
9422 NULL_RTX, VOIDmode, modifier);
9424 /* If the input and output modes are both the same, we are done. */
9425 if (mode == GET_MODE (op0))
9427 /* If neither mode is BLKmode, and both modes are the same size
9428 then we can use gen_lowpart. */
9429 else if (mode != BLKmode && GET_MODE (op0) != BLKmode
9430 && GET_MODE_SIZE (mode) == GET_MODE_SIZE (GET_MODE (op0))
9431 && !COMPLEX_MODE_P (GET_MODE (op0)))
9433 if (GET_CODE (op0) == SUBREG)
9434 op0 = force_reg (GET_MODE (op0), op0);
9435 temp = gen_lowpart_common (mode, op0);
9440 if (!REG_P (op0) && !MEM_P (op0))
9441 op0 = force_reg (GET_MODE (op0), op0);
9442 op0 = gen_lowpart (mode, op0);
9445 /* If both types are integral, convert from one mode to the other. */
9446 else if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (TREE_TYPE (treeop0)))
9447 op0 = convert_modes (mode, GET_MODE (op0), op0,
9448 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
9449 /* As a last resort, spill op0 to memory, and reload it in a
9451 else if (!MEM_P (op0))
9453 /* If the operand is not a MEM, force it into memory. Since we
9454 are going to be changing the mode of the MEM, don't call
9455 force_const_mem for constants because we don't allow pool
9456 constants to change mode. */
9457 tree inner_type = TREE_TYPE (treeop0);
9459 gcc_assert (!TREE_ADDRESSABLE (exp));
9461 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
9463 = assign_stack_temp_for_type
9464 (TYPE_MODE (inner_type),
9465 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
9467 emit_move_insn (target, op0);
9471 /* At this point, OP0 is in the correct mode. If the output type is
9472 such that the operand is known to be aligned, indicate that it is.
9473 Otherwise, we need only be concerned about alignment for non-BLKmode
9477 op0 = copy_rtx (op0);
9479 if (TYPE_ALIGN_OK (type))
9480 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
9481 else if (STRICT_ALIGNMENT
9483 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode))
9485 tree inner_type = TREE_TYPE (treeop0);
9486 HOST_WIDE_INT temp_size
9487 = MAX (int_size_in_bytes (inner_type),
9488 (HOST_WIDE_INT) GET_MODE_SIZE (mode));
9490 = assign_stack_temp_for_type (mode, temp_size, 0, type);
9491 rtx new_with_op0_mode
9492 = adjust_address (new_rtx, GET_MODE (op0), 0);
9494 gcc_assert (!TREE_ADDRESSABLE (exp));
9496 if (GET_MODE (op0) == BLKmode)
9497 emit_block_move (new_with_op0_mode, op0,
9498 GEN_INT (GET_MODE_SIZE (mode)),
9499 (modifier == EXPAND_STACK_PARM
9500 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9502 emit_move_insn (new_with_op0_mode, op0);
9507 op0 = adjust_address (op0, mode, 0);
9512 /* Use a compare and a jump for BLKmode comparisons, or for function
9513 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
9515 /* Although TRUTH_{AND,OR}IF_EXPR aren't present in GIMPLE, they
9516 are occassionally created by folding during expansion. */
9517 case TRUTH_ANDIF_EXPR:
9518 case TRUTH_ORIF_EXPR:
9521 || modifier == EXPAND_STACK_PARM
9522 || ! safe_from_p (target, treeop0, 1)
9523 || ! safe_from_p (target, treeop1, 1)
9524 /* Make sure we don't have a hard reg (such as function's return
9525 value) live across basic blocks, if not optimizing. */
9526 || (!optimize && REG_P (target)
9527 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
9528 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9531 emit_move_insn (target, const0_rtx);
9533 op1 = gen_label_rtx ();
9534 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
9537 emit_move_insn (target, const1_rtx);
9540 return ignore ? const0_rtx : target;
9542 case STATEMENT_LIST:
9544 tree_stmt_iterator iter;
9546 gcc_assert (ignore);
9548 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
9549 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
9554 /* A COND_EXPR with its type being VOID_TYPE represents a
9555 conditional jump and is handled in
9556 expand_gimple_cond_expr. */
9557 gcc_assert (!VOID_TYPE_P (type));
9559 /* Note that COND_EXPRs whose type is a structure or union
9560 are required to be constructed to contain assignments of
9561 a temporary variable, so that we can evaluate them here
9562 for side effect only. If type is void, we must do likewise. */
9564 gcc_assert (!TREE_ADDRESSABLE (type)
9566 && TREE_TYPE (treeop1) != void_type_node
9567 && TREE_TYPE (treeop2) != void_type_node);
9569 /* If we are not to produce a result, we have no target. Otherwise,
9570 if a target was specified use it; it will not be used as an
9571 intermediate target unless it is safe. If no target, use a
9574 if (modifier != EXPAND_STACK_PARM
9576 && safe_from_p (original_target, treeop0, 1)
9577 && GET_MODE (original_target) == mode
9578 #ifdef HAVE_conditional_move
9579 && (! can_conditionally_move_p (mode)
9580 || REG_P (original_target))
9582 && !MEM_P (original_target))
9583 temp = original_target;
9585 temp = assign_temp (type, 0, 0, 1);
9587 do_pending_stack_adjust ();
9589 op0 = gen_label_rtx ();
9590 op1 = gen_label_rtx ();
9591 jumpifnot (treeop0, op0, -1);
9592 store_expr (treeop1, temp,
9593 modifier == EXPAND_STACK_PARM,
9596 emit_jump_insn (gen_jump (op1));
9599 store_expr (treeop2, temp,
9600 modifier == EXPAND_STACK_PARM,
9608 target = expand_vec_cond_expr (type, treeop0, treeop1, treeop2, target);
9615 gcc_assert (ignore);
9617 /* Check for |= or &= of a bitfield of size one into another bitfield
9618 of size 1. In this case, (unless we need the result of the
9619 assignment) we can do this more efficiently with a
9620 test followed by an assignment, if necessary.
9622 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9623 things change so we do, this code should be enhanced to
9625 if (TREE_CODE (lhs) == COMPONENT_REF
9626 && (TREE_CODE (rhs) == BIT_IOR_EXPR
9627 || TREE_CODE (rhs) == BIT_AND_EXPR)
9628 && TREE_OPERAND (rhs, 0) == lhs
9629 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
9630 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
9631 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
9633 rtx label = gen_label_rtx ();
9634 int value = TREE_CODE (rhs) == BIT_IOR_EXPR;
9635 do_jump (TREE_OPERAND (rhs, 1),
9637 value ? 0 : label, -1);
9638 expand_assignment (lhs, build_int_cst (TREE_TYPE (rhs), value),
9639 MOVE_NONTEMPORAL (exp));
9640 do_pending_stack_adjust ();
9645 expand_assignment (lhs, rhs, MOVE_NONTEMPORAL (exp));
9650 return expand_expr_addr_expr (exp, target, tmode, modifier);
9653 op0 = expand_normal (treeop0);
9654 return read_complex_part (op0, false);
9657 op0 = expand_normal (treeop0);
9658 return read_complex_part (op0, true);
9665 /* Expanded in cfgexpand.c. */
9668 case TRY_CATCH_EXPR:
9670 case EH_FILTER_EXPR:
9671 case TRY_FINALLY_EXPR:
9672 /* Lowered by tree-eh.c. */
9675 case WITH_CLEANUP_EXPR:
9676 case CLEANUP_POINT_EXPR:
9678 case CASE_LABEL_EXPR:
9684 case PREINCREMENT_EXPR:
9685 case PREDECREMENT_EXPR:
9686 case POSTINCREMENT_EXPR:
9687 case POSTDECREMENT_EXPR:
9690 /* Lowered by gimplify.c. */
9694 /* Function descriptors are not valid except for as
9695 initialization constants, and should not be expanded. */
9698 case WITH_SIZE_EXPR:
9699 /* WITH_SIZE_EXPR expands to its first argument. The caller should
9700 have pulled out the size to use in whatever context it needed. */
9701 return expand_expr_real (treeop0, original_target, tmode,
9704 case COMPOUND_LITERAL_EXPR:
9706 /* Initialize the anonymous variable declared in the compound
9707 literal, then return the variable. */
9708 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
9710 /* Create RTL for this variable. */
9711 if (!DECL_RTL_SET_P (decl))
9713 if (DECL_HARD_REGISTER (decl))
9714 /* The user specified an assembler name for this variable.
9716 rest_of_decl_compilation (decl, 0, 0);
9721 return expand_expr_real (decl, original_target, tmode,
9726 return expand_expr_real_2 (&ops, target, tmode, modifier);
9730 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
9731 signedness of TYPE), possibly returning the result in TARGET. */
9733 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
9735 HOST_WIDE_INT prec = TYPE_PRECISION (type);
9736 if (target && GET_MODE (target) != GET_MODE (exp))
9738 /* For constant values, reduce using build_int_cst_type. */
9739 if (CONST_INT_P (exp))
9741 HOST_WIDE_INT value = INTVAL (exp);
9742 tree t = build_int_cst_type (type, value);
9743 return expand_expr (t, target, VOIDmode, EXPAND_NORMAL);
9745 else if (TYPE_UNSIGNED (type))
9747 rtx mask = immed_double_int_const (double_int_mask (prec),
9749 return expand_and (GET_MODE (exp), exp, mask, target);
9753 tree count = build_int_cst (NULL_TREE,
9754 GET_MODE_BITSIZE (GET_MODE (exp)) - prec);
9755 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9756 return expand_shift (RSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9760 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9761 when applied to the address of EXP produces an address known to be
9762 aligned more than BIGGEST_ALIGNMENT. */
9765 is_aligning_offset (const_tree offset, const_tree exp)
9767 /* Strip off any conversions. */
9768 while (CONVERT_EXPR_P (offset))
9769 offset = TREE_OPERAND (offset, 0);
9771 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9772 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9773 if (TREE_CODE (offset) != BIT_AND_EXPR
9774 || !host_integerp (TREE_OPERAND (offset, 1), 1)
9775 || compare_tree_int (TREE_OPERAND (offset, 1),
9776 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
9777 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
9780 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9781 It must be NEGATE_EXPR. Then strip any more conversions. */
9782 offset = TREE_OPERAND (offset, 0);
9783 while (CONVERT_EXPR_P (offset))
9784 offset = TREE_OPERAND (offset, 0);
9786 if (TREE_CODE (offset) != NEGATE_EXPR)
9789 offset = TREE_OPERAND (offset, 0);
9790 while (CONVERT_EXPR_P (offset))
9791 offset = TREE_OPERAND (offset, 0);
9793 /* This must now be the address of EXP. */
9794 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
9797 /* Return the tree node if an ARG corresponds to a string constant or zero
9798 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
9799 in bytes within the string that ARG is accessing. The type of the
9800 offset will be `sizetype'. */
9803 string_constant (tree arg, tree *ptr_offset)
9805 tree array, offset, lower_bound;
9808 if (TREE_CODE (arg) == ADDR_EXPR)
9810 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
9812 *ptr_offset = size_zero_node;
9813 return TREE_OPERAND (arg, 0);
9815 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
9817 array = TREE_OPERAND (arg, 0);
9818 offset = size_zero_node;
9820 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
9822 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
9823 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
9824 if (TREE_CODE (array) != STRING_CST
9825 && TREE_CODE (array) != VAR_DECL)
9828 /* Check if the array has a nonzero lower bound. */
9829 lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
9830 if (!integer_zerop (lower_bound))
9832 /* If the offset and base aren't both constants, return 0. */
9833 if (TREE_CODE (lower_bound) != INTEGER_CST)
9835 if (TREE_CODE (offset) != INTEGER_CST)
9837 /* Adjust offset by the lower bound. */
9838 offset = size_diffop (fold_convert (sizetype, offset),
9839 fold_convert (sizetype, lower_bound));
9845 else if (TREE_CODE (arg) == PLUS_EXPR || TREE_CODE (arg) == POINTER_PLUS_EXPR)
9847 tree arg0 = TREE_OPERAND (arg, 0);
9848 tree arg1 = TREE_OPERAND (arg, 1);
9853 if (TREE_CODE (arg0) == ADDR_EXPR
9854 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
9855 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
9857 array = TREE_OPERAND (arg0, 0);
9860 else if (TREE_CODE (arg1) == ADDR_EXPR
9861 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
9862 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
9864 array = TREE_OPERAND (arg1, 0);
9873 if (TREE_CODE (array) == STRING_CST)
9875 *ptr_offset = fold_convert (sizetype, offset);
9878 else if (TREE_CODE (array) == VAR_DECL
9879 || TREE_CODE (array) == CONST_DECL)
9883 /* Variables initialized to string literals can be handled too. */
9884 if (!const_value_known_p (array)
9885 || !DECL_INITIAL (array)
9886 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
9889 /* Avoid const char foo[4] = "abcde"; */
9890 if (DECL_SIZE_UNIT (array) == NULL_TREE
9891 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
9892 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
9893 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
9896 /* If variable is bigger than the string literal, OFFSET must be constant
9897 and inside of the bounds of the string literal. */
9898 offset = fold_convert (sizetype, offset);
9899 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
9900 && (! host_integerp (offset, 1)
9901 || compare_tree_int (offset, length) >= 0))
9904 *ptr_offset = offset;
9905 return DECL_INITIAL (array);
9911 /* Generate code to calculate OPS, and exploded expression
9912 using a store-flag instruction and return an rtx for the result.
9913 OPS reflects a comparison.
9915 If TARGET is nonzero, store the result there if convenient.
9917 Return zero if there is no suitable set-flag instruction
9918 available on this machine.
9920 Once expand_expr has been called on the arguments of the comparison,
9921 we are committed to doing the store flag, since it is not safe to
9922 re-evaluate the expression. We emit the store-flag insn by calling
9923 emit_store_flag, but only expand the arguments if we have a reason
9924 to believe that emit_store_flag will be successful. If we think that
9925 it will, but it isn't, we have to simulate the store-flag with a
9926 set/jump/set sequence. */
9929 do_store_flag (sepops ops, rtx target, enum machine_mode mode)
9932 tree arg0, arg1, type;
9934 enum machine_mode operand_mode;
9937 rtx subtarget = target;
9938 location_t loc = ops->location;
9943 /* Don't crash if the comparison was erroneous. */
9944 if (arg0 == error_mark_node || arg1 == error_mark_node)
9947 type = TREE_TYPE (arg0);
9948 operand_mode = TYPE_MODE (type);
9949 unsignedp = TYPE_UNSIGNED (type);
9951 /* We won't bother with BLKmode store-flag operations because it would mean
9952 passing a lot of information to emit_store_flag. */
9953 if (operand_mode == BLKmode)
9956 /* We won't bother with store-flag operations involving function pointers
9957 when function pointers must be canonicalized before comparisons. */
9958 #ifdef HAVE_canonicalize_funcptr_for_compare
9959 if (HAVE_canonicalize_funcptr_for_compare
9960 && ((TREE_CODE (TREE_TYPE (arg0)) == POINTER_TYPE
9961 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0)))
9963 || (TREE_CODE (TREE_TYPE (arg1)) == POINTER_TYPE
9964 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1)))
9965 == FUNCTION_TYPE))))
9972 /* Get the rtx comparison code to use. We know that EXP is a comparison
9973 operation of some type. Some comparisons against 1 and -1 can be
9974 converted to comparisons with zero. Do so here so that the tests
9975 below will be aware that we have a comparison with zero. These
9976 tests will not catch constants in the first operand, but constants
9977 are rarely passed as the first operand. */
9988 if (integer_onep (arg1))
9989 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
9991 code = unsignedp ? LTU : LT;
9994 if (! unsignedp && integer_all_onesp (arg1))
9995 arg1 = integer_zero_node, code = LT;
9997 code = unsignedp ? LEU : LE;
10000 if (! unsignedp && integer_all_onesp (arg1))
10001 arg1 = integer_zero_node, code = GE;
10003 code = unsignedp ? GTU : GT;
10006 if (integer_onep (arg1))
10007 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10009 code = unsignedp ? GEU : GE;
10012 case UNORDERED_EXPR:
10038 gcc_unreachable ();
10041 /* Put a constant second. */
10042 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST
10043 || TREE_CODE (arg0) == FIXED_CST)
10045 tem = arg0; arg0 = arg1; arg1 = tem;
10046 code = swap_condition (code);
10049 /* If this is an equality or inequality test of a single bit, we can
10050 do this by shifting the bit being tested to the low-order bit and
10051 masking the result with the constant 1. If the condition was EQ,
10052 we xor it with 1. This does not require an scc insn and is faster
10053 than an scc insn even if we have it.
10055 The code to make this transformation was moved into fold_single_bit_test,
10056 so we just call into the folder and expand its result. */
10058 if ((code == NE || code == EQ)
10059 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
10060 && integer_pow2p (TREE_OPERAND (arg0, 1)))
10062 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
10063 return expand_expr (fold_single_bit_test (loc,
10064 code == NE ? NE_EXPR : EQ_EXPR,
10066 target, VOIDmode, EXPAND_NORMAL);
10069 if (! get_subtarget (target)
10070 || GET_MODE (subtarget) != operand_mode)
10073 expand_operands (arg0, arg1, subtarget, &op0, &op1, EXPAND_NORMAL);
10076 target = gen_reg_rtx (mode);
10078 /* Try a cstore if possible. */
10079 return emit_store_flag_force (target, code, op0, op1,
10080 operand_mode, unsignedp, 1);
10084 /* Stubs in case we haven't got a casesi insn. */
10085 #ifndef HAVE_casesi
10086 # define HAVE_casesi 0
10087 # define gen_casesi(a, b, c, d, e) (0)
10088 # define CODE_FOR_casesi CODE_FOR_nothing
10091 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10092 0 otherwise (i.e. if there is no casesi instruction). */
10094 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
10095 rtx table_label ATTRIBUTE_UNUSED, rtx default_label,
10096 rtx fallback_label ATTRIBUTE_UNUSED)
10098 struct expand_operand ops[5];
10099 enum machine_mode index_mode = SImode;
10100 int index_bits = GET_MODE_BITSIZE (index_mode);
10101 rtx op1, op2, index;
10106 /* Convert the index to SImode. */
10107 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10109 enum machine_mode omode = TYPE_MODE (index_type);
10110 rtx rangertx = expand_normal (range);
10112 /* We must handle the endpoints in the original mode. */
10113 index_expr = build2 (MINUS_EXPR, index_type,
10114 index_expr, minval);
10115 minval = integer_zero_node;
10116 index = expand_normal (index_expr);
10118 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10119 omode, 1, default_label);
10120 /* Now we can safely truncate. */
10121 index = convert_to_mode (index_mode, index, 0);
10125 if (TYPE_MODE (index_type) != index_mode)
10127 index_type = lang_hooks.types.type_for_size (index_bits, 0);
10128 index_expr = fold_convert (index_type, index_expr);
10131 index = expand_normal (index_expr);
10134 do_pending_stack_adjust ();
10136 op1 = expand_normal (minval);
10137 op2 = expand_normal (range);
10139 create_input_operand (&ops[0], index, index_mode);
10140 create_convert_operand_from_type (&ops[1], op1, TREE_TYPE (minval));
10141 create_convert_operand_from_type (&ops[2], op2, TREE_TYPE (range));
10142 create_fixed_operand (&ops[3], table_label);
10143 create_fixed_operand (&ops[4], (default_label
10145 : fallback_label));
10146 expand_jump_insn (CODE_FOR_casesi, 5, ops);
10150 /* Attempt to generate a tablejump instruction; same concept. */
10151 #ifndef HAVE_tablejump
10152 #define HAVE_tablejump 0
10153 #define gen_tablejump(x, y) (0)
10156 /* Subroutine of the next function.
10158 INDEX is the value being switched on, with the lowest value
10159 in the table already subtracted.
10160 MODE is its expected mode (needed if INDEX is constant).
10161 RANGE is the length of the jump table.
10162 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10164 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10165 index value is out of range. */
10168 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
10173 if (INTVAL (range) > cfun->cfg->max_jumptable_ents)
10174 cfun->cfg->max_jumptable_ents = INTVAL (range);
10176 /* Do an unsigned comparison (in the proper mode) between the index
10177 expression and the value which represents the length of the range.
10178 Since we just finished subtracting the lower bound of the range
10179 from the index expression, this comparison allows us to simultaneously
10180 check that the original index expression value is both greater than
10181 or equal to the minimum value of the range and less than or equal to
10182 the maximum value of the range. */
10185 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10188 /* If index is in range, it must fit in Pmode.
10189 Convert to Pmode so we can index with it. */
10191 index = convert_to_mode (Pmode, index, 1);
10193 /* Don't let a MEM slip through, because then INDEX that comes
10194 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10195 and break_out_memory_refs will go to work on it and mess it up. */
10196 #ifdef PIC_CASE_VECTOR_ADDRESS
10197 if (flag_pic && !REG_P (index))
10198 index = copy_to_mode_reg (Pmode, index);
10201 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10202 GET_MODE_SIZE, because this indicates how large insns are. The other
10203 uses should all be Pmode, because they are addresses. This code
10204 could fail if addresses and insns are not the same size. */
10205 index = gen_rtx_PLUS (Pmode,
10206 gen_rtx_MULT (Pmode, index,
10207 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10208 gen_rtx_LABEL_REF (Pmode, table_label));
10209 #ifdef PIC_CASE_VECTOR_ADDRESS
10211 index = PIC_CASE_VECTOR_ADDRESS (index);
10214 index = memory_address (CASE_VECTOR_MODE, index);
10215 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10216 vector = gen_const_mem (CASE_VECTOR_MODE, index);
10217 convert_move (temp, vector, 0);
10219 emit_jump_insn (gen_tablejump (temp, table_label));
10221 /* If we are generating PIC code or if the table is PC-relative, the
10222 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10223 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10228 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
10229 rtx table_label, rtx default_label)
10233 if (! HAVE_tablejump)
10236 index_expr = fold_build2 (MINUS_EXPR, index_type,
10237 fold_convert (index_type, index_expr),
10238 fold_convert (index_type, minval));
10239 index = expand_normal (index_expr);
10240 do_pending_stack_adjust ();
10242 do_tablejump (index, TYPE_MODE (index_type),
10243 convert_modes (TYPE_MODE (index_type),
10244 TYPE_MODE (TREE_TYPE (range)),
10245 expand_normal (range),
10246 TYPE_UNSIGNED (TREE_TYPE (range))),
10247 table_label, default_label);
10251 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10253 const_vector_from_tree (tree exp)
10258 enum machine_mode inner, mode;
10260 mode = TYPE_MODE (TREE_TYPE (exp));
10262 if (initializer_zerop (exp))
10263 return CONST0_RTX (mode);
10265 units = GET_MODE_NUNITS (mode);
10266 inner = GET_MODE_INNER (mode);
10268 v = rtvec_alloc (units);
10270 link = TREE_VECTOR_CST_ELTS (exp);
10271 for (i = 0; link; link = TREE_CHAIN (link), ++i)
10273 elt = TREE_VALUE (link);
10275 if (TREE_CODE (elt) == REAL_CST)
10276 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
10278 else if (TREE_CODE (elt) == FIXED_CST)
10279 RTVEC_ELT (v, i) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt),
10282 RTVEC_ELT (v, i) = immed_double_int_const (tree_to_double_int (elt),
10286 /* Initialize remaining elements to 0. */
10287 for (; i < units; ++i)
10288 RTVEC_ELT (v, i) = CONST0_RTX (inner);
10290 return gen_rtx_CONST_VECTOR (mode, v);
10293 /* Build a decl for a personality function given a language prefix. */
10296 build_personality_function (const char *lang)
10298 const char *unwind_and_version;
10302 switch (targetm.except_unwind_info (&global_options))
10307 unwind_and_version = "_sj0";
10311 unwind_and_version = "_v0";
10314 gcc_unreachable ();
10317 name = ACONCAT (("__", lang, "_personality", unwind_and_version, NULL));
10319 type = build_function_type_list (integer_type_node, integer_type_node,
10320 long_long_unsigned_type_node,
10321 ptr_type_node, ptr_type_node, NULL_TREE);
10322 decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
10323 get_identifier (name), type);
10324 DECL_ARTIFICIAL (decl) = 1;
10325 DECL_EXTERNAL (decl) = 1;
10326 TREE_PUBLIC (decl) = 1;
10328 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
10329 are the flags assigned by targetm.encode_section_info. */
10330 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl), 0), NULL);
10335 /* Extracts the personality function of DECL and returns the corresponding
10339 get_personality_function (tree decl)
10341 tree personality = DECL_FUNCTION_PERSONALITY (decl);
10342 enum eh_personality_kind pk;
10344 pk = function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl));
10345 if (pk == eh_personality_none)
10349 && pk == eh_personality_any)
10350 personality = lang_hooks.eh_personality ();
10352 if (pk == eh_personality_lang)
10353 gcc_assert (personality != NULL_TREE);
10355 return XEXP (DECL_RTL (personality), 0);
10358 #include "gt-expr.h"