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"
52 #include "common/common-target.h"
55 #include "diagnostic.h"
56 #include "ssaexpand.h"
57 #include "target-globals.h"
60 /* Decide whether a function's arguments should be processed
61 from first to last or from last to first.
63 They should if the stack and args grow in opposite directions, but
64 only if we have push insns. */
68 #ifndef PUSH_ARGS_REVERSED
69 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
70 #define PUSH_ARGS_REVERSED /* If it's last to first. */
76 #ifndef STACK_PUSH_CODE
77 #ifdef STACK_GROWS_DOWNWARD
78 #define STACK_PUSH_CODE PRE_DEC
80 #define STACK_PUSH_CODE PRE_INC
85 /* If this is nonzero, we do not bother generating VOLATILE
86 around volatile memory references, and we are willing to
87 output indirect addresses. If cse is to follow, we reject
88 indirect addresses so a useful potential cse is generated;
89 if it is used only once, instruction combination will produce
90 the same indirect address eventually. */
93 /* This structure is used by move_by_pieces to describe the move to
95 struct move_by_pieces_d
104 int explicit_inc_from;
105 unsigned HOST_WIDE_INT len;
106 HOST_WIDE_INT offset;
110 /* This structure is used by store_by_pieces to describe the clear to
113 struct store_by_pieces_d
119 unsigned HOST_WIDE_INT len;
120 HOST_WIDE_INT offset;
121 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode);
126 static unsigned HOST_WIDE_INT move_by_pieces_ninsns (unsigned HOST_WIDE_INT,
129 static void move_by_pieces_1 (rtx (*) (rtx, ...), enum machine_mode,
130 struct move_by_pieces_d *);
131 static bool block_move_libcall_safe_for_call_parm (void);
132 static bool emit_block_move_via_movmem (rtx, rtx, rtx, unsigned, unsigned, HOST_WIDE_INT);
133 static tree emit_block_move_libcall_fn (int);
134 static void emit_block_move_via_loop (rtx, rtx, rtx, unsigned);
135 static rtx clear_by_pieces_1 (void *, HOST_WIDE_INT, enum machine_mode);
136 static void clear_by_pieces (rtx, unsigned HOST_WIDE_INT, unsigned int);
137 static void store_by_pieces_1 (struct store_by_pieces_d *, unsigned int);
138 static void store_by_pieces_2 (rtx (*) (rtx, ...), enum machine_mode,
139 struct store_by_pieces_d *);
140 static tree clear_storage_libcall_fn (int);
141 static rtx compress_float_constant (rtx, rtx);
142 static rtx get_subtarget (rtx);
143 static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
144 HOST_WIDE_INT, enum machine_mode,
145 tree, tree, int, alias_set_type);
146 static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
147 static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT,
148 unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT,
150 tree, tree, alias_set_type, bool);
152 static unsigned HOST_WIDE_INT highest_pow2_factor_for_target (const_tree, const_tree);
154 static int is_aligning_offset (const_tree, const_tree);
155 static void expand_operands (tree, tree, rtx, rtx*, rtx*,
156 enum expand_modifier);
157 static rtx reduce_to_bit_field_precision (rtx, rtx, tree);
158 static rtx do_store_flag (sepops, rtx, enum machine_mode);
160 static void emit_single_push_insn (enum machine_mode, rtx, tree);
162 static void do_tablejump (rtx, enum machine_mode, rtx, rtx, rtx);
163 static rtx const_vector_from_tree (tree);
164 static void write_complex_part (rtx, rtx, bool);
166 /* This macro is used to determine whether move_by_pieces should be called
167 to perform a structure copy. */
168 #ifndef MOVE_BY_PIECES_P
169 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
170 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
171 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
174 /* This macro is used to determine whether clear_by_pieces should be
175 called to clear storage. */
176 #ifndef CLEAR_BY_PIECES_P
177 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
178 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
179 < (unsigned int) CLEAR_RATIO (optimize_insn_for_speed_p ()))
182 /* This macro is used to determine whether store_by_pieces should be
183 called to "memset" storage with byte values other than zero. */
184 #ifndef SET_BY_PIECES_P
185 #define SET_BY_PIECES_P(SIZE, ALIGN) \
186 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
187 < (unsigned int) SET_RATIO (optimize_insn_for_speed_p ()))
190 /* This macro is used to determine whether store_by_pieces should be
191 called to "memcpy" storage when the source is a constant string. */
192 #ifndef STORE_BY_PIECES_P
193 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
194 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
195 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
198 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
200 #ifndef SLOW_UNALIGNED_ACCESS
201 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
204 /* This is run to set up which modes can be used
205 directly in memory and to initialize the block move optab. It is run
206 at the beginning of compilation and when the target is reinitialized. */
209 init_expr_target (void)
212 enum machine_mode mode;
217 /* Try indexing by frame ptr and try by stack ptr.
218 It is known that on the Convex the stack ptr isn't a valid index.
219 With luck, one or the other is valid on any machine. */
220 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
221 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
223 /* A scratch register we can modify in-place below to avoid
224 useless RTL allocations. */
225 reg = gen_rtx_REG (VOIDmode, -1);
227 insn = rtx_alloc (INSN);
228 pat = gen_rtx_SET (VOIDmode, NULL_RTX, NULL_RTX);
229 PATTERN (insn) = pat;
231 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
232 mode = (enum machine_mode) ((int) mode + 1))
236 direct_load[(int) mode] = direct_store[(int) mode] = 0;
237 PUT_MODE (mem, mode);
238 PUT_MODE (mem1, mode);
239 PUT_MODE (reg, mode);
241 /* See if there is some register that can be used in this mode and
242 directly loaded or stored from memory. */
244 if (mode != VOIDmode && mode != BLKmode)
245 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
246 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
249 if (! HARD_REGNO_MODE_OK (regno, mode))
252 SET_REGNO (reg, regno);
255 SET_DEST (pat) = reg;
256 if (recog (pat, insn, &num_clobbers) >= 0)
257 direct_load[(int) mode] = 1;
259 SET_SRC (pat) = mem1;
260 SET_DEST (pat) = reg;
261 if (recog (pat, insn, &num_clobbers) >= 0)
262 direct_load[(int) mode] = 1;
265 SET_DEST (pat) = mem;
266 if (recog (pat, insn, &num_clobbers) >= 0)
267 direct_store[(int) mode] = 1;
270 SET_DEST (pat) = mem1;
271 if (recog (pat, insn, &num_clobbers) >= 0)
272 direct_store[(int) mode] = 1;
276 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
278 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
279 mode = GET_MODE_WIDER_MODE (mode))
281 enum machine_mode srcmode;
282 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
283 srcmode = GET_MODE_WIDER_MODE (srcmode))
287 ic = can_extend_p (mode, srcmode, 0);
288 if (ic == CODE_FOR_nothing)
291 PUT_MODE (mem, srcmode);
293 if (insn_operand_matches (ic, 1, mem))
294 float_extend_from_mem[mode][srcmode] = true;
299 /* This is run at the start of compiling a function. */
304 memset (&crtl->expr, 0, sizeof (crtl->expr));
307 /* Copy data from FROM to TO, where the machine modes are not the same.
308 Both modes may be integer, or both may be floating, or both may be
310 UNSIGNEDP should be nonzero if FROM is an unsigned type.
311 This causes zero-extension instead of sign-extension. */
314 convert_move (rtx to, rtx from, int unsignedp)
316 enum machine_mode to_mode = GET_MODE (to);
317 enum machine_mode from_mode = GET_MODE (from);
318 int to_real = SCALAR_FLOAT_MODE_P (to_mode);
319 int from_real = SCALAR_FLOAT_MODE_P (from_mode);
323 /* rtx code for making an equivalent value. */
324 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
325 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
328 gcc_assert (to_real == from_real);
329 gcc_assert (to_mode != BLKmode);
330 gcc_assert (from_mode != BLKmode);
332 /* If the source and destination are already the same, then there's
337 /* If FROM is a SUBREG that indicates that we have already done at least
338 the required extension, strip it. We don't handle such SUBREGs as
341 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
342 && (GET_MODE_PRECISION (GET_MODE (SUBREG_REG (from)))
343 >= GET_MODE_PRECISION (to_mode))
344 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
345 from = gen_lowpart (to_mode, from), from_mode = to_mode;
347 gcc_assert (GET_CODE (to) != SUBREG || !SUBREG_PROMOTED_VAR_P (to));
349 if (to_mode == from_mode
350 || (from_mode == VOIDmode && CONSTANT_P (from)))
352 emit_move_insn (to, from);
356 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
358 gcc_assert (GET_MODE_BITSIZE (from_mode) == GET_MODE_BITSIZE (to_mode));
360 if (VECTOR_MODE_P (to_mode))
361 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
363 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
365 emit_move_insn (to, from);
369 if (GET_CODE (to) == CONCAT && GET_CODE (from) == CONCAT)
371 convert_move (XEXP (to, 0), XEXP (from, 0), unsignedp);
372 convert_move (XEXP (to, 1), XEXP (from, 1), unsignedp);
381 gcc_assert ((GET_MODE_PRECISION (from_mode)
382 != GET_MODE_PRECISION (to_mode))
383 || (DECIMAL_FLOAT_MODE_P (from_mode)
384 != DECIMAL_FLOAT_MODE_P (to_mode)));
386 if (GET_MODE_PRECISION (from_mode) == GET_MODE_PRECISION (to_mode))
387 /* Conversion between decimal float and binary float, same size. */
388 tab = DECIMAL_FLOAT_MODE_P (from_mode) ? trunc_optab : sext_optab;
389 else if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode))
394 /* Try converting directly if the insn is supported. */
396 code = convert_optab_handler (tab, to_mode, from_mode);
397 if (code != CODE_FOR_nothing)
399 emit_unop_insn (code, to, from,
400 tab == sext_optab ? FLOAT_EXTEND : FLOAT_TRUNCATE);
404 /* Otherwise use a libcall. */
405 libcall = convert_optab_libfunc (tab, to_mode, from_mode);
407 /* Is this conversion implemented yet? */
408 gcc_assert (libcall);
411 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
413 insns = get_insns ();
415 emit_libcall_block (insns, to, value,
416 tab == trunc_optab ? gen_rtx_FLOAT_TRUNCATE (to_mode,
418 : gen_rtx_FLOAT_EXTEND (to_mode, from));
422 /* Handle pointer conversion. */ /* SPEE 900220. */
423 /* Targets are expected to provide conversion insns between PxImode and
424 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
425 if (GET_MODE_CLASS (to_mode) == MODE_PARTIAL_INT)
427 enum machine_mode full_mode
428 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode), MODE_INT);
430 gcc_assert (convert_optab_handler (trunc_optab, to_mode, full_mode)
431 != CODE_FOR_nothing);
433 if (full_mode != from_mode)
434 from = convert_to_mode (full_mode, from, unsignedp);
435 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, full_mode),
439 if (GET_MODE_CLASS (from_mode) == MODE_PARTIAL_INT)
442 enum machine_mode full_mode
443 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode), MODE_INT);
445 gcc_assert (convert_optab_handler (sext_optab, full_mode, from_mode)
446 != CODE_FOR_nothing);
448 if (to_mode == full_mode)
450 emit_unop_insn (convert_optab_handler (sext_optab, full_mode,
456 new_from = gen_reg_rtx (full_mode);
457 emit_unop_insn (convert_optab_handler (sext_optab, full_mode, from_mode),
458 new_from, from, UNKNOWN);
460 /* else proceed to integer conversions below. */
461 from_mode = full_mode;
465 /* Make sure both are fixed-point modes or both are not. */
466 gcc_assert (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode) ==
467 ALL_SCALAR_FIXED_POINT_MODE_P (to_mode));
468 if (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode))
470 /* If we widen from_mode to to_mode and they are in the same class,
471 we won't saturate the result.
472 Otherwise, always saturate the result to play safe. */
473 if (GET_MODE_CLASS (from_mode) == GET_MODE_CLASS (to_mode)
474 && GET_MODE_SIZE (from_mode) < GET_MODE_SIZE (to_mode))
475 expand_fixed_convert (to, from, 0, 0);
477 expand_fixed_convert (to, from, 0, 1);
481 /* Now both modes are integers. */
483 /* Handle expanding beyond a word. */
484 if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode)
485 && GET_MODE_PRECISION (to_mode) > BITS_PER_WORD)
492 enum machine_mode lowpart_mode;
493 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
495 /* Try converting directly if the insn is supported. */
496 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
499 /* If FROM is a SUBREG, put it into a register. Do this
500 so that we always generate the same set of insns for
501 better cse'ing; if an intermediate assignment occurred,
502 we won't be doing the operation directly on the SUBREG. */
503 if (optimize > 0 && GET_CODE (from) == SUBREG)
504 from = force_reg (from_mode, from);
505 emit_unop_insn (code, to, from, equiv_code);
508 /* Next, try converting via full word. */
509 else if (GET_MODE_PRECISION (from_mode) < BITS_PER_WORD
510 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
511 != CODE_FOR_nothing))
513 rtx word_to = gen_reg_rtx (word_mode);
516 if (reg_overlap_mentioned_p (to, from))
517 from = force_reg (from_mode, from);
520 convert_move (word_to, from, unsignedp);
521 emit_unop_insn (code, to, word_to, equiv_code);
525 /* No special multiword conversion insn; do it by hand. */
528 /* Since we will turn this into a no conflict block, we must ensure
529 that the source does not overlap the target. */
531 if (reg_overlap_mentioned_p (to, from))
532 from = force_reg (from_mode, from);
534 /* Get a copy of FROM widened to a word, if necessary. */
535 if (GET_MODE_PRECISION (from_mode) < BITS_PER_WORD)
536 lowpart_mode = word_mode;
538 lowpart_mode = from_mode;
540 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
542 lowpart = gen_lowpart (lowpart_mode, to);
543 emit_move_insn (lowpart, lowfrom);
545 /* Compute the value to put in each remaining word. */
547 fill_value = const0_rtx;
549 fill_value = emit_store_flag (gen_reg_rtx (word_mode),
550 LT, lowfrom, const0_rtx,
553 /* Fill the remaining words. */
554 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
556 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
557 rtx subword = operand_subword (to, index, 1, to_mode);
559 gcc_assert (subword);
561 if (fill_value != subword)
562 emit_move_insn (subword, fill_value);
565 insns = get_insns ();
572 /* Truncating multi-word to a word or less. */
573 if (GET_MODE_PRECISION (from_mode) > BITS_PER_WORD
574 && GET_MODE_PRECISION (to_mode) <= BITS_PER_WORD)
577 && ! MEM_VOLATILE_P (from)
578 && direct_load[(int) to_mode]
579 && ! mode_dependent_address_p (XEXP (from, 0)))
581 || GET_CODE (from) == SUBREG))
582 from = force_reg (from_mode, from);
583 convert_move (to, gen_lowpart (word_mode, from), 0);
587 /* Now follow all the conversions between integers
588 no more than a word long. */
590 /* For truncation, usually we can just refer to FROM in a narrower mode. */
591 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
592 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode, from_mode))
595 && ! MEM_VOLATILE_P (from)
596 && direct_load[(int) to_mode]
597 && ! mode_dependent_address_p (XEXP (from, 0)))
599 || GET_CODE (from) == SUBREG))
600 from = force_reg (from_mode, from);
601 if (REG_P (from) && REGNO (from) < FIRST_PSEUDO_REGISTER
602 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
603 from = copy_to_reg (from);
604 emit_move_insn (to, gen_lowpart (to_mode, from));
608 /* Handle extension. */
609 if (GET_MODE_PRECISION (to_mode) > GET_MODE_PRECISION (from_mode))
611 /* Convert directly if that works. */
612 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
615 emit_unop_insn (code, to, from, equiv_code);
620 enum machine_mode intermediate;
624 /* Search for a mode to convert via. */
625 for (intermediate = from_mode; intermediate != VOIDmode;
626 intermediate = GET_MODE_WIDER_MODE (intermediate))
627 if (((can_extend_p (to_mode, intermediate, unsignedp)
629 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
630 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode, intermediate)))
631 && (can_extend_p (intermediate, from_mode, unsignedp)
632 != CODE_FOR_nothing))
634 convert_move (to, convert_to_mode (intermediate, from,
635 unsignedp), unsignedp);
639 /* No suitable intermediate mode.
640 Generate what we need with shifts. */
641 shift_amount = (GET_MODE_PRECISION (to_mode)
642 - GET_MODE_PRECISION (from_mode));
643 from = gen_lowpart (to_mode, force_reg (from_mode, from));
644 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
646 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
649 emit_move_insn (to, tmp);
654 /* Support special truncate insns for certain modes. */
655 if (convert_optab_handler (trunc_optab, to_mode,
656 from_mode) != CODE_FOR_nothing)
658 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, from_mode),
663 /* Handle truncation of volatile memrefs, and so on;
664 the things that couldn't be truncated directly,
665 and for which there was no special instruction.
667 ??? Code above formerly short-circuited this, for most integer
668 mode pairs, with a force_reg in from_mode followed by a recursive
669 call to this routine. Appears always to have been wrong. */
670 if (GET_MODE_PRECISION (to_mode) < GET_MODE_PRECISION (from_mode))
672 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
673 emit_move_insn (to, temp);
677 /* Mode combination is not recognized. */
681 /* Return an rtx for a value that would result
682 from converting X to mode MODE.
683 Both X and MODE may be floating, or both integer.
684 UNSIGNEDP is nonzero if X is an unsigned value.
685 This can be done by referring to a part of X in place
686 or by copying to a new temporary with conversion. */
689 convert_to_mode (enum machine_mode mode, rtx x, int unsignedp)
691 return convert_modes (mode, VOIDmode, x, unsignedp);
694 /* Return an rtx for a value that would result
695 from converting X from mode OLDMODE to mode MODE.
696 Both modes may be floating, or both integer.
697 UNSIGNEDP is nonzero if X is an unsigned value.
699 This can be done by referring to a part of X in place
700 or by copying to a new temporary with conversion.
702 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
705 convert_modes (enum machine_mode mode, enum machine_mode oldmode, rtx x, int unsignedp)
709 /* If FROM is a SUBREG that indicates that we have already done at least
710 the required extension, strip it. */
712 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
713 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
714 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
715 x = gen_lowpart (mode, x);
717 if (GET_MODE (x) != VOIDmode)
718 oldmode = GET_MODE (x);
723 /* There is one case that we must handle specially: If we are converting
724 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
725 we are to interpret the constant as unsigned, gen_lowpart will do
726 the wrong if the constant appears negative. What we want to do is
727 make the high-order word of the constant zero, not all ones. */
729 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
730 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
731 && CONST_INT_P (x) && INTVAL (x) < 0)
733 double_int val = uhwi_to_double_int (INTVAL (x));
735 /* We need to zero extend VAL. */
736 if (oldmode != VOIDmode)
737 val = double_int_zext (val, GET_MODE_BITSIZE (oldmode));
739 return immed_double_int_const (val, mode);
742 /* We can do this with a gen_lowpart if both desired and current modes
743 are integer, and this is either a constant integer, a register, or a
744 non-volatile MEM. Except for the constant case where MODE is no
745 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
748 && GET_MODE_PRECISION (mode) <= HOST_BITS_PER_WIDE_INT)
749 || (GET_MODE_CLASS (mode) == MODE_INT
750 && GET_MODE_CLASS (oldmode) == MODE_INT
751 && (GET_CODE (x) == CONST_DOUBLE
752 || (GET_MODE_PRECISION (mode) <= GET_MODE_PRECISION (oldmode)
753 && ((MEM_P (x) && ! MEM_VOLATILE_P (x)
754 && direct_load[(int) mode])
756 && (! HARD_REGISTER_P (x)
757 || HARD_REGNO_MODE_OK (REGNO (x), mode))
758 && TRULY_NOOP_TRUNCATION_MODES_P (mode,
761 /* ?? If we don't know OLDMODE, we have to assume here that
762 X does not need sign- or zero-extension. This may not be
763 the case, but it's the best we can do. */
764 if (CONST_INT_P (x) && oldmode != VOIDmode
765 && GET_MODE_PRECISION (mode) > GET_MODE_PRECISION (oldmode))
767 HOST_WIDE_INT val = INTVAL (x);
769 /* We must sign or zero-extend in this case. Start by
770 zero-extending, then sign extend if we need to. */
771 val &= GET_MODE_MASK (oldmode);
773 && val_signbit_known_set_p (oldmode, val))
774 val |= ~GET_MODE_MASK (oldmode);
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, INTVAL (size));
1173 set_mem_size (y, INTVAL (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)))
1185 /* Since x and y are passed to a libcall, mark the corresponding
1186 tree EXPR as addressable. */
1187 tree y_expr = MEM_EXPR (y);
1188 tree x_expr = MEM_EXPR (x);
1190 mark_addressable (y_expr);
1192 mark_addressable (x_expr);
1193 retval = emit_block_move_via_libcall (x, y, size,
1194 method == BLOCK_OP_TAILCALL);
1198 emit_block_move_via_loop (x, y, size, align);
1200 if (method == BLOCK_OP_CALL_PARM)
1207 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1209 return emit_block_move_hints (x, y, size, method, 0, -1);
1212 /* A subroutine of emit_block_move. Returns true if calling the
1213 block move libcall will not clobber any parameters which may have
1214 already been placed on the stack. */
1217 block_move_libcall_safe_for_call_parm (void)
1219 #if defined (REG_PARM_STACK_SPACE)
1223 /* If arguments are pushed on the stack, then they're safe. */
1227 /* If registers go on the stack anyway, any argument is sure to clobber
1228 an outgoing argument. */
1229 #if defined (REG_PARM_STACK_SPACE)
1230 fn = emit_block_move_libcall_fn (false);
1231 /* Avoid set but not used warning if *REG_PARM_STACK_SPACE doesn't
1232 depend on its argument. */
1234 if (OUTGOING_REG_PARM_STACK_SPACE ((!fn ? NULL_TREE : TREE_TYPE (fn)))
1235 && REG_PARM_STACK_SPACE (fn) != 0)
1239 /* If any argument goes in memory, then it might clobber an outgoing
1242 CUMULATIVE_ARGS args_so_far_v;
1243 cumulative_args_t args_so_far;
1246 fn = emit_block_move_libcall_fn (false);
1247 INIT_CUMULATIVE_ARGS (args_so_far_v, TREE_TYPE (fn), NULL_RTX, 0, 3);
1248 args_so_far = pack_cumulative_args (&args_so_far_v);
1250 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1251 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1253 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1254 rtx tmp = targetm.calls.function_arg (args_so_far, mode,
1256 if (!tmp || !REG_P (tmp))
1258 if (targetm.calls.arg_partial_bytes (args_so_far, mode, NULL, 1))
1260 targetm.calls.function_arg_advance (args_so_far, mode,
1267 /* A subroutine of emit_block_move. Expand a movmem pattern;
1268 return true if successful. */
1271 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align,
1272 unsigned int expected_align, HOST_WIDE_INT expected_size)
1274 int save_volatile_ok = volatile_ok;
1275 enum machine_mode mode;
1277 if (expected_align < align)
1278 expected_align = align;
1280 /* Since this is a move insn, we don't care about volatility. */
1283 /* Try the most limited insn first, because there's no point
1284 including more than one in the machine description unless
1285 the more limited one has some advantage. */
1287 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1288 mode = GET_MODE_WIDER_MODE (mode))
1290 enum insn_code code = direct_optab_handler (movmem_optab, mode);
1292 if (code != CODE_FOR_nothing
1293 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1294 here because if SIZE is less than the mode mask, as it is
1295 returned by the macro, it will definitely be less than the
1296 actual mode mask. */
1297 && ((CONST_INT_P (size)
1298 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1299 <= (GET_MODE_MASK (mode) >> 1)))
1300 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD))
1302 struct expand_operand ops[6];
1305 /* ??? When called via emit_block_move_for_call, it'd be
1306 nice if there were some way to inform the backend, so
1307 that it doesn't fail the expansion because it thinks
1308 emitting the libcall would be more efficient. */
1309 nops = insn_data[(int) code].n_generator_args;
1310 gcc_assert (nops == 4 || nops == 6);
1312 create_fixed_operand (&ops[0], x);
1313 create_fixed_operand (&ops[1], y);
1314 /* The check above guarantees that this size conversion is valid. */
1315 create_convert_operand_to (&ops[2], size, mode, true);
1316 create_integer_operand (&ops[3], align / BITS_PER_UNIT);
1319 create_integer_operand (&ops[4], expected_align / BITS_PER_UNIT);
1320 create_integer_operand (&ops[5], expected_size);
1322 if (maybe_expand_insn (code, nops, ops))
1324 volatile_ok = save_volatile_ok;
1330 volatile_ok = save_volatile_ok;
1334 /* A subroutine of emit_block_move. Expand a call to memcpy.
1335 Return the return value from memcpy, 0 otherwise. */
1338 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1340 rtx dst_addr, src_addr;
1341 tree call_expr, fn, src_tree, dst_tree, size_tree;
1342 enum machine_mode size_mode;
1345 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1346 pseudos. We can then place those new pseudos into a VAR_DECL and
1349 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1350 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1352 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1353 src_addr = convert_memory_address (ptr_mode, src_addr);
1355 dst_tree = make_tree (ptr_type_node, dst_addr);
1356 src_tree = make_tree (ptr_type_node, src_addr);
1358 size_mode = TYPE_MODE (sizetype);
1360 size = convert_to_mode (size_mode, size, 1);
1361 size = copy_to_mode_reg (size_mode, size);
1363 /* It is incorrect to use the libcall calling conventions to call
1364 memcpy in this context. This could be a user call to memcpy and
1365 the user may wish to examine the return value from memcpy. For
1366 targets where libcalls and normal calls have different conventions
1367 for returning pointers, we could end up generating incorrect code. */
1369 size_tree = make_tree (sizetype, size);
1371 fn = emit_block_move_libcall_fn (true);
1372 call_expr = build_call_expr (fn, 3, dst_tree, src_tree, size_tree);
1373 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1375 retval = expand_normal (call_expr);
1380 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1381 for the function we use for block copies. The first time FOR_CALL
1382 is true, we call assemble_external. */
1384 static GTY(()) tree block_move_fn;
1387 init_block_move_fn (const char *asmspec)
1393 fn = get_identifier ("memcpy");
1394 args = build_function_type_list (ptr_type_node, ptr_type_node,
1395 const_ptr_type_node, sizetype,
1398 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
1399 DECL_EXTERNAL (fn) = 1;
1400 TREE_PUBLIC (fn) = 1;
1401 DECL_ARTIFICIAL (fn) = 1;
1402 TREE_NOTHROW (fn) = 1;
1403 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
1404 DECL_VISIBILITY_SPECIFIED (fn) = 1;
1410 set_user_assembler_name (block_move_fn, asmspec);
1414 emit_block_move_libcall_fn (int for_call)
1416 static bool emitted_extern;
1419 init_block_move_fn (NULL);
1421 if (for_call && !emitted_extern)
1423 emitted_extern = true;
1424 make_decl_rtl (block_move_fn);
1425 assemble_external (block_move_fn);
1428 return block_move_fn;
1431 /* A subroutine of emit_block_move. Copy the data via an explicit
1432 loop. This is used only when libcalls are forbidden. */
1433 /* ??? It'd be nice to copy in hunks larger than QImode. */
1436 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1437 unsigned int align ATTRIBUTE_UNUSED)
1439 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1440 enum machine_mode x_addr_mode
1441 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (x));
1442 enum machine_mode y_addr_mode
1443 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (y));
1444 enum machine_mode iter_mode;
1446 iter_mode = GET_MODE (size);
1447 if (iter_mode == VOIDmode)
1448 iter_mode = word_mode;
1450 top_label = gen_label_rtx ();
1451 cmp_label = gen_label_rtx ();
1452 iter = gen_reg_rtx (iter_mode);
1454 emit_move_insn (iter, const0_rtx);
1456 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1457 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1458 do_pending_stack_adjust ();
1460 emit_jump (cmp_label);
1461 emit_label (top_label);
1463 tmp = convert_modes (x_addr_mode, iter_mode, iter, true);
1464 x_addr = gen_rtx_PLUS (x_addr_mode, x_addr, tmp);
1466 if (x_addr_mode != y_addr_mode)
1467 tmp = convert_modes (y_addr_mode, iter_mode, iter, true);
1468 y_addr = gen_rtx_PLUS (y_addr_mode, y_addr, tmp);
1470 x = change_address (x, QImode, x_addr);
1471 y = change_address (y, QImode, y_addr);
1473 emit_move_insn (x, y);
1475 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1476 true, OPTAB_LIB_WIDEN);
1478 emit_move_insn (iter, tmp);
1480 emit_label (cmp_label);
1482 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1486 /* Copy all or part of a value X into registers starting at REGNO.
1487 The number of registers to be filled is NREGS. */
1490 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1493 #ifdef HAVE_load_multiple
1501 if (CONSTANT_P (x) && !targetm.legitimate_constant_p (mode, x))
1502 x = validize_mem (force_const_mem (mode, x));
1504 /* See if the machine can do this with a load multiple insn. */
1505 #ifdef HAVE_load_multiple
1506 if (HAVE_load_multiple)
1508 last = get_last_insn ();
1509 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1517 delete_insns_since (last);
1521 for (i = 0; i < nregs; i++)
1522 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1523 operand_subword_force (x, i, mode));
1526 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1527 The number of registers to be filled is NREGS. */
1530 move_block_from_reg (int regno, rtx x, int nregs)
1537 /* See if the machine can do this with a store multiple insn. */
1538 #ifdef HAVE_store_multiple
1539 if (HAVE_store_multiple)
1541 rtx last = get_last_insn ();
1542 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1550 delete_insns_since (last);
1554 for (i = 0; i < nregs; i++)
1556 rtx tem = operand_subword (x, i, 1, BLKmode);
1560 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1564 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1565 ORIG, where ORIG is a non-consecutive group of registers represented by
1566 a PARALLEL. The clone is identical to the original except in that the
1567 original set of registers is replaced by a new set of pseudo registers.
1568 The new set has the same modes as the original set. */
1571 gen_group_rtx (rtx orig)
1576 gcc_assert (GET_CODE (orig) == PARALLEL);
1578 length = XVECLEN (orig, 0);
1579 tmps = XALLOCAVEC (rtx, length);
1581 /* Skip a NULL entry in first slot. */
1582 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1587 for (; i < length; i++)
1589 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1590 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1592 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1595 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1598 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1599 except that values are placed in TMPS[i], and must later be moved
1600 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1603 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1607 enum machine_mode m = GET_MODE (orig_src);
1609 gcc_assert (GET_CODE (dst) == PARALLEL);
1612 && !SCALAR_INT_MODE_P (m)
1613 && !MEM_P (orig_src)
1614 && GET_CODE (orig_src) != CONCAT)
1616 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1617 if (imode == BLKmode)
1618 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1620 src = gen_reg_rtx (imode);
1621 if (imode != BLKmode)
1622 src = gen_lowpart (GET_MODE (orig_src), src);
1623 emit_move_insn (src, orig_src);
1624 /* ...and back again. */
1625 if (imode != BLKmode)
1626 src = gen_lowpart (imode, src);
1627 emit_group_load_1 (tmps, dst, src, type, ssize);
1631 /* Check for a NULL entry, used to indicate that the parameter goes
1632 both on the stack and in registers. */
1633 if (XEXP (XVECEXP (dst, 0, 0), 0))
1638 /* Process the pieces. */
1639 for (i = start; i < XVECLEN (dst, 0); i++)
1641 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1642 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1643 unsigned int bytelen = GET_MODE_SIZE (mode);
1646 /* Handle trailing fragments that run over the size of the struct. */
1647 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1649 /* Arrange to shift the fragment to where it belongs.
1650 extract_bit_field loads to the lsb of the reg. */
1652 #ifdef BLOCK_REG_PADDING
1653 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1654 == (BYTES_BIG_ENDIAN ? upward : downward)
1659 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1660 bytelen = ssize - bytepos;
1661 gcc_assert (bytelen > 0);
1664 /* If we won't be loading directly from memory, protect the real source
1665 from strange tricks we might play; but make sure that the source can
1666 be loaded directly into the destination. */
1668 if (!MEM_P (orig_src)
1669 && (!CONSTANT_P (orig_src)
1670 || (GET_MODE (orig_src) != mode
1671 && GET_MODE (orig_src) != VOIDmode)))
1673 if (GET_MODE (orig_src) == VOIDmode)
1674 src = gen_reg_rtx (mode);
1676 src = gen_reg_rtx (GET_MODE (orig_src));
1678 emit_move_insn (src, orig_src);
1681 /* Optimize the access just a bit. */
1683 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1684 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1685 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1686 && bytelen == GET_MODE_SIZE (mode))
1688 tmps[i] = gen_reg_rtx (mode);
1689 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1691 else if (COMPLEX_MODE_P (mode)
1692 && GET_MODE (src) == mode
1693 && bytelen == GET_MODE_SIZE (mode))
1694 /* Let emit_move_complex do the bulk of the work. */
1696 else if (GET_CODE (src) == CONCAT)
1698 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1699 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1701 if ((bytepos == 0 && bytelen == slen0)
1702 || (bytepos != 0 && bytepos + bytelen <= slen))
1704 /* The following assumes that the concatenated objects all
1705 have the same size. In this case, a simple calculation
1706 can be used to determine the object and the bit field
1708 tmps[i] = XEXP (src, bytepos / slen0);
1709 if (! CONSTANT_P (tmps[i])
1710 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1711 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1712 (bytepos % slen0) * BITS_PER_UNIT,
1713 1, false, NULL_RTX, mode, mode);
1719 gcc_assert (!bytepos);
1720 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1721 emit_move_insn (mem, src);
1722 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1723 0, 1, false, NULL_RTX, mode, mode);
1726 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1727 SIMD register, which is currently broken. While we get GCC
1728 to emit proper RTL for these cases, let's dump to memory. */
1729 else if (VECTOR_MODE_P (GET_MODE (dst))
1732 int slen = GET_MODE_SIZE (GET_MODE (src));
1735 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1736 emit_move_insn (mem, src);
1737 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1739 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1740 && XVECLEN (dst, 0) > 1)
1741 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1742 else if (CONSTANT_P (src))
1744 HOST_WIDE_INT len = (HOST_WIDE_INT) bytelen;
1752 gcc_assert (2 * len == ssize);
1753 split_double (src, &first, &second);
1760 else if (REG_P (src) && GET_MODE (src) == mode)
1763 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1764 bytepos * BITS_PER_UNIT, 1, false, NULL_RTX,
1768 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1773 /* Emit code to move a block SRC of type TYPE to a block DST,
1774 where DST is non-consecutive registers represented by a PARALLEL.
1775 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1779 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1784 tmps = XALLOCAVEC (rtx, XVECLEN (dst, 0));
1785 emit_group_load_1 (tmps, dst, src, type, ssize);
1787 /* Copy the extracted pieces into the proper (probable) hard regs. */
1788 for (i = 0; i < XVECLEN (dst, 0); i++)
1790 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1793 emit_move_insn (d, tmps[i]);
1797 /* Similar, but load SRC into new pseudos in a format that looks like
1798 PARALLEL. This can later be fed to emit_group_move to get things
1799 in the right place. */
1802 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1807 vec = rtvec_alloc (XVECLEN (parallel, 0));
1808 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1810 /* Convert the vector to look just like the original PARALLEL, except
1811 with the computed values. */
1812 for (i = 0; i < XVECLEN (parallel, 0); i++)
1814 rtx e = XVECEXP (parallel, 0, i);
1815 rtx d = XEXP (e, 0);
1819 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1820 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1822 RTVEC_ELT (vec, i) = e;
1825 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1828 /* Emit code to move a block SRC to block DST, where SRC and DST are
1829 non-consecutive groups of registers, each represented by a PARALLEL. */
1832 emit_group_move (rtx dst, rtx src)
1836 gcc_assert (GET_CODE (src) == PARALLEL
1837 && GET_CODE (dst) == PARALLEL
1838 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1840 /* Skip first entry if NULL. */
1841 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1842 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1843 XEXP (XVECEXP (src, 0, i), 0));
1846 /* Move a group of registers represented by a PARALLEL into pseudos. */
1849 emit_group_move_into_temps (rtx src)
1851 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1854 for (i = 0; i < XVECLEN (src, 0); i++)
1856 rtx e = XVECEXP (src, 0, i);
1857 rtx d = XEXP (e, 0);
1860 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1861 RTVEC_ELT (vec, i) = e;
1864 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1867 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1868 where SRC is non-consecutive registers represented by a PARALLEL.
1869 SSIZE represents the total size of block ORIG_DST, or -1 if not
1873 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1876 int start, finish, i;
1877 enum machine_mode m = GET_MODE (orig_dst);
1879 gcc_assert (GET_CODE (src) == PARALLEL);
1881 if (!SCALAR_INT_MODE_P (m)
1882 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1884 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1885 if (imode == BLKmode)
1886 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1888 dst = gen_reg_rtx (imode);
1889 emit_group_store (dst, src, type, ssize);
1890 if (imode != BLKmode)
1891 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1892 emit_move_insn (orig_dst, dst);
1896 /* Check for a NULL entry, used to indicate that the parameter goes
1897 both on the stack and in registers. */
1898 if (XEXP (XVECEXP (src, 0, 0), 0))
1902 finish = XVECLEN (src, 0);
1904 tmps = XALLOCAVEC (rtx, finish);
1906 /* Copy the (probable) hard regs into pseudos. */
1907 for (i = start; i < finish; i++)
1909 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1910 if (!REG_P (reg) || REGNO (reg) < FIRST_PSEUDO_REGISTER)
1912 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1913 emit_move_insn (tmps[i], reg);
1919 /* If we won't be storing directly into memory, protect the real destination
1920 from strange tricks we might play. */
1922 if (GET_CODE (dst) == PARALLEL)
1926 /* We can get a PARALLEL dst if there is a conditional expression in
1927 a return statement. In that case, the dst and src are the same,
1928 so no action is necessary. */
1929 if (rtx_equal_p (dst, src))
1932 /* It is unclear if we can ever reach here, but we may as well handle
1933 it. Allocate a temporary, and split this into a store/load to/from
1936 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1937 emit_group_store (temp, src, type, ssize);
1938 emit_group_load (dst, temp, type, ssize);
1941 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1943 enum machine_mode outer = GET_MODE (dst);
1944 enum machine_mode inner;
1945 HOST_WIDE_INT bytepos;
1949 if (!REG_P (dst) || REGNO (dst) < FIRST_PSEUDO_REGISTER)
1950 dst = gen_reg_rtx (outer);
1952 /* Make life a bit easier for combine. */
1953 /* If the first element of the vector is the low part
1954 of the destination mode, use a paradoxical subreg to
1955 initialize the destination. */
1958 inner = GET_MODE (tmps[start]);
1959 bytepos = subreg_lowpart_offset (inner, outer);
1960 if (INTVAL (XEXP (XVECEXP (src, 0, start), 1)) == bytepos)
1962 temp = simplify_gen_subreg (outer, tmps[start],
1966 emit_move_insn (dst, temp);
1973 /* If the first element wasn't the low part, try the last. */
1975 && start < finish - 1)
1977 inner = GET_MODE (tmps[finish - 1]);
1978 bytepos = subreg_lowpart_offset (inner, outer);
1979 if (INTVAL (XEXP (XVECEXP (src, 0, finish - 1), 1)) == bytepos)
1981 temp = simplify_gen_subreg (outer, tmps[finish - 1],
1985 emit_move_insn (dst, temp);
1992 /* Otherwise, simply initialize the result to zero. */
1994 emit_move_insn (dst, CONST0_RTX (outer));
1997 /* Process the pieces. */
1998 for (i = start; i < finish; i++)
2000 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2001 enum machine_mode mode = GET_MODE (tmps[i]);
2002 unsigned int bytelen = GET_MODE_SIZE (mode);
2003 unsigned int adj_bytelen = bytelen;
2006 /* Handle trailing fragments that run over the size of the struct. */
2007 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2008 adj_bytelen = ssize - bytepos;
2010 if (GET_CODE (dst) == CONCAT)
2012 if (bytepos + adj_bytelen
2013 <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2014 dest = XEXP (dst, 0);
2015 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2017 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2018 dest = XEXP (dst, 1);
2022 enum machine_mode dest_mode = GET_MODE (dest);
2023 enum machine_mode tmp_mode = GET_MODE (tmps[i]);
2025 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
2027 if (GET_MODE_ALIGNMENT (dest_mode)
2028 >= GET_MODE_ALIGNMENT (tmp_mode))
2030 dest = assign_stack_temp (dest_mode,
2031 GET_MODE_SIZE (dest_mode),
2033 emit_move_insn (adjust_address (dest,
2041 dest = assign_stack_temp (tmp_mode,
2042 GET_MODE_SIZE (tmp_mode),
2044 emit_move_insn (dest, tmps[i]);
2045 dst = adjust_address (dest, dest_mode, bytepos);
2051 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2053 /* store_bit_field always takes its value from the lsb.
2054 Move the fragment to the lsb if it's not already there. */
2056 #ifdef BLOCK_REG_PADDING
2057 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
2058 == (BYTES_BIG_ENDIAN ? upward : downward)
2064 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2065 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
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,
2080 0, 0, mode, tmps[i]);
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, 0, 0, copy_mode,
2175 extract_bit_field (src, bitsize,
2176 xbitpos % BITS_PER_WORD, 1, false,
2177 NULL_RTX, copy_mode, copy_mode));
2183 /* Copy BLKmode value SRC into a register of mode MODE. Return the
2184 register if it contains any data, otherwise return null.
2186 This is used on targets that return BLKmode values in registers. */
2189 copy_blkmode_to_reg (enum machine_mode mode, tree src)
2192 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0, bytes;
2193 unsigned int bitsize;
2194 rtx *dst_words, dst, x, src_word = NULL_RTX, dst_word = NULL_RTX;
2195 enum machine_mode dst_mode;
2197 gcc_assert (TYPE_MODE (TREE_TYPE (src)) == BLKmode);
2199 x = expand_normal (src);
2201 bytes = int_size_in_bytes (TREE_TYPE (src));
2205 /* If the structure doesn't take up a whole number of words, see
2206 whether the register value should be padded on the left or on
2207 the right. Set PADDING_CORRECTION to the number of padding
2208 bits needed on the left side.
2210 In most ABIs, the structure will be returned at the least end of
2211 the register, which translates to right padding on little-endian
2212 targets and left padding on big-endian targets. The opposite
2213 holds if the structure is returned at the most significant
2214 end of the register. */
2215 if (bytes % UNITS_PER_WORD != 0
2216 && (targetm.calls.return_in_msb (TREE_TYPE (src))
2218 : BYTES_BIG_ENDIAN))
2219 padding_correction = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD)
2222 n_regs = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD;
2223 dst_words = XALLOCAVEC (rtx, n_regs);
2224 bitsize = MIN (TYPE_ALIGN (TREE_TYPE (src)), BITS_PER_WORD);
2226 /* Copy the structure BITSIZE bits at a time. */
2227 for (bitpos = 0, xbitpos = padding_correction;
2228 bitpos < bytes * BITS_PER_UNIT;
2229 bitpos += bitsize, xbitpos += bitsize)
2231 /* We need a new destination pseudo each time xbitpos is
2232 on a word boundary and when xbitpos == padding_correction
2233 (the first time through). */
2234 if (xbitpos % BITS_PER_WORD == 0
2235 || xbitpos == padding_correction)
2237 /* Generate an appropriate register. */
2238 dst_word = gen_reg_rtx (word_mode);
2239 dst_words[xbitpos / BITS_PER_WORD] = dst_word;
2241 /* Clear the destination before we move anything into it. */
2242 emit_move_insn (dst_word, CONST0_RTX (word_mode));
2245 /* We need a new source operand each time bitpos is on a word
2247 if (bitpos % BITS_PER_WORD == 0)
2248 src_word = operand_subword_force (x, bitpos / BITS_PER_WORD, BLKmode);
2250 /* Use bitpos for the source extraction (left justified) and
2251 xbitpos for the destination store (right justified). */
2252 store_bit_field (dst_word, bitsize, xbitpos % BITS_PER_WORD,
2254 extract_bit_field (src_word, bitsize,
2255 bitpos % BITS_PER_WORD, 1, false,
2256 NULL_RTX, word_mode, word_mode));
2259 if (mode == BLKmode)
2261 /* Find the smallest integer mode large enough to hold the
2262 entire structure. */
2263 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2265 mode = GET_MODE_WIDER_MODE (mode))
2266 /* Have we found a large enough mode? */
2267 if (GET_MODE_SIZE (mode) >= bytes)
2270 /* A suitable mode should have been found. */
2271 gcc_assert (mode != VOIDmode);
2274 if (GET_MODE_SIZE (mode) < GET_MODE_SIZE (word_mode))
2275 dst_mode = word_mode;
2278 dst = gen_reg_rtx (dst_mode);
2280 for (i = 0; i < n_regs; i++)
2281 emit_move_insn (operand_subword (dst, i, 0, dst_mode), dst_words[i]);
2283 if (mode != dst_mode)
2284 dst = gen_lowpart (mode, dst);
2289 /* Add a USE expression for REG to the (possibly empty) list pointed
2290 to by CALL_FUSAGE. REG must denote a hard register. */
2293 use_reg_mode (rtx *call_fusage, rtx reg, enum machine_mode mode)
2295 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2298 = gen_rtx_EXPR_LIST (mode, gen_rtx_USE (VOIDmode, reg), *call_fusage);
2301 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2302 starting at REGNO. All of these registers must be hard registers. */
2305 use_regs (rtx *call_fusage, int regno, int nregs)
2309 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2311 for (i = 0; i < nregs; i++)
2312 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2315 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2316 PARALLEL REGS. This is for calls that pass values in multiple
2317 non-contiguous locations. The Irix 6 ABI has examples of this. */
2320 use_group_regs (rtx *call_fusage, rtx regs)
2324 for (i = 0; i < XVECLEN (regs, 0); i++)
2326 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2328 /* A NULL entry means the parameter goes both on the stack and in
2329 registers. This can also be a MEM for targets that pass values
2330 partially on the stack and partially in registers. */
2331 if (reg != 0 && REG_P (reg))
2332 use_reg (call_fusage, reg);
2336 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2337 assigment and the code of the expresion on the RHS is CODE. Return
2341 get_def_for_expr (tree name, enum tree_code code)
2345 if (TREE_CODE (name) != SSA_NAME)
2348 def_stmt = get_gimple_for_ssa_name (name);
2350 || gimple_assign_rhs_code (def_stmt) != code)
2357 /* Determine whether the LEN bytes generated by CONSTFUN can be
2358 stored to memory using several move instructions. CONSTFUNDATA is
2359 a pointer which will be passed as argument in every CONSTFUN call.
2360 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2361 a memset operation and false if it's a copy of a constant string.
2362 Return nonzero if a call to store_by_pieces should succeed. */
2365 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2366 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2367 void *constfundata, unsigned int align, bool memsetp)
2369 unsigned HOST_WIDE_INT l;
2370 unsigned int max_size;
2371 HOST_WIDE_INT offset = 0;
2372 enum machine_mode mode;
2373 enum insn_code icode;
2375 /* cst is set but not used if LEGITIMATE_CONSTANT doesn't use it. */
2376 rtx cst ATTRIBUTE_UNUSED;
2382 ? SET_BY_PIECES_P (len, align)
2383 : STORE_BY_PIECES_P (len, align)))
2386 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2388 /* We would first store what we can in the largest integer mode, then go to
2389 successively smaller modes. */
2392 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2396 max_size = STORE_MAX_PIECES + 1;
2397 while (max_size > 1)
2399 mode = widest_int_mode_for_size (max_size);
2401 if (mode == VOIDmode)
2404 icode = optab_handler (mov_optab, mode);
2405 if (icode != CODE_FOR_nothing
2406 && align >= GET_MODE_ALIGNMENT (mode))
2408 unsigned int size = GET_MODE_SIZE (mode);
2415 cst = (*constfun) (constfundata, offset, mode);
2416 if (!targetm.legitimate_constant_p (mode, cst))
2426 max_size = GET_MODE_SIZE (mode);
2429 /* The code above should have handled everything. */
2436 /* Generate several move instructions to store LEN bytes generated by
2437 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2438 pointer which will be passed as argument in every CONSTFUN call.
2439 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2440 a memset operation and false if it's a copy of a constant string.
2441 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2442 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2446 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2447 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2448 void *constfundata, unsigned int align, bool memsetp, int endp)
2450 enum machine_mode to_addr_mode
2451 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
2452 struct store_by_pieces_d data;
2456 gcc_assert (endp != 2);
2461 ? SET_BY_PIECES_P (len, align)
2462 : STORE_BY_PIECES_P (len, align));
2463 data.constfun = constfun;
2464 data.constfundata = constfundata;
2467 store_by_pieces_1 (&data, align);
2472 gcc_assert (!data.reverse);
2477 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2478 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2480 data.to_addr = copy_to_mode_reg (to_addr_mode,
2481 plus_constant (data.to_addr,
2484 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2491 to1 = adjust_address (data.to, QImode, data.offset);
2499 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2500 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2503 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2505 struct store_by_pieces_d data;
2510 data.constfun = clear_by_pieces_1;
2511 data.constfundata = NULL;
2514 store_by_pieces_1 (&data, align);
2517 /* Callback routine for clear_by_pieces.
2518 Return const0_rtx unconditionally. */
2521 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2522 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2523 enum machine_mode mode ATTRIBUTE_UNUSED)
2528 /* Subroutine of clear_by_pieces and store_by_pieces.
2529 Generate several move instructions to store LEN bytes of block TO. (A MEM
2530 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2533 store_by_pieces_1 (struct store_by_pieces_d *data ATTRIBUTE_UNUSED,
2534 unsigned int align ATTRIBUTE_UNUSED)
2536 enum machine_mode to_addr_mode
2537 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (data->to));
2538 rtx to_addr = XEXP (data->to, 0);
2539 unsigned int max_size = STORE_MAX_PIECES + 1;
2540 enum insn_code icode;
2543 data->to_addr = to_addr;
2545 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2546 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2548 data->explicit_inc_to = 0;
2550 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2552 data->offset = data->len;
2554 /* If storing requires more than two move insns,
2555 copy addresses to registers (to make displacements shorter)
2556 and use post-increment if available. */
2557 if (!data->autinc_to
2558 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2560 /* Determine the main mode we'll be using.
2561 MODE might not be used depending on the definitions of the
2562 USE_* macros below. */
2563 enum machine_mode mode ATTRIBUTE_UNUSED
2564 = widest_int_mode_for_size (max_size);
2566 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2568 data->to_addr = copy_to_mode_reg (to_addr_mode,
2569 plus_constant (to_addr, data->len));
2570 data->autinc_to = 1;
2571 data->explicit_inc_to = -1;
2574 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2575 && ! data->autinc_to)
2577 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2578 data->autinc_to = 1;
2579 data->explicit_inc_to = 1;
2582 if ( !data->autinc_to && CONSTANT_P (to_addr))
2583 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2586 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2588 /* First store what we can in the largest integer mode, then go to
2589 successively smaller modes. */
2591 while (max_size > 1)
2593 enum machine_mode mode = widest_int_mode_for_size (max_size);
2595 if (mode == VOIDmode)
2598 icode = optab_handler (mov_optab, mode);
2599 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2600 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2602 max_size = GET_MODE_SIZE (mode);
2605 /* The code above should have handled everything. */
2606 gcc_assert (!data->len);
2609 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2610 with move instructions for mode MODE. GENFUN is the gen_... function
2611 to make a move insn for that mode. DATA has all the other info. */
2614 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2615 struct store_by_pieces_d *data)
2617 unsigned int size = GET_MODE_SIZE (mode);
2620 while (data->len >= size)
2623 data->offset -= size;
2625 if (data->autinc_to)
2626 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2629 to1 = adjust_address (data->to, mode, data->offset);
2631 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2632 emit_insn (gen_add2_insn (data->to_addr,
2633 GEN_INT (-(HOST_WIDE_INT) size)));
2635 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2636 emit_insn ((*genfun) (to1, cst));
2638 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2639 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2641 if (! data->reverse)
2642 data->offset += size;
2648 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2649 its length in bytes. */
2652 clear_storage_hints (rtx object, rtx size, enum block_op_methods method,
2653 unsigned int expected_align, HOST_WIDE_INT expected_size)
2655 enum machine_mode mode = GET_MODE (object);
2658 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2660 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2661 just move a zero. Otherwise, do this a piece at a time. */
2663 && CONST_INT_P (size)
2664 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2666 rtx zero = CONST0_RTX (mode);
2669 emit_move_insn (object, zero);
2673 if (COMPLEX_MODE_P (mode))
2675 zero = CONST0_RTX (GET_MODE_INNER (mode));
2678 write_complex_part (object, zero, 0);
2679 write_complex_part (object, zero, 1);
2685 if (size == const0_rtx)
2688 align = MEM_ALIGN (object);
2690 if (CONST_INT_P (size)
2691 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2692 clear_by_pieces (object, INTVAL (size), align);
2693 else if (set_storage_via_setmem (object, size, const0_rtx, align,
2694 expected_align, expected_size))
2696 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object)))
2697 return set_storage_via_libcall (object, size, const0_rtx,
2698 method == BLOCK_OP_TAILCALL);
2706 clear_storage (rtx object, rtx size, enum block_op_methods method)
2708 return clear_storage_hints (object, size, method, 0, -1);
2712 /* A subroutine of clear_storage. Expand a call to memset.
2713 Return the return value of memset, 0 otherwise. */
2716 set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
2718 tree call_expr, fn, object_tree, size_tree, val_tree;
2719 enum machine_mode size_mode;
2722 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2723 place those into new pseudos into a VAR_DECL and use them later. */
2725 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2727 size_mode = TYPE_MODE (sizetype);
2728 size = convert_to_mode (size_mode, size, 1);
2729 size = copy_to_mode_reg (size_mode, size);
2731 /* It is incorrect to use the libcall calling conventions to call
2732 memset in this context. This could be a user call to memset and
2733 the user may wish to examine the return value from memset. For
2734 targets where libcalls and normal calls have different conventions
2735 for returning pointers, we could end up generating incorrect code. */
2737 object_tree = make_tree (ptr_type_node, object);
2738 if (!CONST_INT_P (val))
2739 val = convert_to_mode (TYPE_MODE (integer_type_node), val, 1);
2740 size_tree = make_tree (sizetype, size);
2741 val_tree = make_tree (integer_type_node, val);
2743 fn = clear_storage_libcall_fn (true);
2744 call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
2745 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2747 retval = expand_normal (call_expr);
2752 /* A subroutine of set_storage_via_libcall. Create the tree node
2753 for the function we use for block clears. The first time FOR_CALL
2754 is true, we call assemble_external. */
2756 tree block_clear_fn;
2759 init_block_clear_fn (const char *asmspec)
2761 if (!block_clear_fn)
2765 fn = get_identifier ("memset");
2766 args = build_function_type_list (ptr_type_node, ptr_type_node,
2767 integer_type_node, sizetype,
2770 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
2771 DECL_EXTERNAL (fn) = 1;
2772 TREE_PUBLIC (fn) = 1;
2773 DECL_ARTIFICIAL (fn) = 1;
2774 TREE_NOTHROW (fn) = 1;
2775 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
2776 DECL_VISIBILITY_SPECIFIED (fn) = 1;
2778 block_clear_fn = fn;
2782 set_user_assembler_name (block_clear_fn, asmspec);
2786 clear_storage_libcall_fn (int for_call)
2788 static bool emitted_extern;
2790 if (!block_clear_fn)
2791 init_block_clear_fn (NULL);
2793 if (for_call && !emitted_extern)
2795 emitted_extern = true;
2796 make_decl_rtl (block_clear_fn);
2797 assemble_external (block_clear_fn);
2800 return block_clear_fn;
2803 /* Expand a setmem pattern; return true if successful. */
2806 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align,
2807 unsigned int expected_align, HOST_WIDE_INT expected_size)
2809 /* Try the most limited insn first, because there's no point
2810 including more than one in the machine description unless
2811 the more limited one has some advantage. */
2813 enum machine_mode mode;
2815 if (expected_align < align)
2816 expected_align = align;
2818 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2819 mode = GET_MODE_WIDER_MODE (mode))
2821 enum insn_code code = direct_optab_handler (setmem_optab, mode);
2823 if (code != CODE_FOR_nothing
2824 /* We don't need MODE to be narrower than
2825 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2826 the mode mask, as it is returned by the macro, it will
2827 definitely be less than the actual mode mask. */
2828 && ((CONST_INT_P (size)
2829 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2830 <= (GET_MODE_MASK (mode) >> 1)))
2831 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD))
2833 struct expand_operand ops[6];
2836 nops = insn_data[(int) code].n_generator_args;
2837 gcc_assert (nops == 4 || nops == 6);
2839 create_fixed_operand (&ops[0], object);
2840 /* The check above guarantees that this size conversion is valid. */
2841 create_convert_operand_to (&ops[1], size, mode, true);
2842 create_convert_operand_from (&ops[2], val, byte_mode, true);
2843 create_integer_operand (&ops[3], align / BITS_PER_UNIT);
2846 create_integer_operand (&ops[4], expected_align / BITS_PER_UNIT);
2847 create_integer_operand (&ops[5], expected_size);
2849 if (maybe_expand_insn (code, nops, ops))
2858 /* Write to one of the components of the complex value CPLX. Write VAL to
2859 the real part if IMAG_P is false, and the imaginary part if its true. */
2862 write_complex_part (rtx cplx, rtx val, bool imag_p)
2864 enum machine_mode cmode;
2865 enum machine_mode imode;
2868 if (GET_CODE (cplx) == CONCAT)
2870 emit_move_insn (XEXP (cplx, imag_p), val);
2874 cmode = GET_MODE (cplx);
2875 imode = GET_MODE_INNER (cmode);
2876 ibitsize = GET_MODE_BITSIZE (imode);
2878 /* For MEMs simplify_gen_subreg may generate an invalid new address
2879 because, e.g., the original address is considered mode-dependent
2880 by the target, which restricts simplify_subreg from invoking
2881 adjust_address_nv. Instead of preparing fallback support for an
2882 invalid address, we call adjust_address_nv directly. */
2885 emit_move_insn (adjust_address_nv (cplx, imode,
2886 imag_p ? GET_MODE_SIZE (imode) : 0),
2891 /* If the sub-object is at least word sized, then we know that subregging
2892 will work. This special case is important, since store_bit_field
2893 wants to operate on integer modes, and there's rarely an OImode to
2894 correspond to TCmode. */
2895 if (ibitsize >= BITS_PER_WORD
2896 /* For hard regs we have exact predicates. Assume we can split
2897 the original object if it spans an even number of hard regs.
2898 This special case is important for SCmode on 64-bit platforms
2899 where the natural size of floating-point regs is 32-bit. */
2901 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2902 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2904 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2905 imag_p ? GET_MODE_SIZE (imode) : 0);
2908 emit_move_insn (part, val);
2912 /* simplify_gen_subreg may fail for sub-word MEMs. */
2913 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2916 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, 0, 0, imode, val);
2919 /* Extract one of the components of the complex value CPLX. Extract the
2920 real part if IMAG_P is false, and the imaginary part if it's true. */
2923 read_complex_part (rtx cplx, bool imag_p)
2925 enum machine_mode cmode, imode;
2928 if (GET_CODE (cplx) == CONCAT)
2929 return XEXP (cplx, imag_p);
2931 cmode = GET_MODE (cplx);
2932 imode = GET_MODE_INNER (cmode);
2933 ibitsize = GET_MODE_BITSIZE (imode);
2935 /* Special case reads from complex constants that got spilled to memory. */
2936 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2938 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2939 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2941 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2942 if (CONSTANT_CLASS_P (part))
2943 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2947 /* For MEMs simplify_gen_subreg may generate an invalid new address
2948 because, e.g., the original address is considered mode-dependent
2949 by the target, which restricts simplify_subreg from invoking
2950 adjust_address_nv. Instead of preparing fallback support for an
2951 invalid address, we call adjust_address_nv directly. */
2953 return adjust_address_nv (cplx, imode,
2954 imag_p ? GET_MODE_SIZE (imode) : 0);
2956 /* If the sub-object is at least word sized, then we know that subregging
2957 will work. This special case is important, since extract_bit_field
2958 wants to operate on integer modes, and there's rarely an OImode to
2959 correspond to TCmode. */
2960 if (ibitsize >= BITS_PER_WORD
2961 /* For hard regs we have exact predicates. Assume we can split
2962 the original object if it spans an even number of hard regs.
2963 This special case is important for SCmode on 64-bit platforms
2964 where the natural size of floating-point regs is 32-bit. */
2966 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2967 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2969 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2970 imag_p ? GET_MODE_SIZE (imode) : 0);
2974 /* simplify_gen_subreg may fail for sub-word MEMs. */
2975 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2978 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2979 true, false, NULL_RTX, imode, imode);
2982 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2983 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2984 represented in NEW_MODE. If FORCE is true, this will never happen, as
2985 we'll force-create a SUBREG if needed. */
2988 emit_move_change_mode (enum machine_mode new_mode,
2989 enum machine_mode old_mode, rtx x, bool force)
2993 if (push_operand (x, GET_MODE (x)))
2995 ret = gen_rtx_MEM (new_mode, XEXP (x, 0));
2996 MEM_COPY_ATTRIBUTES (ret, x);
3000 /* We don't have to worry about changing the address since the
3001 size in bytes is supposed to be the same. */
3002 if (reload_in_progress)
3004 /* Copy the MEM to change the mode and move any
3005 substitutions from the old MEM to the new one. */
3006 ret = adjust_address_nv (x, new_mode, 0);
3007 copy_replacements (x, ret);
3010 ret = adjust_address (x, new_mode, 0);
3014 /* Note that we do want simplify_subreg's behavior of validating
3015 that the new mode is ok for a hard register. If we were to use
3016 simplify_gen_subreg, we would create the subreg, but would
3017 probably run into the target not being able to implement it. */
3018 /* Except, of course, when FORCE is true, when this is exactly what
3019 we want. Which is needed for CCmodes on some targets. */
3021 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
3023 ret = simplify_subreg (new_mode, x, old_mode, 0);
3029 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
3030 an integer mode of the same size as MODE. Returns the instruction
3031 emitted, or NULL if such a move could not be generated. */
3034 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y, bool force)
3036 enum machine_mode imode;
3037 enum insn_code code;
3039 /* There must exist a mode of the exact size we require. */
3040 imode = int_mode_for_mode (mode);
3041 if (imode == BLKmode)
3044 /* The target must support moves in this mode. */
3045 code = optab_handler (mov_optab, imode);
3046 if (code == CODE_FOR_nothing)
3049 x = emit_move_change_mode (imode, mode, x, force);
3052 y = emit_move_change_mode (imode, mode, y, force);
3055 return emit_insn (GEN_FCN (code) (x, y));
3058 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
3059 Return an equivalent MEM that does not use an auto-increment. */
3062 emit_move_resolve_push (enum machine_mode mode, rtx x)
3064 enum rtx_code code = GET_CODE (XEXP (x, 0));
3065 HOST_WIDE_INT adjust;
3068 adjust = GET_MODE_SIZE (mode);
3069 #ifdef PUSH_ROUNDING
3070 adjust = PUSH_ROUNDING (adjust);
3072 if (code == PRE_DEC || code == POST_DEC)
3074 else if (code == PRE_MODIFY || code == POST_MODIFY)
3076 rtx expr = XEXP (XEXP (x, 0), 1);
3079 gcc_assert (GET_CODE (expr) == PLUS || GET_CODE (expr) == MINUS);
3080 gcc_assert (CONST_INT_P (XEXP (expr, 1)));
3081 val = INTVAL (XEXP (expr, 1));
3082 if (GET_CODE (expr) == MINUS)
3084 gcc_assert (adjust == val || adjust == -val);
3088 /* Do not use anti_adjust_stack, since we don't want to update
3089 stack_pointer_delta. */
3090 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
3091 GEN_INT (adjust), stack_pointer_rtx,
3092 0, OPTAB_LIB_WIDEN);
3093 if (temp != stack_pointer_rtx)
3094 emit_move_insn (stack_pointer_rtx, temp);
3101 temp = stack_pointer_rtx;
3106 temp = plus_constant (stack_pointer_rtx, -adjust);
3112 return replace_equiv_address (x, temp);
3115 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3116 X is known to satisfy push_operand, and MODE is known to be complex.
3117 Returns the last instruction emitted. */
3120 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
3122 enum machine_mode submode = GET_MODE_INNER (mode);
3125 #ifdef PUSH_ROUNDING
3126 unsigned int submodesize = GET_MODE_SIZE (submode);
3128 /* In case we output to the stack, but the size is smaller than the
3129 machine can push exactly, we need to use move instructions. */
3130 if (PUSH_ROUNDING (submodesize) != submodesize)
3132 x = emit_move_resolve_push (mode, x);
3133 return emit_move_insn (x, y);
3137 /* Note that the real part always precedes the imag part in memory
3138 regardless of machine's endianness. */
3139 switch (GET_CODE (XEXP (x, 0)))
3153 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3154 read_complex_part (y, imag_first));
3155 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3156 read_complex_part (y, !imag_first));
3159 /* A subroutine of emit_move_complex. Perform the move from Y to X
3160 via two moves of the parts. Returns the last instruction emitted. */
3163 emit_move_complex_parts (rtx x, rtx y)
3165 /* Show the output dies here. This is necessary for SUBREGs
3166 of pseudos since we cannot track their lifetimes correctly;
3167 hard regs shouldn't appear here except as return values. */
3168 if (!reload_completed && !reload_in_progress
3169 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
3172 write_complex_part (x, read_complex_part (y, false), false);
3173 write_complex_part (x, read_complex_part (y, true), true);
3175 return get_last_insn ();
3178 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3179 MODE is known to be complex. Returns the last instruction emitted. */
3182 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
3186 /* Need to take special care for pushes, to maintain proper ordering
3187 of the data, and possibly extra padding. */
3188 if (push_operand (x, mode))
3189 return emit_move_complex_push (mode, x, y);
3191 /* See if we can coerce the target into moving both values at once. */
3193 /* Move floating point as parts. */
3194 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
3195 && optab_handler (mov_optab, GET_MODE_INNER (mode)) != CODE_FOR_nothing)
3197 /* Not possible if the values are inherently not adjacent. */
3198 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
3200 /* Is possible if both are registers (or subregs of registers). */
3201 else if (register_operand (x, mode) && register_operand (y, mode))
3203 /* If one of the operands is a memory, and alignment constraints
3204 are friendly enough, we may be able to do combined memory operations.
3205 We do not attempt this if Y is a constant because that combination is
3206 usually better with the by-parts thing below. */
3207 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
3208 && (!STRICT_ALIGNMENT
3209 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
3218 /* For memory to memory moves, optimal behavior can be had with the
3219 existing block move logic. */
3220 if (MEM_P (x) && MEM_P (y))
3222 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
3223 BLOCK_OP_NO_LIBCALL);
3224 return get_last_insn ();
3227 ret = emit_move_via_integer (mode, x, y, true);
3232 return emit_move_complex_parts (x, y);
3235 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3236 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3239 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
3243 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3246 enum insn_code code = optab_handler (mov_optab, CCmode);
3247 if (code != CODE_FOR_nothing)
3249 x = emit_move_change_mode (CCmode, mode, x, true);
3250 y = emit_move_change_mode (CCmode, mode, y, true);
3251 return emit_insn (GEN_FCN (code) (x, y));
3255 /* Otherwise, find the MODE_INT mode of the same width. */
3256 ret = emit_move_via_integer (mode, x, y, false);
3257 gcc_assert (ret != NULL);
3261 /* Return true if word I of OP lies entirely in the
3262 undefined bits of a paradoxical subreg. */
3265 undefined_operand_subword_p (const_rtx op, int i)
3267 enum machine_mode innermode, innermostmode;
3269 if (GET_CODE (op) != SUBREG)
3271 innermode = GET_MODE (op);
3272 innermostmode = GET_MODE (SUBREG_REG (op));
3273 offset = i * UNITS_PER_WORD + SUBREG_BYTE (op);
3274 /* The SUBREG_BYTE represents offset, as if the value were stored in
3275 memory, except for a paradoxical subreg where we define
3276 SUBREG_BYTE to be 0; undo this exception as in
3278 if (SUBREG_BYTE (op) == 0
3279 && GET_MODE_SIZE (innermostmode) < GET_MODE_SIZE (innermode))
3281 int difference = (GET_MODE_SIZE (innermostmode) - GET_MODE_SIZE (innermode));
3282 if (WORDS_BIG_ENDIAN)
3283 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
3284 if (BYTES_BIG_ENDIAN)
3285 offset += difference % UNITS_PER_WORD;
3287 if (offset >= GET_MODE_SIZE (innermostmode)
3288 || offset <= -GET_MODE_SIZE (word_mode))
3293 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3294 MODE is any multi-word or full-word mode that lacks a move_insn
3295 pattern. Note that you will get better code if you define such
3296 patterns, even if they must turn into multiple assembler instructions. */
3299 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3306 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3308 /* If X is a push on the stack, do the push now and replace
3309 X with a reference to the stack pointer. */
3310 if (push_operand (x, mode))
3311 x = emit_move_resolve_push (mode, x);
3313 /* If we are in reload, see if either operand is a MEM whose address
3314 is scheduled for replacement. */
3315 if (reload_in_progress && MEM_P (x)
3316 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3317 x = replace_equiv_address_nv (x, inner);
3318 if (reload_in_progress && MEM_P (y)
3319 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3320 y = replace_equiv_address_nv (y, inner);
3324 need_clobber = false;
3326 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3329 rtx xpart = operand_subword (x, i, 1, mode);
3332 /* Do not generate code for a move if it would come entirely
3333 from the undefined bits of a paradoxical subreg. */
3334 if (undefined_operand_subword_p (y, i))
3337 ypart = operand_subword (y, i, 1, mode);
3339 /* If we can't get a part of Y, put Y into memory if it is a
3340 constant. Otherwise, force it into a register. Then we must
3341 be able to get a part of Y. */
3342 if (ypart == 0 && CONSTANT_P (y))
3344 y = use_anchored_address (force_const_mem (mode, y));
3345 ypart = operand_subword (y, i, 1, mode);
3347 else if (ypart == 0)
3348 ypart = operand_subword_force (y, i, mode);
3350 gcc_assert (xpart && ypart);
3352 need_clobber |= (GET_CODE (xpart) == SUBREG);
3354 last_insn = emit_move_insn (xpart, ypart);
3360 /* Show the output dies here. This is necessary for SUBREGs
3361 of pseudos since we cannot track their lifetimes correctly;
3362 hard regs shouldn't appear here except as return values.
3363 We never want to emit such a clobber after reload. */
3365 && ! (reload_in_progress || reload_completed)
3366 && need_clobber != 0)
3374 /* Low level part of emit_move_insn.
3375 Called just like emit_move_insn, but assumes X and Y
3376 are basically valid. */
3379 emit_move_insn_1 (rtx x, rtx y)
3381 enum machine_mode mode = GET_MODE (x);
3382 enum insn_code code;
3384 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3386 code = optab_handler (mov_optab, mode);
3387 if (code != CODE_FOR_nothing)
3388 return emit_insn (GEN_FCN (code) (x, y));
3390 /* Expand complex moves by moving real part and imag part. */
3391 if (COMPLEX_MODE_P (mode))
3392 return emit_move_complex (mode, x, y);
3394 if (GET_MODE_CLASS (mode) == MODE_DECIMAL_FLOAT
3395 || ALL_FIXED_POINT_MODE_P (mode))
3397 rtx result = emit_move_via_integer (mode, x, y, true);
3399 /* If we can't find an integer mode, use multi words. */
3403 return emit_move_multi_word (mode, x, y);
3406 if (GET_MODE_CLASS (mode) == MODE_CC)
3407 return emit_move_ccmode (mode, x, y);
3409 /* Try using a move pattern for the corresponding integer mode. This is
3410 only safe when simplify_subreg can convert MODE constants into integer
3411 constants. At present, it can only do this reliably if the value
3412 fits within a HOST_WIDE_INT. */
3413 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3415 rtx ret = emit_move_via_integer (mode, x, y, false);
3420 return emit_move_multi_word (mode, x, y);
3423 /* Generate code to copy Y into X.
3424 Both Y and X must have the same mode, except that
3425 Y can be a constant with VOIDmode.
3426 This mode cannot be BLKmode; use emit_block_move for that.
3428 Return the last instruction emitted. */
3431 emit_move_insn (rtx x, rtx y)
3433 enum machine_mode mode = GET_MODE (x);
3434 rtx y_cst = NULL_RTX;
3437 gcc_assert (mode != BLKmode
3438 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3443 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3444 && (last_insn = compress_float_constant (x, y)))
3449 if (!targetm.legitimate_constant_p (mode, y))
3451 y = force_const_mem (mode, y);
3453 /* If the target's cannot_force_const_mem prevented the spill,
3454 assume that the target's move expanders will also take care
3455 of the non-legitimate constant. */
3459 y = use_anchored_address (y);
3463 /* If X or Y are memory references, verify that their addresses are valid
3466 && (! memory_address_addr_space_p (GET_MODE (x), XEXP (x, 0),
3468 && ! push_operand (x, GET_MODE (x))))
3469 x = validize_mem (x);
3472 && ! memory_address_addr_space_p (GET_MODE (y), XEXP (y, 0),
3473 MEM_ADDR_SPACE (y)))
3474 y = validize_mem (y);
3476 gcc_assert (mode != BLKmode);
3478 last_insn = emit_move_insn_1 (x, y);
3480 if (y_cst && REG_P (x)
3481 && (set = single_set (last_insn)) != NULL_RTX
3482 && SET_DEST (set) == x
3483 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3484 set_unique_reg_note (last_insn, REG_EQUAL, copy_rtx (y_cst));
3489 /* If Y is representable exactly in a narrower mode, and the target can
3490 perform the extension directly from constant or memory, then emit the
3491 move as an extension. */
3494 compress_float_constant (rtx x, rtx y)
3496 enum machine_mode dstmode = GET_MODE (x);
3497 enum machine_mode orig_srcmode = GET_MODE (y);
3498 enum machine_mode srcmode;
3500 int oldcost, newcost;
3501 bool speed = optimize_insn_for_speed_p ();
3503 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3505 if (targetm.legitimate_constant_p (dstmode, y))
3506 oldcost = set_src_cost (y, speed);
3508 oldcost = set_src_cost (force_const_mem (dstmode, y), speed);
3510 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3511 srcmode != orig_srcmode;
3512 srcmode = GET_MODE_WIDER_MODE (srcmode))
3515 rtx trunc_y, last_insn;
3517 /* Skip if the target can't extend this way. */
3518 ic = can_extend_p (dstmode, srcmode, 0);
3519 if (ic == CODE_FOR_nothing)
3522 /* Skip if the narrowed value isn't exact. */
3523 if (! exact_real_truncate (srcmode, &r))
3526 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3528 if (targetm.legitimate_constant_p (srcmode, trunc_y))
3530 /* Skip if the target needs extra instructions to perform
3532 if (!insn_operand_matches (ic, 1, trunc_y))
3534 /* This is valid, but may not be cheaper than the original. */
3535 newcost = set_src_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y),
3537 if (oldcost < newcost)
3540 else if (float_extend_from_mem[dstmode][srcmode])
3542 trunc_y = force_const_mem (srcmode, trunc_y);
3543 /* This is valid, but may not be cheaper than the original. */
3544 newcost = set_src_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y),
3546 if (oldcost < newcost)
3548 trunc_y = validize_mem (trunc_y);
3553 /* For CSE's benefit, force the compressed constant pool entry
3554 into a new pseudo. This constant may be used in different modes,
3555 and if not, combine will put things back together for us. */
3556 trunc_y = force_reg (srcmode, trunc_y);
3557 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3558 last_insn = get_last_insn ();
3561 set_unique_reg_note (last_insn, REG_EQUAL, y);
3569 /* Pushing data onto the stack. */
3571 /* Push a block of length SIZE (perhaps variable)
3572 and return an rtx to address the beginning of the block.
3573 The value may be virtual_outgoing_args_rtx.
3575 EXTRA is the number of bytes of padding to push in addition to SIZE.
3576 BELOW nonzero means this padding comes at low addresses;
3577 otherwise, the padding comes at high addresses. */
3580 push_block (rtx size, int extra, int below)
3584 size = convert_modes (Pmode, ptr_mode, size, 1);
3585 if (CONSTANT_P (size))
3586 anti_adjust_stack (plus_constant (size, extra));
3587 else if (REG_P (size) && extra == 0)
3588 anti_adjust_stack (size);
3591 temp = copy_to_mode_reg (Pmode, size);
3593 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3594 temp, 0, OPTAB_LIB_WIDEN);
3595 anti_adjust_stack (temp);
3598 #ifndef STACK_GROWS_DOWNWARD
3604 temp = virtual_outgoing_args_rtx;
3605 if (extra != 0 && below)
3606 temp = plus_constant (temp, extra);
3610 if (CONST_INT_P (size))
3611 temp = plus_constant (virtual_outgoing_args_rtx,
3612 -INTVAL (size) - (below ? 0 : extra));
3613 else if (extra != 0 && !below)
3614 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3615 negate_rtx (Pmode, plus_constant (size, extra)));
3617 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3618 negate_rtx (Pmode, size));
3621 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3624 /* A utility routine that returns the base of an auto-inc memory, or NULL. */
3627 mem_autoinc_base (rtx mem)
3631 rtx addr = XEXP (mem, 0);
3632 if (GET_RTX_CLASS (GET_CODE (addr)) == RTX_AUTOINC)
3633 return XEXP (addr, 0);
3638 /* A utility routine used here, in reload, and in try_split. The insns
3639 after PREV up to and including LAST are known to adjust the stack,
3640 with a final value of END_ARGS_SIZE. Iterate backward from LAST
3641 placing notes as appropriate. PREV may be NULL, indicating the
3642 entire insn sequence prior to LAST should be scanned.
3644 The set of allowed stack pointer modifications is small:
3645 (1) One or more auto-inc style memory references (aka pushes),
3646 (2) One or more addition/subtraction with the SP as destination,
3647 (3) A single move insn with the SP as destination,
3648 (4) A call_pop insn.
3650 Insns in the sequence that do not modify the SP are ignored.
3652 The return value is the amount of adjustment that can be trivially
3653 verified, via immediate operand or auto-inc. If the adjustment
3654 cannot be trivially extracted, the return value is INT_MIN. */
3657 find_args_size_adjust (rtx insn)
3662 pat = PATTERN (insn);
3665 /* Look for a call_pop pattern. */
3668 /* We have to allow non-call_pop patterns for the case
3669 of emit_single_push_insn of a TLS address. */
3670 if (GET_CODE (pat) != PARALLEL)
3673 /* All call_pop have a stack pointer adjust in the parallel.
3674 The call itself is always first, and the stack adjust is
3675 usually last, so search from the end. */
3676 for (i = XVECLEN (pat, 0) - 1; i > 0; --i)
3678 set = XVECEXP (pat, 0, i);
3679 if (GET_CODE (set) != SET)
3681 dest = SET_DEST (set);
3682 if (dest == stack_pointer_rtx)
3685 /* We'd better have found the stack pointer adjust. */
3688 /* Fall through to process the extracted SET and DEST
3689 as if it was a standalone insn. */
3691 else if (GET_CODE (pat) == SET)
3693 else if ((set = single_set (insn)) != NULL)
3695 else if (GET_CODE (pat) == PARALLEL)
3697 /* ??? Some older ports use a parallel with a stack adjust
3698 and a store for a PUSH_ROUNDING pattern, rather than a
3699 PRE/POST_MODIFY rtx. Don't force them to update yet... */
3700 /* ??? See h8300 and m68k, pushqi1. */
3701 for (i = XVECLEN (pat, 0) - 1; i >= 0; --i)
3703 set = XVECEXP (pat, 0, i);
3704 if (GET_CODE (set) != SET)
3706 dest = SET_DEST (set);
3707 if (dest == stack_pointer_rtx)
3710 /* We do not expect an auto-inc of the sp in the parallel. */
3711 gcc_checking_assert (mem_autoinc_base (dest) != stack_pointer_rtx);
3712 gcc_checking_assert (mem_autoinc_base (SET_SRC (set))
3713 != stack_pointer_rtx);
3721 dest = SET_DEST (set);
3723 /* Look for direct modifications of the stack pointer. */
3724 if (REG_P (dest) && REGNO (dest) == STACK_POINTER_REGNUM)
3726 /* Look for a trivial adjustment, otherwise assume nothing. */
3727 /* Note that the SPU restore_stack_block pattern refers to
3728 the stack pointer in V4SImode. Consider that non-trivial. */
3729 if (SCALAR_INT_MODE_P (GET_MODE (dest))
3730 && GET_CODE (SET_SRC (set)) == PLUS
3731 && XEXP (SET_SRC (set), 0) == stack_pointer_rtx
3732 && CONST_INT_P (XEXP (SET_SRC (set), 1)))
3733 return INTVAL (XEXP (SET_SRC (set), 1));
3734 /* ??? Reload can generate no-op moves, which will be cleaned
3735 up later. Recognize it and continue searching. */
3736 else if (rtx_equal_p (dest, SET_SRC (set)))
3739 return HOST_WIDE_INT_MIN;
3745 /* Otherwise only think about autoinc patterns. */
3746 if (mem_autoinc_base (dest) == stack_pointer_rtx)
3749 gcc_checking_assert (mem_autoinc_base (SET_SRC (set))
3750 != stack_pointer_rtx);
3752 else if (mem_autoinc_base (SET_SRC (set)) == stack_pointer_rtx)
3753 mem = SET_SRC (set);
3757 addr = XEXP (mem, 0);
3758 switch (GET_CODE (addr))
3762 return GET_MODE_SIZE (GET_MODE (mem));
3765 return -GET_MODE_SIZE (GET_MODE (mem));
3768 addr = XEXP (addr, 1);
3769 gcc_assert (GET_CODE (addr) == PLUS);
3770 gcc_assert (XEXP (addr, 0) == stack_pointer_rtx);
3771 gcc_assert (CONST_INT_P (XEXP (addr, 1)));
3772 return INTVAL (XEXP (addr, 1));
3780 fixup_args_size_notes (rtx prev, rtx last, int end_args_size)
3782 int args_size = end_args_size;
3783 bool saw_unknown = false;
3786 for (insn = last; insn != prev; insn = PREV_INSN (insn))
3788 HOST_WIDE_INT this_delta;
3790 if (!NONDEBUG_INSN_P (insn))
3793 this_delta = find_args_size_adjust (insn);
3794 if (this_delta == 0)
3797 gcc_assert (!saw_unknown);
3798 if (this_delta == HOST_WIDE_INT_MIN)
3801 add_reg_note (insn, REG_ARGS_SIZE, GEN_INT (args_size));
3802 #ifdef STACK_GROWS_DOWNWARD
3803 this_delta = -this_delta;
3805 args_size -= this_delta;
3808 return saw_unknown ? INT_MIN : args_size;
3811 #ifdef PUSH_ROUNDING
3812 /* Emit single push insn. */
3815 emit_single_push_insn_1 (enum machine_mode mode, rtx x, tree type)
3818 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3820 enum insn_code icode;
3822 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3823 /* If there is push pattern, use it. Otherwise try old way of throwing
3824 MEM representing push operation to move expander. */
3825 icode = optab_handler (push_optab, mode);
3826 if (icode != CODE_FOR_nothing)
3828 struct expand_operand ops[1];
3830 create_input_operand (&ops[0], x, mode);
3831 if (maybe_expand_insn (icode, 1, ops))
3834 if (GET_MODE_SIZE (mode) == rounded_size)
3835 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3836 /* If we are to pad downward, adjust the stack pointer first and
3837 then store X into the stack location using an offset. This is
3838 because emit_move_insn does not know how to pad; it does not have
3840 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3842 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3843 HOST_WIDE_INT offset;
3845 emit_move_insn (stack_pointer_rtx,
3846 expand_binop (Pmode,
3847 #ifdef STACK_GROWS_DOWNWARD
3853 GEN_INT (rounded_size),
3854 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3856 offset = (HOST_WIDE_INT) padding_size;
3857 #ifdef STACK_GROWS_DOWNWARD
3858 if (STACK_PUSH_CODE == POST_DEC)
3859 /* We have already decremented the stack pointer, so get the
3861 offset += (HOST_WIDE_INT) rounded_size;
3863 if (STACK_PUSH_CODE == POST_INC)
3864 /* We have already incremented the stack pointer, so get the
3866 offset -= (HOST_WIDE_INT) rounded_size;
3868 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3872 #ifdef STACK_GROWS_DOWNWARD
3873 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3874 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3875 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3877 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3878 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3879 GEN_INT (rounded_size));
3881 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3884 dest = gen_rtx_MEM (mode, dest_addr);
3888 set_mem_attributes (dest, type, 1);
3890 if (flag_optimize_sibling_calls)
3891 /* Function incoming arguments may overlap with sibling call
3892 outgoing arguments and we cannot allow reordering of reads
3893 from function arguments with stores to outgoing arguments
3894 of sibling calls. */
3895 set_mem_alias_set (dest, 0);
3897 emit_move_insn (dest, x);
3900 /* Emit and annotate a single push insn. */
3903 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3905 int delta, old_delta = stack_pointer_delta;
3906 rtx prev = get_last_insn ();
3909 emit_single_push_insn_1 (mode, x, type);
3911 last = get_last_insn ();
3913 /* Notice the common case where we emitted exactly one insn. */
3914 if (PREV_INSN (last) == prev)
3916 add_reg_note (last, REG_ARGS_SIZE, GEN_INT (stack_pointer_delta));
3920 delta = fixup_args_size_notes (prev, last, stack_pointer_delta);
3921 gcc_assert (delta == INT_MIN || delta == old_delta);
3925 /* Generate code to push X onto the stack, assuming it has mode MODE and
3927 MODE is redundant except when X is a CONST_INT (since they don't
3929 SIZE is an rtx for the size of data to be copied (in bytes),
3930 needed only if X is BLKmode.
3932 ALIGN (in bits) is maximum alignment we can assume.
3934 If PARTIAL and REG are both nonzero, then copy that many of the first
3935 bytes of X into registers starting with REG, and push the rest of X.
3936 The amount of space pushed is decreased by PARTIAL bytes.
3937 REG must be a hard register in this case.
3938 If REG is zero but PARTIAL is not, take any all others actions for an
3939 argument partially in registers, but do not actually load any
3942 EXTRA is the amount in bytes of extra space to leave next to this arg.
3943 This is ignored if an argument block has already been allocated.
3945 On a machine that lacks real push insns, ARGS_ADDR is the address of
3946 the bottom of the argument block for this call. We use indexing off there
3947 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3948 argument block has not been preallocated.
3950 ARGS_SO_FAR is the size of args previously pushed for this call.
3952 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3953 for arguments passed in registers. If nonzero, it will be the number
3954 of bytes required. */
3957 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3958 unsigned int align, int partial, rtx reg, int extra,
3959 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3963 enum direction stack_direction
3964 #ifdef STACK_GROWS_DOWNWARD
3970 /* Decide where to pad the argument: `downward' for below,
3971 `upward' for above, or `none' for don't pad it.
3972 Default is below for small data on big-endian machines; else above. */
3973 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3975 /* Invert direction if stack is post-decrement.
3977 if (STACK_PUSH_CODE == POST_DEC)
3978 if (where_pad != none)
3979 where_pad = (where_pad == downward ? upward : downward);
3984 || (STRICT_ALIGNMENT && align < GET_MODE_ALIGNMENT (mode)))
3986 /* Copy a block into the stack, entirely or partially. */
3993 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3994 used = partial - offset;
3996 if (mode != BLKmode)
3998 /* A value is to be stored in an insufficiently aligned
3999 stack slot; copy via a suitably aligned slot if
4001 size = GEN_INT (GET_MODE_SIZE (mode));
4002 if (!MEM_P (xinner))
4004 temp = assign_temp (type, 0, 1, 1);
4005 emit_move_insn (temp, xinner);
4012 /* USED is now the # of bytes we need not copy to the stack
4013 because registers will take care of them. */
4016 xinner = adjust_address (xinner, BLKmode, used);
4018 /* If the partial register-part of the arg counts in its stack size,
4019 skip the part of stack space corresponding to the registers.
4020 Otherwise, start copying to the beginning of the stack space,
4021 by setting SKIP to 0. */
4022 skip = (reg_parm_stack_space == 0) ? 0 : used;
4024 #ifdef PUSH_ROUNDING
4025 /* Do it with several push insns if that doesn't take lots of insns
4026 and if there is no difficulty with push insns that skip bytes
4027 on the stack for alignment purposes. */
4030 && CONST_INT_P (size)
4032 && MEM_ALIGN (xinner) >= align
4033 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
4034 /* Here we avoid the case of a structure whose weak alignment
4035 forces many pushes of a small amount of data,
4036 and such small pushes do rounding that causes trouble. */
4037 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
4038 || align >= BIGGEST_ALIGNMENT
4039 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
4040 == (align / BITS_PER_UNIT)))
4041 && (HOST_WIDE_INT) PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
4043 /* Push padding now if padding above and stack grows down,
4044 or if padding below and stack grows up.
4045 But if space already allocated, this has already been done. */
4046 if (extra && args_addr == 0
4047 && where_pad != none && where_pad != stack_direction)
4048 anti_adjust_stack (GEN_INT (extra));
4050 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
4053 #endif /* PUSH_ROUNDING */
4057 /* Otherwise make space on the stack and copy the data
4058 to the address of that space. */
4060 /* Deduct words put into registers from the size we must copy. */
4063 if (CONST_INT_P (size))
4064 size = GEN_INT (INTVAL (size) - used);
4066 size = expand_binop (GET_MODE (size), sub_optab, size,
4067 GEN_INT (used), NULL_RTX, 0,
4071 /* Get the address of the stack space.
4072 In this case, we do not deal with EXTRA separately.
4073 A single stack adjust will do. */
4076 temp = push_block (size, extra, where_pad == downward);
4079 else if (CONST_INT_P (args_so_far))
4080 temp = memory_address (BLKmode,
4081 plus_constant (args_addr,
4082 skip + INTVAL (args_so_far)));
4084 temp = memory_address (BLKmode,
4085 plus_constant (gen_rtx_PLUS (Pmode,
4090 if (!ACCUMULATE_OUTGOING_ARGS)
4092 /* If the source is referenced relative to the stack pointer,
4093 copy it to another register to stabilize it. We do not need
4094 to do this if we know that we won't be changing sp. */
4096 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
4097 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
4098 temp = copy_to_reg (temp);
4101 target = gen_rtx_MEM (BLKmode, temp);
4103 /* We do *not* set_mem_attributes here, because incoming arguments
4104 may overlap with sibling call outgoing arguments and we cannot
4105 allow reordering of reads from function arguments with stores
4106 to outgoing arguments of sibling calls. We do, however, want
4107 to record the alignment of the stack slot. */
4108 /* ALIGN may well be better aligned than TYPE, e.g. due to
4109 PARM_BOUNDARY. Assume the caller isn't lying. */
4110 set_mem_align (target, align);
4112 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
4115 else if (partial > 0)
4117 /* Scalar partly in registers. */
4119 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
4122 /* # bytes of start of argument
4123 that we must make space for but need not store. */
4124 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
4125 int args_offset = INTVAL (args_so_far);
4128 /* Push padding now if padding above and stack grows down,
4129 or if padding below and stack grows up.
4130 But if space already allocated, this has already been done. */
4131 if (extra && args_addr == 0
4132 && where_pad != none && where_pad != stack_direction)
4133 anti_adjust_stack (GEN_INT (extra));
4135 /* If we make space by pushing it, we might as well push
4136 the real data. Otherwise, we can leave OFFSET nonzero
4137 and leave the space uninitialized. */
4141 /* Now NOT_STACK gets the number of words that we don't need to
4142 allocate on the stack. Convert OFFSET to words too. */
4143 not_stack = (partial - offset) / UNITS_PER_WORD;
4144 offset /= UNITS_PER_WORD;
4146 /* If the partial register-part of the arg counts in its stack size,
4147 skip the part of stack space corresponding to the registers.
4148 Otherwise, start copying to the beginning of the stack space,
4149 by setting SKIP to 0. */
4150 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
4152 if (CONSTANT_P (x) && !targetm.legitimate_constant_p (mode, x))
4153 x = validize_mem (force_const_mem (mode, x));
4155 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
4156 SUBREGs of such registers are not allowed. */
4157 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
4158 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
4159 x = copy_to_reg (x);
4161 /* Loop over all the words allocated on the stack for this arg. */
4162 /* We can do it by words, because any scalar bigger than a word
4163 has a size a multiple of a word. */
4164 #ifndef PUSH_ARGS_REVERSED
4165 for (i = not_stack; i < size; i++)
4167 for (i = size - 1; i >= not_stack; i--)
4169 if (i >= not_stack + offset)
4170 emit_push_insn (operand_subword_force (x, i, mode),
4171 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
4173 GEN_INT (args_offset + ((i - not_stack + skip)
4175 reg_parm_stack_space, alignment_pad);
4182 /* Push padding now if padding above and stack grows down,
4183 or if padding below and stack grows up.
4184 But if space already allocated, this has already been done. */
4185 if (extra && args_addr == 0
4186 && where_pad != none && where_pad != stack_direction)
4187 anti_adjust_stack (GEN_INT (extra));
4189 #ifdef PUSH_ROUNDING
4190 if (args_addr == 0 && PUSH_ARGS)
4191 emit_single_push_insn (mode, x, type);
4195 if (CONST_INT_P (args_so_far))
4197 = memory_address (mode,
4198 plus_constant (args_addr,
4199 INTVAL (args_so_far)));
4201 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
4203 dest = gen_rtx_MEM (mode, addr);
4205 /* We do *not* set_mem_attributes here, because incoming arguments
4206 may overlap with sibling call outgoing arguments and we cannot
4207 allow reordering of reads from function arguments with stores
4208 to outgoing arguments of sibling calls. We do, however, want
4209 to record the alignment of the stack slot. */
4210 /* ALIGN may well be better aligned than TYPE, e.g. due to
4211 PARM_BOUNDARY. Assume the caller isn't lying. */
4212 set_mem_align (dest, align);
4214 emit_move_insn (dest, x);
4218 /* If part should go in registers, copy that part
4219 into the appropriate registers. Do this now, at the end,
4220 since mem-to-mem copies above may do function calls. */
4221 if (partial > 0 && reg != 0)
4223 /* Handle calls that pass values in multiple non-contiguous locations.
4224 The Irix 6 ABI has examples of this. */
4225 if (GET_CODE (reg) == PARALLEL)
4226 emit_group_load (reg, x, type, -1);
4229 gcc_assert (partial % UNITS_PER_WORD == 0);
4230 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
4234 if (extra && args_addr == 0 && where_pad == stack_direction)
4235 anti_adjust_stack (GEN_INT (extra));
4237 if (alignment_pad && args_addr == 0)
4238 anti_adjust_stack (alignment_pad);
4241 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4245 get_subtarget (rtx x)
4249 /* Only registers can be subtargets. */
4251 /* Don't use hard regs to avoid extending their life. */
4252 || REGNO (x) < FIRST_PSEUDO_REGISTER
4256 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
4257 FIELD is a bitfield. Returns true if the optimization was successful,
4258 and there's nothing else to do. */
4261 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
4262 unsigned HOST_WIDE_INT bitpos,
4263 unsigned HOST_WIDE_INT bitregion_start,
4264 unsigned HOST_WIDE_INT bitregion_end,
4265 enum machine_mode mode1, rtx str_rtx,
4268 enum machine_mode str_mode = GET_MODE (str_rtx);
4269 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
4274 enum tree_code code;
4276 if (mode1 != VOIDmode
4277 || bitsize >= BITS_PER_WORD
4278 || str_bitsize > BITS_PER_WORD
4279 || TREE_SIDE_EFFECTS (to)
4280 || TREE_THIS_VOLATILE (to))
4284 if (TREE_CODE (src) != SSA_NAME)
4286 if (TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
4289 srcstmt = get_gimple_for_ssa_name (src);
4291 || TREE_CODE_CLASS (gimple_assign_rhs_code (srcstmt)) != tcc_binary)
4294 code = gimple_assign_rhs_code (srcstmt);
4296 op0 = gimple_assign_rhs1 (srcstmt);
4298 /* If OP0 is an SSA_NAME, then we want to walk the use-def chain
4299 to find its initialization. Hopefully the initialization will
4300 be from a bitfield load. */
4301 if (TREE_CODE (op0) == SSA_NAME)
4303 gimple op0stmt = get_gimple_for_ssa_name (op0);
4305 /* We want to eventually have OP0 be the same as TO, which
4306 should be a bitfield. */
4308 || !is_gimple_assign (op0stmt)
4309 || gimple_assign_rhs_code (op0stmt) != TREE_CODE (to))
4311 op0 = gimple_assign_rhs1 (op0stmt);
4314 op1 = gimple_assign_rhs2 (srcstmt);
4316 if (!operand_equal_p (to, op0, 0))
4319 if (MEM_P (str_rtx))
4321 unsigned HOST_WIDE_INT offset1;
4323 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
4324 str_mode = word_mode;
4325 str_mode = get_best_mode (bitsize, bitpos,
4326 bitregion_start, bitregion_end,
4327 MEM_ALIGN (str_rtx), str_mode, 0);
4328 if (str_mode == VOIDmode)
4330 str_bitsize = GET_MODE_BITSIZE (str_mode);
4333 bitpos %= str_bitsize;
4334 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
4335 str_rtx = adjust_address (str_rtx, str_mode, offset1);
4337 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
4340 /* If the bit field covers the whole REG/MEM, store_field
4341 will likely generate better code. */
4342 if (bitsize >= str_bitsize)
4345 /* We can't handle fields split across multiple entities. */
4346 if (bitpos + bitsize > str_bitsize)
4349 if (BYTES_BIG_ENDIAN)
4350 bitpos = str_bitsize - bitpos - bitsize;
4356 /* For now, just optimize the case of the topmost bitfield
4357 where we don't need to do any masking and also
4358 1 bit bitfields where xor can be used.
4359 We might win by one instruction for the other bitfields
4360 too if insv/extv instructions aren't used, so that
4361 can be added later. */
4362 if (bitpos + bitsize != str_bitsize
4363 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
4366 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4367 value = convert_modes (str_mode,
4368 TYPE_MODE (TREE_TYPE (op1)), value,
4369 TYPE_UNSIGNED (TREE_TYPE (op1)));
4371 /* We may be accessing data outside the field, which means
4372 we can alias adjacent data. */
4373 if (MEM_P (str_rtx))
4375 str_rtx = shallow_copy_rtx (str_rtx);
4376 set_mem_alias_set (str_rtx, 0);
4377 set_mem_expr (str_rtx, 0);
4380 binop = code == PLUS_EXPR ? add_optab : sub_optab;
4381 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
4383 value = expand_and (str_mode, value, const1_rtx, NULL);
4386 value = expand_shift (LSHIFT_EXPR, str_mode, value,
4387 bitpos, NULL_RTX, 1);
4388 result = expand_binop (str_mode, binop, str_rtx,
4389 value, str_rtx, 1, OPTAB_WIDEN);
4390 if (result != str_rtx)
4391 emit_move_insn (str_rtx, result);
4396 if (TREE_CODE (op1) != INTEGER_CST)
4398 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), EXPAND_NORMAL);
4399 value = convert_modes (GET_MODE (str_rtx),
4400 TYPE_MODE (TREE_TYPE (op1)), value,
4401 TYPE_UNSIGNED (TREE_TYPE (op1)));
4403 /* We may be accessing data outside the field, which means
4404 we can alias adjacent data. */
4405 if (MEM_P (str_rtx))
4407 str_rtx = shallow_copy_rtx (str_rtx);
4408 set_mem_alias_set (str_rtx, 0);
4409 set_mem_expr (str_rtx, 0);
4412 binop = code == BIT_IOR_EXPR ? ior_optab : xor_optab;
4413 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
4415 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
4417 value = expand_and (GET_MODE (str_rtx), value, mask,
4420 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
4421 bitpos, NULL_RTX, 1);
4422 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
4423 value, str_rtx, 1, OPTAB_WIDEN);
4424 if (result != str_rtx)
4425 emit_move_insn (str_rtx, result);
4435 /* In the C++ memory model, consecutive bit fields in a structure are
4436 considered one memory location.
4438 Given a COMPONENT_REF, this function returns the bit range of
4439 consecutive bits in which this COMPONENT_REF belongs in. The
4440 values are returned in *BITSTART and *BITEND. If either the C++
4441 memory model is not activated, or this memory access is not thread
4442 visible, 0 is returned in *BITSTART and *BITEND.
4444 EXP is the COMPONENT_REF.
4445 INNERDECL is the actual object being referenced.
4446 BITPOS is the position in bits where the bit starts within the structure.
4447 BITSIZE is size in bits of the field being referenced in EXP.
4449 For example, while storing into FOO.A here...
4460 ...we are not allowed to store past <b>, so for the layout above, a
4461 range of 0..7 (because no one cares if we store into the
4465 get_bit_range (unsigned HOST_WIDE_INT *bitstart,
4466 unsigned HOST_WIDE_INT *bitend,
4467 tree exp, tree innerdecl,
4468 HOST_WIDE_INT bitpos, HOST_WIDE_INT bitsize)
4470 tree field, record_type, fld;
4471 bool found_field = false;
4472 bool prev_field_is_bitfield;
4474 gcc_assert (TREE_CODE (exp) == COMPONENT_REF);
4476 /* If other threads can't see this value, no need to restrict stores. */
4477 if (ALLOW_STORE_DATA_RACES
4478 || ((TREE_CODE (innerdecl) == MEM_REF
4479 || TREE_CODE (innerdecl) == TARGET_MEM_REF)
4480 && !ptr_deref_may_alias_global_p (TREE_OPERAND (innerdecl, 0)))
4481 || (DECL_P (innerdecl)
4482 && ((TREE_CODE (innerdecl) == VAR_DECL
4483 && DECL_THREAD_LOCAL_P (innerdecl))
4484 || !TREE_STATIC (innerdecl))))
4486 *bitstart = *bitend = 0;
4490 /* Bit field we're storing into. */
4491 field = TREE_OPERAND (exp, 1);
4492 record_type = DECL_FIELD_CONTEXT (field);
4494 /* Count the contiguous bitfields for the memory location that
4497 prev_field_is_bitfield = true;
4498 for (fld = TYPE_FIELDS (record_type); fld; fld = DECL_CHAIN (fld))
4501 enum machine_mode mode;
4502 int unsignedp, volatilep;
4504 if (TREE_CODE (fld) != FIELD_DECL)
4507 t = build3 (COMPONENT_REF, TREE_TYPE (exp),
4508 unshare_expr (TREE_OPERAND (exp, 0)),
4510 get_inner_reference (t, &bitsize, &bitpos, &offset,
4511 &mode, &unsignedp, &volatilep, true);
4516 if (DECL_BIT_FIELD_TYPE (fld) && bitsize > 0)
4518 if (prev_field_is_bitfield == false)
4521 prev_field_is_bitfield = true;
4526 prev_field_is_bitfield = false;
4531 gcc_assert (found_field);
4535 /* We found the end of the bit field sequence. Include the
4536 padding up to the next field and be done. */
4537 *bitend = bitpos - 1;
4541 /* If this is the last element in the structure, include the padding
4542 at the end of structure. */
4543 *bitend = TREE_INT_CST_LOW (TYPE_SIZE (record_type)) - 1;
4547 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4548 is true, try generating a nontemporal store. */
4551 expand_assignment (tree to, tree from, bool nontemporal)
4555 enum machine_mode mode;
4557 enum insn_code icode;
4559 /* Don't crash if the lhs of the assignment was erroneous. */
4560 if (TREE_CODE (to) == ERROR_MARK)
4562 expand_normal (from);
4566 /* Optimize away no-op moves without side-effects. */
4567 if (operand_equal_p (to, from, 0))
4570 mode = TYPE_MODE (TREE_TYPE (to));
4571 if ((TREE_CODE (to) == MEM_REF
4572 || TREE_CODE (to) == TARGET_MEM_REF)
4574 && ((align = get_object_or_type_alignment (to))
4575 < GET_MODE_ALIGNMENT (mode))
4576 && ((icode = optab_handler (movmisalign_optab, mode))
4577 != CODE_FOR_nothing))
4579 struct expand_operand ops[2];
4580 enum machine_mode address_mode;
4583 reg = expand_expr (from, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4584 reg = force_not_mem (reg);
4586 if (TREE_CODE (to) == MEM_REF)
4589 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (to, 1))));
4590 tree base = TREE_OPERAND (to, 0);
4591 address_mode = targetm.addr_space.address_mode (as);
4592 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4593 op0 = convert_memory_address_addr_space (address_mode, op0, as);
4594 if (!integer_zerop (TREE_OPERAND (to, 1)))
4597 = immed_double_int_const (mem_ref_offset (to), address_mode);
4598 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
4600 op0 = memory_address_addr_space (mode, op0, as);
4601 mem = gen_rtx_MEM (mode, op0);
4602 set_mem_attributes (mem, to, 0);
4603 set_mem_addr_space (mem, as);
4605 else if (TREE_CODE (to) == TARGET_MEM_REF)
4607 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (to));
4608 struct mem_address addr;
4610 get_address_description (to, &addr);
4611 op0 = addr_for_mem_ref (&addr, as, true);
4612 op0 = memory_address_addr_space (mode, op0, as);
4613 mem = gen_rtx_MEM (mode, op0);
4614 set_mem_attributes (mem, to, 0);
4615 set_mem_addr_space (mem, as);
4619 if (TREE_THIS_VOLATILE (to))
4620 MEM_VOLATILE_P (mem) = 1;
4622 create_fixed_operand (&ops[0], mem);
4623 create_input_operand (&ops[1], reg, mode);
4624 /* The movmisalign<mode> pattern cannot fail, else the assignment would
4625 silently be omitted. */
4626 expand_insn (icode, 2, ops);
4630 /* Assignment of a structure component needs special treatment
4631 if the structure component's rtx is not simply a MEM.
4632 Assignment of an array element at a constant index, and assignment of
4633 an array element in an unaligned packed structure field, has the same
4635 if (handled_component_p (to)
4636 /* ??? We only need to handle MEM_REF here if the access is not
4637 a full access of the base object. */
4638 || (TREE_CODE (to) == MEM_REF
4639 && TREE_CODE (TREE_OPERAND (to, 0)) == ADDR_EXPR)
4640 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4642 enum machine_mode mode1;
4643 HOST_WIDE_INT bitsize, bitpos;
4644 unsigned HOST_WIDE_INT bitregion_start = 0;
4645 unsigned HOST_WIDE_INT bitregion_end = 0;
4652 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4653 &unsignedp, &volatilep, true);
4655 if (TREE_CODE (to) == COMPONENT_REF
4656 && DECL_BIT_FIELD_TYPE (TREE_OPERAND (to, 1)))
4657 get_bit_range (&bitregion_start, &bitregion_end,
4658 to, tem, bitpos, bitsize);
4660 /* If we are going to use store_bit_field and extract_bit_field,
4661 make sure to_rtx will be safe for multiple use. */
4663 to_rtx = expand_normal (tem);
4665 /* If the bitfield is volatile, we want to access it in the
4666 field's mode, not the computed mode.
4667 If a MEM has VOIDmode (external with incomplete type),
4668 use BLKmode for it instead. */
4671 if (volatilep && flag_strict_volatile_bitfields > 0)
4672 to_rtx = adjust_address (to_rtx, mode1, 0);
4673 else if (GET_MODE (to_rtx) == VOIDmode)
4674 to_rtx = adjust_address (to_rtx, BLKmode, 0);
4679 enum machine_mode address_mode;
4682 if (!MEM_P (to_rtx))
4684 /* We can get constant negative offsets into arrays with broken
4685 user code. Translate this to a trap instead of ICEing. */
4686 gcc_assert (TREE_CODE (offset) == INTEGER_CST);
4687 expand_builtin_trap ();
4688 to_rtx = gen_rtx_MEM (BLKmode, const0_rtx);
4691 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4693 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
4694 if (GET_MODE (offset_rtx) != address_mode)
4695 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
4697 /* A constant address in TO_RTX can have VOIDmode, we must not try
4698 to call force_reg for that case. Avoid that case. */
4700 && GET_MODE (to_rtx) == BLKmode
4701 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4703 && (bitpos % bitsize) == 0
4704 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4705 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4707 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4711 to_rtx = offset_address (to_rtx, offset_rtx,
4712 highest_pow2_factor_for_target (to,
4716 /* No action is needed if the target is not a memory and the field
4717 lies completely outside that target. This can occur if the source
4718 code contains an out-of-bounds access to a small array. */
4720 && GET_MODE (to_rtx) != BLKmode
4721 && (unsigned HOST_WIDE_INT) bitpos
4722 >= GET_MODE_PRECISION (GET_MODE (to_rtx)))
4724 expand_normal (from);
4727 /* Handle expand_expr of a complex value returning a CONCAT. */
4728 else if (GET_CODE (to_rtx) == CONCAT)
4730 unsigned short mode_bitsize = GET_MODE_BITSIZE (GET_MODE (to_rtx));
4731 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from)))
4733 && bitsize == mode_bitsize)
4734 result = store_expr (from, to_rtx, false, nontemporal);
4735 else if (bitsize == mode_bitsize / 2
4736 && (bitpos == 0 || bitpos == mode_bitsize / 2))
4737 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false,
4739 else if (bitpos + bitsize <= mode_bitsize / 2)
4740 result = store_field (XEXP (to_rtx, 0), bitsize, bitpos,
4741 bitregion_start, bitregion_end,
4742 mode1, from, TREE_TYPE (tem),
4743 get_alias_set (to), nontemporal);
4744 else if (bitpos >= mode_bitsize / 2)
4745 result = store_field (XEXP (to_rtx, 1), bitsize,
4746 bitpos - mode_bitsize / 2,
4747 bitregion_start, bitregion_end,
4749 TREE_TYPE (tem), get_alias_set (to),
4751 else if (bitpos == 0 && bitsize == mode_bitsize)
4754 result = expand_normal (from);
4755 from_rtx = simplify_gen_subreg (GET_MODE (to_rtx), result,
4756 TYPE_MODE (TREE_TYPE (from)), 0);
4757 emit_move_insn (XEXP (to_rtx, 0),
4758 read_complex_part (from_rtx, false));
4759 emit_move_insn (XEXP (to_rtx, 1),
4760 read_complex_part (from_rtx, true));
4764 rtx temp = assign_stack_temp (GET_MODE (to_rtx),
4765 GET_MODE_SIZE (GET_MODE (to_rtx)),
4767 write_complex_part (temp, XEXP (to_rtx, 0), false);
4768 write_complex_part (temp, XEXP (to_rtx, 1), true);
4769 result = store_field (temp, bitsize, bitpos,
4770 bitregion_start, bitregion_end,
4772 TREE_TYPE (tem), get_alias_set (to),
4774 emit_move_insn (XEXP (to_rtx, 0), read_complex_part (temp, false));
4775 emit_move_insn (XEXP (to_rtx, 1), read_complex_part (temp, true));
4782 /* If the field is at offset zero, we could have been given the
4783 DECL_RTX of the parent struct. Don't munge it. */
4784 to_rtx = shallow_copy_rtx (to_rtx);
4786 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4788 /* Deal with volatile and readonly fields. The former is only
4789 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4791 MEM_VOLATILE_P (to_rtx) = 1;
4792 if (component_uses_parent_alias_set (to))
4793 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4796 if (optimize_bitfield_assignment_op (bitsize, bitpos,
4797 bitregion_start, bitregion_end,
4802 result = store_field (to_rtx, bitsize, bitpos,
4803 bitregion_start, bitregion_end,
4805 TREE_TYPE (tem), get_alias_set (to),
4810 preserve_temp_slots (result);
4816 /* If the rhs is a function call and its value is not an aggregate,
4817 call the function before we start to compute the lhs.
4818 This is needed for correct code for cases such as
4819 val = setjmp (buf) on machines where reference to val
4820 requires loading up part of an address in a separate insn.
4822 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4823 since it might be a promoted variable where the zero- or sign- extension
4824 needs to be done. Handling this in the normal way is safe because no
4825 computation is done before the call. The same is true for SSA names. */
4826 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
4827 && COMPLETE_TYPE_P (TREE_TYPE (from))
4828 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4829 && ! (((TREE_CODE (to) == VAR_DECL
4830 || TREE_CODE (to) == PARM_DECL
4831 || TREE_CODE (to) == RESULT_DECL)
4832 && REG_P (DECL_RTL (to)))
4833 || TREE_CODE (to) == SSA_NAME))
4838 value = expand_normal (from);
4840 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4842 /* Handle calls that return values in multiple non-contiguous locations.
4843 The Irix 6 ABI has examples of this. */
4844 if (GET_CODE (to_rtx) == PARALLEL)
4845 emit_group_load (to_rtx, value, TREE_TYPE (from),
4846 int_size_in_bytes (TREE_TYPE (from)));
4847 else if (GET_MODE (to_rtx) == BLKmode)
4848 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4851 if (POINTER_TYPE_P (TREE_TYPE (to)))
4852 value = convert_memory_address_addr_space
4853 (GET_MODE (to_rtx), value,
4854 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to))));
4856 emit_move_insn (to_rtx, value);
4858 preserve_temp_slots (to_rtx);
4864 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4865 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4868 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4870 /* Don't move directly into a return register. */
4871 if (TREE_CODE (to) == RESULT_DECL
4872 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4877 if (REG_P (to_rtx) && TYPE_MODE (TREE_TYPE (from)) == BLKmode)
4878 temp = copy_blkmode_to_reg (GET_MODE (to_rtx), from);
4880 temp = expand_expr (from, NULL_RTX, GET_MODE (to_rtx), EXPAND_NORMAL);
4882 if (GET_CODE (to_rtx) == PARALLEL)
4883 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4884 int_size_in_bytes (TREE_TYPE (from)));
4886 emit_move_insn (to_rtx, temp);
4888 preserve_temp_slots (to_rtx);
4894 /* In case we are returning the contents of an object which overlaps
4895 the place the value is being stored, use a safe function when copying
4896 a value through a pointer into a structure value return block. */
4897 if (TREE_CODE (to) == RESULT_DECL
4898 && TREE_CODE (from) == INDIRECT_REF
4899 && ADDR_SPACE_GENERIC_P
4900 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from, 0)))))
4901 && refs_may_alias_p (to, from)
4902 && cfun->returns_struct
4903 && !cfun->returns_pcc_struct)
4908 size = expr_size (from);
4909 from_rtx = expand_normal (from);
4911 emit_library_call (memmove_libfunc, LCT_NORMAL,
4912 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4913 XEXP (from_rtx, 0), Pmode,
4914 convert_to_mode (TYPE_MODE (sizetype),
4915 size, TYPE_UNSIGNED (sizetype)),
4916 TYPE_MODE (sizetype));
4918 preserve_temp_slots (to_rtx);
4924 /* Compute FROM and store the value in the rtx we got. */
4927 result = store_expr (from, to_rtx, 0, nontemporal);
4928 preserve_temp_slots (result);
4934 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4935 succeeded, false otherwise. */
4938 emit_storent_insn (rtx to, rtx from)
4940 struct expand_operand ops[2];
4941 enum machine_mode mode = GET_MODE (to);
4942 enum insn_code code = optab_handler (storent_optab, mode);
4944 if (code == CODE_FOR_nothing)
4947 create_fixed_operand (&ops[0], to);
4948 create_input_operand (&ops[1], from, mode);
4949 return maybe_expand_insn (code, 2, ops);
4952 /* Generate code for computing expression EXP,
4953 and storing the value into TARGET.
4955 If the mode is BLKmode then we may return TARGET itself.
4956 It turns out that in BLKmode it doesn't cause a problem.
4957 because C has no operators that could combine two different
4958 assignments into the same BLKmode object with different values
4959 with no sequence point. Will other languages need this to
4962 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4963 stack, and block moves may need to be treated specially.
4965 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4968 store_expr (tree exp, rtx target, int call_param_p, bool nontemporal)
4971 rtx alt_rtl = NULL_RTX;
4972 location_t loc = EXPR_LOCATION (exp);
4974 if (VOID_TYPE_P (TREE_TYPE (exp)))
4976 /* C++ can generate ?: expressions with a throw expression in one
4977 branch and an rvalue in the other. Here, we resolve attempts to
4978 store the throw expression's nonexistent result. */
4979 gcc_assert (!call_param_p);
4980 expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4983 if (TREE_CODE (exp) == COMPOUND_EXPR)
4985 /* Perform first part of compound expression, then assign from second
4987 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4988 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4989 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4992 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4994 /* For conditional expression, get safe form of the target. Then
4995 test the condition, doing the appropriate assignment on either
4996 side. This avoids the creation of unnecessary temporaries.
4997 For non-BLKmode, it is more efficient not to do this. */
4999 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
5001 do_pending_stack_adjust ();
5003 jumpifnot (TREE_OPERAND (exp, 0), lab1, -1);
5004 store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
5006 emit_jump_insn (gen_jump (lab2));
5009 store_expr (TREE_OPERAND (exp, 2), target, call_param_p,
5016 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
5017 /* If this is a scalar in a register that is stored in a wider mode
5018 than the declared mode, compute the result into its declared mode
5019 and then convert to the wider mode. Our value is the computed
5022 rtx inner_target = 0;
5024 /* We can do the conversion inside EXP, which will often result
5025 in some optimizations. Do the conversion in two steps: first
5026 change the signedness, if needed, then the extend. But don't
5027 do this if the type of EXP is a subtype of something else
5028 since then the conversion might involve more than just
5029 converting modes. */
5030 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
5031 && TREE_TYPE (TREE_TYPE (exp)) == 0
5032 && GET_MODE_PRECISION (GET_MODE (target))
5033 == TYPE_PRECISION (TREE_TYPE (exp)))
5035 if (TYPE_UNSIGNED (TREE_TYPE (exp))
5036 != SUBREG_PROMOTED_UNSIGNED_P (target))
5038 /* Some types, e.g. Fortran's logical*4, won't have a signed
5039 version, so use the mode instead. */
5041 = (signed_or_unsigned_type_for
5042 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)));
5044 ntype = lang_hooks.types.type_for_mode
5045 (TYPE_MODE (TREE_TYPE (exp)),
5046 SUBREG_PROMOTED_UNSIGNED_P (target));
5048 exp = fold_convert_loc (loc, ntype, exp);
5051 exp = fold_convert_loc (loc, lang_hooks.types.type_for_mode
5052 (GET_MODE (SUBREG_REG (target)),
5053 SUBREG_PROMOTED_UNSIGNED_P (target)),
5056 inner_target = SUBREG_REG (target);
5059 temp = expand_expr (exp, inner_target, VOIDmode,
5060 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
5062 /* If TEMP is a VOIDmode constant, use convert_modes to make
5063 sure that we properly convert it. */
5064 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
5066 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
5067 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
5068 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
5069 GET_MODE (target), temp,
5070 SUBREG_PROMOTED_UNSIGNED_P (target));
5073 convert_move (SUBREG_REG (target), temp,
5074 SUBREG_PROMOTED_UNSIGNED_P (target));
5078 else if ((TREE_CODE (exp) == STRING_CST
5079 || (TREE_CODE (exp) == MEM_REF
5080 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
5081 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
5083 && integer_zerop (TREE_OPERAND (exp, 1))))
5084 && !nontemporal && !call_param_p
5087 /* Optimize initialization of an array with a STRING_CST. */
5088 HOST_WIDE_INT exp_len, str_copy_len;
5090 tree str = TREE_CODE (exp) == STRING_CST
5091 ? exp : TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
5093 exp_len = int_expr_size (exp);
5097 if (TREE_STRING_LENGTH (str) <= 0)
5100 str_copy_len = strlen (TREE_STRING_POINTER (str));
5101 if (str_copy_len < TREE_STRING_LENGTH (str) - 1)
5104 str_copy_len = TREE_STRING_LENGTH (str);
5105 if ((STORE_MAX_PIECES & (STORE_MAX_PIECES - 1)) == 0
5106 && TREE_STRING_POINTER (str)[TREE_STRING_LENGTH (str) - 1] == '\0')
5108 str_copy_len += STORE_MAX_PIECES - 1;
5109 str_copy_len &= ~(STORE_MAX_PIECES - 1);
5111 str_copy_len = MIN (str_copy_len, exp_len);
5112 if (!can_store_by_pieces (str_copy_len, builtin_strncpy_read_str,
5113 CONST_CAST (char *, TREE_STRING_POINTER (str)),
5114 MEM_ALIGN (target), false))
5119 dest_mem = store_by_pieces (dest_mem,
5120 str_copy_len, builtin_strncpy_read_str,
5122 TREE_STRING_POINTER (str)),
5123 MEM_ALIGN (target), false,
5124 exp_len > str_copy_len ? 1 : 0);
5125 if (exp_len > str_copy_len)
5126 clear_storage (adjust_address (dest_mem, BLKmode, 0),
5127 GEN_INT (exp_len - str_copy_len),
5136 /* If we want to use a nontemporal store, force the value to
5138 tmp_target = nontemporal ? NULL_RTX : target;
5139 temp = expand_expr_real (exp, tmp_target, GET_MODE (target),
5141 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
5145 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
5146 the same as that of TARGET, adjust the constant. This is needed, for
5147 example, in case it is a CONST_DOUBLE and we want only a word-sized
5149 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
5150 && TREE_CODE (exp) != ERROR_MARK
5151 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
5152 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
5153 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
5155 /* If value was not generated in the target, store it there.
5156 Convert the value to TARGET's type first if necessary and emit the
5157 pending incrementations that have been queued when expanding EXP.
5158 Note that we cannot emit the whole queue blindly because this will
5159 effectively disable the POST_INC optimization later.
5161 If TEMP and TARGET compare equal according to rtx_equal_p, but
5162 one or both of them are volatile memory refs, we have to distinguish
5164 - expand_expr has used TARGET. In this case, we must not generate
5165 another copy. This can be detected by TARGET being equal according
5167 - expand_expr has not used TARGET - that means that the source just
5168 happens to have the same RTX form. Since temp will have been created
5169 by expand_expr, it will compare unequal according to == .
5170 We must generate a copy in this case, to reach the correct number
5171 of volatile memory references. */
5173 if ((! rtx_equal_p (temp, target)
5174 || (temp != target && (side_effects_p (temp)
5175 || side_effects_p (target))))
5176 && TREE_CODE (exp) != ERROR_MARK
5177 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
5178 but TARGET is not valid memory reference, TEMP will differ
5179 from TARGET although it is really the same location. */
5181 && rtx_equal_p (alt_rtl, target)
5182 && !side_effects_p (alt_rtl)
5183 && !side_effects_p (target))
5184 /* If there's nothing to copy, don't bother. Don't call
5185 expr_size unless necessary, because some front-ends (C++)
5186 expr_size-hook must not be given objects that are not
5187 supposed to be bit-copied or bit-initialized. */
5188 && expr_size (exp) != const0_rtx)
5190 if (GET_MODE (temp) != GET_MODE (target)
5191 && GET_MODE (temp) != VOIDmode)
5193 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
5194 if (GET_MODE (target) == BLKmode
5195 && GET_MODE (temp) == BLKmode)
5196 emit_block_move (target, temp, expr_size (exp),
5198 ? BLOCK_OP_CALL_PARM
5199 : BLOCK_OP_NORMAL));
5200 else if (GET_MODE (target) == BLKmode)
5201 store_bit_field (target, INTVAL (expr_size (exp)) * BITS_PER_UNIT,
5202 0, 0, 0, GET_MODE (temp), temp);
5204 convert_move (target, temp, unsignedp);
5207 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
5209 /* Handle copying a string constant into an array. The string
5210 constant may be shorter than the array. So copy just the string's
5211 actual length, and clear the rest. First get the size of the data
5212 type of the string, which is actually the size of the target. */
5213 rtx size = expr_size (exp);
5215 if (CONST_INT_P (size)
5216 && INTVAL (size) < TREE_STRING_LENGTH (exp))
5217 emit_block_move (target, temp, size,
5219 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
5222 enum machine_mode pointer_mode
5223 = targetm.addr_space.pointer_mode (MEM_ADDR_SPACE (target));
5224 enum machine_mode address_mode
5225 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (target));
5227 /* Compute the size of the data to copy from the string. */
5229 = size_binop_loc (loc, MIN_EXPR,
5230 make_tree (sizetype, size),
5231 size_int (TREE_STRING_LENGTH (exp)));
5233 = expand_expr (copy_size, NULL_RTX, VOIDmode,
5235 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
5238 /* Copy that much. */
5239 copy_size_rtx = convert_to_mode (pointer_mode, copy_size_rtx,
5240 TYPE_UNSIGNED (sizetype));
5241 emit_block_move (target, temp, copy_size_rtx,
5243 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
5245 /* Figure out how much is left in TARGET that we have to clear.
5246 Do all calculations in pointer_mode. */
5247 if (CONST_INT_P (copy_size_rtx))
5249 size = plus_constant (size, -INTVAL (copy_size_rtx));
5250 target = adjust_address (target, BLKmode,
5251 INTVAL (copy_size_rtx));
5255 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
5256 copy_size_rtx, NULL_RTX, 0,
5259 if (GET_MODE (copy_size_rtx) != address_mode)
5260 copy_size_rtx = convert_to_mode (address_mode,
5262 TYPE_UNSIGNED (sizetype));
5264 target = offset_address (target, copy_size_rtx,
5265 highest_pow2_factor (copy_size));
5266 label = gen_label_rtx ();
5267 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
5268 GET_MODE (size), 0, label);
5271 if (size != const0_rtx)
5272 clear_storage (target, size, BLOCK_OP_NORMAL);
5278 /* Handle calls that return values in multiple non-contiguous locations.
5279 The Irix 6 ABI has examples of this. */
5280 else if (GET_CODE (target) == PARALLEL)
5281 emit_group_load (target, temp, TREE_TYPE (exp),
5282 int_size_in_bytes (TREE_TYPE (exp)));
5283 else if (GET_MODE (temp) == BLKmode)
5284 emit_block_move (target, temp, expr_size (exp),
5286 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
5287 else if (nontemporal
5288 && emit_storent_insn (target, temp))
5289 /* If we managed to emit a nontemporal store, there is nothing else to
5294 temp = force_operand (temp, target);
5296 emit_move_insn (target, temp);
5303 /* Return true if field F of structure TYPE is a flexible array. */
5306 flexible_array_member_p (const_tree f, const_tree type)
5311 return (DECL_CHAIN (f) == NULL
5312 && TREE_CODE (tf) == ARRAY_TYPE
5314 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf))
5315 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf)))
5316 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf))
5317 && int_size_in_bytes (type) >= 0);
5320 /* If FOR_CTOR_P, return the number of top-level elements that a constructor
5321 must have in order for it to completely initialize a value of type TYPE.
5322 Return -1 if the number isn't known.
5324 If !FOR_CTOR_P, return an estimate of the number of scalars in TYPE. */
5326 static HOST_WIDE_INT
5327 count_type_elements (const_tree type, bool for_ctor_p)
5329 switch (TREE_CODE (type))
5335 nelts = array_type_nelts (type);
5336 if (nelts && host_integerp (nelts, 1))
5338 unsigned HOST_WIDE_INT n;
5340 n = tree_low_cst (nelts, 1) + 1;
5341 if (n == 0 || for_ctor_p)
5344 return n * count_type_elements (TREE_TYPE (type), false);
5346 return for_ctor_p ? -1 : 1;
5351 unsigned HOST_WIDE_INT n;
5355 for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f))
5356 if (TREE_CODE (f) == FIELD_DECL)
5359 n += count_type_elements (TREE_TYPE (f), false);
5360 else if (!flexible_array_member_p (f, type))
5361 /* Don't count flexible arrays, which are not supposed
5362 to be initialized. */
5370 case QUAL_UNION_TYPE:
5375 gcc_assert (!for_ctor_p);
5376 /* Estimate the number of scalars in each field and pick the
5377 maximum. Other estimates would do instead; the idea is simply
5378 to make sure that the estimate is not sensitive to the ordering
5381 for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f))
5382 if (TREE_CODE (f) == FIELD_DECL)
5384 m = count_type_elements (TREE_TYPE (f), false);
5385 /* If the field doesn't span the whole union, add an extra
5386 scalar for the rest. */
5387 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (f)),
5388 TYPE_SIZE (type)) != 1)
5400 return TYPE_VECTOR_SUBPARTS (type);
5404 case FIXED_POINT_TYPE:
5409 case REFERENCE_TYPE:
5425 /* Helper for categorize_ctor_elements. Identical interface. */
5428 categorize_ctor_elements_1 (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
5429 HOST_WIDE_INT *p_init_elts, bool *p_complete)
5431 unsigned HOST_WIDE_INT idx;
5432 HOST_WIDE_INT nz_elts, init_elts, num_fields;
5433 tree value, purpose, elt_type;
5435 /* Whether CTOR is a valid constant initializer, in accordance with what
5436 initializer_constant_valid_p does. If inferred from the constructor
5437 elements, true until proven otherwise. */
5438 bool const_from_elts_p = constructor_static_from_elts_p (ctor);
5439 bool const_p = const_from_elts_p ? true : TREE_STATIC (ctor);
5444 elt_type = NULL_TREE;
5446 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), idx, purpose, value)
5448 HOST_WIDE_INT mult = 1;
5450 if (TREE_CODE (purpose) == RANGE_EXPR)
5452 tree lo_index = TREE_OPERAND (purpose, 0);
5453 tree hi_index = TREE_OPERAND (purpose, 1);
5455 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
5456 mult = (tree_low_cst (hi_index, 1)
5457 - tree_low_cst (lo_index, 1) + 1);
5460 elt_type = TREE_TYPE (value);
5462 switch (TREE_CODE (value))
5466 HOST_WIDE_INT nz = 0, ic = 0;
5468 bool const_elt_p = categorize_ctor_elements_1 (value, &nz, &ic,
5471 nz_elts += mult * nz;
5472 init_elts += mult * ic;
5474 if (const_from_elts_p && const_p)
5475 const_p = const_elt_p;
5482 if (!initializer_zerop (value))
5488 nz_elts += mult * TREE_STRING_LENGTH (value);
5489 init_elts += mult * TREE_STRING_LENGTH (value);
5493 if (!initializer_zerop (TREE_REALPART (value)))
5495 if (!initializer_zerop (TREE_IMAGPART (value)))
5503 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
5505 if (!initializer_zerop (TREE_VALUE (v)))
5514 HOST_WIDE_INT tc = count_type_elements (elt_type, false);
5515 nz_elts += mult * tc;
5516 init_elts += mult * tc;
5518 if (const_from_elts_p && const_p)
5519 const_p = initializer_constant_valid_p (value, elt_type)
5526 if (*p_complete && !complete_ctor_at_level_p (TREE_TYPE (ctor),
5527 num_fields, elt_type))
5528 *p_complete = false;
5530 *p_nz_elts += nz_elts;
5531 *p_init_elts += init_elts;
5536 /* Examine CTOR to discover:
5537 * how many scalar fields are set to nonzero values,
5538 and place it in *P_NZ_ELTS;
5539 * how many scalar fields in total are in CTOR,
5540 and place it in *P_ELT_COUNT.
5541 * whether the constructor is complete -- in the sense that every
5542 meaningful byte is explicitly given a value --
5543 and place it in *P_COMPLETE.
5545 Return whether or not CTOR is a valid static constant initializer, the same
5546 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
5549 categorize_ctor_elements (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
5550 HOST_WIDE_INT *p_init_elts, bool *p_complete)
5556 return categorize_ctor_elements_1 (ctor, p_nz_elts, p_init_elts, p_complete);
5559 /* TYPE is initialized by a constructor with NUM_ELTS elements, the last
5560 of which had type LAST_TYPE. Each element was itself a complete
5561 initializer, in the sense that every meaningful byte was explicitly
5562 given a value. Return true if the same is true for the constructor
5566 complete_ctor_at_level_p (const_tree type, HOST_WIDE_INT num_elts,
5567 const_tree last_type)
5569 if (TREE_CODE (type) == UNION_TYPE
5570 || TREE_CODE (type) == QUAL_UNION_TYPE)
5575 gcc_assert (num_elts == 1 && last_type);
5577 /* ??? We could look at each element of the union, and find the
5578 largest element. Which would avoid comparing the size of the
5579 initialized element against any tail padding in the union.
5580 Doesn't seem worth the effort... */
5581 return simple_cst_equal (TYPE_SIZE (type), TYPE_SIZE (last_type)) == 1;
5584 return count_type_elements (type, true) == num_elts;
5587 /* Return 1 if EXP contains mostly (3/4) zeros. */
5590 mostly_zeros_p (const_tree exp)
5592 if (TREE_CODE (exp) == CONSTRUCTOR)
5594 HOST_WIDE_INT nz_elts, init_elts;
5597 categorize_ctor_elements (exp, &nz_elts, &init_elts, &complete_p);
5598 return !complete_p || nz_elts < init_elts / 4;
5601 return initializer_zerop (exp);
5604 /* Return 1 if EXP contains all zeros. */
5607 all_zeros_p (const_tree exp)
5609 if (TREE_CODE (exp) == CONSTRUCTOR)
5611 HOST_WIDE_INT nz_elts, init_elts;
5614 categorize_ctor_elements (exp, &nz_elts, &init_elts, &complete_p);
5615 return nz_elts == 0;
5618 return initializer_zerop (exp);
5621 /* Helper function for store_constructor.
5622 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5623 TYPE is the type of the CONSTRUCTOR, not the element type.
5624 CLEARED is as for store_constructor.
5625 ALIAS_SET is the alias set to use for any stores.
5627 This provides a recursive shortcut back to store_constructor when it isn't
5628 necessary to go through store_field. This is so that we can pass through
5629 the cleared field to let store_constructor know that we may not have to
5630 clear a substructure if the outer structure has already been cleared. */
5633 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
5634 HOST_WIDE_INT bitpos, enum machine_mode mode,
5635 tree exp, tree type, int cleared,
5636 alias_set_type alias_set)
5638 if (TREE_CODE (exp) == CONSTRUCTOR
5639 /* We can only call store_constructor recursively if the size and
5640 bit position are on a byte boundary. */
5641 && bitpos % BITS_PER_UNIT == 0
5642 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
5643 /* If we have a nonzero bitpos for a register target, then we just
5644 let store_field do the bitfield handling. This is unlikely to
5645 generate unnecessary clear instructions anyways. */
5646 && (bitpos == 0 || MEM_P (target)))
5650 = adjust_address (target,
5651 GET_MODE (target) == BLKmode
5653 % GET_MODE_ALIGNMENT (GET_MODE (target)))
5654 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
5657 /* Update the alias set, if required. */
5658 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
5659 && MEM_ALIAS_SET (target) != 0)
5661 target = copy_rtx (target);
5662 set_mem_alias_set (target, alias_set);
5665 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
5668 store_field (target, bitsize, bitpos, 0, 0, mode, exp, type, alias_set,
5672 /* Store the value of constructor EXP into the rtx TARGET.
5673 TARGET is either a REG or a MEM; we know it cannot conflict, since
5674 safe_from_p has been called.
5675 CLEARED is true if TARGET is known to have been zero'd.
5676 SIZE is the number of bytes of TARGET we are allowed to modify: this
5677 may not be the same as the size of EXP if we are assigning to a field
5678 which has been packed to exclude padding bits. */
5681 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
5683 tree type = TREE_TYPE (exp);
5684 #ifdef WORD_REGISTER_OPERATIONS
5685 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
5688 switch (TREE_CODE (type))
5692 case QUAL_UNION_TYPE:
5694 unsigned HOST_WIDE_INT idx;
5697 /* If size is zero or the target is already cleared, do nothing. */
5698 if (size == 0 || cleared)
5700 /* We either clear the aggregate or indicate the value is dead. */
5701 else if ((TREE_CODE (type) == UNION_TYPE
5702 || TREE_CODE (type) == QUAL_UNION_TYPE)
5703 && ! CONSTRUCTOR_ELTS (exp))
5704 /* If the constructor is empty, clear the union. */
5706 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
5710 /* If we are building a static constructor into a register,
5711 set the initial value as zero so we can fold the value into
5712 a constant. But if more than one register is involved,
5713 this probably loses. */
5714 else if (REG_P (target) && TREE_STATIC (exp)
5715 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
5717 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5721 /* If the constructor has fewer fields than the structure or
5722 if we are initializing the structure to mostly zeros, clear
5723 the whole structure first. Don't do this if TARGET is a
5724 register whose mode size isn't equal to SIZE since
5725 clear_storage can't handle this case. */
5727 && (((int)VEC_length (constructor_elt, CONSTRUCTOR_ELTS (exp))
5728 != fields_length (type))
5729 || mostly_zeros_p (exp))
5731 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
5734 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5738 if (REG_P (target) && !cleared)
5739 emit_clobber (target);
5741 /* Store each element of the constructor into the
5742 corresponding field of TARGET. */
5743 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, field, value)
5745 enum machine_mode mode;
5746 HOST_WIDE_INT bitsize;
5747 HOST_WIDE_INT bitpos = 0;
5749 rtx to_rtx = target;
5751 /* Just ignore missing fields. We cleared the whole
5752 structure, above, if any fields are missing. */
5756 if (cleared && initializer_zerop (value))
5759 if (host_integerp (DECL_SIZE (field), 1))
5760 bitsize = tree_low_cst (DECL_SIZE (field), 1);
5764 mode = DECL_MODE (field);
5765 if (DECL_BIT_FIELD (field))
5768 offset = DECL_FIELD_OFFSET (field);
5769 if (host_integerp (offset, 0)
5770 && host_integerp (bit_position (field), 0))
5772 bitpos = int_bit_position (field);
5776 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
5780 enum machine_mode address_mode;
5784 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
5785 make_tree (TREE_TYPE (exp),
5788 offset_rtx = expand_normal (offset);
5789 gcc_assert (MEM_P (to_rtx));
5792 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
5793 if (GET_MODE (offset_rtx) != address_mode)
5794 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
5796 to_rtx = offset_address (to_rtx, offset_rtx,
5797 highest_pow2_factor (offset));
5800 #ifdef WORD_REGISTER_OPERATIONS
5801 /* If this initializes a field that is smaller than a
5802 word, at the start of a word, try to widen it to a full
5803 word. This special case allows us to output C++ member
5804 function initializations in a form that the optimizers
5807 && bitsize < BITS_PER_WORD
5808 && bitpos % BITS_PER_WORD == 0
5809 && GET_MODE_CLASS (mode) == MODE_INT
5810 && TREE_CODE (value) == INTEGER_CST
5812 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5814 tree type = TREE_TYPE (value);
5816 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5818 type = lang_hooks.types.type_for_size
5819 (BITS_PER_WORD, TYPE_UNSIGNED (type));
5820 value = fold_convert (type, value);
5823 if (BYTES_BIG_ENDIAN)
5825 = fold_build2 (LSHIFT_EXPR, type, value,
5826 build_int_cst (type,
5827 BITS_PER_WORD - bitsize));
5828 bitsize = BITS_PER_WORD;
5833 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5834 && DECL_NONADDRESSABLE_P (field))
5836 to_rtx = copy_rtx (to_rtx);
5837 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5840 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5841 value, type, cleared,
5842 get_alias_set (TREE_TYPE (field)));
5849 unsigned HOST_WIDE_INT i;
5852 tree elttype = TREE_TYPE (type);
5854 HOST_WIDE_INT minelt = 0;
5855 HOST_WIDE_INT maxelt = 0;
5857 domain = TYPE_DOMAIN (type);
5858 const_bounds_p = (TYPE_MIN_VALUE (domain)
5859 && TYPE_MAX_VALUE (domain)
5860 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5861 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5863 /* If we have constant bounds for the range of the type, get them. */
5866 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5867 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5870 /* If the constructor has fewer elements than the array, clear
5871 the whole array first. Similarly if this is static
5872 constructor of a non-BLKmode object. */
5875 else if (REG_P (target) && TREE_STATIC (exp))
5879 unsigned HOST_WIDE_INT idx;
5881 HOST_WIDE_INT count = 0, zero_count = 0;
5882 need_to_clear = ! const_bounds_p;
5884 /* This loop is a more accurate version of the loop in
5885 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5886 is also needed to check for missing elements. */
5887 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, index, value)
5889 HOST_WIDE_INT this_node_count;
5894 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5896 tree lo_index = TREE_OPERAND (index, 0);
5897 tree hi_index = TREE_OPERAND (index, 1);
5899 if (! host_integerp (lo_index, 1)
5900 || ! host_integerp (hi_index, 1))
5906 this_node_count = (tree_low_cst (hi_index, 1)
5907 - tree_low_cst (lo_index, 1) + 1);
5910 this_node_count = 1;
5912 count += this_node_count;
5913 if (mostly_zeros_p (value))
5914 zero_count += this_node_count;
5917 /* Clear the entire array first if there are any missing
5918 elements, or if the incidence of zero elements is >=
5921 && (count < maxelt - minelt + 1
5922 || 4 * zero_count >= 3 * count))
5926 if (need_to_clear && size > 0)
5929 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5931 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5935 if (!cleared && REG_P (target))
5936 /* Inform later passes that the old value is dead. */
5937 emit_clobber (target);
5939 /* Store each element of the constructor into the
5940 corresponding element of TARGET, determined by counting the
5942 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), i, index, value)
5944 enum machine_mode mode;
5945 HOST_WIDE_INT bitsize;
5946 HOST_WIDE_INT bitpos;
5947 rtx xtarget = target;
5949 if (cleared && initializer_zerop (value))
5952 mode = TYPE_MODE (elttype);
5953 if (mode == BLKmode)
5954 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
5955 ? tree_low_cst (TYPE_SIZE (elttype), 1)
5958 bitsize = GET_MODE_BITSIZE (mode);
5960 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5962 tree lo_index = TREE_OPERAND (index, 0);
5963 tree hi_index = TREE_OPERAND (index, 1);
5964 rtx index_r, pos_rtx;
5965 HOST_WIDE_INT lo, hi, count;
5968 /* If the range is constant and "small", unroll the loop. */
5970 && host_integerp (lo_index, 0)
5971 && host_integerp (hi_index, 0)
5972 && (lo = tree_low_cst (lo_index, 0),
5973 hi = tree_low_cst (hi_index, 0),
5974 count = hi - lo + 1,
5977 || (host_integerp (TYPE_SIZE (elttype), 1)
5978 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
5981 lo -= minelt; hi -= minelt;
5982 for (; lo <= hi; lo++)
5984 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
5987 && !MEM_KEEP_ALIAS_SET_P (target)
5988 && TREE_CODE (type) == ARRAY_TYPE
5989 && TYPE_NONALIASED_COMPONENT (type))
5991 target = copy_rtx (target);
5992 MEM_KEEP_ALIAS_SET_P (target) = 1;
5995 store_constructor_field
5996 (target, bitsize, bitpos, mode, value, type, cleared,
5997 get_alias_set (elttype));
6002 rtx loop_start = gen_label_rtx ();
6003 rtx loop_end = gen_label_rtx ();
6006 expand_normal (hi_index);
6008 index = build_decl (EXPR_LOCATION (exp),
6009 VAR_DECL, NULL_TREE, domain);
6010 index_r = gen_reg_rtx (promote_decl_mode (index, NULL));
6011 SET_DECL_RTL (index, index_r);
6012 store_expr (lo_index, index_r, 0, false);
6014 /* Build the head of the loop. */
6015 do_pending_stack_adjust ();
6016 emit_label (loop_start);
6018 /* Assign value to element index. */
6020 fold_convert (ssizetype,
6021 fold_build2 (MINUS_EXPR,
6024 TYPE_MIN_VALUE (domain)));
6027 size_binop (MULT_EXPR, position,
6028 fold_convert (ssizetype,
6029 TYPE_SIZE_UNIT (elttype)));
6031 pos_rtx = expand_normal (position);
6032 xtarget = offset_address (target, pos_rtx,
6033 highest_pow2_factor (position));
6034 xtarget = adjust_address (xtarget, mode, 0);
6035 if (TREE_CODE (value) == CONSTRUCTOR)
6036 store_constructor (value, xtarget, cleared,
6037 bitsize / BITS_PER_UNIT);
6039 store_expr (value, xtarget, 0, false);
6041 /* Generate a conditional jump to exit the loop. */
6042 exit_cond = build2 (LT_EXPR, integer_type_node,
6044 jumpif (exit_cond, loop_end, -1);
6046 /* Update the loop counter, and jump to the head of
6048 expand_assignment (index,
6049 build2 (PLUS_EXPR, TREE_TYPE (index),
6050 index, integer_one_node),
6053 emit_jump (loop_start);
6055 /* Build the end of the loop. */
6056 emit_label (loop_end);
6059 else if ((index != 0 && ! host_integerp (index, 0))
6060 || ! host_integerp (TYPE_SIZE (elttype), 1))
6065 index = ssize_int (1);
6068 index = fold_convert (ssizetype,
6069 fold_build2 (MINUS_EXPR,
6072 TYPE_MIN_VALUE (domain)));
6075 size_binop (MULT_EXPR, index,
6076 fold_convert (ssizetype,
6077 TYPE_SIZE_UNIT (elttype)));
6078 xtarget = offset_address (target,
6079 expand_normal (position),
6080 highest_pow2_factor (position));
6081 xtarget = adjust_address (xtarget, mode, 0);
6082 store_expr (value, xtarget, 0, false);
6087 bitpos = ((tree_low_cst (index, 0) - minelt)
6088 * tree_low_cst (TYPE_SIZE (elttype), 1));
6090 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
6092 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
6093 && TREE_CODE (type) == ARRAY_TYPE
6094 && TYPE_NONALIASED_COMPONENT (type))
6096 target = copy_rtx (target);
6097 MEM_KEEP_ALIAS_SET_P (target) = 1;
6099 store_constructor_field (target, bitsize, bitpos, mode, value,
6100 type, cleared, get_alias_set (elttype));
6108 unsigned HOST_WIDE_INT idx;
6109 constructor_elt *ce;
6113 tree elttype = TREE_TYPE (type);
6114 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
6115 enum machine_mode eltmode = TYPE_MODE (elttype);
6116 HOST_WIDE_INT bitsize;
6117 HOST_WIDE_INT bitpos;
6118 rtvec vector = NULL;
6120 alias_set_type alias;
6122 gcc_assert (eltmode != BLKmode);
6124 n_elts = TYPE_VECTOR_SUBPARTS (type);
6125 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
6127 enum machine_mode mode = GET_MODE (target);
6129 icode = (int) optab_handler (vec_init_optab, mode);
6130 if (icode != CODE_FOR_nothing)
6134 vector = rtvec_alloc (n_elts);
6135 for (i = 0; i < n_elts; i++)
6136 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
6140 /* If the constructor has fewer elements than the vector,
6141 clear the whole array first. Similarly if this is static
6142 constructor of a non-BLKmode object. */
6145 else if (REG_P (target) && TREE_STATIC (exp))
6149 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
6152 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
6154 int n_elts_here = tree_low_cst
6155 (int_const_binop (TRUNC_DIV_EXPR,
6156 TYPE_SIZE (TREE_TYPE (value)),
6157 TYPE_SIZE (elttype)), 1);
6159 count += n_elts_here;
6160 if (mostly_zeros_p (value))
6161 zero_count += n_elts_here;
6164 /* Clear the entire vector first if there are any missing elements,
6165 or if the incidence of zero elements is >= 75%. */
6166 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
6169 if (need_to_clear && size > 0 && !vector)
6172 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
6174 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
6178 /* Inform later passes that the old value is dead. */
6179 if (!cleared && !vector && REG_P (target))
6180 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
6183 alias = MEM_ALIAS_SET (target);
6185 alias = get_alias_set (elttype);
6187 /* Store each element of the constructor into the corresponding
6188 element of TARGET, determined by counting the elements. */
6189 for (idx = 0, i = 0;
6190 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
6191 idx++, i += bitsize / elt_size)
6193 HOST_WIDE_INT eltpos;
6194 tree value = ce->value;
6196 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
6197 if (cleared && initializer_zerop (value))
6201 eltpos = tree_low_cst (ce->index, 1);
6207 /* Vector CONSTRUCTORs should only be built from smaller
6208 vectors in the case of BLKmode vectors. */
6209 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
6210 RTVEC_ELT (vector, eltpos)
6211 = expand_normal (value);
6215 enum machine_mode value_mode =
6216 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
6217 ? TYPE_MODE (TREE_TYPE (value))
6219 bitpos = eltpos * elt_size;
6220 store_constructor_field (target, bitsize, bitpos,
6221 value_mode, value, type,
6227 emit_insn (GEN_FCN (icode)
6229 gen_rtx_PARALLEL (GET_MODE (target), vector)));
6238 /* Store the value of EXP (an expression tree)
6239 into a subfield of TARGET which has mode MODE and occupies
6240 BITSIZE bits, starting BITPOS bits from the start of TARGET.
6241 If MODE is VOIDmode, it means that we are storing into a bit-field.
6243 BITREGION_START is bitpos of the first bitfield in this region.
6244 BITREGION_END is the bitpos of the ending bitfield in this region.
6245 These two fields are 0, if the C++ memory model does not apply,
6246 or we are not interested in keeping track of bitfield regions.
6248 Always return const0_rtx unless we have something particular to
6251 TYPE is the type of the underlying object,
6253 ALIAS_SET is the alias set for the destination. This value will
6254 (in general) be different from that for TARGET, since TARGET is a
6255 reference to the containing structure.
6257 If NONTEMPORAL is true, try generating a nontemporal store. */
6260 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
6261 unsigned HOST_WIDE_INT bitregion_start,
6262 unsigned HOST_WIDE_INT bitregion_end,
6263 enum machine_mode mode, tree exp, tree type,
6264 alias_set_type alias_set, bool nontemporal)
6266 if (TREE_CODE (exp) == ERROR_MARK)
6269 /* If we have nothing to store, do nothing unless the expression has
6272 return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
6274 /* If we are storing into an unaligned field of an aligned union that is
6275 in a register, we may have the mode of TARGET being an integer mode but
6276 MODE == BLKmode. In that case, get an aligned object whose size and
6277 alignment are the same as TARGET and store TARGET into it (we can avoid
6278 the store if the field being stored is the entire width of TARGET). Then
6279 call ourselves recursively to store the field into a BLKmode version of
6280 that object. Finally, load from the object into TARGET. This is not
6281 very efficient in general, but should only be slightly more expensive
6282 than the otherwise-required unaligned accesses. Perhaps this can be
6283 cleaned up later. It's tempting to make OBJECT readonly, but it's set
6284 twice, once with emit_move_insn and once via store_field. */
6287 && (REG_P (target) || GET_CODE (target) == SUBREG))
6289 rtx object = assign_temp (type, 0, 1, 1);
6290 rtx blk_object = adjust_address (object, BLKmode, 0);
6292 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
6293 emit_move_insn (object, target);
6295 store_field (blk_object, bitsize, bitpos,
6296 bitregion_start, bitregion_end,
6297 mode, exp, type, alias_set, nontemporal);
6299 emit_move_insn (target, object);
6301 /* We want to return the BLKmode version of the data. */
6305 if (GET_CODE (target) == CONCAT)
6307 /* We're storing into a struct containing a single __complex. */
6309 gcc_assert (!bitpos);
6310 return store_expr (exp, target, 0, nontemporal);
6313 /* If the structure is in a register or if the component
6314 is a bit field, we cannot use addressing to access it.
6315 Use bit-field techniques or SUBREG to store in it. */
6317 if (mode == VOIDmode
6318 || (mode != BLKmode && ! direct_store[(int) mode]
6319 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
6320 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
6322 || GET_CODE (target) == SUBREG
6323 /* If the field isn't aligned enough to store as an ordinary memref,
6324 store it as a bit field. */
6326 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
6327 || bitpos % GET_MODE_ALIGNMENT (mode))
6328 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
6329 || (bitpos % BITS_PER_UNIT != 0)))
6330 || (bitsize >= 0 && mode != BLKmode
6331 && GET_MODE_BITSIZE (mode) > bitsize)
6332 /* If the RHS and field are a constant size and the size of the
6333 RHS isn't the same size as the bitfield, we must use bitfield
6336 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
6337 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0)
6338 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
6339 decl we must use bitfield operations. */
6341 && TREE_CODE (exp) == MEM_REF
6342 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
6343 && DECL_P (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
6344 && !TREE_ADDRESSABLE (TREE_OPERAND (TREE_OPERAND (exp, 0),0 ))
6345 && DECL_MODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) != BLKmode))
6350 /* If EXP is a NOP_EXPR of precision less than its mode, then that
6351 implies a mask operation. If the precision is the same size as
6352 the field we're storing into, that mask is redundant. This is
6353 particularly common with bit field assignments generated by the
6355 nop_def = get_def_for_expr (exp, NOP_EXPR);
6358 tree type = TREE_TYPE (exp);
6359 if (INTEGRAL_TYPE_P (type)
6360 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
6361 && bitsize == TYPE_PRECISION (type))
6363 tree op = gimple_assign_rhs1 (nop_def);
6364 type = TREE_TYPE (op);
6365 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
6370 temp = expand_normal (exp);
6372 /* If BITSIZE is narrower than the size of the type of EXP
6373 we will be narrowing TEMP. Normally, what's wanted are the
6374 low-order bits. However, if EXP's type is a record and this is
6375 big-endian machine, we want the upper BITSIZE bits. */
6376 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
6377 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
6378 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
6379 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
6380 GET_MODE_BITSIZE (GET_MODE (temp)) - bitsize,
6383 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
6385 if (mode != VOIDmode && mode != BLKmode
6386 && mode != TYPE_MODE (TREE_TYPE (exp)))
6387 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
6389 /* If the modes of TEMP and TARGET are both BLKmode, both
6390 must be in memory and BITPOS must be aligned on a byte
6391 boundary. If so, we simply do a block copy. Likewise
6392 for a BLKmode-like TARGET. */
6393 if (GET_MODE (temp) == BLKmode
6394 && (GET_MODE (target) == BLKmode
6396 && GET_MODE_CLASS (GET_MODE (target)) == MODE_INT
6397 && (bitpos % BITS_PER_UNIT) == 0
6398 && (bitsize % BITS_PER_UNIT) == 0)))
6400 gcc_assert (MEM_P (target) && MEM_P (temp)
6401 && (bitpos % BITS_PER_UNIT) == 0);
6403 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
6404 emit_block_move (target, temp,
6405 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
6412 /* Store the value in the bitfield. */
6413 store_bit_field (target, bitsize, bitpos,
6414 bitregion_start, bitregion_end,
6421 /* Now build a reference to just the desired component. */
6422 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
6424 if (to_rtx == target)
6425 to_rtx = copy_rtx (to_rtx);
6427 if (!MEM_SCALAR_P (to_rtx))
6428 MEM_IN_STRUCT_P (to_rtx) = 1;
6429 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
6430 set_mem_alias_set (to_rtx, alias_set);
6432 return store_expr (exp, to_rtx, 0, nontemporal);
6436 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
6437 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
6438 codes and find the ultimate containing object, which we return.
6440 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
6441 bit position, and *PUNSIGNEDP to the signedness of the field.
6442 If the position of the field is variable, we store a tree
6443 giving the variable offset (in units) in *POFFSET.
6444 This offset is in addition to the bit position.
6445 If the position is not variable, we store 0 in *POFFSET.
6447 If any of the extraction expressions is volatile,
6448 we store 1 in *PVOLATILEP. Otherwise we don't change that.
6450 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
6451 Otherwise, it is a mode that can be used to access the field.
6453 If the field describes a variable-sized object, *PMODE is set to
6454 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
6455 this case, but the address of the object can be found.
6457 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
6458 look through nodes that serve as markers of a greater alignment than
6459 the one that can be deduced from the expression. These nodes make it
6460 possible for front-ends to prevent temporaries from being created by
6461 the middle-end on alignment considerations. For that purpose, the
6462 normal operating mode at high-level is to always pass FALSE so that
6463 the ultimate containing object is really returned; moreover, the
6464 associated predicate handled_component_p will always return TRUE
6465 on these nodes, thus indicating that they are essentially handled
6466 by get_inner_reference. TRUE should only be passed when the caller
6467 is scanning the expression in order to build another representation
6468 and specifically knows how to handle these nodes; as such, this is
6469 the normal operating mode in the RTL expanders. */
6472 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
6473 HOST_WIDE_INT *pbitpos, tree *poffset,
6474 enum machine_mode *pmode, int *punsignedp,
6475 int *pvolatilep, bool keep_aligning)
6478 enum machine_mode mode = VOIDmode;
6479 bool blkmode_bitfield = false;
6480 tree offset = size_zero_node;
6481 double_int bit_offset = double_int_zero;
6483 /* First get the mode, signedness, and size. We do this from just the
6484 outermost expression. */
6486 if (TREE_CODE (exp) == COMPONENT_REF)
6488 tree field = TREE_OPERAND (exp, 1);
6489 size_tree = DECL_SIZE (field);
6490 if (!DECL_BIT_FIELD (field))
6491 mode = DECL_MODE (field);
6492 else if (DECL_MODE (field) == BLKmode)
6493 blkmode_bitfield = true;
6494 else if (TREE_THIS_VOLATILE (exp)
6495 && flag_strict_volatile_bitfields > 0)
6496 /* Volatile bitfields should be accessed in the mode of the
6497 field's type, not the mode computed based on the bit
6499 mode = TYPE_MODE (DECL_BIT_FIELD_TYPE (field));
6501 *punsignedp = DECL_UNSIGNED (field);
6503 else if (TREE_CODE (exp) == BIT_FIELD_REF)
6505 size_tree = TREE_OPERAND (exp, 1);
6506 *punsignedp = (! INTEGRAL_TYPE_P (TREE_TYPE (exp))
6507 || TYPE_UNSIGNED (TREE_TYPE (exp)));
6509 /* For vector types, with the correct size of access, use the mode of
6511 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == VECTOR_TYPE
6512 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))
6513 && tree_int_cst_equal (size_tree, TYPE_SIZE (TREE_TYPE (exp))))
6514 mode = TYPE_MODE (TREE_TYPE (exp));
6518 mode = TYPE_MODE (TREE_TYPE (exp));
6519 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
6521 if (mode == BLKmode)
6522 size_tree = TYPE_SIZE (TREE_TYPE (exp));
6524 *pbitsize = GET_MODE_BITSIZE (mode);
6529 if (! host_integerp (size_tree, 1))
6530 mode = BLKmode, *pbitsize = -1;
6532 *pbitsize = tree_low_cst (size_tree, 1);
6535 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6536 and find the ultimate containing object. */
6539 switch (TREE_CODE (exp))
6543 = double_int_add (bit_offset,
6544 tree_to_double_int (TREE_OPERAND (exp, 2)));
6549 tree field = TREE_OPERAND (exp, 1);
6550 tree this_offset = component_ref_field_offset (exp);
6552 /* If this field hasn't been filled in yet, don't go past it.
6553 This should only happen when folding expressions made during
6554 type construction. */
6555 if (this_offset == 0)
6558 offset = size_binop (PLUS_EXPR, offset, this_offset);
6559 bit_offset = double_int_add (bit_offset,
6561 (DECL_FIELD_BIT_OFFSET (field)));
6563 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6568 case ARRAY_RANGE_REF:
6570 tree index = TREE_OPERAND (exp, 1);
6571 tree low_bound = array_ref_low_bound (exp);
6572 tree unit_size = array_ref_element_size (exp);
6574 /* We assume all arrays have sizes that are a multiple of a byte.
6575 First subtract the lower bound, if any, in the type of the
6576 index, then convert to sizetype and multiply by the size of
6577 the array element. */
6578 if (! integer_zerop (low_bound))
6579 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
6582 offset = size_binop (PLUS_EXPR, offset,
6583 size_binop (MULT_EXPR,
6584 fold_convert (sizetype, index),
6593 bit_offset = double_int_add (bit_offset,
6594 uhwi_to_double_int (*pbitsize));
6597 case VIEW_CONVERT_EXPR:
6598 if (keep_aligning && STRICT_ALIGNMENT
6599 && (TYPE_ALIGN (TREE_TYPE (exp))
6600 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
6601 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
6602 < BIGGEST_ALIGNMENT)
6603 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
6604 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
6609 /* Hand back the decl for MEM[&decl, off]. */
6610 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)
6612 tree off = TREE_OPERAND (exp, 1);
6613 if (!integer_zerop (off))
6615 double_int boff, coff = mem_ref_offset (exp);
6616 boff = double_int_lshift (coff,
6618 ? 3 : exact_log2 (BITS_PER_UNIT),
6619 HOST_BITS_PER_DOUBLE_INT, true);
6620 bit_offset = double_int_add (bit_offset, boff);
6622 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
6630 /* If any reference in the chain is volatile, the effect is volatile. */
6631 if (TREE_THIS_VOLATILE (exp))
6634 exp = TREE_OPERAND (exp, 0);
6638 /* If OFFSET is constant, see if we can return the whole thing as a
6639 constant bit position. Make sure to handle overflow during
6641 if (TREE_CODE (offset) == INTEGER_CST)
6643 double_int tem = tree_to_double_int (offset);
6644 tem = double_int_sext (tem, TYPE_PRECISION (sizetype));
6645 tem = double_int_lshift (tem,
6647 ? 3 : exact_log2 (BITS_PER_UNIT),
6648 HOST_BITS_PER_DOUBLE_INT, true);
6649 tem = double_int_add (tem, bit_offset);
6650 if (double_int_fits_in_shwi_p (tem))
6652 *pbitpos = double_int_to_shwi (tem);
6653 *poffset = offset = NULL_TREE;
6657 /* Otherwise, split it up. */
6660 *pbitpos = double_int_to_shwi (bit_offset);
6664 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6665 if (mode == VOIDmode
6667 && (*pbitpos % BITS_PER_UNIT) == 0
6668 && (*pbitsize % BITS_PER_UNIT) == 0)
6676 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
6677 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
6678 EXP is marked as PACKED. */
6681 contains_packed_reference (const_tree exp)
6683 bool packed_p = false;
6687 switch (TREE_CODE (exp))
6691 tree field = TREE_OPERAND (exp, 1);
6692 packed_p = DECL_PACKED (field)
6693 || TYPE_PACKED (TREE_TYPE (field))
6694 || TYPE_PACKED (TREE_TYPE (exp));
6702 case ARRAY_RANGE_REF:
6705 case VIEW_CONVERT_EXPR:
6711 exp = TREE_OPERAND (exp, 0);
6717 /* Return a tree of sizetype representing the size, in bytes, of the element
6718 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6721 array_ref_element_size (tree exp)
6723 tree aligned_size = TREE_OPERAND (exp, 3);
6724 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6725 location_t loc = EXPR_LOCATION (exp);
6727 /* If a size was specified in the ARRAY_REF, it's the size measured
6728 in alignment units of the element type. So multiply by that value. */
6731 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6732 sizetype from another type of the same width and signedness. */
6733 if (TREE_TYPE (aligned_size) != sizetype)
6734 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
6735 return size_binop_loc (loc, MULT_EXPR, aligned_size,
6736 size_int (TYPE_ALIGN_UNIT (elmt_type)));
6739 /* Otherwise, take the size from that of the element type. Substitute
6740 any PLACEHOLDER_EXPR that we have. */
6742 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
6745 /* Return a tree representing the lower bound of the array mentioned in
6746 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6749 array_ref_low_bound (tree exp)
6751 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6753 /* If a lower bound is specified in EXP, use it. */
6754 if (TREE_OPERAND (exp, 2))
6755 return TREE_OPERAND (exp, 2);
6757 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6758 substituting for a PLACEHOLDER_EXPR as needed. */
6759 if (domain_type && TYPE_MIN_VALUE (domain_type))
6760 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
6762 /* Otherwise, return a zero of the appropriate type. */
6763 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
6766 /* Return a tree representing the upper bound of the array mentioned in
6767 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6770 array_ref_up_bound (tree exp)
6772 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6774 /* If there is a domain type and it has an upper bound, use it, substituting
6775 for a PLACEHOLDER_EXPR as needed. */
6776 if (domain_type && TYPE_MAX_VALUE (domain_type))
6777 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
6779 /* Otherwise fail. */
6783 /* Return a tree representing the offset, in bytes, of the field referenced
6784 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6787 component_ref_field_offset (tree exp)
6789 tree aligned_offset = TREE_OPERAND (exp, 2);
6790 tree field = TREE_OPERAND (exp, 1);
6791 location_t loc = EXPR_LOCATION (exp);
6793 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6794 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6798 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6799 sizetype from another type of the same width and signedness. */
6800 if (TREE_TYPE (aligned_offset) != sizetype)
6801 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
6802 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
6803 size_int (DECL_OFFSET_ALIGN (field)
6807 /* Otherwise, take the offset from that of the field. Substitute
6808 any PLACEHOLDER_EXPR that we have. */
6810 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
6813 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6815 static unsigned HOST_WIDE_INT
6816 target_align (const_tree target)
6818 /* We might have a chain of nested references with intermediate misaligning
6819 bitfields components, so need to recurse to find out. */
6821 unsigned HOST_WIDE_INT this_align, outer_align;
6823 switch (TREE_CODE (target))
6829 this_align = DECL_ALIGN (TREE_OPERAND (target, 1));
6830 outer_align = target_align (TREE_OPERAND (target, 0));
6831 return MIN (this_align, outer_align);
6834 case ARRAY_RANGE_REF:
6835 this_align = TYPE_ALIGN (TREE_TYPE (target));
6836 outer_align = target_align (TREE_OPERAND (target, 0));
6837 return MIN (this_align, outer_align);
6840 case NON_LVALUE_EXPR:
6841 case VIEW_CONVERT_EXPR:
6842 this_align = TYPE_ALIGN (TREE_TYPE (target));
6843 outer_align = target_align (TREE_OPERAND (target, 0));
6844 return MAX (this_align, outer_align);
6847 return TYPE_ALIGN (TREE_TYPE (target));
6852 /* Given an rtx VALUE that may contain additions and multiplications, return
6853 an equivalent value that just refers to a register, memory, or constant.
6854 This is done by generating instructions to perform the arithmetic and
6855 returning a pseudo-register containing the value.
6857 The returned value may be a REG, SUBREG, MEM or constant. */
6860 force_operand (rtx value, rtx target)
6863 /* Use subtarget as the target for operand 0 of a binary operation. */
6864 rtx subtarget = get_subtarget (target);
6865 enum rtx_code code = GET_CODE (value);
6867 /* Check for subreg applied to an expression produced by loop optimizer. */
6869 && !REG_P (SUBREG_REG (value))
6870 && !MEM_P (SUBREG_REG (value)))
6873 = simplify_gen_subreg (GET_MODE (value),
6874 force_reg (GET_MODE (SUBREG_REG (value)),
6875 force_operand (SUBREG_REG (value),
6877 GET_MODE (SUBREG_REG (value)),
6878 SUBREG_BYTE (value));
6879 code = GET_CODE (value);
6882 /* Check for a PIC address load. */
6883 if ((code == PLUS || code == MINUS)
6884 && XEXP (value, 0) == pic_offset_table_rtx
6885 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
6886 || GET_CODE (XEXP (value, 1)) == LABEL_REF
6887 || GET_CODE (XEXP (value, 1)) == CONST))
6890 subtarget = gen_reg_rtx (GET_MODE (value));
6891 emit_move_insn (subtarget, value);
6895 if (ARITHMETIC_P (value))
6897 op2 = XEXP (value, 1);
6898 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
6900 if (code == MINUS && CONST_INT_P (op2))
6903 op2 = negate_rtx (GET_MODE (value), op2);
6906 /* Check for an addition with OP2 a constant integer and our first
6907 operand a PLUS of a virtual register and something else. In that
6908 case, we want to emit the sum of the virtual register and the
6909 constant first and then add the other value. This allows virtual
6910 register instantiation to simply modify the constant rather than
6911 creating another one around this addition. */
6912 if (code == PLUS && CONST_INT_P (op2)
6913 && GET_CODE (XEXP (value, 0)) == PLUS
6914 && REG_P (XEXP (XEXP (value, 0), 0))
6915 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6916 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
6918 rtx temp = expand_simple_binop (GET_MODE (value), code,
6919 XEXP (XEXP (value, 0), 0), op2,
6920 subtarget, 0, OPTAB_LIB_WIDEN);
6921 return expand_simple_binop (GET_MODE (value), code, temp,
6922 force_operand (XEXP (XEXP (value,
6924 target, 0, OPTAB_LIB_WIDEN);
6927 op1 = force_operand (XEXP (value, 0), subtarget);
6928 op2 = force_operand (op2, NULL_RTX);
6932 return expand_mult (GET_MODE (value), op1, op2, target, 1);
6934 if (!INTEGRAL_MODE_P (GET_MODE (value)))
6935 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6936 target, 1, OPTAB_LIB_WIDEN);
6938 return expand_divmod (0,
6939 FLOAT_MODE_P (GET_MODE (value))
6940 ? RDIV_EXPR : TRUNC_DIV_EXPR,
6941 GET_MODE (value), op1, op2, target, 0);
6943 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6946 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
6949 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6952 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6953 target, 0, OPTAB_LIB_WIDEN);
6955 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6956 target, 1, OPTAB_LIB_WIDEN);
6959 if (UNARY_P (value))
6962 target = gen_reg_rtx (GET_MODE (value));
6963 op1 = force_operand (XEXP (value, 0), NULL_RTX);
6970 case FLOAT_TRUNCATE:
6971 convert_move (target, op1, code == ZERO_EXTEND);
6976 expand_fix (target, op1, code == UNSIGNED_FIX);
6980 case UNSIGNED_FLOAT:
6981 expand_float (target, op1, code == UNSIGNED_FLOAT);
6985 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
6989 #ifdef INSN_SCHEDULING
6990 /* On machines that have insn scheduling, we want all memory reference to be
6991 explicit, so we need to deal with such paradoxical SUBREGs. */
6992 if (paradoxical_subreg_p (value) && MEM_P (SUBREG_REG (value)))
6994 = simplify_gen_subreg (GET_MODE (value),
6995 force_reg (GET_MODE (SUBREG_REG (value)),
6996 force_operand (SUBREG_REG (value),
6998 GET_MODE (SUBREG_REG (value)),
6999 SUBREG_BYTE (value));
7005 /* Subroutine of expand_expr: return nonzero iff there is no way that
7006 EXP can reference X, which is being modified. TOP_P is nonzero if this
7007 call is going to be used to determine whether we need a temporary
7008 for EXP, as opposed to a recursive call to this function.
7010 It is always safe for this routine to return zero since it merely
7011 searches for optimization opportunities. */
7014 safe_from_p (const_rtx x, tree exp, int top_p)
7020 /* If EXP has varying size, we MUST use a target since we currently
7021 have no way of allocating temporaries of variable size
7022 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
7023 So we assume here that something at a higher level has prevented a
7024 clash. This is somewhat bogus, but the best we can do. Only
7025 do this when X is BLKmode and when we are at the top level. */
7026 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
7027 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
7028 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
7029 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
7030 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
7032 && GET_MODE (x) == BLKmode)
7033 /* If X is in the outgoing argument area, it is always safe. */
7035 && (XEXP (x, 0) == virtual_outgoing_args_rtx
7036 || (GET_CODE (XEXP (x, 0)) == PLUS
7037 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
7040 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
7041 find the underlying pseudo. */
7042 if (GET_CODE (x) == SUBREG)
7045 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
7049 /* Now look at our tree code and possibly recurse. */
7050 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
7052 case tcc_declaration:
7053 exp_rtl = DECL_RTL_IF_SET (exp);
7059 case tcc_exceptional:
7060 if (TREE_CODE (exp) == TREE_LIST)
7064 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
7066 exp = TREE_CHAIN (exp);
7069 if (TREE_CODE (exp) != TREE_LIST)
7070 return safe_from_p (x, exp, 0);
7073 else if (TREE_CODE (exp) == CONSTRUCTOR)
7075 constructor_elt *ce;
7076 unsigned HOST_WIDE_INT idx;
7078 FOR_EACH_VEC_ELT (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce)
7079 if ((ce->index != NULL_TREE && !safe_from_p (x, ce->index, 0))
7080 || !safe_from_p (x, ce->value, 0))
7084 else if (TREE_CODE (exp) == ERROR_MARK)
7085 return 1; /* An already-visited SAVE_EXPR? */
7090 /* The only case we look at here is the DECL_INITIAL inside a
7092 return (TREE_CODE (exp) != DECL_EXPR
7093 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
7094 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
7095 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
7098 case tcc_comparison:
7099 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
7104 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
7106 case tcc_expression:
7109 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
7110 the expression. If it is set, we conflict iff we are that rtx or
7111 both are in memory. Otherwise, we check all operands of the
7112 expression recursively. */
7114 switch (TREE_CODE (exp))
7117 /* If the operand is static or we are static, we can't conflict.
7118 Likewise if we don't conflict with the operand at all. */
7119 if (staticp (TREE_OPERAND (exp, 0))
7120 || TREE_STATIC (exp)
7121 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
7124 /* Otherwise, the only way this can conflict is if we are taking
7125 the address of a DECL a that address if part of X, which is
7127 exp = TREE_OPERAND (exp, 0);
7130 if (!DECL_RTL_SET_P (exp)
7131 || !MEM_P (DECL_RTL (exp)))
7134 exp_rtl = XEXP (DECL_RTL (exp), 0);
7140 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
7141 get_alias_set (exp)))
7146 /* Assume that the call will clobber all hard registers and
7148 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
7153 case WITH_CLEANUP_EXPR:
7154 case CLEANUP_POINT_EXPR:
7155 /* Lowered by gimplify.c. */
7159 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
7165 /* If we have an rtx, we do not need to scan our operands. */
7169 nops = TREE_OPERAND_LENGTH (exp);
7170 for (i = 0; i < nops; i++)
7171 if (TREE_OPERAND (exp, i) != 0
7172 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
7178 /* Should never get a type here. */
7182 /* If we have an rtl, find any enclosed object. Then see if we conflict
7186 if (GET_CODE (exp_rtl) == SUBREG)
7188 exp_rtl = SUBREG_REG (exp_rtl);
7190 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
7194 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
7195 are memory and they conflict. */
7196 return ! (rtx_equal_p (x, exp_rtl)
7197 || (MEM_P (x) && MEM_P (exp_rtl)
7198 && true_dependence (exp_rtl, VOIDmode, x,
7199 rtx_addr_varies_p)));
7202 /* If we reach here, it is safe. */
7207 /* Return the highest power of two that EXP is known to be a multiple of.
7208 This is used in updating alignment of MEMs in array references. */
7210 unsigned HOST_WIDE_INT
7211 highest_pow2_factor (const_tree exp)
7213 unsigned HOST_WIDE_INT c0, c1;
7215 switch (TREE_CODE (exp))
7218 /* We can find the lowest bit that's a one. If the low
7219 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
7220 We need to handle this case since we can find it in a COND_EXPR,
7221 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
7222 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
7224 if (TREE_OVERFLOW (exp))
7225 return BIGGEST_ALIGNMENT;
7228 /* Note: tree_low_cst is intentionally not used here,
7229 we don't care about the upper bits. */
7230 c0 = TREE_INT_CST_LOW (exp);
7232 return c0 ? c0 : BIGGEST_ALIGNMENT;
7236 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
7237 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
7238 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
7239 return MIN (c0, c1);
7242 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
7243 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
7246 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
7248 if (integer_pow2p (TREE_OPERAND (exp, 1))
7249 && host_integerp (TREE_OPERAND (exp, 1), 1))
7251 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
7252 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
7253 return MAX (1, c0 / c1);
7258 /* The highest power of two of a bit-and expression is the maximum of
7259 that of its operands. We typically get here for a complex LHS and
7260 a constant negative power of two on the RHS to force an explicit
7261 alignment, so don't bother looking at the LHS. */
7262 return highest_pow2_factor (TREE_OPERAND (exp, 1));
7266 return highest_pow2_factor (TREE_OPERAND (exp, 0));
7269 return highest_pow2_factor (TREE_OPERAND (exp, 1));
7272 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
7273 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
7274 return MIN (c0, c1);
7283 /* Similar, except that the alignment requirements of TARGET are
7284 taken into account. Assume it is at least as aligned as its
7285 type, unless it is a COMPONENT_REF in which case the layout of
7286 the structure gives the alignment. */
7288 static unsigned HOST_WIDE_INT
7289 highest_pow2_factor_for_target (const_tree target, const_tree exp)
7291 unsigned HOST_WIDE_INT talign = target_align (target) / BITS_PER_UNIT;
7292 unsigned HOST_WIDE_INT factor = highest_pow2_factor (exp);
7294 return MAX (factor, talign);
7297 /* Subroutine of expand_expr. Expand the two operands of a binary
7298 expression EXP0 and EXP1 placing the results in OP0 and OP1.
7299 The value may be stored in TARGET if TARGET is nonzero. The
7300 MODIFIER argument is as documented by expand_expr. */
7303 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
7304 enum expand_modifier modifier)
7306 if (! safe_from_p (target, exp1, 1))
7308 if (operand_equal_p (exp0, exp1, 0))
7310 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
7311 *op1 = copy_rtx (*op0);
7315 /* If we need to preserve evaluation order, copy exp0 into its own
7316 temporary variable so that it can't be clobbered by exp1. */
7317 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
7318 exp0 = save_expr (exp0);
7319 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
7320 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
7325 /* Return a MEM that contains constant EXP. DEFER is as for
7326 output_constant_def and MODIFIER is as for expand_expr. */
7329 expand_expr_constant (tree exp, int defer, enum expand_modifier modifier)
7333 mem = output_constant_def (exp, defer);
7334 if (modifier != EXPAND_INITIALIZER)
7335 mem = use_anchored_address (mem);
7339 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
7340 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7343 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
7344 enum expand_modifier modifier, addr_space_t as)
7346 rtx result, subtarget;
7348 HOST_WIDE_INT bitsize, bitpos;
7349 int volatilep, unsignedp;
7350 enum machine_mode mode1;
7352 /* If we are taking the address of a constant and are at the top level,
7353 we have to use output_constant_def since we can't call force_const_mem
7355 /* ??? This should be considered a front-end bug. We should not be
7356 generating ADDR_EXPR of something that isn't an LVALUE. The only
7357 exception here is STRING_CST. */
7358 if (CONSTANT_CLASS_P (exp))
7359 return XEXP (expand_expr_constant (exp, 0, modifier), 0);
7361 /* Everything must be something allowed by is_gimple_addressable. */
7362 switch (TREE_CODE (exp))
7365 /* This case will happen via recursion for &a->b. */
7366 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7370 tree tem = TREE_OPERAND (exp, 0);
7371 if (!integer_zerop (TREE_OPERAND (exp, 1)))
7372 tem = fold_build_pointer_plus (tem, TREE_OPERAND (exp, 1));
7373 return expand_expr (tem, target, tmode, modifier);
7377 /* Expand the initializer like constants above. */
7378 return XEXP (expand_expr_constant (DECL_INITIAL (exp), 0, modifier), 0);
7381 /* The real part of the complex number is always first, therefore
7382 the address is the same as the address of the parent object. */
7385 inner = TREE_OPERAND (exp, 0);
7389 /* The imaginary part of the complex number is always second.
7390 The expression is therefore always offset by the size of the
7393 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
7394 inner = TREE_OPERAND (exp, 0);
7398 /* If the object is a DECL, then expand it for its rtl. Don't bypass
7399 expand_expr, as that can have various side effects; LABEL_DECLs for
7400 example, may not have their DECL_RTL set yet. Expand the rtl of
7401 CONSTRUCTORs too, which should yield a memory reference for the
7402 constructor's contents. Assume language specific tree nodes can
7403 be expanded in some interesting way. */
7404 gcc_assert (TREE_CODE (exp) < LAST_AND_UNUSED_TREE_CODE);
7406 || TREE_CODE (exp) == CONSTRUCTOR
7407 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
7409 result = expand_expr (exp, target, tmode,
7410 modifier == EXPAND_INITIALIZER
7411 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
7413 /* If the DECL isn't in memory, then the DECL wasn't properly
7414 marked TREE_ADDRESSABLE, which will be either a front-end
7415 or a tree optimizer bug. */
7417 if (TREE_ADDRESSABLE (exp)
7419 && ! targetm.calls.allocate_stack_slots_for_args())
7421 error ("local frame unavailable (naked function?)");
7425 gcc_assert (MEM_P (result));
7426 result = XEXP (result, 0);
7428 /* ??? Is this needed anymore? */
7429 if (DECL_P (exp) && !TREE_USED (exp) == 0)
7431 assemble_external (exp);
7432 TREE_USED (exp) = 1;
7435 if (modifier != EXPAND_INITIALIZER
7436 && modifier != EXPAND_CONST_ADDRESS
7437 && modifier != EXPAND_SUM)
7438 result = force_operand (result, target);
7442 /* Pass FALSE as the last argument to get_inner_reference although
7443 we are expanding to RTL. The rationale is that we know how to
7444 handle "aligning nodes" here: we can just bypass them because
7445 they won't change the final object whose address will be returned
7446 (they actually exist only for that purpose). */
7447 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
7448 &mode1, &unsignedp, &volatilep, false);
7452 /* We must have made progress. */
7453 gcc_assert (inner != exp);
7455 subtarget = offset || bitpos ? NULL_RTX : target;
7456 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
7457 inner alignment, force the inner to be sufficiently aligned. */
7458 if (CONSTANT_CLASS_P (inner)
7459 && TYPE_ALIGN (TREE_TYPE (inner)) < TYPE_ALIGN (TREE_TYPE (exp)))
7461 inner = copy_node (inner);
7462 TREE_TYPE (inner) = copy_node (TREE_TYPE (inner));
7463 TYPE_ALIGN (TREE_TYPE (inner)) = TYPE_ALIGN (TREE_TYPE (exp));
7464 TYPE_USER_ALIGN (TREE_TYPE (inner)) = 1;
7466 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier, as);
7472 if (modifier != EXPAND_NORMAL)
7473 result = force_operand (result, NULL);
7474 tmp = expand_expr (offset, NULL_RTX, tmode,
7475 modifier == EXPAND_INITIALIZER
7476 ? EXPAND_INITIALIZER : EXPAND_NORMAL);
7478 result = convert_memory_address_addr_space (tmode, result, as);
7479 tmp = convert_memory_address_addr_space (tmode, tmp, as);
7481 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7482 result = simplify_gen_binary (PLUS, tmode, result, tmp);
7485 subtarget = bitpos ? NULL_RTX : target;
7486 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
7487 1, OPTAB_LIB_WIDEN);
7493 /* Someone beforehand should have rejected taking the address
7494 of such an object. */
7495 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
7497 result = plus_constant (result, bitpos / BITS_PER_UNIT);
7498 if (modifier < EXPAND_SUM)
7499 result = force_operand (result, target);
7505 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
7506 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7509 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
7510 enum expand_modifier modifier)
7512 addr_space_t as = ADDR_SPACE_GENERIC;
7513 enum machine_mode address_mode = Pmode;
7514 enum machine_mode pointer_mode = ptr_mode;
7515 enum machine_mode rmode;
7518 /* Target mode of VOIDmode says "whatever's natural". */
7519 if (tmode == VOIDmode)
7520 tmode = TYPE_MODE (TREE_TYPE (exp));
7522 if (POINTER_TYPE_P (TREE_TYPE (exp)))
7524 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
7525 address_mode = targetm.addr_space.address_mode (as);
7526 pointer_mode = targetm.addr_space.pointer_mode (as);
7529 /* We can get called with some Weird Things if the user does silliness
7530 like "(short) &a". In that case, convert_memory_address won't do
7531 the right thing, so ignore the given target mode. */
7532 if (tmode != address_mode && tmode != pointer_mode)
7533 tmode = address_mode;
7535 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
7536 tmode, modifier, as);
7538 /* Despite expand_expr claims concerning ignoring TMODE when not
7539 strictly convenient, stuff breaks if we don't honor it. Note
7540 that combined with the above, we only do this for pointer modes. */
7541 rmode = GET_MODE (result);
7542 if (rmode == VOIDmode)
7545 result = convert_memory_address_addr_space (tmode, result, as);
7550 /* Generate code for computing CONSTRUCTOR EXP.
7551 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7552 is TRUE, instead of creating a temporary variable in memory
7553 NULL is returned and the caller needs to handle it differently. */
7556 expand_constructor (tree exp, rtx target, enum expand_modifier modifier,
7557 bool avoid_temp_mem)
7559 tree type = TREE_TYPE (exp);
7560 enum machine_mode mode = TYPE_MODE (type);
7562 /* Try to avoid creating a temporary at all. This is possible
7563 if all of the initializer is zero.
7564 FIXME: try to handle all [0..255] initializers we can handle
7566 if (TREE_STATIC (exp)
7567 && !TREE_ADDRESSABLE (exp)
7568 && target != 0 && mode == BLKmode
7569 && all_zeros_p (exp))
7571 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
7575 /* All elts simple constants => refer to a constant in memory. But
7576 if this is a non-BLKmode mode, let it store a field at a time
7577 since that should make a CONST_INT or CONST_DOUBLE when we
7578 fold. Likewise, if we have a target we can use, it is best to
7579 store directly into the target unless the type is large enough
7580 that memcpy will be used. If we are making an initializer and
7581 all operands are constant, put it in memory as well.
7583 FIXME: Avoid trying to fill vector constructors piece-meal.
7584 Output them with output_constant_def below unless we're sure
7585 they're zeros. This should go away when vector initializers
7586 are treated like VECTOR_CST instead of arrays. */
7587 if ((TREE_STATIC (exp)
7588 && ((mode == BLKmode
7589 && ! (target != 0 && safe_from_p (target, exp, 1)))
7590 || TREE_ADDRESSABLE (exp)
7591 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7592 && (! MOVE_BY_PIECES_P
7593 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7595 && ! mostly_zeros_p (exp))))
7596 || ((modifier == EXPAND_INITIALIZER || modifier == EXPAND_CONST_ADDRESS)
7597 && TREE_CONSTANT (exp)))
7604 constructor = expand_expr_constant (exp, 1, modifier);
7606 if (modifier != EXPAND_CONST_ADDRESS
7607 && modifier != EXPAND_INITIALIZER
7608 && modifier != EXPAND_SUM)
7609 constructor = validize_mem (constructor);
7614 /* Handle calls that pass values in multiple non-contiguous
7615 locations. The Irix 6 ABI has examples of this. */
7616 if (target == 0 || ! safe_from_p (target, exp, 1)
7617 || GET_CODE (target) == PARALLEL || modifier == EXPAND_STACK_PARM)
7623 = assign_temp (build_qualified_type (type, (TYPE_QUALS (type)
7624 | (TREE_READONLY (exp)
7625 * TYPE_QUAL_CONST))),
7626 0, TREE_ADDRESSABLE (exp), 1);
7629 store_constructor (exp, target, 0, int_expr_size (exp));
7634 /* expand_expr: generate code for computing expression EXP.
7635 An rtx for the computed value is returned. The value is never null.
7636 In the case of a void EXP, const0_rtx is returned.
7638 The value may be stored in TARGET if TARGET is nonzero.
7639 TARGET is just a suggestion; callers must assume that
7640 the rtx returned may not be the same as TARGET.
7642 If TARGET is CONST0_RTX, it means that the value will be ignored.
7644 If TMODE is not VOIDmode, it suggests generating the
7645 result in mode TMODE. But this is done only when convenient.
7646 Otherwise, TMODE is ignored and the value generated in its natural mode.
7647 TMODE is just a suggestion; callers must assume that
7648 the rtx returned may not have mode TMODE.
7650 Note that TARGET may have neither TMODE nor MODE. In that case, it
7651 probably will not be used.
7653 If MODIFIER is EXPAND_SUM then when EXP is an addition
7654 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7655 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7656 products as above, or REG or MEM, or constant.
7657 Ordinarily in such cases we would output mul or add instructions
7658 and then return a pseudo reg containing the sum.
7660 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7661 it also marks a label as absolutely required (it can't be dead).
7662 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7663 This is used for outputting expressions used in initializers.
7665 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7666 with a constant address even if that address is not normally legitimate.
7667 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7669 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7670 a call parameter. Such targets require special care as we haven't yet
7671 marked TARGET so that it's safe from being trashed by libcalls. We
7672 don't want to use TARGET for anything but the final result;
7673 Intermediate values must go elsewhere. Additionally, calls to
7674 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7676 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7677 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7678 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7679 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7683 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
7684 enum expand_modifier modifier, rtx *alt_rtl)
7688 /* Handle ERROR_MARK before anybody tries to access its type. */
7689 if (TREE_CODE (exp) == ERROR_MARK
7690 || (TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK))
7692 ret = CONST0_RTX (tmode);
7693 return ret ? ret : const0_rtx;
7696 /* If this is an expression of some kind and it has an associated line
7697 number, then emit the line number before expanding the expression.
7699 We need to save and restore the file and line information so that
7700 errors discovered during expansion are emitted with the right
7701 information. It would be better of the diagnostic routines
7702 used the file/line information embedded in the tree nodes rather
7704 if (cfun && EXPR_HAS_LOCATION (exp))
7706 location_t saved_location = input_location;
7707 location_t saved_curr_loc = get_curr_insn_source_location ();
7708 tree saved_block = get_curr_insn_block ();
7709 input_location = EXPR_LOCATION (exp);
7710 set_curr_insn_source_location (input_location);
7712 /* Record where the insns produced belong. */
7713 set_curr_insn_block (TREE_BLOCK (exp));
7715 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7717 input_location = saved_location;
7718 set_curr_insn_block (saved_block);
7719 set_curr_insn_source_location (saved_curr_loc);
7723 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7730 expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
7731 enum expand_modifier modifier)
7733 rtx op0, op1, op2, temp;
7736 enum machine_mode mode;
7737 enum tree_code code = ops->code;
7739 rtx subtarget, original_target;
7741 bool reduce_bit_field;
7742 location_t loc = ops->location;
7743 tree treeop0, treeop1, treeop2;
7744 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
7745 ? reduce_to_bit_field_precision ((expr), \
7751 mode = TYPE_MODE (type);
7752 unsignedp = TYPE_UNSIGNED (type);
7758 /* We should be called only on simple (binary or unary) expressions,
7759 exactly those that are valid in gimple expressions that aren't
7760 GIMPLE_SINGLE_RHS (or invalid). */
7761 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS
7762 || get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS
7763 || get_gimple_rhs_class (code) == GIMPLE_TERNARY_RHS);
7765 ignore = (target == const0_rtx
7766 || ((CONVERT_EXPR_CODE_P (code)
7767 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
7768 && TREE_CODE (type) == VOID_TYPE));
7770 /* We should be called only if we need the result. */
7771 gcc_assert (!ignore);
7773 /* An operation in what may be a bit-field type needs the
7774 result to be reduced to the precision of the bit-field type,
7775 which is narrower than that of the type's mode. */
7776 reduce_bit_field = (INTEGRAL_TYPE_P (type)
7777 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
7779 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
7782 /* Use subtarget as the target for operand 0 of a binary operation. */
7783 subtarget = get_subtarget (target);
7784 original_target = target;
7788 case NON_LVALUE_EXPR:
7791 if (treeop0 == error_mark_node)
7794 if (TREE_CODE (type) == UNION_TYPE)
7796 tree valtype = TREE_TYPE (treeop0);
7798 /* If both input and output are BLKmode, this conversion isn't doing
7799 anything except possibly changing memory attribute. */
7800 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7802 rtx result = expand_expr (treeop0, target, tmode,
7805 result = copy_rtx (result);
7806 set_mem_attributes (result, type, 0);
7812 if (TYPE_MODE (type) != BLKmode)
7813 target = gen_reg_rtx (TYPE_MODE (type));
7815 target = assign_temp (type, 0, 1, 1);
7819 /* Store data into beginning of memory target. */
7820 store_expr (treeop0,
7821 adjust_address (target, TYPE_MODE (valtype), 0),
7822 modifier == EXPAND_STACK_PARM,
7827 gcc_assert (REG_P (target));
7829 /* Store this field into a union of the proper type. */
7830 store_field (target,
7831 MIN ((int_size_in_bytes (TREE_TYPE
7834 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7835 0, 0, 0, TYPE_MODE (valtype), treeop0,
7839 /* Return the entire union. */
7843 if (mode == TYPE_MODE (TREE_TYPE (treeop0)))
7845 op0 = expand_expr (treeop0, target, VOIDmode,
7848 /* If the signedness of the conversion differs and OP0 is
7849 a promoted SUBREG, clear that indication since we now
7850 have to do the proper extension. */
7851 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)) != unsignedp
7852 && GET_CODE (op0) == SUBREG)
7853 SUBREG_PROMOTED_VAR_P (op0) = 0;
7855 return REDUCE_BIT_FIELD (op0);
7858 op0 = expand_expr (treeop0, NULL_RTX, mode,
7859 modifier == EXPAND_SUM ? EXPAND_NORMAL : modifier);
7860 if (GET_MODE (op0) == mode)
7863 /* If OP0 is a constant, just convert it into the proper mode. */
7864 else if (CONSTANT_P (op0))
7866 tree inner_type = TREE_TYPE (treeop0);
7867 enum machine_mode inner_mode = GET_MODE (op0);
7869 if (inner_mode == VOIDmode)
7870 inner_mode = TYPE_MODE (inner_type);
7872 if (modifier == EXPAND_INITIALIZER)
7873 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7874 subreg_lowpart_offset (mode,
7877 op0= convert_modes (mode, inner_mode, op0,
7878 TYPE_UNSIGNED (inner_type));
7881 else if (modifier == EXPAND_INITIALIZER)
7882 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7884 else if (target == 0)
7885 op0 = convert_to_mode (mode, op0,
7886 TYPE_UNSIGNED (TREE_TYPE
7890 convert_move (target, op0,
7891 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7895 return REDUCE_BIT_FIELD (op0);
7897 case ADDR_SPACE_CONVERT_EXPR:
7899 tree treeop0_type = TREE_TYPE (treeop0);
7901 addr_space_t as_from;
7903 gcc_assert (POINTER_TYPE_P (type));
7904 gcc_assert (POINTER_TYPE_P (treeop0_type));
7906 as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
7907 as_from = TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type));
7909 /* Conversions between pointers to the same address space should
7910 have been implemented via CONVERT_EXPR / NOP_EXPR. */
7911 gcc_assert (as_to != as_from);
7913 /* Ask target code to handle conversion between pointers
7914 to overlapping address spaces. */
7915 if (targetm.addr_space.subset_p (as_to, as_from)
7916 || targetm.addr_space.subset_p (as_from, as_to))
7918 op0 = expand_expr (treeop0, NULL_RTX, VOIDmode, modifier);
7919 op0 = targetm.addr_space.convert (op0, treeop0_type, type);
7924 /* For disjoint address spaces, converting anything but
7925 a null pointer invokes undefined behaviour. We simply
7926 always return a null pointer here. */
7927 return CONST0_RTX (mode);
7930 case POINTER_PLUS_EXPR:
7931 /* Even though the sizetype mode and the pointer's mode can be different
7932 expand is able to handle this correctly and get the correct result out
7933 of the PLUS_EXPR code. */
7934 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
7935 if sizetype precision is smaller than pointer precision. */
7936 if (TYPE_PRECISION (sizetype) < TYPE_PRECISION (type))
7937 treeop1 = fold_convert_loc (loc, type,
7938 fold_convert_loc (loc, ssizetype,
7941 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7942 something else, make sure we add the register to the constant and
7943 then to the other thing. This case can occur during strength
7944 reduction and doing it this way will produce better code if the
7945 frame pointer or argument pointer is eliminated.
7947 fold-const.c will ensure that the constant is always in the inner
7948 PLUS_EXPR, so the only case we need to do anything about is if
7949 sp, ap, or fp is our second argument, in which case we must swap
7950 the innermost first argument and our second argument. */
7952 if (TREE_CODE (treeop0) == PLUS_EXPR
7953 && TREE_CODE (TREE_OPERAND (treeop0, 1)) == INTEGER_CST
7954 && TREE_CODE (treeop1) == VAR_DECL
7955 && (DECL_RTL (treeop1) == frame_pointer_rtx
7956 || DECL_RTL (treeop1) == stack_pointer_rtx
7957 || DECL_RTL (treeop1) == arg_pointer_rtx))
7961 treeop1 = TREE_OPERAND (treeop0, 0);
7962 TREE_OPERAND (treeop0, 0) = t;
7965 /* If the result is to be ptr_mode and we are adding an integer to
7966 something, we might be forming a constant. So try to use
7967 plus_constant. If it produces a sum and we can't accept it,
7968 use force_operand. This allows P = &ARR[const] to generate
7969 efficient code on machines where a SYMBOL_REF is not a valid
7972 If this is an EXPAND_SUM call, always return the sum. */
7973 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7974 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7976 if (modifier == EXPAND_STACK_PARM)
7978 if (TREE_CODE (treeop0) == INTEGER_CST
7979 && GET_MODE_PRECISION (mode) <= HOST_BITS_PER_WIDE_INT
7980 && TREE_CONSTANT (treeop1))
7984 op1 = expand_expr (treeop1, subtarget, VOIDmode,
7986 /* Use immed_double_const to ensure that the constant is
7987 truncated according to the mode of OP1, then sign extended
7988 to a HOST_WIDE_INT. Using the constant directly can result
7989 in non-canonical RTL in a 64x32 cross compile. */
7991 = immed_double_const (TREE_INT_CST_LOW (treeop0),
7993 TYPE_MODE (TREE_TYPE (treeop1)));
7994 op1 = plus_constant (op1, INTVAL (constant_part));
7995 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7996 op1 = force_operand (op1, target);
7997 return REDUCE_BIT_FIELD (op1);
8000 else if (TREE_CODE (treeop1) == INTEGER_CST
8001 && GET_MODE_PRECISION (mode) <= HOST_BITS_PER_WIDE_INT
8002 && TREE_CONSTANT (treeop0))
8006 op0 = expand_expr (treeop0, subtarget, VOIDmode,
8007 (modifier == EXPAND_INITIALIZER
8008 ? EXPAND_INITIALIZER : EXPAND_SUM));
8009 if (! CONSTANT_P (op0))
8011 op1 = expand_expr (treeop1, NULL_RTX,
8012 VOIDmode, modifier);
8013 /* Return a PLUS if modifier says it's OK. */
8014 if (modifier == EXPAND_SUM
8015 || modifier == EXPAND_INITIALIZER)
8016 return simplify_gen_binary (PLUS, mode, op0, op1);
8019 /* Use immed_double_const to ensure that the constant is
8020 truncated according to the mode of OP1, then sign extended
8021 to a HOST_WIDE_INT. Using the constant directly can result
8022 in non-canonical RTL in a 64x32 cross compile. */
8024 = immed_double_const (TREE_INT_CST_LOW (treeop1),
8026 TYPE_MODE (TREE_TYPE (treeop0)));
8027 op0 = plus_constant (op0, INTVAL (constant_part));
8028 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8029 op0 = force_operand (op0, target);
8030 return REDUCE_BIT_FIELD (op0);
8034 /* Use TER to expand pointer addition of a negated value
8035 as pointer subtraction. */
8036 if ((POINTER_TYPE_P (TREE_TYPE (treeop0))
8037 || (TREE_CODE (TREE_TYPE (treeop0)) == VECTOR_TYPE
8038 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0)))))
8039 && TREE_CODE (treeop1) == SSA_NAME
8040 && TYPE_MODE (TREE_TYPE (treeop0))
8041 == TYPE_MODE (TREE_TYPE (treeop1)))
8043 gimple def = get_def_for_expr (treeop1, NEGATE_EXPR);
8046 treeop1 = gimple_assign_rhs1 (def);
8052 /* No sense saving up arithmetic to be done
8053 if it's all in the wrong mode to form part of an address.
8054 And force_operand won't know whether to sign-extend or
8056 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8057 || mode != ptr_mode)
8059 expand_operands (treeop0, treeop1,
8060 subtarget, &op0, &op1, EXPAND_NORMAL);
8061 if (op0 == const0_rtx)
8063 if (op1 == const0_rtx)
8068 expand_operands (treeop0, treeop1,
8069 subtarget, &op0, &op1, modifier);
8070 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
8074 /* For initializers, we are allowed to return a MINUS of two
8075 symbolic constants. Here we handle all cases when both operands
8077 /* Handle difference of two symbolic constants,
8078 for the sake of an initializer. */
8079 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
8080 && really_constant_p (treeop0)
8081 && really_constant_p (treeop1))
8083 expand_operands (treeop0, treeop1,
8084 NULL_RTX, &op0, &op1, modifier);
8086 /* If the last operand is a CONST_INT, use plus_constant of
8087 the negated constant. Else make the MINUS. */
8088 if (CONST_INT_P (op1))
8089 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
8091 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
8094 /* No sense saving up arithmetic to be done
8095 if it's all in the wrong mode to form part of an address.
8096 And force_operand won't know whether to sign-extend or
8098 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8099 || mode != ptr_mode)
8102 expand_operands (treeop0, treeop1,
8103 subtarget, &op0, &op1, modifier);
8105 /* Convert A - const to A + (-const). */
8106 if (CONST_INT_P (op1))
8108 op1 = negate_rtx (mode, op1);
8109 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
8114 case WIDEN_MULT_PLUS_EXPR:
8115 case WIDEN_MULT_MINUS_EXPR:
8116 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8117 op2 = expand_normal (treeop2);
8118 target = expand_widen_pattern_expr (ops, op0, op1, op2,
8122 case WIDEN_MULT_EXPR:
8123 /* If first operand is constant, swap them.
8124 Thus the following special case checks need only
8125 check the second operand. */
8126 if (TREE_CODE (treeop0) == INTEGER_CST)
8133 /* First, check if we have a multiplication of one signed and one
8134 unsigned operand. */
8135 if (TREE_CODE (treeop1) != INTEGER_CST
8136 && (TYPE_UNSIGNED (TREE_TYPE (treeop0))
8137 != TYPE_UNSIGNED (TREE_TYPE (treeop1))))
8139 enum machine_mode innermode = TYPE_MODE (TREE_TYPE (treeop0));
8140 this_optab = usmul_widen_optab;
8141 if (find_widening_optab_handler (this_optab, mode, innermode, 0)
8142 != CODE_FOR_nothing)
8144 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)))
8145 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
8148 expand_operands (treeop0, treeop1, NULL_RTX, &op1, &op0,
8153 /* Check for a multiplication with matching signedness. */
8154 else if ((TREE_CODE (treeop1) == INTEGER_CST
8155 && int_fits_type_p (treeop1, TREE_TYPE (treeop0)))
8156 || (TYPE_UNSIGNED (TREE_TYPE (treeop1))
8157 == TYPE_UNSIGNED (TREE_TYPE (treeop0))))
8159 tree op0type = TREE_TYPE (treeop0);
8160 enum machine_mode innermode = TYPE_MODE (op0type);
8161 bool zextend_p = TYPE_UNSIGNED (op0type);
8162 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
8163 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
8165 if (TREE_CODE (treeop0) != INTEGER_CST)
8167 if (find_widening_optab_handler (this_optab, mode, innermode, 0)
8168 != CODE_FOR_nothing)
8170 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
8172 temp = expand_widening_mult (mode, op0, op1, target,
8173 unsignedp, this_optab);
8174 return REDUCE_BIT_FIELD (temp);
8176 if (find_widening_optab_handler (other_optab, mode, innermode, 0)
8178 && innermode == word_mode)
8181 op0 = expand_normal (treeop0);
8182 if (TREE_CODE (treeop1) == INTEGER_CST)
8183 op1 = convert_modes (innermode, mode,
8184 expand_normal (treeop1), unsignedp);
8186 op1 = expand_normal (treeop1);
8187 temp = expand_binop (mode, other_optab, op0, op1, target,
8188 unsignedp, OPTAB_LIB_WIDEN);
8189 hipart = gen_highpart (innermode, temp);
8190 htem = expand_mult_highpart_adjust (innermode, hipart,
8194 emit_move_insn (hipart, htem);
8195 return REDUCE_BIT_FIELD (temp);
8199 treeop0 = fold_build1 (CONVERT_EXPR, type, treeop0);
8200 treeop1 = fold_build1 (CONVERT_EXPR, type, treeop1);
8201 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
8202 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
8206 optab opt = fma_optab;
8209 /* If there is no insn for FMA, emit it as __builtin_fma{,f,l}
8211 if (optab_handler (fma_optab, mode) == CODE_FOR_nothing)
8213 tree fn = mathfn_built_in (TREE_TYPE (treeop0), BUILT_IN_FMA);
8216 gcc_assert (fn != NULL_TREE);
8217 call_expr = build_call_expr (fn, 3, treeop0, treeop1, treeop2);
8218 return expand_builtin (call_expr, target, subtarget, mode, false);
8221 def0 = get_def_for_expr (treeop0, NEGATE_EXPR);
8222 def2 = get_def_for_expr (treeop2, NEGATE_EXPR);
8227 && optab_handler (fnms_optab, mode) != CODE_FOR_nothing)
8230 op0 = expand_normal (gimple_assign_rhs1 (def0));
8231 op2 = expand_normal (gimple_assign_rhs1 (def2));
8234 && optab_handler (fnma_optab, mode) != CODE_FOR_nothing)
8237 op0 = expand_normal (gimple_assign_rhs1 (def0));
8240 && optab_handler (fms_optab, mode) != CODE_FOR_nothing)
8243 op2 = expand_normal (gimple_assign_rhs1 (def2));
8247 op0 = expand_expr (treeop0, subtarget, VOIDmode, EXPAND_NORMAL);
8249 op2 = expand_normal (treeop2);
8250 op1 = expand_normal (treeop1);
8252 return expand_ternary_op (TYPE_MODE (type), opt,
8253 op0, op1, op2, target, 0);
8257 /* If this is a fixed-point operation, then we cannot use the code
8258 below because "expand_mult" doesn't support sat/no-sat fixed-point
8260 if (ALL_FIXED_POINT_MODE_P (mode))
8263 /* If first operand is constant, swap them.
8264 Thus the following special case checks need only
8265 check the second operand. */
8266 if (TREE_CODE (treeop0) == INTEGER_CST)
8273 /* Attempt to return something suitable for generating an
8274 indexed address, for machines that support that. */
8276 if (modifier == EXPAND_SUM && mode == ptr_mode
8277 && host_integerp (treeop1, 0))
8279 tree exp1 = treeop1;
8281 op0 = expand_expr (treeop0, subtarget, VOIDmode,
8285 op0 = force_operand (op0, NULL_RTX);
8287 op0 = copy_to_mode_reg (mode, op0);
8289 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
8290 gen_int_mode (tree_low_cst (exp1, 0),
8291 TYPE_MODE (TREE_TYPE (exp1)))));
8294 if (modifier == EXPAND_STACK_PARM)
8297 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
8298 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
8300 case TRUNC_DIV_EXPR:
8301 case FLOOR_DIV_EXPR:
8303 case ROUND_DIV_EXPR:
8304 case EXACT_DIV_EXPR:
8305 /* If this is a fixed-point operation, then we cannot use the code
8306 below because "expand_divmod" doesn't support sat/no-sat fixed-point
8308 if (ALL_FIXED_POINT_MODE_P (mode))
8311 if (modifier == EXPAND_STACK_PARM)
8313 /* Possible optimization: compute the dividend with EXPAND_SUM
8314 then if the divisor is constant can optimize the case
8315 where some terms of the dividend have coeffs divisible by it. */
8316 expand_operands (treeop0, treeop1,
8317 subtarget, &op0, &op1, EXPAND_NORMAL);
8318 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
8323 case TRUNC_MOD_EXPR:
8324 case FLOOR_MOD_EXPR:
8326 case ROUND_MOD_EXPR:
8327 if (modifier == EXPAND_STACK_PARM)
8329 expand_operands (treeop0, treeop1,
8330 subtarget, &op0, &op1, EXPAND_NORMAL);
8331 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
8333 case FIXED_CONVERT_EXPR:
8334 op0 = expand_normal (treeop0);
8335 if (target == 0 || modifier == EXPAND_STACK_PARM)
8336 target = gen_reg_rtx (mode);
8338 if ((TREE_CODE (TREE_TYPE (treeop0)) == INTEGER_TYPE
8339 && TYPE_UNSIGNED (TREE_TYPE (treeop0)))
8340 || (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type)))
8341 expand_fixed_convert (target, op0, 1, TYPE_SATURATING (type));
8343 expand_fixed_convert (target, op0, 0, TYPE_SATURATING (type));
8346 case FIX_TRUNC_EXPR:
8347 op0 = expand_normal (treeop0);
8348 if (target == 0 || modifier == EXPAND_STACK_PARM)
8349 target = gen_reg_rtx (mode);
8350 expand_fix (target, op0, unsignedp);
8354 op0 = expand_normal (treeop0);
8355 if (target == 0 || modifier == EXPAND_STACK_PARM)
8356 target = gen_reg_rtx (mode);
8357 /* expand_float can't figure out what to do if FROM has VOIDmode.
8358 So give it the correct mode. With -O, cse will optimize this. */
8359 if (GET_MODE (op0) == VOIDmode)
8360 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0)),
8362 expand_float (target, op0,
8363 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8367 op0 = expand_expr (treeop0, subtarget,
8368 VOIDmode, EXPAND_NORMAL);
8369 if (modifier == EXPAND_STACK_PARM)
8371 temp = expand_unop (mode,
8372 optab_for_tree_code (NEGATE_EXPR, type,
8376 return REDUCE_BIT_FIELD (temp);
8379 op0 = expand_expr (treeop0, subtarget,
8380 VOIDmode, EXPAND_NORMAL);
8381 if (modifier == EXPAND_STACK_PARM)
8384 /* ABS_EXPR is not valid for complex arguments. */
8385 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
8386 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
8388 /* Unsigned abs is simply the operand. Testing here means we don't
8389 risk generating incorrect code below. */
8390 if (TYPE_UNSIGNED (type))
8393 return expand_abs (mode, op0, target, unsignedp,
8394 safe_from_p (target, treeop0, 1));
8398 target = original_target;
8400 || modifier == EXPAND_STACK_PARM
8401 || (MEM_P (target) && MEM_VOLATILE_P (target))
8402 || GET_MODE (target) != mode
8404 && REGNO (target) < FIRST_PSEUDO_REGISTER))
8405 target = gen_reg_rtx (mode);
8406 expand_operands (treeop0, treeop1,
8407 target, &op0, &op1, EXPAND_NORMAL);
8409 /* First try to do it with a special MIN or MAX instruction.
8410 If that does not win, use a conditional jump to select the proper
8412 this_optab = optab_for_tree_code (code, type, optab_default);
8413 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8418 /* At this point, a MEM target is no longer useful; we will get better
8421 if (! REG_P (target))
8422 target = gen_reg_rtx (mode);
8424 /* If op1 was placed in target, swap op0 and op1. */
8425 if (target != op0 && target == op1)
8432 /* We generate better code and avoid problems with op1 mentioning
8433 target by forcing op1 into a pseudo if it isn't a constant. */
8434 if (! CONSTANT_P (op1))
8435 op1 = force_reg (mode, op1);
8438 enum rtx_code comparison_code;
8441 if (code == MAX_EXPR)
8442 comparison_code = unsignedp ? GEU : GE;
8444 comparison_code = unsignedp ? LEU : LE;
8446 /* Canonicalize to comparisons against 0. */
8447 if (op1 == const1_rtx)
8449 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
8450 or (a != 0 ? a : 1) for unsigned.
8451 For MIN we are safe converting (a <= 1 ? a : 1)
8452 into (a <= 0 ? a : 1) */
8453 cmpop1 = const0_rtx;
8454 if (code == MAX_EXPR)
8455 comparison_code = unsignedp ? NE : GT;
8457 if (op1 == constm1_rtx && !unsignedp)
8459 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
8460 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
8461 cmpop1 = const0_rtx;
8462 if (code == MIN_EXPR)
8463 comparison_code = LT;
8465 #ifdef HAVE_conditional_move
8466 /* Use a conditional move if possible. */
8467 if (can_conditionally_move_p (mode))
8471 /* ??? Same problem as in expmed.c: emit_conditional_move
8472 forces a stack adjustment via compare_from_rtx, and we
8473 lose the stack adjustment if the sequence we are about
8474 to create is discarded. */
8475 do_pending_stack_adjust ();
8479 /* Try to emit the conditional move. */
8480 insn = emit_conditional_move (target, comparison_code,
8485 /* If we could do the conditional move, emit the sequence,
8489 rtx seq = get_insns ();
8495 /* Otherwise discard the sequence and fall back to code with
8501 emit_move_insn (target, op0);
8503 temp = gen_label_rtx ();
8504 do_compare_rtx_and_jump (target, cmpop1, comparison_code,
8505 unsignedp, mode, NULL_RTX, NULL_RTX, temp,
8508 emit_move_insn (target, op1);
8513 op0 = expand_expr (treeop0, subtarget,
8514 VOIDmode, EXPAND_NORMAL);
8515 if (modifier == EXPAND_STACK_PARM)
8517 /* In case we have to reduce the result to bitfield precision
8518 expand this as XOR with a proper constant instead. */
8519 if (reduce_bit_field)
8520 temp = expand_binop (mode, xor_optab, op0,
8521 immed_double_int_const
8522 (double_int_mask (TYPE_PRECISION (type)), mode),
8523 target, 1, OPTAB_LIB_WIDEN);
8525 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8529 /* ??? Can optimize bitwise operations with one arg constant.
8530 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8531 and (a bitwise1 b) bitwise2 b (etc)
8532 but that is probably not worth while. */
8541 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type))
8542 || (GET_MODE_PRECISION (TYPE_MODE (type))
8543 == TYPE_PRECISION (type)));
8548 /* If this is a fixed-point operation, then we cannot use the code
8549 below because "expand_shift" doesn't support sat/no-sat fixed-point
8551 if (ALL_FIXED_POINT_MODE_P (mode))
8554 if (! safe_from_p (subtarget, treeop1, 1))
8556 if (modifier == EXPAND_STACK_PARM)
8558 op0 = expand_expr (treeop0, subtarget,
8559 VOIDmode, EXPAND_NORMAL);
8560 temp = expand_variable_shift (code, mode, op0, treeop1, target,
8562 if (code == LSHIFT_EXPR)
8563 temp = REDUCE_BIT_FIELD (temp);
8566 /* Could determine the answer when only additive constants differ. Also,
8567 the addition of one can be handled by changing the condition. */
8574 case UNORDERED_EXPR:
8582 temp = do_store_flag (ops,
8583 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8584 tmode != VOIDmode ? tmode : mode);
8588 /* Use a compare and a jump for BLKmode comparisons, or for function
8589 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8592 || modifier == EXPAND_STACK_PARM
8593 || ! safe_from_p (target, treeop0, 1)
8594 || ! safe_from_p (target, treeop1, 1)
8595 /* Make sure we don't have a hard reg (such as function's return
8596 value) live across basic blocks, if not optimizing. */
8597 || (!optimize && REG_P (target)
8598 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8599 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8601 emit_move_insn (target, const0_rtx);
8603 op1 = gen_label_rtx ();
8604 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
8606 if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
8607 emit_move_insn (target, constm1_rtx);
8609 emit_move_insn (target, const1_rtx);
8615 /* Get the rtx code of the operands. */
8616 op0 = expand_normal (treeop0);
8617 op1 = expand_normal (treeop1);
8620 target = gen_reg_rtx (TYPE_MODE (type));
8622 /* Move the real (op0) and imaginary (op1) parts to their location. */
8623 write_complex_part (target, op0, false);
8624 write_complex_part (target, op1, true);
8628 case WIDEN_SUM_EXPR:
8630 tree oprnd0 = treeop0;
8631 tree oprnd1 = treeop1;
8633 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8634 target = expand_widen_pattern_expr (ops, op0, NULL_RTX, op1,
8639 case REDUC_MAX_EXPR:
8640 case REDUC_MIN_EXPR:
8641 case REDUC_PLUS_EXPR:
8643 op0 = expand_normal (treeop0);
8644 this_optab = optab_for_tree_code (code, type, optab_default);
8645 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8650 case VEC_EXTRACT_EVEN_EXPR:
8651 case VEC_EXTRACT_ODD_EXPR:
8652 case VEC_INTERLEAVE_HIGH_EXPR:
8653 case VEC_INTERLEAVE_LOW_EXPR:
8656 case VEC_LSHIFT_EXPR:
8657 case VEC_RSHIFT_EXPR:
8659 target = expand_vec_shift_expr (ops, target);
8663 case VEC_UNPACK_HI_EXPR:
8664 case VEC_UNPACK_LO_EXPR:
8666 op0 = expand_normal (treeop0);
8667 temp = expand_widen_pattern_expr (ops, op0, NULL_RTX, NULL_RTX,
8673 case VEC_UNPACK_FLOAT_HI_EXPR:
8674 case VEC_UNPACK_FLOAT_LO_EXPR:
8676 op0 = expand_normal (treeop0);
8677 /* The signedness is determined from input operand. */
8678 temp = expand_widen_pattern_expr
8679 (ops, op0, NULL_RTX, NULL_RTX,
8680 target, TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8686 case VEC_WIDEN_MULT_HI_EXPR:
8687 case VEC_WIDEN_MULT_LO_EXPR:
8689 tree oprnd0 = treeop0;
8690 tree oprnd1 = treeop1;
8692 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8693 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8695 gcc_assert (target);
8699 case VEC_WIDEN_LSHIFT_HI_EXPR:
8700 case VEC_WIDEN_LSHIFT_LO_EXPR:
8702 tree oprnd0 = treeop0;
8703 tree oprnd1 = treeop1;
8705 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8706 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8708 gcc_assert (target);
8712 case VEC_PACK_TRUNC_EXPR:
8713 case VEC_PACK_SAT_EXPR:
8714 case VEC_PACK_FIX_TRUNC_EXPR:
8715 mode = TYPE_MODE (TREE_TYPE (treeop0));
8719 expand_operands (treeop0, treeop1, target, &op0, &op1, EXPAND_NORMAL);
8720 op2 = expand_normal (treeop2);
8722 /* Careful here: if the target doesn't support integral vector modes,
8723 a constant selection vector could wind up smooshed into a normal
8724 integral constant. */
8725 if (CONSTANT_P (op2) && GET_CODE (op2) != CONST_VECTOR)
8727 tree sel_type = TREE_TYPE (treeop2);
8728 enum machine_mode vmode
8729 = mode_for_vector (TYPE_MODE (TREE_TYPE (sel_type)),
8730 TYPE_VECTOR_SUBPARTS (sel_type));
8731 gcc_assert (GET_MODE_CLASS (vmode) == MODE_VECTOR_INT);
8732 op2 = simplify_subreg (vmode, op2, TYPE_MODE (sel_type), 0);
8733 gcc_assert (op2 && GET_CODE (op2) == CONST_VECTOR);
8736 gcc_assert (GET_MODE_CLASS (GET_MODE (op2)) == MODE_VECTOR_INT);
8738 temp = expand_vec_perm (mode, op0, op1, op2, target);
8744 tree oprnd0 = treeop0;
8745 tree oprnd1 = treeop1;
8746 tree oprnd2 = treeop2;
8749 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8750 op2 = expand_normal (oprnd2);
8751 target = expand_widen_pattern_expr (ops, op0, op1, op2,
8756 case REALIGN_LOAD_EXPR:
8758 tree oprnd0 = treeop0;
8759 tree oprnd1 = treeop1;
8760 tree oprnd2 = treeop2;
8763 this_optab = optab_for_tree_code (code, type, optab_default);
8764 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8765 op2 = expand_normal (oprnd2);
8766 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
8773 /* A COND_EXPR with its type being VOID_TYPE represents a
8774 conditional jump and is handled in
8775 expand_gimple_cond_expr. */
8776 gcc_assert (!VOID_TYPE_P (type));
8778 /* Note that COND_EXPRs whose type is a structure or union
8779 are required to be constructed to contain assignments of
8780 a temporary variable, so that we can evaluate them here
8781 for side effect only. If type is void, we must do likewise. */
8783 gcc_assert (!TREE_ADDRESSABLE (type)
8785 && TREE_TYPE (treeop1) != void_type_node
8786 && TREE_TYPE (treeop2) != void_type_node);
8788 /* If we are not to produce a result, we have no target. Otherwise,
8789 if a target was specified use it; it will not be used as an
8790 intermediate target unless it is safe. If no target, use a
8793 if (modifier != EXPAND_STACK_PARM
8795 && safe_from_p (original_target, treeop0, 1)
8796 && GET_MODE (original_target) == mode
8797 #ifdef HAVE_conditional_move
8798 && (! can_conditionally_move_p (mode)
8799 || REG_P (original_target))
8801 && !MEM_P (original_target))
8802 temp = original_target;
8804 temp = assign_temp (type, 0, 0, 1);
8806 do_pending_stack_adjust ();
8808 op0 = gen_label_rtx ();
8809 op1 = gen_label_rtx ();
8810 jumpifnot (treeop0, op0, -1);
8811 store_expr (treeop1, temp,
8812 modifier == EXPAND_STACK_PARM,
8815 emit_jump_insn (gen_jump (op1));
8818 store_expr (treeop2, temp,
8819 modifier == EXPAND_STACK_PARM,
8827 target = expand_vec_cond_expr (type, treeop0, treeop1, treeop2, target);
8834 /* Here to do an ordinary binary operator. */
8836 expand_operands (treeop0, treeop1,
8837 subtarget, &op0, &op1, EXPAND_NORMAL);
8839 this_optab = optab_for_tree_code (code, type, optab_default);
8841 if (modifier == EXPAND_STACK_PARM)
8843 temp = expand_binop (mode, this_optab, op0, op1, target,
8844 unsignedp, OPTAB_LIB_WIDEN);
8846 /* Bitwise operations do not need bitfield reduction as we expect their
8847 operands being properly truncated. */
8848 if (code == BIT_XOR_EXPR
8849 || code == BIT_AND_EXPR
8850 || code == BIT_IOR_EXPR)
8852 return REDUCE_BIT_FIELD (temp);
8854 #undef REDUCE_BIT_FIELD
8857 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
8858 enum expand_modifier modifier, rtx *alt_rtl)
8860 rtx op0, op1, temp, decl_rtl;
8863 enum machine_mode mode;
8864 enum tree_code code = TREE_CODE (exp);
8865 rtx subtarget, original_target;
8868 bool reduce_bit_field;
8869 location_t loc = EXPR_LOCATION (exp);
8870 struct separate_ops ops;
8871 tree treeop0, treeop1, treeop2;
8872 tree ssa_name = NULL_TREE;
8875 type = TREE_TYPE (exp);
8876 mode = TYPE_MODE (type);
8877 unsignedp = TYPE_UNSIGNED (type);
8879 treeop0 = treeop1 = treeop2 = NULL_TREE;
8880 if (!VL_EXP_CLASS_P (exp))
8881 switch (TREE_CODE_LENGTH (code))
8884 case 3: treeop2 = TREE_OPERAND (exp, 2);
8885 case 2: treeop1 = TREE_OPERAND (exp, 1);
8886 case 1: treeop0 = TREE_OPERAND (exp, 0);
8896 ignore = (target == const0_rtx
8897 || ((CONVERT_EXPR_CODE_P (code)
8898 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
8899 && TREE_CODE (type) == VOID_TYPE));
8901 /* An operation in what may be a bit-field type needs the
8902 result to be reduced to the precision of the bit-field type,
8903 which is narrower than that of the type's mode. */
8904 reduce_bit_field = (!ignore
8905 && INTEGRAL_TYPE_P (type)
8906 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
8908 /* If we are going to ignore this result, we need only do something
8909 if there is a side-effect somewhere in the expression. If there
8910 is, short-circuit the most common cases here. Note that we must
8911 not call expand_expr with anything but const0_rtx in case this
8912 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
8916 if (! TREE_SIDE_EFFECTS (exp))
8919 /* Ensure we reference a volatile object even if value is ignored, but
8920 don't do this if all we are doing is taking its address. */
8921 if (TREE_THIS_VOLATILE (exp)
8922 && TREE_CODE (exp) != FUNCTION_DECL
8923 && mode != VOIDmode && mode != BLKmode
8924 && modifier != EXPAND_CONST_ADDRESS)
8926 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
8932 if (TREE_CODE_CLASS (code) == tcc_unary
8933 || code == COMPONENT_REF || code == INDIRECT_REF)
8934 return expand_expr (treeop0, const0_rtx, VOIDmode,
8937 else if (TREE_CODE_CLASS (code) == tcc_binary
8938 || TREE_CODE_CLASS (code) == tcc_comparison
8939 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
8941 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8942 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8945 else if (code == BIT_FIELD_REF)
8947 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8948 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8949 expand_expr (treeop2, const0_rtx, VOIDmode, modifier);
8956 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
8959 /* Use subtarget as the target for operand 0 of a binary operation. */
8960 subtarget = get_subtarget (target);
8961 original_target = target;
8967 tree function = decl_function_context (exp);
8969 temp = label_rtx (exp);
8970 temp = gen_rtx_LABEL_REF (Pmode, temp);
8972 if (function != current_function_decl
8974 LABEL_REF_NONLOCAL_P (temp) = 1;
8976 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
8981 /* ??? ivopts calls expander, without any preparation from
8982 out-of-ssa. So fake instructions as if this was an access to the
8983 base variable. This unnecessarily allocates a pseudo, see how we can
8984 reuse it, if partition base vars have it set already. */
8985 if (!currently_expanding_to_rtl)
8986 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier,
8989 g = get_gimple_for_ssa_name (exp);
8990 /* For EXPAND_INITIALIZER try harder to get something simpler. */
8992 && modifier == EXPAND_INITIALIZER
8993 && !SSA_NAME_IS_DEFAULT_DEF (exp)
8994 && (optimize || DECL_IGNORED_P (SSA_NAME_VAR (exp)))
8995 && stmt_is_replaceable_p (SSA_NAME_DEF_STMT (exp)))
8996 g = SSA_NAME_DEF_STMT (exp);
8998 return expand_expr_real (gimple_assign_rhs_to_tree (g), target, tmode,
9002 decl_rtl = get_rtx_for_ssa_name (ssa_name);
9003 exp = SSA_NAME_VAR (ssa_name);
9004 goto expand_decl_rtl;
9008 /* If a static var's type was incomplete when the decl was written,
9009 but the type is complete now, lay out the decl now. */
9010 if (DECL_SIZE (exp) == 0
9011 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
9012 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
9013 layout_decl (exp, 0);
9015 /* ... fall through ... */
9019 decl_rtl = DECL_RTL (exp);
9021 gcc_assert (decl_rtl);
9022 decl_rtl = copy_rtx (decl_rtl);
9023 /* Record writes to register variables. */
9024 if (modifier == EXPAND_WRITE
9026 && HARD_REGISTER_P (decl_rtl))
9027 add_to_hard_reg_set (&crtl->asm_clobbers,
9028 GET_MODE (decl_rtl), REGNO (decl_rtl));
9030 /* Ensure variable marked as used even if it doesn't go through
9031 a parser. If it hasn't be used yet, write out an external
9033 if (! TREE_USED (exp))
9035 assemble_external (exp);
9036 TREE_USED (exp) = 1;
9039 /* Show we haven't gotten RTL for this yet. */
9042 /* Variables inherited from containing functions should have
9043 been lowered by this point. */
9044 context = decl_function_context (exp);
9045 gcc_assert (!context
9046 || context == current_function_decl
9047 || TREE_STATIC (exp)
9048 || DECL_EXTERNAL (exp)
9049 /* ??? C++ creates functions that are not TREE_STATIC. */
9050 || TREE_CODE (exp) == FUNCTION_DECL);
9052 /* This is the case of an array whose size is to be determined
9053 from its initializer, while the initializer is still being parsed.
9056 if (MEM_P (decl_rtl) && REG_P (XEXP (decl_rtl, 0)))
9057 temp = validize_mem (decl_rtl);
9059 /* If DECL_RTL is memory, we are in the normal case and the
9060 address is not valid, get the address into a register. */
9062 else if (MEM_P (decl_rtl) && modifier != EXPAND_INITIALIZER)
9065 *alt_rtl = decl_rtl;
9066 decl_rtl = use_anchored_address (decl_rtl);
9067 if (modifier != EXPAND_CONST_ADDRESS
9068 && modifier != EXPAND_SUM
9069 && !memory_address_addr_space_p (DECL_MODE (exp),
9071 MEM_ADDR_SPACE (decl_rtl)))
9072 temp = replace_equiv_address (decl_rtl,
9073 copy_rtx (XEXP (decl_rtl, 0)));
9076 /* If we got something, return it. But first, set the alignment
9077 if the address is a register. */
9080 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
9081 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
9086 /* If the mode of DECL_RTL does not match that of the decl,
9087 there are two cases: we are dealing with a BLKmode value
9088 that is returned in a register, or we are dealing with
9089 a promoted value. In the latter case, return a SUBREG
9090 of the wanted mode, but mark it so that we know that it
9091 was already extended. */
9092 if (REG_P (decl_rtl)
9093 && DECL_MODE (exp) != BLKmode
9094 && GET_MODE (decl_rtl) != DECL_MODE (exp))
9096 enum machine_mode pmode;
9098 /* Get the signedness to be used for this variable. Ensure we get
9099 the same mode we got when the variable was declared. */
9100 if (code == SSA_NAME
9101 && (g = SSA_NAME_DEF_STMT (ssa_name))
9102 && gimple_code (g) == GIMPLE_CALL)
9104 gcc_assert (!gimple_call_internal_p (g));
9105 pmode = promote_function_mode (type, mode, &unsignedp,
9106 gimple_call_fntype (g),
9110 pmode = promote_decl_mode (exp, &unsignedp);
9111 gcc_assert (GET_MODE (decl_rtl) == pmode);
9113 temp = gen_lowpart_SUBREG (mode, decl_rtl);
9114 SUBREG_PROMOTED_VAR_P (temp) = 1;
9115 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
9122 temp = immed_double_const (TREE_INT_CST_LOW (exp),
9123 TREE_INT_CST_HIGH (exp), mode);
9129 tree tmp = NULL_TREE;
9130 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
9131 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT
9132 || GET_MODE_CLASS (mode) == MODE_VECTOR_FRACT
9133 || GET_MODE_CLASS (mode) == MODE_VECTOR_UFRACT
9134 || GET_MODE_CLASS (mode) == MODE_VECTOR_ACCUM
9135 || GET_MODE_CLASS (mode) == MODE_VECTOR_UACCUM)
9136 return const_vector_from_tree (exp);
9137 if (GET_MODE_CLASS (mode) == MODE_INT)
9139 tree type_for_mode = lang_hooks.types.type_for_mode (mode, 1);
9141 tmp = fold_unary_loc (loc, VIEW_CONVERT_EXPR, type_for_mode, exp);
9144 tmp = build_constructor_from_list (type,
9145 TREE_VECTOR_CST_ELTS (exp));
9146 return expand_expr (tmp, ignore ? const0_rtx : target,
9151 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
9154 /* If optimized, generate immediate CONST_DOUBLE
9155 which will be turned into memory by reload if necessary.
9157 We used to force a register so that loop.c could see it. But
9158 this does not allow gen_* patterns to perform optimizations with
9159 the constants. It also produces two insns in cases like "x = 1.0;".
9160 On most machines, floating-point constants are not permitted in
9161 many insns, so we'd end up copying it to a register in any case.
9163 Now, we do the copying in expand_binop, if appropriate. */
9164 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
9165 TYPE_MODE (TREE_TYPE (exp)));
9168 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp),
9169 TYPE_MODE (TREE_TYPE (exp)));
9172 /* Handle evaluating a complex constant in a CONCAT target. */
9173 if (original_target && GET_CODE (original_target) == CONCAT)
9175 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
9178 rtarg = XEXP (original_target, 0);
9179 itarg = XEXP (original_target, 1);
9181 /* Move the real and imaginary parts separately. */
9182 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, EXPAND_NORMAL);
9183 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, EXPAND_NORMAL);
9186 emit_move_insn (rtarg, op0);
9188 emit_move_insn (itarg, op1);
9190 return original_target;
9193 /* ... fall through ... */
9196 temp = expand_expr_constant (exp, 1, modifier);
9198 /* temp contains a constant address.
9199 On RISC machines where a constant address isn't valid,
9200 make some insns to get that address into a register. */
9201 if (modifier != EXPAND_CONST_ADDRESS
9202 && modifier != EXPAND_INITIALIZER
9203 && modifier != EXPAND_SUM
9204 && ! memory_address_addr_space_p (mode, XEXP (temp, 0),
9205 MEM_ADDR_SPACE (temp)))
9206 return replace_equiv_address (temp,
9207 copy_rtx (XEXP (temp, 0)));
9213 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
9215 if (!SAVE_EXPR_RESOLVED_P (exp))
9217 /* We can indeed still hit this case, typically via builtin
9218 expanders calling save_expr immediately before expanding
9219 something. Assume this means that we only have to deal
9220 with non-BLKmode values. */
9221 gcc_assert (GET_MODE (ret) != BLKmode);
9223 val = build_decl (EXPR_LOCATION (exp),
9224 VAR_DECL, NULL, TREE_TYPE (exp));
9225 DECL_ARTIFICIAL (val) = 1;
9226 DECL_IGNORED_P (val) = 1;
9228 TREE_OPERAND (exp, 0) = treeop0;
9229 SAVE_EXPR_RESOLVED_P (exp) = 1;
9231 if (!CONSTANT_P (ret))
9232 ret = copy_to_reg (ret);
9233 SET_DECL_RTL (val, ret);
9241 /* If we don't need the result, just ensure we evaluate any
9245 unsigned HOST_WIDE_INT idx;
9248 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
9249 expand_expr (value, const0_rtx, VOIDmode, EXPAND_NORMAL);
9254 return expand_constructor (exp, target, modifier, false);
9256 case TARGET_MEM_REF:
9258 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (exp));
9259 struct mem_address addr;
9260 enum insn_code icode;
9263 get_address_description (exp, &addr);
9264 op0 = addr_for_mem_ref (&addr, as, true);
9265 op0 = memory_address_addr_space (mode, op0, as);
9266 temp = gen_rtx_MEM (mode, op0);
9267 set_mem_attributes (temp, exp, 0);
9268 set_mem_addr_space (temp, as);
9269 align = get_object_or_type_alignment (exp);
9271 && align < GET_MODE_ALIGNMENT (mode)
9272 /* If the target does not have special handling for unaligned
9273 loads of mode then it can use regular moves for them. */
9274 && ((icode = optab_handler (movmisalign_optab, mode))
9275 != CODE_FOR_nothing))
9277 struct expand_operand ops[2];
9279 /* We've already validated the memory, and we're creating a
9280 new pseudo destination. The predicates really can't fail,
9281 nor can the generator. */
9282 create_output_operand (&ops[0], NULL_RTX, mode);
9283 create_fixed_operand (&ops[1], temp);
9284 expand_insn (icode, 2, ops);
9285 return ops[0].value;
9293 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))));
9294 enum machine_mode address_mode;
9295 tree base = TREE_OPERAND (exp, 0);
9297 enum insn_code icode;
9299 /* Handle expansion of non-aliased memory with non-BLKmode. That
9300 might end up in a register. */
9301 if (TREE_CODE (base) == ADDR_EXPR)
9303 HOST_WIDE_INT offset = mem_ref_offset (exp).low;
9305 base = TREE_OPERAND (base, 0);
9309 base = get_addr_base_and_unit_offset (base, &off);
9313 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
9314 decl we must use bitfield operations. */
9316 && !TREE_ADDRESSABLE (base)
9317 && DECL_MODE (base) != BLKmode
9318 && DECL_RTL_SET_P (base)
9319 && !MEM_P (DECL_RTL (base)))
9323 && host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)
9324 && (GET_MODE_BITSIZE (DECL_MODE (base))
9325 == TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp)))))
9326 return expand_expr (build1 (VIEW_CONVERT_EXPR,
9327 TREE_TYPE (exp), base),
9328 target, tmode, modifier);
9329 bit_offset = bitsize_int (offset * BITS_PER_UNIT);
9330 bftype = TREE_TYPE (base);
9331 if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode)
9332 bftype = TREE_TYPE (exp);
9333 return expand_expr (build3 (BIT_FIELD_REF, bftype,
9335 TYPE_SIZE (TREE_TYPE (exp)),
9337 target, tmode, modifier);
9340 address_mode = targetm.addr_space.address_mode (as);
9341 base = TREE_OPERAND (exp, 0);
9342 if ((def_stmt = get_def_for_expr (base, BIT_AND_EXPR)))
9344 tree mask = gimple_assign_rhs2 (def_stmt);
9345 base = build2 (BIT_AND_EXPR, TREE_TYPE (base),
9346 gimple_assign_rhs1 (def_stmt), mask);
9347 TREE_OPERAND (exp, 0) = base;
9349 align = get_object_or_type_alignment (exp);
9350 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_SUM);
9351 op0 = memory_address_addr_space (address_mode, op0, as);
9352 if (!integer_zerop (TREE_OPERAND (exp, 1)))
9355 = immed_double_int_const (mem_ref_offset (exp), address_mode);
9356 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
9358 op0 = memory_address_addr_space (mode, op0, as);
9359 temp = gen_rtx_MEM (mode, op0);
9360 set_mem_attributes (temp, exp, 0);
9361 set_mem_addr_space (temp, as);
9362 if (TREE_THIS_VOLATILE (exp))
9363 MEM_VOLATILE_P (temp) = 1;
9365 && align < GET_MODE_ALIGNMENT (mode)
9366 /* If the target does not have special handling for unaligned
9367 loads of mode then it can use regular moves for them. */
9368 && ((icode = optab_handler (movmisalign_optab, mode))
9369 != CODE_FOR_nothing))
9371 struct expand_operand ops[2];
9373 /* We've already validated the memory, and we're creating a
9374 new pseudo destination. The predicates really can't fail,
9375 nor can the generator. */
9376 create_output_operand (&ops[0], NULL_RTX, mode);
9377 create_fixed_operand (&ops[1], temp);
9378 expand_insn (icode, 2, ops);
9379 return ops[0].value;
9387 tree array = treeop0;
9388 tree index = treeop1;
9390 /* Fold an expression like: "foo"[2].
9391 This is not done in fold so it won't happen inside &.
9392 Don't fold if this is for wide characters since it's too
9393 difficult to do correctly and this is a very rare case. */
9395 if (modifier != EXPAND_CONST_ADDRESS
9396 && modifier != EXPAND_INITIALIZER
9397 && modifier != EXPAND_MEMORY)
9399 tree t = fold_read_from_constant_string (exp);
9402 return expand_expr (t, target, tmode, modifier);
9405 /* If this is a constant index into a constant array,
9406 just get the value from the array. Handle both the cases when
9407 we have an explicit constructor and when our operand is a variable
9408 that was declared const. */
9410 if (modifier != EXPAND_CONST_ADDRESS
9411 && modifier != EXPAND_INITIALIZER
9412 && modifier != EXPAND_MEMORY
9413 && TREE_CODE (array) == CONSTRUCTOR
9414 && ! TREE_SIDE_EFFECTS (array)
9415 && TREE_CODE (index) == INTEGER_CST)
9417 unsigned HOST_WIDE_INT ix;
9420 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array), ix,
9422 if (tree_int_cst_equal (field, index))
9424 if (!TREE_SIDE_EFFECTS (value))
9425 return expand_expr (fold (value), target, tmode, modifier);
9430 else if (optimize >= 1
9431 && modifier != EXPAND_CONST_ADDRESS
9432 && modifier != EXPAND_INITIALIZER
9433 && modifier != EXPAND_MEMORY
9434 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
9435 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
9436 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
9437 && const_value_known_p (array))
9439 if (TREE_CODE (index) == INTEGER_CST)
9441 tree init = DECL_INITIAL (array);
9443 if (TREE_CODE (init) == CONSTRUCTOR)
9445 unsigned HOST_WIDE_INT ix;
9448 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), ix,
9450 if (tree_int_cst_equal (field, index))
9452 if (TREE_SIDE_EFFECTS (value))
9455 if (TREE_CODE (value) == CONSTRUCTOR)
9457 /* If VALUE is a CONSTRUCTOR, this
9458 optimization is only useful if
9459 this doesn't store the CONSTRUCTOR
9460 into memory. If it does, it is more
9461 efficient to just load the data from
9462 the array directly. */
9463 rtx ret = expand_constructor (value, target,
9465 if (ret == NULL_RTX)
9469 return expand_expr (fold (value), target, tmode,
9473 else if(TREE_CODE (init) == STRING_CST)
9475 tree index1 = index;
9476 tree low_bound = array_ref_low_bound (exp);
9477 index1 = fold_convert_loc (loc, sizetype,
9480 /* Optimize the special-case of a zero lower bound.
9482 We convert the low_bound to sizetype to avoid some problems
9483 with constant folding. (E.g. suppose the lower bound is 1,
9484 and its mode is QI. Without the conversion,l (ARRAY
9485 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
9486 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
9488 if (! integer_zerop (low_bound))
9489 index1 = size_diffop_loc (loc, index1,
9490 fold_convert_loc (loc, sizetype,
9493 if (0 > compare_tree_int (index1,
9494 TREE_STRING_LENGTH (init)))
9496 tree type = TREE_TYPE (TREE_TYPE (init));
9497 enum machine_mode mode = TYPE_MODE (type);
9499 if (GET_MODE_CLASS (mode) == MODE_INT
9500 && GET_MODE_SIZE (mode) == 1)
9501 return gen_int_mode (TREE_STRING_POINTER (init)
9502 [TREE_INT_CST_LOW (index1)],
9509 goto normal_inner_ref;
9512 /* If the operand is a CONSTRUCTOR, we can just extract the
9513 appropriate field if it is present. */
9514 if (TREE_CODE (treeop0) == CONSTRUCTOR)
9516 unsigned HOST_WIDE_INT idx;
9519 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0),
9521 if (field == treeop1
9522 /* We can normally use the value of the field in the
9523 CONSTRUCTOR. However, if this is a bitfield in
9524 an integral mode that we can fit in a HOST_WIDE_INT,
9525 we must mask only the number of bits in the bitfield,
9526 since this is done implicitly by the constructor. If
9527 the bitfield does not meet either of those conditions,
9528 we can't do this optimization. */
9529 && (! DECL_BIT_FIELD (field)
9530 || ((GET_MODE_CLASS (DECL_MODE (field)) == MODE_INT)
9531 && (GET_MODE_PRECISION (DECL_MODE (field))
9532 <= HOST_BITS_PER_WIDE_INT))))
9534 if (DECL_BIT_FIELD (field)
9535 && modifier == EXPAND_STACK_PARM)
9537 op0 = expand_expr (value, target, tmode, modifier);
9538 if (DECL_BIT_FIELD (field))
9540 HOST_WIDE_INT bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
9541 enum machine_mode imode = TYPE_MODE (TREE_TYPE (field));
9543 if (TYPE_UNSIGNED (TREE_TYPE (field)))
9545 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
9546 op0 = expand_and (imode, op0, op1, target);
9550 int count = GET_MODE_PRECISION (imode) - bitsize;
9552 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
9554 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
9562 goto normal_inner_ref;
9565 case ARRAY_RANGE_REF:
9568 enum machine_mode mode1, mode2;
9569 HOST_WIDE_INT bitsize, bitpos;
9571 int volatilep = 0, must_force_mem;
9572 bool packedp = false;
9573 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
9574 &mode1, &unsignedp, &volatilep, true);
9575 rtx orig_op0, memloc;
9577 /* If we got back the original object, something is wrong. Perhaps
9578 we are evaluating an expression too early. In any event, don't
9579 infinitely recurse. */
9580 gcc_assert (tem != exp);
9582 if (TYPE_PACKED (TREE_TYPE (TREE_OPERAND (exp, 0)))
9583 || (TREE_CODE (TREE_OPERAND (exp, 1)) == FIELD_DECL
9584 && DECL_PACKED (TREE_OPERAND (exp, 1))))
9587 /* If TEM's type is a union of variable size, pass TARGET to the inner
9588 computation, since it will need a temporary and TARGET is known
9589 to have to do. This occurs in unchecked conversion in Ada. */
9592 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9593 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9595 && modifier != EXPAND_STACK_PARM
9596 ? target : NULL_RTX),
9598 (modifier == EXPAND_INITIALIZER
9599 || modifier == EXPAND_CONST_ADDRESS
9600 || modifier == EXPAND_STACK_PARM)
9601 ? modifier : EXPAND_NORMAL);
9604 /* If the bitfield is volatile, we want to access it in the
9605 field's mode, not the computed mode.
9606 If a MEM has VOIDmode (external with incomplete type),
9607 use BLKmode for it instead. */
9610 if (volatilep && flag_strict_volatile_bitfields > 0)
9611 op0 = adjust_address (op0, mode1, 0);
9612 else if (GET_MODE (op0) == VOIDmode)
9613 op0 = adjust_address (op0, BLKmode, 0);
9617 = CONSTANT_P (op0) ? TYPE_MODE (TREE_TYPE (tem)) : GET_MODE (op0);
9619 /* If we have either an offset, a BLKmode result, or a reference
9620 outside the underlying object, we must force it to memory.
9621 Such a case can occur in Ada if we have unchecked conversion
9622 of an expression from a scalar type to an aggregate type or
9623 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
9624 passed a partially uninitialized object or a view-conversion
9625 to a larger size. */
9626 must_force_mem = (offset
9628 || bitpos + bitsize > GET_MODE_BITSIZE (mode2));
9630 /* Handle CONCAT first. */
9631 if (GET_CODE (op0) == CONCAT && !must_force_mem)
9634 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
9637 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9640 op0 = XEXP (op0, 0);
9641 mode2 = GET_MODE (op0);
9643 else if (bitpos == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9644 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 1)))
9648 op0 = XEXP (op0, 1);
9650 mode2 = GET_MODE (op0);
9653 /* Otherwise force into memory. */
9657 /* If this is a constant, put it in a register if it is a legitimate
9658 constant and we don't need a memory reference. */
9659 if (CONSTANT_P (op0)
9661 && targetm.legitimate_constant_p (mode2, op0)
9663 op0 = force_reg (mode2, op0);
9665 /* Otherwise, if this is a constant, try to force it to the constant
9666 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9667 is a legitimate constant. */
9668 else if (CONSTANT_P (op0) && (memloc = force_const_mem (mode2, op0)))
9669 op0 = validize_mem (memloc);
9671 /* Otherwise, if this is a constant or the object is not in memory
9672 and need be, put it there. */
9673 else if (CONSTANT_P (op0) || (!MEM_P (op0) && must_force_mem))
9675 tree nt = build_qualified_type (TREE_TYPE (tem),
9676 (TYPE_QUALS (TREE_TYPE (tem))
9677 | TYPE_QUAL_CONST));
9678 memloc = assign_temp (nt, 1, 1, 1);
9679 emit_move_insn (memloc, op0);
9685 enum machine_mode address_mode;
9686 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
9689 gcc_assert (MEM_P (op0));
9692 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (op0));
9693 if (GET_MODE (offset_rtx) != address_mode)
9694 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
9696 if (GET_MODE (op0) == BLKmode
9697 /* A constant address in OP0 can have VOIDmode, we must
9698 not try to call force_reg in that case. */
9699 && GET_MODE (XEXP (op0, 0)) != VOIDmode
9701 && (bitpos % bitsize) == 0
9702 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
9703 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
9705 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9709 op0 = offset_address (op0, offset_rtx,
9710 highest_pow2_factor (offset));
9713 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9714 record its alignment as BIGGEST_ALIGNMENT. */
9715 if (MEM_P (op0) && bitpos == 0 && offset != 0
9716 && is_aligning_offset (offset, tem))
9717 set_mem_align (op0, BIGGEST_ALIGNMENT);
9719 /* Don't forget about volatility even if this is a bitfield. */
9720 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
9722 if (op0 == orig_op0)
9723 op0 = copy_rtx (op0);
9725 MEM_VOLATILE_P (op0) = 1;
9728 /* In cases where an aligned union has an unaligned object
9729 as a field, we might be extracting a BLKmode value from
9730 an integer-mode (e.g., SImode) object. Handle this case
9731 by doing the extract into an object as wide as the field
9732 (which we know to be the width of a basic mode), then
9733 storing into memory, and changing the mode to BLKmode. */
9734 if (mode1 == VOIDmode
9735 || REG_P (op0) || GET_CODE (op0) == SUBREG
9736 || (mode1 != BLKmode && ! direct_load[(int) mode1]
9737 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
9738 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
9739 && modifier != EXPAND_CONST_ADDRESS
9740 && modifier != EXPAND_INITIALIZER)
9741 /* If the field is volatile, we always want an aligned
9742 access. Do this in following two situations:
9743 1. the access is not already naturally
9744 aligned, otherwise "normal" (non-bitfield) volatile fields
9745 become non-addressable.
9746 2. the bitsize is narrower than the access size. Need
9747 to extract bitfields from the access. */
9748 || (volatilep && flag_strict_volatile_bitfields > 0
9749 && (bitpos % GET_MODE_ALIGNMENT (mode) != 0
9750 || (mode1 != BLKmode
9751 && bitsize < GET_MODE_SIZE (mode1) * BITS_PER_UNIT)))
9752 /* If the field isn't aligned enough to fetch as a memref,
9753 fetch it as a bit field. */
9754 || (mode1 != BLKmode
9755 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
9756 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
9758 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
9759 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
9760 && ((modifier == EXPAND_CONST_ADDRESS
9761 || modifier == EXPAND_INITIALIZER)
9763 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
9764 || (bitpos % BITS_PER_UNIT != 0)))
9765 /* If the type and the field are a constant size and the
9766 size of the type isn't the same size as the bitfield,
9767 we must use bitfield operations. */
9769 && TYPE_SIZE (TREE_TYPE (exp))
9770 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9771 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
9774 enum machine_mode ext_mode = mode;
9776 if (ext_mode == BLKmode
9777 && ! (target != 0 && MEM_P (op0)
9779 && bitpos % BITS_PER_UNIT == 0))
9780 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
9782 if (ext_mode == BLKmode)
9785 target = assign_temp (type, 0, 1, 1);
9790 /* In this case, BITPOS must start at a byte boundary and
9791 TARGET, if specified, must be a MEM. */
9792 gcc_assert (MEM_P (op0)
9793 && (!target || MEM_P (target))
9794 && !(bitpos % BITS_PER_UNIT));
9796 emit_block_move (target,
9797 adjust_address (op0, VOIDmode,
9798 bitpos / BITS_PER_UNIT),
9799 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
9801 (modifier == EXPAND_STACK_PARM
9802 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9807 op0 = validize_mem (op0);
9809 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
9810 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9812 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp, packedp,
9813 (modifier == EXPAND_STACK_PARM
9814 ? NULL_RTX : target),
9815 ext_mode, ext_mode);
9817 /* If the result is a record type and BITSIZE is narrower than
9818 the mode of OP0, an integral mode, and this is a big endian
9819 machine, we must put the field into the high-order bits. */
9820 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
9821 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
9822 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
9823 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
9824 GET_MODE_BITSIZE (GET_MODE (op0))
9827 /* If the result type is BLKmode, store the data into a temporary
9828 of the appropriate type, but with the mode corresponding to the
9829 mode for the data we have (op0's mode). It's tempting to make
9830 this a constant type, since we know it's only being stored once,
9831 but that can cause problems if we are taking the address of this
9832 COMPONENT_REF because the MEM of any reference via that address
9833 will have flags corresponding to the type, which will not
9834 necessarily be constant. */
9835 if (mode == BLKmode)
9837 HOST_WIDE_INT size = GET_MODE_BITSIZE (ext_mode);
9840 /* If the reference doesn't use the alias set of its type,
9841 we cannot create the temporary using that type. */
9842 if (component_uses_parent_alias_set (exp))
9844 new_rtx = assign_stack_local (ext_mode, size, 0);
9845 set_mem_alias_set (new_rtx, get_alias_set (exp));
9848 new_rtx = assign_stack_temp_for_type (ext_mode, size, 0, type);
9850 emit_move_insn (new_rtx, op0);
9851 op0 = copy_rtx (new_rtx);
9852 PUT_MODE (op0, BLKmode);
9853 set_mem_attributes (op0, exp, 1);
9859 /* If the result is BLKmode, use that to access the object
9861 if (mode == BLKmode)
9864 /* Get a reference to just this component. */
9865 if (modifier == EXPAND_CONST_ADDRESS
9866 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
9867 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
9869 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9871 if (op0 == orig_op0)
9872 op0 = copy_rtx (op0);
9874 set_mem_attributes (op0, exp, 0);
9875 if (REG_P (XEXP (op0, 0)))
9876 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9878 MEM_VOLATILE_P (op0) |= volatilep;
9879 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
9880 || modifier == EXPAND_CONST_ADDRESS
9881 || modifier == EXPAND_INITIALIZER)
9883 else if (target == 0)
9884 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9886 convert_move (target, op0, unsignedp);
9891 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
9894 /* All valid uses of __builtin_va_arg_pack () are removed during
9896 if (CALL_EXPR_VA_ARG_PACK (exp))
9897 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
9899 tree fndecl = get_callee_fndecl (exp), attr;
9902 && (attr = lookup_attribute ("error",
9903 DECL_ATTRIBUTES (fndecl))) != NULL)
9904 error ("%Kcall to %qs declared with attribute error: %s",
9905 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9906 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9908 && (attr = lookup_attribute ("warning",
9909 DECL_ATTRIBUTES (fndecl))) != NULL)
9910 warning_at (tree_nonartificial_location (exp),
9911 0, "%Kcall to %qs declared with attribute warning: %s",
9912 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9913 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9915 /* Check for a built-in function. */
9916 if (fndecl && DECL_BUILT_IN (fndecl))
9918 gcc_assert (DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_FRONTEND);
9919 return expand_builtin (exp, target, subtarget, tmode, ignore);
9922 return expand_call (exp, target, ignore);
9924 case VIEW_CONVERT_EXPR:
9927 /* If we are converting to BLKmode, try to avoid an intermediate
9928 temporary by fetching an inner memory reference. */
9930 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9931 && TYPE_MODE (TREE_TYPE (treeop0)) != BLKmode
9932 && handled_component_p (treeop0))
9934 enum machine_mode mode1;
9935 HOST_WIDE_INT bitsize, bitpos;
9940 = get_inner_reference (treeop0, &bitsize, &bitpos,
9941 &offset, &mode1, &unsignedp, &volatilep,
9945 /* ??? We should work harder and deal with non-zero offsets. */
9947 && (bitpos % BITS_PER_UNIT) == 0
9949 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) == 0)
9951 /* See the normal_inner_ref case for the rationale. */
9954 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9955 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9957 && modifier != EXPAND_STACK_PARM
9958 ? target : NULL_RTX),
9960 (modifier == EXPAND_INITIALIZER
9961 || modifier == EXPAND_CONST_ADDRESS
9962 || modifier == EXPAND_STACK_PARM)
9963 ? modifier : EXPAND_NORMAL);
9965 if (MEM_P (orig_op0))
9969 /* Get a reference to just this component. */
9970 if (modifier == EXPAND_CONST_ADDRESS
9971 || modifier == EXPAND_SUM
9972 || modifier == EXPAND_INITIALIZER)
9973 op0 = adjust_address_nv (op0, mode, bitpos / BITS_PER_UNIT);
9975 op0 = adjust_address (op0, mode, bitpos / BITS_PER_UNIT);
9977 if (op0 == orig_op0)
9978 op0 = copy_rtx (op0);
9980 set_mem_attributes (op0, treeop0, 0);
9981 if (REG_P (XEXP (op0, 0)))
9982 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9984 MEM_VOLATILE_P (op0) |= volatilep;
9990 op0 = expand_expr (treeop0,
9991 NULL_RTX, VOIDmode, modifier);
9993 /* If the input and output modes are both the same, we are done. */
9994 if (mode == GET_MODE (op0))
9996 /* If neither mode is BLKmode, and both modes are the same size
9997 then we can use gen_lowpart. */
9998 else if (mode != BLKmode && GET_MODE (op0) != BLKmode
9999 && (GET_MODE_PRECISION (mode)
10000 == GET_MODE_PRECISION (GET_MODE (op0)))
10001 && !COMPLEX_MODE_P (GET_MODE (op0)))
10003 if (GET_CODE (op0) == SUBREG)
10004 op0 = force_reg (GET_MODE (op0), op0);
10005 temp = gen_lowpart_common (mode, op0);
10010 if (!REG_P (op0) && !MEM_P (op0))
10011 op0 = force_reg (GET_MODE (op0), op0);
10012 op0 = gen_lowpart (mode, op0);
10015 /* If both types are integral, convert from one mode to the other. */
10016 else if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (TREE_TYPE (treeop0)))
10017 op0 = convert_modes (mode, GET_MODE (op0), op0,
10018 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
10019 /* As a last resort, spill op0 to memory, and reload it in a
10021 else if (!MEM_P (op0))
10023 /* If the operand is not a MEM, force it into memory. Since we
10024 are going to be changing the mode of the MEM, don't call
10025 force_const_mem for constants because we don't allow pool
10026 constants to change mode. */
10027 tree inner_type = TREE_TYPE (treeop0);
10029 gcc_assert (!TREE_ADDRESSABLE (exp));
10031 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
10033 = assign_stack_temp_for_type
10034 (TYPE_MODE (inner_type),
10035 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
10037 emit_move_insn (target, op0);
10041 /* At this point, OP0 is in the correct mode. If the output type is
10042 such that the operand is known to be aligned, indicate that it is.
10043 Otherwise, we need only be concerned about alignment for non-BLKmode
10047 op0 = copy_rtx (op0);
10049 if (TYPE_ALIGN_OK (type))
10050 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
10051 else if (STRICT_ALIGNMENT
10053 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode))
10055 tree inner_type = TREE_TYPE (treeop0);
10056 HOST_WIDE_INT temp_size
10057 = MAX (int_size_in_bytes (inner_type),
10058 (HOST_WIDE_INT) GET_MODE_SIZE (mode));
10060 = assign_stack_temp_for_type (mode, temp_size, 0, type);
10061 rtx new_with_op0_mode
10062 = adjust_address (new_rtx, GET_MODE (op0), 0);
10064 gcc_assert (!TREE_ADDRESSABLE (exp));
10066 if (GET_MODE (op0) == BLKmode)
10067 emit_block_move (new_with_op0_mode, op0,
10068 GEN_INT (GET_MODE_SIZE (mode)),
10069 (modifier == EXPAND_STACK_PARM
10070 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
10072 emit_move_insn (new_with_op0_mode, op0);
10077 op0 = adjust_address (op0, mode, 0);
10084 tree lhs = treeop0;
10085 tree rhs = treeop1;
10086 gcc_assert (ignore);
10088 /* Check for |= or &= of a bitfield of size one into another bitfield
10089 of size 1. In this case, (unless we need the result of the
10090 assignment) we can do this more efficiently with a
10091 test followed by an assignment, if necessary.
10093 ??? At this point, we can't get a BIT_FIELD_REF here. But if
10094 things change so we do, this code should be enhanced to
10096 if (TREE_CODE (lhs) == COMPONENT_REF
10097 && (TREE_CODE (rhs) == BIT_IOR_EXPR
10098 || TREE_CODE (rhs) == BIT_AND_EXPR)
10099 && TREE_OPERAND (rhs, 0) == lhs
10100 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
10101 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
10102 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
10104 rtx label = gen_label_rtx ();
10105 int value = TREE_CODE (rhs) == BIT_IOR_EXPR;
10106 do_jump (TREE_OPERAND (rhs, 1),
10108 value ? 0 : label, -1);
10109 expand_assignment (lhs, build_int_cst (TREE_TYPE (rhs), value),
10110 MOVE_NONTEMPORAL (exp));
10111 do_pending_stack_adjust ();
10112 emit_label (label);
10116 expand_assignment (lhs, rhs, MOVE_NONTEMPORAL (exp));
10121 return expand_expr_addr_expr (exp, target, tmode, modifier);
10123 case REALPART_EXPR:
10124 op0 = expand_normal (treeop0);
10125 return read_complex_part (op0, false);
10127 case IMAGPART_EXPR:
10128 op0 = expand_normal (treeop0);
10129 return read_complex_part (op0, true);
10136 /* Expanded in cfgexpand.c. */
10137 gcc_unreachable ();
10139 case TRY_CATCH_EXPR:
10141 case EH_FILTER_EXPR:
10142 case TRY_FINALLY_EXPR:
10143 /* Lowered by tree-eh.c. */
10144 gcc_unreachable ();
10146 case WITH_CLEANUP_EXPR:
10147 case CLEANUP_POINT_EXPR:
10149 case CASE_LABEL_EXPR:
10154 case COMPOUND_EXPR:
10155 case PREINCREMENT_EXPR:
10156 case PREDECREMENT_EXPR:
10157 case POSTINCREMENT_EXPR:
10158 case POSTDECREMENT_EXPR:
10161 /* Lowered by gimplify.c. */
10162 gcc_unreachable ();
10165 /* Function descriptors are not valid except for as
10166 initialization constants, and should not be expanded. */
10167 gcc_unreachable ();
10169 case WITH_SIZE_EXPR:
10170 /* WITH_SIZE_EXPR expands to its first argument. The caller should
10171 have pulled out the size to use in whatever context it needed. */
10172 return expand_expr_real (treeop0, original_target, tmode,
10173 modifier, alt_rtl);
10175 case COMPOUND_LITERAL_EXPR:
10177 /* Initialize the anonymous variable declared in the compound
10178 literal, then return the variable. */
10179 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
10181 /* Create RTL for this variable. */
10182 if (!DECL_RTL_SET_P (decl))
10184 if (DECL_HARD_REGISTER (decl))
10185 /* The user specified an assembler name for this variable.
10186 Set that up now. */
10187 rest_of_decl_compilation (decl, 0, 0);
10189 expand_decl (decl);
10192 return expand_expr_real (decl, original_target, tmode,
10193 modifier, alt_rtl);
10197 return expand_expr_real_2 (&ops, target, tmode, modifier);
10201 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
10202 signedness of TYPE), possibly returning the result in TARGET. */
10204 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
10206 HOST_WIDE_INT prec = TYPE_PRECISION (type);
10207 if (target && GET_MODE (target) != GET_MODE (exp))
10209 /* For constant values, reduce using build_int_cst_type. */
10210 if (CONST_INT_P (exp))
10212 HOST_WIDE_INT value = INTVAL (exp);
10213 tree t = build_int_cst_type (type, value);
10214 return expand_expr (t, target, VOIDmode, EXPAND_NORMAL);
10216 else if (TYPE_UNSIGNED (type))
10218 rtx mask = immed_double_int_const (double_int_mask (prec),
10220 return expand_and (GET_MODE (exp), exp, mask, target);
10224 int count = GET_MODE_PRECISION (GET_MODE (exp)) - prec;
10225 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp),
10226 exp, count, target, 0);
10227 return expand_shift (RSHIFT_EXPR, GET_MODE (exp),
10228 exp, count, target, 0);
10232 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
10233 when applied to the address of EXP produces an address known to be
10234 aligned more than BIGGEST_ALIGNMENT. */
10237 is_aligning_offset (const_tree offset, const_tree exp)
10239 /* Strip off any conversions. */
10240 while (CONVERT_EXPR_P (offset))
10241 offset = TREE_OPERAND (offset, 0);
10243 /* We must now have a BIT_AND_EXPR with a constant that is one less than
10244 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
10245 if (TREE_CODE (offset) != BIT_AND_EXPR
10246 || !host_integerp (TREE_OPERAND (offset, 1), 1)
10247 || compare_tree_int (TREE_OPERAND (offset, 1),
10248 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
10249 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
10252 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
10253 It must be NEGATE_EXPR. Then strip any more conversions. */
10254 offset = TREE_OPERAND (offset, 0);
10255 while (CONVERT_EXPR_P (offset))
10256 offset = TREE_OPERAND (offset, 0);
10258 if (TREE_CODE (offset) != NEGATE_EXPR)
10261 offset = TREE_OPERAND (offset, 0);
10262 while (CONVERT_EXPR_P (offset))
10263 offset = TREE_OPERAND (offset, 0);
10265 /* This must now be the address of EXP. */
10266 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
10269 /* Return the tree node if an ARG corresponds to a string constant or zero
10270 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
10271 in bytes within the string that ARG is accessing. The type of the
10272 offset will be `sizetype'. */
10275 string_constant (tree arg, tree *ptr_offset)
10277 tree array, offset, lower_bound;
10280 if (TREE_CODE (arg) == ADDR_EXPR)
10282 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
10284 *ptr_offset = size_zero_node;
10285 return TREE_OPERAND (arg, 0);
10287 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
10289 array = TREE_OPERAND (arg, 0);
10290 offset = size_zero_node;
10292 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
10294 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
10295 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
10296 if (TREE_CODE (array) != STRING_CST
10297 && TREE_CODE (array) != VAR_DECL)
10300 /* Check if the array has a nonzero lower bound. */
10301 lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
10302 if (!integer_zerop (lower_bound))
10304 /* If the offset and base aren't both constants, return 0. */
10305 if (TREE_CODE (lower_bound) != INTEGER_CST)
10307 if (TREE_CODE (offset) != INTEGER_CST)
10309 /* Adjust offset by the lower bound. */
10310 offset = size_diffop (fold_convert (sizetype, offset),
10311 fold_convert (sizetype, lower_bound));
10314 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == MEM_REF)
10316 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
10317 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
10318 if (TREE_CODE (array) != ADDR_EXPR)
10320 array = TREE_OPERAND (array, 0);
10321 if (TREE_CODE (array) != STRING_CST
10322 && TREE_CODE (array) != VAR_DECL)
10328 else if (TREE_CODE (arg) == PLUS_EXPR || TREE_CODE (arg) == POINTER_PLUS_EXPR)
10330 tree arg0 = TREE_OPERAND (arg, 0);
10331 tree arg1 = TREE_OPERAND (arg, 1);
10336 if (TREE_CODE (arg0) == ADDR_EXPR
10337 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
10338 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
10340 array = TREE_OPERAND (arg0, 0);
10343 else if (TREE_CODE (arg1) == ADDR_EXPR
10344 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
10345 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
10347 array = TREE_OPERAND (arg1, 0);
10356 if (TREE_CODE (array) == STRING_CST)
10358 *ptr_offset = fold_convert (sizetype, offset);
10361 else if (TREE_CODE (array) == VAR_DECL
10362 || TREE_CODE (array) == CONST_DECL)
10366 /* Variables initialized to string literals can be handled too. */
10367 if (!const_value_known_p (array)
10368 || !DECL_INITIAL (array)
10369 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
10372 /* Avoid const char foo[4] = "abcde"; */
10373 if (DECL_SIZE_UNIT (array) == NULL_TREE
10374 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
10375 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
10376 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
10379 /* If variable is bigger than the string literal, OFFSET must be constant
10380 and inside of the bounds of the string literal. */
10381 offset = fold_convert (sizetype, offset);
10382 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
10383 && (! host_integerp (offset, 1)
10384 || compare_tree_int (offset, length) >= 0))
10387 *ptr_offset = offset;
10388 return DECL_INITIAL (array);
10394 /* Generate code to calculate OPS, and exploded expression
10395 using a store-flag instruction and return an rtx for the result.
10396 OPS reflects a comparison.
10398 If TARGET is nonzero, store the result there if convenient.
10400 Return zero if there is no suitable set-flag instruction
10401 available on this machine.
10403 Once expand_expr has been called on the arguments of the comparison,
10404 we are committed to doing the store flag, since it is not safe to
10405 re-evaluate the expression. We emit the store-flag insn by calling
10406 emit_store_flag, but only expand the arguments if we have a reason
10407 to believe that emit_store_flag will be successful. If we think that
10408 it will, but it isn't, we have to simulate the store-flag with a
10409 set/jump/set sequence. */
10412 do_store_flag (sepops ops, rtx target, enum machine_mode mode)
10414 enum rtx_code code;
10415 tree arg0, arg1, type;
10417 enum machine_mode operand_mode;
10420 rtx subtarget = target;
10421 location_t loc = ops->location;
10426 /* Don't crash if the comparison was erroneous. */
10427 if (arg0 == error_mark_node || arg1 == error_mark_node)
10430 type = TREE_TYPE (arg0);
10431 operand_mode = TYPE_MODE (type);
10432 unsignedp = TYPE_UNSIGNED (type);
10434 /* We won't bother with BLKmode store-flag operations because it would mean
10435 passing a lot of information to emit_store_flag. */
10436 if (operand_mode == BLKmode)
10439 /* We won't bother with store-flag operations involving function pointers
10440 when function pointers must be canonicalized before comparisons. */
10441 #ifdef HAVE_canonicalize_funcptr_for_compare
10442 if (HAVE_canonicalize_funcptr_for_compare
10443 && ((TREE_CODE (TREE_TYPE (arg0)) == POINTER_TYPE
10444 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0)))
10446 || (TREE_CODE (TREE_TYPE (arg1)) == POINTER_TYPE
10447 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1)))
10448 == FUNCTION_TYPE))))
10455 /* For vector typed comparisons emit code to generate the desired
10456 all-ones or all-zeros mask. Conveniently use the VEC_COND_EXPR
10457 expander for this. */
10458 if (TREE_CODE (ops->type) == VECTOR_TYPE)
10460 tree ifexp = build2 (ops->code, ops->type, arg0, arg1);
10461 tree if_true = constant_boolean_node (true, ops->type);
10462 tree if_false = constant_boolean_node (false, ops->type);
10463 return expand_vec_cond_expr (ops->type, ifexp, if_true, if_false, target);
10466 /* For vector typed comparisons emit code to generate the desired
10467 all-ones or all-zeros mask. Conveniently use the VEC_COND_EXPR
10468 expander for this. */
10469 if (TREE_CODE (ops->type) == VECTOR_TYPE)
10471 tree ifexp = build2 (ops->code, ops->type, arg0, arg1);
10472 tree if_true = constant_boolean_node (true, ops->type);
10473 tree if_false = constant_boolean_node (false, ops->type);
10474 return expand_vec_cond_expr (ops->type, ifexp, if_true, if_false, target);
10477 /* Get the rtx comparison code to use. We know that EXP is a comparison
10478 operation of some type. Some comparisons against 1 and -1 can be
10479 converted to comparisons with zero. Do so here so that the tests
10480 below will be aware that we have a comparison with zero. These
10481 tests will not catch constants in the first operand, but constants
10482 are rarely passed as the first operand. */
10493 if (integer_onep (arg1))
10494 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
10496 code = unsignedp ? LTU : LT;
10499 if (! unsignedp && integer_all_onesp (arg1))
10500 arg1 = integer_zero_node, code = LT;
10502 code = unsignedp ? LEU : LE;
10505 if (! unsignedp && integer_all_onesp (arg1))
10506 arg1 = integer_zero_node, code = GE;
10508 code = unsignedp ? GTU : GT;
10511 if (integer_onep (arg1))
10512 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10514 code = unsignedp ? GEU : GE;
10517 case UNORDERED_EXPR:
10543 gcc_unreachable ();
10546 /* Put a constant second. */
10547 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST
10548 || TREE_CODE (arg0) == FIXED_CST)
10550 tem = arg0; arg0 = arg1; arg1 = tem;
10551 code = swap_condition (code);
10554 /* If this is an equality or inequality test of a single bit, we can
10555 do this by shifting the bit being tested to the low-order bit and
10556 masking the result with the constant 1. If the condition was EQ,
10557 we xor it with 1. This does not require an scc insn and is faster
10558 than an scc insn even if we have it.
10560 The code to make this transformation was moved into fold_single_bit_test,
10561 so we just call into the folder and expand its result. */
10563 if ((code == NE || code == EQ)
10564 && integer_zerop (arg1)
10565 && (TYPE_PRECISION (ops->type) != 1 || TYPE_UNSIGNED (ops->type)))
10567 gimple srcstmt = get_def_for_expr (arg0, BIT_AND_EXPR);
10569 && integer_pow2p (gimple_assign_rhs2 (srcstmt)))
10571 enum tree_code tcode = code == NE ? NE_EXPR : EQ_EXPR;
10572 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
10573 tree temp = fold_build2_loc (loc, BIT_AND_EXPR, TREE_TYPE (arg1),
10574 gimple_assign_rhs1 (srcstmt),
10575 gimple_assign_rhs2 (srcstmt));
10576 temp = fold_single_bit_test (loc, tcode, temp, arg1, type);
10578 return expand_expr (temp, target, VOIDmode, EXPAND_NORMAL);
10582 if (! get_subtarget (target)
10583 || GET_MODE (subtarget) != operand_mode)
10586 expand_operands (arg0, arg1, subtarget, &op0, &op1, EXPAND_NORMAL);
10589 target = gen_reg_rtx (mode);
10591 /* Try a cstore if possible. */
10592 return emit_store_flag_force (target, code, op0, op1,
10593 operand_mode, unsignedp,
10594 (TYPE_PRECISION (ops->type) == 1
10595 && !TYPE_UNSIGNED (ops->type)) ? -1 : 1);
10599 /* Stubs in case we haven't got a casesi insn. */
10600 #ifndef HAVE_casesi
10601 # define HAVE_casesi 0
10602 # define gen_casesi(a, b, c, d, e) (0)
10603 # define CODE_FOR_casesi CODE_FOR_nothing
10606 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10607 0 otherwise (i.e. if there is no casesi instruction). */
10609 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
10610 rtx table_label ATTRIBUTE_UNUSED, rtx default_label,
10611 rtx fallback_label ATTRIBUTE_UNUSED)
10613 struct expand_operand ops[5];
10614 enum machine_mode index_mode = SImode;
10615 int index_bits = GET_MODE_BITSIZE (index_mode);
10616 rtx op1, op2, index;
10621 /* Convert the index to SImode. */
10622 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10624 enum machine_mode omode = TYPE_MODE (index_type);
10625 rtx rangertx = expand_normal (range);
10627 /* We must handle the endpoints in the original mode. */
10628 index_expr = build2 (MINUS_EXPR, index_type,
10629 index_expr, minval);
10630 minval = integer_zero_node;
10631 index = expand_normal (index_expr);
10633 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10634 omode, 1, default_label);
10635 /* Now we can safely truncate. */
10636 index = convert_to_mode (index_mode, index, 0);
10640 if (TYPE_MODE (index_type) != index_mode)
10642 index_type = lang_hooks.types.type_for_size (index_bits, 0);
10643 index_expr = fold_convert (index_type, index_expr);
10646 index = expand_normal (index_expr);
10649 do_pending_stack_adjust ();
10651 op1 = expand_normal (minval);
10652 op2 = expand_normal (range);
10654 create_input_operand (&ops[0], index, index_mode);
10655 create_convert_operand_from_type (&ops[1], op1, TREE_TYPE (minval));
10656 create_convert_operand_from_type (&ops[2], op2, TREE_TYPE (range));
10657 create_fixed_operand (&ops[3], table_label);
10658 create_fixed_operand (&ops[4], (default_label
10660 : fallback_label));
10661 expand_jump_insn (CODE_FOR_casesi, 5, ops);
10665 /* Attempt to generate a tablejump instruction; same concept. */
10666 #ifndef HAVE_tablejump
10667 #define HAVE_tablejump 0
10668 #define gen_tablejump(x, y) (0)
10671 /* Subroutine of the next function.
10673 INDEX is the value being switched on, with the lowest value
10674 in the table already subtracted.
10675 MODE is its expected mode (needed if INDEX is constant).
10676 RANGE is the length of the jump table.
10677 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10679 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10680 index value is out of range. */
10683 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
10688 if (INTVAL (range) > cfun->cfg->max_jumptable_ents)
10689 cfun->cfg->max_jumptable_ents = INTVAL (range);
10691 /* Do an unsigned comparison (in the proper mode) between the index
10692 expression and the value which represents the length of the range.
10693 Since we just finished subtracting the lower bound of the range
10694 from the index expression, this comparison allows us to simultaneously
10695 check that the original index expression value is both greater than
10696 or equal to the minimum value of the range and less than or equal to
10697 the maximum value of the range. */
10700 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10703 /* If index is in range, it must fit in Pmode.
10704 Convert to Pmode so we can index with it. */
10706 index = convert_to_mode (Pmode, index, 1);
10708 /* Don't let a MEM slip through, because then INDEX that comes
10709 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10710 and break_out_memory_refs will go to work on it and mess it up. */
10711 #ifdef PIC_CASE_VECTOR_ADDRESS
10712 if (flag_pic && !REG_P (index))
10713 index = copy_to_mode_reg (Pmode, index);
10716 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10717 GET_MODE_SIZE, because this indicates how large insns are. The other
10718 uses should all be Pmode, because they are addresses. This code
10719 could fail if addresses and insns are not the same size. */
10720 index = gen_rtx_PLUS (Pmode,
10721 gen_rtx_MULT (Pmode, index,
10722 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10723 gen_rtx_LABEL_REF (Pmode, table_label));
10724 #ifdef PIC_CASE_VECTOR_ADDRESS
10726 index = PIC_CASE_VECTOR_ADDRESS (index);
10729 index = memory_address (CASE_VECTOR_MODE, index);
10730 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10731 vector = gen_const_mem (CASE_VECTOR_MODE, index);
10732 convert_move (temp, vector, 0);
10734 emit_jump_insn (gen_tablejump (temp, table_label));
10736 /* If we are generating PIC code or if the table is PC-relative, the
10737 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10738 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10743 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
10744 rtx table_label, rtx default_label)
10748 if (! HAVE_tablejump)
10751 index_expr = fold_build2 (MINUS_EXPR, index_type,
10752 fold_convert (index_type, index_expr),
10753 fold_convert (index_type, minval));
10754 index = expand_normal (index_expr);
10755 do_pending_stack_adjust ();
10757 do_tablejump (index, TYPE_MODE (index_type),
10758 convert_modes (TYPE_MODE (index_type),
10759 TYPE_MODE (TREE_TYPE (range)),
10760 expand_normal (range),
10761 TYPE_UNSIGNED (TREE_TYPE (range))),
10762 table_label, default_label);
10766 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10768 const_vector_from_tree (tree exp)
10773 enum machine_mode inner, mode;
10775 mode = TYPE_MODE (TREE_TYPE (exp));
10777 if (initializer_zerop (exp))
10778 return CONST0_RTX (mode);
10780 units = GET_MODE_NUNITS (mode);
10781 inner = GET_MODE_INNER (mode);
10783 v = rtvec_alloc (units);
10785 link = TREE_VECTOR_CST_ELTS (exp);
10786 for (i = 0; link; link = TREE_CHAIN (link), ++i)
10788 elt = TREE_VALUE (link);
10790 if (TREE_CODE (elt) == REAL_CST)
10791 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
10793 else if (TREE_CODE (elt) == FIXED_CST)
10794 RTVEC_ELT (v, i) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt),
10797 RTVEC_ELT (v, i) = immed_double_int_const (tree_to_double_int (elt),
10801 /* Initialize remaining elements to 0. */
10802 for (; i < units; ++i)
10803 RTVEC_ELT (v, i) = CONST0_RTX (inner);
10805 return gen_rtx_CONST_VECTOR (mode, v);
10808 /* Build a decl for a personality function given a language prefix. */
10811 build_personality_function (const char *lang)
10813 const char *unwind_and_version;
10817 switch (targetm_common.except_unwind_info (&global_options))
10822 unwind_and_version = "_sj0";
10826 unwind_and_version = "_v0";
10829 gcc_unreachable ();
10832 name = ACONCAT (("__", lang, "_personality", unwind_and_version, NULL));
10834 type = build_function_type_list (integer_type_node, integer_type_node,
10835 long_long_unsigned_type_node,
10836 ptr_type_node, ptr_type_node, NULL_TREE);
10837 decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
10838 get_identifier (name), type);
10839 DECL_ARTIFICIAL (decl) = 1;
10840 DECL_EXTERNAL (decl) = 1;
10841 TREE_PUBLIC (decl) = 1;
10843 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
10844 are the flags assigned by targetm.encode_section_info. */
10845 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl), 0), NULL);
10850 /* Extracts the personality function of DECL and returns the corresponding
10854 get_personality_function (tree decl)
10856 tree personality = DECL_FUNCTION_PERSONALITY (decl);
10857 enum eh_personality_kind pk;
10859 pk = function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl));
10860 if (pk == eh_personality_none)
10864 && pk == eh_personality_any)
10865 personality = lang_hooks.eh_personality ();
10867 if (pk == eh_personality_lang)
10868 gcc_assert (personality != NULL_TREE);
10870 return XEXP (DECL_RTL (personality), 0);
10873 #include "gt-expr.h"