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 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1262 int save_volatile_ok = volatile_ok;
1263 enum machine_mode mode;
1265 if (expected_align < align)
1266 expected_align = align;
1268 /* Since this is a move insn, we don't care about volatility. */
1271 /* Try the most limited insn first, because there's no point
1272 including more than one in the machine description unless
1273 the more limited one has some advantage. */
1275 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1276 mode = GET_MODE_WIDER_MODE (mode))
1278 enum insn_code code = direct_optab_handler (movmem_optab, mode);
1279 insn_operand_predicate_fn pred;
1281 if (code != CODE_FOR_nothing
1282 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1283 here because if SIZE is less than the mode mask, as it is
1284 returned by the macro, it will definitely be less than the
1285 actual mode mask. */
1286 && ((CONST_INT_P (size)
1287 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1288 <= (GET_MODE_MASK (mode) >> 1)))
1289 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1290 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1291 || (*pred) (x, BLKmode))
1292 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1293 || (*pred) (y, BLKmode))
1294 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1295 || (*pred) (opalign, VOIDmode)))
1298 rtx last = get_last_insn ();
1301 op2 = convert_to_mode (mode, size, 1);
1302 pred = insn_data[(int) code].operand[2].predicate;
1303 if (pred != 0 && ! (*pred) (op2, mode))
1304 op2 = copy_to_mode_reg (mode, op2);
1306 /* ??? When called via emit_block_move_for_call, it'd be
1307 nice if there were some way to inform the backend, so
1308 that it doesn't fail the expansion because it thinks
1309 emitting the libcall would be more efficient. */
1311 if (insn_data[(int) code].n_operands == 4)
1312 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1314 pat = GEN_FCN ((int) code) (x, y, op2, opalign,
1315 GEN_INT (expected_align
1317 GEN_INT (expected_size));
1321 volatile_ok = save_volatile_ok;
1325 delete_insns_since (last);
1329 volatile_ok = save_volatile_ok;
1333 /* A subroutine of emit_block_move. Expand a call to memcpy.
1334 Return the return value from memcpy, 0 otherwise. */
1337 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1339 rtx dst_addr, src_addr;
1340 tree call_expr, fn, src_tree, dst_tree, size_tree;
1341 enum machine_mode size_mode;
1344 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1345 pseudos. We can then place those new pseudos into a VAR_DECL and
1348 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1349 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1351 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1352 src_addr = convert_memory_address (ptr_mode, src_addr);
1354 dst_tree = make_tree (ptr_type_node, dst_addr);
1355 src_tree = make_tree (ptr_type_node, src_addr);
1357 size_mode = TYPE_MODE (sizetype);
1359 size = convert_to_mode (size_mode, size, 1);
1360 size = copy_to_mode_reg (size_mode, size);
1362 /* It is incorrect to use the libcall calling conventions to call
1363 memcpy in this context. This could be a user call to memcpy and
1364 the user may wish to examine the return value from memcpy. For
1365 targets where libcalls and normal calls have different conventions
1366 for returning pointers, we could end up generating incorrect code. */
1368 size_tree = make_tree (sizetype, size);
1370 fn = emit_block_move_libcall_fn (true);
1371 call_expr = build_call_expr (fn, 3, dst_tree, src_tree, size_tree);
1372 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1374 retval = expand_normal (call_expr);
1379 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1380 for the function we use for block copies. The first time FOR_CALL
1381 is true, we call assemble_external. */
1383 static GTY(()) tree block_move_fn;
1386 init_block_move_fn (const char *asmspec)
1392 fn = get_identifier ("memcpy");
1393 args = build_function_type_list (ptr_type_node, ptr_type_node,
1394 const_ptr_type_node, sizetype,
1397 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
1398 DECL_EXTERNAL (fn) = 1;
1399 TREE_PUBLIC (fn) = 1;
1400 DECL_ARTIFICIAL (fn) = 1;
1401 TREE_NOTHROW (fn) = 1;
1402 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
1403 DECL_VISIBILITY_SPECIFIED (fn) = 1;
1409 set_user_assembler_name (block_move_fn, asmspec);
1413 emit_block_move_libcall_fn (int for_call)
1415 static bool emitted_extern;
1418 init_block_move_fn (NULL);
1420 if (for_call && !emitted_extern)
1422 emitted_extern = true;
1423 make_decl_rtl (block_move_fn);
1424 assemble_external (block_move_fn);
1427 return block_move_fn;
1430 /* A subroutine of emit_block_move. Copy the data via an explicit
1431 loop. This is used only when libcalls are forbidden. */
1432 /* ??? It'd be nice to copy in hunks larger than QImode. */
1435 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1436 unsigned int align ATTRIBUTE_UNUSED)
1438 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1439 enum machine_mode x_addr_mode
1440 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (x));
1441 enum machine_mode y_addr_mode
1442 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (y));
1443 enum machine_mode iter_mode;
1445 iter_mode = GET_MODE (size);
1446 if (iter_mode == VOIDmode)
1447 iter_mode = word_mode;
1449 top_label = gen_label_rtx ();
1450 cmp_label = gen_label_rtx ();
1451 iter = gen_reg_rtx (iter_mode);
1453 emit_move_insn (iter, const0_rtx);
1455 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1456 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1457 do_pending_stack_adjust ();
1459 emit_jump (cmp_label);
1460 emit_label (top_label);
1462 tmp = convert_modes (x_addr_mode, iter_mode, iter, true);
1463 x_addr = gen_rtx_PLUS (x_addr_mode, x_addr, tmp);
1465 if (x_addr_mode != y_addr_mode)
1466 tmp = convert_modes (y_addr_mode, iter_mode, iter, true);
1467 y_addr = gen_rtx_PLUS (y_addr_mode, y_addr, tmp);
1469 x = change_address (x, QImode, x_addr);
1470 y = change_address (y, QImode, y_addr);
1472 emit_move_insn (x, y);
1474 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1475 true, OPTAB_LIB_WIDEN);
1477 emit_move_insn (iter, tmp);
1479 emit_label (cmp_label);
1481 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1485 /* Copy all or part of a value X into registers starting at REGNO.
1486 The number of registers to be filled is NREGS. */
1489 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1492 #ifdef HAVE_load_multiple
1500 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1501 x = validize_mem (force_const_mem (mode, x));
1503 /* See if the machine can do this with a load multiple insn. */
1504 #ifdef HAVE_load_multiple
1505 if (HAVE_load_multiple)
1507 last = get_last_insn ();
1508 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1516 delete_insns_since (last);
1520 for (i = 0; i < nregs; i++)
1521 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1522 operand_subword_force (x, i, mode));
1525 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1526 The number of registers to be filled is NREGS. */
1529 move_block_from_reg (int regno, rtx x, int nregs)
1536 /* See if the machine can do this with a store multiple insn. */
1537 #ifdef HAVE_store_multiple
1538 if (HAVE_store_multiple)
1540 rtx last = get_last_insn ();
1541 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1549 delete_insns_since (last);
1553 for (i = 0; i < nregs; i++)
1555 rtx tem = operand_subword (x, i, 1, BLKmode);
1559 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1563 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1564 ORIG, where ORIG is a non-consecutive group of registers represented by
1565 a PARALLEL. The clone is identical to the original except in that the
1566 original set of registers is replaced by a new set of pseudo registers.
1567 The new set has the same modes as the original set. */
1570 gen_group_rtx (rtx orig)
1575 gcc_assert (GET_CODE (orig) == PARALLEL);
1577 length = XVECLEN (orig, 0);
1578 tmps = XALLOCAVEC (rtx, length);
1580 /* Skip a NULL entry in first slot. */
1581 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1586 for (; i < length; i++)
1588 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1589 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1591 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1594 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1597 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1598 except that values are placed in TMPS[i], and must later be moved
1599 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1602 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1606 enum machine_mode m = GET_MODE (orig_src);
1608 gcc_assert (GET_CODE (dst) == PARALLEL);
1611 && !SCALAR_INT_MODE_P (m)
1612 && !MEM_P (orig_src)
1613 && GET_CODE (orig_src) != CONCAT)
1615 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1616 if (imode == BLKmode)
1617 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1619 src = gen_reg_rtx (imode);
1620 if (imode != BLKmode)
1621 src = gen_lowpart (GET_MODE (orig_src), src);
1622 emit_move_insn (src, orig_src);
1623 /* ...and back again. */
1624 if (imode != BLKmode)
1625 src = gen_lowpart (imode, src);
1626 emit_group_load_1 (tmps, dst, src, type, ssize);
1630 /* Check for a NULL entry, used to indicate that the parameter goes
1631 both on the stack and in registers. */
1632 if (XEXP (XVECEXP (dst, 0, 0), 0))
1637 /* Process the pieces. */
1638 for (i = start; i < XVECLEN (dst, 0); i++)
1640 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1641 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1642 unsigned int bytelen = GET_MODE_SIZE (mode);
1645 /* Handle trailing fragments that run over the size of the struct. */
1646 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1648 /* Arrange to shift the fragment to where it belongs.
1649 extract_bit_field loads to the lsb of the reg. */
1651 #ifdef BLOCK_REG_PADDING
1652 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1653 == (BYTES_BIG_ENDIAN ? upward : downward)
1658 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1659 bytelen = ssize - bytepos;
1660 gcc_assert (bytelen > 0);
1663 /* If we won't be loading directly from memory, protect the real source
1664 from strange tricks we might play; but make sure that the source can
1665 be loaded directly into the destination. */
1667 if (!MEM_P (orig_src)
1668 && (!CONSTANT_P (orig_src)
1669 || (GET_MODE (orig_src) != mode
1670 && GET_MODE (orig_src) != VOIDmode)))
1672 if (GET_MODE (orig_src) == VOIDmode)
1673 src = gen_reg_rtx (mode);
1675 src = gen_reg_rtx (GET_MODE (orig_src));
1677 emit_move_insn (src, orig_src);
1680 /* Optimize the access just a bit. */
1682 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1683 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1684 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1685 && bytelen == GET_MODE_SIZE (mode))
1687 tmps[i] = gen_reg_rtx (mode);
1688 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1690 else if (COMPLEX_MODE_P (mode)
1691 && GET_MODE (src) == mode
1692 && bytelen == GET_MODE_SIZE (mode))
1693 /* Let emit_move_complex do the bulk of the work. */
1695 else if (GET_CODE (src) == CONCAT)
1697 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1698 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1700 if ((bytepos == 0 && bytelen == slen0)
1701 || (bytepos != 0 && bytepos + bytelen <= slen))
1703 /* The following assumes that the concatenated objects all
1704 have the same size. In this case, a simple calculation
1705 can be used to determine the object and the bit field
1707 tmps[i] = XEXP (src, bytepos / slen0);
1708 if (! CONSTANT_P (tmps[i])
1709 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1710 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1711 (bytepos % slen0) * BITS_PER_UNIT,
1712 1, false, NULL_RTX, mode, mode);
1718 gcc_assert (!bytepos);
1719 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1720 emit_move_insn (mem, src);
1721 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1722 0, 1, false, NULL_RTX, mode, mode);
1725 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1726 SIMD register, which is currently broken. While we get GCC
1727 to emit proper RTL for these cases, let's dump to memory. */
1728 else if (VECTOR_MODE_P (GET_MODE (dst))
1731 int slen = GET_MODE_SIZE (GET_MODE (src));
1734 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1735 emit_move_insn (mem, src);
1736 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1738 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1739 && XVECLEN (dst, 0) > 1)
1740 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1741 else if (CONSTANT_P (src))
1743 HOST_WIDE_INT len = (HOST_WIDE_INT) bytelen;
1751 gcc_assert (2 * len == ssize);
1752 split_double (src, &first, &second);
1759 else if (REG_P (src) && GET_MODE (src) == mode)
1762 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1763 bytepos * BITS_PER_UNIT, 1, false, NULL_RTX,
1767 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1768 build_int_cst (NULL_TREE, shift), tmps[i], 0);
1772 /* Emit code to move a block SRC of type TYPE to a block DST,
1773 where DST is non-consecutive registers represented by a PARALLEL.
1774 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1778 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1783 tmps = XALLOCAVEC (rtx, XVECLEN (dst, 0));
1784 emit_group_load_1 (tmps, dst, src, type, ssize);
1786 /* Copy the extracted pieces into the proper (probable) hard regs. */
1787 for (i = 0; i < XVECLEN (dst, 0); i++)
1789 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1792 emit_move_insn (d, tmps[i]);
1796 /* Similar, but load SRC into new pseudos in a format that looks like
1797 PARALLEL. This can later be fed to emit_group_move to get things
1798 in the right place. */
1801 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1806 vec = rtvec_alloc (XVECLEN (parallel, 0));
1807 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1809 /* Convert the vector to look just like the original PARALLEL, except
1810 with the computed values. */
1811 for (i = 0; i < XVECLEN (parallel, 0); i++)
1813 rtx e = XVECEXP (parallel, 0, i);
1814 rtx d = XEXP (e, 0);
1818 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1819 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1821 RTVEC_ELT (vec, i) = e;
1824 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1827 /* Emit code to move a block SRC to block DST, where SRC and DST are
1828 non-consecutive groups of registers, each represented by a PARALLEL. */
1831 emit_group_move (rtx dst, rtx src)
1835 gcc_assert (GET_CODE (src) == PARALLEL
1836 && GET_CODE (dst) == PARALLEL
1837 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1839 /* Skip first entry if NULL. */
1840 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1841 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1842 XEXP (XVECEXP (src, 0, i), 0));
1845 /* Move a group of registers represented by a PARALLEL into pseudos. */
1848 emit_group_move_into_temps (rtx src)
1850 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1853 for (i = 0; i < XVECLEN (src, 0); i++)
1855 rtx e = XVECEXP (src, 0, i);
1856 rtx d = XEXP (e, 0);
1859 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1860 RTVEC_ELT (vec, i) = e;
1863 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1866 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1867 where SRC is non-consecutive registers represented by a PARALLEL.
1868 SSIZE represents the total size of block ORIG_DST, or -1 if not
1872 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1875 int start, finish, i;
1876 enum machine_mode m = GET_MODE (orig_dst);
1878 gcc_assert (GET_CODE (src) == PARALLEL);
1880 if (!SCALAR_INT_MODE_P (m)
1881 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1883 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1884 if (imode == BLKmode)
1885 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1887 dst = gen_reg_rtx (imode);
1888 emit_group_store (dst, src, type, ssize);
1889 if (imode != BLKmode)
1890 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1891 emit_move_insn (orig_dst, dst);
1895 /* Check for a NULL entry, used to indicate that the parameter goes
1896 both on the stack and in registers. */
1897 if (XEXP (XVECEXP (src, 0, 0), 0))
1901 finish = XVECLEN (src, 0);
1903 tmps = XALLOCAVEC (rtx, finish);
1905 /* Copy the (probable) hard regs into pseudos. */
1906 for (i = start; i < finish; i++)
1908 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1909 if (!REG_P (reg) || REGNO (reg) < FIRST_PSEUDO_REGISTER)
1911 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1912 emit_move_insn (tmps[i], reg);
1918 /* If we won't be storing directly into memory, protect the real destination
1919 from strange tricks we might play. */
1921 if (GET_CODE (dst) == PARALLEL)
1925 /* We can get a PARALLEL dst if there is a conditional expression in
1926 a return statement. In that case, the dst and src are the same,
1927 so no action is necessary. */
1928 if (rtx_equal_p (dst, src))
1931 /* It is unclear if we can ever reach here, but we may as well handle
1932 it. Allocate a temporary, and split this into a store/load to/from
1935 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1936 emit_group_store (temp, src, type, ssize);
1937 emit_group_load (dst, temp, type, ssize);
1940 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1942 enum machine_mode outer = GET_MODE (dst);
1943 enum machine_mode inner;
1944 HOST_WIDE_INT bytepos;
1948 if (!REG_P (dst) || REGNO (dst) < FIRST_PSEUDO_REGISTER)
1949 dst = gen_reg_rtx (outer);
1951 /* Make life a bit easier for combine. */
1952 /* If the first element of the vector is the low part
1953 of the destination mode, use a paradoxical subreg to
1954 initialize the destination. */
1957 inner = GET_MODE (tmps[start]);
1958 bytepos = subreg_lowpart_offset (inner, outer);
1959 if (INTVAL (XEXP (XVECEXP (src, 0, start), 1)) == bytepos)
1961 temp = simplify_gen_subreg (outer, tmps[start],
1965 emit_move_insn (dst, temp);
1972 /* If the first element wasn't the low part, try the last. */
1974 && start < finish - 1)
1976 inner = GET_MODE (tmps[finish - 1]);
1977 bytepos = subreg_lowpart_offset (inner, outer);
1978 if (INTVAL (XEXP (XVECEXP (src, 0, finish - 1), 1)) == bytepos)
1980 temp = simplify_gen_subreg (outer, tmps[finish - 1],
1984 emit_move_insn (dst, temp);
1991 /* Otherwise, simply initialize the result to zero. */
1993 emit_move_insn (dst, CONST0_RTX (outer));
1996 /* Process the pieces. */
1997 for (i = start; i < finish; i++)
1999 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2000 enum machine_mode mode = GET_MODE (tmps[i]);
2001 unsigned int bytelen = GET_MODE_SIZE (mode);
2002 unsigned int adj_bytelen = bytelen;
2005 /* Handle trailing fragments that run over the size of the struct. */
2006 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2007 adj_bytelen = ssize - bytepos;
2009 if (GET_CODE (dst) == CONCAT)
2011 if (bytepos + adj_bytelen
2012 <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2013 dest = XEXP (dst, 0);
2014 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2016 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2017 dest = XEXP (dst, 1);
2021 enum machine_mode dest_mode = GET_MODE (dest);
2022 enum machine_mode tmp_mode = GET_MODE (tmps[i]);
2024 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
2026 if (GET_MODE_ALIGNMENT (dest_mode)
2027 >= GET_MODE_ALIGNMENT (tmp_mode))
2029 dest = assign_stack_temp (dest_mode,
2030 GET_MODE_SIZE (dest_mode),
2032 emit_move_insn (adjust_address (dest,
2040 dest = assign_stack_temp (tmp_mode,
2041 GET_MODE_SIZE (tmp_mode),
2043 emit_move_insn (dest, tmps[i]);
2044 dst = adjust_address (dest, dest_mode, bytepos);
2050 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2052 /* store_bit_field always takes its value from the lsb.
2053 Move the fragment to the lsb if it's not already there. */
2055 #ifdef BLOCK_REG_PADDING
2056 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
2057 == (BYTES_BIG_ENDIAN ? upward : downward)
2063 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2064 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
2065 build_int_cst (NULL_TREE, shift),
2068 bytelen = adj_bytelen;
2071 /* Optimize the access just a bit. */
2073 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
2074 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
2075 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2076 && bytelen == GET_MODE_SIZE (mode))
2077 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2079 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2083 /* Copy from the pseudo into the (probable) hard reg. */
2084 if (orig_dst != dst)
2085 emit_move_insn (orig_dst, dst);
2088 /* Generate code to copy a BLKmode object of TYPE out of a
2089 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2090 is null, a stack temporary is created. TGTBLK is returned.
2092 The purpose of this routine is to handle functions that return
2093 BLKmode structures in registers. Some machines (the PA for example)
2094 want to return all small structures in registers regardless of the
2095 structure's alignment. */
2098 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
2100 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2101 rtx src = NULL, dst = NULL;
2102 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2103 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
2104 enum machine_mode copy_mode;
2108 tgtblk = assign_temp (build_qualified_type (type,
2110 | TYPE_QUAL_CONST)),
2112 preserve_temp_slots (tgtblk);
2115 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2116 into a new pseudo which is a full word. */
2118 if (GET_MODE (srcreg) != BLKmode
2119 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2120 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
2122 /* If the structure doesn't take up a whole number of words, see whether
2123 SRCREG is padded on the left or on the right. If it's on the left,
2124 set PADDING_CORRECTION to the number of bits to skip.
2126 In most ABIs, the structure will be returned at the least end of
2127 the register, which translates to right padding on little-endian
2128 targets and left padding on big-endian targets. The opposite
2129 holds if the structure is returned at the most significant
2130 end of the register. */
2131 if (bytes % UNITS_PER_WORD != 0
2132 && (targetm.calls.return_in_msb (type)
2134 : BYTES_BIG_ENDIAN))
2136 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2138 /* Copy the structure BITSIZE bits at a time. If the target lives in
2139 memory, take care of not reading/writing past its end by selecting
2140 a copy mode suited to BITSIZE. This should always be possible given
2143 We could probably emit more efficient code for machines which do not use
2144 strict alignment, but it doesn't seem worth the effort at the current
2147 copy_mode = word_mode;
2150 enum machine_mode mem_mode = mode_for_size (bitsize, MODE_INT, 1);
2151 if (mem_mode != BLKmode)
2152 copy_mode = mem_mode;
2155 for (bitpos = 0, xbitpos = padding_correction;
2156 bitpos < bytes * BITS_PER_UNIT;
2157 bitpos += bitsize, xbitpos += bitsize)
2159 /* We need a new source operand each time xbitpos is on a
2160 word boundary and when xbitpos == padding_correction
2161 (the first time through). */
2162 if (xbitpos % BITS_PER_WORD == 0
2163 || xbitpos == padding_correction)
2164 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2167 /* We need a new destination operand each time bitpos is on
2169 if (bitpos % BITS_PER_WORD == 0)
2170 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2172 /* Use xbitpos for the source extraction (right justified) and
2173 bitpos for the destination store (left justified). */
2174 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, copy_mode,
2175 extract_bit_field (src, bitsize,
2176 xbitpos % BITS_PER_WORD, 1, false,
2177 NULL_RTX, copy_mode, copy_mode));
2183 /* Add a USE expression for REG to the (possibly empty) list pointed
2184 to by CALL_FUSAGE. REG must denote a hard register. */
2187 use_reg (rtx *call_fusage, rtx reg)
2189 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2192 = gen_rtx_EXPR_LIST (VOIDmode,
2193 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2196 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2197 starting at REGNO. All of these registers must be hard registers. */
2200 use_regs (rtx *call_fusage, int regno, int nregs)
2204 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2206 for (i = 0; i < nregs; i++)
2207 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2210 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2211 PARALLEL REGS. This is for calls that pass values in multiple
2212 non-contiguous locations. The Irix 6 ABI has examples of this. */
2215 use_group_regs (rtx *call_fusage, rtx regs)
2219 for (i = 0; i < XVECLEN (regs, 0); i++)
2221 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2223 /* A NULL entry means the parameter goes both on the stack and in
2224 registers. This can also be a MEM for targets that pass values
2225 partially on the stack and partially in registers. */
2226 if (reg != 0 && REG_P (reg))
2227 use_reg (call_fusage, reg);
2231 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2232 assigment and the code of the expresion on the RHS is CODE. Return
2236 get_def_for_expr (tree name, enum tree_code code)
2240 if (TREE_CODE (name) != SSA_NAME)
2243 def_stmt = get_gimple_for_ssa_name (name);
2245 || gimple_assign_rhs_code (def_stmt) != code)
2252 /* Determine whether the LEN bytes generated by CONSTFUN can be
2253 stored to memory using several move instructions. CONSTFUNDATA is
2254 a pointer which will be passed as argument in every CONSTFUN call.
2255 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2256 a memset operation and false if it's a copy of a constant string.
2257 Return nonzero if a call to store_by_pieces should succeed. */
2260 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2261 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2262 void *constfundata, unsigned int align, bool memsetp)
2264 unsigned HOST_WIDE_INT l;
2265 unsigned int max_size;
2266 HOST_WIDE_INT offset = 0;
2267 enum machine_mode mode;
2268 enum insn_code icode;
2270 /* cst is set but not used if LEGITIMATE_CONSTANT doesn't use it. */
2271 rtx cst ATTRIBUTE_UNUSED;
2277 ? SET_BY_PIECES_P (len, align)
2278 : STORE_BY_PIECES_P (len, align)))
2281 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2283 /* We would first store what we can in the largest integer mode, then go to
2284 successively smaller modes. */
2287 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2291 max_size = STORE_MAX_PIECES + 1;
2292 while (max_size > 1)
2294 mode = widest_int_mode_for_size (max_size);
2296 if (mode == VOIDmode)
2299 icode = optab_handler (mov_optab, mode);
2300 if (icode != CODE_FOR_nothing
2301 && align >= GET_MODE_ALIGNMENT (mode))
2303 unsigned int size = GET_MODE_SIZE (mode);
2310 cst = (*constfun) (constfundata, offset, mode);
2311 if (!LEGITIMATE_CONSTANT_P (cst))
2321 max_size = GET_MODE_SIZE (mode);
2324 /* The code above should have handled everything. */
2331 /* Generate several move instructions to store LEN bytes generated by
2332 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2333 pointer which will be passed as argument in every CONSTFUN call.
2334 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2335 a memset operation and false if it's a copy of a constant string.
2336 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2337 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2341 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2342 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2343 void *constfundata, unsigned int align, bool memsetp, int endp)
2345 enum machine_mode to_addr_mode
2346 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
2347 struct store_by_pieces_d data;
2351 gcc_assert (endp != 2);
2356 ? SET_BY_PIECES_P (len, align)
2357 : STORE_BY_PIECES_P (len, align));
2358 data.constfun = constfun;
2359 data.constfundata = constfundata;
2362 store_by_pieces_1 (&data, align);
2367 gcc_assert (!data.reverse);
2372 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2373 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2375 data.to_addr = copy_to_mode_reg (to_addr_mode,
2376 plus_constant (data.to_addr,
2379 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2386 to1 = adjust_address (data.to, QImode, data.offset);
2394 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2395 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2398 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2400 struct store_by_pieces_d data;
2405 data.constfun = clear_by_pieces_1;
2406 data.constfundata = NULL;
2409 store_by_pieces_1 (&data, align);
2412 /* Callback routine for clear_by_pieces.
2413 Return const0_rtx unconditionally. */
2416 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2417 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2418 enum machine_mode mode ATTRIBUTE_UNUSED)
2423 /* Subroutine of clear_by_pieces and store_by_pieces.
2424 Generate several move instructions to store LEN bytes of block TO. (A MEM
2425 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2428 store_by_pieces_1 (struct store_by_pieces_d *data ATTRIBUTE_UNUSED,
2429 unsigned int align ATTRIBUTE_UNUSED)
2431 enum machine_mode to_addr_mode
2432 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (data->to));
2433 rtx to_addr = XEXP (data->to, 0);
2434 unsigned int max_size = STORE_MAX_PIECES + 1;
2435 enum insn_code icode;
2438 data->to_addr = to_addr;
2440 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2441 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2443 data->explicit_inc_to = 0;
2445 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2447 data->offset = data->len;
2449 /* If storing requires more than two move insns,
2450 copy addresses to registers (to make displacements shorter)
2451 and use post-increment if available. */
2452 if (!data->autinc_to
2453 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2455 /* Determine the main mode we'll be using.
2456 MODE might not be used depending on the definitions of the
2457 USE_* macros below. */
2458 enum machine_mode mode ATTRIBUTE_UNUSED
2459 = widest_int_mode_for_size (max_size);
2461 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2463 data->to_addr = copy_to_mode_reg (to_addr_mode,
2464 plus_constant (to_addr, data->len));
2465 data->autinc_to = 1;
2466 data->explicit_inc_to = -1;
2469 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2470 && ! data->autinc_to)
2472 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2473 data->autinc_to = 1;
2474 data->explicit_inc_to = 1;
2477 if ( !data->autinc_to && CONSTANT_P (to_addr))
2478 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2481 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2483 /* First store what we can in the largest integer mode, then go to
2484 successively smaller modes. */
2486 while (max_size > 1)
2488 enum machine_mode mode = widest_int_mode_for_size (max_size);
2490 if (mode == VOIDmode)
2493 icode = optab_handler (mov_optab, mode);
2494 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2495 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2497 max_size = GET_MODE_SIZE (mode);
2500 /* The code above should have handled everything. */
2501 gcc_assert (!data->len);
2504 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2505 with move instructions for mode MODE. GENFUN is the gen_... function
2506 to make a move insn for that mode. DATA has all the other info. */
2509 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2510 struct store_by_pieces_d *data)
2512 unsigned int size = GET_MODE_SIZE (mode);
2515 while (data->len >= size)
2518 data->offset -= size;
2520 if (data->autinc_to)
2521 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2524 to1 = adjust_address (data->to, mode, data->offset);
2526 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2527 emit_insn (gen_add2_insn (data->to_addr,
2528 GEN_INT (-(HOST_WIDE_INT) size)));
2530 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2531 emit_insn ((*genfun) (to1, cst));
2533 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2534 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2536 if (! data->reverse)
2537 data->offset += size;
2543 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2544 its length in bytes. */
2547 clear_storage_hints (rtx object, rtx size, enum block_op_methods method,
2548 unsigned int expected_align, HOST_WIDE_INT expected_size)
2550 enum machine_mode mode = GET_MODE (object);
2553 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2555 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2556 just move a zero. Otherwise, do this a piece at a time. */
2558 && CONST_INT_P (size)
2559 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2561 rtx zero = CONST0_RTX (mode);
2564 emit_move_insn (object, zero);
2568 if (COMPLEX_MODE_P (mode))
2570 zero = CONST0_RTX (GET_MODE_INNER (mode));
2573 write_complex_part (object, zero, 0);
2574 write_complex_part (object, zero, 1);
2580 if (size == const0_rtx)
2583 align = MEM_ALIGN (object);
2585 if (CONST_INT_P (size)
2586 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2587 clear_by_pieces (object, INTVAL (size), align);
2588 else if (set_storage_via_setmem (object, size, const0_rtx, align,
2589 expected_align, expected_size))
2591 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object)))
2592 return set_storage_via_libcall (object, size, const0_rtx,
2593 method == BLOCK_OP_TAILCALL);
2601 clear_storage (rtx object, rtx size, enum block_op_methods method)
2603 return clear_storage_hints (object, size, method, 0, -1);
2607 /* A subroutine of clear_storage. Expand a call to memset.
2608 Return the return value of memset, 0 otherwise. */
2611 set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
2613 tree call_expr, fn, object_tree, size_tree, val_tree;
2614 enum machine_mode size_mode;
2617 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2618 place those into new pseudos into a VAR_DECL and use them later. */
2620 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2622 size_mode = TYPE_MODE (sizetype);
2623 size = convert_to_mode (size_mode, size, 1);
2624 size = copy_to_mode_reg (size_mode, size);
2626 /* It is incorrect to use the libcall calling conventions to call
2627 memset in this context. This could be a user call to memset and
2628 the user may wish to examine the return value from memset. For
2629 targets where libcalls and normal calls have different conventions
2630 for returning pointers, we could end up generating incorrect code. */
2632 object_tree = make_tree (ptr_type_node, object);
2633 if (!CONST_INT_P (val))
2634 val = convert_to_mode (TYPE_MODE (integer_type_node), val, 1);
2635 size_tree = make_tree (sizetype, size);
2636 val_tree = make_tree (integer_type_node, val);
2638 fn = clear_storage_libcall_fn (true);
2639 call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
2640 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2642 retval = expand_normal (call_expr);
2647 /* A subroutine of set_storage_via_libcall. Create the tree node
2648 for the function we use for block clears. The first time FOR_CALL
2649 is true, we call assemble_external. */
2651 tree block_clear_fn;
2654 init_block_clear_fn (const char *asmspec)
2656 if (!block_clear_fn)
2660 fn = get_identifier ("memset");
2661 args = build_function_type_list (ptr_type_node, ptr_type_node,
2662 integer_type_node, sizetype,
2665 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
2666 DECL_EXTERNAL (fn) = 1;
2667 TREE_PUBLIC (fn) = 1;
2668 DECL_ARTIFICIAL (fn) = 1;
2669 TREE_NOTHROW (fn) = 1;
2670 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
2671 DECL_VISIBILITY_SPECIFIED (fn) = 1;
2673 block_clear_fn = fn;
2677 set_user_assembler_name (block_clear_fn, asmspec);
2681 clear_storage_libcall_fn (int for_call)
2683 static bool emitted_extern;
2685 if (!block_clear_fn)
2686 init_block_clear_fn (NULL);
2688 if (for_call && !emitted_extern)
2690 emitted_extern = true;
2691 make_decl_rtl (block_clear_fn);
2692 assemble_external (block_clear_fn);
2695 return block_clear_fn;
2698 /* Expand a setmem pattern; return true if successful. */
2701 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align,
2702 unsigned int expected_align, HOST_WIDE_INT expected_size)
2704 /* Try the most limited insn first, because there's no point
2705 including more than one in the machine description unless
2706 the more limited one has some advantage. */
2708 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2709 enum machine_mode mode;
2711 if (expected_align < align)
2712 expected_align = align;
2714 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2715 mode = GET_MODE_WIDER_MODE (mode))
2717 enum insn_code code = direct_optab_handler (setmem_optab, mode);
2718 insn_operand_predicate_fn pred;
2720 if (code != CODE_FOR_nothing
2721 /* We don't need MODE to be narrower than
2722 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2723 the mode mask, as it is returned by the macro, it will
2724 definitely be less than the actual mode mask. */
2725 && ((CONST_INT_P (size)
2726 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2727 <= (GET_MODE_MASK (mode) >> 1)))
2728 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2729 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2730 || (*pred) (object, BLKmode))
2731 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
2732 || (*pred) (opalign, VOIDmode)))
2735 enum machine_mode char_mode;
2736 rtx last = get_last_insn ();
2739 opsize = convert_to_mode (mode, size, 1);
2740 pred = insn_data[(int) code].operand[1].predicate;
2741 if (pred != 0 && ! (*pred) (opsize, mode))
2742 opsize = copy_to_mode_reg (mode, opsize);
2745 char_mode = insn_data[(int) code].operand[2].mode;
2746 if (char_mode != VOIDmode)
2748 opchar = convert_to_mode (char_mode, opchar, 1);
2749 pred = insn_data[(int) code].operand[2].predicate;
2750 if (pred != 0 && ! (*pred) (opchar, char_mode))
2751 opchar = copy_to_mode_reg (char_mode, opchar);
2754 if (insn_data[(int) code].n_operands == 4)
2755 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign);
2757 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign,
2758 GEN_INT (expected_align
2760 GEN_INT (expected_size));
2767 delete_insns_since (last);
2775 /* Write to one of the components of the complex value CPLX. Write VAL to
2776 the real part if IMAG_P is false, and the imaginary part if its true. */
2779 write_complex_part (rtx cplx, rtx val, bool imag_p)
2781 enum machine_mode cmode;
2782 enum machine_mode imode;
2785 if (GET_CODE (cplx) == CONCAT)
2787 emit_move_insn (XEXP (cplx, imag_p), val);
2791 cmode = GET_MODE (cplx);
2792 imode = GET_MODE_INNER (cmode);
2793 ibitsize = GET_MODE_BITSIZE (imode);
2795 /* For MEMs simplify_gen_subreg may generate an invalid new address
2796 because, e.g., the original address is considered mode-dependent
2797 by the target, which restricts simplify_subreg from invoking
2798 adjust_address_nv. Instead of preparing fallback support for an
2799 invalid address, we call adjust_address_nv directly. */
2802 emit_move_insn (adjust_address_nv (cplx, imode,
2803 imag_p ? GET_MODE_SIZE (imode) : 0),
2808 /* If the sub-object is at least word sized, then we know that subregging
2809 will work. This special case is important, since store_bit_field
2810 wants to operate on integer modes, and there's rarely an OImode to
2811 correspond to TCmode. */
2812 if (ibitsize >= BITS_PER_WORD
2813 /* For hard regs we have exact predicates. Assume we can split
2814 the original object if it spans an even number of hard regs.
2815 This special case is important for SCmode on 64-bit platforms
2816 where the natural size of floating-point regs is 32-bit. */
2818 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2819 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2821 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2822 imag_p ? GET_MODE_SIZE (imode) : 0);
2825 emit_move_insn (part, val);
2829 /* simplify_gen_subreg may fail for sub-word MEMs. */
2830 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2833 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2836 /* Extract one of the components of the complex value CPLX. Extract the
2837 real part if IMAG_P is false, and the imaginary part if it's true. */
2840 read_complex_part (rtx cplx, bool imag_p)
2842 enum machine_mode cmode, imode;
2845 if (GET_CODE (cplx) == CONCAT)
2846 return XEXP (cplx, imag_p);
2848 cmode = GET_MODE (cplx);
2849 imode = GET_MODE_INNER (cmode);
2850 ibitsize = GET_MODE_BITSIZE (imode);
2852 /* Special case reads from complex constants that got spilled to memory. */
2853 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2855 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2856 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2858 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2859 if (CONSTANT_CLASS_P (part))
2860 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2864 /* For MEMs simplify_gen_subreg may generate an invalid new address
2865 because, e.g., the original address is considered mode-dependent
2866 by the target, which restricts simplify_subreg from invoking
2867 adjust_address_nv. Instead of preparing fallback support for an
2868 invalid address, we call adjust_address_nv directly. */
2870 return adjust_address_nv (cplx, imode,
2871 imag_p ? GET_MODE_SIZE (imode) : 0);
2873 /* If the sub-object is at least word sized, then we know that subregging
2874 will work. This special case is important, since extract_bit_field
2875 wants to operate on integer modes, and there's rarely an OImode to
2876 correspond to TCmode. */
2877 if (ibitsize >= BITS_PER_WORD
2878 /* For hard regs we have exact predicates. Assume we can split
2879 the original object if it spans an even number of hard regs.
2880 This special case is important for SCmode on 64-bit platforms
2881 where the natural size of floating-point regs is 32-bit. */
2883 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2884 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2886 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2887 imag_p ? GET_MODE_SIZE (imode) : 0);
2891 /* simplify_gen_subreg may fail for sub-word MEMs. */
2892 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2895 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2896 true, false, NULL_RTX, imode, imode);
2899 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2900 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2901 represented in NEW_MODE. If FORCE is true, this will never happen, as
2902 we'll force-create a SUBREG if needed. */
2905 emit_move_change_mode (enum machine_mode new_mode,
2906 enum machine_mode old_mode, rtx x, bool force)
2910 if (push_operand (x, GET_MODE (x)))
2912 ret = gen_rtx_MEM (new_mode, XEXP (x, 0));
2913 MEM_COPY_ATTRIBUTES (ret, x);
2917 /* We don't have to worry about changing the address since the
2918 size in bytes is supposed to be the same. */
2919 if (reload_in_progress)
2921 /* Copy the MEM to change the mode and move any
2922 substitutions from the old MEM to the new one. */
2923 ret = adjust_address_nv (x, new_mode, 0);
2924 copy_replacements (x, ret);
2927 ret = adjust_address (x, new_mode, 0);
2931 /* Note that we do want simplify_subreg's behavior of validating
2932 that the new mode is ok for a hard register. If we were to use
2933 simplify_gen_subreg, we would create the subreg, but would
2934 probably run into the target not being able to implement it. */
2935 /* Except, of course, when FORCE is true, when this is exactly what
2936 we want. Which is needed for CCmodes on some targets. */
2938 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
2940 ret = simplify_subreg (new_mode, x, old_mode, 0);
2946 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
2947 an integer mode of the same size as MODE. Returns the instruction
2948 emitted, or NULL if such a move could not be generated. */
2951 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y, bool force)
2953 enum machine_mode imode;
2954 enum insn_code code;
2956 /* There must exist a mode of the exact size we require. */
2957 imode = int_mode_for_mode (mode);
2958 if (imode == BLKmode)
2961 /* The target must support moves in this mode. */
2962 code = optab_handler (mov_optab, imode);
2963 if (code == CODE_FOR_nothing)
2966 x = emit_move_change_mode (imode, mode, x, force);
2969 y = emit_move_change_mode (imode, mode, y, force);
2972 return emit_insn (GEN_FCN (code) (x, y));
2975 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
2976 Return an equivalent MEM that does not use an auto-increment. */
2979 emit_move_resolve_push (enum machine_mode mode, rtx x)
2981 enum rtx_code code = GET_CODE (XEXP (x, 0));
2982 HOST_WIDE_INT adjust;
2985 adjust = GET_MODE_SIZE (mode);
2986 #ifdef PUSH_ROUNDING
2987 adjust = PUSH_ROUNDING (adjust);
2989 if (code == PRE_DEC || code == POST_DEC)
2991 else if (code == PRE_MODIFY || code == POST_MODIFY)
2993 rtx expr = XEXP (XEXP (x, 0), 1);
2996 gcc_assert (GET_CODE (expr) == PLUS || GET_CODE (expr) == MINUS);
2997 gcc_assert (CONST_INT_P (XEXP (expr, 1)));
2998 val = INTVAL (XEXP (expr, 1));
2999 if (GET_CODE (expr) == MINUS)
3001 gcc_assert (adjust == val || adjust == -val);
3005 /* Do not use anti_adjust_stack, since we don't want to update
3006 stack_pointer_delta. */
3007 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
3008 GEN_INT (adjust), stack_pointer_rtx,
3009 0, OPTAB_LIB_WIDEN);
3010 if (temp != stack_pointer_rtx)
3011 emit_move_insn (stack_pointer_rtx, temp);
3018 temp = stack_pointer_rtx;
3023 temp = plus_constant (stack_pointer_rtx, -adjust);
3029 return replace_equiv_address (x, temp);
3032 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3033 X is known to satisfy push_operand, and MODE is known to be complex.
3034 Returns the last instruction emitted. */
3037 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
3039 enum machine_mode submode = GET_MODE_INNER (mode);
3042 #ifdef PUSH_ROUNDING
3043 unsigned int submodesize = GET_MODE_SIZE (submode);
3045 /* In case we output to the stack, but the size is smaller than the
3046 machine can push exactly, we need to use move instructions. */
3047 if (PUSH_ROUNDING (submodesize) != submodesize)
3049 x = emit_move_resolve_push (mode, x);
3050 return emit_move_insn (x, y);
3054 /* Note that the real part always precedes the imag part in memory
3055 regardless of machine's endianness. */
3056 switch (GET_CODE (XEXP (x, 0)))
3070 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3071 read_complex_part (y, imag_first));
3072 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3073 read_complex_part (y, !imag_first));
3076 /* A subroutine of emit_move_complex. Perform the move from Y to X
3077 via two moves of the parts. Returns the last instruction emitted. */
3080 emit_move_complex_parts (rtx x, rtx y)
3082 /* Show the output dies here. This is necessary for SUBREGs
3083 of pseudos since we cannot track their lifetimes correctly;
3084 hard regs shouldn't appear here except as return values. */
3085 if (!reload_completed && !reload_in_progress
3086 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
3089 write_complex_part (x, read_complex_part (y, false), false);
3090 write_complex_part (x, read_complex_part (y, true), true);
3092 return get_last_insn ();
3095 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3096 MODE is known to be complex. Returns the last instruction emitted. */
3099 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
3103 /* Need to take special care for pushes, to maintain proper ordering
3104 of the data, and possibly extra padding. */
3105 if (push_operand (x, mode))
3106 return emit_move_complex_push (mode, x, y);
3108 /* See if we can coerce the target into moving both values at once. */
3110 /* Move floating point as parts. */
3111 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
3112 && optab_handler (mov_optab, GET_MODE_INNER (mode)) != CODE_FOR_nothing)
3114 /* Not possible if the values are inherently not adjacent. */
3115 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
3117 /* Is possible if both are registers (or subregs of registers). */
3118 else if (register_operand (x, mode) && register_operand (y, mode))
3120 /* If one of the operands is a memory, and alignment constraints
3121 are friendly enough, we may be able to do combined memory operations.
3122 We do not attempt this if Y is a constant because that combination is
3123 usually better with the by-parts thing below. */
3124 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
3125 && (!STRICT_ALIGNMENT
3126 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
3135 /* For memory to memory moves, optimal behavior can be had with the
3136 existing block move logic. */
3137 if (MEM_P (x) && MEM_P (y))
3139 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
3140 BLOCK_OP_NO_LIBCALL);
3141 return get_last_insn ();
3144 ret = emit_move_via_integer (mode, x, y, true);
3149 return emit_move_complex_parts (x, y);
3152 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3153 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3156 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
3160 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3163 enum insn_code code = optab_handler (mov_optab, CCmode);
3164 if (code != CODE_FOR_nothing)
3166 x = emit_move_change_mode (CCmode, mode, x, true);
3167 y = emit_move_change_mode (CCmode, mode, y, true);
3168 return emit_insn (GEN_FCN (code) (x, y));
3172 /* Otherwise, find the MODE_INT mode of the same width. */
3173 ret = emit_move_via_integer (mode, x, y, false);
3174 gcc_assert (ret != NULL);
3178 /* Return true if word I of OP lies entirely in the
3179 undefined bits of a paradoxical subreg. */
3182 undefined_operand_subword_p (const_rtx op, int i)
3184 enum machine_mode innermode, innermostmode;
3186 if (GET_CODE (op) != SUBREG)
3188 innermode = GET_MODE (op);
3189 innermostmode = GET_MODE (SUBREG_REG (op));
3190 offset = i * UNITS_PER_WORD + SUBREG_BYTE (op);
3191 /* The SUBREG_BYTE represents offset, as if the value were stored in
3192 memory, except for a paradoxical subreg where we define
3193 SUBREG_BYTE to be 0; undo this exception as in
3195 if (SUBREG_BYTE (op) == 0
3196 && GET_MODE_SIZE (innermostmode) < GET_MODE_SIZE (innermode))
3198 int difference = (GET_MODE_SIZE (innermostmode) - GET_MODE_SIZE (innermode));
3199 if (WORDS_BIG_ENDIAN)
3200 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
3201 if (BYTES_BIG_ENDIAN)
3202 offset += difference % UNITS_PER_WORD;
3204 if (offset >= GET_MODE_SIZE (innermostmode)
3205 || offset <= -GET_MODE_SIZE (word_mode))
3210 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3211 MODE is any multi-word or full-word mode that lacks a move_insn
3212 pattern. Note that you will get better code if you define such
3213 patterns, even if they must turn into multiple assembler instructions. */
3216 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3223 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3225 /* If X is a push on the stack, do the push now and replace
3226 X with a reference to the stack pointer. */
3227 if (push_operand (x, mode))
3228 x = emit_move_resolve_push (mode, x);
3230 /* If we are in reload, see if either operand is a MEM whose address
3231 is scheduled for replacement. */
3232 if (reload_in_progress && MEM_P (x)
3233 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3234 x = replace_equiv_address_nv (x, inner);
3235 if (reload_in_progress && MEM_P (y)
3236 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3237 y = replace_equiv_address_nv (y, inner);
3241 need_clobber = false;
3243 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3246 rtx xpart = operand_subword (x, i, 1, mode);
3249 /* Do not generate code for a move if it would come entirely
3250 from the undefined bits of a paradoxical subreg. */
3251 if (undefined_operand_subword_p (y, i))
3254 ypart = operand_subword (y, i, 1, mode);
3256 /* If we can't get a part of Y, put Y into memory if it is a
3257 constant. Otherwise, force it into a register. Then we must
3258 be able to get a part of Y. */
3259 if (ypart == 0 && CONSTANT_P (y))
3261 y = use_anchored_address (force_const_mem (mode, y));
3262 ypart = operand_subword (y, i, 1, mode);
3264 else if (ypart == 0)
3265 ypart = operand_subword_force (y, i, mode);
3267 gcc_assert (xpart && ypart);
3269 need_clobber |= (GET_CODE (xpart) == SUBREG);
3271 last_insn = emit_move_insn (xpart, ypart);
3277 /* Show the output dies here. This is necessary for SUBREGs
3278 of pseudos since we cannot track their lifetimes correctly;
3279 hard regs shouldn't appear here except as return values.
3280 We never want to emit such a clobber after reload. */
3282 && ! (reload_in_progress || reload_completed)
3283 && need_clobber != 0)
3291 /* Low level part of emit_move_insn.
3292 Called just like emit_move_insn, but assumes X and Y
3293 are basically valid. */
3296 emit_move_insn_1 (rtx x, rtx y)
3298 enum machine_mode mode = GET_MODE (x);
3299 enum insn_code code;
3301 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3303 code = optab_handler (mov_optab, mode);
3304 if (code != CODE_FOR_nothing)
3305 return emit_insn (GEN_FCN (code) (x, y));
3307 /* Expand complex moves by moving real part and imag part. */
3308 if (COMPLEX_MODE_P (mode))
3309 return emit_move_complex (mode, x, y);
3311 if (GET_MODE_CLASS (mode) == MODE_DECIMAL_FLOAT
3312 || ALL_FIXED_POINT_MODE_P (mode))
3314 rtx result = emit_move_via_integer (mode, x, y, true);
3316 /* If we can't find an integer mode, use multi words. */
3320 return emit_move_multi_word (mode, x, y);
3323 if (GET_MODE_CLASS (mode) == MODE_CC)
3324 return emit_move_ccmode (mode, x, y);
3326 /* Try using a move pattern for the corresponding integer mode. This is
3327 only safe when simplify_subreg can convert MODE constants into integer
3328 constants. At present, it can only do this reliably if the value
3329 fits within a HOST_WIDE_INT. */
3330 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3332 rtx ret = emit_move_via_integer (mode, x, y, false);
3337 return emit_move_multi_word (mode, x, y);
3340 /* Generate code to copy Y into X.
3341 Both Y and X must have the same mode, except that
3342 Y can be a constant with VOIDmode.
3343 This mode cannot be BLKmode; use emit_block_move for that.
3345 Return the last instruction emitted. */
3348 emit_move_insn (rtx x, rtx y)
3350 enum machine_mode mode = GET_MODE (x);
3351 rtx y_cst = NULL_RTX;
3354 gcc_assert (mode != BLKmode
3355 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3360 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3361 && (last_insn = compress_float_constant (x, y)))
3366 if (!LEGITIMATE_CONSTANT_P (y))
3368 y = force_const_mem (mode, y);
3370 /* If the target's cannot_force_const_mem prevented the spill,
3371 assume that the target's move expanders will also take care
3372 of the non-legitimate constant. */
3376 y = use_anchored_address (y);
3380 /* If X or Y are memory references, verify that their addresses are valid
3383 && (! memory_address_addr_space_p (GET_MODE (x), XEXP (x, 0),
3385 && ! push_operand (x, GET_MODE (x))))
3386 x = validize_mem (x);
3389 && ! memory_address_addr_space_p (GET_MODE (y), XEXP (y, 0),
3390 MEM_ADDR_SPACE (y)))
3391 y = validize_mem (y);
3393 gcc_assert (mode != BLKmode);
3395 last_insn = emit_move_insn_1 (x, y);
3397 if (y_cst && REG_P (x)
3398 && (set = single_set (last_insn)) != NULL_RTX
3399 && SET_DEST (set) == x
3400 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3401 set_unique_reg_note (last_insn, REG_EQUAL, copy_rtx (y_cst));
3406 /* If Y is representable exactly in a narrower mode, and the target can
3407 perform the extension directly from constant or memory, then emit the
3408 move as an extension. */
3411 compress_float_constant (rtx x, rtx y)
3413 enum machine_mode dstmode = GET_MODE (x);
3414 enum machine_mode orig_srcmode = GET_MODE (y);
3415 enum machine_mode srcmode;
3417 int oldcost, newcost;
3418 bool speed = optimize_insn_for_speed_p ();
3420 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3422 if (LEGITIMATE_CONSTANT_P (y))
3423 oldcost = rtx_cost (y, SET, speed);
3425 oldcost = rtx_cost (force_const_mem (dstmode, y), SET, speed);
3427 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3428 srcmode != orig_srcmode;
3429 srcmode = GET_MODE_WIDER_MODE (srcmode))
3432 rtx trunc_y, last_insn;
3434 /* Skip if the target can't extend this way. */
3435 ic = can_extend_p (dstmode, srcmode, 0);
3436 if (ic == CODE_FOR_nothing)
3439 /* Skip if the narrowed value isn't exact. */
3440 if (! exact_real_truncate (srcmode, &r))
3443 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3445 if (LEGITIMATE_CONSTANT_P (trunc_y))
3447 /* Skip if the target needs extra instructions to perform
3449 if (!insn_operand_matches (ic, 1, trunc_y))
3451 /* This is valid, but may not be cheaper than the original. */
3452 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3453 if (oldcost < newcost)
3456 else if (float_extend_from_mem[dstmode][srcmode])
3458 trunc_y = force_const_mem (srcmode, trunc_y);
3459 /* This is valid, but may not be cheaper than the original. */
3460 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3461 if (oldcost < newcost)
3463 trunc_y = validize_mem (trunc_y);
3468 /* For CSE's benefit, force the compressed constant pool entry
3469 into a new pseudo. This constant may be used in different modes,
3470 and if not, combine will put things back together for us. */
3471 trunc_y = force_reg (srcmode, trunc_y);
3472 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3473 last_insn = get_last_insn ();
3476 set_unique_reg_note (last_insn, REG_EQUAL, y);
3484 /* Pushing data onto the stack. */
3486 /* Push a block of length SIZE (perhaps variable)
3487 and return an rtx to address the beginning of the block.
3488 The value may be virtual_outgoing_args_rtx.
3490 EXTRA is the number of bytes of padding to push in addition to SIZE.
3491 BELOW nonzero means this padding comes at low addresses;
3492 otherwise, the padding comes at high addresses. */
3495 push_block (rtx size, int extra, int below)
3499 size = convert_modes (Pmode, ptr_mode, size, 1);
3500 if (CONSTANT_P (size))
3501 anti_adjust_stack (plus_constant (size, extra));
3502 else if (REG_P (size) && extra == 0)
3503 anti_adjust_stack (size);
3506 temp = copy_to_mode_reg (Pmode, size);
3508 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3509 temp, 0, OPTAB_LIB_WIDEN);
3510 anti_adjust_stack (temp);
3513 #ifndef STACK_GROWS_DOWNWARD
3519 temp = virtual_outgoing_args_rtx;
3520 if (extra != 0 && below)
3521 temp = plus_constant (temp, extra);
3525 if (CONST_INT_P (size))
3526 temp = plus_constant (virtual_outgoing_args_rtx,
3527 -INTVAL (size) - (below ? 0 : extra));
3528 else if (extra != 0 && !below)
3529 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3530 negate_rtx (Pmode, plus_constant (size, extra)));
3532 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3533 negate_rtx (Pmode, size));
3536 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3539 #ifdef PUSH_ROUNDING
3541 /* Emit single push insn. */
3544 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3547 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3549 enum insn_code icode;
3550 insn_operand_predicate_fn pred;
3552 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3553 /* If there is push pattern, use it. Otherwise try old way of throwing
3554 MEM representing push operation to move expander. */
3555 icode = optab_handler (push_optab, mode);
3556 if (icode != CODE_FOR_nothing)
3558 if (((pred = insn_data[(int) icode].operand[0].predicate)
3559 && !((*pred) (x, mode))))
3560 x = force_reg (mode, x);
3561 emit_insn (GEN_FCN (icode) (x));
3564 if (GET_MODE_SIZE (mode) == rounded_size)
3565 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3566 /* If we are to pad downward, adjust the stack pointer first and
3567 then store X into the stack location using an offset. This is
3568 because emit_move_insn does not know how to pad; it does not have
3570 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3572 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3573 HOST_WIDE_INT offset;
3575 emit_move_insn (stack_pointer_rtx,
3576 expand_binop (Pmode,
3577 #ifdef STACK_GROWS_DOWNWARD
3583 GEN_INT (rounded_size),
3584 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3586 offset = (HOST_WIDE_INT) padding_size;
3587 #ifdef STACK_GROWS_DOWNWARD
3588 if (STACK_PUSH_CODE == POST_DEC)
3589 /* We have already decremented the stack pointer, so get the
3591 offset += (HOST_WIDE_INT) rounded_size;
3593 if (STACK_PUSH_CODE == POST_INC)
3594 /* We have already incremented the stack pointer, so get the
3596 offset -= (HOST_WIDE_INT) rounded_size;
3598 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3602 #ifdef STACK_GROWS_DOWNWARD
3603 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3604 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3605 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3607 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3608 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3609 GEN_INT (rounded_size));
3611 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3614 dest = gen_rtx_MEM (mode, dest_addr);
3618 set_mem_attributes (dest, type, 1);
3620 if (flag_optimize_sibling_calls)
3621 /* Function incoming arguments may overlap with sibling call
3622 outgoing arguments and we cannot allow reordering of reads
3623 from function arguments with stores to outgoing arguments
3624 of sibling calls. */
3625 set_mem_alias_set (dest, 0);
3627 emit_move_insn (dest, x);
3631 /* Generate code to push X onto the stack, assuming it has mode MODE and
3633 MODE is redundant except when X is a CONST_INT (since they don't
3635 SIZE is an rtx for the size of data to be copied (in bytes),
3636 needed only if X is BLKmode.
3638 ALIGN (in bits) is maximum alignment we can assume.
3640 If PARTIAL and REG are both nonzero, then copy that many of the first
3641 bytes of X into registers starting with REG, and push the rest of X.
3642 The amount of space pushed is decreased by PARTIAL bytes.
3643 REG must be a hard register in this case.
3644 If REG is zero but PARTIAL is not, take any all others actions for an
3645 argument partially in registers, but do not actually load any
3648 EXTRA is the amount in bytes of extra space to leave next to this arg.
3649 This is ignored if an argument block has already been allocated.
3651 On a machine that lacks real push insns, ARGS_ADDR is the address of
3652 the bottom of the argument block for this call. We use indexing off there
3653 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3654 argument block has not been preallocated.
3656 ARGS_SO_FAR is the size of args previously pushed for this call.
3658 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3659 for arguments passed in registers. If nonzero, it will be the number
3660 of bytes required. */
3663 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3664 unsigned int align, int partial, rtx reg, int extra,
3665 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3669 enum direction stack_direction
3670 #ifdef STACK_GROWS_DOWNWARD
3676 /* Decide where to pad the argument: `downward' for below,
3677 `upward' for above, or `none' for don't pad it.
3678 Default is below for small data on big-endian machines; else above. */
3679 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3681 /* Invert direction if stack is post-decrement.
3683 if (STACK_PUSH_CODE == POST_DEC)
3684 if (where_pad != none)
3685 where_pad = (where_pad == downward ? upward : downward);
3690 || (STRICT_ALIGNMENT && align < GET_MODE_ALIGNMENT (mode)))
3692 /* Copy a block into the stack, entirely or partially. */
3699 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3700 used = partial - offset;
3702 if (mode != BLKmode)
3704 /* A value is to be stored in an insufficiently aligned
3705 stack slot; copy via a suitably aligned slot if
3707 size = GEN_INT (GET_MODE_SIZE (mode));
3708 if (!MEM_P (xinner))
3710 temp = assign_temp (type, 0, 1, 1);
3711 emit_move_insn (temp, xinner);
3718 /* USED is now the # of bytes we need not copy to the stack
3719 because registers will take care of them. */
3722 xinner = adjust_address (xinner, BLKmode, used);
3724 /* If the partial register-part of the arg counts in its stack size,
3725 skip the part of stack space corresponding to the registers.
3726 Otherwise, start copying to the beginning of the stack space,
3727 by setting SKIP to 0. */
3728 skip = (reg_parm_stack_space == 0) ? 0 : used;
3730 #ifdef PUSH_ROUNDING
3731 /* Do it with several push insns if that doesn't take lots of insns
3732 and if there is no difficulty with push insns that skip bytes
3733 on the stack for alignment purposes. */
3736 && CONST_INT_P (size)
3738 && MEM_ALIGN (xinner) >= align
3739 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3740 /* Here we avoid the case of a structure whose weak alignment
3741 forces many pushes of a small amount of data,
3742 and such small pushes do rounding that causes trouble. */
3743 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3744 || align >= BIGGEST_ALIGNMENT
3745 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3746 == (align / BITS_PER_UNIT)))
3747 && (HOST_WIDE_INT) PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3749 /* Push padding now if padding above and stack grows down,
3750 or if padding below and stack grows up.
3751 But if space already allocated, this has already been done. */
3752 if (extra && args_addr == 0
3753 && where_pad != none && where_pad != stack_direction)
3754 anti_adjust_stack (GEN_INT (extra));
3756 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3759 #endif /* PUSH_ROUNDING */
3763 /* Otherwise make space on the stack and copy the data
3764 to the address of that space. */
3766 /* Deduct words put into registers from the size we must copy. */
3769 if (CONST_INT_P (size))
3770 size = GEN_INT (INTVAL (size) - used);
3772 size = expand_binop (GET_MODE (size), sub_optab, size,
3773 GEN_INT (used), NULL_RTX, 0,
3777 /* Get the address of the stack space.
3778 In this case, we do not deal with EXTRA separately.
3779 A single stack adjust will do. */
3782 temp = push_block (size, extra, where_pad == downward);
3785 else if (CONST_INT_P (args_so_far))
3786 temp = memory_address (BLKmode,
3787 plus_constant (args_addr,
3788 skip + INTVAL (args_so_far)));
3790 temp = memory_address (BLKmode,
3791 plus_constant (gen_rtx_PLUS (Pmode,
3796 if (!ACCUMULATE_OUTGOING_ARGS)
3798 /* If the source is referenced relative to the stack pointer,
3799 copy it to another register to stabilize it. We do not need
3800 to do this if we know that we won't be changing sp. */
3802 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3803 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3804 temp = copy_to_reg (temp);
3807 target = gen_rtx_MEM (BLKmode, temp);
3809 /* We do *not* set_mem_attributes here, because incoming arguments
3810 may overlap with sibling call outgoing arguments and we cannot
3811 allow reordering of reads from function arguments with stores
3812 to outgoing arguments of sibling calls. We do, however, want
3813 to record the alignment of the stack slot. */
3814 /* ALIGN may well be better aligned than TYPE, e.g. due to
3815 PARM_BOUNDARY. Assume the caller isn't lying. */
3816 set_mem_align (target, align);
3818 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3821 else if (partial > 0)
3823 /* Scalar partly in registers. */
3825 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3828 /* # bytes of start of argument
3829 that we must make space for but need not store. */
3830 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3831 int args_offset = INTVAL (args_so_far);
3834 /* Push padding now if padding above and stack grows down,
3835 or if padding below and stack grows up.
3836 But if space already allocated, this has already been done. */
3837 if (extra && args_addr == 0
3838 && where_pad != none && where_pad != stack_direction)
3839 anti_adjust_stack (GEN_INT (extra));
3841 /* If we make space by pushing it, we might as well push
3842 the real data. Otherwise, we can leave OFFSET nonzero
3843 and leave the space uninitialized. */
3847 /* Now NOT_STACK gets the number of words that we don't need to
3848 allocate on the stack. Convert OFFSET to words too. */
3849 not_stack = (partial - offset) / UNITS_PER_WORD;
3850 offset /= UNITS_PER_WORD;
3852 /* If the partial register-part of the arg counts in its stack size,
3853 skip the part of stack space corresponding to the registers.
3854 Otherwise, start copying to the beginning of the stack space,
3855 by setting SKIP to 0. */
3856 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3858 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3859 x = validize_mem (force_const_mem (mode, x));
3861 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3862 SUBREGs of such registers are not allowed. */
3863 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3864 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3865 x = copy_to_reg (x);
3867 /* Loop over all the words allocated on the stack for this arg. */
3868 /* We can do it by words, because any scalar bigger than a word
3869 has a size a multiple of a word. */
3870 #ifndef PUSH_ARGS_REVERSED
3871 for (i = not_stack; i < size; i++)
3873 for (i = size - 1; i >= not_stack; i--)
3875 if (i >= not_stack + offset)
3876 emit_push_insn (operand_subword_force (x, i, mode),
3877 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3879 GEN_INT (args_offset + ((i - not_stack + skip)
3881 reg_parm_stack_space, alignment_pad);
3888 /* Push padding now if padding above and stack grows down,
3889 or if padding below and stack grows up.
3890 But if space already allocated, this has already been done. */
3891 if (extra && args_addr == 0
3892 && where_pad != none && where_pad != stack_direction)
3893 anti_adjust_stack (GEN_INT (extra));
3895 #ifdef PUSH_ROUNDING
3896 if (args_addr == 0 && PUSH_ARGS)
3897 emit_single_push_insn (mode, x, type);
3901 if (CONST_INT_P (args_so_far))
3903 = memory_address (mode,
3904 plus_constant (args_addr,
3905 INTVAL (args_so_far)));
3907 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3909 dest = gen_rtx_MEM (mode, addr);
3911 /* We do *not* set_mem_attributes here, because incoming arguments
3912 may overlap with sibling call outgoing arguments and we cannot
3913 allow reordering of reads from function arguments with stores
3914 to outgoing arguments of sibling calls. We do, however, want
3915 to record the alignment of the stack slot. */
3916 /* ALIGN may well be better aligned than TYPE, e.g. due to
3917 PARM_BOUNDARY. Assume the caller isn't lying. */
3918 set_mem_align (dest, align);
3920 emit_move_insn (dest, x);
3924 /* If part should go in registers, copy that part
3925 into the appropriate registers. Do this now, at the end,
3926 since mem-to-mem copies above may do function calls. */
3927 if (partial > 0 && reg != 0)
3929 /* Handle calls that pass values in multiple non-contiguous locations.
3930 The Irix 6 ABI has examples of this. */
3931 if (GET_CODE (reg) == PARALLEL)
3932 emit_group_load (reg, x, type, -1);
3935 gcc_assert (partial % UNITS_PER_WORD == 0);
3936 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
3940 if (extra && args_addr == 0 && where_pad == stack_direction)
3941 anti_adjust_stack (GEN_INT (extra));
3943 if (alignment_pad && args_addr == 0)
3944 anti_adjust_stack (alignment_pad);
3947 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3951 get_subtarget (rtx x)
3955 /* Only registers can be subtargets. */
3957 /* Don't use hard regs to avoid extending their life. */
3958 || REGNO (x) < FIRST_PSEUDO_REGISTER
3962 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
3963 FIELD is a bitfield. Returns true if the optimization was successful,
3964 and there's nothing else to do. */
3967 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
3968 unsigned HOST_WIDE_INT bitpos,
3969 enum machine_mode mode1, rtx str_rtx,
3972 enum machine_mode str_mode = GET_MODE (str_rtx);
3973 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
3978 enum tree_code code;
3980 if (mode1 != VOIDmode
3981 || bitsize >= BITS_PER_WORD
3982 || str_bitsize > BITS_PER_WORD
3983 || TREE_SIDE_EFFECTS (to)
3984 || TREE_THIS_VOLATILE (to))
3988 if (TREE_CODE (src) != SSA_NAME)
3990 if (TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
3993 srcstmt = get_gimple_for_ssa_name (src);
3995 || TREE_CODE_CLASS (gimple_assign_rhs_code (srcstmt)) != tcc_binary)
3998 code = gimple_assign_rhs_code (srcstmt);
4000 op0 = gimple_assign_rhs1 (srcstmt);
4002 /* If OP0 is an SSA_NAME, then we want to walk the use-def chain
4003 to find its initialization. Hopefully the initialization will
4004 be from a bitfield load. */
4005 if (TREE_CODE (op0) == SSA_NAME)
4007 gimple op0stmt = get_gimple_for_ssa_name (op0);
4009 /* We want to eventually have OP0 be the same as TO, which
4010 should be a bitfield. */
4012 || !is_gimple_assign (op0stmt)
4013 || gimple_assign_rhs_code (op0stmt) != TREE_CODE (to))
4015 op0 = gimple_assign_rhs1 (op0stmt);
4018 op1 = gimple_assign_rhs2 (srcstmt);
4020 if (!operand_equal_p (to, op0, 0))
4023 if (MEM_P (str_rtx))
4025 unsigned HOST_WIDE_INT offset1;
4027 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
4028 str_mode = word_mode;
4029 str_mode = get_best_mode (bitsize, bitpos,
4030 MEM_ALIGN (str_rtx), str_mode, 0);
4031 if (str_mode == VOIDmode)
4033 str_bitsize = GET_MODE_BITSIZE (str_mode);
4036 bitpos %= str_bitsize;
4037 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
4038 str_rtx = adjust_address (str_rtx, str_mode, offset1);
4040 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
4043 /* If the bit field covers the whole REG/MEM, store_field
4044 will likely generate better code. */
4045 if (bitsize >= str_bitsize)
4048 /* We can't handle fields split across multiple entities. */
4049 if (bitpos + bitsize > str_bitsize)
4052 if (BYTES_BIG_ENDIAN)
4053 bitpos = str_bitsize - bitpos - bitsize;
4059 /* For now, just optimize the case of the topmost bitfield
4060 where we don't need to do any masking and also
4061 1 bit bitfields where xor can be used.
4062 We might win by one instruction for the other bitfields
4063 too if insv/extv instructions aren't used, so that
4064 can be added later. */
4065 if (bitpos + bitsize != str_bitsize
4066 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
4069 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4070 value = convert_modes (str_mode,
4071 TYPE_MODE (TREE_TYPE (op1)), value,
4072 TYPE_UNSIGNED (TREE_TYPE (op1)));
4074 /* We may be accessing data outside the field, which means
4075 we can alias adjacent data. */
4076 if (MEM_P (str_rtx))
4078 str_rtx = shallow_copy_rtx (str_rtx);
4079 set_mem_alias_set (str_rtx, 0);
4080 set_mem_expr (str_rtx, 0);
4083 binop = code == PLUS_EXPR ? add_optab : sub_optab;
4084 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
4086 value = expand_and (str_mode, value, const1_rtx, NULL);
4089 value = expand_shift (LSHIFT_EXPR, str_mode, value,
4090 build_int_cst (NULL_TREE, bitpos),
4092 result = expand_binop (str_mode, binop, str_rtx,
4093 value, str_rtx, 1, OPTAB_WIDEN);
4094 if (result != str_rtx)
4095 emit_move_insn (str_rtx, result);
4100 if (TREE_CODE (op1) != INTEGER_CST)
4102 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), EXPAND_NORMAL);
4103 value = convert_modes (GET_MODE (str_rtx),
4104 TYPE_MODE (TREE_TYPE (op1)), value,
4105 TYPE_UNSIGNED (TREE_TYPE (op1)));
4107 /* We may be accessing data outside the field, which means
4108 we can alias adjacent data. */
4109 if (MEM_P (str_rtx))
4111 str_rtx = shallow_copy_rtx (str_rtx);
4112 set_mem_alias_set (str_rtx, 0);
4113 set_mem_expr (str_rtx, 0);
4116 binop = code == BIT_IOR_EXPR ? ior_optab : xor_optab;
4117 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
4119 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
4121 value = expand_and (GET_MODE (str_rtx), value, mask,
4124 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
4125 build_int_cst (NULL_TREE, bitpos),
4127 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
4128 value, str_rtx, 1, OPTAB_WIDEN);
4129 if (result != str_rtx)
4130 emit_move_insn (str_rtx, result);
4141 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4142 is true, try generating a nontemporal store. */
4145 expand_assignment (tree to, tree from, bool nontemporal)
4149 enum machine_mode mode;
4152 /* Don't crash if the lhs of the assignment was erroneous. */
4153 if (TREE_CODE (to) == ERROR_MARK)
4155 result = expand_normal (from);
4159 /* Optimize away no-op moves without side-effects. */
4160 if (operand_equal_p (to, from, 0))
4163 mode = TYPE_MODE (TREE_TYPE (to));
4164 if ((TREE_CODE (to) == MEM_REF
4165 || TREE_CODE (to) == TARGET_MEM_REF)
4167 && ((align = MAX (TYPE_ALIGN (TREE_TYPE (to)),
4168 get_object_alignment (to, BIGGEST_ALIGNMENT)))
4169 < (signed) GET_MODE_ALIGNMENT (mode))
4170 && ((icode = optab_handler (movmisalign_optab, mode))
4171 != CODE_FOR_nothing))
4173 enum machine_mode address_mode, op_mode1;
4174 rtx insn, reg, op0, mem;
4176 reg = expand_expr (from, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4177 reg = force_not_mem (reg);
4179 if (TREE_CODE (to) == MEM_REF)
4182 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (to, 1))));
4183 tree base = TREE_OPERAND (to, 0);
4184 address_mode = targetm.addr_space.address_mode (as);
4185 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4186 op0 = convert_memory_address_addr_space (address_mode, op0, as);
4187 if (!integer_zerop (TREE_OPERAND (to, 1)))
4190 = immed_double_int_const (mem_ref_offset (to), address_mode);
4191 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
4193 op0 = memory_address_addr_space (mode, op0, as);
4194 mem = gen_rtx_MEM (mode, op0);
4195 set_mem_attributes (mem, to, 0);
4196 set_mem_addr_space (mem, as);
4198 else if (TREE_CODE (to) == TARGET_MEM_REF)
4200 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (to));
4201 struct mem_address addr;
4203 get_address_description (to, &addr);
4204 op0 = addr_for_mem_ref (&addr, as, true);
4205 op0 = memory_address_addr_space (mode, op0, as);
4206 mem = gen_rtx_MEM (mode, op0);
4207 set_mem_attributes (mem, to, 0);
4208 set_mem_addr_space (mem, as);
4212 if (TREE_THIS_VOLATILE (to))
4213 MEM_VOLATILE_P (mem) = 1;
4215 op_mode1 = insn_data[icode].operand[1].mode;
4216 if (! (*insn_data[icode].operand[1].predicate) (reg, op_mode1)
4217 && op_mode1 != VOIDmode)
4218 reg = copy_to_mode_reg (op_mode1, reg);
4220 insn = GEN_FCN (icode) (mem, reg);
4221 /* The movmisalign<mode> pattern cannot fail, else the assignment would
4222 silently be omitted. */
4223 gcc_assert (insn != NULL_RTX);
4228 /* Assignment of a structure component needs special treatment
4229 if the structure component's rtx is not simply a MEM.
4230 Assignment of an array element at a constant index, and assignment of
4231 an array element in an unaligned packed structure field, has the same
4233 if (handled_component_p (to)
4234 /* ??? We only need to handle MEM_REF here if the access is not
4235 a full access of the base object. */
4236 || (TREE_CODE (to) == MEM_REF
4237 && TREE_CODE (TREE_OPERAND (to, 0)) == ADDR_EXPR)
4238 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4240 enum machine_mode mode1;
4241 HOST_WIDE_INT bitsize, bitpos;
4248 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4249 &unsignedp, &volatilep, true);
4251 /* If we are going to use store_bit_field and extract_bit_field,
4252 make sure to_rtx will be safe for multiple use. */
4254 to_rtx = expand_normal (tem);
4256 /* If the bitfield is volatile, we want to access it in the
4257 field's mode, not the computed mode.
4258 If a MEM has VOIDmode (external with incomplete type),
4259 use BLKmode for it instead. */
4262 if (volatilep && flag_strict_volatile_bitfields > 0)
4263 to_rtx = adjust_address (to_rtx, mode1, 0);
4264 else if (GET_MODE (to_rtx) == VOIDmode)
4265 to_rtx = adjust_address (to_rtx, BLKmode, 0);
4270 enum machine_mode address_mode;
4273 if (!MEM_P (to_rtx))
4275 /* We can get constant negative offsets into arrays with broken
4276 user code. Translate this to a trap instead of ICEing. */
4277 gcc_assert (TREE_CODE (offset) == INTEGER_CST);
4278 expand_builtin_trap ();
4279 to_rtx = gen_rtx_MEM (BLKmode, const0_rtx);
4282 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4284 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
4285 if (GET_MODE (offset_rtx) != address_mode)
4286 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
4288 /* A constant address in TO_RTX can have VOIDmode, we must not try
4289 to call force_reg for that case. Avoid that case. */
4291 && GET_MODE (to_rtx) == BLKmode
4292 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4294 && (bitpos % bitsize) == 0
4295 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4296 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4298 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4302 to_rtx = offset_address (to_rtx, offset_rtx,
4303 highest_pow2_factor_for_target (to,
4307 /* No action is needed if the target is not a memory and the field
4308 lies completely outside that target. This can occur if the source
4309 code contains an out-of-bounds access to a small array. */
4311 && GET_MODE (to_rtx) != BLKmode
4312 && (unsigned HOST_WIDE_INT) bitpos
4313 >= GET_MODE_BITSIZE (GET_MODE (to_rtx)))
4315 expand_normal (from);
4318 /* Handle expand_expr of a complex value returning a CONCAT. */
4319 else if (GET_CODE (to_rtx) == CONCAT)
4321 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from))))
4323 gcc_assert (bitpos == 0);
4324 result = store_expr (from, to_rtx, false, nontemporal);
4328 gcc_assert (bitpos == 0 || bitpos == GET_MODE_BITSIZE (mode1));
4329 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false,
4337 /* If the field is at offset zero, we could have been given the
4338 DECL_RTX of the parent struct. Don't munge it. */
4339 to_rtx = shallow_copy_rtx (to_rtx);
4341 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4343 /* Deal with volatile and readonly fields. The former is only
4344 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4346 MEM_VOLATILE_P (to_rtx) = 1;
4347 if (component_uses_parent_alias_set (to))
4348 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4351 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
4355 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
4356 TREE_TYPE (tem), get_alias_set (to),
4361 preserve_temp_slots (result);
4367 /* If the rhs is a function call and its value is not an aggregate,
4368 call the function before we start to compute the lhs.
4369 This is needed for correct code for cases such as
4370 val = setjmp (buf) on machines where reference to val
4371 requires loading up part of an address in a separate insn.
4373 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4374 since it might be a promoted variable where the zero- or sign- extension
4375 needs to be done. Handling this in the normal way is safe because no
4376 computation is done before the call. The same is true for SSA names. */
4377 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
4378 && COMPLETE_TYPE_P (TREE_TYPE (from))
4379 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4380 && ! (((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
4381 && REG_P (DECL_RTL (to)))
4382 || TREE_CODE (to) == SSA_NAME))
4387 value = expand_normal (from);
4389 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4391 /* Handle calls that return values in multiple non-contiguous locations.
4392 The Irix 6 ABI has examples of this. */
4393 if (GET_CODE (to_rtx) == PARALLEL)
4394 emit_group_load (to_rtx, value, TREE_TYPE (from),
4395 int_size_in_bytes (TREE_TYPE (from)));
4396 else if (GET_MODE (to_rtx) == BLKmode)
4397 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4400 if (POINTER_TYPE_P (TREE_TYPE (to)))
4401 value = convert_memory_address_addr_space
4402 (GET_MODE (to_rtx), value,
4403 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to))));
4405 emit_move_insn (to_rtx, value);
4407 preserve_temp_slots (to_rtx);
4413 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4414 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4417 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4419 /* Don't move directly into a return register. */
4420 if (TREE_CODE (to) == RESULT_DECL
4421 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4426 temp = expand_expr (from, NULL_RTX, GET_MODE (to_rtx), EXPAND_NORMAL);
4428 if (GET_CODE (to_rtx) == PARALLEL)
4429 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4430 int_size_in_bytes (TREE_TYPE (from)));
4432 emit_move_insn (to_rtx, temp);
4434 preserve_temp_slots (to_rtx);
4440 /* In case we are returning the contents of an object which overlaps
4441 the place the value is being stored, use a safe function when copying
4442 a value through a pointer into a structure value return block. */
4443 if (TREE_CODE (to) == RESULT_DECL
4444 && TREE_CODE (from) == INDIRECT_REF
4445 && ADDR_SPACE_GENERIC_P
4446 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from, 0)))))
4447 && refs_may_alias_p (to, from)
4448 && cfun->returns_struct
4449 && !cfun->returns_pcc_struct)
4454 size = expr_size (from);
4455 from_rtx = expand_normal (from);
4457 emit_library_call (memmove_libfunc, LCT_NORMAL,
4458 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4459 XEXP (from_rtx, 0), Pmode,
4460 convert_to_mode (TYPE_MODE (sizetype),
4461 size, TYPE_UNSIGNED (sizetype)),
4462 TYPE_MODE (sizetype));
4464 preserve_temp_slots (to_rtx);
4470 /* Compute FROM and store the value in the rtx we got. */
4473 result = store_expr (from, to_rtx, 0, nontemporal);
4474 preserve_temp_slots (result);
4480 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4481 succeeded, false otherwise. */
4484 emit_storent_insn (rtx to, rtx from)
4486 enum machine_mode mode = GET_MODE (to), imode;
4487 enum insn_code code = optab_handler (storent_optab, mode);
4490 if (code == CODE_FOR_nothing)
4493 imode = insn_data[code].operand[0].mode;
4494 if (!insn_data[code].operand[0].predicate (to, imode))
4497 imode = insn_data[code].operand[1].mode;
4498 if (!insn_data[code].operand[1].predicate (from, imode))
4500 from = copy_to_mode_reg (imode, from);
4501 if (!insn_data[code].operand[1].predicate (from, imode))
4505 pattern = GEN_FCN (code) (to, from);
4506 if (pattern == NULL_RTX)
4509 emit_insn (pattern);
4513 /* Generate code for computing expression EXP,
4514 and storing the value into TARGET.
4516 If the mode is BLKmode then we may return TARGET itself.
4517 It turns out that in BLKmode it doesn't cause a problem.
4518 because C has no operators that could combine two different
4519 assignments into the same BLKmode object with different values
4520 with no sequence point. Will other languages need this to
4523 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4524 stack, and block moves may need to be treated specially.
4526 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4529 store_expr (tree exp, rtx target, int call_param_p, bool nontemporal)
4532 rtx alt_rtl = NULL_RTX;
4533 location_t loc = EXPR_LOCATION (exp);
4535 if (VOID_TYPE_P (TREE_TYPE (exp)))
4537 /* C++ can generate ?: expressions with a throw expression in one
4538 branch and an rvalue in the other. Here, we resolve attempts to
4539 store the throw expression's nonexistent result. */
4540 gcc_assert (!call_param_p);
4541 expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4544 if (TREE_CODE (exp) == COMPOUND_EXPR)
4546 /* Perform first part of compound expression, then assign from second
4548 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4549 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4550 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4553 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4555 /* For conditional expression, get safe form of the target. Then
4556 test the condition, doing the appropriate assignment on either
4557 side. This avoids the creation of unnecessary temporaries.
4558 For non-BLKmode, it is more efficient not to do this. */
4560 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4562 do_pending_stack_adjust ();
4564 jumpifnot (TREE_OPERAND (exp, 0), lab1, -1);
4565 store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4567 emit_jump_insn (gen_jump (lab2));
4570 store_expr (TREE_OPERAND (exp, 2), target, call_param_p,
4577 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4578 /* If this is a scalar in a register that is stored in a wider mode
4579 than the declared mode, compute the result into its declared mode
4580 and then convert to the wider mode. Our value is the computed
4583 rtx inner_target = 0;
4585 /* We can do the conversion inside EXP, which will often result
4586 in some optimizations. Do the conversion in two steps: first
4587 change the signedness, if needed, then the extend. But don't
4588 do this if the type of EXP is a subtype of something else
4589 since then the conversion might involve more than just
4590 converting modes. */
4591 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4592 && TREE_TYPE (TREE_TYPE (exp)) == 0
4593 && GET_MODE_PRECISION (GET_MODE (target))
4594 == TYPE_PRECISION (TREE_TYPE (exp)))
4596 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4597 != SUBREG_PROMOTED_UNSIGNED_P (target))
4599 /* Some types, e.g. Fortran's logical*4, won't have a signed
4600 version, so use the mode instead. */
4602 = (signed_or_unsigned_type_for
4603 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)));
4605 ntype = lang_hooks.types.type_for_mode
4606 (TYPE_MODE (TREE_TYPE (exp)),
4607 SUBREG_PROMOTED_UNSIGNED_P (target));
4609 exp = fold_convert_loc (loc, ntype, exp);
4612 exp = fold_convert_loc (loc, lang_hooks.types.type_for_mode
4613 (GET_MODE (SUBREG_REG (target)),
4614 SUBREG_PROMOTED_UNSIGNED_P (target)),
4617 inner_target = SUBREG_REG (target);
4620 temp = expand_expr (exp, inner_target, VOIDmode,
4621 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4623 /* If TEMP is a VOIDmode constant, use convert_modes to make
4624 sure that we properly convert it. */
4625 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4627 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4628 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4629 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4630 GET_MODE (target), temp,
4631 SUBREG_PROMOTED_UNSIGNED_P (target));
4634 convert_move (SUBREG_REG (target), temp,
4635 SUBREG_PROMOTED_UNSIGNED_P (target));
4639 else if ((TREE_CODE (exp) == STRING_CST
4640 || (TREE_CODE (exp) == MEM_REF
4641 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
4642 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4644 && integer_zerop (TREE_OPERAND (exp, 1))))
4645 && !nontemporal && !call_param_p
4648 /* Optimize initialization of an array with a STRING_CST. */
4649 HOST_WIDE_INT exp_len, str_copy_len;
4651 tree str = TREE_CODE (exp) == STRING_CST
4652 ? exp : TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
4654 exp_len = int_expr_size (exp);
4658 if (TREE_STRING_LENGTH (str) <= 0)
4661 str_copy_len = strlen (TREE_STRING_POINTER (str));
4662 if (str_copy_len < TREE_STRING_LENGTH (str) - 1)
4665 str_copy_len = TREE_STRING_LENGTH (str);
4666 if ((STORE_MAX_PIECES & (STORE_MAX_PIECES - 1)) == 0
4667 && TREE_STRING_POINTER (str)[TREE_STRING_LENGTH (str) - 1] == '\0')
4669 str_copy_len += STORE_MAX_PIECES - 1;
4670 str_copy_len &= ~(STORE_MAX_PIECES - 1);
4672 str_copy_len = MIN (str_copy_len, exp_len);
4673 if (!can_store_by_pieces (str_copy_len, builtin_strncpy_read_str,
4674 CONST_CAST (char *, TREE_STRING_POINTER (str)),
4675 MEM_ALIGN (target), false))
4680 dest_mem = store_by_pieces (dest_mem,
4681 str_copy_len, builtin_strncpy_read_str,
4683 TREE_STRING_POINTER (str)),
4684 MEM_ALIGN (target), false,
4685 exp_len > str_copy_len ? 1 : 0);
4686 if (exp_len > str_copy_len)
4687 clear_storage (adjust_address (dest_mem, BLKmode, 0),
4688 GEN_INT (exp_len - str_copy_len),
4697 /* If we want to use a nontemporal store, force the value to
4699 tmp_target = nontemporal ? NULL_RTX : target;
4700 temp = expand_expr_real (exp, tmp_target, GET_MODE (target),
4702 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4706 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4707 the same as that of TARGET, adjust the constant. This is needed, for
4708 example, in case it is a CONST_DOUBLE and we want only a word-sized
4710 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4711 && TREE_CODE (exp) != ERROR_MARK
4712 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4713 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4714 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4716 /* If value was not generated in the target, store it there.
4717 Convert the value to TARGET's type first if necessary and emit the
4718 pending incrementations that have been queued when expanding EXP.
4719 Note that we cannot emit the whole queue blindly because this will
4720 effectively disable the POST_INC optimization later.
4722 If TEMP and TARGET compare equal according to rtx_equal_p, but
4723 one or both of them are volatile memory refs, we have to distinguish
4725 - expand_expr has used TARGET. In this case, we must not generate
4726 another copy. This can be detected by TARGET being equal according
4728 - expand_expr has not used TARGET - that means that the source just
4729 happens to have the same RTX form. Since temp will have been created
4730 by expand_expr, it will compare unequal according to == .
4731 We must generate a copy in this case, to reach the correct number
4732 of volatile memory references. */
4734 if ((! rtx_equal_p (temp, target)
4735 || (temp != target && (side_effects_p (temp)
4736 || side_effects_p (target))))
4737 && TREE_CODE (exp) != ERROR_MARK
4738 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4739 but TARGET is not valid memory reference, TEMP will differ
4740 from TARGET although it is really the same location. */
4742 && rtx_equal_p (alt_rtl, target)
4743 && !side_effects_p (alt_rtl)
4744 && !side_effects_p (target))
4745 /* If there's nothing to copy, don't bother. Don't call
4746 expr_size unless necessary, because some front-ends (C++)
4747 expr_size-hook must not be given objects that are not
4748 supposed to be bit-copied or bit-initialized. */
4749 && expr_size (exp) != const0_rtx)
4751 if (GET_MODE (temp) != GET_MODE (target)
4752 && GET_MODE (temp) != VOIDmode)
4754 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4755 if (GET_MODE (target) == BLKmode
4756 && GET_MODE (temp) == BLKmode)
4757 emit_block_move (target, temp, expr_size (exp),
4759 ? BLOCK_OP_CALL_PARM
4760 : BLOCK_OP_NORMAL));
4761 else if (GET_MODE (target) == BLKmode)
4762 store_bit_field (target, INTVAL (expr_size (exp)) * BITS_PER_UNIT,
4763 0, GET_MODE (temp), temp);
4765 convert_move (target, temp, unsignedp);
4768 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4770 /* Handle copying a string constant into an array. The string
4771 constant may be shorter than the array. So copy just the string's
4772 actual length, and clear the rest. First get the size of the data
4773 type of the string, which is actually the size of the target. */
4774 rtx size = expr_size (exp);
4776 if (CONST_INT_P (size)
4777 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4778 emit_block_move (target, temp, size,
4780 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4783 enum machine_mode pointer_mode
4784 = targetm.addr_space.pointer_mode (MEM_ADDR_SPACE (target));
4785 enum machine_mode address_mode
4786 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (target));
4788 /* Compute the size of the data to copy from the string. */
4790 = size_binop_loc (loc, MIN_EXPR,
4791 make_tree (sizetype, size),
4792 size_int (TREE_STRING_LENGTH (exp)));
4794 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4796 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4799 /* Copy that much. */
4800 copy_size_rtx = convert_to_mode (pointer_mode, copy_size_rtx,
4801 TYPE_UNSIGNED (sizetype));
4802 emit_block_move (target, temp, copy_size_rtx,
4804 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4806 /* Figure out how much is left in TARGET that we have to clear.
4807 Do all calculations in pointer_mode. */
4808 if (CONST_INT_P (copy_size_rtx))
4810 size = plus_constant (size, -INTVAL (copy_size_rtx));
4811 target = adjust_address (target, BLKmode,
4812 INTVAL (copy_size_rtx));
4816 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4817 copy_size_rtx, NULL_RTX, 0,
4820 if (GET_MODE (copy_size_rtx) != address_mode)
4821 copy_size_rtx = convert_to_mode (address_mode,
4823 TYPE_UNSIGNED (sizetype));
4825 target = offset_address (target, copy_size_rtx,
4826 highest_pow2_factor (copy_size));
4827 label = gen_label_rtx ();
4828 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4829 GET_MODE (size), 0, label);
4832 if (size != const0_rtx)
4833 clear_storage (target, size, BLOCK_OP_NORMAL);
4839 /* Handle calls that return values in multiple non-contiguous locations.
4840 The Irix 6 ABI has examples of this. */
4841 else if (GET_CODE (target) == PARALLEL)
4842 emit_group_load (target, temp, TREE_TYPE (exp),
4843 int_size_in_bytes (TREE_TYPE (exp)));
4844 else if (GET_MODE (temp) == BLKmode)
4845 emit_block_move (target, temp, expr_size (exp),
4847 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4848 else if (nontemporal
4849 && emit_storent_insn (target, temp))
4850 /* If we managed to emit a nontemporal store, there is nothing else to
4855 temp = force_operand (temp, target);
4857 emit_move_insn (target, temp);
4864 /* Helper for categorize_ctor_elements. Identical interface. */
4867 categorize_ctor_elements_1 (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4868 HOST_WIDE_INT *p_elt_count,
4871 unsigned HOST_WIDE_INT idx;
4872 HOST_WIDE_INT nz_elts, elt_count;
4873 tree value, purpose;
4875 /* Whether CTOR is a valid constant initializer, in accordance with what
4876 initializer_constant_valid_p does. If inferred from the constructor
4877 elements, true until proven otherwise. */
4878 bool const_from_elts_p = constructor_static_from_elts_p (ctor);
4879 bool const_p = const_from_elts_p ? true : TREE_STATIC (ctor);
4884 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), idx, purpose, value)
4886 HOST_WIDE_INT mult = 1;
4888 if (TREE_CODE (purpose) == RANGE_EXPR)
4890 tree lo_index = TREE_OPERAND (purpose, 0);
4891 tree hi_index = TREE_OPERAND (purpose, 1);
4893 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
4894 mult = (tree_low_cst (hi_index, 1)
4895 - tree_low_cst (lo_index, 1) + 1);
4898 switch (TREE_CODE (value))
4902 HOST_WIDE_INT nz = 0, ic = 0;
4905 = categorize_ctor_elements_1 (value, &nz, &ic, p_must_clear);
4907 nz_elts += mult * nz;
4908 elt_count += mult * ic;
4910 if (const_from_elts_p && const_p)
4911 const_p = const_elt_p;
4918 if (!initializer_zerop (value))
4924 nz_elts += mult * TREE_STRING_LENGTH (value);
4925 elt_count += mult * TREE_STRING_LENGTH (value);
4929 if (!initializer_zerop (TREE_REALPART (value)))
4931 if (!initializer_zerop (TREE_IMAGPART (value)))
4939 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
4941 if (!initializer_zerop (TREE_VALUE (v)))
4950 HOST_WIDE_INT tc = count_type_elements (TREE_TYPE (value), true);
4953 nz_elts += mult * tc;
4954 elt_count += mult * tc;
4956 if (const_from_elts_p && const_p)
4957 const_p = initializer_constant_valid_p (value, TREE_TYPE (value))
4965 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4966 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
4969 bool clear_this = true;
4971 if (!VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (ctor)))
4973 /* We don't expect more than one element of the union to be
4974 initialized. Not sure what we should do otherwise... */
4975 gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ctor))
4978 init_sub_type = TREE_TYPE (VEC_index (constructor_elt,
4979 CONSTRUCTOR_ELTS (ctor),
4982 /* ??? We could look at each element of the union, and find the
4983 largest element. Which would avoid comparing the size of the
4984 initialized element against any tail padding in the union.
4985 Doesn't seem worth the effort... */
4986 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
4987 TYPE_SIZE (init_sub_type)) == 1)
4989 /* And now we have to find out if the element itself is fully
4990 constructed. E.g. for union { struct { int a, b; } s; } u
4991 = { .s = { .a = 1 } }. */
4992 if (elt_count == count_type_elements (init_sub_type, false))
4997 *p_must_clear = clear_this;
5000 *p_nz_elts += nz_elts;
5001 *p_elt_count += elt_count;
5006 /* Examine CTOR to discover:
5007 * how many scalar fields are set to nonzero values,
5008 and place it in *P_NZ_ELTS;
5009 * how many scalar fields in total are in CTOR,
5010 and place it in *P_ELT_COUNT.
5011 * if a type is a union, and the initializer from the constructor
5012 is not the largest element in the union, then set *p_must_clear.
5014 Return whether or not CTOR is a valid static constant initializer, the same
5015 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
5018 categorize_ctor_elements (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
5019 HOST_WIDE_INT *p_elt_count,
5024 *p_must_clear = false;
5027 categorize_ctor_elements_1 (ctor, p_nz_elts, p_elt_count, p_must_clear);
5030 /* Count the number of scalars in TYPE. Return -1 on overflow or
5031 variable-sized. If ALLOW_FLEXARR is true, don't count flexible
5032 array member at the end of the structure. */
5035 count_type_elements (const_tree type, bool allow_flexarr)
5037 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
5038 switch (TREE_CODE (type))
5042 tree telts = array_type_nelts (type);
5043 if (telts && host_integerp (telts, 1))
5045 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
5046 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type), false);
5049 else if (max / n > m)
5057 HOST_WIDE_INT n = 0, t;
5060 for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f))
5061 if (TREE_CODE (f) == FIELD_DECL)
5063 t = count_type_elements (TREE_TYPE (f), false);
5066 /* Check for structures with flexible array member. */
5067 tree tf = TREE_TYPE (f);
5069 && DECL_CHAIN (f) == NULL
5070 && TREE_CODE (tf) == ARRAY_TYPE
5072 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf))
5073 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf)))
5074 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf))
5075 && int_size_in_bytes (type) >= 0)
5087 case QUAL_UNION_TYPE:
5094 return TYPE_VECTOR_SUBPARTS (type);
5098 case FIXED_POINT_TYPE:
5103 case REFERENCE_TYPE:
5118 /* Return 1 if EXP contains mostly (3/4) zeros. */
5121 mostly_zeros_p (const_tree exp)
5123 if (TREE_CODE (exp) == CONSTRUCTOR)
5126 HOST_WIDE_INT nz_elts, count, elts;
5129 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5133 elts = count_type_elements (TREE_TYPE (exp), false);
5135 return nz_elts < elts / 4;
5138 return initializer_zerop (exp);
5141 /* Return 1 if EXP contains all zeros. */
5144 all_zeros_p (const_tree exp)
5146 if (TREE_CODE (exp) == CONSTRUCTOR)
5149 HOST_WIDE_INT nz_elts, count;
5152 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5153 return nz_elts == 0;
5156 return initializer_zerop (exp);
5159 /* Helper function for store_constructor.
5160 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5161 TYPE is the type of the CONSTRUCTOR, not the element type.
5162 CLEARED is as for store_constructor.
5163 ALIAS_SET is the alias set to use for any stores.
5165 This provides a recursive shortcut back to store_constructor when it isn't
5166 necessary to go through store_field. This is so that we can pass through
5167 the cleared field to let store_constructor know that we may not have to
5168 clear a substructure if the outer structure has already been cleared. */
5171 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
5172 HOST_WIDE_INT bitpos, enum machine_mode mode,
5173 tree exp, tree type, int cleared,
5174 alias_set_type alias_set)
5176 if (TREE_CODE (exp) == CONSTRUCTOR
5177 /* We can only call store_constructor recursively if the size and
5178 bit position are on a byte boundary. */
5179 && bitpos % BITS_PER_UNIT == 0
5180 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
5181 /* If we have a nonzero bitpos for a register target, then we just
5182 let store_field do the bitfield handling. This is unlikely to
5183 generate unnecessary clear instructions anyways. */
5184 && (bitpos == 0 || MEM_P (target)))
5188 = adjust_address (target,
5189 GET_MODE (target) == BLKmode
5191 % GET_MODE_ALIGNMENT (GET_MODE (target)))
5192 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
5195 /* Update the alias set, if required. */
5196 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
5197 && MEM_ALIAS_SET (target) != 0)
5199 target = copy_rtx (target);
5200 set_mem_alias_set (target, alias_set);
5203 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
5206 store_field (target, bitsize, bitpos, mode, exp, type, alias_set, false);
5209 /* Store the value of constructor EXP into the rtx TARGET.
5210 TARGET is either a REG or a MEM; we know it cannot conflict, since
5211 safe_from_p has been called.
5212 CLEARED is true if TARGET is known to have been zero'd.
5213 SIZE is the number of bytes of TARGET we are allowed to modify: this
5214 may not be the same as the size of EXP if we are assigning to a field
5215 which has been packed to exclude padding bits. */
5218 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
5220 tree type = TREE_TYPE (exp);
5221 #ifdef WORD_REGISTER_OPERATIONS
5222 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
5225 switch (TREE_CODE (type))
5229 case QUAL_UNION_TYPE:
5231 unsigned HOST_WIDE_INT idx;
5234 /* If size is zero or the target is already cleared, do nothing. */
5235 if (size == 0 || cleared)
5237 /* We either clear the aggregate or indicate the value is dead. */
5238 else if ((TREE_CODE (type) == UNION_TYPE
5239 || TREE_CODE (type) == QUAL_UNION_TYPE)
5240 && ! CONSTRUCTOR_ELTS (exp))
5241 /* If the constructor is empty, clear the union. */
5243 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
5247 /* If we are building a static constructor into a register,
5248 set the initial value as zero so we can fold the value into
5249 a constant. But if more than one register is involved,
5250 this probably loses. */
5251 else if (REG_P (target) && TREE_STATIC (exp)
5252 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
5254 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5258 /* If the constructor has fewer fields than the structure or
5259 if we are initializing the structure to mostly zeros, clear
5260 the whole structure first. Don't do this if TARGET is a
5261 register whose mode size isn't equal to SIZE since
5262 clear_storage can't handle this case. */
5264 && (((int)VEC_length (constructor_elt, CONSTRUCTOR_ELTS (exp))
5265 != fields_length (type))
5266 || mostly_zeros_p (exp))
5268 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
5271 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5275 if (REG_P (target) && !cleared)
5276 emit_clobber (target);
5278 /* Store each element of the constructor into the
5279 corresponding field of TARGET. */
5280 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, field, value)
5282 enum machine_mode mode;
5283 HOST_WIDE_INT bitsize;
5284 HOST_WIDE_INT bitpos = 0;
5286 rtx to_rtx = target;
5288 /* Just ignore missing fields. We cleared the whole
5289 structure, above, if any fields are missing. */
5293 if (cleared && initializer_zerop (value))
5296 if (host_integerp (DECL_SIZE (field), 1))
5297 bitsize = tree_low_cst (DECL_SIZE (field), 1);
5301 mode = DECL_MODE (field);
5302 if (DECL_BIT_FIELD (field))
5305 offset = DECL_FIELD_OFFSET (field);
5306 if (host_integerp (offset, 0)
5307 && host_integerp (bit_position (field), 0))
5309 bitpos = int_bit_position (field);
5313 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
5317 enum machine_mode address_mode;
5321 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
5322 make_tree (TREE_TYPE (exp),
5325 offset_rtx = expand_normal (offset);
5326 gcc_assert (MEM_P (to_rtx));
5329 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
5330 if (GET_MODE (offset_rtx) != address_mode)
5331 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
5333 to_rtx = offset_address (to_rtx, offset_rtx,
5334 highest_pow2_factor (offset));
5337 #ifdef WORD_REGISTER_OPERATIONS
5338 /* If this initializes a field that is smaller than a
5339 word, at the start of a word, try to widen it to a full
5340 word. This special case allows us to output C++ member
5341 function initializations in a form that the optimizers
5344 && bitsize < BITS_PER_WORD
5345 && bitpos % BITS_PER_WORD == 0
5346 && GET_MODE_CLASS (mode) == MODE_INT
5347 && TREE_CODE (value) == INTEGER_CST
5349 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5351 tree type = TREE_TYPE (value);
5353 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5355 type = lang_hooks.types.type_for_size
5356 (BITS_PER_WORD, TYPE_UNSIGNED (type));
5357 value = fold_convert (type, value);
5360 if (BYTES_BIG_ENDIAN)
5362 = fold_build2 (LSHIFT_EXPR, type, value,
5363 build_int_cst (type,
5364 BITS_PER_WORD - bitsize));
5365 bitsize = BITS_PER_WORD;
5370 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5371 && DECL_NONADDRESSABLE_P (field))
5373 to_rtx = copy_rtx (to_rtx);
5374 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5377 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5378 value, type, cleared,
5379 get_alias_set (TREE_TYPE (field)));
5386 unsigned HOST_WIDE_INT i;
5389 tree elttype = TREE_TYPE (type);
5391 HOST_WIDE_INT minelt = 0;
5392 HOST_WIDE_INT maxelt = 0;
5394 domain = TYPE_DOMAIN (type);
5395 const_bounds_p = (TYPE_MIN_VALUE (domain)
5396 && TYPE_MAX_VALUE (domain)
5397 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5398 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5400 /* If we have constant bounds for the range of the type, get them. */
5403 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5404 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5407 /* If the constructor has fewer elements than the array, clear
5408 the whole array first. Similarly if this is static
5409 constructor of a non-BLKmode object. */
5412 else if (REG_P (target) && TREE_STATIC (exp))
5416 unsigned HOST_WIDE_INT idx;
5418 HOST_WIDE_INT count = 0, zero_count = 0;
5419 need_to_clear = ! const_bounds_p;
5421 /* This loop is a more accurate version of the loop in
5422 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5423 is also needed to check for missing elements. */
5424 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, index, value)
5426 HOST_WIDE_INT this_node_count;
5431 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5433 tree lo_index = TREE_OPERAND (index, 0);
5434 tree hi_index = TREE_OPERAND (index, 1);
5436 if (! host_integerp (lo_index, 1)
5437 || ! host_integerp (hi_index, 1))
5443 this_node_count = (tree_low_cst (hi_index, 1)
5444 - tree_low_cst (lo_index, 1) + 1);
5447 this_node_count = 1;
5449 count += this_node_count;
5450 if (mostly_zeros_p (value))
5451 zero_count += this_node_count;
5454 /* Clear the entire array first if there are any missing
5455 elements, or if the incidence of zero elements is >=
5458 && (count < maxelt - minelt + 1
5459 || 4 * zero_count >= 3 * count))
5463 if (need_to_clear && size > 0)
5466 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5468 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5472 if (!cleared && REG_P (target))
5473 /* Inform later passes that the old value is dead. */
5474 emit_clobber (target);
5476 /* Store each element of the constructor into the
5477 corresponding element of TARGET, determined by counting the
5479 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), i, index, value)
5481 enum machine_mode mode;
5482 HOST_WIDE_INT bitsize;
5483 HOST_WIDE_INT bitpos;
5484 rtx xtarget = target;
5486 if (cleared && initializer_zerop (value))
5489 mode = TYPE_MODE (elttype);
5490 if (mode == BLKmode)
5491 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
5492 ? tree_low_cst (TYPE_SIZE (elttype), 1)
5495 bitsize = GET_MODE_BITSIZE (mode);
5497 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5499 tree lo_index = TREE_OPERAND (index, 0);
5500 tree hi_index = TREE_OPERAND (index, 1);
5501 rtx index_r, pos_rtx;
5502 HOST_WIDE_INT lo, hi, count;
5505 /* If the range is constant and "small", unroll the loop. */
5507 && host_integerp (lo_index, 0)
5508 && host_integerp (hi_index, 0)
5509 && (lo = tree_low_cst (lo_index, 0),
5510 hi = tree_low_cst (hi_index, 0),
5511 count = hi - lo + 1,
5514 || (host_integerp (TYPE_SIZE (elttype), 1)
5515 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
5518 lo -= minelt; hi -= minelt;
5519 for (; lo <= hi; lo++)
5521 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
5524 && !MEM_KEEP_ALIAS_SET_P (target)
5525 && TREE_CODE (type) == ARRAY_TYPE
5526 && TYPE_NONALIASED_COMPONENT (type))
5528 target = copy_rtx (target);
5529 MEM_KEEP_ALIAS_SET_P (target) = 1;
5532 store_constructor_field
5533 (target, bitsize, bitpos, mode, value, type, cleared,
5534 get_alias_set (elttype));
5539 rtx loop_start = gen_label_rtx ();
5540 rtx loop_end = gen_label_rtx ();
5543 expand_normal (hi_index);
5545 index = build_decl (EXPR_LOCATION (exp),
5546 VAR_DECL, NULL_TREE, domain);
5547 index_r = gen_reg_rtx (promote_decl_mode (index, NULL));
5548 SET_DECL_RTL (index, index_r);
5549 store_expr (lo_index, index_r, 0, false);
5551 /* Build the head of the loop. */
5552 do_pending_stack_adjust ();
5553 emit_label (loop_start);
5555 /* Assign value to element index. */
5557 fold_convert (ssizetype,
5558 fold_build2 (MINUS_EXPR,
5561 TYPE_MIN_VALUE (domain)));
5564 size_binop (MULT_EXPR, position,
5565 fold_convert (ssizetype,
5566 TYPE_SIZE_UNIT (elttype)));
5568 pos_rtx = expand_normal (position);
5569 xtarget = offset_address (target, pos_rtx,
5570 highest_pow2_factor (position));
5571 xtarget = adjust_address (xtarget, mode, 0);
5572 if (TREE_CODE (value) == CONSTRUCTOR)
5573 store_constructor (value, xtarget, cleared,
5574 bitsize / BITS_PER_UNIT);
5576 store_expr (value, xtarget, 0, false);
5578 /* Generate a conditional jump to exit the loop. */
5579 exit_cond = build2 (LT_EXPR, integer_type_node,
5581 jumpif (exit_cond, loop_end, -1);
5583 /* Update the loop counter, and jump to the head of
5585 expand_assignment (index,
5586 build2 (PLUS_EXPR, TREE_TYPE (index),
5587 index, integer_one_node),
5590 emit_jump (loop_start);
5592 /* Build the end of the loop. */
5593 emit_label (loop_end);
5596 else if ((index != 0 && ! host_integerp (index, 0))
5597 || ! host_integerp (TYPE_SIZE (elttype), 1))
5602 index = ssize_int (1);
5605 index = fold_convert (ssizetype,
5606 fold_build2 (MINUS_EXPR,
5609 TYPE_MIN_VALUE (domain)));
5612 size_binop (MULT_EXPR, index,
5613 fold_convert (ssizetype,
5614 TYPE_SIZE_UNIT (elttype)));
5615 xtarget = offset_address (target,
5616 expand_normal (position),
5617 highest_pow2_factor (position));
5618 xtarget = adjust_address (xtarget, mode, 0);
5619 store_expr (value, xtarget, 0, false);
5624 bitpos = ((tree_low_cst (index, 0) - minelt)
5625 * tree_low_cst (TYPE_SIZE (elttype), 1));
5627 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5629 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5630 && TREE_CODE (type) == ARRAY_TYPE
5631 && TYPE_NONALIASED_COMPONENT (type))
5633 target = copy_rtx (target);
5634 MEM_KEEP_ALIAS_SET_P (target) = 1;
5636 store_constructor_field (target, bitsize, bitpos, mode, value,
5637 type, cleared, get_alias_set (elttype));
5645 unsigned HOST_WIDE_INT idx;
5646 constructor_elt *ce;
5650 tree elttype = TREE_TYPE (type);
5651 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5652 enum machine_mode eltmode = TYPE_MODE (elttype);
5653 HOST_WIDE_INT bitsize;
5654 HOST_WIDE_INT bitpos;
5655 rtvec vector = NULL;
5657 alias_set_type alias;
5659 gcc_assert (eltmode != BLKmode);
5661 n_elts = TYPE_VECTOR_SUBPARTS (type);
5662 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5664 enum machine_mode mode = GET_MODE (target);
5666 icode = (int) optab_handler (vec_init_optab, mode);
5667 if (icode != CODE_FOR_nothing)
5671 vector = rtvec_alloc (n_elts);
5672 for (i = 0; i < n_elts; i++)
5673 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5677 /* If the constructor has fewer elements than the vector,
5678 clear the whole array first. Similarly if this is static
5679 constructor of a non-BLKmode object. */
5682 else if (REG_P (target) && TREE_STATIC (exp))
5686 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5689 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
5691 int n_elts_here = tree_low_cst
5692 (int_const_binop (TRUNC_DIV_EXPR,
5693 TYPE_SIZE (TREE_TYPE (value)),
5694 TYPE_SIZE (elttype), 0), 1);
5696 count += n_elts_here;
5697 if (mostly_zeros_p (value))
5698 zero_count += n_elts_here;
5701 /* Clear the entire vector first if there are any missing elements,
5702 or if the incidence of zero elements is >= 75%. */
5703 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5706 if (need_to_clear && size > 0 && !vector)
5709 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5711 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5715 /* Inform later passes that the old value is dead. */
5716 if (!cleared && !vector && REG_P (target))
5717 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5720 alias = MEM_ALIAS_SET (target);
5722 alias = get_alias_set (elttype);
5724 /* Store each element of the constructor into the corresponding
5725 element of TARGET, determined by counting the elements. */
5726 for (idx = 0, i = 0;
5727 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
5728 idx++, i += bitsize / elt_size)
5730 HOST_WIDE_INT eltpos;
5731 tree value = ce->value;
5733 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5734 if (cleared && initializer_zerop (value))
5738 eltpos = tree_low_cst (ce->index, 1);
5744 /* Vector CONSTRUCTORs should only be built from smaller
5745 vectors in the case of BLKmode vectors. */
5746 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5747 RTVEC_ELT (vector, eltpos)
5748 = expand_normal (value);
5752 enum machine_mode value_mode =
5753 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5754 ? TYPE_MODE (TREE_TYPE (value))
5756 bitpos = eltpos * elt_size;
5757 store_constructor_field (target, bitsize, bitpos,
5758 value_mode, value, type,
5764 emit_insn (GEN_FCN (icode)
5766 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5775 /* Store the value of EXP (an expression tree)
5776 into a subfield of TARGET which has mode MODE and occupies
5777 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5778 If MODE is VOIDmode, it means that we are storing into a bit-field.
5780 Always return const0_rtx unless we have something particular to
5783 TYPE is the type of the underlying object,
5785 ALIAS_SET is the alias set for the destination. This value will
5786 (in general) be different from that for TARGET, since TARGET is a
5787 reference to the containing structure.
5789 If NONTEMPORAL is true, try generating a nontemporal store. */
5792 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5793 enum machine_mode mode, tree exp, tree type,
5794 alias_set_type alias_set, bool nontemporal)
5796 if (TREE_CODE (exp) == ERROR_MARK)
5799 /* If we have nothing to store, do nothing unless the expression has
5802 return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5804 /* If we are storing into an unaligned field of an aligned union that is
5805 in a register, we may have the mode of TARGET being an integer mode but
5806 MODE == BLKmode. In that case, get an aligned object whose size and
5807 alignment are the same as TARGET and store TARGET into it (we can avoid
5808 the store if the field being stored is the entire width of TARGET). Then
5809 call ourselves recursively to store the field into a BLKmode version of
5810 that object. Finally, load from the object into TARGET. This is not
5811 very efficient in general, but should only be slightly more expensive
5812 than the otherwise-required unaligned accesses. Perhaps this can be
5813 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5814 twice, once with emit_move_insn and once via store_field. */
5817 && (REG_P (target) || GET_CODE (target) == SUBREG))
5819 rtx object = assign_temp (type, 0, 1, 1);
5820 rtx blk_object = adjust_address (object, BLKmode, 0);
5822 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5823 emit_move_insn (object, target);
5825 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set,
5828 emit_move_insn (target, object);
5830 /* We want to return the BLKmode version of the data. */
5834 if (GET_CODE (target) == CONCAT)
5836 /* We're storing into a struct containing a single __complex. */
5838 gcc_assert (!bitpos);
5839 return store_expr (exp, target, 0, nontemporal);
5842 /* If the structure is in a register or if the component
5843 is a bit field, we cannot use addressing to access it.
5844 Use bit-field techniques or SUBREG to store in it. */
5846 if (mode == VOIDmode
5847 || (mode != BLKmode && ! direct_store[(int) mode]
5848 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5849 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5851 || GET_CODE (target) == SUBREG
5852 /* If the field isn't aligned enough to store as an ordinary memref,
5853 store it as a bit field. */
5855 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5856 || bitpos % GET_MODE_ALIGNMENT (mode))
5857 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5858 || (bitpos % BITS_PER_UNIT != 0)))
5859 /* If the RHS and field are a constant size and the size of the
5860 RHS isn't the same size as the bitfield, we must use bitfield
5863 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5864 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0)
5865 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
5866 decl we must use bitfield operations. */
5868 && TREE_CODE (exp) == MEM_REF
5869 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
5870 && DECL_P (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
5871 && !TREE_ADDRESSABLE (TREE_OPERAND (TREE_OPERAND (exp, 0),0 ))
5872 && DECL_MODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) != BLKmode))
5877 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5878 implies a mask operation. If the precision is the same size as
5879 the field we're storing into, that mask is redundant. This is
5880 particularly common with bit field assignments generated by the
5882 nop_def = get_def_for_expr (exp, NOP_EXPR);
5885 tree type = TREE_TYPE (exp);
5886 if (INTEGRAL_TYPE_P (type)
5887 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
5888 && bitsize == TYPE_PRECISION (type))
5890 tree op = gimple_assign_rhs1 (nop_def);
5891 type = TREE_TYPE (op);
5892 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
5897 temp = expand_normal (exp);
5899 /* If BITSIZE is narrower than the size of the type of EXP
5900 we will be narrowing TEMP. Normally, what's wanted are the
5901 low-order bits. However, if EXP's type is a record and this is
5902 big-endian machine, we want the upper BITSIZE bits. */
5903 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5904 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5905 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5906 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5907 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5911 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5913 if (mode != VOIDmode && mode != BLKmode
5914 && mode != TYPE_MODE (TREE_TYPE (exp)))
5915 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5917 /* If the modes of TEMP and TARGET are both BLKmode, both
5918 must be in memory and BITPOS must be aligned on a byte
5919 boundary. If so, we simply do a block copy. Likewise
5920 for a BLKmode-like TARGET. */
5921 if (GET_MODE (temp) == BLKmode
5922 && (GET_MODE (target) == BLKmode
5924 && GET_MODE_CLASS (GET_MODE (target)) == MODE_INT
5925 && (bitpos % BITS_PER_UNIT) == 0
5926 && (bitsize % BITS_PER_UNIT) == 0)))
5928 gcc_assert (MEM_P (target) && MEM_P (temp)
5929 && (bitpos % BITS_PER_UNIT) == 0);
5931 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5932 emit_block_move (target, temp,
5933 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5940 /* Store the value in the bitfield. */
5941 store_bit_field (target, bitsize, bitpos, mode, temp);
5947 /* Now build a reference to just the desired component. */
5948 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5950 if (to_rtx == target)
5951 to_rtx = copy_rtx (to_rtx);
5953 if (!MEM_SCALAR_P (to_rtx))
5954 MEM_IN_STRUCT_P (to_rtx) = 1;
5955 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5956 set_mem_alias_set (to_rtx, alias_set);
5958 return store_expr (exp, to_rtx, 0, nontemporal);
5962 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5963 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5964 codes and find the ultimate containing object, which we return.
5966 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5967 bit position, and *PUNSIGNEDP to the signedness of the field.
5968 If the position of the field is variable, we store a tree
5969 giving the variable offset (in units) in *POFFSET.
5970 This offset is in addition to the bit position.
5971 If the position is not variable, we store 0 in *POFFSET.
5973 If any of the extraction expressions is volatile,
5974 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5976 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
5977 Otherwise, it is a mode that can be used to access the field.
5979 If the field describes a variable-sized object, *PMODE is set to
5980 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
5981 this case, but the address of the object can be found.
5983 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5984 look through nodes that serve as markers of a greater alignment than
5985 the one that can be deduced from the expression. These nodes make it
5986 possible for front-ends to prevent temporaries from being created by
5987 the middle-end on alignment considerations. For that purpose, the
5988 normal operating mode at high-level is to always pass FALSE so that
5989 the ultimate containing object is really returned; moreover, the
5990 associated predicate handled_component_p will always return TRUE
5991 on these nodes, thus indicating that they are essentially handled
5992 by get_inner_reference. TRUE should only be passed when the caller
5993 is scanning the expression in order to build another representation
5994 and specifically knows how to handle these nodes; as such, this is
5995 the normal operating mode in the RTL expanders. */
5998 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
5999 HOST_WIDE_INT *pbitpos, tree *poffset,
6000 enum machine_mode *pmode, int *punsignedp,
6001 int *pvolatilep, bool keep_aligning)
6004 enum machine_mode mode = VOIDmode;
6005 bool blkmode_bitfield = false;
6006 tree offset = size_zero_node;
6007 double_int bit_offset = double_int_zero;
6009 /* First get the mode, signedness, and size. We do this from just the
6010 outermost expression. */
6012 if (TREE_CODE (exp) == COMPONENT_REF)
6014 tree field = TREE_OPERAND (exp, 1);
6015 size_tree = DECL_SIZE (field);
6016 if (!DECL_BIT_FIELD (field))
6017 mode = DECL_MODE (field);
6018 else if (DECL_MODE (field) == BLKmode)
6019 blkmode_bitfield = true;
6020 else if (TREE_THIS_VOLATILE (exp)
6021 && flag_strict_volatile_bitfields > 0)
6022 /* Volatile bitfields should be accessed in the mode of the
6023 field's type, not the mode computed based on the bit
6025 mode = TYPE_MODE (DECL_BIT_FIELD_TYPE (field));
6027 *punsignedp = DECL_UNSIGNED (field);
6029 else if (TREE_CODE (exp) == BIT_FIELD_REF)
6031 size_tree = TREE_OPERAND (exp, 1);
6032 *punsignedp = (! INTEGRAL_TYPE_P (TREE_TYPE (exp))
6033 || TYPE_UNSIGNED (TREE_TYPE (exp)));
6035 /* For vector types, with the correct size of access, use the mode of
6037 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == VECTOR_TYPE
6038 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))
6039 && tree_int_cst_equal (size_tree, TYPE_SIZE (TREE_TYPE (exp))))
6040 mode = TYPE_MODE (TREE_TYPE (exp));
6044 mode = TYPE_MODE (TREE_TYPE (exp));
6045 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
6047 if (mode == BLKmode)
6048 size_tree = TYPE_SIZE (TREE_TYPE (exp));
6050 *pbitsize = GET_MODE_BITSIZE (mode);
6055 if (! host_integerp (size_tree, 1))
6056 mode = BLKmode, *pbitsize = -1;
6058 *pbitsize = tree_low_cst (size_tree, 1);
6061 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6062 and find the ultimate containing object. */
6065 switch (TREE_CODE (exp))
6069 = double_int_add (bit_offset,
6070 tree_to_double_int (TREE_OPERAND (exp, 2)));
6075 tree field = TREE_OPERAND (exp, 1);
6076 tree this_offset = component_ref_field_offset (exp);
6078 /* If this field hasn't been filled in yet, don't go past it.
6079 This should only happen when folding expressions made during
6080 type construction. */
6081 if (this_offset == 0)
6084 offset = size_binop (PLUS_EXPR, offset, this_offset);
6085 bit_offset = double_int_add (bit_offset,
6087 (DECL_FIELD_BIT_OFFSET (field)));
6089 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6094 case ARRAY_RANGE_REF:
6096 tree index = TREE_OPERAND (exp, 1);
6097 tree low_bound = array_ref_low_bound (exp);
6098 tree unit_size = array_ref_element_size (exp);
6100 /* We assume all arrays have sizes that are a multiple of a byte.
6101 First subtract the lower bound, if any, in the type of the
6102 index, then convert to sizetype and multiply by the size of
6103 the array element. */
6104 if (! integer_zerop (low_bound))
6105 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
6108 offset = size_binop (PLUS_EXPR, offset,
6109 size_binop (MULT_EXPR,
6110 fold_convert (sizetype, index),
6119 bit_offset = double_int_add (bit_offset,
6120 uhwi_to_double_int (*pbitsize));
6123 case VIEW_CONVERT_EXPR:
6124 if (keep_aligning && STRICT_ALIGNMENT
6125 && (TYPE_ALIGN (TREE_TYPE (exp))
6126 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
6127 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
6128 < BIGGEST_ALIGNMENT)
6129 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
6130 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
6135 /* Hand back the decl for MEM[&decl, off]. */
6136 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)
6138 tree off = TREE_OPERAND (exp, 1);
6139 if (!integer_zerop (off))
6141 double_int boff, coff = mem_ref_offset (exp);
6142 boff = double_int_lshift (coff,
6144 ? 3 : exact_log2 (BITS_PER_UNIT),
6145 HOST_BITS_PER_DOUBLE_INT, true);
6146 bit_offset = double_int_add (bit_offset, boff);
6148 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
6156 /* If any reference in the chain is volatile, the effect is volatile. */
6157 if (TREE_THIS_VOLATILE (exp))
6160 exp = TREE_OPERAND (exp, 0);
6164 /* If OFFSET is constant, see if we can return the whole thing as a
6165 constant bit position. Make sure to handle overflow during
6167 if (host_integerp (offset, 0))
6169 double_int tem = double_int_lshift (tree_to_double_int (offset),
6171 ? 3 : exact_log2 (BITS_PER_UNIT),
6172 HOST_BITS_PER_DOUBLE_INT, true);
6173 tem = double_int_add (tem, bit_offset);
6174 if (double_int_fits_in_shwi_p (tem))
6176 *pbitpos = double_int_to_shwi (tem);
6177 *poffset = offset = NULL_TREE;
6181 /* Otherwise, split it up. */
6184 *pbitpos = double_int_to_shwi (bit_offset);
6188 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6189 if (mode == VOIDmode
6191 && (*pbitpos % BITS_PER_UNIT) == 0
6192 && (*pbitsize % BITS_PER_UNIT) == 0)
6200 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
6201 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
6202 EXP is marked as PACKED. */
6205 contains_packed_reference (const_tree exp)
6207 bool packed_p = false;
6211 switch (TREE_CODE (exp))
6215 tree field = TREE_OPERAND (exp, 1);
6216 packed_p = DECL_PACKED (field)
6217 || TYPE_PACKED (TREE_TYPE (field))
6218 || TYPE_PACKED (TREE_TYPE (exp));
6226 case ARRAY_RANGE_REF:
6229 case VIEW_CONVERT_EXPR:
6235 exp = TREE_OPERAND (exp, 0);
6241 /* Return a tree of sizetype representing the size, in bytes, of the element
6242 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6245 array_ref_element_size (tree exp)
6247 tree aligned_size = TREE_OPERAND (exp, 3);
6248 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6249 location_t loc = EXPR_LOCATION (exp);
6251 /* If a size was specified in the ARRAY_REF, it's the size measured
6252 in alignment units of the element type. So multiply by that value. */
6255 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6256 sizetype from another type of the same width and signedness. */
6257 if (TREE_TYPE (aligned_size) != sizetype)
6258 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
6259 return size_binop_loc (loc, MULT_EXPR, aligned_size,
6260 size_int (TYPE_ALIGN_UNIT (elmt_type)));
6263 /* Otherwise, take the size from that of the element type. Substitute
6264 any PLACEHOLDER_EXPR that we have. */
6266 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
6269 /* Return a tree representing the lower bound of the array mentioned in
6270 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6273 array_ref_low_bound (tree exp)
6275 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6277 /* If a lower bound is specified in EXP, use it. */
6278 if (TREE_OPERAND (exp, 2))
6279 return TREE_OPERAND (exp, 2);
6281 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6282 substituting for a PLACEHOLDER_EXPR as needed. */
6283 if (domain_type && TYPE_MIN_VALUE (domain_type))
6284 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
6286 /* Otherwise, return a zero of the appropriate type. */
6287 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
6290 /* Return a tree representing the upper bound of the array mentioned in
6291 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6294 array_ref_up_bound (tree exp)
6296 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6298 /* If there is a domain type and it has an upper bound, use it, substituting
6299 for a PLACEHOLDER_EXPR as needed. */
6300 if (domain_type && TYPE_MAX_VALUE (domain_type))
6301 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
6303 /* Otherwise fail. */
6307 /* Return a tree representing the offset, in bytes, of the field referenced
6308 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6311 component_ref_field_offset (tree exp)
6313 tree aligned_offset = TREE_OPERAND (exp, 2);
6314 tree field = TREE_OPERAND (exp, 1);
6315 location_t loc = EXPR_LOCATION (exp);
6317 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6318 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6322 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6323 sizetype from another type of the same width and signedness. */
6324 if (TREE_TYPE (aligned_offset) != sizetype)
6325 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
6326 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
6327 size_int (DECL_OFFSET_ALIGN (field)
6331 /* Otherwise, take the offset from that of the field. Substitute
6332 any PLACEHOLDER_EXPR that we have. */
6334 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
6337 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6339 static unsigned HOST_WIDE_INT
6340 target_align (const_tree target)
6342 /* We might have a chain of nested references with intermediate misaligning
6343 bitfields components, so need to recurse to find out. */
6345 unsigned HOST_WIDE_INT this_align, outer_align;
6347 switch (TREE_CODE (target))
6353 this_align = DECL_ALIGN (TREE_OPERAND (target, 1));
6354 outer_align = target_align (TREE_OPERAND (target, 0));
6355 return MIN (this_align, outer_align);
6358 case ARRAY_RANGE_REF:
6359 this_align = TYPE_ALIGN (TREE_TYPE (target));
6360 outer_align = target_align (TREE_OPERAND (target, 0));
6361 return MIN (this_align, outer_align);
6364 case NON_LVALUE_EXPR:
6365 case VIEW_CONVERT_EXPR:
6366 this_align = TYPE_ALIGN (TREE_TYPE (target));
6367 outer_align = target_align (TREE_OPERAND (target, 0));
6368 return MAX (this_align, outer_align);
6371 return TYPE_ALIGN (TREE_TYPE (target));
6376 /* Given an rtx VALUE that may contain additions and multiplications, return
6377 an equivalent value that just refers to a register, memory, or constant.
6378 This is done by generating instructions to perform the arithmetic and
6379 returning a pseudo-register containing the value.
6381 The returned value may be a REG, SUBREG, MEM or constant. */
6384 force_operand (rtx value, rtx target)
6387 /* Use subtarget as the target for operand 0 of a binary operation. */
6388 rtx subtarget = get_subtarget (target);
6389 enum rtx_code code = GET_CODE (value);
6391 /* Check for subreg applied to an expression produced by loop optimizer. */
6393 && !REG_P (SUBREG_REG (value))
6394 && !MEM_P (SUBREG_REG (value)))
6397 = simplify_gen_subreg (GET_MODE (value),
6398 force_reg (GET_MODE (SUBREG_REG (value)),
6399 force_operand (SUBREG_REG (value),
6401 GET_MODE (SUBREG_REG (value)),
6402 SUBREG_BYTE (value));
6403 code = GET_CODE (value);
6406 /* Check for a PIC address load. */
6407 if ((code == PLUS || code == MINUS)
6408 && XEXP (value, 0) == pic_offset_table_rtx
6409 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
6410 || GET_CODE (XEXP (value, 1)) == LABEL_REF
6411 || GET_CODE (XEXP (value, 1)) == CONST))
6414 subtarget = gen_reg_rtx (GET_MODE (value));
6415 emit_move_insn (subtarget, value);
6419 if (ARITHMETIC_P (value))
6421 op2 = XEXP (value, 1);
6422 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
6424 if (code == MINUS && CONST_INT_P (op2))
6427 op2 = negate_rtx (GET_MODE (value), op2);
6430 /* Check for an addition with OP2 a constant integer and our first
6431 operand a PLUS of a virtual register and something else. In that
6432 case, we want to emit the sum of the virtual register and the
6433 constant first and then add the other value. This allows virtual
6434 register instantiation to simply modify the constant rather than
6435 creating another one around this addition. */
6436 if (code == PLUS && CONST_INT_P (op2)
6437 && GET_CODE (XEXP (value, 0)) == PLUS
6438 && REG_P (XEXP (XEXP (value, 0), 0))
6439 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6440 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
6442 rtx temp = expand_simple_binop (GET_MODE (value), code,
6443 XEXP (XEXP (value, 0), 0), op2,
6444 subtarget, 0, OPTAB_LIB_WIDEN);
6445 return expand_simple_binop (GET_MODE (value), code, temp,
6446 force_operand (XEXP (XEXP (value,
6448 target, 0, OPTAB_LIB_WIDEN);
6451 op1 = force_operand (XEXP (value, 0), subtarget);
6452 op2 = force_operand (op2, NULL_RTX);
6456 return expand_mult (GET_MODE (value), op1, op2, target, 1);
6458 if (!INTEGRAL_MODE_P (GET_MODE (value)))
6459 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6460 target, 1, OPTAB_LIB_WIDEN);
6462 return expand_divmod (0,
6463 FLOAT_MODE_P (GET_MODE (value))
6464 ? RDIV_EXPR : TRUNC_DIV_EXPR,
6465 GET_MODE (value), op1, op2, target, 0);
6467 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6470 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
6473 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6476 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6477 target, 0, OPTAB_LIB_WIDEN);
6479 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6480 target, 1, OPTAB_LIB_WIDEN);
6483 if (UNARY_P (value))
6486 target = gen_reg_rtx (GET_MODE (value));
6487 op1 = force_operand (XEXP (value, 0), NULL_RTX);
6494 case FLOAT_TRUNCATE:
6495 convert_move (target, op1, code == ZERO_EXTEND);
6500 expand_fix (target, op1, code == UNSIGNED_FIX);
6504 case UNSIGNED_FLOAT:
6505 expand_float (target, op1, code == UNSIGNED_FLOAT);
6509 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
6513 #ifdef INSN_SCHEDULING
6514 /* On machines that have insn scheduling, we want all memory reference to be
6515 explicit, so we need to deal with such paradoxical SUBREGs. */
6516 if (GET_CODE (value) == SUBREG && MEM_P (SUBREG_REG (value))
6517 && (GET_MODE_SIZE (GET_MODE (value))
6518 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
6520 = simplify_gen_subreg (GET_MODE (value),
6521 force_reg (GET_MODE (SUBREG_REG (value)),
6522 force_operand (SUBREG_REG (value),
6524 GET_MODE (SUBREG_REG (value)),
6525 SUBREG_BYTE (value));
6531 /* Subroutine of expand_expr: return nonzero iff there is no way that
6532 EXP can reference X, which is being modified. TOP_P is nonzero if this
6533 call is going to be used to determine whether we need a temporary
6534 for EXP, as opposed to a recursive call to this function.
6536 It is always safe for this routine to return zero since it merely
6537 searches for optimization opportunities. */
6540 safe_from_p (const_rtx x, tree exp, int top_p)
6546 /* If EXP has varying size, we MUST use a target since we currently
6547 have no way of allocating temporaries of variable size
6548 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6549 So we assume here that something at a higher level has prevented a
6550 clash. This is somewhat bogus, but the best we can do. Only
6551 do this when X is BLKmode and when we are at the top level. */
6552 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6553 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
6554 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
6555 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
6556 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
6558 && GET_MODE (x) == BLKmode)
6559 /* If X is in the outgoing argument area, it is always safe. */
6561 && (XEXP (x, 0) == virtual_outgoing_args_rtx
6562 || (GET_CODE (XEXP (x, 0)) == PLUS
6563 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
6566 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6567 find the underlying pseudo. */
6568 if (GET_CODE (x) == SUBREG)
6571 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6575 /* Now look at our tree code and possibly recurse. */
6576 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
6578 case tcc_declaration:
6579 exp_rtl = DECL_RTL_IF_SET (exp);
6585 case tcc_exceptional:
6586 if (TREE_CODE (exp) == TREE_LIST)
6590 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
6592 exp = TREE_CHAIN (exp);
6595 if (TREE_CODE (exp) != TREE_LIST)
6596 return safe_from_p (x, exp, 0);
6599 else if (TREE_CODE (exp) == CONSTRUCTOR)
6601 constructor_elt *ce;
6602 unsigned HOST_WIDE_INT idx;
6604 FOR_EACH_VEC_ELT (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce)
6605 if ((ce->index != NULL_TREE && !safe_from_p (x, ce->index, 0))
6606 || !safe_from_p (x, ce->value, 0))
6610 else if (TREE_CODE (exp) == ERROR_MARK)
6611 return 1; /* An already-visited SAVE_EXPR? */
6616 /* The only case we look at here is the DECL_INITIAL inside a
6618 return (TREE_CODE (exp) != DECL_EXPR
6619 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
6620 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
6621 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
6624 case tcc_comparison:
6625 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
6630 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6632 case tcc_expression:
6635 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6636 the expression. If it is set, we conflict iff we are that rtx or
6637 both are in memory. Otherwise, we check all operands of the
6638 expression recursively. */
6640 switch (TREE_CODE (exp))
6643 /* If the operand is static or we are static, we can't conflict.
6644 Likewise if we don't conflict with the operand at all. */
6645 if (staticp (TREE_OPERAND (exp, 0))
6646 || TREE_STATIC (exp)
6647 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
6650 /* Otherwise, the only way this can conflict is if we are taking
6651 the address of a DECL a that address if part of X, which is
6653 exp = TREE_OPERAND (exp, 0);
6656 if (!DECL_RTL_SET_P (exp)
6657 || !MEM_P (DECL_RTL (exp)))
6660 exp_rtl = XEXP (DECL_RTL (exp), 0);
6666 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
6667 get_alias_set (exp)))
6672 /* Assume that the call will clobber all hard registers and
6674 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6679 case WITH_CLEANUP_EXPR:
6680 case CLEANUP_POINT_EXPR:
6681 /* Lowered by gimplify.c. */
6685 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6691 /* If we have an rtx, we do not need to scan our operands. */
6695 nops = TREE_OPERAND_LENGTH (exp);
6696 for (i = 0; i < nops; i++)
6697 if (TREE_OPERAND (exp, i) != 0
6698 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
6704 /* Should never get a type here. */
6708 /* If we have an rtl, find any enclosed object. Then see if we conflict
6712 if (GET_CODE (exp_rtl) == SUBREG)
6714 exp_rtl = SUBREG_REG (exp_rtl);
6716 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
6720 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6721 are memory and they conflict. */
6722 return ! (rtx_equal_p (x, exp_rtl)
6723 || (MEM_P (x) && MEM_P (exp_rtl)
6724 && true_dependence (exp_rtl, VOIDmode, x,
6725 rtx_addr_varies_p)));
6728 /* If we reach here, it is safe. */
6733 /* Return the highest power of two that EXP is known to be a multiple of.
6734 This is used in updating alignment of MEMs in array references. */
6736 unsigned HOST_WIDE_INT
6737 highest_pow2_factor (const_tree exp)
6739 unsigned HOST_WIDE_INT c0, c1;
6741 switch (TREE_CODE (exp))
6744 /* We can find the lowest bit that's a one. If the low
6745 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6746 We need to handle this case since we can find it in a COND_EXPR,
6747 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
6748 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6750 if (TREE_OVERFLOW (exp))
6751 return BIGGEST_ALIGNMENT;
6754 /* Note: tree_low_cst is intentionally not used here,
6755 we don't care about the upper bits. */
6756 c0 = TREE_INT_CST_LOW (exp);
6758 return c0 ? c0 : BIGGEST_ALIGNMENT;
6762 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6763 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6764 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6765 return MIN (c0, c1);
6768 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6769 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6772 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6774 if (integer_pow2p (TREE_OPERAND (exp, 1))
6775 && host_integerp (TREE_OPERAND (exp, 1), 1))
6777 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6778 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6779 return MAX (1, c0 / c1);
6784 /* The highest power of two of a bit-and expression is the maximum of
6785 that of its operands. We typically get here for a complex LHS and
6786 a constant negative power of two on the RHS to force an explicit
6787 alignment, so don't bother looking at the LHS. */
6788 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6792 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6795 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6798 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6799 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6800 return MIN (c0, c1);
6809 /* Similar, except that the alignment requirements of TARGET are
6810 taken into account. Assume it is at least as aligned as its
6811 type, unless it is a COMPONENT_REF in which case the layout of
6812 the structure gives the alignment. */
6814 static unsigned HOST_WIDE_INT
6815 highest_pow2_factor_for_target (const_tree target, const_tree exp)
6817 unsigned HOST_WIDE_INT talign = target_align (target) / BITS_PER_UNIT;
6818 unsigned HOST_WIDE_INT factor = highest_pow2_factor (exp);
6820 return MAX (factor, talign);
6823 /* Subroutine of expand_expr. Expand the two operands of a binary
6824 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6825 The value may be stored in TARGET if TARGET is nonzero. The
6826 MODIFIER argument is as documented by expand_expr. */
6829 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6830 enum expand_modifier modifier)
6832 if (! safe_from_p (target, exp1, 1))
6834 if (operand_equal_p (exp0, exp1, 0))
6836 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6837 *op1 = copy_rtx (*op0);
6841 /* If we need to preserve evaluation order, copy exp0 into its own
6842 temporary variable so that it can't be clobbered by exp1. */
6843 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6844 exp0 = save_expr (exp0);
6845 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6846 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6851 /* Return a MEM that contains constant EXP. DEFER is as for
6852 output_constant_def and MODIFIER is as for expand_expr. */
6855 expand_expr_constant (tree exp, int defer, enum expand_modifier modifier)
6859 mem = output_constant_def (exp, defer);
6860 if (modifier != EXPAND_INITIALIZER)
6861 mem = use_anchored_address (mem);
6865 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6866 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6869 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
6870 enum expand_modifier modifier, addr_space_t as)
6872 rtx result, subtarget;
6874 HOST_WIDE_INT bitsize, bitpos;
6875 int volatilep, unsignedp;
6876 enum machine_mode mode1;
6878 /* If we are taking the address of a constant and are at the top level,
6879 we have to use output_constant_def since we can't call force_const_mem
6881 /* ??? This should be considered a front-end bug. We should not be
6882 generating ADDR_EXPR of something that isn't an LVALUE. The only
6883 exception here is STRING_CST. */
6884 if (CONSTANT_CLASS_P (exp))
6885 return XEXP (expand_expr_constant (exp, 0, modifier), 0);
6887 /* Everything must be something allowed by is_gimple_addressable. */
6888 switch (TREE_CODE (exp))
6891 /* This case will happen via recursion for &a->b. */
6892 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6896 tree tem = TREE_OPERAND (exp, 0);
6897 if (!integer_zerop (TREE_OPERAND (exp, 1)))
6898 tem = build2 (POINTER_PLUS_EXPR, TREE_TYPE (TREE_OPERAND (exp, 1)),
6900 double_int_to_tree (sizetype, mem_ref_offset (exp)));
6901 return expand_expr (tem, target, tmode, modifier);
6905 /* Expand the initializer like constants above. */
6906 return XEXP (expand_expr_constant (DECL_INITIAL (exp), 0, modifier), 0);
6909 /* The real part of the complex number is always first, therefore
6910 the address is the same as the address of the parent object. */
6913 inner = TREE_OPERAND (exp, 0);
6917 /* The imaginary part of the complex number is always second.
6918 The expression is therefore always offset by the size of the
6921 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
6922 inner = TREE_OPERAND (exp, 0);
6926 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6927 expand_expr, as that can have various side effects; LABEL_DECLs for
6928 example, may not have their DECL_RTL set yet. Expand the rtl of
6929 CONSTRUCTORs too, which should yield a memory reference for the
6930 constructor's contents. Assume language specific tree nodes can
6931 be expanded in some interesting way. */
6932 gcc_assert (TREE_CODE (exp) < LAST_AND_UNUSED_TREE_CODE);
6934 || TREE_CODE (exp) == CONSTRUCTOR
6935 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
6937 result = expand_expr (exp, target, tmode,
6938 modifier == EXPAND_INITIALIZER
6939 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
6941 /* If the DECL isn't in memory, then the DECL wasn't properly
6942 marked TREE_ADDRESSABLE, which will be either a front-end
6943 or a tree optimizer bug. */
6944 gcc_assert (MEM_P (result));
6945 result = XEXP (result, 0);
6947 /* ??? Is this needed anymore? */
6948 if (DECL_P (exp) && !TREE_USED (exp) == 0)
6950 assemble_external (exp);
6951 TREE_USED (exp) = 1;
6954 if (modifier != EXPAND_INITIALIZER
6955 && modifier != EXPAND_CONST_ADDRESS)
6956 result = force_operand (result, target);
6960 /* Pass FALSE as the last argument to get_inner_reference although
6961 we are expanding to RTL. The rationale is that we know how to
6962 handle "aligning nodes" here: we can just bypass them because
6963 they won't change the final object whose address will be returned
6964 (they actually exist only for that purpose). */
6965 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6966 &mode1, &unsignedp, &volatilep, false);
6970 /* We must have made progress. */
6971 gcc_assert (inner != exp);
6973 subtarget = offset || bitpos ? NULL_RTX : target;
6974 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
6975 inner alignment, force the inner to be sufficiently aligned. */
6976 if (CONSTANT_CLASS_P (inner)
6977 && TYPE_ALIGN (TREE_TYPE (inner)) < TYPE_ALIGN (TREE_TYPE (exp)))
6979 inner = copy_node (inner);
6980 TREE_TYPE (inner) = copy_node (TREE_TYPE (inner));
6981 TYPE_ALIGN (TREE_TYPE (inner)) = TYPE_ALIGN (TREE_TYPE (exp));
6982 TYPE_USER_ALIGN (TREE_TYPE (inner)) = 1;
6984 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier, as);
6990 if (modifier != EXPAND_NORMAL)
6991 result = force_operand (result, NULL);
6992 tmp = expand_expr (offset, NULL_RTX, tmode,
6993 modifier == EXPAND_INITIALIZER
6994 ? EXPAND_INITIALIZER : EXPAND_NORMAL);
6996 result = convert_memory_address_addr_space (tmode, result, as);
6997 tmp = convert_memory_address_addr_space (tmode, tmp, as);
6999 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7000 result = simplify_gen_binary (PLUS, tmode, result, tmp);
7003 subtarget = bitpos ? NULL_RTX : target;
7004 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
7005 1, OPTAB_LIB_WIDEN);
7011 /* Someone beforehand should have rejected taking the address
7012 of such an object. */
7013 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
7015 result = plus_constant (result, bitpos / BITS_PER_UNIT);
7016 if (modifier < EXPAND_SUM)
7017 result = force_operand (result, target);
7023 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
7024 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7027 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
7028 enum expand_modifier modifier)
7030 addr_space_t as = ADDR_SPACE_GENERIC;
7031 enum machine_mode address_mode = Pmode;
7032 enum machine_mode pointer_mode = ptr_mode;
7033 enum machine_mode rmode;
7036 /* Target mode of VOIDmode says "whatever's natural". */
7037 if (tmode == VOIDmode)
7038 tmode = TYPE_MODE (TREE_TYPE (exp));
7040 if (POINTER_TYPE_P (TREE_TYPE (exp)))
7042 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
7043 address_mode = targetm.addr_space.address_mode (as);
7044 pointer_mode = targetm.addr_space.pointer_mode (as);
7047 /* We can get called with some Weird Things if the user does silliness
7048 like "(short) &a". In that case, convert_memory_address won't do
7049 the right thing, so ignore the given target mode. */
7050 if (tmode != address_mode && tmode != pointer_mode)
7051 tmode = address_mode;
7053 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
7054 tmode, modifier, as);
7056 /* Despite expand_expr claims concerning ignoring TMODE when not
7057 strictly convenient, stuff breaks if we don't honor it. Note
7058 that combined with the above, we only do this for pointer modes. */
7059 rmode = GET_MODE (result);
7060 if (rmode == VOIDmode)
7063 result = convert_memory_address_addr_space (tmode, result, as);
7068 /* Generate code for computing CONSTRUCTOR EXP.
7069 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7070 is TRUE, instead of creating a temporary variable in memory
7071 NULL is returned and the caller needs to handle it differently. */
7074 expand_constructor (tree exp, rtx target, enum expand_modifier modifier,
7075 bool avoid_temp_mem)
7077 tree type = TREE_TYPE (exp);
7078 enum machine_mode mode = TYPE_MODE (type);
7080 /* Try to avoid creating a temporary at all. This is possible
7081 if all of the initializer is zero.
7082 FIXME: try to handle all [0..255] initializers we can handle
7084 if (TREE_STATIC (exp)
7085 && !TREE_ADDRESSABLE (exp)
7086 && target != 0 && mode == BLKmode
7087 && all_zeros_p (exp))
7089 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
7093 /* All elts simple constants => refer to a constant in memory. But
7094 if this is a non-BLKmode mode, let it store a field at a time
7095 since that should make a CONST_INT or CONST_DOUBLE when we
7096 fold. Likewise, if we have a target we can use, it is best to
7097 store directly into the target unless the type is large enough
7098 that memcpy will be used. If we are making an initializer and
7099 all operands are constant, put it in memory as well.
7101 FIXME: Avoid trying to fill vector constructors piece-meal.
7102 Output them with output_constant_def below unless we're sure
7103 they're zeros. This should go away when vector initializers
7104 are treated like VECTOR_CST instead of arrays. */
7105 if ((TREE_STATIC (exp)
7106 && ((mode == BLKmode
7107 && ! (target != 0 && safe_from_p (target, exp, 1)))
7108 || TREE_ADDRESSABLE (exp)
7109 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7110 && (! MOVE_BY_PIECES_P
7111 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7113 && ! mostly_zeros_p (exp))))
7114 || ((modifier == EXPAND_INITIALIZER || modifier == EXPAND_CONST_ADDRESS)
7115 && TREE_CONSTANT (exp)))
7122 constructor = expand_expr_constant (exp, 1, modifier);
7124 if (modifier != EXPAND_CONST_ADDRESS
7125 && modifier != EXPAND_INITIALIZER
7126 && modifier != EXPAND_SUM)
7127 constructor = validize_mem (constructor);
7132 /* Handle calls that pass values in multiple non-contiguous
7133 locations. The Irix 6 ABI has examples of this. */
7134 if (target == 0 || ! safe_from_p (target, exp, 1)
7135 || GET_CODE (target) == PARALLEL || modifier == EXPAND_STACK_PARM)
7141 = assign_temp (build_qualified_type (type, (TYPE_QUALS (type)
7142 | (TREE_READONLY (exp)
7143 * TYPE_QUAL_CONST))),
7144 0, TREE_ADDRESSABLE (exp), 1);
7147 store_constructor (exp, target, 0, int_expr_size (exp));
7152 /* expand_expr: generate code for computing expression EXP.
7153 An rtx for the computed value is returned. The value is never null.
7154 In the case of a void EXP, const0_rtx is returned.
7156 The value may be stored in TARGET if TARGET is nonzero.
7157 TARGET is just a suggestion; callers must assume that
7158 the rtx returned may not be the same as TARGET.
7160 If TARGET is CONST0_RTX, it means that the value will be ignored.
7162 If TMODE is not VOIDmode, it suggests generating the
7163 result in mode TMODE. But this is done only when convenient.
7164 Otherwise, TMODE is ignored and the value generated in its natural mode.
7165 TMODE is just a suggestion; callers must assume that
7166 the rtx returned may not have mode TMODE.
7168 Note that TARGET may have neither TMODE nor MODE. In that case, it
7169 probably will not be used.
7171 If MODIFIER is EXPAND_SUM then when EXP is an addition
7172 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7173 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7174 products as above, or REG or MEM, or constant.
7175 Ordinarily in such cases we would output mul or add instructions
7176 and then return a pseudo reg containing the sum.
7178 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7179 it also marks a label as absolutely required (it can't be dead).
7180 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7181 This is used for outputting expressions used in initializers.
7183 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7184 with a constant address even if that address is not normally legitimate.
7185 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7187 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7188 a call parameter. Such targets require special care as we haven't yet
7189 marked TARGET so that it's safe from being trashed by libcalls. We
7190 don't want to use TARGET for anything but the final result;
7191 Intermediate values must go elsewhere. Additionally, calls to
7192 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7194 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7195 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7196 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7197 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7201 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
7202 enum expand_modifier modifier, rtx *alt_rtl)
7206 /* Handle ERROR_MARK before anybody tries to access its type. */
7207 if (TREE_CODE (exp) == ERROR_MARK
7208 || (TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK))
7210 ret = CONST0_RTX (tmode);
7211 return ret ? ret : const0_rtx;
7214 /* If this is an expression of some kind and it has an associated line
7215 number, then emit the line number before expanding the expression.
7217 We need to save and restore the file and line information so that
7218 errors discovered during expansion are emitted with the right
7219 information. It would be better of the diagnostic routines
7220 used the file/line information embedded in the tree nodes rather
7222 if (cfun && EXPR_HAS_LOCATION (exp))
7224 location_t saved_location = input_location;
7225 location_t saved_curr_loc = get_curr_insn_source_location ();
7226 tree saved_block = get_curr_insn_block ();
7227 input_location = EXPR_LOCATION (exp);
7228 set_curr_insn_source_location (input_location);
7230 /* Record where the insns produced belong. */
7231 set_curr_insn_block (TREE_BLOCK (exp));
7233 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7235 input_location = saved_location;
7236 set_curr_insn_block (saved_block);
7237 set_curr_insn_source_location (saved_curr_loc);
7241 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7248 expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
7249 enum expand_modifier modifier)
7251 rtx op0, op1, op2, temp;
7254 enum machine_mode mode;
7255 enum tree_code code = ops->code;
7257 rtx subtarget, original_target;
7259 bool reduce_bit_field;
7260 location_t loc = ops->location;
7261 tree treeop0, treeop1, treeop2;
7262 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
7263 ? reduce_to_bit_field_precision ((expr), \
7269 mode = TYPE_MODE (type);
7270 unsignedp = TYPE_UNSIGNED (type);
7276 /* We should be called only on simple (binary or unary) expressions,
7277 exactly those that are valid in gimple expressions that aren't
7278 GIMPLE_SINGLE_RHS (or invalid). */
7279 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS
7280 || get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS
7281 || get_gimple_rhs_class (code) == GIMPLE_TERNARY_RHS);
7283 ignore = (target == const0_rtx
7284 || ((CONVERT_EXPR_CODE_P (code)
7285 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
7286 && TREE_CODE (type) == VOID_TYPE));
7288 /* We should be called only if we need the result. */
7289 gcc_assert (!ignore);
7291 /* An operation in what may be a bit-field type needs the
7292 result to be reduced to the precision of the bit-field type,
7293 which is narrower than that of the type's mode. */
7294 reduce_bit_field = (TREE_CODE (type) == INTEGER_TYPE
7295 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
7297 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
7300 /* Use subtarget as the target for operand 0 of a binary operation. */
7301 subtarget = get_subtarget (target);
7302 original_target = target;
7306 case NON_LVALUE_EXPR:
7309 if (treeop0 == error_mark_node)
7312 if (TREE_CODE (type) == UNION_TYPE)
7314 tree valtype = TREE_TYPE (treeop0);
7316 /* If both input and output are BLKmode, this conversion isn't doing
7317 anything except possibly changing memory attribute. */
7318 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7320 rtx result = expand_expr (treeop0, target, tmode,
7323 result = copy_rtx (result);
7324 set_mem_attributes (result, type, 0);
7330 if (TYPE_MODE (type) != BLKmode)
7331 target = gen_reg_rtx (TYPE_MODE (type));
7333 target = assign_temp (type, 0, 1, 1);
7337 /* Store data into beginning of memory target. */
7338 store_expr (treeop0,
7339 adjust_address (target, TYPE_MODE (valtype), 0),
7340 modifier == EXPAND_STACK_PARM,
7345 gcc_assert (REG_P (target));
7347 /* Store this field into a union of the proper type. */
7348 store_field (target,
7349 MIN ((int_size_in_bytes (TREE_TYPE
7352 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7353 0, TYPE_MODE (valtype), treeop0,
7357 /* Return the entire union. */
7361 if (mode == TYPE_MODE (TREE_TYPE (treeop0)))
7363 op0 = expand_expr (treeop0, target, VOIDmode,
7366 /* If the signedness of the conversion differs and OP0 is
7367 a promoted SUBREG, clear that indication since we now
7368 have to do the proper extension. */
7369 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)) != unsignedp
7370 && GET_CODE (op0) == SUBREG)
7371 SUBREG_PROMOTED_VAR_P (op0) = 0;
7373 return REDUCE_BIT_FIELD (op0);
7376 op0 = expand_expr (treeop0, NULL_RTX, mode,
7377 modifier == EXPAND_SUM ? EXPAND_NORMAL : modifier);
7378 if (GET_MODE (op0) == mode)
7381 /* If OP0 is a constant, just convert it into the proper mode. */
7382 else if (CONSTANT_P (op0))
7384 tree inner_type = TREE_TYPE (treeop0);
7385 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7387 if (modifier == EXPAND_INITIALIZER)
7388 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7389 subreg_lowpart_offset (mode,
7392 op0= convert_modes (mode, inner_mode, op0,
7393 TYPE_UNSIGNED (inner_type));
7396 else if (modifier == EXPAND_INITIALIZER)
7397 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7399 else if (target == 0)
7400 op0 = convert_to_mode (mode, op0,
7401 TYPE_UNSIGNED (TREE_TYPE
7405 convert_move (target, op0,
7406 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7410 return REDUCE_BIT_FIELD (op0);
7412 case ADDR_SPACE_CONVERT_EXPR:
7414 tree treeop0_type = TREE_TYPE (treeop0);
7416 addr_space_t as_from;
7418 gcc_assert (POINTER_TYPE_P (type));
7419 gcc_assert (POINTER_TYPE_P (treeop0_type));
7421 as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
7422 as_from = TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type));
7424 /* Conversions between pointers to the same address space should
7425 have been implemented via CONVERT_EXPR / NOP_EXPR. */
7426 gcc_assert (as_to != as_from);
7428 /* Ask target code to handle conversion between pointers
7429 to overlapping address spaces. */
7430 if (targetm.addr_space.subset_p (as_to, as_from)
7431 || targetm.addr_space.subset_p (as_from, as_to))
7433 op0 = expand_expr (treeop0, NULL_RTX, VOIDmode, modifier);
7434 op0 = targetm.addr_space.convert (op0, treeop0_type, type);
7439 /* For disjoint address spaces, converting anything but
7440 a null pointer invokes undefined behaviour. We simply
7441 always return a null pointer here. */
7442 return CONST0_RTX (mode);
7445 case POINTER_PLUS_EXPR:
7446 /* Even though the sizetype mode and the pointer's mode can be different
7447 expand is able to handle this correctly and get the correct result out
7448 of the PLUS_EXPR code. */
7449 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
7450 if sizetype precision is smaller than pointer precision. */
7451 if (TYPE_PRECISION (sizetype) < TYPE_PRECISION (type))
7452 treeop1 = fold_convert_loc (loc, type,
7453 fold_convert_loc (loc, ssizetype,
7456 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7457 something else, make sure we add the register to the constant and
7458 then to the other thing. This case can occur during strength
7459 reduction and doing it this way will produce better code if the
7460 frame pointer or argument pointer is eliminated.
7462 fold-const.c will ensure that the constant is always in the inner
7463 PLUS_EXPR, so the only case we need to do anything about is if
7464 sp, ap, or fp is our second argument, in which case we must swap
7465 the innermost first argument and our second argument. */
7467 if (TREE_CODE (treeop0) == PLUS_EXPR
7468 && TREE_CODE (TREE_OPERAND (treeop0, 1)) == INTEGER_CST
7469 && TREE_CODE (treeop1) == VAR_DECL
7470 && (DECL_RTL (treeop1) == frame_pointer_rtx
7471 || DECL_RTL (treeop1) == stack_pointer_rtx
7472 || DECL_RTL (treeop1) == arg_pointer_rtx))
7476 treeop1 = TREE_OPERAND (treeop0, 0);
7477 TREE_OPERAND (treeop0, 0) = t;
7480 /* If the result is to be ptr_mode and we are adding an integer to
7481 something, we might be forming a constant. So try to use
7482 plus_constant. If it produces a sum and we can't accept it,
7483 use force_operand. This allows P = &ARR[const] to generate
7484 efficient code on machines where a SYMBOL_REF is not a valid
7487 If this is an EXPAND_SUM call, always return the sum. */
7488 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7489 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7491 if (modifier == EXPAND_STACK_PARM)
7493 if (TREE_CODE (treeop0) == INTEGER_CST
7494 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7495 && TREE_CONSTANT (treeop1))
7499 op1 = expand_expr (treeop1, subtarget, VOIDmode,
7501 /* Use immed_double_const to ensure that the constant is
7502 truncated according to the mode of OP1, then sign extended
7503 to a HOST_WIDE_INT. Using the constant directly can result
7504 in non-canonical RTL in a 64x32 cross compile. */
7506 = immed_double_const (TREE_INT_CST_LOW (treeop0),
7508 TYPE_MODE (TREE_TYPE (treeop1)));
7509 op1 = plus_constant (op1, INTVAL (constant_part));
7510 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7511 op1 = force_operand (op1, target);
7512 return REDUCE_BIT_FIELD (op1);
7515 else if (TREE_CODE (treeop1) == INTEGER_CST
7516 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7517 && TREE_CONSTANT (treeop0))
7521 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7522 (modifier == EXPAND_INITIALIZER
7523 ? EXPAND_INITIALIZER : EXPAND_SUM));
7524 if (! CONSTANT_P (op0))
7526 op1 = expand_expr (treeop1, NULL_RTX,
7527 VOIDmode, modifier);
7528 /* Return a PLUS if modifier says it's OK. */
7529 if (modifier == EXPAND_SUM
7530 || modifier == EXPAND_INITIALIZER)
7531 return simplify_gen_binary (PLUS, mode, op0, op1);
7534 /* Use immed_double_const to ensure that the constant is
7535 truncated according to the mode of OP1, then sign extended
7536 to a HOST_WIDE_INT. Using the constant directly can result
7537 in non-canonical RTL in a 64x32 cross compile. */
7539 = immed_double_const (TREE_INT_CST_LOW (treeop1),
7541 TYPE_MODE (TREE_TYPE (treeop0)));
7542 op0 = plus_constant (op0, INTVAL (constant_part));
7543 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7544 op0 = force_operand (op0, target);
7545 return REDUCE_BIT_FIELD (op0);
7549 /* Use TER to expand pointer addition of a negated value
7550 as pointer subtraction. */
7551 if ((POINTER_TYPE_P (TREE_TYPE (treeop0))
7552 || (TREE_CODE (TREE_TYPE (treeop0)) == VECTOR_TYPE
7553 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0)))))
7554 && TREE_CODE (treeop1) == SSA_NAME
7555 && TYPE_MODE (TREE_TYPE (treeop0))
7556 == TYPE_MODE (TREE_TYPE (treeop1)))
7558 gimple def = get_def_for_expr (treeop1, NEGATE_EXPR);
7561 treeop1 = gimple_assign_rhs1 (def);
7567 /* No sense saving up arithmetic to be done
7568 if it's all in the wrong mode to form part of an address.
7569 And force_operand won't know whether to sign-extend or
7571 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7572 || mode != ptr_mode)
7574 expand_operands (treeop0, treeop1,
7575 subtarget, &op0, &op1, EXPAND_NORMAL);
7576 if (op0 == const0_rtx)
7578 if (op1 == const0_rtx)
7583 expand_operands (treeop0, treeop1,
7584 subtarget, &op0, &op1, modifier);
7585 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7589 /* For initializers, we are allowed to return a MINUS of two
7590 symbolic constants. Here we handle all cases when both operands
7592 /* Handle difference of two symbolic constants,
7593 for the sake of an initializer. */
7594 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7595 && really_constant_p (treeop0)
7596 && really_constant_p (treeop1))
7598 expand_operands (treeop0, treeop1,
7599 NULL_RTX, &op0, &op1, modifier);
7601 /* If the last operand is a CONST_INT, use plus_constant of
7602 the negated constant. Else make the MINUS. */
7603 if (CONST_INT_P (op1))
7604 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7606 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7609 /* No sense saving up arithmetic to be done
7610 if it's all in the wrong mode to form part of an address.
7611 And force_operand won't know whether to sign-extend or
7613 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7614 || mode != ptr_mode)
7617 expand_operands (treeop0, treeop1,
7618 subtarget, &op0, &op1, modifier);
7620 /* Convert A - const to A + (-const). */
7621 if (CONST_INT_P (op1))
7623 op1 = negate_rtx (mode, op1);
7624 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7629 case WIDEN_MULT_PLUS_EXPR:
7630 case WIDEN_MULT_MINUS_EXPR:
7631 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
7632 op2 = expand_normal (treeop2);
7633 target = expand_widen_pattern_expr (ops, op0, op1, op2,
7637 case WIDEN_MULT_EXPR:
7638 /* If first operand is constant, swap them.
7639 Thus the following special case checks need only
7640 check the second operand. */
7641 if (TREE_CODE (treeop0) == INTEGER_CST)
7648 /* First, check if we have a multiplication of one signed and one
7649 unsigned operand. */
7650 if (TREE_CODE (treeop1) != INTEGER_CST
7651 && (TYPE_UNSIGNED (TREE_TYPE (treeop0))
7652 != TYPE_UNSIGNED (TREE_TYPE (treeop1))))
7654 enum machine_mode innermode = TYPE_MODE (TREE_TYPE (treeop0));
7655 this_optab = usmul_widen_optab;
7656 if (mode == GET_MODE_2XWIDER_MODE (innermode))
7658 if (optab_handler (this_optab, mode) != CODE_FOR_nothing)
7660 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7661 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
7664 expand_operands (treeop0, treeop1, NULL_RTX, &op1, &op0,
7670 /* Check for a multiplication with matching signedness. */
7671 else if ((TREE_CODE (treeop1) == INTEGER_CST
7672 && int_fits_type_p (treeop1, TREE_TYPE (treeop0)))
7673 || (TYPE_UNSIGNED (TREE_TYPE (treeop1))
7674 == TYPE_UNSIGNED (TREE_TYPE (treeop0))))
7676 tree op0type = TREE_TYPE (treeop0);
7677 enum machine_mode innermode = TYPE_MODE (op0type);
7678 bool zextend_p = TYPE_UNSIGNED (op0type);
7679 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7680 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7682 if (mode == GET_MODE_2XWIDER_MODE (innermode)
7683 && TREE_CODE (treeop0) != INTEGER_CST)
7685 if (optab_handler (this_optab, mode) != CODE_FOR_nothing)
7687 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
7689 temp = expand_widening_mult (mode, op0, op1, target,
7690 unsignedp, this_optab);
7691 return REDUCE_BIT_FIELD (temp);
7693 if (optab_handler (other_optab, mode) != CODE_FOR_nothing
7694 && innermode == word_mode)
7697 op0 = expand_normal (treeop0);
7698 if (TREE_CODE (treeop1) == INTEGER_CST)
7699 op1 = convert_modes (innermode, mode,
7700 expand_normal (treeop1), unsignedp);
7702 op1 = expand_normal (treeop1);
7703 temp = expand_binop (mode, other_optab, op0, op1, target,
7704 unsignedp, OPTAB_LIB_WIDEN);
7705 hipart = gen_highpart (innermode, temp);
7706 htem = expand_mult_highpart_adjust (innermode, hipart,
7710 emit_move_insn (hipart, htem);
7711 return REDUCE_BIT_FIELD (temp);
7715 treeop0 = fold_build1 (CONVERT_EXPR, type, treeop0);
7716 treeop1 = fold_build1 (CONVERT_EXPR, type, treeop1);
7717 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
7718 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7722 optab opt = fma_optab;
7725 /* If there is no insn for FMA, emit it as __builtin_fma{,f,l}
7727 if (optab_handler (fma_optab, mode) == CODE_FOR_nothing)
7729 tree fn = mathfn_built_in (TREE_TYPE (treeop0), BUILT_IN_FMA);
7732 gcc_assert (fn != NULL_TREE);
7733 call_expr = build_call_expr (fn, 3, treeop0, treeop1, treeop2);
7734 return expand_builtin (call_expr, target, subtarget, mode, false);
7737 def0 = get_def_for_expr (treeop0, NEGATE_EXPR);
7738 def2 = get_def_for_expr (treeop2, NEGATE_EXPR);
7743 && optab_handler (fnms_optab, mode) != CODE_FOR_nothing)
7746 op0 = expand_normal (gimple_assign_rhs1 (def0));
7747 op2 = expand_normal (gimple_assign_rhs1 (def2));
7750 && optab_handler (fnma_optab, mode) != CODE_FOR_nothing)
7753 op0 = expand_normal (gimple_assign_rhs1 (def0));
7756 && optab_handler (fms_optab, mode) != CODE_FOR_nothing)
7759 op2 = expand_normal (gimple_assign_rhs1 (def2));
7763 op0 = expand_expr (treeop0, subtarget, VOIDmode, EXPAND_NORMAL);
7765 op2 = expand_normal (treeop2);
7766 op1 = expand_normal (treeop1);
7768 return expand_ternary_op (TYPE_MODE (type), opt,
7769 op0, op1, op2, target, 0);
7773 /* If this is a fixed-point operation, then we cannot use the code
7774 below because "expand_mult" doesn't support sat/no-sat fixed-point
7776 if (ALL_FIXED_POINT_MODE_P (mode))
7779 /* If first operand is constant, swap them.
7780 Thus the following special case checks need only
7781 check the second operand. */
7782 if (TREE_CODE (treeop0) == INTEGER_CST)
7789 /* Attempt to return something suitable for generating an
7790 indexed address, for machines that support that. */
7792 if (modifier == EXPAND_SUM && mode == ptr_mode
7793 && host_integerp (treeop1, 0))
7795 tree exp1 = treeop1;
7797 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7801 op0 = force_operand (op0, NULL_RTX);
7803 op0 = copy_to_mode_reg (mode, op0);
7805 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7806 gen_int_mode (tree_low_cst (exp1, 0),
7807 TYPE_MODE (TREE_TYPE (exp1)))));
7810 if (modifier == EXPAND_STACK_PARM)
7813 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
7814 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7816 case TRUNC_DIV_EXPR:
7817 case FLOOR_DIV_EXPR:
7819 case ROUND_DIV_EXPR:
7820 case EXACT_DIV_EXPR:
7821 /* If this is a fixed-point operation, then we cannot use the code
7822 below because "expand_divmod" doesn't support sat/no-sat fixed-point
7824 if (ALL_FIXED_POINT_MODE_P (mode))
7827 if (modifier == EXPAND_STACK_PARM)
7829 /* Possible optimization: compute the dividend with EXPAND_SUM
7830 then if the divisor is constant can optimize the case
7831 where some terms of the dividend have coeffs divisible by it. */
7832 expand_operands (treeop0, treeop1,
7833 subtarget, &op0, &op1, EXPAND_NORMAL);
7834 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7839 case TRUNC_MOD_EXPR:
7840 case FLOOR_MOD_EXPR:
7842 case ROUND_MOD_EXPR:
7843 if (modifier == EXPAND_STACK_PARM)
7845 expand_operands (treeop0, treeop1,
7846 subtarget, &op0, &op1, EXPAND_NORMAL);
7847 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7849 case FIXED_CONVERT_EXPR:
7850 op0 = expand_normal (treeop0);
7851 if (target == 0 || modifier == EXPAND_STACK_PARM)
7852 target = gen_reg_rtx (mode);
7854 if ((TREE_CODE (TREE_TYPE (treeop0)) == INTEGER_TYPE
7855 && TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7856 || (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type)))
7857 expand_fixed_convert (target, op0, 1, TYPE_SATURATING (type));
7859 expand_fixed_convert (target, op0, 0, TYPE_SATURATING (type));
7862 case FIX_TRUNC_EXPR:
7863 op0 = expand_normal (treeop0);
7864 if (target == 0 || modifier == EXPAND_STACK_PARM)
7865 target = gen_reg_rtx (mode);
7866 expand_fix (target, op0, unsignedp);
7870 op0 = expand_normal (treeop0);
7871 if (target == 0 || modifier == EXPAND_STACK_PARM)
7872 target = gen_reg_rtx (mode);
7873 /* expand_float can't figure out what to do if FROM has VOIDmode.
7874 So give it the correct mode. With -O, cse will optimize this. */
7875 if (GET_MODE (op0) == VOIDmode)
7876 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0)),
7878 expand_float (target, op0,
7879 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7883 op0 = expand_expr (treeop0, subtarget,
7884 VOIDmode, EXPAND_NORMAL);
7885 if (modifier == EXPAND_STACK_PARM)
7887 temp = expand_unop (mode,
7888 optab_for_tree_code (NEGATE_EXPR, type,
7892 return REDUCE_BIT_FIELD (temp);
7895 op0 = expand_expr (treeop0, subtarget,
7896 VOIDmode, EXPAND_NORMAL);
7897 if (modifier == EXPAND_STACK_PARM)
7900 /* ABS_EXPR is not valid for complex arguments. */
7901 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7902 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
7904 /* Unsigned abs is simply the operand. Testing here means we don't
7905 risk generating incorrect code below. */
7906 if (TYPE_UNSIGNED (type))
7909 return expand_abs (mode, op0, target, unsignedp,
7910 safe_from_p (target, treeop0, 1));
7914 target = original_target;
7916 || modifier == EXPAND_STACK_PARM
7917 || (MEM_P (target) && MEM_VOLATILE_P (target))
7918 || GET_MODE (target) != mode
7920 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7921 target = gen_reg_rtx (mode);
7922 expand_operands (treeop0, treeop1,
7923 target, &op0, &op1, EXPAND_NORMAL);
7925 /* First try to do it with a special MIN or MAX instruction.
7926 If that does not win, use a conditional jump to select the proper
7928 this_optab = optab_for_tree_code (code, type, optab_default);
7929 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7934 /* At this point, a MEM target is no longer useful; we will get better
7937 if (! REG_P (target))
7938 target = gen_reg_rtx (mode);
7940 /* If op1 was placed in target, swap op0 and op1. */
7941 if (target != op0 && target == op1)
7948 /* We generate better code and avoid problems with op1 mentioning
7949 target by forcing op1 into a pseudo if it isn't a constant. */
7950 if (! CONSTANT_P (op1))
7951 op1 = force_reg (mode, op1);
7954 enum rtx_code comparison_code;
7957 if (code == MAX_EXPR)
7958 comparison_code = unsignedp ? GEU : GE;
7960 comparison_code = unsignedp ? LEU : LE;
7962 /* Canonicalize to comparisons against 0. */
7963 if (op1 == const1_rtx)
7965 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
7966 or (a != 0 ? a : 1) for unsigned.
7967 For MIN we are safe converting (a <= 1 ? a : 1)
7968 into (a <= 0 ? a : 1) */
7969 cmpop1 = const0_rtx;
7970 if (code == MAX_EXPR)
7971 comparison_code = unsignedp ? NE : GT;
7973 if (op1 == constm1_rtx && !unsignedp)
7975 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
7976 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
7977 cmpop1 = const0_rtx;
7978 if (code == MIN_EXPR)
7979 comparison_code = LT;
7981 #ifdef HAVE_conditional_move
7982 /* Use a conditional move if possible. */
7983 if (can_conditionally_move_p (mode))
7987 /* ??? Same problem as in expmed.c: emit_conditional_move
7988 forces a stack adjustment via compare_from_rtx, and we
7989 lose the stack adjustment if the sequence we are about
7990 to create is discarded. */
7991 do_pending_stack_adjust ();
7995 /* Try to emit the conditional move. */
7996 insn = emit_conditional_move (target, comparison_code,
8001 /* If we could do the conditional move, emit the sequence,
8005 rtx seq = get_insns ();
8011 /* Otherwise discard the sequence and fall back to code with
8017 emit_move_insn (target, op0);
8019 temp = gen_label_rtx ();
8020 do_compare_rtx_and_jump (target, cmpop1, comparison_code,
8021 unsignedp, mode, NULL_RTX, NULL_RTX, temp,
8024 emit_move_insn (target, op1);
8029 op0 = expand_expr (treeop0, subtarget,
8030 VOIDmode, EXPAND_NORMAL);
8031 if (modifier == EXPAND_STACK_PARM)
8033 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8037 /* ??? Can optimize bitwise operations with one arg constant.
8038 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8039 and (a bitwise1 b) bitwise2 b (etc)
8040 but that is probably not worth while. */
8042 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8043 boolean values when we want in all cases to compute both of them. In
8044 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8045 as actual zero-or-1 values and then bitwise anding. In cases where
8046 there cannot be any side effects, better code would be made by
8047 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8048 how to recognize those cases. */
8050 case TRUTH_AND_EXPR:
8051 code = BIT_AND_EXPR;
8056 code = BIT_IOR_EXPR;
8060 case TRUTH_XOR_EXPR:
8061 code = BIT_XOR_EXPR;
8067 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type))
8068 || (GET_MODE_PRECISION (TYPE_MODE (type))
8069 == TYPE_PRECISION (type)));
8074 /* If this is a fixed-point operation, then we cannot use the code
8075 below because "expand_shift" doesn't support sat/no-sat fixed-point
8077 if (ALL_FIXED_POINT_MODE_P (mode))
8080 if (! safe_from_p (subtarget, treeop1, 1))
8082 if (modifier == EXPAND_STACK_PARM)
8084 op0 = expand_expr (treeop0, subtarget,
8085 VOIDmode, EXPAND_NORMAL);
8086 temp = expand_shift (code, mode, op0, treeop1, target,
8088 if (code == LSHIFT_EXPR)
8089 temp = REDUCE_BIT_FIELD (temp);
8092 /* Could determine the answer when only additive constants differ. Also,
8093 the addition of one can be handled by changing the condition. */
8100 case UNORDERED_EXPR:
8108 temp = do_store_flag (ops,
8109 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8110 tmode != VOIDmode ? tmode : mode);
8114 /* Use a compare and a jump for BLKmode comparisons, or for function
8115 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8118 || modifier == EXPAND_STACK_PARM
8119 || ! safe_from_p (target, treeop0, 1)
8120 || ! safe_from_p (target, treeop1, 1)
8121 /* Make sure we don't have a hard reg (such as function's return
8122 value) live across basic blocks, if not optimizing. */
8123 || (!optimize && REG_P (target)
8124 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8125 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8127 emit_move_insn (target, const0_rtx);
8129 op1 = gen_label_rtx ();
8130 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
8132 emit_move_insn (target, const1_rtx);
8137 case TRUTH_NOT_EXPR:
8138 if (modifier == EXPAND_STACK_PARM)
8140 op0 = expand_expr (treeop0, target,
8141 VOIDmode, EXPAND_NORMAL);
8142 /* The parser is careful to generate TRUTH_NOT_EXPR
8143 only with operands that are always zero or one. */
8144 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8145 target, 1, OPTAB_LIB_WIDEN);
8150 /* Get the rtx code of the operands. */
8151 op0 = expand_normal (treeop0);
8152 op1 = expand_normal (treeop1);
8155 target = gen_reg_rtx (TYPE_MODE (type));
8157 /* Move the real (op0) and imaginary (op1) parts to their location. */
8158 write_complex_part (target, op0, false);
8159 write_complex_part (target, op1, true);
8163 case WIDEN_SUM_EXPR:
8165 tree oprnd0 = treeop0;
8166 tree oprnd1 = treeop1;
8168 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8169 target = expand_widen_pattern_expr (ops, op0, NULL_RTX, op1,
8174 case REDUC_MAX_EXPR:
8175 case REDUC_MIN_EXPR:
8176 case REDUC_PLUS_EXPR:
8178 op0 = expand_normal (treeop0);
8179 this_optab = optab_for_tree_code (code, type, optab_default);
8180 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8185 case VEC_EXTRACT_EVEN_EXPR:
8186 case VEC_EXTRACT_ODD_EXPR:
8188 expand_operands (treeop0, treeop1,
8189 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8190 this_optab = optab_for_tree_code (code, type, optab_default);
8191 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8197 case VEC_INTERLEAVE_HIGH_EXPR:
8198 case VEC_INTERLEAVE_LOW_EXPR:
8200 expand_operands (treeop0, treeop1,
8201 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8202 this_optab = optab_for_tree_code (code, type, optab_default);
8203 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8209 case VEC_LSHIFT_EXPR:
8210 case VEC_RSHIFT_EXPR:
8212 target = expand_vec_shift_expr (ops, target);
8216 case VEC_UNPACK_HI_EXPR:
8217 case VEC_UNPACK_LO_EXPR:
8219 op0 = expand_normal (treeop0);
8220 this_optab = optab_for_tree_code (code, type, optab_default);
8221 temp = expand_widen_pattern_expr (ops, op0, NULL_RTX, NULL_RTX,
8227 case VEC_UNPACK_FLOAT_HI_EXPR:
8228 case VEC_UNPACK_FLOAT_LO_EXPR:
8230 op0 = expand_normal (treeop0);
8231 /* The signedness is determined from input operand. */
8232 this_optab = optab_for_tree_code (code,
8233 TREE_TYPE (treeop0),
8235 temp = expand_widen_pattern_expr
8236 (ops, op0, NULL_RTX, NULL_RTX,
8237 target, TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8243 case VEC_WIDEN_MULT_HI_EXPR:
8244 case VEC_WIDEN_MULT_LO_EXPR:
8246 tree oprnd0 = treeop0;
8247 tree oprnd1 = treeop1;
8249 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8250 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8252 gcc_assert (target);
8256 case VEC_PACK_TRUNC_EXPR:
8257 case VEC_PACK_SAT_EXPR:
8258 case VEC_PACK_FIX_TRUNC_EXPR:
8259 mode = TYPE_MODE (TREE_TYPE (treeop0));
8264 tree oprnd0 = treeop0;
8265 tree oprnd1 = treeop1;
8266 tree oprnd2 = treeop2;
8269 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8270 op2 = expand_normal (oprnd2);
8271 target = expand_widen_pattern_expr (ops, op0, op1, op2,
8276 case REALIGN_LOAD_EXPR:
8278 tree oprnd0 = treeop0;
8279 tree oprnd1 = treeop1;
8280 tree oprnd2 = treeop2;
8283 this_optab = optab_for_tree_code (code, type, optab_default);
8284 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8285 op2 = expand_normal (oprnd2);
8286 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
8296 /* Here to do an ordinary binary operator. */
8298 expand_operands (treeop0, treeop1,
8299 subtarget, &op0, &op1, EXPAND_NORMAL);
8301 this_optab = optab_for_tree_code (code, type, optab_default);
8303 if (modifier == EXPAND_STACK_PARM)
8305 temp = expand_binop (mode, this_optab, op0, op1, target,
8306 unsignedp, OPTAB_LIB_WIDEN);
8308 return REDUCE_BIT_FIELD (temp);
8310 #undef REDUCE_BIT_FIELD
8313 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
8314 enum expand_modifier modifier, rtx *alt_rtl)
8316 rtx op0, op1, temp, decl_rtl;
8319 enum machine_mode mode;
8320 enum tree_code code = TREE_CODE (exp);
8321 rtx subtarget, original_target;
8324 bool reduce_bit_field;
8325 location_t loc = EXPR_LOCATION (exp);
8326 struct separate_ops ops;
8327 tree treeop0, treeop1, treeop2;
8328 tree ssa_name = NULL_TREE;
8331 type = TREE_TYPE (exp);
8332 mode = TYPE_MODE (type);
8333 unsignedp = TYPE_UNSIGNED (type);
8335 treeop0 = treeop1 = treeop2 = NULL_TREE;
8336 if (!VL_EXP_CLASS_P (exp))
8337 switch (TREE_CODE_LENGTH (code))
8340 case 3: treeop2 = TREE_OPERAND (exp, 2);
8341 case 2: treeop1 = TREE_OPERAND (exp, 1);
8342 case 1: treeop0 = TREE_OPERAND (exp, 0);
8352 ignore = (target == const0_rtx
8353 || ((CONVERT_EXPR_CODE_P (code)
8354 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
8355 && TREE_CODE (type) == VOID_TYPE));
8357 /* An operation in what may be a bit-field type needs the
8358 result to be reduced to the precision of the bit-field type,
8359 which is narrower than that of the type's mode. */
8360 reduce_bit_field = (!ignore
8361 && TREE_CODE (type) == INTEGER_TYPE
8362 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
8364 /* If we are going to ignore this result, we need only do something
8365 if there is a side-effect somewhere in the expression. If there
8366 is, short-circuit the most common cases here. Note that we must
8367 not call expand_expr with anything but const0_rtx in case this
8368 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
8372 if (! TREE_SIDE_EFFECTS (exp))
8375 /* Ensure we reference a volatile object even if value is ignored, but
8376 don't do this if all we are doing is taking its address. */
8377 if (TREE_THIS_VOLATILE (exp)
8378 && TREE_CODE (exp) != FUNCTION_DECL
8379 && mode != VOIDmode && mode != BLKmode
8380 && modifier != EXPAND_CONST_ADDRESS)
8382 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
8384 temp = copy_to_reg (temp);
8388 if (TREE_CODE_CLASS (code) == tcc_unary
8389 || code == COMPONENT_REF || code == INDIRECT_REF)
8390 return expand_expr (treeop0, const0_rtx, VOIDmode,
8393 else if (TREE_CODE_CLASS (code) == tcc_binary
8394 || TREE_CODE_CLASS (code) == tcc_comparison
8395 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
8397 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8398 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8401 else if (code == BIT_FIELD_REF)
8403 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8404 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8405 expand_expr (treeop2, const0_rtx, VOIDmode, modifier);
8412 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
8415 /* Use subtarget as the target for operand 0 of a binary operation. */
8416 subtarget = get_subtarget (target);
8417 original_target = target;
8423 tree function = decl_function_context (exp);
8425 temp = label_rtx (exp);
8426 temp = gen_rtx_LABEL_REF (Pmode, temp);
8428 if (function != current_function_decl
8430 LABEL_REF_NONLOCAL_P (temp) = 1;
8432 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
8437 /* ??? ivopts calls expander, without any preparation from
8438 out-of-ssa. So fake instructions as if this was an access to the
8439 base variable. This unnecessarily allocates a pseudo, see how we can
8440 reuse it, if partition base vars have it set already. */
8441 if (!currently_expanding_to_rtl)
8442 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier,
8445 g = get_gimple_for_ssa_name (exp);
8446 /* For EXPAND_INITIALIZER try harder to get something simpler. */
8448 && modifier == EXPAND_INITIALIZER
8449 && !SSA_NAME_IS_DEFAULT_DEF (exp)
8450 && (optimize || DECL_IGNORED_P (SSA_NAME_VAR (exp)))
8451 && stmt_is_replaceable_p (SSA_NAME_DEF_STMT (exp)))
8452 g = SSA_NAME_DEF_STMT (exp);
8454 return expand_expr_real (gimple_assign_rhs_to_tree (g), target, tmode,
8458 decl_rtl = get_rtx_for_ssa_name (ssa_name);
8459 exp = SSA_NAME_VAR (ssa_name);
8460 goto expand_decl_rtl;
8464 /* If a static var's type was incomplete when the decl was written,
8465 but the type is complete now, lay out the decl now. */
8466 if (DECL_SIZE (exp) == 0
8467 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
8468 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
8469 layout_decl (exp, 0);
8471 /* ... fall through ... */
8475 decl_rtl = DECL_RTL (exp);
8477 gcc_assert (decl_rtl);
8478 decl_rtl = copy_rtx (decl_rtl);
8479 /* Record writes to register variables. */
8480 if (modifier == EXPAND_WRITE && REG_P (decl_rtl)
8481 && REGNO (decl_rtl) < FIRST_PSEUDO_REGISTER)
8483 int i = REGNO (decl_rtl);
8484 int nregs = hard_regno_nregs[i][GET_MODE (decl_rtl)];
8487 SET_HARD_REG_BIT (crtl->asm_clobbers, i);
8493 /* Ensure variable marked as used even if it doesn't go through
8494 a parser. If it hasn't be used yet, write out an external
8496 if (! TREE_USED (exp))
8498 assemble_external (exp);
8499 TREE_USED (exp) = 1;
8502 /* Show we haven't gotten RTL for this yet. */
8505 /* Variables inherited from containing functions should have
8506 been lowered by this point. */
8507 context = decl_function_context (exp);
8508 gcc_assert (!context
8509 || context == current_function_decl
8510 || TREE_STATIC (exp)
8511 || DECL_EXTERNAL (exp)
8512 /* ??? C++ creates functions that are not TREE_STATIC. */
8513 || TREE_CODE (exp) == FUNCTION_DECL);
8515 /* This is the case of an array whose size is to be determined
8516 from its initializer, while the initializer is still being parsed.
8519 if (MEM_P (decl_rtl) && REG_P (XEXP (decl_rtl, 0)))
8520 temp = validize_mem (decl_rtl);
8522 /* If DECL_RTL is memory, we are in the normal case and the
8523 address is not valid, get the address into a register. */
8525 else if (MEM_P (decl_rtl) && modifier != EXPAND_INITIALIZER)
8528 *alt_rtl = decl_rtl;
8529 decl_rtl = use_anchored_address (decl_rtl);
8530 if (modifier != EXPAND_CONST_ADDRESS
8531 && modifier != EXPAND_SUM
8532 && !memory_address_addr_space_p (DECL_MODE (exp),
8534 MEM_ADDR_SPACE (decl_rtl)))
8535 temp = replace_equiv_address (decl_rtl,
8536 copy_rtx (XEXP (decl_rtl, 0)));
8539 /* If we got something, return it. But first, set the alignment
8540 if the address is a register. */
8543 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
8544 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
8549 /* If the mode of DECL_RTL does not match that of the decl, it
8550 must be a promoted value. We return a SUBREG of the wanted mode,
8551 but mark it so that we know that it was already extended. */
8552 if (REG_P (decl_rtl) && GET_MODE (decl_rtl) != DECL_MODE (exp))
8554 enum machine_mode pmode;
8556 /* Get the signedness to be used for this variable. Ensure we get
8557 the same mode we got when the variable was declared. */
8558 if (code == SSA_NAME
8559 && (g = SSA_NAME_DEF_STMT (ssa_name))
8560 && gimple_code (g) == GIMPLE_CALL)
8561 pmode = promote_function_mode (type, mode, &unsignedp,
8563 (TREE_TYPE (gimple_call_fn (g))),
8566 pmode = promote_decl_mode (exp, &unsignedp);
8567 gcc_assert (GET_MODE (decl_rtl) == pmode);
8569 temp = gen_lowpart_SUBREG (mode, decl_rtl);
8570 SUBREG_PROMOTED_VAR_P (temp) = 1;
8571 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
8578 temp = immed_double_const (TREE_INT_CST_LOW (exp),
8579 TREE_INT_CST_HIGH (exp), mode);
8585 tree tmp = NULL_TREE;
8586 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
8587 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT
8588 || GET_MODE_CLASS (mode) == MODE_VECTOR_FRACT
8589 || GET_MODE_CLASS (mode) == MODE_VECTOR_UFRACT
8590 || GET_MODE_CLASS (mode) == MODE_VECTOR_ACCUM
8591 || GET_MODE_CLASS (mode) == MODE_VECTOR_UACCUM)
8592 return const_vector_from_tree (exp);
8593 if (GET_MODE_CLASS (mode) == MODE_INT)
8595 tree type_for_mode = lang_hooks.types.type_for_mode (mode, 1);
8597 tmp = fold_unary_loc (loc, VIEW_CONVERT_EXPR, type_for_mode, exp);
8600 tmp = build_constructor_from_list (type,
8601 TREE_VECTOR_CST_ELTS (exp));
8602 return expand_expr (tmp, ignore ? const0_rtx : target,
8607 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
8610 /* If optimized, generate immediate CONST_DOUBLE
8611 which will be turned into memory by reload if necessary.
8613 We used to force a register so that loop.c could see it. But
8614 this does not allow gen_* patterns to perform optimizations with
8615 the constants. It also produces two insns in cases like "x = 1.0;".
8616 On most machines, floating-point constants are not permitted in
8617 many insns, so we'd end up copying it to a register in any case.
8619 Now, we do the copying in expand_binop, if appropriate. */
8620 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
8621 TYPE_MODE (TREE_TYPE (exp)));
8624 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp),
8625 TYPE_MODE (TREE_TYPE (exp)));
8628 /* Handle evaluating a complex constant in a CONCAT target. */
8629 if (original_target && GET_CODE (original_target) == CONCAT)
8631 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8634 rtarg = XEXP (original_target, 0);
8635 itarg = XEXP (original_target, 1);
8637 /* Move the real and imaginary parts separately. */
8638 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, EXPAND_NORMAL);
8639 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, EXPAND_NORMAL);
8642 emit_move_insn (rtarg, op0);
8644 emit_move_insn (itarg, op1);
8646 return original_target;
8649 /* ... fall through ... */
8652 temp = expand_expr_constant (exp, 1, modifier);
8654 /* temp contains a constant address.
8655 On RISC machines where a constant address isn't valid,
8656 make some insns to get that address into a register. */
8657 if (modifier != EXPAND_CONST_ADDRESS
8658 && modifier != EXPAND_INITIALIZER
8659 && modifier != EXPAND_SUM
8660 && ! memory_address_addr_space_p (mode, XEXP (temp, 0),
8661 MEM_ADDR_SPACE (temp)))
8662 return replace_equiv_address (temp,
8663 copy_rtx (XEXP (temp, 0)));
8669 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
8671 if (!SAVE_EXPR_RESOLVED_P (exp))
8673 /* We can indeed still hit this case, typically via builtin
8674 expanders calling save_expr immediately before expanding
8675 something. Assume this means that we only have to deal
8676 with non-BLKmode values. */
8677 gcc_assert (GET_MODE (ret) != BLKmode);
8679 val = build_decl (EXPR_LOCATION (exp),
8680 VAR_DECL, NULL, TREE_TYPE (exp));
8681 DECL_ARTIFICIAL (val) = 1;
8682 DECL_IGNORED_P (val) = 1;
8684 TREE_OPERAND (exp, 0) = treeop0;
8685 SAVE_EXPR_RESOLVED_P (exp) = 1;
8687 if (!CONSTANT_P (ret))
8688 ret = copy_to_reg (ret);
8689 SET_DECL_RTL (val, ret);
8697 /* If we don't need the result, just ensure we evaluate any
8701 unsigned HOST_WIDE_INT idx;
8704 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
8705 expand_expr (value, const0_rtx, VOIDmode, EXPAND_NORMAL);
8710 return expand_constructor (exp, target, modifier, false);
8712 case TARGET_MEM_REF:
8714 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (exp));
8715 struct mem_address addr;
8718 get_address_description (exp, &addr);
8719 op0 = addr_for_mem_ref (&addr, as, true);
8720 op0 = memory_address_addr_space (mode, op0, as);
8721 temp = gen_rtx_MEM (mode, op0);
8722 set_mem_attributes (temp, exp, 0);
8723 set_mem_addr_space (temp, as);
8724 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)),
8725 get_object_alignment (exp, BIGGEST_ALIGNMENT));
8727 && (unsigned) align < GET_MODE_ALIGNMENT (mode)
8728 /* If the target does not have special handling for unaligned
8729 loads of mode then it can use regular moves for them. */
8730 && ((icode = optab_handler (movmisalign_optab, mode))
8731 != CODE_FOR_nothing))
8735 /* We've already validated the memory, and we're creating a
8736 new pseudo destination. The predicates really can't fail. */
8737 reg = gen_reg_rtx (mode);
8739 /* Nor can the insn generator. */
8740 insn = GEN_FCN (icode) (reg, temp);
8741 gcc_assert (insn != NULL_RTX);
8752 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))));
8753 enum machine_mode address_mode;
8754 tree base = TREE_OPERAND (exp, 0);
8757 /* Handle expansion of non-aliased memory with non-BLKmode. That
8758 might end up in a register. */
8759 if (TREE_CODE (base) == ADDR_EXPR)
8761 HOST_WIDE_INT offset = mem_ref_offset (exp).low;
8763 base = TREE_OPERAND (base, 0);
8767 base = get_addr_base_and_unit_offset (base, &off);
8771 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
8772 decl we must use bitfield operations. */
8774 && !TREE_ADDRESSABLE (base)
8775 && DECL_MODE (base) != BLKmode
8776 && DECL_RTL_SET_P (base)
8777 && !MEM_P (DECL_RTL (base)))
8781 && host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)
8782 && (GET_MODE_BITSIZE (DECL_MODE (base))
8783 == TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp)))))
8784 return expand_expr (build1 (VIEW_CONVERT_EXPR,
8785 TREE_TYPE (exp), base),
8786 target, tmode, modifier);
8787 bit_offset = bitsize_int (offset * BITS_PER_UNIT);
8788 bftype = TREE_TYPE (base);
8789 if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode)
8790 bftype = TREE_TYPE (exp);
8791 return expand_expr (build3 (BIT_FIELD_REF, bftype,
8793 TYPE_SIZE (TREE_TYPE (exp)),
8795 target, tmode, modifier);
8798 address_mode = targetm.addr_space.address_mode (as);
8799 base = TREE_OPERAND (exp, 0);
8800 if ((def_stmt = get_def_for_expr (base, BIT_AND_EXPR)))
8802 tree mask = gimple_assign_rhs2 (def_stmt);
8803 base = build2 (BIT_AND_EXPR, TREE_TYPE (base),
8804 gimple_assign_rhs1 (def_stmt), mask);
8805 TREE_OPERAND (exp, 0) = base;
8807 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)),
8808 get_object_alignment (exp, BIGGEST_ALIGNMENT));
8809 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_SUM);
8810 op0 = memory_address_addr_space (address_mode, op0, as);
8811 if (!integer_zerop (TREE_OPERAND (exp, 1)))
8814 = immed_double_int_const (mem_ref_offset (exp), address_mode);
8815 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
8817 op0 = memory_address_addr_space (mode, op0, as);
8818 temp = gen_rtx_MEM (mode, op0);
8819 set_mem_attributes (temp, exp, 0);
8820 set_mem_addr_space (temp, as);
8821 if (TREE_THIS_VOLATILE (exp))
8822 MEM_VOLATILE_P (temp) = 1;
8824 && (unsigned) align < GET_MODE_ALIGNMENT (mode)
8825 /* If the target does not have special handling for unaligned
8826 loads of mode then it can use regular moves for them. */
8827 && ((icode = optab_handler (movmisalign_optab, mode))
8828 != CODE_FOR_nothing))
8832 /* We've already validated the memory, and we're creating a
8833 new pseudo destination. The predicates really can't fail. */
8834 reg = gen_reg_rtx (mode);
8836 /* Nor can the insn generator. */
8837 insn = GEN_FCN (icode) (reg, temp);
8848 tree array = treeop0;
8849 tree index = treeop1;
8851 /* Fold an expression like: "foo"[2].
8852 This is not done in fold so it won't happen inside &.
8853 Don't fold if this is for wide characters since it's too
8854 difficult to do correctly and this is a very rare case. */
8856 if (modifier != EXPAND_CONST_ADDRESS
8857 && modifier != EXPAND_INITIALIZER
8858 && modifier != EXPAND_MEMORY)
8860 tree t = fold_read_from_constant_string (exp);
8863 return expand_expr (t, target, tmode, modifier);
8866 /* If this is a constant index into a constant array,
8867 just get the value from the array. Handle both the cases when
8868 we have an explicit constructor and when our operand is a variable
8869 that was declared const. */
8871 if (modifier != EXPAND_CONST_ADDRESS
8872 && modifier != EXPAND_INITIALIZER
8873 && modifier != EXPAND_MEMORY
8874 && TREE_CODE (array) == CONSTRUCTOR
8875 && ! TREE_SIDE_EFFECTS (array)
8876 && TREE_CODE (index) == INTEGER_CST)
8878 unsigned HOST_WIDE_INT ix;
8881 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array), ix,
8883 if (tree_int_cst_equal (field, index))
8885 if (!TREE_SIDE_EFFECTS (value))
8886 return expand_expr (fold (value), target, tmode, modifier);
8891 else if (optimize >= 1
8892 && modifier != EXPAND_CONST_ADDRESS
8893 && modifier != EXPAND_INITIALIZER
8894 && modifier != EXPAND_MEMORY
8895 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
8896 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
8897 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
8898 && const_value_known_p (array))
8900 if (TREE_CODE (index) == INTEGER_CST)
8902 tree init = DECL_INITIAL (array);
8904 if (TREE_CODE (init) == CONSTRUCTOR)
8906 unsigned HOST_WIDE_INT ix;
8909 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), ix,
8911 if (tree_int_cst_equal (field, index))
8913 if (TREE_SIDE_EFFECTS (value))
8916 if (TREE_CODE (value) == CONSTRUCTOR)
8918 /* If VALUE is a CONSTRUCTOR, this
8919 optimization is only useful if
8920 this doesn't store the CONSTRUCTOR
8921 into memory. If it does, it is more
8922 efficient to just load the data from
8923 the array directly. */
8924 rtx ret = expand_constructor (value, target,
8926 if (ret == NULL_RTX)
8930 return expand_expr (fold (value), target, tmode,
8934 else if(TREE_CODE (init) == STRING_CST)
8936 tree index1 = index;
8937 tree low_bound = array_ref_low_bound (exp);
8938 index1 = fold_convert_loc (loc, sizetype,
8941 /* Optimize the special-case of a zero lower bound.
8943 We convert the low_bound to sizetype to avoid some problems
8944 with constant folding. (E.g. suppose the lower bound is 1,
8945 and its mode is QI. Without the conversion,l (ARRAY
8946 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
8947 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
8949 if (! integer_zerop (low_bound))
8950 index1 = size_diffop_loc (loc, index1,
8951 fold_convert_loc (loc, sizetype,
8954 if (0 > compare_tree_int (index1,
8955 TREE_STRING_LENGTH (init)))
8957 tree type = TREE_TYPE (TREE_TYPE (init));
8958 enum machine_mode mode = TYPE_MODE (type);
8960 if (GET_MODE_CLASS (mode) == MODE_INT
8961 && GET_MODE_SIZE (mode) == 1)
8962 return gen_int_mode (TREE_STRING_POINTER (init)
8963 [TREE_INT_CST_LOW (index1)],
8970 goto normal_inner_ref;
8973 /* If the operand is a CONSTRUCTOR, we can just extract the
8974 appropriate field if it is present. */
8975 if (TREE_CODE (treeop0) == CONSTRUCTOR)
8977 unsigned HOST_WIDE_INT idx;
8980 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0),
8982 if (field == treeop1
8983 /* We can normally use the value of the field in the
8984 CONSTRUCTOR. However, if this is a bitfield in
8985 an integral mode that we can fit in a HOST_WIDE_INT,
8986 we must mask only the number of bits in the bitfield,
8987 since this is done implicitly by the constructor. If
8988 the bitfield does not meet either of those conditions,
8989 we can't do this optimization. */
8990 && (! DECL_BIT_FIELD (field)
8991 || ((GET_MODE_CLASS (DECL_MODE (field)) == MODE_INT)
8992 && (GET_MODE_BITSIZE (DECL_MODE (field))
8993 <= HOST_BITS_PER_WIDE_INT))))
8995 if (DECL_BIT_FIELD (field)
8996 && modifier == EXPAND_STACK_PARM)
8998 op0 = expand_expr (value, target, tmode, modifier);
8999 if (DECL_BIT_FIELD (field))
9001 HOST_WIDE_INT bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
9002 enum machine_mode imode = TYPE_MODE (TREE_TYPE (field));
9004 if (TYPE_UNSIGNED (TREE_TYPE (field)))
9006 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
9007 op0 = expand_and (imode, op0, op1, target);
9012 = build_int_cst (NULL_TREE,
9013 GET_MODE_BITSIZE (imode) - bitsize);
9015 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
9017 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
9025 goto normal_inner_ref;
9028 case ARRAY_RANGE_REF:
9031 enum machine_mode mode1, mode2;
9032 HOST_WIDE_INT bitsize, bitpos;
9034 int volatilep = 0, must_force_mem;
9035 bool packedp = false;
9036 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
9037 &mode1, &unsignedp, &volatilep, true);
9038 rtx orig_op0, memloc;
9040 /* If we got back the original object, something is wrong. Perhaps
9041 we are evaluating an expression too early. In any event, don't
9042 infinitely recurse. */
9043 gcc_assert (tem != exp);
9045 if (TYPE_PACKED (TREE_TYPE (TREE_OPERAND (exp, 0)))
9046 || (TREE_CODE (TREE_OPERAND (exp, 1)) == FIELD_DECL
9047 && DECL_PACKED (TREE_OPERAND (exp, 1))))
9050 /* If TEM's type is a union of variable size, pass TARGET to the inner
9051 computation, since it will need a temporary and TARGET is known
9052 to have to do. This occurs in unchecked conversion in Ada. */
9055 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9056 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9058 && modifier != EXPAND_STACK_PARM
9059 ? target : NULL_RTX),
9061 (modifier == EXPAND_INITIALIZER
9062 || modifier == EXPAND_CONST_ADDRESS
9063 || modifier == EXPAND_STACK_PARM)
9064 ? modifier : EXPAND_NORMAL);
9067 /* If the bitfield is volatile, we want to access it in the
9068 field's mode, not the computed mode.
9069 If a MEM has VOIDmode (external with incomplete type),
9070 use BLKmode for it instead. */
9073 if (volatilep && flag_strict_volatile_bitfields > 0)
9074 op0 = adjust_address (op0, mode1, 0);
9075 else if (GET_MODE (op0) == VOIDmode)
9076 op0 = adjust_address (op0, BLKmode, 0);
9080 = CONSTANT_P (op0) ? TYPE_MODE (TREE_TYPE (tem)) : GET_MODE (op0);
9082 /* If we have either an offset, a BLKmode result, or a reference
9083 outside the underlying object, we must force it to memory.
9084 Such a case can occur in Ada if we have unchecked conversion
9085 of an expression from a scalar type to an aggregate type or
9086 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
9087 passed a partially uninitialized object or a view-conversion
9088 to a larger size. */
9089 must_force_mem = (offset
9091 || bitpos + bitsize > GET_MODE_BITSIZE (mode2));
9093 /* Handle CONCAT first. */
9094 if (GET_CODE (op0) == CONCAT && !must_force_mem)
9097 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
9100 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9103 op0 = XEXP (op0, 0);
9104 mode2 = GET_MODE (op0);
9106 else if (bitpos == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9107 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 1)))
9111 op0 = XEXP (op0, 1);
9113 mode2 = GET_MODE (op0);
9116 /* Otherwise force into memory. */
9120 /* If this is a constant, put it in a register if it is a legitimate
9121 constant and we don't need a memory reference. */
9122 if (CONSTANT_P (op0)
9124 && LEGITIMATE_CONSTANT_P (op0)
9126 op0 = force_reg (mode2, op0);
9128 /* Otherwise, if this is a constant, try to force it to the constant
9129 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9130 is a legitimate constant. */
9131 else if (CONSTANT_P (op0) && (memloc = force_const_mem (mode2, op0)))
9132 op0 = validize_mem (memloc);
9134 /* Otherwise, if this is a constant or the object is not in memory
9135 and need be, put it there. */
9136 else if (CONSTANT_P (op0) || (!MEM_P (op0) && must_force_mem))
9138 tree nt = build_qualified_type (TREE_TYPE (tem),
9139 (TYPE_QUALS (TREE_TYPE (tem))
9140 | TYPE_QUAL_CONST));
9141 memloc = assign_temp (nt, 1, 1, 1);
9142 emit_move_insn (memloc, op0);
9148 enum machine_mode address_mode;
9149 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
9152 gcc_assert (MEM_P (op0));
9155 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (op0));
9156 if (GET_MODE (offset_rtx) != address_mode)
9157 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
9159 if (GET_MODE (op0) == BLKmode
9160 /* A constant address in OP0 can have VOIDmode, we must
9161 not try to call force_reg in that case. */
9162 && GET_MODE (XEXP (op0, 0)) != VOIDmode
9164 && (bitpos % bitsize) == 0
9165 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
9166 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
9168 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9172 op0 = offset_address (op0, offset_rtx,
9173 highest_pow2_factor (offset));
9176 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9177 record its alignment as BIGGEST_ALIGNMENT. */
9178 if (MEM_P (op0) && bitpos == 0 && offset != 0
9179 && is_aligning_offset (offset, tem))
9180 set_mem_align (op0, BIGGEST_ALIGNMENT);
9182 /* Don't forget about volatility even if this is a bitfield. */
9183 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
9185 if (op0 == orig_op0)
9186 op0 = copy_rtx (op0);
9188 MEM_VOLATILE_P (op0) = 1;
9191 /* In cases where an aligned union has an unaligned object
9192 as a field, we might be extracting a BLKmode value from
9193 an integer-mode (e.g., SImode) object. Handle this case
9194 by doing the extract into an object as wide as the field
9195 (which we know to be the width of a basic mode), then
9196 storing into memory, and changing the mode to BLKmode. */
9197 if (mode1 == VOIDmode
9198 || REG_P (op0) || GET_CODE (op0) == SUBREG
9199 || (mode1 != BLKmode && ! direct_load[(int) mode1]
9200 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
9201 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
9202 && modifier != EXPAND_CONST_ADDRESS
9203 && modifier != EXPAND_INITIALIZER)
9204 /* If the field is volatile, we always want an aligned
9206 || (volatilep && flag_strict_volatile_bitfields > 0)
9207 /* If the field isn't aligned enough to fetch as a memref,
9208 fetch it as a bit field. */
9209 || (mode1 != BLKmode
9210 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
9211 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
9213 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
9214 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
9215 && ((modifier == EXPAND_CONST_ADDRESS
9216 || modifier == EXPAND_INITIALIZER)
9218 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
9219 || (bitpos % BITS_PER_UNIT != 0)))
9220 /* If the type and the field are a constant size and the
9221 size of the type isn't the same size as the bitfield,
9222 we must use bitfield operations. */
9224 && TYPE_SIZE (TREE_TYPE (exp))
9225 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9226 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
9229 enum machine_mode ext_mode = mode;
9231 if (ext_mode == BLKmode
9232 && ! (target != 0 && MEM_P (op0)
9234 && bitpos % BITS_PER_UNIT == 0))
9235 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
9237 if (ext_mode == BLKmode)
9240 target = assign_temp (type, 0, 1, 1);
9245 /* In this case, BITPOS must start at a byte boundary and
9246 TARGET, if specified, must be a MEM. */
9247 gcc_assert (MEM_P (op0)
9248 && (!target || MEM_P (target))
9249 && !(bitpos % BITS_PER_UNIT));
9251 emit_block_move (target,
9252 adjust_address (op0, VOIDmode,
9253 bitpos / BITS_PER_UNIT),
9254 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
9256 (modifier == EXPAND_STACK_PARM
9257 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9262 op0 = validize_mem (op0);
9264 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
9265 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9267 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp, packedp,
9268 (modifier == EXPAND_STACK_PARM
9269 ? NULL_RTX : target),
9270 ext_mode, ext_mode);
9272 /* If the result is a record type and BITSIZE is narrower than
9273 the mode of OP0, an integral mode, and this is a big endian
9274 machine, we must put the field into the high-order bits. */
9275 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
9276 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
9277 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
9278 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
9279 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
9283 /* If the result type is BLKmode, store the data into a temporary
9284 of the appropriate type, but with the mode corresponding to the
9285 mode for the data we have (op0's mode). It's tempting to make
9286 this a constant type, since we know it's only being stored once,
9287 but that can cause problems if we are taking the address of this
9288 COMPONENT_REF because the MEM of any reference via that address
9289 will have flags corresponding to the type, which will not
9290 necessarily be constant. */
9291 if (mode == BLKmode)
9293 HOST_WIDE_INT size = GET_MODE_BITSIZE (ext_mode);
9296 /* If the reference doesn't use the alias set of its type,
9297 we cannot create the temporary using that type. */
9298 if (component_uses_parent_alias_set (exp))
9300 new_rtx = assign_stack_local (ext_mode, size, 0);
9301 set_mem_alias_set (new_rtx, get_alias_set (exp));
9304 new_rtx = assign_stack_temp_for_type (ext_mode, size, 0, type);
9306 emit_move_insn (new_rtx, op0);
9307 op0 = copy_rtx (new_rtx);
9308 PUT_MODE (op0, BLKmode);
9309 set_mem_attributes (op0, exp, 1);
9315 /* If the result is BLKmode, use that to access the object
9317 if (mode == BLKmode)
9320 /* Get a reference to just this component. */
9321 if (modifier == EXPAND_CONST_ADDRESS
9322 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
9323 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
9325 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9327 if (op0 == orig_op0)
9328 op0 = copy_rtx (op0);
9330 set_mem_attributes (op0, exp, 0);
9331 if (REG_P (XEXP (op0, 0)))
9332 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9334 MEM_VOLATILE_P (op0) |= volatilep;
9335 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
9336 || modifier == EXPAND_CONST_ADDRESS
9337 || modifier == EXPAND_INITIALIZER)
9339 else if (target == 0)
9340 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9342 convert_move (target, op0, unsignedp);
9347 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
9350 /* All valid uses of __builtin_va_arg_pack () are removed during
9352 if (CALL_EXPR_VA_ARG_PACK (exp))
9353 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
9355 tree fndecl = get_callee_fndecl (exp), attr;
9358 && (attr = lookup_attribute ("error",
9359 DECL_ATTRIBUTES (fndecl))) != NULL)
9360 error ("%Kcall to %qs declared with attribute error: %s",
9361 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9362 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9364 && (attr = lookup_attribute ("warning",
9365 DECL_ATTRIBUTES (fndecl))) != NULL)
9366 warning_at (tree_nonartificial_location (exp),
9367 0, "%Kcall to %qs declared with attribute warning: %s",
9368 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9369 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9371 /* Check for a built-in function. */
9372 if (fndecl && DECL_BUILT_IN (fndecl))
9374 gcc_assert (DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_FRONTEND);
9375 return expand_builtin (exp, target, subtarget, tmode, ignore);
9378 return expand_call (exp, target, ignore);
9380 case VIEW_CONVERT_EXPR:
9383 /* If we are converting to BLKmode, try to avoid an intermediate
9384 temporary by fetching an inner memory reference. */
9386 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9387 && TYPE_MODE (TREE_TYPE (treeop0)) != BLKmode
9388 && handled_component_p (treeop0))
9390 enum machine_mode mode1;
9391 HOST_WIDE_INT bitsize, bitpos;
9396 = get_inner_reference (treeop0, &bitsize, &bitpos,
9397 &offset, &mode1, &unsignedp, &volatilep,
9401 /* ??? We should work harder and deal with non-zero offsets. */
9403 && (bitpos % BITS_PER_UNIT) == 0
9405 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) == 0)
9407 /* See the normal_inner_ref case for the rationale. */
9410 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9411 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9413 && modifier != EXPAND_STACK_PARM
9414 ? target : NULL_RTX),
9416 (modifier == EXPAND_INITIALIZER
9417 || modifier == EXPAND_CONST_ADDRESS
9418 || modifier == EXPAND_STACK_PARM)
9419 ? modifier : EXPAND_NORMAL);
9421 if (MEM_P (orig_op0))
9425 /* Get a reference to just this component. */
9426 if (modifier == EXPAND_CONST_ADDRESS
9427 || modifier == EXPAND_SUM
9428 || modifier == EXPAND_INITIALIZER)
9429 op0 = adjust_address_nv (op0, mode, bitpos / BITS_PER_UNIT);
9431 op0 = adjust_address (op0, mode, bitpos / BITS_PER_UNIT);
9433 if (op0 == orig_op0)
9434 op0 = copy_rtx (op0);
9436 set_mem_attributes (op0, treeop0, 0);
9437 if (REG_P (XEXP (op0, 0)))
9438 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9440 MEM_VOLATILE_P (op0) |= volatilep;
9446 op0 = expand_expr (treeop0,
9447 NULL_RTX, VOIDmode, modifier);
9449 /* If the input and output modes are both the same, we are done. */
9450 if (mode == GET_MODE (op0))
9452 /* If neither mode is BLKmode, and both modes are the same size
9453 then we can use gen_lowpart. */
9454 else if (mode != BLKmode && GET_MODE (op0) != BLKmode
9455 && GET_MODE_SIZE (mode) == GET_MODE_SIZE (GET_MODE (op0))
9456 && !COMPLEX_MODE_P (GET_MODE (op0)))
9458 if (GET_CODE (op0) == SUBREG)
9459 op0 = force_reg (GET_MODE (op0), op0);
9460 temp = gen_lowpart_common (mode, op0);
9465 if (!REG_P (op0) && !MEM_P (op0))
9466 op0 = force_reg (GET_MODE (op0), op0);
9467 op0 = gen_lowpart (mode, op0);
9470 /* If both types are integral, convert from one mode to the other. */
9471 else if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (TREE_TYPE (treeop0)))
9472 op0 = convert_modes (mode, GET_MODE (op0), op0,
9473 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
9474 /* As a last resort, spill op0 to memory, and reload it in a
9476 else if (!MEM_P (op0))
9478 /* If the operand is not a MEM, force it into memory. Since we
9479 are going to be changing the mode of the MEM, don't call
9480 force_const_mem for constants because we don't allow pool
9481 constants to change mode. */
9482 tree inner_type = TREE_TYPE (treeop0);
9484 gcc_assert (!TREE_ADDRESSABLE (exp));
9486 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
9488 = assign_stack_temp_for_type
9489 (TYPE_MODE (inner_type),
9490 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
9492 emit_move_insn (target, op0);
9496 /* At this point, OP0 is in the correct mode. If the output type is
9497 such that the operand is known to be aligned, indicate that it is.
9498 Otherwise, we need only be concerned about alignment for non-BLKmode
9502 op0 = copy_rtx (op0);
9504 if (TYPE_ALIGN_OK (type))
9505 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
9506 else if (STRICT_ALIGNMENT
9508 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode))
9510 tree inner_type = TREE_TYPE (treeop0);
9511 HOST_WIDE_INT temp_size
9512 = MAX (int_size_in_bytes (inner_type),
9513 (HOST_WIDE_INT) GET_MODE_SIZE (mode));
9515 = assign_stack_temp_for_type (mode, temp_size, 0, type);
9516 rtx new_with_op0_mode
9517 = adjust_address (new_rtx, GET_MODE (op0), 0);
9519 gcc_assert (!TREE_ADDRESSABLE (exp));
9521 if (GET_MODE (op0) == BLKmode)
9522 emit_block_move (new_with_op0_mode, op0,
9523 GEN_INT (GET_MODE_SIZE (mode)),
9524 (modifier == EXPAND_STACK_PARM
9525 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9527 emit_move_insn (new_with_op0_mode, op0);
9532 op0 = adjust_address (op0, mode, 0);
9537 /* Use a compare and a jump for BLKmode comparisons, or for function
9538 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
9540 /* Although TRUTH_{AND,OR}IF_EXPR aren't present in GIMPLE, they
9541 are occassionally created by folding during expansion. */
9542 case TRUTH_ANDIF_EXPR:
9543 case TRUTH_ORIF_EXPR:
9546 || modifier == EXPAND_STACK_PARM
9547 || ! safe_from_p (target, treeop0, 1)
9548 || ! safe_from_p (target, treeop1, 1)
9549 /* Make sure we don't have a hard reg (such as function's return
9550 value) live across basic blocks, if not optimizing. */
9551 || (!optimize && REG_P (target)
9552 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
9553 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9556 emit_move_insn (target, const0_rtx);
9558 op1 = gen_label_rtx ();
9559 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
9562 emit_move_insn (target, const1_rtx);
9565 return ignore ? const0_rtx : target;
9567 case STATEMENT_LIST:
9569 tree_stmt_iterator iter;
9571 gcc_assert (ignore);
9573 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
9574 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
9579 /* A COND_EXPR with its type being VOID_TYPE represents a
9580 conditional jump and is handled in
9581 expand_gimple_cond_expr. */
9582 gcc_assert (!VOID_TYPE_P (type));
9584 /* Note that COND_EXPRs whose type is a structure or union
9585 are required to be constructed to contain assignments of
9586 a temporary variable, so that we can evaluate them here
9587 for side effect only. If type is void, we must do likewise. */
9589 gcc_assert (!TREE_ADDRESSABLE (type)
9591 && TREE_TYPE (treeop1) != void_type_node
9592 && TREE_TYPE (treeop2) != void_type_node);
9594 /* If we are not to produce a result, we have no target. Otherwise,
9595 if a target was specified use it; it will not be used as an
9596 intermediate target unless it is safe. If no target, use a
9599 if (modifier != EXPAND_STACK_PARM
9601 && safe_from_p (original_target, treeop0, 1)
9602 && GET_MODE (original_target) == mode
9603 #ifdef HAVE_conditional_move
9604 && (! can_conditionally_move_p (mode)
9605 || REG_P (original_target))
9607 && !MEM_P (original_target))
9608 temp = original_target;
9610 temp = assign_temp (type, 0, 0, 1);
9612 do_pending_stack_adjust ();
9614 op0 = gen_label_rtx ();
9615 op1 = gen_label_rtx ();
9616 jumpifnot (treeop0, op0, -1);
9617 store_expr (treeop1, temp,
9618 modifier == EXPAND_STACK_PARM,
9621 emit_jump_insn (gen_jump (op1));
9624 store_expr (treeop2, temp,
9625 modifier == EXPAND_STACK_PARM,
9633 target = expand_vec_cond_expr (type, treeop0, treeop1, treeop2, target);
9640 gcc_assert (ignore);
9642 /* Check for |= or &= of a bitfield of size one into another bitfield
9643 of size 1. In this case, (unless we need the result of the
9644 assignment) we can do this more efficiently with a
9645 test followed by an assignment, if necessary.
9647 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9648 things change so we do, this code should be enhanced to
9650 if (TREE_CODE (lhs) == COMPONENT_REF
9651 && (TREE_CODE (rhs) == BIT_IOR_EXPR
9652 || TREE_CODE (rhs) == BIT_AND_EXPR)
9653 && TREE_OPERAND (rhs, 0) == lhs
9654 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
9655 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
9656 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
9658 rtx label = gen_label_rtx ();
9659 int value = TREE_CODE (rhs) == BIT_IOR_EXPR;
9660 do_jump (TREE_OPERAND (rhs, 1),
9662 value ? 0 : label, -1);
9663 expand_assignment (lhs, build_int_cst (TREE_TYPE (rhs), value),
9664 MOVE_NONTEMPORAL (exp));
9665 do_pending_stack_adjust ();
9670 expand_assignment (lhs, rhs, MOVE_NONTEMPORAL (exp));
9675 return expand_expr_addr_expr (exp, target, tmode, modifier);
9678 op0 = expand_normal (treeop0);
9679 return read_complex_part (op0, false);
9682 op0 = expand_normal (treeop0);
9683 return read_complex_part (op0, true);
9690 /* Expanded in cfgexpand.c. */
9693 case TRY_CATCH_EXPR:
9695 case EH_FILTER_EXPR:
9696 case TRY_FINALLY_EXPR:
9697 /* Lowered by tree-eh.c. */
9700 case WITH_CLEANUP_EXPR:
9701 case CLEANUP_POINT_EXPR:
9703 case CASE_LABEL_EXPR:
9709 case PREINCREMENT_EXPR:
9710 case PREDECREMENT_EXPR:
9711 case POSTINCREMENT_EXPR:
9712 case POSTDECREMENT_EXPR:
9715 /* Lowered by gimplify.c. */
9719 /* Function descriptors are not valid except for as
9720 initialization constants, and should not be expanded. */
9723 case WITH_SIZE_EXPR:
9724 /* WITH_SIZE_EXPR expands to its first argument. The caller should
9725 have pulled out the size to use in whatever context it needed. */
9726 return expand_expr_real (treeop0, original_target, tmode,
9729 case COMPOUND_LITERAL_EXPR:
9731 /* Initialize the anonymous variable declared in the compound
9732 literal, then return the variable. */
9733 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
9735 /* Create RTL for this variable. */
9736 if (!DECL_RTL_SET_P (decl))
9738 if (DECL_HARD_REGISTER (decl))
9739 /* The user specified an assembler name for this variable.
9741 rest_of_decl_compilation (decl, 0, 0);
9746 return expand_expr_real (decl, original_target, tmode,
9751 return expand_expr_real_2 (&ops, target, tmode, modifier);
9755 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
9756 signedness of TYPE), possibly returning the result in TARGET. */
9758 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
9760 HOST_WIDE_INT prec = TYPE_PRECISION (type);
9761 if (target && GET_MODE (target) != GET_MODE (exp))
9763 /* For constant values, reduce using build_int_cst_type. */
9764 if (CONST_INT_P (exp))
9766 HOST_WIDE_INT value = INTVAL (exp);
9767 tree t = build_int_cst_type (type, value);
9768 return expand_expr (t, target, VOIDmode, EXPAND_NORMAL);
9770 else if (TYPE_UNSIGNED (type))
9772 rtx mask = immed_double_int_const (double_int_mask (prec),
9774 return expand_and (GET_MODE (exp), exp, mask, target);
9778 tree count = build_int_cst (NULL_TREE,
9779 GET_MODE_BITSIZE (GET_MODE (exp)) - prec);
9780 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9781 return expand_shift (RSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9785 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9786 when applied to the address of EXP produces an address known to be
9787 aligned more than BIGGEST_ALIGNMENT. */
9790 is_aligning_offset (const_tree offset, const_tree exp)
9792 /* Strip off any conversions. */
9793 while (CONVERT_EXPR_P (offset))
9794 offset = TREE_OPERAND (offset, 0);
9796 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9797 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9798 if (TREE_CODE (offset) != BIT_AND_EXPR
9799 || !host_integerp (TREE_OPERAND (offset, 1), 1)
9800 || compare_tree_int (TREE_OPERAND (offset, 1),
9801 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
9802 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
9805 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9806 It must be NEGATE_EXPR. Then strip any more conversions. */
9807 offset = TREE_OPERAND (offset, 0);
9808 while (CONVERT_EXPR_P (offset))
9809 offset = TREE_OPERAND (offset, 0);
9811 if (TREE_CODE (offset) != NEGATE_EXPR)
9814 offset = TREE_OPERAND (offset, 0);
9815 while (CONVERT_EXPR_P (offset))
9816 offset = TREE_OPERAND (offset, 0);
9818 /* This must now be the address of EXP. */
9819 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
9822 /* Return the tree node if an ARG corresponds to a string constant or zero
9823 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
9824 in bytes within the string that ARG is accessing. The type of the
9825 offset will be `sizetype'. */
9828 string_constant (tree arg, tree *ptr_offset)
9830 tree array, offset, lower_bound;
9833 if (TREE_CODE (arg) == ADDR_EXPR)
9835 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
9837 *ptr_offset = size_zero_node;
9838 return TREE_OPERAND (arg, 0);
9840 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
9842 array = TREE_OPERAND (arg, 0);
9843 offset = size_zero_node;
9845 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
9847 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
9848 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
9849 if (TREE_CODE (array) != STRING_CST
9850 && TREE_CODE (array) != VAR_DECL)
9853 /* Check if the array has a nonzero lower bound. */
9854 lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
9855 if (!integer_zerop (lower_bound))
9857 /* If the offset and base aren't both constants, return 0. */
9858 if (TREE_CODE (lower_bound) != INTEGER_CST)
9860 if (TREE_CODE (offset) != INTEGER_CST)
9862 /* Adjust offset by the lower bound. */
9863 offset = size_diffop (fold_convert (sizetype, offset),
9864 fold_convert (sizetype, lower_bound));
9870 else if (TREE_CODE (arg) == PLUS_EXPR || TREE_CODE (arg) == POINTER_PLUS_EXPR)
9872 tree arg0 = TREE_OPERAND (arg, 0);
9873 tree arg1 = TREE_OPERAND (arg, 1);
9878 if (TREE_CODE (arg0) == ADDR_EXPR
9879 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
9880 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
9882 array = TREE_OPERAND (arg0, 0);
9885 else if (TREE_CODE (arg1) == ADDR_EXPR
9886 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
9887 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
9889 array = TREE_OPERAND (arg1, 0);
9898 if (TREE_CODE (array) == STRING_CST)
9900 *ptr_offset = fold_convert (sizetype, offset);
9903 else if (TREE_CODE (array) == VAR_DECL
9904 || TREE_CODE (array) == CONST_DECL)
9908 /* Variables initialized to string literals can be handled too. */
9909 if (!const_value_known_p (array)
9910 || !DECL_INITIAL (array)
9911 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
9914 /* Avoid const char foo[4] = "abcde"; */
9915 if (DECL_SIZE_UNIT (array) == NULL_TREE
9916 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
9917 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
9918 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
9921 /* If variable is bigger than the string literal, OFFSET must be constant
9922 and inside of the bounds of the string literal. */
9923 offset = fold_convert (sizetype, offset);
9924 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
9925 && (! host_integerp (offset, 1)
9926 || compare_tree_int (offset, length) >= 0))
9929 *ptr_offset = offset;
9930 return DECL_INITIAL (array);
9936 /* Generate code to calculate OPS, and exploded expression
9937 using a store-flag instruction and return an rtx for the result.
9938 OPS reflects a comparison.
9940 If TARGET is nonzero, store the result there if convenient.
9942 Return zero if there is no suitable set-flag instruction
9943 available on this machine.
9945 Once expand_expr has been called on the arguments of the comparison,
9946 we are committed to doing the store flag, since it is not safe to
9947 re-evaluate the expression. We emit the store-flag insn by calling
9948 emit_store_flag, but only expand the arguments if we have a reason
9949 to believe that emit_store_flag will be successful. If we think that
9950 it will, but it isn't, we have to simulate the store-flag with a
9951 set/jump/set sequence. */
9954 do_store_flag (sepops ops, rtx target, enum machine_mode mode)
9957 tree arg0, arg1, type;
9959 enum machine_mode operand_mode;
9962 rtx subtarget = target;
9963 location_t loc = ops->location;
9968 /* Don't crash if the comparison was erroneous. */
9969 if (arg0 == error_mark_node || arg1 == error_mark_node)
9972 type = TREE_TYPE (arg0);
9973 operand_mode = TYPE_MODE (type);
9974 unsignedp = TYPE_UNSIGNED (type);
9976 /* We won't bother with BLKmode store-flag operations because it would mean
9977 passing a lot of information to emit_store_flag. */
9978 if (operand_mode == BLKmode)
9981 /* We won't bother with store-flag operations involving function pointers
9982 when function pointers must be canonicalized before comparisons. */
9983 #ifdef HAVE_canonicalize_funcptr_for_compare
9984 if (HAVE_canonicalize_funcptr_for_compare
9985 && ((TREE_CODE (TREE_TYPE (arg0)) == POINTER_TYPE
9986 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0)))
9988 || (TREE_CODE (TREE_TYPE (arg1)) == POINTER_TYPE
9989 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1)))
9990 == FUNCTION_TYPE))))
9997 /* Get the rtx comparison code to use. We know that EXP is a comparison
9998 operation of some type. Some comparisons against 1 and -1 can be
9999 converted to comparisons with zero. Do so here so that the tests
10000 below will be aware that we have a comparison with zero. These
10001 tests will not catch constants in the first operand, but constants
10002 are rarely passed as the first operand. */
10013 if (integer_onep (arg1))
10014 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
10016 code = unsignedp ? LTU : LT;
10019 if (! unsignedp && integer_all_onesp (arg1))
10020 arg1 = integer_zero_node, code = LT;
10022 code = unsignedp ? LEU : LE;
10025 if (! unsignedp && integer_all_onesp (arg1))
10026 arg1 = integer_zero_node, code = GE;
10028 code = unsignedp ? GTU : GT;
10031 if (integer_onep (arg1))
10032 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10034 code = unsignedp ? GEU : GE;
10037 case UNORDERED_EXPR:
10063 gcc_unreachable ();
10066 /* Put a constant second. */
10067 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST
10068 || TREE_CODE (arg0) == FIXED_CST)
10070 tem = arg0; arg0 = arg1; arg1 = tem;
10071 code = swap_condition (code);
10074 /* If this is an equality or inequality test of a single bit, we can
10075 do this by shifting the bit being tested to the low-order bit and
10076 masking the result with the constant 1. If the condition was EQ,
10077 we xor it with 1. This does not require an scc insn and is faster
10078 than an scc insn even if we have it.
10080 The code to make this transformation was moved into fold_single_bit_test,
10081 so we just call into the folder and expand its result. */
10083 if ((code == NE || code == EQ)
10084 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
10085 && integer_pow2p (TREE_OPERAND (arg0, 1)))
10087 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
10088 return expand_expr (fold_single_bit_test (loc,
10089 code == NE ? NE_EXPR : EQ_EXPR,
10091 target, VOIDmode, EXPAND_NORMAL);
10094 if (! get_subtarget (target)
10095 || GET_MODE (subtarget) != operand_mode)
10098 expand_operands (arg0, arg1, subtarget, &op0, &op1, EXPAND_NORMAL);
10101 target = gen_reg_rtx (mode);
10103 /* Try a cstore if possible. */
10104 return emit_store_flag_force (target, code, op0, op1,
10105 operand_mode, unsignedp, 1);
10109 /* Stubs in case we haven't got a casesi insn. */
10110 #ifndef HAVE_casesi
10111 # define HAVE_casesi 0
10112 # define gen_casesi(a, b, c, d, e) (0)
10113 # define CODE_FOR_casesi CODE_FOR_nothing
10116 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10117 0 otherwise (i.e. if there is no casesi instruction). */
10119 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
10120 rtx table_label ATTRIBUTE_UNUSED, rtx default_label,
10121 rtx fallback_label ATTRIBUTE_UNUSED)
10123 enum machine_mode index_mode = SImode;
10124 int index_bits = GET_MODE_BITSIZE (index_mode);
10125 rtx op1, op2, index;
10126 enum machine_mode op_mode;
10131 /* Convert the index to SImode. */
10132 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10134 enum machine_mode omode = TYPE_MODE (index_type);
10135 rtx rangertx = expand_normal (range);
10137 /* We must handle the endpoints in the original mode. */
10138 index_expr = build2 (MINUS_EXPR, index_type,
10139 index_expr, minval);
10140 minval = integer_zero_node;
10141 index = expand_normal (index_expr);
10143 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10144 omode, 1, default_label);
10145 /* Now we can safely truncate. */
10146 index = convert_to_mode (index_mode, index, 0);
10150 if (TYPE_MODE (index_type) != index_mode)
10152 index_type = lang_hooks.types.type_for_size (index_bits, 0);
10153 index_expr = fold_convert (index_type, index_expr);
10156 index = expand_normal (index_expr);
10159 do_pending_stack_adjust ();
10161 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
10162 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
10164 index = copy_to_mode_reg (op_mode, index);
10166 op1 = expand_normal (minval);
10168 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
10169 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
10170 op1, TYPE_UNSIGNED (TREE_TYPE (minval)));
10171 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
10173 op1 = copy_to_mode_reg (op_mode, op1);
10175 op2 = expand_normal (range);
10177 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
10178 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
10179 op2, TYPE_UNSIGNED (TREE_TYPE (range)));
10180 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
10182 op2 = copy_to_mode_reg (op_mode, op2);
10184 emit_jump_insn (gen_casesi (index, op1, op2,
10185 table_label, !default_label
10186 ? fallback_label : default_label));
10190 /* Attempt to generate a tablejump instruction; same concept. */
10191 #ifndef HAVE_tablejump
10192 #define HAVE_tablejump 0
10193 #define gen_tablejump(x, y) (0)
10196 /* Subroutine of the next function.
10198 INDEX is the value being switched on, with the lowest value
10199 in the table already subtracted.
10200 MODE is its expected mode (needed if INDEX is constant).
10201 RANGE is the length of the jump table.
10202 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10204 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10205 index value is out of range. */
10208 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
10213 if (INTVAL (range) > cfun->cfg->max_jumptable_ents)
10214 cfun->cfg->max_jumptable_ents = INTVAL (range);
10216 /* Do an unsigned comparison (in the proper mode) between the index
10217 expression and the value which represents the length of the range.
10218 Since we just finished subtracting the lower bound of the range
10219 from the index expression, this comparison allows us to simultaneously
10220 check that the original index expression value is both greater than
10221 or equal to the minimum value of the range and less than or equal to
10222 the maximum value of the range. */
10225 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10228 /* If index is in range, it must fit in Pmode.
10229 Convert to Pmode so we can index with it. */
10231 index = convert_to_mode (Pmode, index, 1);
10233 /* Don't let a MEM slip through, because then INDEX that comes
10234 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10235 and break_out_memory_refs will go to work on it and mess it up. */
10236 #ifdef PIC_CASE_VECTOR_ADDRESS
10237 if (flag_pic && !REG_P (index))
10238 index = copy_to_mode_reg (Pmode, index);
10241 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10242 GET_MODE_SIZE, because this indicates how large insns are. The other
10243 uses should all be Pmode, because they are addresses. This code
10244 could fail if addresses and insns are not the same size. */
10245 index = gen_rtx_PLUS (Pmode,
10246 gen_rtx_MULT (Pmode, index,
10247 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10248 gen_rtx_LABEL_REF (Pmode, table_label));
10249 #ifdef PIC_CASE_VECTOR_ADDRESS
10251 index = PIC_CASE_VECTOR_ADDRESS (index);
10254 index = memory_address (CASE_VECTOR_MODE, index);
10255 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10256 vector = gen_const_mem (CASE_VECTOR_MODE, index);
10257 convert_move (temp, vector, 0);
10259 emit_jump_insn (gen_tablejump (temp, table_label));
10261 /* If we are generating PIC code or if the table is PC-relative, the
10262 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10263 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10268 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
10269 rtx table_label, rtx default_label)
10273 if (! HAVE_tablejump)
10276 index_expr = fold_build2 (MINUS_EXPR, index_type,
10277 fold_convert (index_type, index_expr),
10278 fold_convert (index_type, minval));
10279 index = expand_normal (index_expr);
10280 do_pending_stack_adjust ();
10282 do_tablejump (index, TYPE_MODE (index_type),
10283 convert_modes (TYPE_MODE (index_type),
10284 TYPE_MODE (TREE_TYPE (range)),
10285 expand_normal (range),
10286 TYPE_UNSIGNED (TREE_TYPE (range))),
10287 table_label, default_label);
10291 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10293 const_vector_from_tree (tree exp)
10298 enum machine_mode inner, mode;
10300 mode = TYPE_MODE (TREE_TYPE (exp));
10302 if (initializer_zerop (exp))
10303 return CONST0_RTX (mode);
10305 units = GET_MODE_NUNITS (mode);
10306 inner = GET_MODE_INNER (mode);
10308 v = rtvec_alloc (units);
10310 link = TREE_VECTOR_CST_ELTS (exp);
10311 for (i = 0; link; link = TREE_CHAIN (link), ++i)
10313 elt = TREE_VALUE (link);
10315 if (TREE_CODE (elt) == REAL_CST)
10316 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
10318 else if (TREE_CODE (elt) == FIXED_CST)
10319 RTVEC_ELT (v, i) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt),
10322 RTVEC_ELT (v, i) = immed_double_int_const (tree_to_double_int (elt),
10326 /* Initialize remaining elements to 0. */
10327 for (; i < units; ++i)
10328 RTVEC_ELT (v, i) = CONST0_RTX (inner);
10330 return gen_rtx_CONST_VECTOR (mode, v);
10333 /* Build a decl for a personality function given a language prefix. */
10336 build_personality_function (const char *lang)
10338 const char *unwind_and_version;
10342 switch (targetm.except_unwind_info (&global_options))
10347 unwind_and_version = "_sj0";
10351 unwind_and_version = "_v0";
10354 gcc_unreachable ();
10357 name = ACONCAT (("__", lang, "_personality", unwind_and_version, NULL));
10359 type = build_function_type_list (integer_type_node, integer_type_node,
10360 long_long_unsigned_type_node,
10361 ptr_type_node, ptr_type_node, NULL_TREE);
10362 decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
10363 get_identifier (name), type);
10364 DECL_ARTIFICIAL (decl) = 1;
10365 DECL_EXTERNAL (decl) = 1;
10366 TREE_PUBLIC (decl) = 1;
10368 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
10369 are the flags assigned by targetm.encode_section_info. */
10370 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl), 0), NULL);
10375 /* Extracts the personality function of DECL and returns the corresponding
10379 get_personality_function (tree decl)
10381 tree personality = DECL_FUNCTION_PERSONALITY (decl);
10382 enum eh_personality_kind pk;
10384 pk = function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl));
10385 if (pk == eh_personality_none)
10389 && pk == eh_personality_any)
10390 personality = lang_hooks.eh_personality ();
10392 if (pk == eh_personality_lang)
10393 gcc_assert (personality != NULL_TREE);
10395 return XEXP (DECL_RTL (personality), 0);
10398 #include "gt-expr.h"