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"
59 /* Decide whether a function's arguments should be processed
60 from first to last or from last to first.
62 They should if the stack and args grow in opposite directions, but
63 only if we have push insns. */
67 #ifndef PUSH_ARGS_REVERSED
68 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
69 #define PUSH_ARGS_REVERSED /* If it's last to first. */
75 #ifndef STACK_PUSH_CODE
76 #ifdef STACK_GROWS_DOWNWARD
77 #define STACK_PUSH_CODE PRE_DEC
79 #define STACK_PUSH_CODE PRE_INC
84 /* If this is nonzero, we do not bother generating VOLATILE
85 around volatile memory references, and we are willing to
86 output indirect addresses. If cse is to follow, we reject
87 indirect addresses so a useful potential cse is generated;
88 if it is used only once, instruction combination will produce
89 the same indirect address eventually. */
92 /* This structure is used by move_by_pieces to describe the move to
94 struct move_by_pieces_d
103 int explicit_inc_from;
104 unsigned HOST_WIDE_INT len;
105 HOST_WIDE_INT offset;
109 /* This structure is used by store_by_pieces to describe the clear to
112 struct store_by_pieces_d
118 unsigned HOST_WIDE_INT len;
119 HOST_WIDE_INT offset;
120 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode);
125 static unsigned HOST_WIDE_INT move_by_pieces_ninsns (unsigned HOST_WIDE_INT,
128 static void move_by_pieces_1 (rtx (*) (rtx, ...), enum machine_mode,
129 struct move_by_pieces_d *);
130 static bool block_move_libcall_safe_for_call_parm (void);
131 static bool emit_block_move_via_movmem (rtx, rtx, rtx, unsigned, unsigned, HOST_WIDE_INT);
132 static tree emit_block_move_libcall_fn (int);
133 static void emit_block_move_via_loop (rtx, rtx, rtx, unsigned);
134 static rtx clear_by_pieces_1 (void *, HOST_WIDE_INT, enum machine_mode);
135 static void clear_by_pieces (rtx, unsigned HOST_WIDE_INT, unsigned int);
136 static void store_by_pieces_1 (struct store_by_pieces_d *, unsigned int);
137 static void store_by_pieces_2 (rtx (*) (rtx, ...), enum machine_mode,
138 struct store_by_pieces_d *);
139 static tree clear_storage_libcall_fn (int);
140 static rtx compress_float_constant (rtx, rtx);
141 static rtx get_subtarget (rtx);
142 static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
143 HOST_WIDE_INT, enum machine_mode,
144 tree, tree, int, alias_set_type);
145 static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
146 static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT, enum machine_mode,
147 tree, tree, alias_set_type, bool);
149 static unsigned HOST_WIDE_INT highest_pow2_factor_for_target (const_tree, const_tree);
151 static int is_aligning_offset (const_tree, const_tree);
152 static void expand_operands (tree, tree, rtx, rtx*, rtx*,
153 enum expand_modifier);
154 static rtx reduce_to_bit_field_precision (rtx, rtx, tree);
155 static rtx do_store_flag (sepops, rtx, enum machine_mode);
157 static void emit_single_push_insn (enum machine_mode, rtx, tree);
159 static void do_tablejump (rtx, enum machine_mode, rtx, rtx, rtx);
160 static rtx const_vector_from_tree (tree);
161 static void write_complex_part (rtx, rtx, bool);
163 /* This macro is used to determine whether move_by_pieces should be called
164 to perform a structure copy. */
165 #ifndef MOVE_BY_PIECES_P
166 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
167 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
168 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
171 /* This macro is used to determine whether clear_by_pieces should be
172 called to clear storage. */
173 #ifndef CLEAR_BY_PIECES_P
174 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
175 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
176 < (unsigned int) CLEAR_RATIO (optimize_insn_for_speed_p ()))
179 /* This macro is used to determine whether store_by_pieces should be
180 called to "memset" storage with byte values other than zero. */
181 #ifndef SET_BY_PIECES_P
182 #define SET_BY_PIECES_P(SIZE, ALIGN) \
183 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
184 < (unsigned int) SET_RATIO (optimize_insn_for_speed_p ()))
187 /* This macro is used to determine whether store_by_pieces should be
188 called to "memcpy" storage when the source is a constant string. */
189 #ifndef STORE_BY_PIECES_P
190 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
191 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
192 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
195 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
197 #ifndef SLOW_UNALIGNED_ACCESS
198 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
201 /* This is run to set up which modes can be used
202 directly in memory and to initialize the block move optab. It is run
203 at the beginning of compilation and when the target is reinitialized. */
206 init_expr_target (void)
209 enum machine_mode mode;
214 /* Try indexing by frame ptr and try by stack ptr.
215 It is known that on the Convex the stack ptr isn't a valid index.
216 With luck, one or the other is valid on any machine. */
217 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
218 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
220 /* A scratch register we can modify in-place below to avoid
221 useless RTL allocations. */
222 reg = gen_rtx_REG (VOIDmode, -1);
224 insn = rtx_alloc (INSN);
225 pat = gen_rtx_SET (VOIDmode, NULL_RTX, NULL_RTX);
226 PATTERN (insn) = pat;
228 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
229 mode = (enum machine_mode) ((int) mode + 1))
233 direct_load[(int) mode] = direct_store[(int) mode] = 0;
234 PUT_MODE (mem, mode);
235 PUT_MODE (mem1, mode);
236 PUT_MODE (reg, mode);
238 /* See if there is some register that can be used in this mode and
239 directly loaded or stored from memory. */
241 if (mode != VOIDmode && mode != BLKmode)
242 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
243 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
246 if (! HARD_REGNO_MODE_OK (regno, mode))
249 SET_REGNO (reg, regno);
252 SET_DEST (pat) = reg;
253 if (recog (pat, insn, &num_clobbers) >= 0)
254 direct_load[(int) mode] = 1;
256 SET_SRC (pat) = mem1;
257 SET_DEST (pat) = reg;
258 if (recog (pat, insn, &num_clobbers) >= 0)
259 direct_load[(int) mode] = 1;
262 SET_DEST (pat) = mem;
263 if (recog (pat, insn, &num_clobbers) >= 0)
264 direct_store[(int) mode] = 1;
267 SET_DEST (pat) = mem1;
268 if (recog (pat, insn, &num_clobbers) >= 0)
269 direct_store[(int) mode] = 1;
273 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
275 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
276 mode = GET_MODE_WIDER_MODE (mode))
278 enum machine_mode srcmode;
279 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
280 srcmode = GET_MODE_WIDER_MODE (srcmode))
284 ic = can_extend_p (mode, srcmode, 0);
285 if (ic == CODE_FOR_nothing)
288 PUT_MODE (mem, srcmode);
290 if (insn_operand_matches (ic, 1, mem))
291 float_extend_from_mem[mode][srcmode] = true;
296 /* This is run at the start of compiling a function. */
301 memset (&crtl->expr, 0, sizeof (crtl->expr));
304 /* Copy data from FROM to TO, where the machine modes are not the same.
305 Both modes may be integer, or both may be floating, or both may be
307 UNSIGNEDP should be nonzero if FROM is an unsigned type.
308 This causes zero-extension instead of sign-extension. */
311 convert_move (rtx to, rtx from, int unsignedp)
313 enum machine_mode to_mode = GET_MODE (to);
314 enum machine_mode from_mode = GET_MODE (from);
315 int to_real = SCALAR_FLOAT_MODE_P (to_mode);
316 int from_real = SCALAR_FLOAT_MODE_P (from_mode);
320 /* rtx code for making an equivalent value. */
321 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
322 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
325 gcc_assert (to_real == from_real);
326 gcc_assert (to_mode != BLKmode);
327 gcc_assert (from_mode != BLKmode);
329 /* If the source and destination are already the same, then there's
334 /* If FROM is a SUBREG that indicates that we have already done at least
335 the required extension, strip it. We don't handle such SUBREGs as
338 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
339 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
340 >= GET_MODE_SIZE (to_mode))
341 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
342 from = gen_lowpart (to_mode, from), from_mode = to_mode;
344 gcc_assert (GET_CODE (to) != SUBREG || !SUBREG_PROMOTED_VAR_P (to));
346 if (to_mode == from_mode
347 || (from_mode == VOIDmode && CONSTANT_P (from)))
349 emit_move_insn (to, from);
353 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
355 gcc_assert (GET_MODE_BITSIZE (from_mode) == GET_MODE_BITSIZE (to_mode));
357 if (VECTOR_MODE_P (to_mode))
358 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
360 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
362 emit_move_insn (to, from);
366 if (GET_CODE (to) == CONCAT && GET_CODE (from) == CONCAT)
368 convert_move (XEXP (to, 0), XEXP (from, 0), unsignedp);
369 convert_move (XEXP (to, 1), XEXP (from, 1), unsignedp);
378 gcc_assert ((GET_MODE_PRECISION (from_mode)
379 != GET_MODE_PRECISION (to_mode))
380 || (DECIMAL_FLOAT_MODE_P (from_mode)
381 != DECIMAL_FLOAT_MODE_P (to_mode)));
383 if (GET_MODE_PRECISION (from_mode) == GET_MODE_PRECISION (to_mode))
384 /* Conversion between decimal float and binary float, same size. */
385 tab = DECIMAL_FLOAT_MODE_P (from_mode) ? trunc_optab : sext_optab;
386 else if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode))
391 /* Try converting directly if the insn is supported. */
393 code = convert_optab_handler (tab, to_mode, from_mode);
394 if (code != CODE_FOR_nothing)
396 emit_unop_insn (code, to, from,
397 tab == sext_optab ? FLOAT_EXTEND : FLOAT_TRUNCATE);
401 /* Otherwise use a libcall. */
402 libcall = convert_optab_libfunc (tab, to_mode, from_mode);
404 /* Is this conversion implemented yet? */
405 gcc_assert (libcall);
408 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
410 insns = get_insns ();
412 emit_libcall_block (insns, to, value,
413 tab == trunc_optab ? gen_rtx_FLOAT_TRUNCATE (to_mode,
415 : gen_rtx_FLOAT_EXTEND (to_mode, from));
419 /* Handle pointer conversion. */ /* SPEE 900220. */
420 /* Targets are expected to provide conversion insns between PxImode and
421 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
422 if (GET_MODE_CLASS (to_mode) == MODE_PARTIAL_INT)
424 enum machine_mode full_mode
425 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode), MODE_INT);
427 gcc_assert (convert_optab_handler (trunc_optab, to_mode, full_mode)
428 != CODE_FOR_nothing);
430 if (full_mode != from_mode)
431 from = convert_to_mode (full_mode, from, unsignedp);
432 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, full_mode),
436 if (GET_MODE_CLASS (from_mode) == MODE_PARTIAL_INT)
439 enum machine_mode full_mode
440 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode), MODE_INT);
442 gcc_assert (convert_optab_handler (sext_optab, full_mode, from_mode)
443 != CODE_FOR_nothing);
445 if (to_mode == full_mode)
447 emit_unop_insn (convert_optab_handler (sext_optab, full_mode,
453 new_from = gen_reg_rtx (full_mode);
454 emit_unop_insn (convert_optab_handler (sext_optab, full_mode, from_mode),
455 new_from, from, UNKNOWN);
457 /* else proceed to integer conversions below. */
458 from_mode = full_mode;
462 /* Make sure both are fixed-point modes or both are not. */
463 gcc_assert (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode) ==
464 ALL_SCALAR_FIXED_POINT_MODE_P (to_mode));
465 if (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode))
467 /* If we widen from_mode to to_mode and they are in the same class,
468 we won't saturate the result.
469 Otherwise, always saturate the result to play safe. */
470 if (GET_MODE_CLASS (from_mode) == GET_MODE_CLASS (to_mode)
471 && GET_MODE_SIZE (from_mode) < GET_MODE_SIZE (to_mode))
472 expand_fixed_convert (to, from, 0, 0);
474 expand_fixed_convert (to, from, 0, 1);
478 /* Now both modes are integers. */
480 /* Handle expanding beyond a word. */
481 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
482 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
489 enum machine_mode lowpart_mode;
490 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
492 /* Try converting directly if the insn is supported. */
493 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
496 /* If FROM is a SUBREG, put it into a register. Do this
497 so that we always generate the same set of insns for
498 better cse'ing; if an intermediate assignment occurred,
499 we won't be doing the operation directly on the SUBREG. */
500 if (optimize > 0 && GET_CODE (from) == SUBREG)
501 from = force_reg (from_mode, from);
502 emit_unop_insn (code, to, from, equiv_code);
505 /* Next, try converting via full word. */
506 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
507 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
508 != CODE_FOR_nothing))
510 rtx word_to = gen_reg_rtx (word_mode);
513 if (reg_overlap_mentioned_p (to, from))
514 from = force_reg (from_mode, from);
517 convert_move (word_to, from, unsignedp);
518 emit_unop_insn (code, to, word_to, equiv_code);
522 /* No special multiword conversion insn; do it by hand. */
525 /* Since we will turn this into a no conflict block, we must ensure
526 that the source does not overlap the target. */
528 if (reg_overlap_mentioned_p (to, from))
529 from = force_reg (from_mode, from);
531 /* Get a copy of FROM widened to a word, if necessary. */
532 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
533 lowpart_mode = word_mode;
535 lowpart_mode = from_mode;
537 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
539 lowpart = gen_lowpart (lowpart_mode, to);
540 emit_move_insn (lowpart, lowfrom);
542 /* Compute the value to put in each remaining word. */
544 fill_value = const0_rtx;
546 fill_value = emit_store_flag (gen_reg_rtx (word_mode),
547 LT, lowfrom, const0_rtx,
550 /* Fill the remaining words. */
551 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
553 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
554 rtx subword = operand_subword (to, index, 1, to_mode);
556 gcc_assert (subword);
558 if (fill_value != subword)
559 emit_move_insn (subword, fill_value);
562 insns = get_insns ();
569 /* Truncating multi-word to a word or less. */
570 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
571 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
574 && ! MEM_VOLATILE_P (from)
575 && direct_load[(int) to_mode]
576 && ! mode_dependent_address_p (XEXP (from, 0)))
578 || GET_CODE (from) == SUBREG))
579 from = force_reg (from_mode, from);
580 convert_move (to, gen_lowpart (word_mode, from), 0);
584 /* Now follow all the conversions between integers
585 no more than a word long. */
587 /* For truncation, usually we can just refer to FROM in a narrower mode. */
588 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
589 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode, from_mode))
592 && ! MEM_VOLATILE_P (from)
593 && direct_load[(int) to_mode]
594 && ! mode_dependent_address_p (XEXP (from, 0)))
596 || GET_CODE (from) == SUBREG))
597 from = force_reg (from_mode, from);
598 if (REG_P (from) && REGNO (from) < FIRST_PSEUDO_REGISTER
599 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
600 from = copy_to_reg (from);
601 emit_move_insn (to, gen_lowpart (to_mode, from));
605 /* Handle extension. */
606 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
608 /* Convert directly if that works. */
609 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
612 emit_unop_insn (code, to, from, equiv_code);
617 enum machine_mode intermediate;
621 /* Search for a mode to convert via. */
622 for (intermediate = from_mode; intermediate != VOIDmode;
623 intermediate = GET_MODE_WIDER_MODE (intermediate))
624 if (((can_extend_p (to_mode, intermediate, unsignedp)
626 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
627 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode, intermediate)))
628 && (can_extend_p (intermediate, from_mode, unsignedp)
629 != CODE_FOR_nothing))
631 convert_move (to, convert_to_mode (intermediate, from,
632 unsignedp), unsignedp);
636 /* No suitable intermediate mode.
637 Generate what we need with shifts. */
638 shift_amount = (GET_MODE_BITSIZE (to_mode)
639 - GET_MODE_BITSIZE (from_mode));
640 from = gen_lowpart (to_mode, force_reg (from_mode, from));
641 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
643 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
646 emit_move_insn (to, tmp);
651 /* Support special truncate insns for certain modes. */
652 if (convert_optab_handler (trunc_optab, to_mode,
653 from_mode) != CODE_FOR_nothing)
655 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, from_mode),
660 /* Handle truncation of volatile memrefs, and so on;
661 the things that couldn't be truncated directly,
662 and for which there was no special instruction.
664 ??? Code above formerly short-circuited this, for most integer
665 mode pairs, with a force_reg in from_mode followed by a recursive
666 call to this routine. Appears always to have been wrong. */
667 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
669 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
670 emit_move_insn (to, temp);
674 /* Mode combination is not recognized. */
678 /* Return an rtx for a value that would result
679 from converting X to mode MODE.
680 Both X and MODE may be floating, or both integer.
681 UNSIGNEDP is nonzero if X is an unsigned value.
682 This can be done by referring to a part of X in place
683 or by copying to a new temporary with conversion. */
686 convert_to_mode (enum machine_mode mode, rtx x, int unsignedp)
688 return convert_modes (mode, VOIDmode, x, unsignedp);
691 /* Return an rtx for a value that would result
692 from converting X from mode OLDMODE to mode MODE.
693 Both modes may be floating, or both integer.
694 UNSIGNEDP is nonzero if X is an unsigned value.
696 This can be done by referring to a part of X in place
697 or by copying to a new temporary with conversion.
699 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
702 convert_modes (enum machine_mode mode, enum machine_mode oldmode, rtx x, int unsignedp)
706 /* If FROM is a SUBREG that indicates that we have already done at least
707 the required extension, strip it. */
709 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
710 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
711 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
712 x = gen_lowpart (mode, x);
714 if (GET_MODE (x) != VOIDmode)
715 oldmode = GET_MODE (x);
720 /* There is one case that we must handle specially: If we are converting
721 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
722 we are to interpret the constant as unsigned, gen_lowpart will do
723 the wrong if the constant appears negative. What we want to do is
724 make the high-order word of the constant zero, not all ones. */
726 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
727 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
728 && CONST_INT_P (x) && INTVAL (x) < 0)
730 double_int val = uhwi_to_double_int (INTVAL (x));
732 /* We need to zero extend VAL. */
733 if (oldmode != VOIDmode)
734 val = double_int_zext (val, GET_MODE_BITSIZE (oldmode));
736 return immed_double_int_const (val, mode);
739 /* We can do this with a gen_lowpart if both desired and current modes
740 are integer, and this is either a constant integer, a register, or a
741 non-volatile MEM. Except for the constant case where MODE is no
742 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
745 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
746 || (GET_MODE_CLASS (mode) == MODE_INT
747 && GET_MODE_CLASS (oldmode) == MODE_INT
748 && (GET_CODE (x) == CONST_DOUBLE
749 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
750 && ((MEM_P (x) && ! MEM_VOLATILE_P (x)
751 && direct_load[(int) mode])
753 && (! HARD_REGISTER_P (x)
754 || HARD_REGNO_MODE_OK (REGNO (x), mode))
755 && TRULY_NOOP_TRUNCATION_MODES_P (mode,
758 /* ?? If we don't know OLDMODE, we have to assume here that
759 X does not need sign- or zero-extension. This may not be
760 the case, but it's the best we can do. */
761 if (CONST_INT_P (x) && oldmode != VOIDmode
762 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
764 HOST_WIDE_INT val = INTVAL (x);
766 /* We must sign or zero-extend in this case. Start by
767 zero-extending, then sign extend if we need to. */
768 val &= GET_MODE_MASK (oldmode);
770 && val_signbit_known_set_p (oldmode, val))
771 val |= ~GET_MODE_MASK (oldmode);
773 return gen_int_mode (val, mode);
776 return gen_lowpart (mode, x);
779 /* Converting from integer constant into mode is always equivalent to an
781 if (VECTOR_MODE_P (mode) && GET_MODE (x) == VOIDmode)
783 gcc_assert (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (oldmode));
784 return simplify_gen_subreg (mode, x, oldmode, 0);
787 temp = gen_reg_rtx (mode);
788 convert_move (temp, x, unsignedp);
792 /* Return the largest alignment we can use for doing a move (or store)
793 of MAX_PIECES. ALIGN is the largest alignment we could use. */
796 alignment_for_piecewise_move (unsigned int max_pieces, unsigned int align)
798 enum machine_mode tmode;
800 tmode = mode_for_size (max_pieces * BITS_PER_UNIT, MODE_INT, 1);
801 if (align >= GET_MODE_ALIGNMENT (tmode))
802 align = GET_MODE_ALIGNMENT (tmode);
805 enum machine_mode tmode, xmode;
807 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
809 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
810 if (GET_MODE_SIZE (tmode) > max_pieces
811 || SLOW_UNALIGNED_ACCESS (tmode, align))
814 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
820 /* Return the widest integer mode no wider than SIZE. If no such mode
821 can be found, return VOIDmode. */
823 static enum machine_mode
824 widest_int_mode_for_size (unsigned int size)
826 enum machine_mode tmode, mode = VOIDmode;
828 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
829 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
830 if (GET_MODE_SIZE (tmode) < size)
836 /* STORE_MAX_PIECES is the number of bytes at a time that we can
837 store efficiently. Due to internal GCC limitations, this is
838 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
839 for an immediate constant. */
841 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
843 /* Determine whether the LEN bytes can be moved by using several move
844 instructions. Return nonzero if a call to move_by_pieces should
848 can_move_by_pieces (unsigned HOST_WIDE_INT len,
849 unsigned int align ATTRIBUTE_UNUSED)
851 return MOVE_BY_PIECES_P (len, align);
854 /* Generate several move instructions to copy LEN bytes from block FROM to
855 block TO. (These are MEM rtx's with BLKmode).
857 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
858 used to push FROM to the stack.
860 ALIGN is maximum stack alignment we can assume.
862 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
863 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
867 move_by_pieces (rtx to, rtx from, unsigned HOST_WIDE_INT len,
868 unsigned int align, int endp)
870 struct move_by_pieces_d data;
871 enum machine_mode to_addr_mode, from_addr_mode
872 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (from));
873 rtx to_addr, from_addr = XEXP (from, 0);
874 unsigned int max_size = MOVE_MAX_PIECES + 1;
875 enum insn_code icode;
877 align = MIN (to ? MEM_ALIGN (to) : align, MEM_ALIGN (from));
880 data.from_addr = from_addr;
883 to_addr_mode = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
884 to_addr = XEXP (to, 0);
887 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
888 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
890 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
894 to_addr_mode = VOIDmode;
898 #ifdef STACK_GROWS_DOWNWARD
904 data.to_addr = to_addr;
907 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
908 || GET_CODE (from_addr) == POST_INC
909 || GET_CODE (from_addr) == POST_DEC);
911 data.explicit_inc_from = 0;
912 data.explicit_inc_to = 0;
913 if (data.reverse) data.offset = len;
916 /* If copying requires more than two move insns,
917 copy addresses to registers (to make displacements shorter)
918 and use post-increment if available. */
919 if (!(data.autinc_from && data.autinc_to)
920 && move_by_pieces_ninsns (len, align, max_size) > 2)
922 /* Find the mode of the largest move...
923 MODE might not be used depending on the definitions of the
924 USE_* macros below. */
925 enum machine_mode mode ATTRIBUTE_UNUSED
926 = widest_int_mode_for_size (max_size);
928 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
930 data.from_addr = copy_to_mode_reg (from_addr_mode,
931 plus_constant (from_addr, len));
932 data.autinc_from = 1;
933 data.explicit_inc_from = -1;
935 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
937 data.from_addr = copy_to_mode_reg (from_addr_mode, from_addr);
938 data.autinc_from = 1;
939 data.explicit_inc_from = 1;
941 if (!data.autinc_from && CONSTANT_P (from_addr))
942 data.from_addr = copy_to_mode_reg (from_addr_mode, from_addr);
943 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
945 data.to_addr = copy_to_mode_reg (to_addr_mode,
946 plus_constant (to_addr, len));
948 data.explicit_inc_to = -1;
950 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
952 data.to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
954 data.explicit_inc_to = 1;
956 if (!data.autinc_to && CONSTANT_P (to_addr))
957 data.to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
960 align = alignment_for_piecewise_move (MOVE_MAX_PIECES, align);
962 /* First move what we can in the largest integer mode, then go to
963 successively smaller modes. */
967 enum machine_mode mode = widest_int_mode_for_size (max_size);
969 if (mode == VOIDmode)
972 icode = optab_handler (mov_optab, mode);
973 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
974 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
976 max_size = GET_MODE_SIZE (mode);
979 /* The code above should have handled everything. */
980 gcc_assert (!data.len);
986 gcc_assert (!data.reverse);
991 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
992 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
994 data.to_addr = copy_to_mode_reg (to_addr_mode,
995 plus_constant (data.to_addr,
998 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
1005 to1 = adjust_address (data.to, QImode, data.offset);
1013 /* Return number of insns required to move L bytes by pieces.
1014 ALIGN (in bits) is maximum alignment we can assume. */
1016 static unsigned HOST_WIDE_INT
1017 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l, unsigned int align,
1018 unsigned int max_size)
1020 unsigned HOST_WIDE_INT n_insns = 0;
1022 align = alignment_for_piecewise_move (MOVE_MAX_PIECES, align);
1024 while (max_size > 1)
1026 enum machine_mode mode;
1027 enum insn_code icode;
1029 mode = widest_int_mode_for_size (max_size);
1031 if (mode == VOIDmode)
1034 icode = optab_handler (mov_optab, mode);
1035 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1036 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1038 max_size = GET_MODE_SIZE (mode);
1045 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1046 with move instructions for mode MODE. GENFUN is the gen_... function
1047 to make a move insn for that mode. DATA has all the other info. */
1050 move_by_pieces_1 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
1051 struct move_by_pieces_d *data)
1053 unsigned int size = GET_MODE_SIZE (mode);
1054 rtx to1 = NULL_RTX, from1;
1056 while (data->len >= size)
1059 data->offset -= size;
1063 if (data->autinc_to)
1064 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1067 to1 = adjust_address (data->to, mode, data->offset);
1070 if (data->autinc_from)
1071 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1074 from1 = adjust_address (data->from, mode, data->offset);
1076 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1077 emit_insn (gen_add2_insn (data->to_addr,
1078 GEN_INT (-(HOST_WIDE_INT)size)));
1079 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1080 emit_insn (gen_add2_insn (data->from_addr,
1081 GEN_INT (-(HOST_WIDE_INT)size)));
1084 emit_insn ((*genfun) (to1, from1));
1087 #ifdef PUSH_ROUNDING
1088 emit_single_push_insn (mode, from1, NULL);
1094 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1095 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1096 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1097 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1099 if (! data->reverse)
1100 data->offset += size;
1106 /* Emit code to move a block Y to a block X. This may be done with
1107 string-move instructions, with multiple scalar move instructions,
1108 or with a library call.
1110 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1111 SIZE is an rtx that says how long they are.
1112 ALIGN is the maximum alignment we can assume they have.
1113 METHOD describes what kind of copy this is, and what mechanisms may be used.
1115 Return the address of the new block, if memcpy is called and returns it,
1119 emit_block_move_hints (rtx x, rtx y, rtx size, enum block_op_methods method,
1120 unsigned int expected_align, HOST_WIDE_INT expected_size)
1127 if (CONST_INT_P (size)
1128 && INTVAL (size) == 0)
1133 case BLOCK_OP_NORMAL:
1134 case BLOCK_OP_TAILCALL:
1135 may_use_call = true;
1138 case BLOCK_OP_CALL_PARM:
1139 may_use_call = block_move_libcall_safe_for_call_parm ();
1141 /* Make inhibit_defer_pop nonzero around the library call
1142 to force it to pop the arguments right away. */
1146 case BLOCK_OP_NO_LIBCALL:
1147 may_use_call = false;
1154 gcc_assert (MEM_P (x) && MEM_P (y));
1155 align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1156 gcc_assert (align >= BITS_PER_UNIT);
1158 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1159 block copy is more efficient for other large modes, e.g. DCmode. */
1160 x = adjust_address (x, BLKmode, 0);
1161 y = adjust_address (y, BLKmode, 0);
1163 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1164 can be incorrect is coming from __builtin_memcpy. */
1165 if (CONST_INT_P (size))
1167 x = shallow_copy_rtx (x);
1168 y = shallow_copy_rtx (y);
1169 set_mem_size (x, size);
1170 set_mem_size (y, size);
1173 if (CONST_INT_P (size) && MOVE_BY_PIECES_P (INTVAL (size), align))
1174 move_by_pieces (x, y, INTVAL (size), align, 0);
1175 else if (emit_block_move_via_movmem (x, y, size, align,
1176 expected_align, expected_size))
1178 else if (may_use_call
1179 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (x))
1180 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (y)))
1182 /* Since x and y are passed to a libcall, mark the corresponding
1183 tree EXPR as addressable. */
1184 tree y_expr = MEM_EXPR (y);
1185 tree x_expr = MEM_EXPR (x);
1187 mark_addressable (y_expr);
1189 mark_addressable (x_expr);
1190 retval = emit_block_move_via_libcall (x, y, size,
1191 method == BLOCK_OP_TAILCALL);
1195 emit_block_move_via_loop (x, y, size, align);
1197 if (method == BLOCK_OP_CALL_PARM)
1204 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1206 return emit_block_move_hints (x, y, size, method, 0, -1);
1209 /* A subroutine of emit_block_move. Returns true if calling the
1210 block move libcall will not clobber any parameters which may have
1211 already been placed on the stack. */
1214 block_move_libcall_safe_for_call_parm (void)
1216 #if defined (REG_PARM_STACK_SPACE)
1220 /* If arguments are pushed on the stack, then they're safe. */
1224 /* If registers go on the stack anyway, any argument is sure to clobber
1225 an outgoing argument. */
1226 #if defined (REG_PARM_STACK_SPACE)
1227 fn = emit_block_move_libcall_fn (false);
1228 /* Avoid set but not used warning if *REG_PARM_STACK_SPACE doesn't
1229 depend on its argument. */
1231 if (OUTGOING_REG_PARM_STACK_SPACE ((!fn ? NULL_TREE : TREE_TYPE (fn)))
1232 && REG_PARM_STACK_SPACE (fn) != 0)
1236 /* If any argument goes in memory, then it might clobber an outgoing
1239 CUMULATIVE_ARGS args_so_far_v;
1240 cumulative_args_t args_so_far;
1243 fn = emit_block_move_libcall_fn (false);
1244 INIT_CUMULATIVE_ARGS (args_so_far_v, TREE_TYPE (fn), NULL_RTX, 0, 3);
1245 args_so_far = pack_cumulative_args (&args_so_far_v);
1247 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1248 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1250 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1251 rtx tmp = targetm.calls.function_arg (args_so_far, mode,
1253 if (!tmp || !REG_P (tmp))
1255 if (targetm.calls.arg_partial_bytes (args_so_far, mode, NULL, 1))
1257 targetm.calls.function_arg_advance (args_so_far, mode,
1264 /* A subroutine of emit_block_move. Expand a movmem pattern;
1265 return true if successful. */
1268 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align,
1269 unsigned int expected_align, HOST_WIDE_INT expected_size)
1271 int save_volatile_ok = volatile_ok;
1272 enum machine_mode mode;
1274 if (expected_align < align)
1275 expected_align = align;
1277 /* Since this is a move insn, we don't care about volatility. */
1280 /* Try the most limited insn first, because there's no point
1281 including more than one in the machine description unless
1282 the more limited one has some advantage. */
1284 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1285 mode = GET_MODE_WIDER_MODE (mode))
1287 enum insn_code code = direct_optab_handler (movmem_optab, mode);
1289 if (code != CODE_FOR_nothing
1290 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1291 here because if SIZE is less than the mode mask, as it is
1292 returned by the macro, it will definitely be less than the
1293 actual mode mask. */
1294 && ((CONST_INT_P (size)
1295 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1296 <= (GET_MODE_MASK (mode) >> 1)))
1297 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD))
1299 struct expand_operand ops[6];
1302 /* ??? When called via emit_block_move_for_call, it'd be
1303 nice if there were some way to inform the backend, so
1304 that it doesn't fail the expansion because it thinks
1305 emitting the libcall would be more efficient. */
1306 nops = insn_data[(int) code].n_generator_args;
1307 gcc_assert (nops == 4 || nops == 6);
1309 create_fixed_operand (&ops[0], x);
1310 create_fixed_operand (&ops[1], y);
1311 /* The check above guarantees that this size conversion is valid. */
1312 create_convert_operand_to (&ops[2], size, mode, true);
1313 create_integer_operand (&ops[3], align / BITS_PER_UNIT);
1316 create_integer_operand (&ops[4], expected_align / BITS_PER_UNIT);
1317 create_integer_operand (&ops[5], expected_size);
1319 if (maybe_expand_insn (code, nops, ops))
1321 volatile_ok = save_volatile_ok;
1327 volatile_ok = save_volatile_ok;
1331 /* A subroutine of emit_block_move. Expand a call to memcpy.
1332 Return the return value from memcpy, 0 otherwise. */
1335 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1337 rtx dst_addr, src_addr;
1338 tree call_expr, fn, src_tree, dst_tree, size_tree;
1339 enum machine_mode size_mode;
1342 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1343 pseudos. We can then place those new pseudos into a VAR_DECL and
1346 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1347 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1349 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1350 src_addr = convert_memory_address (ptr_mode, src_addr);
1352 dst_tree = make_tree (ptr_type_node, dst_addr);
1353 src_tree = make_tree (ptr_type_node, src_addr);
1355 size_mode = TYPE_MODE (sizetype);
1357 size = convert_to_mode (size_mode, size, 1);
1358 size = copy_to_mode_reg (size_mode, size);
1360 /* It is incorrect to use the libcall calling conventions to call
1361 memcpy in this context. This could be a user call to memcpy and
1362 the user may wish to examine the return value from memcpy. For
1363 targets where libcalls and normal calls have different conventions
1364 for returning pointers, we could end up generating incorrect code. */
1366 size_tree = make_tree (sizetype, size);
1368 fn = emit_block_move_libcall_fn (true);
1369 call_expr = build_call_expr (fn, 3, dst_tree, src_tree, size_tree);
1370 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1372 retval = expand_normal (call_expr);
1377 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1378 for the function we use for block copies. The first time FOR_CALL
1379 is true, we call assemble_external. */
1381 static GTY(()) tree block_move_fn;
1384 init_block_move_fn (const char *asmspec)
1390 fn = get_identifier ("memcpy");
1391 args = build_function_type_list (ptr_type_node, ptr_type_node,
1392 const_ptr_type_node, sizetype,
1395 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
1396 DECL_EXTERNAL (fn) = 1;
1397 TREE_PUBLIC (fn) = 1;
1398 DECL_ARTIFICIAL (fn) = 1;
1399 TREE_NOTHROW (fn) = 1;
1400 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
1401 DECL_VISIBILITY_SPECIFIED (fn) = 1;
1407 set_user_assembler_name (block_move_fn, asmspec);
1411 emit_block_move_libcall_fn (int for_call)
1413 static bool emitted_extern;
1416 init_block_move_fn (NULL);
1418 if (for_call && !emitted_extern)
1420 emitted_extern = true;
1421 make_decl_rtl (block_move_fn);
1422 assemble_external (block_move_fn);
1425 return block_move_fn;
1428 /* A subroutine of emit_block_move. Copy the data via an explicit
1429 loop. This is used only when libcalls are forbidden. */
1430 /* ??? It'd be nice to copy in hunks larger than QImode. */
1433 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1434 unsigned int align ATTRIBUTE_UNUSED)
1436 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1437 enum machine_mode x_addr_mode
1438 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (x));
1439 enum machine_mode y_addr_mode
1440 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (y));
1441 enum machine_mode iter_mode;
1443 iter_mode = GET_MODE (size);
1444 if (iter_mode == VOIDmode)
1445 iter_mode = word_mode;
1447 top_label = gen_label_rtx ();
1448 cmp_label = gen_label_rtx ();
1449 iter = gen_reg_rtx (iter_mode);
1451 emit_move_insn (iter, const0_rtx);
1453 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1454 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1455 do_pending_stack_adjust ();
1457 emit_jump (cmp_label);
1458 emit_label (top_label);
1460 tmp = convert_modes (x_addr_mode, iter_mode, iter, true);
1461 x_addr = gen_rtx_PLUS (x_addr_mode, x_addr, tmp);
1463 if (x_addr_mode != y_addr_mode)
1464 tmp = convert_modes (y_addr_mode, iter_mode, iter, true);
1465 y_addr = gen_rtx_PLUS (y_addr_mode, y_addr, tmp);
1467 x = change_address (x, QImode, x_addr);
1468 y = change_address (y, QImode, y_addr);
1470 emit_move_insn (x, y);
1472 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1473 true, OPTAB_LIB_WIDEN);
1475 emit_move_insn (iter, tmp);
1477 emit_label (cmp_label);
1479 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1483 /* Copy all or part of a value X into registers starting at REGNO.
1484 The number of registers to be filled is NREGS. */
1487 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1490 #ifdef HAVE_load_multiple
1498 if (CONSTANT_P (x) && !targetm.legitimate_constant_p (mode, x))
1499 x = validize_mem (force_const_mem (mode, x));
1501 /* See if the machine can do this with a load multiple insn. */
1502 #ifdef HAVE_load_multiple
1503 if (HAVE_load_multiple)
1505 last = get_last_insn ();
1506 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1514 delete_insns_since (last);
1518 for (i = 0; i < nregs; i++)
1519 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1520 operand_subword_force (x, i, mode));
1523 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1524 The number of registers to be filled is NREGS. */
1527 move_block_from_reg (int regno, rtx x, int nregs)
1534 /* See if the machine can do this with a store multiple insn. */
1535 #ifdef HAVE_store_multiple
1536 if (HAVE_store_multiple)
1538 rtx last = get_last_insn ();
1539 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1547 delete_insns_since (last);
1551 for (i = 0; i < nregs; i++)
1553 rtx tem = operand_subword (x, i, 1, BLKmode);
1557 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1561 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1562 ORIG, where ORIG is a non-consecutive group of registers represented by
1563 a PARALLEL. The clone is identical to the original except in that the
1564 original set of registers is replaced by a new set of pseudo registers.
1565 The new set has the same modes as the original set. */
1568 gen_group_rtx (rtx orig)
1573 gcc_assert (GET_CODE (orig) == PARALLEL);
1575 length = XVECLEN (orig, 0);
1576 tmps = XALLOCAVEC (rtx, length);
1578 /* Skip a NULL entry in first slot. */
1579 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1584 for (; i < length; i++)
1586 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1587 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1589 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1592 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1595 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1596 except that values are placed in TMPS[i], and must later be moved
1597 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1600 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1604 enum machine_mode m = GET_MODE (orig_src);
1606 gcc_assert (GET_CODE (dst) == PARALLEL);
1609 && !SCALAR_INT_MODE_P (m)
1610 && !MEM_P (orig_src)
1611 && GET_CODE (orig_src) != CONCAT)
1613 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1614 if (imode == BLKmode)
1615 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1617 src = gen_reg_rtx (imode);
1618 if (imode != BLKmode)
1619 src = gen_lowpart (GET_MODE (orig_src), src);
1620 emit_move_insn (src, orig_src);
1621 /* ...and back again. */
1622 if (imode != BLKmode)
1623 src = gen_lowpart (imode, src);
1624 emit_group_load_1 (tmps, dst, src, type, ssize);
1628 /* Check for a NULL entry, used to indicate that the parameter goes
1629 both on the stack and in registers. */
1630 if (XEXP (XVECEXP (dst, 0, 0), 0))
1635 /* Process the pieces. */
1636 for (i = start; i < XVECLEN (dst, 0); i++)
1638 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1639 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1640 unsigned int bytelen = GET_MODE_SIZE (mode);
1643 /* Handle trailing fragments that run over the size of the struct. */
1644 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1646 /* Arrange to shift the fragment to where it belongs.
1647 extract_bit_field loads to the lsb of the reg. */
1649 #ifdef BLOCK_REG_PADDING
1650 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1651 == (BYTES_BIG_ENDIAN ? upward : downward)
1656 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1657 bytelen = ssize - bytepos;
1658 gcc_assert (bytelen > 0);
1661 /* If we won't be loading directly from memory, protect the real source
1662 from strange tricks we might play; but make sure that the source can
1663 be loaded directly into the destination. */
1665 if (!MEM_P (orig_src)
1666 && (!CONSTANT_P (orig_src)
1667 || (GET_MODE (orig_src) != mode
1668 && GET_MODE (orig_src) != VOIDmode)))
1670 if (GET_MODE (orig_src) == VOIDmode)
1671 src = gen_reg_rtx (mode);
1673 src = gen_reg_rtx (GET_MODE (orig_src));
1675 emit_move_insn (src, orig_src);
1678 /* Optimize the access just a bit. */
1680 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1681 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1682 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1683 && bytelen == GET_MODE_SIZE (mode))
1685 tmps[i] = gen_reg_rtx (mode);
1686 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1688 else if (COMPLEX_MODE_P (mode)
1689 && GET_MODE (src) == mode
1690 && bytelen == GET_MODE_SIZE (mode))
1691 /* Let emit_move_complex do the bulk of the work. */
1693 else if (GET_CODE (src) == CONCAT)
1695 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1696 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1698 if ((bytepos == 0 && bytelen == slen0)
1699 || (bytepos != 0 && bytepos + bytelen <= slen))
1701 /* The following assumes that the concatenated objects all
1702 have the same size. In this case, a simple calculation
1703 can be used to determine the object and the bit field
1705 tmps[i] = XEXP (src, bytepos / slen0);
1706 if (! CONSTANT_P (tmps[i])
1707 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1708 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1709 (bytepos % slen0) * BITS_PER_UNIT,
1710 1, false, NULL_RTX, mode, mode);
1716 gcc_assert (!bytepos);
1717 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1718 emit_move_insn (mem, src);
1719 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1720 0, 1, false, NULL_RTX, mode, mode);
1723 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1724 SIMD register, which is currently broken. While we get GCC
1725 to emit proper RTL for these cases, let's dump to memory. */
1726 else if (VECTOR_MODE_P (GET_MODE (dst))
1729 int slen = GET_MODE_SIZE (GET_MODE (src));
1732 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1733 emit_move_insn (mem, src);
1734 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1736 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1737 && XVECLEN (dst, 0) > 1)
1738 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1739 else if (CONSTANT_P (src))
1741 HOST_WIDE_INT len = (HOST_WIDE_INT) bytelen;
1749 gcc_assert (2 * len == ssize);
1750 split_double (src, &first, &second);
1757 else if (REG_P (src) && GET_MODE (src) == mode)
1760 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1761 bytepos * BITS_PER_UNIT, 1, false, NULL_RTX,
1765 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1770 /* Emit code to move a block SRC of type TYPE to a block DST,
1771 where DST is non-consecutive registers represented by a PARALLEL.
1772 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1776 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1781 tmps = XALLOCAVEC (rtx, XVECLEN (dst, 0));
1782 emit_group_load_1 (tmps, dst, src, type, ssize);
1784 /* Copy the extracted pieces into the proper (probable) hard regs. */
1785 for (i = 0; i < XVECLEN (dst, 0); i++)
1787 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1790 emit_move_insn (d, tmps[i]);
1794 /* Similar, but load SRC into new pseudos in a format that looks like
1795 PARALLEL. This can later be fed to emit_group_move to get things
1796 in the right place. */
1799 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1804 vec = rtvec_alloc (XVECLEN (parallel, 0));
1805 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1807 /* Convert the vector to look just like the original PARALLEL, except
1808 with the computed values. */
1809 for (i = 0; i < XVECLEN (parallel, 0); i++)
1811 rtx e = XVECEXP (parallel, 0, i);
1812 rtx d = XEXP (e, 0);
1816 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1817 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1819 RTVEC_ELT (vec, i) = e;
1822 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1825 /* Emit code to move a block SRC to block DST, where SRC and DST are
1826 non-consecutive groups of registers, each represented by a PARALLEL. */
1829 emit_group_move (rtx dst, rtx src)
1833 gcc_assert (GET_CODE (src) == PARALLEL
1834 && GET_CODE (dst) == PARALLEL
1835 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1837 /* Skip first entry if NULL. */
1838 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1839 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1840 XEXP (XVECEXP (src, 0, i), 0));
1843 /* Move a group of registers represented by a PARALLEL into pseudos. */
1846 emit_group_move_into_temps (rtx src)
1848 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1851 for (i = 0; i < XVECLEN (src, 0); i++)
1853 rtx e = XVECEXP (src, 0, i);
1854 rtx d = XEXP (e, 0);
1857 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1858 RTVEC_ELT (vec, i) = e;
1861 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1864 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1865 where SRC is non-consecutive registers represented by a PARALLEL.
1866 SSIZE represents the total size of block ORIG_DST, or -1 if not
1870 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1873 int start, finish, i;
1874 enum machine_mode m = GET_MODE (orig_dst);
1876 gcc_assert (GET_CODE (src) == PARALLEL);
1878 if (!SCALAR_INT_MODE_P (m)
1879 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1881 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1882 if (imode == BLKmode)
1883 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1885 dst = gen_reg_rtx (imode);
1886 emit_group_store (dst, src, type, ssize);
1887 if (imode != BLKmode)
1888 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1889 emit_move_insn (orig_dst, dst);
1893 /* Check for a NULL entry, used to indicate that the parameter goes
1894 both on the stack and in registers. */
1895 if (XEXP (XVECEXP (src, 0, 0), 0))
1899 finish = XVECLEN (src, 0);
1901 tmps = XALLOCAVEC (rtx, finish);
1903 /* Copy the (probable) hard regs into pseudos. */
1904 for (i = start; i < finish; i++)
1906 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1907 if (!REG_P (reg) || REGNO (reg) < FIRST_PSEUDO_REGISTER)
1909 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1910 emit_move_insn (tmps[i], reg);
1916 /* If we won't be storing directly into memory, protect the real destination
1917 from strange tricks we might play. */
1919 if (GET_CODE (dst) == PARALLEL)
1923 /* We can get a PARALLEL dst if there is a conditional expression in
1924 a return statement. In that case, the dst and src are the same,
1925 so no action is necessary. */
1926 if (rtx_equal_p (dst, src))
1929 /* It is unclear if we can ever reach here, but we may as well handle
1930 it. Allocate a temporary, and split this into a store/load to/from
1933 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1934 emit_group_store (temp, src, type, ssize);
1935 emit_group_load (dst, temp, type, ssize);
1938 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1940 enum machine_mode outer = GET_MODE (dst);
1941 enum machine_mode inner;
1942 HOST_WIDE_INT bytepos;
1946 if (!REG_P (dst) || REGNO (dst) < FIRST_PSEUDO_REGISTER)
1947 dst = gen_reg_rtx (outer);
1949 /* Make life a bit easier for combine. */
1950 /* If the first element of the vector is the low part
1951 of the destination mode, use a paradoxical subreg to
1952 initialize the destination. */
1955 inner = GET_MODE (tmps[start]);
1956 bytepos = subreg_lowpart_offset (inner, outer);
1957 if (INTVAL (XEXP (XVECEXP (src, 0, start), 1)) == bytepos)
1959 temp = simplify_gen_subreg (outer, tmps[start],
1963 emit_move_insn (dst, temp);
1970 /* If the first element wasn't the low part, try the last. */
1972 && start < finish - 1)
1974 inner = GET_MODE (tmps[finish - 1]);
1975 bytepos = subreg_lowpart_offset (inner, outer);
1976 if (INTVAL (XEXP (XVECEXP (src, 0, finish - 1), 1)) == bytepos)
1978 temp = simplify_gen_subreg (outer, tmps[finish - 1],
1982 emit_move_insn (dst, temp);
1989 /* Otherwise, simply initialize the result to zero. */
1991 emit_move_insn (dst, CONST0_RTX (outer));
1994 /* Process the pieces. */
1995 for (i = start; i < finish; i++)
1997 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
1998 enum machine_mode mode = GET_MODE (tmps[i]);
1999 unsigned int bytelen = GET_MODE_SIZE (mode);
2000 unsigned int adj_bytelen = bytelen;
2003 /* Handle trailing fragments that run over the size of the struct. */
2004 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2005 adj_bytelen = ssize - bytepos;
2007 if (GET_CODE (dst) == CONCAT)
2009 if (bytepos + adj_bytelen
2010 <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2011 dest = XEXP (dst, 0);
2012 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2014 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2015 dest = XEXP (dst, 1);
2019 enum machine_mode dest_mode = GET_MODE (dest);
2020 enum machine_mode tmp_mode = GET_MODE (tmps[i]);
2022 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
2024 if (GET_MODE_ALIGNMENT (dest_mode)
2025 >= GET_MODE_ALIGNMENT (tmp_mode))
2027 dest = assign_stack_temp (dest_mode,
2028 GET_MODE_SIZE (dest_mode),
2030 emit_move_insn (adjust_address (dest,
2038 dest = assign_stack_temp (tmp_mode,
2039 GET_MODE_SIZE (tmp_mode),
2041 emit_move_insn (dest, tmps[i]);
2042 dst = adjust_address (dest, dest_mode, bytepos);
2048 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2050 /* store_bit_field always takes its value from the lsb.
2051 Move the fragment to the lsb if it's not already there. */
2053 #ifdef BLOCK_REG_PADDING
2054 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
2055 == (BYTES_BIG_ENDIAN ? upward : downward)
2061 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2062 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
2065 bytelen = adj_bytelen;
2068 /* Optimize the access just a bit. */
2070 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
2071 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
2072 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2073 && bytelen == GET_MODE_SIZE (mode))
2074 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2076 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2080 /* Copy from the pseudo into the (probable) hard reg. */
2081 if (orig_dst != dst)
2082 emit_move_insn (orig_dst, dst);
2085 /* Generate code to copy a BLKmode object of TYPE out of a
2086 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2087 is null, a stack temporary is created. TGTBLK is returned.
2089 The purpose of this routine is to handle functions that return
2090 BLKmode structures in registers. Some machines (the PA for example)
2091 want to return all small structures in registers regardless of the
2092 structure's alignment. */
2095 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
2097 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2098 rtx src = NULL, dst = NULL;
2099 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2100 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
2101 enum machine_mode copy_mode;
2105 tgtblk = assign_temp (build_qualified_type (type,
2107 | TYPE_QUAL_CONST)),
2109 preserve_temp_slots (tgtblk);
2112 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2113 into a new pseudo which is a full word. */
2115 if (GET_MODE (srcreg) != BLKmode
2116 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2117 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
2119 /* If the structure doesn't take up a whole number of words, see whether
2120 SRCREG is padded on the left or on the right. If it's on the left,
2121 set PADDING_CORRECTION to the number of bits to skip.
2123 In most ABIs, the structure will be returned at the least end of
2124 the register, which translates to right padding on little-endian
2125 targets and left padding on big-endian targets. The opposite
2126 holds if the structure is returned at the most significant
2127 end of the register. */
2128 if (bytes % UNITS_PER_WORD != 0
2129 && (targetm.calls.return_in_msb (type)
2131 : BYTES_BIG_ENDIAN))
2133 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2135 /* Copy the structure BITSIZE bits at a time. If the target lives in
2136 memory, take care of not reading/writing past its end by selecting
2137 a copy mode suited to BITSIZE. This should always be possible given
2140 We could probably emit more efficient code for machines which do not use
2141 strict alignment, but it doesn't seem worth the effort at the current
2144 copy_mode = word_mode;
2147 enum machine_mode mem_mode = mode_for_size (bitsize, MODE_INT, 1);
2148 if (mem_mode != BLKmode)
2149 copy_mode = mem_mode;
2152 for (bitpos = 0, xbitpos = padding_correction;
2153 bitpos < bytes * BITS_PER_UNIT;
2154 bitpos += bitsize, xbitpos += bitsize)
2156 /* We need a new source operand each time xbitpos is on a
2157 word boundary and when xbitpos == padding_correction
2158 (the first time through). */
2159 if (xbitpos % BITS_PER_WORD == 0
2160 || xbitpos == padding_correction)
2161 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2164 /* We need a new destination operand each time bitpos is on
2166 if (bitpos % BITS_PER_WORD == 0)
2167 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2169 /* Use xbitpos for the source extraction (right justified) and
2170 bitpos for the destination store (left justified). */
2171 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, copy_mode,
2172 extract_bit_field (src, bitsize,
2173 xbitpos % BITS_PER_WORD, 1, false,
2174 NULL_RTX, copy_mode, copy_mode));
2180 /* Add a USE expression for REG to the (possibly empty) list pointed
2181 to by CALL_FUSAGE. REG must denote a hard register. */
2184 use_reg (rtx *call_fusage, rtx reg)
2186 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2189 = gen_rtx_EXPR_LIST (VOIDmode,
2190 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2193 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2194 starting at REGNO. All of these registers must be hard registers. */
2197 use_regs (rtx *call_fusage, int regno, int nregs)
2201 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2203 for (i = 0; i < nregs; i++)
2204 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2207 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2208 PARALLEL REGS. This is for calls that pass values in multiple
2209 non-contiguous locations. The Irix 6 ABI has examples of this. */
2212 use_group_regs (rtx *call_fusage, rtx regs)
2216 for (i = 0; i < XVECLEN (regs, 0); i++)
2218 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2220 /* A NULL entry means the parameter goes both on the stack and in
2221 registers. This can also be a MEM for targets that pass values
2222 partially on the stack and partially in registers. */
2223 if (reg != 0 && REG_P (reg))
2224 use_reg (call_fusage, reg);
2228 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2229 assigment and the code of the expresion on the RHS is CODE. Return
2233 get_def_for_expr (tree name, enum tree_code code)
2237 if (TREE_CODE (name) != SSA_NAME)
2240 def_stmt = get_gimple_for_ssa_name (name);
2242 || gimple_assign_rhs_code (def_stmt) != code)
2249 /* Determine whether the LEN bytes generated by CONSTFUN can be
2250 stored to memory using several move instructions. CONSTFUNDATA is
2251 a pointer which will be passed as argument in every CONSTFUN call.
2252 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2253 a memset operation and false if it's a copy of a constant string.
2254 Return nonzero if a call to store_by_pieces should succeed. */
2257 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2258 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2259 void *constfundata, unsigned int align, bool memsetp)
2261 unsigned HOST_WIDE_INT l;
2262 unsigned int max_size;
2263 HOST_WIDE_INT offset = 0;
2264 enum machine_mode mode;
2265 enum insn_code icode;
2267 /* cst is set but not used if LEGITIMATE_CONSTANT doesn't use it. */
2268 rtx cst ATTRIBUTE_UNUSED;
2274 ? SET_BY_PIECES_P (len, align)
2275 : STORE_BY_PIECES_P (len, align)))
2278 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2280 /* We would first store what we can in the largest integer mode, then go to
2281 successively smaller modes. */
2284 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2288 max_size = STORE_MAX_PIECES + 1;
2289 while (max_size > 1)
2291 mode = widest_int_mode_for_size (max_size);
2293 if (mode == VOIDmode)
2296 icode = optab_handler (mov_optab, mode);
2297 if (icode != CODE_FOR_nothing
2298 && align >= GET_MODE_ALIGNMENT (mode))
2300 unsigned int size = GET_MODE_SIZE (mode);
2307 cst = (*constfun) (constfundata, offset, mode);
2308 if (!targetm.legitimate_constant_p (mode, cst))
2318 max_size = GET_MODE_SIZE (mode);
2321 /* The code above should have handled everything. */
2328 /* Generate several move instructions to store LEN bytes generated by
2329 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2330 pointer which will be passed as argument in every CONSTFUN call.
2331 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2332 a memset operation and false if it's a copy of a constant string.
2333 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2334 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2338 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2339 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2340 void *constfundata, unsigned int align, bool memsetp, int endp)
2342 enum machine_mode to_addr_mode
2343 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
2344 struct store_by_pieces_d data;
2348 gcc_assert (endp != 2);
2353 ? SET_BY_PIECES_P (len, align)
2354 : STORE_BY_PIECES_P (len, align));
2355 data.constfun = constfun;
2356 data.constfundata = constfundata;
2359 store_by_pieces_1 (&data, align);
2364 gcc_assert (!data.reverse);
2369 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2370 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2372 data.to_addr = copy_to_mode_reg (to_addr_mode,
2373 plus_constant (data.to_addr,
2376 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2383 to1 = adjust_address (data.to, QImode, data.offset);
2391 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2392 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2395 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2397 struct store_by_pieces_d data;
2402 data.constfun = clear_by_pieces_1;
2403 data.constfundata = NULL;
2406 store_by_pieces_1 (&data, align);
2409 /* Callback routine for clear_by_pieces.
2410 Return const0_rtx unconditionally. */
2413 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2414 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2415 enum machine_mode mode ATTRIBUTE_UNUSED)
2420 /* Subroutine of clear_by_pieces and store_by_pieces.
2421 Generate several move instructions to store LEN bytes of block TO. (A MEM
2422 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2425 store_by_pieces_1 (struct store_by_pieces_d *data ATTRIBUTE_UNUSED,
2426 unsigned int align ATTRIBUTE_UNUSED)
2428 enum machine_mode to_addr_mode
2429 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (data->to));
2430 rtx to_addr = XEXP (data->to, 0);
2431 unsigned int max_size = STORE_MAX_PIECES + 1;
2432 enum insn_code icode;
2435 data->to_addr = to_addr;
2437 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2438 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2440 data->explicit_inc_to = 0;
2442 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2444 data->offset = data->len;
2446 /* If storing requires more than two move insns,
2447 copy addresses to registers (to make displacements shorter)
2448 and use post-increment if available. */
2449 if (!data->autinc_to
2450 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2452 /* Determine the main mode we'll be using.
2453 MODE might not be used depending on the definitions of the
2454 USE_* macros below. */
2455 enum machine_mode mode ATTRIBUTE_UNUSED
2456 = widest_int_mode_for_size (max_size);
2458 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2460 data->to_addr = copy_to_mode_reg (to_addr_mode,
2461 plus_constant (to_addr, data->len));
2462 data->autinc_to = 1;
2463 data->explicit_inc_to = -1;
2466 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2467 && ! data->autinc_to)
2469 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2470 data->autinc_to = 1;
2471 data->explicit_inc_to = 1;
2474 if ( !data->autinc_to && CONSTANT_P (to_addr))
2475 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2478 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2480 /* First store what we can in the largest integer mode, then go to
2481 successively smaller modes. */
2483 while (max_size > 1)
2485 enum machine_mode mode = widest_int_mode_for_size (max_size);
2487 if (mode == VOIDmode)
2490 icode = optab_handler (mov_optab, mode);
2491 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2492 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2494 max_size = GET_MODE_SIZE (mode);
2497 /* The code above should have handled everything. */
2498 gcc_assert (!data->len);
2501 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2502 with move instructions for mode MODE. GENFUN is the gen_... function
2503 to make a move insn for that mode. DATA has all the other info. */
2506 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2507 struct store_by_pieces_d *data)
2509 unsigned int size = GET_MODE_SIZE (mode);
2512 while (data->len >= size)
2515 data->offset -= size;
2517 if (data->autinc_to)
2518 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2521 to1 = adjust_address (data->to, mode, data->offset);
2523 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2524 emit_insn (gen_add2_insn (data->to_addr,
2525 GEN_INT (-(HOST_WIDE_INT) size)));
2527 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2528 emit_insn ((*genfun) (to1, cst));
2530 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2531 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2533 if (! data->reverse)
2534 data->offset += size;
2540 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2541 its length in bytes. */
2544 clear_storage_hints (rtx object, rtx size, enum block_op_methods method,
2545 unsigned int expected_align, HOST_WIDE_INT expected_size)
2547 enum machine_mode mode = GET_MODE (object);
2550 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2552 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2553 just move a zero. Otherwise, do this a piece at a time. */
2555 && CONST_INT_P (size)
2556 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2558 rtx zero = CONST0_RTX (mode);
2561 emit_move_insn (object, zero);
2565 if (COMPLEX_MODE_P (mode))
2567 zero = CONST0_RTX (GET_MODE_INNER (mode));
2570 write_complex_part (object, zero, 0);
2571 write_complex_part (object, zero, 1);
2577 if (size == const0_rtx)
2580 align = MEM_ALIGN (object);
2582 if (CONST_INT_P (size)
2583 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2584 clear_by_pieces (object, INTVAL (size), align);
2585 else if (set_storage_via_setmem (object, size, const0_rtx, align,
2586 expected_align, expected_size))
2588 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object)))
2589 return set_storage_via_libcall (object, size, const0_rtx,
2590 method == BLOCK_OP_TAILCALL);
2598 clear_storage (rtx object, rtx size, enum block_op_methods method)
2600 return clear_storage_hints (object, size, method, 0, -1);
2604 /* A subroutine of clear_storage. Expand a call to memset.
2605 Return the return value of memset, 0 otherwise. */
2608 set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
2610 tree call_expr, fn, object_tree, size_tree, val_tree;
2611 enum machine_mode size_mode;
2614 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2615 place those into new pseudos into a VAR_DECL and use them later. */
2617 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2619 size_mode = TYPE_MODE (sizetype);
2620 size = convert_to_mode (size_mode, size, 1);
2621 size = copy_to_mode_reg (size_mode, size);
2623 /* It is incorrect to use the libcall calling conventions to call
2624 memset in this context. This could be a user call to memset and
2625 the user may wish to examine the return value from memset. For
2626 targets where libcalls and normal calls have different conventions
2627 for returning pointers, we could end up generating incorrect code. */
2629 object_tree = make_tree (ptr_type_node, object);
2630 if (!CONST_INT_P (val))
2631 val = convert_to_mode (TYPE_MODE (integer_type_node), val, 1);
2632 size_tree = make_tree (sizetype, size);
2633 val_tree = make_tree (integer_type_node, val);
2635 fn = clear_storage_libcall_fn (true);
2636 call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
2637 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2639 retval = expand_normal (call_expr);
2644 /* A subroutine of set_storage_via_libcall. Create the tree node
2645 for the function we use for block clears. The first time FOR_CALL
2646 is true, we call assemble_external. */
2648 tree block_clear_fn;
2651 init_block_clear_fn (const char *asmspec)
2653 if (!block_clear_fn)
2657 fn = get_identifier ("memset");
2658 args = build_function_type_list (ptr_type_node, ptr_type_node,
2659 integer_type_node, sizetype,
2662 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
2663 DECL_EXTERNAL (fn) = 1;
2664 TREE_PUBLIC (fn) = 1;
2665 DECL_ARTIFICIAL (fn) = 1;
2666 TREE_NOTHROW (fn) = 1;
2667 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
2668 DECL_VISIBILITY_SPECIFIED (fn) = 1;
2670 block_clear_fn = fn;
2674 set_user_assembler_name (block_clear_fn, asmspec);
2678 clear_storage_libcall_fn (int for_call)
2680 static bool emitted_extern;
2682 if (!block_clear_fn)
2683 init_block_clear_fn (NULL);
2685 if (for_call && !emitted_extern)
2687 emitted_extern = true;
2688 make_decl_rtl (block_clear_fn);
2689 assemble_external (block_clear_fn);
2692 return block_clear_fn;
2695 /* Expand a setmem pattern; return true if successful. */
2698 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align,
2699 unsigned int expected_align, HOST_WIDE_INT expected_size)
2701 /* Try the most limited insn first, because there's no point
2702 including more than one in the machine description unless
2703 the more limited one has some advantage. */
2705 enum machine_mode mode;
2707 if (expected_align < align)
2708 expected_align = align;
2710 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2711 mode = GET_MODE_WIDER_MODE (mode))
2713 enum insn_code code = direct_optab_handler (setmem_optab, mode);
2715 if (code != CODE_FOR_nothing
2716 /* We don't need MODE to be narrower than
2717 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2718 the mode mask, as it is returned by the macro, it will
2719 definitely be less than the actual mode mask. */
2720 && ((CONST_INT_P (size)
2721 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2722 <= (GET_MODE_MASK (mode) >> 1)))
2723 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD))
2725 struct expand_operand ops[6];
2728 nops = insn_data[(int) code].n_generator_args;
2729 gcc_assert (nops == 4 || nops == 6);
2731 create_fixed_operand (&ops[0], object);
2732 /* The check above guarantees that this size conversion is valid. */
2733 create_convert_operand_to (&ops[1], size, mode, true);
2734 create_convert_operand_from (&ops[2], val, byte_mode, true);
2735 create_integer_operand (&ops[3], align / BITS_PER_UNIT);
2738 create_integer_operand (&ops[4], expected_align / BITS_PER_UNIT);
2739 create_integer_operand (&ops[5], expected_size);
2741 if (maybe_expand_insn (code, nops, ops))
2750 /* Write to one of the components of the complex value CPLX. Write VAL to
2751 the real part if IMAG_P is false, and the imaginary part if its true. */
2754 write_complex_part (rtx cplx, rtx val, bool imag_p)
2756 enum machine_mode cmode;
2757 enum machine_mode imode;
2760 if (GET_CODE (cplx) == CONCAT)
2762 emit_move_insn (XEXP (cplx, imag_p), val);
2766 cmode = GET_MODE (cplx);
2767 imode = GET_MODE_INNER (cmode);
2768 ibitsize = GET_MODE_BITSIZE (imode);
2770 /* For MEMs simplify_gen_subreg may generate an invalid new address
2771 because, e.g., the original address is considered mode-dependent
2772 by the target, which restricts simplify_subreg from invoking
2773 adjust_address_nv. Instead of preparing fallback support for an
2774 invalid address, we call adjust_address_nv directly. */
2777 emit_move_insn (adjust_address_nv (cplx, imode,
2778 imag_p ? GET_MODE_SIZE (imode) : 0),
2783 /* If the sub-object is at least word sized, then we know that subregging
2784 will work. This special case is important, since store_bit_field
2785 wants to operate on integer modes, and there's rarely an OImode to
2786 correspond to TCmode. */
2787 if (ibitsize >= BITS_PER_WORD
2788 /* For hard regs we have exact predicates. Assume we can split
2789 the original object if it spans an even number of hard regs.
2790 This special case is important for SCmode on 64-bit platforms
2791 where the natural size of floating-point regs is 32-bit. */
2793 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2794 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2796 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2797 imag_p ? GET_MODE_SIZE (imode) : 0);
2800 emit_move_insn (part, val);
2804 /* simplify_gen_subreg may fail for sub-word MEMs. */
2805 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2808 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2811 /* Extract one of the components of the complex value CPLX. Extract the
2812 real part if IMAG_P is false, and the imaginary part if it's true. */
2815 read_complex_part (rtx cplx, bool imag_p)
2817 enum machine_mode cmode, imode;
2820 if (GET_CODE (cplx) == CONCAT)
2821 return XEXP (cplx, imag_p);
2823 cmode = GET_MODE (cplx);
2824 imode = GET_MODE_INNER (cmode);
2825 ibitsize = GET_MODE_BITSIZE (imode);
2827 /* Special case reads from complex constants that got spilled to memory. */
2828 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2830 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2831 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2833 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2834 if (CONSTANT_CLASS_P (part))
2835 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2839 /* For MEMs simplify_gen_subreg may generate an invalid new address
2840 because, e.g., the original address is considered mode-dependent
2841 by the target, which restricts simplify_subreg from invoking
2842 adjust_address_nv. Instead of preparing fallback support for an
2843 invalid address, we call adjust_address_nv directly. */
2845 return adjust_address_nv (cplx, imode,
2846 imag_p ? GET_MODE_SIZE (imode) : 0);
2848 /* If the sub-object is at least word sized, then we know that subregging
2849 will work. This special case is important, since extract_bit_field
2850 wants to operate on integer modes, and there's rarely an OImode to
2851 correspond to TCmode. */
2852 if (ibitsize >= BITS_PER_WORD
2853 /* For hard regs we have exact predicates. Assume we can split
2854 the original object if it spans an even number of hard regs.
2855 This special case is important for SCmode on 64-bit platforms
2856 where the natural size of floating-point regs is 32-bit. */
2858 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2859 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2861 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2862 imag_p ? GET_MODE_SIZE (imode) : 0);
2866 /* simplify_gen_subreg may fail for sub-word MEMs. */
2867 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2870 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2871 true, false, NULL_RTX, imode, imode);
2874 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2875 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2876 represented in NEW_MODE. If FORCE is true, this will never happen, as
2877 we'll force-create a SUBREG if needed. */
2880 emit_move_change_mode (enum machine_mode new_mode,
2881 enum machine_mode old_mode, rtx x, bool force)
2885 if (push_operand (x, GET_MODE (x)))
2887 ret = gen_rtx_MEM (new_mode, XEXP (x, 0));
2888 MEM_COPY_ATTRIBUTES (ret, x);
2892 /* We don't have to worry about changing the address since the
2893 size in bytes is supposed to be the same. */
2894 if (reload_in_progress)
2896 /* Copy the MEM to change the mode and move any
2897 substitutions from the old MEM to the new one. */
2898 ret = adjust_address_nv (x, new_mode, 0);
2899 copy_replacements (x, ret);
2902 ret = adjust_address (x, new_mode, 0);
2906 /* Note that we do want simplify_subreg's behavior of validating
2907 that the new mode is ok for a hard register. If we were to use
2908 simplify_gen_subreg, we would create the subreg, but would
2909 probably run into the target not being able to implement it. */
2910 /* Except, of course, when FORCE is true, when this is exactly what
2911 we want. Which is needed for CCmodes on some targets. */
2913 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
2915 ret = simplify_subreg (new_mode, x, old_mode, 0);
2921 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
2922 an integer mode of the same size as MODE. Returns the instruction
2923 emitted, or NULL if such a move could not be generated. */
2926 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y, bool force)
2928 enum machine_mode imode;
2929 enum insn_code code;
2931 /* There must exist a mode of the exact size we require. */
2932 imode = int_mode_for_mode (mode);
2933 if (imode == BLKmode)
2936 /* The target must support moves in this mode. */
2937 code = optab_handler (mov_optab, imode);
2938 if (code == CODE_FOR_nothing)
2941 x = emit_move_change_mode (imode, mode, x, force);
2944 y = emit_move_change_mode (imode, mode, y, force);
2947 return emit_insn (GEN_FCN (code) (x, y));
2950 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
2951 Return an equivalent MEM that does not use an auto-increment. */
2954 emit_move_resolve_push (enum machine_mode mode, rtx x)
2956 enum rtx_code code = GET_CODE (XEXP (x, 0));
2957 HOST_WIDE_INT adjust;
2960 adjust = GET_MODE_SIZE (mode);
2961 #ifdef PUSH_ROUNDING
2962 adjust = PUSH_ROUNDING (adjust);
2964 if (code == PRE_DEC || code == POST_DEC)
2966 else if (code == PRE_MODIFY || code == POST_MODIFY)
2968 rtx expr = XEXP (XEXP (x, 0), 1);
2971 gcc_assert (GET_CODE (expr) == PLUS || GET_CODE (expr) == MINUS);
2972 gcc_assert (CONST_INT_P (XEXP (expr, 1)));
2973 val = INTVAL (XEXP (expr, 1));
2974 if (GET_CODE (expr) == MINUS)
2976 gcc_assert (adjust == val || adjust == -val);
2980 /* Do not use anti_adjust_stack, since we don't want to update
2981 stack_pointer_delta. */
2982 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
2983 GEN_INT (adjust), stack_pointer_rtx,
2984 0, OPTAB_LIB_WIDEN);
2985 if (temp != stack_pointer_rtx)
2986 emit_move_insn (stack_pointer_rtx, temp);
2993 temp = stack_pointer_rtx;
2998 temp = plus_constant (stack_pointer_rtx, -adjust);
3004 return replace_equiv_address (x, temp);
3007 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3008 X is known to satisfy push_operand, and MODE is known to be complex.
3009 Returns the last instruction emitted. */
3012 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
3014 enum machine_mode submode = GET_MODE_INNER (mode);
3017 #ifdef PUSH_ROUNDING
3018 unsigned int submodesize = GET_MODE_SIZE (submode);
3020 /* In case we output to the stack, but the size is smaller than the
3021 machine can push exactly, we need to use move instructions. */
3022 if (PUSH_ROUNDING (submodesize) != submodesize)
3024 x = emit_move_resolve_push (mode, x);
3025 return emit_move_insn (x, y);
3029 /* Note that the real part always precedes the imag part in memory
3030 regardless of machine's endianness. */
3031 switch (GET_CODE (XEXP (x, 0)))
3045 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3046 read_complex_part (y, imag_first));
3047 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3048 read_complex_part (y, !imag_first));
3051 /* A subroutine of emit_move_complex. Perform the move from Y to X
3052 via two moves of the parts. Returns the last instruction emitted. */
3055 emit_move_complex_parts (rtx x, rtx y)
3057 /* Show the output dies here. This is necessary for SUBREGs
3058 of pseudos since we cannot track their lifetimes correctly;
3059 hard regs shouldn't appear here except as return values. */
3060 if (!reload_completed && !reload_in_progress
3061 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
3064 write_complex_part (x, read_complex_part (y, false), false);
3065 write_complex_part (x, read_complex_part (y, true), true);
3067 return get_last_insn ();
3070 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3071 MODE is known to be complex. Returns the last instruction emitted. */
3074 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
3078 /* Need to take special care for pushes, to maintain proper ordering
3079 of the data, and possibly extra padding. */
3080 if (push_operand (x, mode))
3081 return emit_move_complex_push (mode, x, y);
3083 /* See if we can coerce the target into moving both values at once. */
3085 /* Move floating point as parts. */
3086 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
3087 && optab_handler (mov_optab, GET_MODE_INNER (mode)) != CODE_FOR_nothing)
3089 /* Not possible if the values are inherently not adjacent. */
3090 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
3092 /* Is possible if both are registers (or subregs of registers). */
3093 else if (register_operand (x, mode) && register_operand (y, mode))
3095 /* If one of the operands is a memory, and alignment constraints
3096 are friendly enough, we may be able to do combined memory operations.
3097 We do not attempt this if Y is a constant because that combination is
3098 usually better with the by-parts thing below. */
3099 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
3100 && (!STRICT_ALIGNMENT
3101 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
3110 /* For memory to memory moves, optimal behavior can be had with the
3111 existing block move logic. */
3112 if (MEM_P (x) && MEM_P (y))
3114 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
3115 BLOCK_OP_NO_LIBCALL);
3116 return get_last_insn ();
3119 ret = emit_move_via_integer (mode, x, y, true);
3124 return emit_move_complex_parts (x, y);
3127 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3128 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3131 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
3135 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3138 enum insn_code code = optab_handler (mov_optab, CCmode);
3139 if (code != CODE_FOR_nothing)
3141 x = emit_move_change_mode (CCmode, mode, x, true);
3142 y = emit_move_change_mode (CCmode, mode, y, true);
3143 return emit_insn (GEN_FCN (code) (x, y));
3147 /* Otherwise, find the MODE_INT mode of the same width. */
3148 ret = emit_move_via_integer (mode, x, y, false);
3149 gcc_assert (ret != NULL);
3153 /* Return true if word I of OP lies entirely in the
3154 undefined bits of a paradoxical subreg. */
3157 undefined_operand_subword_p (const_rtx op, int i)
3159 enum machine_mode innermode, innermostmode;
3161 if (GET_CODE (op) != SUBREG)
3163 innermode = GET_MODE (op);
3164 innermostmode = GET_MODE (SUBREG_REG (op));
3165 offset = i * UNITS_PER_WORD + SUBREG_BYTE (op);
3166 /* The SUBREG_BYTE represents offset, as if the value were stored in
3167 memory, except for a paradoxical subreg where we define
3168 SUBREG_BYTE to be 0; undo this exception as in
3170 if (SUBREG_BYTE (op) == 0
3171 && GET_MODE_SIZE (innermostmode) < GET_MODE_SIZE (innermode))
3173 int difference = (GET_MODE_SIZE (innermostmode) - GET_MODE_SIZE (innermode));
3174 if (WORDS_BIG_ENDIAN)
3175 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
3176 if (BYTES_BIG_ENDIAN)
3177 offset += difference % UNITS_PER_WORD;
3179 if (offset >= GET_MODE_SIZE (innermostmode)
3180 || offset <= -GET_MODE_SIZE (word_mode))
3185 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3186 MODE is any multi-word or full-word mode that lacks a move_insn
3187 pattern. Note that you will get better code if you define such
3188 patterns, even if they must turn into multiple assembler instructions. */
3191 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3198 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3200 /* If X is a push on the stack, do the push now and replace
3201 X with a reference to the stack pointer. */
3202 if (push_operand (x, mode))
3203 x = emit_move_resolve_push (mode, x);
3205 /* If we are in reload, see if either operand is a MEM whose address
3206 is scheduled for replacement. */
3207 if (reload_in_progress && MEM_P (x)
3208 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3209 x = replace_equiv_address_nv (x, inner);
3210 if (reload_in_progress && MEM_P (y)
3211 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3212 y = replace_equiv_address_nv (y, inner);
3216 need_clobber = false;
3218 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3221 rtx xpart = operand_subword (x, i, 1, mode);
3224 /* Do not generate code for a move if it would come entirely
3225 from the undefined bits of a paradoxical subreg. */
3226 if (undefined_operand_subword_p (y, i))
3229 ypart = operand_subword (y, i, 1, mode);
3231 /* If we can't get a part of Y, put Y into memory if it is a
3232 constant. Otherwise, force it into a register. Then we must
3233 be able to get a part of Y. */
3234 if (ypart == 0 && CONSTANT_P (y))
3236 y = use_anchored_address (force_const_mem (mode, y));
3237 ypart = operand_subword (y, i, 1, mode);
3239 else if (ypart == 0)
3240 ypart = operand_subword_force (y, i, mode);
3242 gcc_assert (xpart && ypart);
3244 need_clobber |= (GET_CODE (xpart) == SUBREG);
3246 last_insn = emit_move_insn (xpart, ypart);
3252 /* Show the output dies here. This is necessary for SUBREGs
3253 of pseudos since we cannot track their lifetimes correctly;
3254 hard regs shouldn't appear here except as return values.
3255 We never want to emit such a clobber after reload. */
3257 && ! (reload_in_progress || reload_completed)
3258 && need_clobber != 0)
3266 /* Low level part of emit_move_insn.
3267 Called just like emit_move_insn, but assumes X and Y
3268 are basically valid. */
3271 emit_move_insn_1 (rtx x, rtx y)
3273 enum machine_mode mode = GET_MODE (x);
3274 enum insn_code code;
3276 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3278 code = optab_handler (mov_optab, mode);
3279 if (code != CODE_FOR_nothing)
3280 return emit_insn (GEN_FCN (code) (x, y));
3282 /* Expand complex moves by moving real part and imag part. */
3283 if (COMPLEX_MODE_P (mode))
3284 return emit_move_complex (mode, x, y);
3286 if (GET_MODE_CLASS (mode) == MODE_DECIMAL_FLOAT
3287 || ALL_FIXED_POINT_MODE_P (mode))
3289 rtx result = emit_move_via_integer (mode, x, y, true);
3291 /* If we can't find an integer mode, use multi words. */
3295 return emit_move_multi_word (mode, x, y);
3298 if (GET_MODE_CLASS (mode) == MODE_CC)
3299 return emit_move_ccmode (mode, x, y);
3301 /* Try using a move pattern for the corresponding integer mode. This is
3302 only safe when simplify_subreg can convert MODE constants into integer
3303 constants. At present, it can only do this reliably if the value
3304 fits within a HOST_WIDE_INT. */
3305 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3307 rtx ret = emit_move_via_integer (mode, x, y, false);
3312 return emit_move_multi_word (mode, x, y);
3315 /* Generate code to copy Y into X.
3316 Both Y and X must have the same mode, except that
3317 Y can be a constant with VOIDmode.
3318 This mode cannot be BLKmode; use emit_block_move for that.
3320 Return the last instruction emitted. */
3323 emit_move_insn (rtx x, rtx y)
3325 enum machine_mode mode = GET_MODE (x);
3326 rtx y_cst = NULL_RTX;
3329 gcc_assert (mode != BLKmode
3330 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3335 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3336 && (last_insn = compress_float_constant (x, y)))
3341 if (!targetm.legitimate_constant_p (mode, y))
3343 y = force_const_mem (mode, y);
3345 /* If the target's cannot_force_const_mem prevented the spill,
3346 assume that the target's move expanders will also take care
3347 of the non-legitimate constant. */
3351 y = use_anchored_address (y);
3355 /* If X or Y are memory references, verify that their addresses are valid
3358 && (! memory_address_addr_space_p (GET_MODE (x), XEXP (x, 0),
3360 && ! push_operand (x, GET_MODE (x))))
3361 x = validize_mem (x);
3364 && ! memory_address_addr_space_p (GET_MODE (y), XEXP (y, 0),
3365 MEM_ADDR_SPACE (y)))
3366 y = validize_mem (y);
3368 gcc_assert (mode != BLKmode);
3370 last_insn = emit_move_insn_1 (x, y);
3372 if (y_cst && REG_P (x)
3373 && (set = single_set (last_insn)) != NULL_RTX
3374 && SET_DEST (set) == x
3375 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3376 set_unique_reg_note (last_insn, REG_EQUAL, copy_rtx (y_cst));
3381 /* If Y is representable exactly in a narrower mode, and the target can
3382 perform the extension directly from constant or memory, then emit the
3383 move as an extension. */
3386 compress_float_constant (rtx x, rtx y)
3388 enum machine_mode dstmode = GET_MODE (x);
3389 enum machine_mode orig_srcmode = GET_MODE (y);
3390 enum machine_mode srcmode;
3392 int oldcost, newcost;
3393 bool speed = optimize_insn_for_speed_p ();
3395 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3397 if (targetm.legitimate_constant_p (dstmode, y))
3398 oldcost = rtx_cost (y, SET, speed);
3400 oldcost = rtx_cost (force_const_mem (dstmode, y), SET, speed);
3402 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3403 srcmode != orig_srcmode;
3404 srcmode = GET_MODE_WIDER_MODE (srcmode))
3407 rtx trunc_y, last_insn;
3409 /* Skip if the target can't extend this way. */
3410 ic = can_extend_p (dstmode, srcmode, 0);
3411 if (ic == CODE_FOR_nothing)
3414 /* Skip if the narrowed value isn't exact. */
3415 if (! exact_real_truncate (srcmode, &r))
3418 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3420 if (targetm.legitimate_constant_p (srcmode, trunc_y))
3422 /* Skip if the target needs extra instructions to perform
3424 if (!insn_operand_matches (ic, 1, trunc_y))
3426 /* This is valid, but may not be cheaper than the original. */
3427 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3428 if (oldcost < newcost)
3431 else if (float_extend_from_mem[dstmode][srcmode])
3433 trunc_y = force_const_mem (srcmode, trunc_y);
3434 /* This is valid, but may not be cheaper than the original. */
3435 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3436 if (oldcost < newcost)
3438 trunc_y = validize_mem (trunc_y);
3443 /* For CSE's benefit, force the compressed constant pool entry
3444 into a new pseudo. This constant may be used in different modes,
3445 and if not, combine will put things back together for us. */
3446 trunc_y = force_reg (srcmode, trunc_y);
3447 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3448 last_insn = get_last_insn ();
3451 set_unique_reg_note (last_insn, REG_EQUAL, y);
3459 /* Pushing data onto the stack. */
3461 /* Push a block of length SIZE (perhaps variable)
3462 and return an rtx to address the beginning of the block.
3463 The value may be virtual_outgoing_args_rtx.
3465 EXTRA is the number of bytes of padding to push in addition to SIZE.
3466 BELOW nonzero means this padding comes at low addresses;
3467 otherwise, the padding comes at high addresses. */
3470 push_block (rtx size, int extra, int below)
3474 size = convert_modes (Pmode, ptr_mode, size, 1);
3475 if (CONSTANT_P (size))
3476 anti_adjust_stack (plus_constant (size, extra));
3477 else if (REG_P (size) && extra == 0)
3478 anti_adjust_stack (size);
3481 temp = copy_to_mode_reg (Pmode, size);
3483 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3484 temp, 0, OPTAB_LIB_WIDEN);
3485 anti_adjust_stack (temp);
3488 #ifndef STACK_GROWS_DOWNWARD
3494 temp = virtual_outgoing_args_rtx;
3495 if (extra != 0 && below)
3496 temp = plus_constant (temp, extra);
3500 if (CONST_INT_P (size))
3501 temp = plus_constant (virtual_outgoing_args_rtx,
3502 -INTVAL (size) - (below ? 0 : extra));
3503 else if (extra != 0 && !below)
3504 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3505 negate_rtx (Pmode, plus_constant (size, extra)));
3507 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3508 negate_rtx (Pmode, size));
3511 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3514 #ifdef PUSH_ROUNDING
3516 /* Emit single push insn. */
3519 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3522 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3524 enum insn_code icode;
3526 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3527 /* If there is push pattern, use it. Otherwise try old way of throwing
3528 MEM representing push operation to move expander. */
3529 icode = optab_handler (push_optab, mode);
3530 if (icode != CODE_FOR_nothing)
3532 struct expand_operand ops[1];
3534 create_input_operand (&ops[0], x, mode);
3535 if (maybe_expand_insn (icode, 1, ops))
3538 if (GET_MODE_SIZE (mode) == rounded_size)
3539 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3540 /* If we are to pad downward, adjust the stack pointer first and
3541 then store X into the stack location using an offset. This is
3542 because emit_move_insn does not know how to pad; it does not have
3544 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3546 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3547 HOST_WIDE_INT offset;
3549 emit_move_insn (stack_pointer_rtx,
3550 expand_binop (Pmode,
3551 #ifdef STACK_GROWS_DOWNWARD
3557 GEN_INT (rounded_size),
3558 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3560 offset = (HOST_WIDE_INT) padding_size;
3561 #ifdef STACK_GROWS_DOWNWARD
3562 if (STACK_PUSH_CODE == POST_DEC)
3563 /* We have already decremented the stack pointer, so get the
3565 offset += (HOST_WIDE_INT) rounded_size;
3567 if (STACK_PUSH_CODE == POST_INC)
3568 /* We have already incremented the stack pointer, so get the
3570 offset -= (HOST_WIDE_INT) rounded_size;
3572 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3576 #ifdef STACK_GROWS_DOWNWARD
3577 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3578 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3579 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3581 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3582 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3583 GEN_INT (rounded_size));
3585 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3588 dest = gen_rtx_MEM (mode, dest_addr);
3592 set_mem_attributes (dest, type, 1);
3594 if (flag_optimize_sibling_calls)
3595 /* Function incoming arguments may overlap with sibling call
3596 outgoing arguments and we cannot allow reordering of reads
3597 from function arguments with stores to outgoing arguments
3598 of sibling calls. */
3599 set_mem_alias_set (dest, 0);
3601 emit_move_insn (dest, x);
3605 /* Generate code to push X onto the stack, assuming it has mode MODE and
3607 MODE is redundant except when X is a CONST_INT (since they don't
3609 SIZE is an rtx for the size of data to be copied (in bytes),
3610 needed only if X is BLKmode.
3612 ALIGN (in bits) is maximum alignment we can assume.
3614 If PARTIAL and REG are both nonzero, then copy that many of the first
3615 bytes of X into registers starting with REG, and push the rest of X.
3616 The amount of space pushed is decreased by PARTIAL bytes.
3617 REG must be a hard register in this case.
3618 If REG is zero but PARTIAL is not, take any all others actions for an
3619 argument partially in registers, but do not actually load any
3622 EXTRA is the amount in bytes of extra space to leave next to this arg.
3623 This is ignored if an argument block has already been allocated.
3625 On a machine that lacks real push insns, ARGS_ADDR is the address of
3626 the bottom of the argument block for this call. We use indexing off there
3627 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3628 argument block has not been preallocated.
3630 ARGS_SO_FAR is the size of args previously pushed for this call.
3632 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3633 for arguments passed in registers. If nonzero, it will be the number
3634 of bytes required. */
3637 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3638 unsigned int align, int partial, rtx reg, int extra,
3639 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3643 enum direction stack_direction
3644 #ifdef STACK_GROWS_DOWNWARD
3650 /* Decide where to pad the argument: `downward' for below,
3651 `upward' for above, or `none' for don't pad it.
3652 Default is below for small data on big-endian machines; else above. */
3653 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3655 /* Invert direction if stack is post-decrement.
3657 if (STACK_PUSH_CODE == POST_DEC)
3658 if (where_pad != none)
3659 where_pad = (where_pad == downward ? upward : downward);
3664 || (STRICT_ALIGNMENT && align < GET_MODE_ALIGNMENT (mode)))
3666 /* Copy a block into the stack, entirely or partially. */
3673 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3674 used = partial - offset;
3676 if (mode != BLKmode)
3678 /* A value is to be stored in an insufficiently aligned
3679 stack slot; copy via a suitably aligned slot if
3681 size = GEN_INT (GET_MODE_SIZE (mode));
3682 if (!MEM_P (xinner))
3684 temp = assign_temp (type, 0, 1, 1);
3685 emit_move_insn (temp, xinner);
3692 /* USED is now the # of bytes we need not copy to the stack
3693 because registers will take care of them. */
3696 xinner = adjust_address (xinner, BLKmode, used);
3698 /* If the partial register-part of the arg counts in its stack size,
3699 skip the part of stack space corresponding to the registers.
3700 Otherwise, start copying to the beginning of the stack space,
3701 by setting SKIP to 0. */
3702 skip = (reg_parm_stack_space == 0) ? 0 : used;
3704 #ifdef PUSH_ROUNDING
3705 /* Do it with several push insns if that doesn't take lots of insns
3706 and if there is no difficulty with push insns that skip bytes
3707 on the stack for alignment purposes. */
3710 && CONST_INT_P (size)
3712 && MEM_ALIGN (xinner) >= align
3713 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3714 /* Here we avoid the case of a structure whose weak alignment
3715 forces many pushes of a small amount of data,
3716 and such small pushes do rounding that causes trouble. */
3717 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3718 || align >= BIGGEST_ALIGNMENT
3719 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3720 == (align / BITS_PER_UNIT)))
3721 && (HOST_WIDE_INT) PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3723 /* Push padding now if padding above and stack grows down,
3724 or if padding below and stack grows up.
3725 But if space already allocated, this has already been done. */
3726 if (extra && args_addr == 0
3727 && where_pad != none && where_pad != stack_direction)
3728 anti_adjust_stack (GEN_INT (extra));
3730 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3733 #endif /* PUSH_ROUNDING */
3737 /* Otherwise make space on the stack and copy the data
3738 to the address of that space. */
3740 /* Deduct words put into registers from the size we must copy. */
3743 if (CONST_INT_P (size))
3744 size = GEN_INT (INTVAL (size) - used);
3746 size = expand_binop (GET_MODE (size), sub_optab, size,
3747 GEN_INT (used), NULL_RTX, 0,
3751 /* Get the address of the stack space.
3752 In this case, we do not deal with EXTRA separately.
3753 A single stack adjust will do. */
3756 temp = push_block (size, extra, where_pad == downward);
3759 else if (CONST_INT_P (args_so_far))
3760 temp = memory_address (BLKmode,
3761 plus_constant (args_addr,
3762 skip + INTVAL (args_so_far)));
3764 temp = memory_address (BLKmode,
3765 plus_constant (gen_rtx_PLUS (Pmode,
3770 if (!ACCUMULATE_OUTGOING_ARGS)
3772 /* If the source is referenced relative to the stack pointer,
3773 copy it to another register to stabilize it. We do not need
3774 to do this if we know that we won't be changing sp. */
3776 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3777 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3778 temp = copy_to_reg (temp);
3781 target = gen_rtx_MEM (BLKmode, temp);
3783 /* We do *not* set_mem_attributes here, because incoming arguments
3784 may overlap with sibling call outgoing arguments and we cannot
3785 allow reordering of reads from function arguments with stores
3786 to outgoing arguments of sibling calls. We do, however, want
3787 to record the alignment of the stack slot. */
3788 /* ALIGN may well be better aligned than TYPE, e.g. due to
3789 PARM_BOUNDARY. Assume the caller isn't lying. */
3790 set_mem_align (target, align);
3792 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3795 else if (partial > 0)
3797 /* Scalar partly in registers. */
3799 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3802 /* # bytes of start of argument
3803 that we must make space for but need not store. */
3804 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3805 int args_offset = INTVAL (args_so_far);
3808 /* Push padding now if padding above and stack grows down,
3809 or if padding below and stack grows up.
3810 But if space already allocated, this has already been done. */
3811 if (extra && args_addr == 0
3812 && where_pad != none && where_pad != stack_direction)
3813 anti_adjust_stack (GEN_INT (extra));
3815 /* If we make space by pushing it, we might as well push
3816 the real data. Otherwise, we can leave OFFSET nonzero
3817 and leave the space uninitialized. */
3821 /* Now NOT_STACK gets the number of words that we don't need to
3822 allocate on the stack. Convert OFFSET to words too. */
3823 not_stack = (partial - offset) / UNITS_PER_WORD;
3824 offset /= UNITS_PER_WORD;
3826 /* If the partial register-part of the arg counts in its stack size,
3827 skip the part of stack space corresponding to the registers.
3828 Otherwise, start copying to the beginning of the stack space,
3829 by setting SKIP to 0. */
3830 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3832 if (CONSTANT_P (x) && !targetm.legitimate_constant_p (mode, x))
3833 x = validize_mem (force_const_mem (mode, x));
3835 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3836 SUBREGs of such registers are not allowed. */
3837 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3838 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3839 x = copy_to_reg (x);
3841 /* Loop over all the words allocated on the stack for this arg. */
3842 /* We can do it by words, because any scalar bigger than a word
3843 has a size a multiple of a word. */
3844 #ifndef PUSH_ARGS_REVERSED
3845 for (i = not_stack; i < size; i++)
3847 for (i = size - 1; i >= not_stack; i--)
3849 if (i >= not_stack + offset)
3850 emit_push_insn (operand_subword_force (x, i, mode),
3851 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3853 GEN_INT (args_offset + ((i - not_stack + skip)
3855 reg_parm_stack_space, alignment_pad);
3862 /* Push padding now if padding above and stack grows down,
3863 or if padding below and stack grows up.
3864 But if space already allocated, this has already been done. */
3865 if (extra && args_addr == 0
3866 && where_pad != none && where_pad != stack_direction)
3867 anti_adjust_stack (GEN_INT (extra));
3869 #ifdef PUSH_ROUNDING
3870 if (args_addr == 0 && PUSH_ARGS)
3871 emit_single_push_insn (mode, x, type);
3875 if (CONST_INT_P (args_so_far))
3877 = memory_address (mode,
3878 plus_constant (args_addr,
3879 INTVAL (args_so_far)));
3881 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3883 dest = gen_rtx_MEM (mode, addr);
3885 /* We do *not* set_mem_attributes here, because incoming arguments
3886 may overlap with sibling call outgoing arguments and we cannot
3887 allow reordering of reads from function arguments with stores
3888 to outgoing arguments of sibling calls. We do, however, want
3889 to record the alignment of the stack slot. */
3890 /* ALIGN may well be better aligned than TYPE, e.g. due to
3891 PARM_BOUNDARY. Assume the caller isn't lying. */
3892 set_mem_align (dest, align);
3894 emit_move_insn (dest, x);
3898 /* If part should go in registers, copy that part
3899 into the appropriate registers. Do this now, at the end,
3900 since mem-to-mem copies above may do function calls. */
3901 if (partial > 0 && reg != 0)
3903 /* Handle calls that pass values in multiple non-contiguous locations.
3904 The Irix 6 ABI has examples of this. */
3905 if (GET_CODE (reg) == PARALLEL)
3906 emit_group_load (reg, x, type, -1);
3909 gcc_assert (partial % UNITS_PER_WORD == 0);
3910 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
3914 if (extra && args_addr == 0 && where_pad == stack_direction)
3915 anti_adjust_stack (GEN_INT (extra));
3917 if (alignment_pad && args_addr == 0)
3918 anti_adjust_stack (alignment_pad);
3921 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3925 get_subtarget (rtx x)
3929 /* Only registers can be subtargets. */
3931 /* Don't use hard regs to avoid extending their life. */
3932 || REGNO (x) < FIRST_PSEUDO_REGISTER
3936 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
3937 FIELD is a bitfield. Returns true if the optimization was successful,
3938 and there's nothing else to do. */
3941 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
3942 unsigned HOST_WIDE_INT bitpos,
3943 enum machine_mode mode1, rtx str_rtx,
3946 enum machine_mode str_mode = GET_MODE (str_rtx);
3947 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
3952 enum tree_code code;
3954 if (mode1 != VOIDmode
3955 || bitsize >= BITS_PER_WORD
3956 || str_bitsize > BITS_PER_WORD
3957 || TREE_SIDE_EFFECTS (to)
3958 || TREE_THIS_VOLATILE (to))
3962 if (TREE_CODE (src) != SSA_NAME)
3964 if (TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
3967 srcstmt = get_gimple_for_ssa_name (src);
3969 || TREE_CODE_CLASS (gimple_assign_rhs_code (srcstmt)) != tcc_binary)
3972 code = gimple_assign_rhs_code (srcstmt);
3974 op0 = gimple_assign_rhs1 (srcstmt);
3976 /* If OP0 is an SSA_NAME, then we want to walk the use-def chain
3977 to find its initialization. Hopefully the initialization will
3978 be from a bitfield load. */
3979 if (TREE_CODE (op0) == SSA_NAME)
3981 gimple op0stmt = get_gimple_for_ssa_name (op0);
3983 /* We want to eventually have OP0 be the same as TO, which
3984 should be a bitfield. */
3986 || !is_gimple_assign (op0stmt)
3987 || gimple_assign_rhs_code (op0stmt) != TREE_CODE (to))
3989 op0 = gimple_assign_rhs1 (op0stmt);
3992 op1 = gimple_assign_rhs2 (srcstmt);
3994 if (!operand_equal_p (to, op0, 0))
3997 if (MEM_P (str_rtx))
3999 unsigned HOST_WIDE_INT offset1;
4001 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
4002 str_mode = word_mode;
4003 str_mode = get_best_mode (bitsize, bitpos,
4004 MEM_ALIGN (str_rtx), str_mode, 0);
4005 if (str_mode == VOIDmode)
4007 str_bitsize = GET_MODE_BITSIZE (str_mode);
4010 bitpos %= str_bitsize;
4011 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
4012 str_rtx = adjust_address (str_rtx, str_mode, offset1);
4014 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
4017 /* If the bit field covers the whole REG/MEM, store_field
4018 will likely generate better code. */
4019 if (bitsize >= str_bitsize)
4022 /* We can't handle fields split across multiple entities. */
4023 if (bitpos + bitsize > str_bitsize)
4026 if (BYTES_BIG_ENDIAN)
4027 bitpos = str_bitsize - bitpos - bitsize;
4033 /* For now, just optimize the case of the topmost bitfield
4034 where we don't need to do any masking and also
4035 1 bit bitfields where xor can be used.
4036 We might win by one instruction for the other bitfields
4037 too if insv/extv instructions aren't used, so that
4038 can be added later. */
4039 if (bitpos + bitsize != str_bitsize
4040 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
4043 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4044 value = convert_modes (str_mode,
4045 TYPE_MODE (TREE_TYPE (op1)), value,
4046 TYPE_UNSIGNED (TREE_TYPE (op1)));
4048 /* We may be accessing data outside the field, which means
4049 we can alias adjacent data. */
4050 if (MEM_P (str_rtx))
4052 str_rtx = shallow_copy_rtx (str_rtx);
4053 set_mem_alias_set (str_rtx, 0);
4054 set_mem_expr (str_rtx, 0);
4057 binop = code == PLUS_EXPR ? add_optab : sub_optab;
4058 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
4060 value = expand_and (str_mode, value, const1_rtx, NULL);
4063 value = expand_shift (LSHIFT_EXPR, str_mode, value,
4064 bitpos, NULL_RTX, 1);
4065 result = expand_binop (str_mode, binop, str_rtx,
4066 value, str_rtx, 1, OPTAB_WIDEN);
4067 if (result != str_rtx)
4068 emit_move_insn (str_rtx, result);
4073 if (TREE_CODE (op1) != INTEGER_CST)
4075 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), EXPAND_NORMAL);
4076 value = convert_modes (GET_MODE (str_rtx),
4077 TYPE_MODE (TREE_TYPE (op1)), value,
4078 TYPE_UNSIGNED (TREE_TYPE (op1)));
4080 /* We may be accessing data outside the field, which means
4081 we can alias adjacent data. */
4082 if (MEM_P (str_rtx))
4084 str_rtx = shallow_copy_rtx (str_rtx);
4085 set_mem_alias_set (str_rtx, 0);
4086 set_mem_expr (str_rtx, 0);
4089 binop = code == BIT_IOR_EXPR ? ior_optab : xor_optab;
4090 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
4092 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
4094 value = expand_and (GET_MODE (str_rtx), value, mask,
4097 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
4098 bitpos, NULL_RTX, 1);
4099 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
4100 value, str_rtx, 1, OPTAB_WIDEN);
4101 if (result != str_rtx)
4102 emit_move_insn (str_rtx, result);
4113 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4114 is true, try generating a nontemporal store. */
4117 expand_assignment (tree to, tree from, bool nontemporal)
4121 enum machine_mode mode;
4123 enum insn_code icode;
4125 /* Don't crash if the lhs of the assignment was erroneous. */
4126 if (TREE_CODE (to) == ERROR_MARK)
4128 expand_normal (from);
4132 /* Optimize away no-op moves without side-effects. */
4133 if (operand_equal_p (to, from, 0))
4136 mode = TYPE_MODE (TREE_TYPE (to));
4137 if ((TREE_CODE (to) == MEM_REF
4138 || TREE_CODE (to) == TARGET_MEM_REF)
4140 && ((align = MAX (TYPE_ALIGN (TREE_TYPE (to)),
4141 get_object_alignment (to, BIGGEST_ALIGNMENT)))
4142 < (signed) GET_MODE_ALIGNMENT (mode))
4143 && ((icode = optab_handler (movmisalign_optab, mode))
4144 != CODE_FOR_nothing))
4146 struct expand_operand ops[2];
4147 enum machine_mode address_mode;
4150 reg = expand_expr (from, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4151 reg = force_not_mem (reg);
4153 if (TREE_CODE (to) == MEM_REF)
4156 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (to, 1))));
4157 tree base = TREE_OPERAND (to, 0);
4158 address_mode = targetm.addr_space.address_mode (as);
4159 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4160 op0 = convert_memory_address_addr_space (address_mode, op0, as);
4161 if (!integer_zerop (TREE_OPERAND (to, 1)))
4164 = immed_double_int_const (mem_ref_offset (to), address_mode);
4165 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
4167 op0 = memory_address_addr_space (mode, op0, as);
4168 mem = gen_rtx_MEM (mode, op0);
4169 set_mem_attributes (mem, to, 0);
4170 set_mem_addr_space (mem, as);
4172 else if (TREE_CODE (to) == TARGET_MEM_REF)
4174 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (to));
4175 struct mem_address addr;
4177 get_address_description (to, &addr);
4178 op0 = addr_for_mem_ref (&addr, as, true);
4179 op0 = memory_address_addr_space (mode, op0, as);
4180 mem = gen_rtx_MEM (mode, op0);
4181 set_mem_attributes (mem, to, 0);
4182 set_mem_addr_space (mem, as);
4186 if (TREE_THIS_VOLATILE (to))
4187 MEM_VOLATILE_P (mem) = 1;
4189 create_fixed_operand (&ops[0], mem);
4190 create_input_operand (&ops[1], reg, mode);
4191 /* The movmisalign<mode> pattern cannot fail, else the assignment would
4192 silently be omitted. */
4193 expand_insn (icode, 2, ops);
4197 /* Assignment of a structure component needs special treatment
4198 if the structure component's rtx is not simply a MEM.
4199 Assignment of an array element at a constant index, and assignment of
4200 an array element in an unaligned packed structure field, has the same
4202 if (handled_component_p (to)
4203 /* ??? We only need to handle MEM_REF here if the access is not
4204 a full access of the base object. */
4205 || (TREE_CODE (to) == MEM_REF
4206 && TREE_CODE (TREE_OPERAND (to, 0)) == ADDR_EXPR)
4207 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4209 enum machine_mode mode1;
4210 HOST_WIDE_INT bitsize, bitpos;
4217 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4218 &unsignedp, &volatilep, true);
4220 /* If we are going to use store_bit_field and extract_bit_field,
4221 make sure to_rtx will be safe for multiple use. */
4223 to_rtx = expand_normal (tem);
4225 /* If the bitfield is volatile, we want to access it in the
4226 field's mode, not the computed mode.
4227 If a MEM has VOIDmode (external with incomplete type),
4228 use BLKmode for it instead. */
4231 if (volatilep && flag_strict_volatile_bitfields > 0)
4232 to_rtx = adjust_address (to_rtx, mode1, 0);
4233 else if (GET_MODE (to_rtx) == VOIDmode)
4234 to_rtx = adjust_address (to_rtx, BLKmode, 0);
4239 enum machine_mode address_mode;
4242 if (!MEM_P (to_rtx))
4244 /* We can get constant negative offsets into arrays with broken
4245 user code. Translate this to a trap instead of ICEing. */
4246 gcc_assert (TREE_CODE (offset) == INTEGER_CST);
4247 expand_builtin_trap ();
4248 to_rtx = gen_rtx_MEM (BLKmode, const0_rtx);
4251 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4253 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
4254 if (GET_MODE (offset_rtx) != address_mode)
4255 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
4257 /* A constant address in TO_RTX can have VOIDmode, we must not try
4258 to call force_reg for that case. Avoid that case. */
4260 && GET_MODE (to_rtx) == BLKmode
4261 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4263 && (bitpos % bitsize) == 0
4264 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4265 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4267 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4271 to_rtx = offset_address (to_rtx, offset_rtx,
4272 highest_pow2_factor_for_target (to,
4276 /* No action is needed if the target is not a memory and the field
4277 lies completely outside that target. This can occur if the source
4278 code contains an out-of-bounds access to a small array. */
4280 && GET_MODE (to_rtx) != BLKmode
4281 && (unsigned HOST_WIDE_INT) bitpos
4282 >= GET_MODE_BITSIZE (GET_MODE (to_rtx)))
4284 expand_normal (from);
4287 /* Handle expand_expr of a complex value returning a CONCAT. */
4288 else if (GET_CODE (to_rtx) == CONCAT)
4290 unsigned short mode_bitsize = GET_MODE_BITSIZE (GET_MODE (to_rtx));
4291 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from)))
4293 && bitsize == mode_bitsize)
4294 result = store_expr (from, to_rtx, false, nontemporal);
4295 else if (bitsize == mode_bitsize / 2
4296 && (bitpos == 0 || bitpos == mode_bitsize / 2))
4297 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false,
4299 else if (bitpos + bitsize <= mode_bitsize / 2)
4300 result = store_field (XEXP (to_rtx, 0), bitsize, bitpos,
4301 mode1, from, TREE_TYPE (tem),
4302 get_alias_set (to), nontemporal);
4303 else if (bitpos >= mode_bitsize / 2)
4304 result = store_field (XEXP (to_rtx, 1), bitsize,
4305 bitpos - mode_bitsize / 2, mode1, from,
4306 TREE_TYPE (tem), get_alias_set (to),
4308 else if (bitpos == 0 && bitsize == mode_bitsize)
4311 result = expand_normal (from);
4312 from_rtx = simplify_gen_subreg (GET_MODE (to_rtx), result,
4313 TYPE_MODE (TREE_TYPE (from)), 0);
4314 emit_move_insn (XEXP (to_rtx, 0),
4315 read_complex_part (from_rtx, false));
4316 emit_move_insn (XEXP (to_rtx, 1),
4317 read_complex_part (from_rtx, true));
4321 rtx temp = assign_stack_temp (GET_MODE (to_rtx),
4322 GET_MODE_SIZE (GET_MODE (to_rtx)),
4324 write_complex_part (temp, XEXP (to_rtx, 0), false);
4325 write_complex_part (temp, XEXP (to_rtx, 1), true);
4326 result = store_field (temp, bitsize, bitpos, mode1, from,
4327 TREE_TYPE (tem), get_alias_set (to),
4329 emit_move_insn (XEXP (to_rtx, 0), read_complex_part (temp, false));
4330 emit_move_insn (XEXP (to_rtx, 1), read_complex_part (temp, true));
4337 /* If the field is at offset zero, we could have been given the
4338 DECL_RTX of the parent struct. Don't munge it. */
4339 to_rtx = shallow_copy_rtx (to_rtx);
4341 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4343 /* Deal with volatile and readonly fields. The former is only
4344 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4346 MEM_VOLATILE_P (to_rtx) = 1;
4347 if (component_uses_parent_alias_set (to))
4348 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4351 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
4355 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
4356 TREE_TYPE (tem), get_alias_set (to),
4361 preserve_temp_slots (result);
4367 /* If the rhs is a function call and its value is not an aggregate,
4368 call the function before we start to compute the lhs.
4369 This is needed for correct code for cases such as
4370 val = setjmp (buf) on machines where reference to val
4371 requires loading up part of an address in a separate insn.
4373 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4374 since it might be a promoted variable where the zero- or sign- extension
4375 needs to be done. Handling this in the normal way is safe because no
4376 computation is done before the call. The same is true for SSA names. */
4377 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
4378 && COMPLETE_TYPE_P (TREE_TYPE (from))
4379 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4380 && ! (((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
4381 && REG_P (DECL_RTL (to)))
4382 || TREE_CODE (to) == SSA_NAME))
4387 value = expand_normal (from);
4389 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4391 /* Handle calls that return values in multiple non-contiguous locations.
4392 The Irix 6 ABI has examples of this. */
4393 if (GET_CODE (to_rtx) == PARALLEL)
4394 emit_group_load (to_rtx, value, TREE_TYPE (from),
4395 int_size_in_bytes (TREE_TYPE (from)));
4396 else if (GET_MODE (to_rtx) == BLKmode)
4397 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4400 if (POINTER_TYPE_P (TREE_TYPE (to)))
4401 value = convert_memory_address_addr_space
4402 (GET_MODE (to_rtx), value,
4403 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to))));
4405 emit_move_insn (to_rtx, value);
4407 preserve_temp_slots (to_rtx);
4413 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4414 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4417 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4419 /* Don't move directly into a return register. */
4420 if (TREE_CODE (to) == RESULT_DECL
4421 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4426 temp = expand_expr (from, NULL_RTX, GET_MODE (to_rtx), EXPAND_NORMAL);
4428 if (GET_CODE (to_rtx) == PARALLEL)
4429 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4430 int_size_in_bytes (TREE_TYPE (from)));
4432 emit_move_insn (to_rtx, temp);
4434 preserve_temp_slots (to_rtx);
4440 /* In case we are returning the contents of an object which overlaps
4441 the place the value is being stored, use a safe function when copying
4442 a value through a pointer into a structure value return block. */
4443 if (TREE_CODE (to) == RESULT_DECL
4444 && TREE_CODE (from) == INDIRECT_REF
4445 && ADDR_SPACE_GENERIC_P
4446 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from, 0)))))
4447 && refs_may_alias_p (to, from)
4448 && cfun->returns_struct
4449 && !cfun->returns_pcc_struct)
4454 size = expr_size (from);
4455 from_rtx = expand_normal (from);
4457 emit_library_call (memmove_libfunc, LCT_NORMAL,
4458 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4459 XEXP (from_rtx, 0), Pmode,
4460 convert_to_mode (TYPE_MODE (sizetype),
4461 size, TYPE_UNSIGNED (sizetype)),
4462 TYPE_MODE (sizetype));
4464 preserve_temp_slots (to_rtx);
4470 /* Compute FROM and store the value in the rtx we got. */
4473 result = store_expr (from, to_rtx, 0, nontemporal);
4474 preserve_temp_slots (result);
4480 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4481 succeeded, false otherwise. */
4484 emit_storent_insn (rtx to, rtx from)
4486 struct expand_operand ops[2];
4487 enum machine_mode mode = GET_MODE (to);
4488 enum insn_code code = optab_handler (storent_optab, mode);
4490 if (code == CODE_FOR_nothing)
4493 create_fixed_operand (&ops[0], to);
4494 create_input_operand (&ops[1], from, mode);
4495 return maybe_expand_insn (code, 2, ops);
4498 /* Generate code for computing expression EXP,
4499 and storing the value into TARGET.
4501 If the mode is BLKmode then we may return TARGET itself.
4502 It turns out that in BLKmode it doesn't cause a problem.
4503 because C has no operators that could combine two different
4504 assignments into the same BLKmode object with different values
4505 with no sequence point. Will other languages need this to
4508 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4509 stack, and block moves may need to be treated specially.
4511 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4514 store_expr (tree exp, rtx target, int call_param_p, bool nontemporal)
4517 rtx alt_rtl = NULL_RTX;
4518 location_t loc = EXPR_LOCATION (exp);
4520 if (VOID_TYPE_P (TREE_TYPE (exp)))
4522 /* C++ can generate ?: expressions with a throw expression in one
4523 branch and an rvalue in the other. Here, we resolve attempts to
4524 store the throw expression's nonexistent result. */
4525 gcc_assert (!call_param_p);
4526 expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4529 if (TREE_CODE (exp) == COMPOUND_EXPR)
4531 /* Perform first part of compound expression, then assign from second
4533 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4534 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4535 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4538 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4540 /* For conditional expression, get safe form of the target. Then
4541 test the condition, doing the appropriate assignment on either
4542 side. This avoids the creation of unnecessary temporaries.
4543 For non-BLKmode, it is more efficient not to do this. */
4545 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4547 do_pending_stack_adjust ();
4549 jumpifnot (TREE_OPERAND (exp, 0), lab1, -1);
4550 store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4552 emit_jump_insn (gen_jump (lab2));
4555 store_expr (TREE_OPERAND (exp, 2), target, call_param_p,
4562 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4563 /* If this is a scalar in a register that is stored in a wider mode
4564 than the declared mode, compute the result into its declared mode
4565 and then convert to the wider mode. Our value is the computed
4568 rtx inner_target = 0;
4570 /* We can do the conversion inside EXP, which will often result
4571 in some optimizations. Do the conversion in two steps: first
4572 change the signedness, if needed, then the extend. But don't
4573 do this if the type of EXP is a subtype of something else
4574 since then the conversion might involve more than just
4575 converting modes. */
4576 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4577 && TREE_TYPE (TREE_TYPE (exp)) == 0
4578 && GET_MODE_PRECISION (GET_MODE (target))
4579 == TYPE_PRECISION (TREE_TYPE (exp)))
4581 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4582 != SUBREG_PROMOTED_UNSIGNED_P (target))
4584 /* Some types, e.g. Fortran's logical*4, won't have a signed
4585 version, so use the mode instead. */
4587 = (signed_or_unsigned_type_for
4588 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)));
4590 ntype = lang_hooks.types.type_for_mode
4591 (TYPE_MODE (TREE_TYPE (exp)),
4592 SUBREG_PROMOTED_UNSIGNED_P (target));
4594 exp = fold_convert_loc (loc, ntype, exp);
4597 exp = fold_convert_loc (loc, lang_hooks.types.type_for_mode
4598 (GET_MODE (SUBREG_REG (target)),
4599 SUBREG_PROMOTED_UNSIGNED_P (target)),
4602 inner_target = SUBREG_REG (target);
4605 temp = expand_expr (exp, inner_target, VOIDmode,
4606 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4608 /* If TEMP is a VOIDmode constant, use convert_modes to make
4609 sure that we properly convert it. */
4610 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4612 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4613 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4614 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4615 GET_MODE (target), temp,
4616 SUBREG_PROMOTED_UNSIGNED_P (target));
4619 convert_move (SUBREG_REG (target), temp,
4620 SUBREG_PROMOTED_UNSIGNED_P (target));
4624 else if ((TREE_CODE (exp) == STRING_CST
4625 || (TREE_CODE (exp) == MEM_REF
4626 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
4627 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
4629 && integer_zerop (TREE_OPERAND (exp, 1))))
4630 && !nontemporal && !call_param_p
4633 /* Optimize initialization of an array with a STRING_CST. */
4634 HOST_WIDE_INT exp_len, str_copy_len;
4636 tree str = TREE_CODE (exp) == STRING_CST
4637 ? exp : TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
4639 exp_len = int_expr_size (exp);
4643 if (TREE_STRING_LENGTH (str) <= 0)
4646 str_copy_len = strlen (TREE_STRING_POINTER (str));
4647 if (str_copy_len < TREE_STRING_LENGTH (str) - 1)
4650 str_copy_len = TREE_STRING_LENGTH (str);
4651 if ((STORE_MAX_PIECES & (STORE_MAX_PIECES - 1)) == 0
4652 && TREE_STRING_POINTER (str)[TREE_STRING_LENGTH (str) - 1] == '\0')
4654 str_copy_len += STORE_MAX_PIECES - 1;
4655 str_copy_len &= ~(STORE_MAX_PIECES - 1);
4657 str_copy_len = MIN (str_copy_len, exp_len);
4658 if (!can_store_by_pieces (str_copy_len, builtin_strncpy_read_str,
4659 CONST_CAST (char *, TREE_STRING_POINTER (str)),
4660 MEM_ALIGN (target), false))
4665 dest_mem = store_by_pieces (dest_mem,
4666 str_copy_len, builtin_strncpy_read_str,
4668 TREE_STRING_POINTER (str)),
4669 MEM_ALIGN (target), false,
4670 exp_len > str_copy_len ? 1 : 0);
4671 if (exp_len > str_copy_len)
4672 clear_storage (adjust_address (dest_mem, BLKmode, 0),
4673 GEN_INT (exp_len - str_copy_len),
4682 /* If we want to use a nontemporal store, force the value to
4684 tmp_target = nontemporal ? NULL_RTX : target;
4685 temp = expand_expr_real (exp, tmp_target, GET_MODE (target),
4687 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4691 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4692 the same as that of TARGET, adjust the constant. This is needed, for
4693 example, in case it is a CONST_DOUBLE and we want only a word-sized
4695 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4696 && TREE_CODE (exp) != ERROR_MARK
4697 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4698 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4699 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4701 /* If value was not generated in the target, store it there.
4702 Convert the value to TARGET's type first if necessary and emit the
4703 pending incrementations that have been queued when expanding EXP.
4704 Note that we cannot emit the whole queue blindly because this will
4705 effectively disable the POST_INC optimization later.
4707 If TEMP and TARGET compare equal according to rtx_equal_p, but
4708 one or both of them are volatile memory refs, we have to distinguish
4710 - expand_expr has used TARGET. In this case, we must not generate
4711 another copy. This can be detected by TARGET being equal according
4713 - expand_expr has not used TARGET - that means that the source just
4714 happens to have the same RTX form. Since temp will have been created
4715 by expand_expr, it will compare unequal according to == .
4716 We must generate a copy in this case, to reach the correct number
4717 of volatile memory references. */
4719 if ((! rtx_equal_p (temp, target)
4720 || (temp != target && (side_effects_p (temp)
4721 || side_effects_p (target))))
4722 && TREE_CODE (exp) != ERROR_MARK
4723 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4724 but TARGET is not valid memory reference, TEMP will differ
4725 from TARGET although it is really the same location. */
4727 && rtx_equal_p (alt_rtl, target)
4728 && !side_effects_p (alt_rtl)
4729 && !side_effects_p (target))
4730 /* If there's nothing to copy, don't bother. Don't call
4731 expr_size unless necessary, because some front-ends (C++)
4732 expr_size-hook must not be given objects that are not
4733 supposed to be bit-copied or bit-initialized. */
4734 && expr_size (exp) != const0_rtx)
4736 if (GET_MODE (temp) != GET_MODE (target)
4737 && GET_MODE (temp) != VOIDmode)
4739 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4740 if (GET_MODE (target) == BLKmode
4741 && GET_MODE (temp) == BLKmode)
4742 emit_block_move (target, temp, expr_size (exp),
4744 ? BLOCK_OP_CALL_PARM
4745 : BLOCK_OP_NORMAL));
4746 else if (GET_MODE (target) == BLKmode)
4747 store_bit_field (target, INTVAL (expr_size (exp)) * BITS_PER_UNIT,
4748 0, GET_MODE (temp), temp);
4750 convert_move (target, temp, unsignedp);
4753 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4755 /* Handle copying a string constant into an array. The string
4756 constant may be shorter than the array. So copy just the string's
4757 actual length, and clear the rest. First get the size of the data
4758 type of the string, which is actually the size of the target. */
4759 rtx size = expr_size (exp);
4761 if (CONST_INT_P (size)
4762 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4763 emit_block_move (target, temp, size,
4765 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4768 enum machine_mode pointer_mode
4769 = targetm.addr_space.pointer_mode (MEM_ADDR_SPACE (target));
4770 enum machine_mode address_mode
4771 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (target));
4773 /* Compute the size of the data to copy from the string. */
4775 = size_binop_loc (loc, MIN_EXPR,
4776 make_tree (sizetype, size),
4777 size_int (TREE_STRING_LENGTH (exp)));
4779 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4781 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4784 /* Copy that much. */
4785 copy_size_rtx = convert_to_mode (pointer_mode, copy_size_rtx,
4786 TYPE_UNSIGNED (sizetype));
4787 emit_block_move (target, temp, copy_size_rtx,
4789 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4791 /* Figure out how much is left in TARGET that we have to clear.
4792 Do all calculations in pointer_mode. */
4793 if (CONST_INT_P (copy_size_rtx))
4795 size = plus_constant (size, -INTVAL (copy_size_rtx));
4796 target = adjust_address (target, BLKmode,
4797 INTVAL (copy_size_rtx));
4801 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4802 copy_size_rtx, NULL_RTX, 0,
4805 if (GET_MODE (copy_size_rtx) != address_mode)
4806 copy_size_rtx = convert_to_mode (address_mode,
4808 TYPE_UNSIGNED (sizetype));
4810 target = offset_address (target, copy_size_rtx,
4811 highest_pow2_factor (copy_size));
4812 label = gen_label_rtx ();
4813 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4814 GET_MODE (size), 0, label);
4817 if (size != const0_rtx)
4818 clear_storage (target, size, BLOCK_OP_NORMAL);
4824 /* Handle calls that return values in multiple non-contiguous locations.
4825 The Irix 6 ABI has examples of this. */
4826 else if (GET_CODE (target) == PARALLEL)
4827 emit_group_load (target, temp, TREE_TYPE (exp),
4828 int_size_in_bytes (TREE_TYPE (exp)));
4829 else if (GET_MODE (temp) == BLKmode)
4830 emit_block_move (target, temp, expr_size (exp),
4832 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4833 else if (nontemporal
4834 && emit_storent_insn (target, temp))
4835 /* If we managed to emit a nontemporal store, there is nothing else to
4840 temp = force_operand (temp, target);
4842 emit_move_insn (target, temp);
4849 /* Helper for categorize_ctor_elements. Identical interface. */
4852 categorize_ctor_elements_1 (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4853 HOST_WIDE_INT *p_elt_count,
4856 unsigned HOST_WIDE_INT idx;
4857 HOST_WIDE_INT nz_elts, elt_count;
4858 tree value, purpose;
4860 /* Whether CTOR is a valid constant initializer, in accordance with what
4861 initializer_constant_valid_p does. If inferred from the constructor
4862 elements, true until proven otherwise. */
4863 bool const_from_elts_p = constructor_static_from_elts_p (ctor);
4864 bool const_p = const_from_elts_p ? true : TREE_STATIC (ctor);
4869 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), idx, purpose, value)
4871 HOST_WIDE_INT mult = 1;
4873 if (TREE_CODE (purpose) == RANGE_EXPR)
4875 tree lo_index = TREE_OPERAND (purpose, 0);
4876 tree hi_index = TREE_OPERAND (purpose, 1);
4878 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
4879 mult = (tree_low_cst (hi_index, 1)
4880 - tree_low_cst (lo_index, 1) + 1);
4883 switch (TREE_CODE (value))
4887 HOST_WIDE_INT nz = 0, ic = 0;
4890 = categorize_ctor_elements_1 (value, &nz, &ic, p_must_clear);
4892 nz_elts += mult * nz;
4893 elt_count += mult * ic;
4895 if (const_from_elts_p && const_p)
4896 const_p = const_elt_p;
4903 if (!initializer_zerop (value))
4909 nz_elts += mult * TREE_STRING_LENGTH (value);
4910 elt_count += mult * TREE_STRING_LENGTH (value);
4914 if (!initializer_zerop (TREE_REALPART (value)))
4916 if (!initializer_zerop (TREE_IMAGPART (value)))
4924 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
4926 if (!initializer_zerop (TREE_VALUE (v)))
4935 HOST_WIDE_INT tc = count_type_elements (TREE_TYPE (value), true);
4938 nz_elts += mult * tc;
4939 elt_count += mult * tc;
4941 if (const_from_elts_p && const_p)
4942 const_p = initializer_constant_valid_p (value, TREE_TYPE (value))
4950 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4951 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
4954 bool clear_this = true;
4956 if (!VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (ctor)))
4958 /* We don't expect more than one element of the union to be
4959 initialized. Not sure what we should do otherwise... */
4960 gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ctor))
4963 init_sub_type = TREE_TYPE (VEC_index (constructor_elt,
4964 CONSTRUCTOR_ELTS (ctor),
4967 /* ??? We could look at each element of the union, and find the
4968 largest element. Which would avoid comparing the size of the
4969 initialized element against any tail padding in the union.
4970 Doesn't seem worth the effort... */
4971 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
4972 TYPE_SIZE (init_sub_type)) == 1)
4974 /* And now we have to find out if the element itself is fully
4975 constructed. E.g. for union { struct { int a, b; } s; } u
4976 = { .s = { .a = 1 } }. */
4977 if (elt_count == count_type_elements (init_sub_type, false))
4982 *p_must_clear = clear_this;
4985 *p_nz_elts += nz_elts;
4986 *p_elt_count += elt_count;
4991 /* Examine CTOR to discover:
4992 * how many scalar fields are set to nonzero values,
4993 and place it in *P_NZ_ELTS;
4994 * how many scalar fields in total are in CTOR,
4995 and place it in *P_ELT_COUNT.
4996 * if a type is a union, and the initializer from the constructor
4997 is not the largest element in the union, then set *p_must_clear.
4999 Return whether or not CTOR is a valid static constant initializer, the same
5000 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
5003 categorize_ctor_elements (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
5004 HOST_WIDE_INT *p_elt_count,
5009 *p_must_clear = false;
5012 categorize_ctor_elements_1 (ctor, p_nz_elts, p_elt_count, p_must_clear);
5015 /* Count the number of scalars in TYPE. Return -1 on overflow or
5016 variable-sized. If ALLOW_FLEXARR is true, don't count flexible
5017 array member at the end of the structure. */
5020 count_type_elements (const_tree type, bool allow_flexarr)
5022 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
5023 switch (TREE_CODE (type))
5027 tree telts = array_type_nelts (type);
5028 if (telts && host_integerp (telts, 1))
5030 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
5031 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type), false);
5034 else if (max / n > m)
5042 HOST_WIDE_INT n = 0, t;
5045 for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f))
5046 if (TREE_CODE (f) == FIELD_DECL)
5048 t = count_type_elements (TREE_TYPE (f), false);
5051 /* Check for structures with flexible array member. */
5052 tree tf = TREE_TYPE (f);
5054 && DECL_CHAIN (f) == NULL
5055 && TREE_CODE (tf) == ARRAY_TYPE
5057 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf))
5058 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf)))
5059 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf))
5060 && int_size_in_bytes (type) >= 0)
5072 case QUAL_UNION_TYPE:
5079 return TYPE_VECTOR_SUBPARTS (type);
5083 case FIXED_POINT_TYPE:
5088 case REFERENCE_TYPE:
5103 /* Return 1 if EXP contains mostly (3/4) zeros. */
5106 mostly_zeros_p (const_tree exp)
5108 if (TREE_CODE (exp) == CONSTRUCTOR)
5111 HOST_WIDE_INT nz_elts, count, elts;
5114 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5118 elts = count_type_elements (TREE_TYPE (exp), false);
5120 return nz_elts < elts / 4;
5123 return initializer_zerop (exp);
5126 /* Return 1 if EXP contains all zeros. */
5129 all_zeros_p (const_tree exp)
5131 if (TREE_CODE (exp) == CONSTRUCTOR)
5134 HOST_WIDE_INT nz_elts, count;
5137 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5138 return nz_elts == 0;
5141 return initializer_zerop (exp);
5144 /* Helper function for store_constructor.
5145 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5146 TYPE is the type of the CONSTRUCTOR, not the element type.
5147 CLEARED is as for store_constructor.
5148 ALIAS_SET is the alias set to use for any stores.
5150 This provides a recursive shortcut back to store_constructor when it isn't
5151 necessary to go through store_field. This is so that we can pass through
5152 the cleared field to let store_constructor know that we may not have to
5153 clear a substructure if the outer structure has already been cleared. */
5156 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
5157 HOST_WIDE_INT bitpos, enum machine_mode mode,
5158 tree exp, tree type, int cleared,
5159 alias_set_type alias_set)
5161 if (TREE_CODE (exp) == CONSTRUCTOR
5162 /* We can only call store_constructor recursively if the size and
5163 bit position are on a byte boundary. */
5164 && bitpos % BITS_PER_UNIT == 0
5165 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
5166 /* If we have a nonzero bitpos for a register target, then we just
5167 let store_field do the bitfield handling. This is unlikely to
5168 generate unnecessary clear instructions anyways. */
5169 && (bitpos == 0 || MEM_P (target)))
5173 = adjust_address (target,
5174 GET_MODE (target) == BLKmode
5176 % GET_MODE_ALIGNMENT (GET_MODE (target)))
5177 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
5180 /* Update the alias set, if required. */
5181 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
5182 && MEM_ALIAS_SET (target) != 0)
5184 target = copy_rtx (target);
5185 set_mem_alias_set (target, alias_set);
5188 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
5191 store_field (target, bitsize, bitpos, mode, exp, type, alias_set, false);
5194 /* Store the value of constructor EXP into the rtx TARGET.
5195 TARGET is either a REG or a MEM; we know it cannot conflict, since
5196 safe_from_p has been called.
5197 CLEARED is true if TARGET is known to have been zero'd.
5198 SIZE is the number of bytes of TARGET we are allowed to modify: this
5199 may not be the same as the size of EXP if we are assigning to a field
5200 which has been packed to exclude padding bits. */
5203 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
5205 tree type = TREE_TYPE (exp);
5206 #ifdef WORD_REGISTER_OPERATIONS
5207 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
5210 switch (TREE_CODE (type))
5214 case QUAL_UNION_TYPE:
5216 unsigned HOST_WIDE_INT idx;
5219 /* If size is zero or the target is already cleared, do nothing. */
5220 if (size == 0 || cleared)
5222 /* We either clear the aggregate or indicate the value is dead. */
5223 else if ((TREE_CODE (type) == UNION_TYPE
5224 || TREE_CODE (type) == QUAL_UNION_TYPE)
5225 && ! CONSTRUCTOR_ELTS (exp))
5226 /* If the constructor is empty, clear the union. */
5228 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
5232 /* If we are building a static constructor into a register,
5233 set the initial value as zero so we can fold the value into
5234 a constant. But if more than one register is involved,
5235 this probably loses. */
5236 else if (REG_P (target) && TREE_STATIC (exp)
5237 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
5239 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5243 /* If the constructor has fewer fields than the structure or
5244 if we are initializing the structure to mostly zeros, clear
5245 the whole structure first. Don't do this if TARGET is a
5246 register whose mode size isn't equal to SIZE since
5247 clear_storage can't handle this case. */
5249 && (((int)VEC_length (constructor_elt, CONSTRUCTOR_ELTS (exp))
5250 != fields_length (type))
5251 || mostly_zeros_p (exp))
5253 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
5256 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5260 if (REG_P (target) && !cleared)
5261 emit_clobber (target);
5263 /* Store each element of the constructor into the
5264 corresponding field of TARGET. */
5265 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, field, value)
5267 enum machine_mode mode;
5268 HOST_WIDE_INT bitsize;
5269 HOST_WIDE_INT bitpos = 0;
5271 rtx to_rtx = target;
5273 /* Just ignore missing fields. We cleared the whole
5274 structure, above, if any fields are missing. */
5278 if (cleared && initializer_zerop (value))
5281 if (host_integerp (DECL_SIZE (field), 1))
5282 bitsize = tree_low_cst (DECL_SIZE (field), 1);
5286 mode = DECL_MODE (field);
5287 if (DECL_BIT_FIELD (field))
5290 offset = DECL_FIELD_OFFSET (field);
5291 if (host_integerp (offset, 0)
5292 && host_integerp (bit_position (field), 0))
5294 bitpos = int_bit_position (field);
5298 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
5302 enum machine_mode address_mode;
5306 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
5307 make_tree (TREE_TYPE (exp),
5310 offset_rtx = expand_normal (offset);
5311 gcc_assert (MEM_P (to_rtx));
5314 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
5315 if (GET_MODE (offset_rtx) != address_mode)
5316 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
5318 to_rtx = offset_address (to_rtx, offset_rtx,
5319 highest_pow2_factor (offset));
5322 #ifdef WORD_REGISTER_OPERATIONS
5323 /* If this initializes a field that is smaller than a
5324 word, at the start of a word, try to widen it to a full
5325 word. This special case allows us to output C++ member
5326 function initializations in a form that the optimizers
5329 && bitsize < BITS_PER_WORD
5330 && bitpos % BITS_PER_WORD == 0
5331 && GET_MODE_CLASS (mode) == MODE_INT
5332 && TREE_CODE (value) == INTEGER_CST
5334 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5336 tree type = TREE_TYPE (value);
5338 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5340 type = lang_hooks.types.type_for_size
5341 (BITS_PER_WORD, TYPE_UNSIGNED (type));
5342 value = fold_convert (type, value);
5345 if (BYTES_BIG_ENDIAN)
5347 = fold_build2 (LSHIFT_EXPR, type, value,
5348 build_int_cst (type,
5349 BITS_PER_WORD - bitsize));
5350 bitsize = BITS_PER_WORD;
5355 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5356 && DECL_NONADDRESSABLE_P (field))
5358 to_rtx = copy_rtx (to_rtx);
5359 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5362 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5363 value, type, cleared,
5364 get_alias_set (TREE_TYPE (field)));
5371 unsigned HOST_WIDE_INT i;
5374 tree elttype = TREE_TYPE (type);
5376 HOST_WIDE_INT minelt = 0;
5377 HOST_WIDE_INT maxelt = 0;
5379 domain = TYPE_DOMAIN (type);
5380 const_bounds_p = (TYPE_MIN_VALUE (domain)
5381 && TYPE_MAX_VALUE (domain)
5382 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5383 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5385 /* If we have constant bounds for the range of the type, get them. */
5388 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5389 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5392 /* If the constructor has fewer elements than the array, clear
5393 the whole array first. Similarly if this is static
5394 constructor of a non-BLKmode object. */
5397 else if (REG_P (target) && TREE_STATIC (exp))
5401 unsigned HOST_WIDE_INT idx;
5403 HOST_WIDE_INT count = 0, zero_count = 0;
5404 need_to_clear = ! const_bounds_p;
5406 /* This loop is a more accurate version of the loop in
5407 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5408 is also needed to check for missing elements. */
5409 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, index, value)
5411 HOST_WIDE_INT this_node_count;
5416 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5418 tree lo_index = TREE_OPERAND (index, 0);
5419 tree hi_index = TREE_OPERAND (index, 1);
5421 if (! host_integerp (lo_index, 1)
5422 || ! host_integerp (hi_index, 1))
5428 this_node_count = (tree_low_cst (hi_index, 1)
5429 - tree_low_cst (lo_index, 1) + 1);
5432 this_node_count = 1;
5434 count += this_node_count;
5435 if (mostly_zeros_p (value))
5436 zero_count += this_node_count;
5439 /* Clear the entire array first if there are any missing
5440 elements, or if the incidence of zero elements is >=
5443 && (count < maxelt - minelt + 1
5444 || 4 * zero_count >= 3 * count))
5448 if (need_to_clear && size > 0)
5451 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5453 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5457 if (!cleared && REG_P (target))
5458 /* Inform later passes that the old value is dead. */
5459 emit_clobber (target);
5461 /* Store each element of the constructor into the
5462 corresponding element of TARGET, determined by counting the
5464 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), i, index, value)
5466 enum machine_mode mode;
5467 HOST_WIDE_INT bitsize;
5468 HOST_WIDE_INT bitpos;
5469 rtx xtarget = target;
5471 if (cleared && initializer_zerop (value))
5474 mode = TYPE_MODE (elttype);
5475 if (mode == BLKmode)
5476 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
5477 ? tree_low_cst (TYPE_SIZE (elttype), 1)
5480 bitsize = GET_MODE_BITSIZE (mode);
5482 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5484 tree lo_index = TREE_OPERAND (index, 0);
5485 tree hi_index = TREE_OPERAND (index, 1);
5486 rtx index_r, pos_rtx;
5487 HOST_WIDE_INT lo, hi, count;
5490 /* If the range is constant and "small", unroll the loop. */
5492 && host_integerp (lo_index, 0)
5493 && host_integerp (hi_index, 0)
5494 && (lo = tree_low_cst (lo_index, 0),
5495 hi = tree_low_cst (hi_index, 0),
5496 count = hi - lo + 1,
5499 || (host_integerp (TYPE_SIZE (elttype), 1)
5500 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
5503 lo -= minelt; hi -= minelt;
5504 for (; lo <= hi; lo++)
5506 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
5509 && !MEM_KEEP_ALIAS_SET_P (target)
5510 && TREE_CODE (type) == ARRAY_TYPE
5511 && TYPE_NONALIASED_COMPONENT (type))
5513 target = copy_rtx (target);
5514 MEM_KEEP_ALIAS_SET_P (target) = 1;
5517 store_constructor_field
5518 (target, bitsize, bitpos, mode, value, type, cleared,
5519 get_alias_set (elttype));
5524 rtx loop_start = gen_label_rtx ();
5525 rtx loop_end = gen_label_rtx ();
5528 expand_normal (hi_index);
5530 index = build_decl (EXPR_LOCATION (exp),
5531 VAR_DECL, NULL_TREE, domain);
5532 index_r = gen_reg_rtx (promote_decl_mode (index, NULL));
5533 SET_DECL_RTL (index, index_r);
5534 store_expr (lo_index, index_r, 0, false);
5536 /* Build the head of the loop. */
5537 do_pending_stack_adjust ();
5538 emit_label (loop_start);
5540 /* Assign value to element index. */
5542 fold_convert (ssizetype,
5543 fold_build2 (MINUS_EXPR,
5546 TYPE_MIN_VALUE (domain)));
5549 size_binop (MULT_EXPR, position,
5550 fold_convert (ssizetype,
5551 TYPE_SIZE_UNIT (elttype)));
5553 pos_rtx = expand_normal (position);
5554 xtarget = offset_address (target, pos_rtx,
5555 highest_pow2_factor (position));
5556 xtarget = adjust_address (xtarget, mode, 0);
5557 if (TREE_CODE (value) == CONSTRUCTOR)
5558 store_constructor (value, xtarget, cleared,
5559 bitsize / BITS_PER_UNIT);
5561 store_expr (value, xtarget, 0, false);
5563 /* Generate a conditional jump to exit the loop. */
5564 exit_cond = build2 (LT_EXPR, integer_type_node,
5566 jumpif (exit_cond, loop_end, -1);
5568 /* Update the loop counter, and jump to the head of
5570 expand_assignment (index,
5571 build2 (PLUS_EXPR, TREE_TYPE (index),
5572 index, integer_one_node),
5575 emit_jump (loop_start);
5577 /* Build the end of the loop. */
5578 emit_label (loop_end);
5581 else if ((index != 0 && ! host_integerp (index, 0))
5582 || ! host_integerp (TYPE_SIZE (elttype), 1))
5587 index = ssize_int (1);
5590 index = fold_convert (ssizetype,
5591 fold_build2 (MINUS_EXPR,
5594 TYPE_MIN_VALUE (domain)));
5597 size_binop (MULT_EXPR, index,
5598 fold_convert (ssizetype,
5599 TYPE_SIZE_UNIT (elttype)));
5600 xtarget = offset_address (target,
5601 expand_normal (position),
5602 highest_pow2_factor (position));
5603 xtarget = adjust_address (xtarget, mode, 0);
5604 store_expr (value, xtarget, 0, false);
5609 bitpos = ((tree_low_cst (index, 0) - minelt)
5610 * tree_low_cst (TYPE_SIZE (elttype), 1));
5612 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5614 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5615 && TREE_CODE (type) == ARRAY_TYPE
5616 && TYPE_NONALIASED_COMPONENT (type))
5618 target = copy_rtx (target);
5619 MEM_KEEP_ALIAS_SET_P (target) = 1;
5621 store_constructor_field (target, bitsize, bitpos, mode, value,
5622 type, cleared, get_alias_set (elttype));
5630 unsigned HOST_WIDE_INT idx;
5631 constructor_elt *ce;
5635 tree elttype = TREE_TYPE (type);
5636 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5637 enum machine_mode eltmode = TYPE_MODE (elttype);
5638 HOST_WIDE_INT bitsize;
5639 HOST_WIDE_INT bitpos;
5640 rtvec vector = NULL;
5642 alias_set_type alias;
5644 gcc_assert (eltmode != BLKmode);
5646 n_elts = TYPE_VECTOR_SUBPARTS (type);
5647 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5649 enum machine_mode mode = GET_MODE (target);
5651 icode = (int) optab_handler (vec_init_optab, mode);
5652 if (icode != CODE_FOR_nothing)
5656 vector = rtvec_alloc (n_elts);
5657 for (i = 0; i < n_elts; i++)
5658 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5662 /* If the constructor has fewer elements than the vector,
5663 clear the whole array first. Similarly if this is static
5664 constructor of a non-BLKmode object. */
5667 else if (REG_P (target) && TREE_STATIC (exp))
5671 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5674 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
5676 int n_elts_here = tree_low_cst
5677 (int_const_binop (TRUNC_DIV_EXPR,
5678 TYPE_SIZE (TREE_TYPE (value)),
5679 TYPE_SIZE (elttype)), 1);
5681 count += n_elts_here;
5682 if (mostly_zeros_p (value))
5683 zero_count += n_elts_here;
5686 /* Clear the entire vector first if there are any missing elements,
5687 or if the incidence of zero elements is >= 75%. */
5688 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5691 if (need_to_clear && size > 0 && !vector)
5694 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5696 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5700 /* Inform later passes that the old value is dead. */
5701 if (!cleared && !vector && REG_P (target))
5702 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5705 alias = MEM_ALIAS_SET (target);
5707 alias = get_alias_set (elttype);
5709 /* Store each element of the constructor into the corresponding
5710 element of TARGET, determined by counting the elements. */
5711 for (idx = 0, i = 0;
5712 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
5713 idx++, i += bitsize / elt_size)
5715 HOST_WIDE_INT eltpos;
5716 tree value = ce->value;
5718 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5719 if (cleared && initializer_zerop (value))
5723 eltpos = tree_low_cst (ce->index, 1);
5729 /* Vector CONSTRUCTORs should only be built from smaller
5730 vectors in the case of BLKmode vectors. */
5731 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5732 RTVEC_ELT (vector, eltpos)
5733 = expand_normal (value);
5737 enum machine_mode value_mode =
5738 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5739 ? TYPE_MODE (TREE_TYPE (value))
5741 bitpos = eltpos * elt_size;
5742 store_constructor_field (target, bitsize, bitpos,
5743 value_mode, value, type,
5749 emit_insn (GEN_FCN (icode)
5751 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5760 /* Store the value of EXP (an expression tree)
5761 into a subfield of TARGET which has mode MODE and occupies
5762 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5763 If MODE is VOIDmode, it means that we are storing into a bit-field.
5765 Always return const0_rtx unless we have something particular to
5768 TYPE is the type of the underlying object,
5770 ALIAS_SET is the alias set for the destination. This value will
5771 (in general) be different from that for TARGET, since TARGET is a
5772 reference to the containing structure.
5774 If NONTEMPORAL is true, try generating a nontemporal store. */
5777 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5778 enum machine_mode mode, tree exp, tree type,
5779 alias_set_type alias_set, bool nontemporal)
5781 if (TREE_CODE (exp) == ERROR_MARK)
5784 /* If we have nothing to store, do nothing unless the expression has
5787 return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5789 /* If we are storing into an unaligned field of an aligned union that is
5790 in a register, we may have the mode of TARGET being an integer mode but
5791 MODE == BLKmode. In that case, get an aligned object whose size and
5792 alignment are the same as TARGET and store TARGET into it (we can avoid
5793 the store if the field being stored is the entire width of TARGET). Then
5794 call ourselves recursively to store the field into a BLKmode version of
5795 that object. Finally, load from the object into TARGET. This is not
5796 very efficient in general, but should only be slightly more expensive
5797 than the otherwise-required unaligned accesses. Perhaps this can be
5798 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5799 twice, once with emit_move_insn and once via store_field. */
5802 && (REG_P (target) || GET_CODE (target) == SUBREG))
5804 rtx object = assign_temp (type, 0, 1, 1);
5805 rtx blk_object = adjust_address (object, BLKmode, 0);
5807 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5808 emit_move_insn (object, target);
5810 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set,
5813 emit_move_insn (target, object);
5815 /* We want to return the BLKmode version of the data. */
5819 if (GET_CODE (target) == CONCAT)
5821 /* We're storing into a struct containing a single __complex. */
5823 gcc_assert (!bitpos);
5824 return store_expr (exp, target, 0, nontemporal);
5827 /* If the structure is in a register or if the component
5828 is a bit field, we cannot use addressing to access it.
5829 Use bit-field techniques or SUBREG to store in it. */
5831 if (mode == VOIDmode
5832 || (mode != BLKmode && ! direct_store[(int) mode]
5833 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5834 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5836 || GET_CODE (target) == SUBREG
5837 /* If the field isn't aligned enough to store as an ordinary memref,
5838 store it as a bit field. */
5840 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5841 || bitpos % GET_MODE_ALIGNMENT (mode))
5842 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5843 || (bitpos % BITS_PER_UNIT != 0)))
5844 /* If the RHS and field are a constant size and the size of the
5845 RHS isn't the same size as the bitfield, we must use bitfield
5848 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5849 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0)
5850 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
5851 decl we must use bitfield operations. */
5853 && TREE_CODE (exp) == MEM_REF
5854 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
5855 && DECL_P (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
5856 && !TREE_ADDRESSABLE (TREE_OPERAND (TREE_OPERAND (exp, 0),0 ))
5857 && DECL_MODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) != BLKmode))
5862 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5863 implies a mask operation. If the precision is the same size as
5864 the field we're storing into, that mask is redundant. This is
5865 particularly common with bit field assignments generated by the
5867 nop_def = get_def_for_expr (exp, NOP_EXPR);
5870 tree type = TREE_TYPE (exp);
5871 if (INTEGRAL_TYPE_P (type)
5872 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
5873 && bitsize == TYPE_PRECISION (type))
5875 tree op = gimple_assign_rhs1 (nop_def);
5876 type = TREE_TYPE (op);
5877 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
5882 temp = expand_normal (exp);
5884 /* If BITSIZE is narrower than the size of the type of EXP
5885 we will be narrowing TEMP. Normally, what's wanted are the
5886 low-order bits. However, if EXP's type is a record and this is
5887 big-endian machine, we want the upper BITSIZE bits. */
5888 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5889 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5890 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5891 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5892 GET_MODE_BITSIZE (GET_MODE (temp)) - bitsize,
5895 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5897 if (mode != VOIDmode && mode != BLKmode
5898 && mode != TYPE_MODE (TREE_TYPE (exp)))
5899 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5901 /* If the modes of TEMP and TARGET are both BLKmode, both
5902 must be in memory and BITPOS must be aligned on a byte
5903 boundary. If so, we simply do a block copy. Likewise
5904 for a BLKmode-like TARGET. */
5905 if (GET_MODE (temp) == BLKmode
5906 && (GET_MODE (target) == BLKmode
5908 && GET_MODE_CLASS (GET_MODE (target)) == MODE_INT
5909 && (bitpos % BITS_PER_UNIT) == 0
5910 && (bitsize % BITS_PER_UNIT) == 0)))
5912 gcc_assert (MEM_P (target) && MEM_P (temp)
5913 && (bitpos % BITS_PER_UNIT) == 0);
5915 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5916 emit_block_move (target, temp,
5917 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5924 /* Store the value in the bitfield. */
5925 store_bit_field (target, bitsize, bitpos, mode, temp);
5931 /* Now build a reference to just the desired component. */
5932 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5934 if (to_rtx == target)
5935 to_rtx = copy_rtx (to_rtx);
5937 if (!MEM_SCALAR_P (to_rtx))
5938 MEM_IN_STRUCT_P (to_rtx) = 1;
5939 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5940 set_mem_alias_set (to_rtx, alias_set);
5942 return store_expr (exp, to_rtx, 0, nontemporal);
5946 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5947 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5948 codes and find the ultimate containing object, which we return.
5950 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5951 bit position, and *PUNSIGNEDP to the signedness of the field.
5952 If the position of the field is variable, we store a tree
5953 giving the variable offset (in units) in *POFFSET.
5954 This offset is in addition to the bit position.
5955 If the position is not variable, we store 0 in *POFFSET.
5957 If any of the extraction expressions is volatile,
5958 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5960 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
5961 Otherwise, it is a mode that can be used to access the field.
5963 If the field describes a variable-sized object, *PMODE is set to
5964 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
5965 this case, but the address of the object can be found.
5967 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5968 look through nodes that serve as markers of a greater alignment than
5969 the one that can be deduced from the expression. These nodes make it
5970 possible for front-ends to prevent temporaries from being created by
5971 the middle-end on alignment considerations. For that purpose, the
5972 normal operating mode at high-level is to always pass FALSE so that
5973 the ultimate containing object is really returned; moreover, the
5974 associated predicate handled_component_p will always return TRUE
5975 on these nodes, thus indicating that they are essentially handled
5976 by get_inner_reference. TRUE should only be passed when the caller
5977 is scanning the expression in order to build another representation
5978 and specifically knows how to handle these nodes; as such, this is
5979 the normal operating mode in the RTL expanders. */
5982 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
5983 HOST_WIDE_INT *pbitpos, tree *poffset,
5984 enum machine_mode *pmode, int *punsignedp,
5985 int *pvolatilep, bool keep_aligning)
5988 enum machine_mode mode = VOIDmode;
5989 bool blkmode_bitfield = false;
5990 tree offset = size_zero_node;
5991 double_int bit_offset = double_int_zero;
5993 /* First get the mode, signedness, and size. We do this from just the
5994 outermost expression. */
5996 if (TREE_CODE (exp) == COMPONENT_REF)
5998 tree field = TREE_OPERAND (exp, 1);
5999 size_tree = DECL_SIZE (field);
6000 if (!DECL_BIT_FIELD (field))
6001 mode = DECL_MODE (field);
6002 else if (DECL_MODE (field) == BLKmode)
6003 blkmode_bitfield = true;
6004 else if (TREE_THIS_VOLATILE (exp)
6005 && flag_strict_volatile_bitfields > 0)
6006 /* Volatile bitfields should be accessed in the mode of the
6007 field's type, not the mode computed based on the bit
6009 mode = TYPE_MODE (DECL_BIT_FIELD_TYPE (field));
6011 *punsignedp = DECL_UNSIGNED (field);
6013 else if (TREE_CODE (exp) == BIT_FIELD_REF)
6015 size_tree = TREE_OPERAND (exp, 1);
6016 *punsignedp = (! INTEGRAL_TYPE_P (TREE_TYPE (exp))
6017 || TYPE_UNSIGNED (TREE_TYPE (exp)));
6019 /* For vector types, with the correct size of access, use the mode of
6021 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == VECTOR_TYPE
6022 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))
6023 && tree_int_cst_equal (size_tree, TYPE_SIZE (TREE_TYPE (exp))))
6024 mode = TYPE_MODE (TREE_TYPE (exp));
6028 mode = TYPE_MODE (TREE_TYPE (exp));
6029 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
6031 if (mode == BLKmode)
6032 size_tree = TYPE_SIZE (TREE_TYPE (exp));
6034 *pbitsize = GET_MODE_BITSIZE (mode);
6039 if (! host_integerp (size_tree, 1))
6040 mode = BLKmode, *pbitsize = -1;
6042 *pbitsize = tree_low_cst (size_tree, 1);
6045 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6046 and find the ultimate containing object. */
6049 switch (TREE_CODE (exp))
6053 = double_int_add (bit_offset,
6054 tree_to_double_int (TREE_OPERAND (exp, 2)));
6059 tree field = TREE_OPERAND (exp, 1);
6060 tree this_offset = component_ref_field_offset (exp);
6062 /* If this field hasn't been filled in yet, don't go past it.
6063 This should only happen when folding expressions made during
6064 type construction. */
6065 if (this_offset == 0)
6068 offset = size_binop (PLUS_EXPR, offset, this_offset);
6069 bit_offset = double_int_add (bit_offset,
6071 (DECL_FIELD_BIT_OFFSET (field)));
6073 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6078 case ARRAY_RANGE_REF:
6080 tree index = TREE_OPERAND (exp, 1);
6081 tree low_bound = array_ref_low_bound (exp);
6082 tree unit_size = array_ref_element_size (exp);
6084 /* We assume all arrays have sizes that are a multiple of a byte.
6085 First subtract the lower bound, if any, in the type of the
6086 index, then convert to sizetype and multiply by the size of
6087 the array element. */
6088 if (! integer_zerop (low_bound))
6089 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
6092 offset = size_binop (PLUS_EXPR, offset,
6093 size_binop (MULT_EXPR,
6094 fold_convert (sizetype, index),
6103 bit_offset = double_int_add (bit_offset,
6104 uhwi_to_double_int (*pbitsize));
6107 case VIEW_CONVERT_EXPR:
6108 if (keep_aligning && STRICT_ALIGNMENT
6109 && (TYPE_ALIGN (TREE_TYPE (exp))
6110 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
6111 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
6112 < BIGGEST_ALIGNMENT)
6113 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
6114 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
6119 /* Hand back the decl for MEM[&decl, off]. */
6120 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)
6122 tree off = TREE_OPERAND (exp, 1);
6123 if (!integer_zerop (off))
6125 double_int boff, coff = mem_ref_offset (exp);
6126 boff = double_int_lshift (coff,
6128 ? 3 : exact_log2 (BITS_PER_UNIT),
6129 HOST_BITS_PER_DOUBLE_INT, true);
6130 bit_offset = double_int_add (bit_offset, boff);
6132 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
6140 /* If any reference in the chain is volatile, the effect is volatile. */
6141 if (TREE_THIS_VOLATILE (exp))
6144 exp = TREE_OPERAND (exp, 0);
6148 /* If OFFSET is constant, see if we can return the whole thing as a
6149 constant bit position. Make sure to handle overflow during
6151 if (host_integerp (offset, 0))
6153 double_int tem = double_int_lshift (tree_to_double_int (offset),
6155 ? 3 : exact_log2 (BITS_PER_UNIT),
6156 HOST_BITS_PER_DOUBLE_INT, true);
6157 tem = double_int_add (tem, bit_offset);
6158 if (double_int_fits_in_shwi_p (tem))
6160 *pbitpos = double_int_to_shwi (tem);
6161 *poffset = offset = NULL_TREE;
6165 /* Otherwise, split it up. */
6168 *pbitpos = double_int_to_shwi (bit_offset);
6172 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6173 if (mode == VOIDmode
6175 && (*pbitpos % BITS_PER_UNIT) == 0
6176 && (*pbitsize % BITS_PER_UNIT) == 0)
6184 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
6185 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
6186 EXP is marked as PACKED. */
6189 contains_packed_reference (const_tree exp)
6191 bool packed_p = false;
6195 switch (TREE_CODE (exp))
6199 tree field = TREE_OPERAND (exp, 1);
6200 packed_p = DECL_PACKED (field)
6201 || TYPE_PACKED (TREE_TYPE (field))
6202 || TYPE_PACKED (TREE_TYPE (exp));
6210 case ARRAY_RANGE_REF:
6213 case VIEW_CONVERT_EXPR:
6219 exp = TREE_OPERAND (exp, 0);
6225 /* Return a tree of sizetype representing the size, in bytes, of the element
6226 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6229 array_ref_element_size (tree exp)
6231 tree aligned_size = TREE_OPERAND (exp, 3);
6232 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6233 location_t loc = EXPR_LOCATION (exp);
6235 /* If a size was specified in the ARRAY_REF, it's the size measured
6236 in alignment units of the element type. So multiply by that value. */
6239 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6240 sizetype from another type of the same width and signedness. */
6241 if (TREE_TYPE (aligned_size) != sizetype)
6242 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
6243 return size_binop_loc (loc, MULT_EXPR, aligned_size,
6244 size_int (TYPE_ALIGN_UNIT (elmt_type)));
6247 /* Otherwise, take the size from that of the element type. Substitute
6248 any PLACEHOLDER_EXPR that we have. */
6250 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
6253 /* Return a tree representing the lower bound of the array mentioned in
6254 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6257 array_ref_low_bound (tree exp)
6259 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6261 /* If a lower bound is specified in EXP, use it. */
6262 if (TREE_OPERAND (exp, 2))
6263 return TREE_OPERAND (exp, 2);
6265 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6266 substituting for a PLACEHOLDER_EXPR as needed. */
6267 if (domain_type && TYPE_MIN_VALUE (domain_type))
6268 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
6270 /* Otherwise, return a zero of the appropriate type. */
6271 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
6274 /* Return a tree representing the upper bound of the array mentioned in
6275 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6278 array_ref_up_bound (tree exp)
6280 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6282 /* If there is a domain type and it has an upper bound, use it, substituting
6283 for a PLACEHOLDER_EXPR as needed. */
6284 if (domain_type && TYPE_MAX_VALUE (domain_type))
6285 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
6287 /* Otherwise fail. */
6291 /* Return a tree representing the offset, in bytes, of the field referenced
6292 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6295 component_ref_field_offset (tree exp)
6297 tree aligned_offset = TREE_OPERAND (exp, 2);
6298 tree field = TREE_OPERAND (exp, 1);
6299 location_t loc = EXPR_LOCATION (exp);
6301 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6302 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6306 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6307 sizetype from another type of the same width and signedness. */
6308 if (TREE_TYPE (aligned_offset) != sizetype)
6309 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
6310 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
6311 size_int (DECL_OFFSET_ALIGN (field)
6315 /* Otherwise, take the offset from that of the field. Substitute
6316 any PLACEHOLDER_EXPR that we have. */
6318 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
6321 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6323 static unsigned HOST_WIDE_INT
6324 target_align (const_tree target)
6326 /* We might have a chain of nested references with intermediate misaligning
6327 bitfields components, so need to recurse to find out. */
6329 unsigned HOST_WIDE_INT this_align, outer_align;
6331 switch (TREE_CODE (target))
6337 this_align = DECL_ALIGN (TREE_OPERAND (target, 1));
6338 outer_align = target_align (TREE_OPERAND (target, 0));
6339 return MIN (this_align, outer_align);
6342 case ARRAY_RANGE_REF:
6343 this_align = TYPE_ALIGN (TREE_TYPE (target));
6344 outer_align = target_align (TREE_OPERAND (target, 0));
6345 return MIN (this_align, outer_align);
6348 case NON_LVALUE_EXPR:
6349 case VIEW_CONVERT_EXPR:
6350 this_align = TYPE_ALIGN (TREE_TYPE (target));
6351 outer_align = target_align (TREE_OPERAND (target, 0));
6352 return MAX (this_align, outer_align);
6355 return TYPE_ALIGN (TREE_TYPE (target));
6360 /* Given an rtx VALUE that may contain additions and multiplications, return
6361 an equivalent value that just refers to a register, memory, or constant.
6362 This is done by generating instructions to perform the arithmetic and
6363 returning a pseudo-register containing the value.
6365 The returned value may be a REG, SUBREG, MEM or constant. */
6368 force_operand (rtx value, rtx target)
6371 /* Use subtarget as the target for operand 0 of a binary operation. */
6372 rtx subtarget = get_subtarget (target);
6373 enum rtx_code code = GET_CODE (value);
6375 /* Check for subreg applied to an expression produced by loop optimizer. */
6377 && !REG_P (SUBREG_REG (value))
6378 && !MEM_P (SUBREG_REG (value)))
6381 = simplify_gen_subreg (GET_MODE (value),
6382 force_reg (GET_MODE (SUBREG_REG (value)),
6383 force_operand (SUBREG_REG (value),
6385 GET_MODE (SUBREG_REG (value)),
6386 SUBREG_BYTE (value));
6387 code = GET_CODE (value);
6390 /* Check for a PIC address load. */
6391 if ((code == PLUS || code == MINUS)
6392 && XEXP (value, 0) == pic_offset_table_rtx
6393 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
6394 || GET_CODE (XEXP (value, 1)) == LABEL_REF
6395 || GET_CODE (XEXP (value, 1)) == CONST))
6398 subtarget = gen_reg_rtx (GET_MODE (value));
6399 emit_move_insn (subtarget, value);
6403 if (ARITHMETIC_P (value))
6405 op2 = XEXP (value, 1);
6406 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
6408 if (code == MINUS && CONST_INT_P (op2))
6411 op2 = negate_rtx (GET_MODE (value), op2);
6414 /* Check for an addition with OP2 a constant integer and our first
6415 operand a PLUS of a virtual register and something else. In that
6416 case, we want to emit the sum of the virtual register and the
6417 constant first and then add the other value. This allows virtual
6418 register instantiation to simply modify the constant rather than
6419 creating another one around this addition. */
6420 if (code == PLUS && CONST_INT_P (op2)
6421 && GET_CODE (XEXP (value, 0)) == PLUS
6422 && REG_P (XEXP (XEXP (value, 0), 0))
6423 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6424 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
6426 rtx temp = expand_simple_binop (GET_MODE (value), code,
6427 XEXP (XEXP (value, 0), 0), op2,
6428 subtarget, 0, OPTAB_LIB_WIDEN);
6429 return expand_simple_binop (GET_MODE (value), code, temp,
6430 force_operand (XEXP (XEXP (value,
6432 target, 0, OPTAB_LIB_WIDEN);
6435 op1 = force_operand (XEXP (value, 0), subtarget);
6436 op2 = force_operand (op2, NULL_RTX);
6440 return expand_mult (GET_MODE (value), op1, op2, target, 1);
6442 if (!INTEGRAL_MODE_P (GET_MODE (value)))
6443 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6444 target, 1, OPTAB_LIB_WIDEN);
6446 return expand_divmod (0,
6447 FLOAT_MODE_P (GET_MODE (value))
6448 ? RDIV_EXPR : TRUNC_DIV_EXPR,
6449 GET_MODE (value), op1, op2, target, 0);
6451 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6454 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
6457 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6460 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6461 target, 0, OPTAB_LIB_WIDEN);
6463 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6464 target, 1, OPTAB_LIB_WIDEN);
6467 if (UNARY_P (value))
6470 target = gen_reg_rtx (GET_MODE (value));
6471 op1 = force_operand (XEXP (value, 0), NULL_RTX);
6478 case FLOAT_TRUNCATE:
6479 convert_move (target, op1, code == ZERO_EXTEND);
6484 expand_fix (target, op1, code == UNSIGNED_FIX);
6488 case UNSIGNED_FLOAT:
6489 expand_float (target, op1, code == UNSIGNED_FLOAT);
6493 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
6497 #ifdef INSN_SCHEDULING
6498 /* On machines that have insn scheduling, we want all memory reference to be
6499 explicit, so we need to deal with such paradoxical SUBREGs. */
6500 if (paradoxical_subreg_p (value) && MEM_P (SUBREG_REG (value)))
6502 = simplify_gen_subreg (GET_MODE (value),
6503 force_reg (GET_MODE (SUBREG_REG (value)),
6504 force_operand (SUBREG_REG (value),
6506 GET_MODE (SUBREG_REG (value)),
6507 SUBREG_BYTE (value));
6513 /* Subroutine of expand_expr: return nonzero iff there is no way that
6514 EXP can reference X, which is being modified. TOP_P is nonzero if this
6515 call is going to be used to determine whether we need a temporary
6516 for EXP, as opposed to a recursive call to this function.
6518 It is always safe for this routine to return zero since it merely
6519 searches for optimization opportunities. */
6522 safe_from_p (const_rtx x, tree exp, int top_p)
6528 /* If EXP has varying size, we MUST use a target since we currently
6529 have no way of allocating temporaries of variable size
6530 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6531 So we assume here that something at a higher level has prevented a
6532 clash. This is somewhat bogus, but the best we can do. Only
6533 do this when X is BLKmode and when we are at the top level. */
6534 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6535 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
6536 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
6537 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
6538 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
6540 && GET_MODE (x) == BLKmode)
6541 /* If X is in the outgoing argument area, it is always safe. */
6543 && (XEXP (x, 0) == virtual_outgoing_args_rtx
6544 || (GET_CODE (XEXP (x, 0)) == PLUS
6545 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
6548 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6549 find the underlying pseudo. */
6550 if (GET_CODE (x) == SUBREG)
6553 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6557 /* Now look at our tree code and possibly recurse. */
6558 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
6560 case tcc_declaration:
6561 exp_rtl = DECL_RTL_IF_SET (exp);
6567 case tcc_exceptional:
6568 if (TREE_CODE (exp) == TREE_LIST)
6572 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
6574 exp = TREE_CHAIN (exp);
6577 if (TREE_CODE (exp) != TREE_LIST)
6578 return safe_from_p (x, exp, 0);
6581 else if (TREE_CODE (exp) == CONSTRUCTOR)
6583 constructor_elt *ce;
6584 unsigned HOST_WIDE_INT idx;
6586 FOR_EACH_VEC_ELT (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce)
6587 if ((ce->index != NULL_TREE && !safe_from_p (x, ce->index, 0))
6588 || !safe_from_p (x, ce->value, 0))
6592 else if (TREE_CODE (exp) == ERROR_MARK)
6593 return 1; /* An already-visited SAVE_EXPR? */
6598 /* The only case we look at here is the DECL_INITIAL inside a
6600 return (TREE_CODE (exp) != DECL_EXPR
6601 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
6602 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
6603 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
6606 case tcc_comparison:
6607 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
6612 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6614 case tcc_expression:
6617 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6618 the expression. If it is set, we conflict iff we are that rtx or
6619 both are in memory. Otherwise, we check all operands of the
6620 expression recursively. */
6622 switch (TREE_CODE (exp))
6625 /* If the operand is static or we are static, we can't conflict.
6626 Likewise if we don't conflict with the operand at all. */
6627 if (staticp (TREE_OPERAND (exp, 0))
6628 || TREE_STATIC (exp)
6629 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
6632 /* Otherwise, the only way this can conflict is if we are taking
6633 the address of a DECL a that address if part of X, which is
6635 exp = TREE_OPERAND (exp, 0);
6638 if (!DECL_RTL_SET_P (exp)
6639 || !MEM_P (DECL_RTL (exp)))
6642 exp_rtl = XEXP (DECL_RTL (exp), 0);
6648 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
6649 get_alias_set (exp)))
6654 /* Assume that the call will clobber all hard registers and
6656 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6661 case WITH_CLEANUP_EXPR:
6662 case CLEANUP_POINT_EXPR:
6663 /* Lowered by gimplify.c. */
6667 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6673 /* If we have an rtx, we do not need to scan our operands. */
6677 nops = TREE_OPERAND_LENGTH (exp);
6678 for (i = 0; i < nops; i++)
6679 if (TREE_OPERAND (exp, i) != 0
6680 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
6686 /* Should never get a type here. */
6690 /* If we have an rtl, find any enclosed object. Then see if we conflict
6694 if (GET_CODE (exp_rtl) == SUBREG)
6696 exp_rtl = SUBREG_REG (exp_rtl);
6698 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
6702 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6703 are memory and they conflict. */
6704 return ! (rtx_equal_p (x, exp_rtl)
6705 || (MEM_P (x) && MEM_P (exp_rtl)
6706 && true_dependence (exp_rtl, VOIDmode, x,
6707 rtx_addr_varies_p)));
6710 /* If we reach here, it is safe. */
6715 /* Return the highest power of two that EXP is known to be a multiple of.
6716 This is used in updating alignment of MEMs in array references. */
6718 unsigned HOST_WIDE_INT
6719 highest_pow2_factor (const_tree exp)
6721 unsigned HOST_WIDE_INT c0, c1;
6723 switch (TREE_CODE (exp))
6726 /* We can find the lowest bit that's a one. If the low
6727 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6728 We need to handle this case since we can find it in a COND_EXPR,
6729 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
6730 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6732 if (TREE_OVERFLOW (exp))
6733 return BIGGEST_ALIGNMENT;
6736 /* Note: tree_low_cst is intentionally not used here,
6737 we don't care about the upper bits. */
6738 c0 = TREE_INT_CST_LOW (exp);
6740 return c0 ? c0 : BIGGEST_ALIGNMENT;
6744 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6745 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6746 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6747 return MIN (c0, c1);
6750 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6751 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6754 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6756 if (integer_pow2p (TREE_OPERAND (exp, 1))
6757 && host_integerp (TREE_OPERAND (exp, 1), 1))
6759 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6760 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6761 return MAX (1, c0 / c1);
6766 /* The highest power of two of a bit-and expression is the maximum of
6767 that of its operands. We typically get here for a complex LHS and
6768 a constant negative power of two on the RHS to force an explicit
6769 alignment, so don't bother looking at the LHS. */
6770 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6774 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6777 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6780 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6781 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6782 return MIN (c0, c1);
6791 /* Similar, except that the alignment requirements of TARGET are
6792 taken into account. Assume it is at least as aligned as its
6793 type, unless it is a COMPONENT_REF in which case the layout of
6794 the structure gives the alignment. */
6796 static unsigned HOST_WIDE_INT
6797 highest_pow2_factor_for_target (const_tree target, const_tree exp)
6799 unsigned HOST_WIDE_INT talign = target_align (target) / BITS_PER_UNIT;
6800 unsigned HOST_WIDE_INT factor = highest_pow2_factor (exp);
6802 return MAX (factor, talign);
6805 /* Subroutine of expand_expr. Expand the two operands of a binary
6806 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6807 The value may be stored in TARGET if TARGET is nonzero. The
6808 MODIFIER argument is as documented by expand_expr. */
6811 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6812 enum expand_modifier modifier)
6814 if (! safe_from_p (target, exp1, 1))
6816 if (operand_equal_p (exp0, exp1, 0))
6818 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6819 *op1 = copy_rtx (*op0);
6823 /* If we need to preserve evaluation order, copy exp0 into its own
6824 temporary variable so that it can't be clobbered by exp1. */
6825 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6826 exp0 = save_expr (exp0);
6827 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6828 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6833 /* Return a MEM that contains constant EXP. DEFER is as for
6834 output_constant_def and MODIFIER is as for expand_expr. */
6837 expand_expr_constant (tree exp, int defer, enum expand_modifier modifier)
6841 mem = output_constant_def (exp, defer);
6842 if (modifier != EXPAND_INITIALIZER)
6843 mem = use_anchored_address (mem);
6847 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6848 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6851 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
6852 enum expand_modifier modifier, addr_space_t as)
6854 rtx result, subtarget;
6856 HOST_WIDE_INT bitsize, bitpos;
6857 int volatilep, unsignedp;
6858 enum machine_mode mode1;
6860 /* If we are taking the address of a constant and are at the top level,
6861 we have to use output_constant_def since we can't call force_const_mem
6863 /* ??? This should be considered a front-end bug. We should not be
6864 generating ADDR_EXPR of something that isn't an LVALUE. The only
6865 exception here is STRING_CST. */
6866 if (CONSTANT_CLASS_P (exp))
6867 return XEXP (expand_expr_constant (exp, 0, modifier), 0);
6869 /* Everything must be something allowed by is_gimple_addressable. */
6870 switch (TREE_CODE (exp))
6873 /* This case will happen via recursion for &a->b. */
6874 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6878 tree tem = TREE_OPERAND (exp, 0);
6879 if (!integer_zerop (TREE_OPERAND (exp, 1)))
6880 tem = build2 (POINTER_PLUS_EXPR, TREE_TYPE (TREE_OPERAND (exp, 1)),
6882 double_int_to_tree (sizetype, mem_ref_offset (exp)));
6883 return expand_expr (tem, target, tmode, modifier);
6887 /* Expand the initializer like constants above. */
6888 return XEXP (expand_expr_constant (DECL_INITIAL (exp), 0, modifier), 0);
6891 /* The real part of the complex number is always first, therefore
6892 the address is the same as the address of the parent object. */
6895 inner = TREE_OPERAND (exp, 0);
6899 /* The imaginary part of the complex number is always second.
6900 The expression is therefore always offset by the size of the
6903 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
6904 inner = TREE_OPERAND (exp, 0);
6908 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6909 expand_expr, as that can have various side effects; LABEL_DECLs for
6910 example, may not have their DECL_RTL set yet. Expand the rtl of
6911 CONSTRUCTORs too, which should yield a memory reference for the
6912 constructor's contents. Assume language specific tree nodes can
6913 be expanded in some interesting way. */
6914 gcc_assert (TREE_CODE (exp) < LAST_AND_UNUSED_TREE_CODE);
6916 || TREE_CODE (exp) == CONSTRUCTOR
6917 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
6919 result = expand_expr (exp, target, tmode,
6920 modifier == EXPAND_INITIALIZER
6921 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
6923 /* If the DECL isn't in memory, then the DECL wasn't properly
6924 marked TREE_ADDRESSABLE, which will be either a front-end
6925 or a tree optimizer bug. */
6926 gcc_assert (MEM_P (result));
6927 result = XEXP (result, 0);
6929 /* ??? Is this needed anymore? */
6930 if (DECL_P (exp) && !TREE_USED (exp) == 0)
6932 assemble_external (exp);
6933 TREE_USED (exp) = 1;
6936 if (modifier != EXPAND_INITIALIZER
6937 && modifier != EXPAND_CONST_ADDRESS)
6938 result = force_operand (result, target);
6942 /* Pass FALSE as the last argument to get_inner_reference although
6943 we are expanding to RTL. The rationale is that we know how to
6944 handle "aligning nodes" here: we can just bypass them because
6945 they won't change the final object whose address will be returned
6946 (they actually exist only for that purpose). */
6947 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6948 &mode1, &unsignedp, &volatilep, false);
6952 /* We must have made progress. */
6953 gcc_assert (inner != exp);
6955 subtarget = offset || bitpos ? NULL_RTX : target;
6956 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
6957 inner alignment, force the inner to be sufficiently aligned. */
6958 if (CONSTANT_CLASS_P (inner)
6959 && TYPE_ALIGN (TREE_TYPE (inner)) < TYPE_ALIGN (TREE_TYPE (exp)))
6961 inner = copy_node (inner);
6962 TREE_TYPE (inner) = copy_node (TREE_TYPE (inner));
6963 TYPE_ALIGN (TREE_TYPE (inner)) = TYPE_ALIGN (TREE_TYPE (exp));
6964 TYPE_USER_ALIGN (TREE_TYPE (inner)) = 1;
6966 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier, as);
6972 if (modifier != EXPAND_NORMAL)
6973 result = force_operand (result, NULL);
6974 tmp = expand_expr (offset, NULL_RTX, tmode,
6975 modifier == EXPAND_INITIALIZER
6976 ? EXPAND_INITIALIZER : EXPAND_NORMAL);
6978 result = convert_memory_address_addr_space (tmode, result, as);
6979 tmp = convert_memory_address_addr_space (tmode, tmp, as);
6981 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
6982 result = simplify_gen_binary (PLUS, tmode, result, tmp);
6985 subtarget = bitpos ? NULL_RTX : target;
6986 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
6987 1, OPTAB_LIB_WIDEN);
6993 /* Someone beforehand should have rejected taking the address
6994 of such an object. */
6995 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
6997 result = plus_constant (result, bitpos / BITS_PER_UNIT);
6998 if (modifier < EXPAND_SUM)
6999 result = force_operand (result, target);
7005 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
7006 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7009 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
7010 enum expand_modifier modifier)
7012 addr_space_t as = ADDR_SPACE_GENERIC;
7013 enum machine_mode address_mode = Pmode;
7014 enum machine_mode pointer_mode = ptr_mode;
7015 enum machine_mode rmode;
7018 /* Target mode of VOIDmode says "whatever's natural". */
7019 if (tmode == VOIDmode)
7020 tmode = TYPE_MODE (TREE_TYPE (exp));
7022 if (POINTER_TYPE_P (TREE_TYPE (exp)))
7024 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
7025 address_mode = targetm.addr_space.address_mode (as);
7026 pointer_mode = targetm.addr_space.pointer_mode (as);
7029 /* We can get called with some Weird Things if the user does silliness
7030 like "(short) &a". In that case, convert_memory_address won't do
7031 the right thing, so ignore the given target mode. */
7032 if (tmode != address_mode && tmode != pointer_mode)
7033 tmode = address_mode;
7035 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
7036 tmode, modifier, as);
7038 /* Despite expand_expr claims concerning ignoring TMODE when not
7039 strictly convenient, stuff breaks if we don't honor it. Note
7040 that combined with the above, we only do this for pointer modes. */
7041 rmode = GET_MODE (result);
7042 if (rmode == VOIDmode)
7045 result = convert_memory_address_addr_space (tmode, result, as);
7050 /* Generate code for computing CONSTRUCTOR EXP.
7051 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7052 is TRUE, instead of creating a temporary variable in memory
7053 NULL is returned and the caller needs to handle it differently. */
7056 expand_constructor (tree exp, rtx target, enum expand_modifier modifier,
7057 bool avoid_temp_mem)
7059 tree type = TREE_TYPE (exp);
7060 enum machine_mode mode = TYPE_MODE (type);
7062 /* Try to avoid creating a temporary at all. This is possible
7063 if all of the initializer is zero.
7064 FIXME: try to handle all [0..255] initializers we can handle
7066 if (TREE_STATIC (exp)
7067 && !TREE_ADDRESSABLE (exp)
7068 && target != 0 && mode == BLKmode
7069 && all_zeros_p (exp))
7071 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
7075 /* All elts simple constants => refer to a constant in memory. But
7076 if this is a non-BLKmode mode, let it store a field at a time
7077 since that should make a CONST_INT or CONST_DOUBLE when we
7078 fold. Likewise, if we have a target we can use, it is best to
7079 store directly into the target unless the type is large enough
7080 that memcpy will be used. If we are making an initializer and
7081 all operands are constant, put it in memory as well.
7083 FIXME: Avoid trying to fill vector constructors piece-meal.
7084 Output them with output_constant_def below unless we're sure
7085 they're zeros. This should go away when vector initializers
7086 are treated like VECTOR_CST instead of arrays. */
7087 if ((TREE_STATIC (exp)
7088 && ((mode == BLKmode
7089 && ! (target != 0 && safe_from_p (target, exp, 1)))
7090 || TREE_ADDRESSABLE (exp)
7091 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7092 && (! MOVE_BY_PIECES_P
7093 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7095 && ! mostly_zeros_p (exp))))
7096 || ((modifier == EXPAND_INITIALIZER || modifier == EXPAND_CONST_ADDRESS)
7097 && TREE_CONSTANT (exp)))
7104 constructor = expand_expr_constant (exp, 1, modifier);
7106 if (modifier != EXPAND_CONST_ADDRESS
7107 && modifier != EXPAND_INITIALIZER
7108 && modifier != EXPAND_SUM)
7109 constructor = validize_mem (constructor);
7114 /* Handle calls that pass values in multiple non-contiguous
7115 locations. The Irix 6 ABI has examples of this. */
7116 if (target == 0 || ! safe_from_p (target, exp, 1)
7117 || GET_CODE (target) == PARALLEL || modifier == EXPAND_STACK_PARM)
7123 = assign_temp (build_qualified_type (type, (TYPE_QUALS (type)
7124 | (TREE_READONLY (exp)
7125 * TYPE_QUAL_CONST))),
7126 0, TREE_ADDRESSABLE (exp), 1);
7129 store_constructor (exp, target, 0, int_expr_size (exp));
7134 /* expand_expr: generate code for computing expression EXP.
7135 An rtx for the computed value is returned. The value is never null.
7136 In the case of a void EXP, const0_rtx is returned.
7138 The value may be stored in TARGET if TARGET is nonzero.
7139 TARGET is just a suggestion; callers must assume that
7140 the rtx returned may not be the same as TARGET.
7142 If TARGET is CONST0_RTX, it means that the value will be ignored.
7144 If TMODE is not VOIDmode, it suggests generating the
7145 result in mode TMODE. But this is done only when convenient.
7146 Otherwise, TMODE is ignored and the value generated in its natural mode.
7147 TMODE is just a suggestion; callers must assume that
7148 the rtx returned may not have mode TMODE.
7150 Note that TARGET may have neither TMODE nor MODE. In that case, it
7151 probably will not be used.
7153 If MODIFIER is EXPAND_SUM then when EXP is an addition
7154 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7155 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7156 products as above, or REG or MEM, or constant.
7157 Ordinarily in such cases we would output mul or add instructions
7158 and then return a pseudo reg containing the sum.
7160 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7161 it also marks a label as absolutely required (it can't be dead).
7162 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7163 This is used for outputting expressions used in initializers.
7165 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7166 with a constant address even if that address is not normally legitimate.
7167 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7169 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7170 a call parameter. Such targets require special care as we haven't yet
7171 marked TARGET so that it's safe from being trashed by libcalls. We
7172 don't want to use TARGET for anything but the final result;
7173 Intermediate values must go elsewhere. Additionally, calls to
7174 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7176 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7177 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7178 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7179 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7183 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
7184 enum expand_modifier modifier, rtx *alt_rtl)
7188 /* Handle ERROR_MARK before anybody tries to access its type. */
7189 if (TREE_CODE (exp) == ERROR_MARK
7190 || (TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK))
7192 ret = CONST0_RTX (tmode);
7193 return ret ? ret : const0_rtx;
7196 /* If this is an expression of some kind and it has an associated line
7197 number, then emit the line number before expanding the expression.
7199 We need to save and restore the file and line information so that
7200 errors discovered during expansion are emitted with the right
7201 information. It would be better of the diagnostic routines
7202 used the file/line information embedded in the tree nodes rather
7204 if (cfun && EXPR_HAS_LOCATION (exp))
7206 location_t saved_location = input_location;
7207 location_t saved_curr_loc = get_curr_insn_source_location ();
7208 tree saved_block = get_curr_insn_block ();
7209 input_location = EXPR_LOCATION (exp);
7210 set_curr_insn_source_location (input_location);
7212 /* Record where the insns produced belong. */
7213 set_curr_insn_block (TREE_BLOCK (exp));
7215 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7217 input_location = saved_location;
7218 set_curr_insn_block (saved_block);
7219 set_curr_insn_source_location (saved_curr_loc);
7223 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7230 expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
7231 enum expand_modifier modifier)
7233 rtx op0, op1, op2, temp;
7236 enum machine_mode mode;
7237 enum tree_code code = ops->code;
7239 rtx subtarget, original_target;
7241 bool reduce_bit_field;
7242 location_t loc = ops->location;
7243 tree treeop0, treeop1, treeop2;
7244 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
7245 ? reduce_to_bit_field_precision ((expr), \
7251 mode = TYPE_MODE (type);
7252 unsignedp = TYPE_UNSIGNED (type);
7258 /* We should be called only on simple (binary or unary) expressions,
7259 exactly those that are valid in gimple expressions that aren't
7260 GIMPLE_SINGLE_RHS (or invalid). */
7261 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS
7262 || get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS
7263 || get_gimple_rhs_class (code) == GIMPLE_TERNARY_RHS);
7265 ignore = (target == const0_rtx
7266 || ((CONVERT_EXPR_CODE_P (code)
7267 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
7268 && TREE_CODE (type) == VOID_TYPE));
7270 /* We should be called only if we need the result. */
7271 gcc_assert (!ignore);
7273 /* An operation in what may be a bit-field type needs the
7274 result to be reduced to the precision of the bit-field type,
7275 which is narrower than that of the type's mode. */
7276 reduce_bit_field = (INTEGRAL_TYPE_P (type)
7277 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
7279 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
7282 /* Use subtarget as the target for operand 0 of a binary operation. */
7283 subtarget = get_subtarget (target);
7284 original_target = target;
7288 case NON_LVALUE_EXPR:
7291 if (treeop0 == error_mark_node)
7294 if (TREE_CODE (type) == UNION_TYPE)
7296 tree valtype = TREE_TYPE (treeop0);
7298 /* If both input and output are BLKmode, this conversion isn't doing
7299 anything except possibly changing memory attribute. */
7300 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7302 rtx result = expand_expr (treeop0, target, tmode,
7305 result = copy_rtx (result);
7306 set_mem_attributes (result, type, 0);
7312 if (TYPE_MODE (type) != BLKmode)
7313 target = gen_reg_rtx (TYPE_MODE (type));
7315 target = assign_temp (type, 0, 1, 1);
7319 /* Store data into beginning of memory target. */
7320 store_expr (treeop0,
7321 adjust_address (target, TYPE_MODE (valtype), 0),
7322 modifier == EXPAND_STACK_PARM,
7327 gcc_assert (REG_P (target));
7329 /* Store this field into a union of the proper type. */
7330 store_field (target,
7331 MIN ((int_size_in_bytes (TREE_TYPE
7334 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7335 0, TYPE_MODE (valtype), treeop0,
7339 /* Return the entire union. */
7343 if (mode == TYPE_MODE (TREE_TYPE (treeop0)))
7345 op0 = expand_expr (treeop0, target, VOIDmode,
7348 /* If the signedness of the conversion differs and OP0 is
7349 a promoted SUBREG, clear that indication since we now
7350 have to do the proper extension. */
7351 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)) != unsignedp
7352 && GET_CODE (op0) == SUBREG)
7353 SUBREG_PROMOTED_VAR_P (op0) = 0;
7355 return REDUCE_BIT_FIELD (op0);
7358 op0 = expand_expr (treeop0, NULL_RTX, mode,
7359 modifier == EXPAND_SUM ? EXPAND_NORMAL : modifier);
7360 if (GET_MODE (op0) == mode)
7363 /* If OP0 is a constant, just convert it into the proper mode. */
7364 else if (CONSTANT_P (op0))
7366 tree inner_type = TREE_TYPE (treeop0);
7367 enum machine_mode inner_mode = GET_MODE (op0);
7369 if (inner_mode == VOIDmode)
7370 inner_mode = TYPE_MODE (inner_type);
7372 if (modifier == EXPAND_INITIALIZER)
7373 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7374 subreg_lowpart_offset (mode,
7377 op0= convert_modes (mode, inner_mode, op0,
7378 TYPE_UNSIGNED (inner_type));
7381 else if (modifier == EXPAND_INITIALIZER)
7382 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7384 else if (target == 0)
7385 op0 = convert_to_mode (mode, op0,
7386 TYPE_UNSIGNED (TREE_TYPE
7390 convert_move (target, op0,
7391 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7395 return REDUCE_BIT_FIELD (op0);
7397 case ADDR_SPACE_CONVERT_EXPR:
7399 tree treeop0_type = TREE_TYPE (treeop0);
7401 addr_space_t as_from;
7403 gcc_assert (POINTER_TYPE_P (type));
7404 gcc_assert (POINTER_TYPE_P (treeop0_type));
7406 as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
7407 as_from = TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type));
7409 /* Conversions between pointers to the same address space should
7410 have been implemented via CONVERT_EXPR / NOP_EXPR. */
7411 gcc_assert (as_to != as_from);
7413 /* Ask target code to handle conversion between pointers
7414 to overlapping address spaces. */
7415 if (targetm.addr_space.subset_p (as_to, as_from)
7416 || targetm.addr_space.subset_p (as_from, as_to))
7418 op0 = expand_expr (treeop0, NULL_RTX, VOIDmode, modifier);
7419 op0 = targetm.addr_space.convert (op0, treeop0_type, type);
7424 /* For disjoint address spaces, converting anything but
7425 a null pointer invokes undefined behaviour. We simply
7426 always return a null pointer here. */
7427 return CONST0_RTX (mode);
7430 case POINTER_PLUS_EXPR:
7431 /* Even though the sizetype mode and the pointer's mode can be different
7432 expand is able to handle this correctly and get the correct result out
7433 of the PLUS_EXPR code. */
7434 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
7435 if sizetype precision is smaller than pointer precision. */
7436 if (TYPE_PRECISION (sizetype) < TYPE_PRECISION (type))
7437 treeop1 = fold_convert_loc (loc, type,
7438 fold_convert_loc (loc, ssizetype,
7441 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7442 something else, make sure we add the register to the constant and
7443 then to the other thing. This case can occur during strength
7444 reduction and doing it this way will produce better code if the
7445 frame pointer or argument pointer is eliminated.
7447 fold-const.c will ensure that the constant is always in the inner
7448 PLUS_EXPR, so the only case we need to do anything about is if
7449 sp, ap, or fp is our second argument, in which case we must swap
7450 the innermost first argument and our second argument. */
7452 if (TREE_CODE (treeop0) == PLUS_EXPR
7453 && TREE_CODE (TREE_OPERAND (treeop0, 1)) == INTEGER_CST
7454 && TREE_CODE (treeop1) == VAR_DECL
7455 && (DECL_RTL (treeop1) == frame_pointer_rtx
7456 || DECL_RTL (treeop1) == stack_pointer_rtx
7457 || DECL_RTL (treeop1) == arg_pointer_rtx))
7461 treeop1 = TREE_OPERAND (treeop0, 0);
7462 TREE_OPERAND (treeop0, 0) = t;
7465 /* If the result is to be ptr_mode and we are adding an integer to
7466 something, we might be forming a constant. So try to use
7467 plus_constant. If it produces a sum and we can't accept it,
7468 use force_operand. This allows P = &ARR[const] to generate
7469 efficient code on machines where a SYMBOL_REF is not a valid
7472 If this is an EXPAND_SUM call, always return the sum. */
7473 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7474 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7476 if (modifier == EXPAND_STACK_PARM)
7478 if (TREE_CODE (treeop0) == INTEGER_CST
7479 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7480 && TREE_CONSTANT (treeop1))
7484 op1 = expand_expr (treeop1, subtarget, VOIDmode,
7486 /* Use immed_double_const to ensure that the constant is
7487 truncated according to the mode of OP1, then sign extended
7488 to a HOST_WIDE_INT. Using the constant directly can result
7489 in non-canonical RTL in a 64x32 cross compile. */
7491 = immed_double_const (TREE_INT_CST_LOW (treeop0),
7493 TYPE_MODE (TREE_TYPE (treeop1)));
7494 op1 = plus_constant (op1, INTVAL (constant_part));
7495 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7496 op1 = force_operand (op1, target);
7497 return REDUCE_BIT_FIELD (op1);
7500 else if (TREE_CODE (treeop1) == INTEGER_CST
7501 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7502 && TREE_CONSTANT (treeop0))
7506 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7507 (modifier == EXPAND_INITIALIZER
7508 ? EXPAND_INITIALIZER : EXPAND_SUM));
7509 if (! CONSTANT_P (op0))
7511 op1 = expand_expr (treeop1, NULL_RTX,
7512 VOIDmode, modifier);
7513 /* Return a PLUS if modifier says it's OK. */
7514 if (modifier == EXPAND_SUM
7515 || modifier == EXPAND_INITIALIZER)
7516 return simplify_gen_binary (PLUS, mode, op0, op1);
7519 /* Use immed_double_const to ensure that the constant is
7520 truncated according to the mode of OP1, then sign extended
7521 to a HOST_WIDE_INT. Using the constant directly can result
7522 in non-canonical RTL in a 64x32 cross compile. */
7524 = immed_double_const (TREE_INT_CST_LOW (treeop1),
7526 TYPE_MODE (TREE_TYPE (treeop0)));
7527 op0 = plus_constant (op0, INTVAL (constant_part));
7528 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7529 op0 = force_operand (op0, target);
7530 return REDUCE_BIT_FIELD (op0);
7534 /* Use TER to expand pointer addition of a negated value
7535 as pointer subtraction. */
7536 if ((POINTER_TYPE_P (TREE_TYPE (treeop0))
7537 || (TREE_CODE (TREE_TYPE (treeop0)) == VECTOR_TYPE
7538 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0)))))
7539 && TREE_CODE (treeop1) == SSA_NAME
7540 && TYPE_MODE (TREE_TYPE (treeop0))
7541 == TYPE_MODE (TREE_TYPE (treeop1)))
7543 gimple def = get_def_for_expr (treeop1, NEGATE_EXPR);
7546 treeop1 = gimple_assign_rhs1 (def);
7552 /* No sense saving up arithmetic to be done
7553 if it's all in the wrong mode to form part of an address.
7554 And force_operand won't know whether to sign-extend or
7556 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7557 || mode != ptr_mode)
7559 expand_operands (treeop0, treeop1,
7560 subtarget, &op0, &op1, EXPAND_NORMAL);
7561 if (op0 == const0_rtx)
7563 if (op1 == const0_rtx)
7568 expand_operands (treeop0, treeop1,
7569 subtarget, &op0, &op1, modifier);
7570 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7574 /* For initializers, we are allowed to return a MINUS of two
7575 symbolic constants. Here we handle all cases when both operands
7577 /* Handle difference of two symbolic constants,
7578 for the sake of an initializer. */
7579 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7580 && really_constant_p (treeop0)
7581 && really_constant_p (treeop1))
7583 expand_operands (treeop0, treeop1,
7584 NULL_RTX, &op0, &op1, modifier);
7586 /* If the last operand is a CONST_INT, use plus_constant of
7587 the negated constant. Else make the MINUS. */
7588 if (CONST_INT_P (op1))
7589 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7591 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7594 /* No sense saving up arithmetic to be done
7595 if it's all in the wrong mode to form part of an address.
7596 And force_operand won't know whether to sign-extend or
7598 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7599 || mode != ptr_mode)
7602 expand_operands (treeop0, treeop1,
7603 subtarget, &op0, &op1, modifier);
7605 /* Convert A - const to A + (-const). */
7606 if (CONST_INT_P (op1))
7608 op1 = negate_rtx (mode, op1);
7609 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7614 case WIDEN_MULT_PLUS_EXPR:
7615 case WIDEN_MULT_MINUS_EXPR:
7616 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
7617 op2 = expand_normal (treeop2);
7618 target = expand_widen_pattern_expr (ops, op0, op1, op2,
7622 case WIDEN_MULT_EXPR:
7623 /* If first operand is constant, swap them.
7624 Thus the following special case checks need only
7625 check the second operand. */
7626 if (TREE_CODE (treeop0) == INTEGER_CST)
7633 /* First, check if we have a multiplication of one signed and one
7634 unsigned operand. */
7635 if (TREE_CODE (treeop1) != INTEGER_CST
7636 && (TYPE_UNSIGNED (TREE_TYPE (treeop0))
7637 != TYPE_UNSIGNED (TREE_TYPE (treeop1))))
7639 enum machine_mode innermode = TYPE_MODE (TREE_TYPE (treeop0));
7640 this_optab = usmul_widen_optab;
7641 if (mode == GET_MODE_2XWIDER_MODE (innermode))
7643 if (optab_handler (this_optab, mode) != CODE_FOR_nothing)
7645 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7646 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
7649 expand_operands (treeop0, treeop1, NULL_RTX, &op1, &op0,
7655 /* Check for a multiplication with matching signedness. */
7656 else if ((TREE_CODE (treeop1) == INTEGER_CST
7657 && int_fits_type_p (treeop1, TREE_TYPE (treeop0)))
7658 || (TYPE_UNSIGNED (TREE_TYPE (treeop1))
7659 == TYPE_UNSIGNED (TREE_TYPE (treeop0))))
7661 tree op0type = TREE_TYPE (treeop0);
7662 enum machine_mode innermode = TYPE_MODE (op0type);
7663 bool zextend_p = TYPE_UNSIGNED (op0type);
7664 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7665 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7667 if (mode == GET_MODE_2XWIDER_MODE (innermode)
7668 && TREE_CODE (treeop0) != INTEGER_CST)
7670 if (optab_handler (this_optab, mode) != CODE_FOR_nothing)
7672 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
7674 temp = expand_widening_mult (mode, op0, op1, target,
7675 unsignedp, this_optab);
7676 return REDUCE_BIT_FIELD (temp);
7678 if (optab_handler (other_optab, mode) != CODE_FOR_nothing
7679 && innermode == word_mode)
7682 op0 = expand_normal (treeop0);
7683 if (TREE_CODE (treeop1) == INTEGER_CST)
7684 op1 = convert_modes (innermode, mode,
7685 expand_normal (treeop1), unsignedp);
7687 op1 = expand_normal (treeop1);
7688 temp = expand_binop (mode, other_optab, op0, op1, target,
7689 unsignedp, OPTAB_LIB_WIDEN);
7690 hipart = gen_highpart (innermode, temp);
7691 htem = expand_mult_highpart_adjust (innermode, hipart,
7695 emit_move_insn (hipart, htem);
7696 return REDUCE_BIT_FIELD (temp);
7700 treeop0 = fold_build1 (CONVERT_EXPR, type, treeop0);
7701 treeop1 = fold_build1 (CONVERT_EXPR, type, treeop1);
7702 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
7703 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7707 optab opt = fma_optab;
7710 /* If there is no insn for FMA, emit it as __builtin_fma{,f,l}
7712 if (optab_handler (fma_optab, mode) == CODE_FOR_nothing)
7714 tree fn = mathfn_built_in (TREE_TYPE (treeop0), BUILT_IN_FMA);
7717 gcc_assert (fn != NULL_TREE);
7718 call_expr = build_call_expr (fn, 3, treeop0, treeop1, treeop2);
7719 return expand_builtin (call_expr, target, subtarget, mode, false);
7722 def0 = get_def_for_expr (treeop0, NEGATE_EXPR);
7723 def2 = get_def_for_expr (treeop2, NEGATE_EXPR);
7728 && optab_handler (fnms_optab, mode) != CODE_FOR_nothing)
7731 op0 = expand_normal (gimple_assign_rhs1 (def0));
7732 op2 = expand_normal (gimple_assign_rhs1 (def2));
7735 && optab_handler (fnma_optab, mode) != CODE_FOR_nothing)
7738 op0 = expand_normal (gimple_assign_rhs1 (def0));
7741 && optab_handler (fms_optab, mode) != CODE_FOR_nothing)
7744 op2 = expand_normal (gimple_assign_rhs1 (def2));
7748 op0 = expand_expr (treeop0, subtarget, VOIDmode, EXPAND_NORMAL);
7750 op2 = expand_normal (treeop2);
7751 op1 = expand_normal (treeop1);
7753 return expand_ternary_op (TYPE_MODE (type), opt,
7754 op0, op1, op2, target, 0);
7758 /* If this is a fixed-point operation, then we cannot use the code
7759 below because "expand_mult" doesn't support sat/no-sat fixed-point
7761 if (ALL_FIXED_POINT_MODE_P (mode))
7764 /* If first operand is constant, swap them.
7765 Thus the following special case checks need only
7766 check the second operand. */
7767 if (TREE_CODE (treeop0) == INTEGER_CST)
7774 /* Attempt to return something suitable for generating an
7775 indexed address, for machines that support that. */
7777 if (modifier == EXPAND_SUM && mode == ptr_mode
7778 && host_integerp (treeop1, 0))
7780 tree exp1 = treeop1;
7782 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7786 op0 = force_operand (op0, NULL_RTX);
7788 op0 = copy_to_mode_reg (mode, op0);
7790 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7791 gen_int_mode (tree_low_cst (exp1, 0),
7792 TYPE_MODE (TREE_TYPE (exp1)))));
7795 if (modifier == EXPAND_STACK_PARM)
7798 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
7799 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7801 case TRUNC_DIV_EXPR:
7802 case FLOOR_DIV_EXPR:
7804 case ROUND_DIV_EXPR:
7805 case EXACT_DIV_EXPR:
7806 /* If this is a fixed-point operation, then we cannot use the code
7807 below because "expand_divmod" doesn't support sat/no-sat fixed-point
7809 if (ALL_FIXED_POINT_MODE_P (mode))
7812 if (modifier == EXPAND_STACK_PARM)
7814 /* Possible optimization: compute the dividend with EXPAND_SUM
7815 then if the divisor is constant can optimize the case
7816 where some terms of the dividend have coeffs divisible by it. */
7817 expand_operands (treeop0, treeop1,
7818 subtarget, &op0, &op1, EXPAND_NORMAL);
7819 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7824 case TRUNC_MOD_EXPR:
7825 case FLOOR_MOD_EXPR:
7827 case ROUND_MOD_EXPR:
7828 if (modifier == EXPAND_STACK_PARM)
7830 expand_operands (treeop0, treeop1,
7831 subtarget, &op0, &op1, EXPAND_NORMAL);
7832 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7834 case FIXED_CONVERT_EXPR:
7835 op0 = expand_normal (treeop0);
7836 if (target == 0 || modifier == EXPAND_STACK_PARM)
7837 target = gen_reg_rtx (mode);
7839 if ((TREE_CODE (TREE_TYPE (treeop0)) == INTEGER_TYPE
7840 && TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7841 || (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type)))
7842 expand_fixed_convert (target, op0, 1, TYPE_SATURATING (type));
7844 expand_fixed_convert (target, op0, 0, TYPE_SATURATING (type));
7847 case FIX_TRUNC_EXPR:
7848 op0 = expand_normal (treeop0);
7849 if (target == 0 || modifier == EXPAND_STACK_PARM)
7850 target = gen_reg_rtx (mode);
7851 expand_fix (target, op0, unsignedp);
7855 op0 = expand_normal (treeop0);
7856 if (target == 0 || modifier == EXPAND_STACK_PARM)
7857 target = gen_reg_rtx (mode);
7858 /* expand_float can't figure out what to do if FROM has VOIDmode.
7859 So give it the correct mode. With -O, cse will optimize this. */
7860 if (GET_MODE (op0) == VOIDmode)
7861 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0)),
7863 expand_float (target, op0,
7864 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7868 op0 = expand_expr (treeop0, subtarget,
7869 VOIDmode, EXPAND_NORMAL);
7870 if (modifier == EXPAND_STACK_PARM)
7872 temp = expand_unop (mode,
7873 optab_for_tree_code (NEGATE_EXPR, type,
7877 return REDUCE_BIT_FIELD (temp);
7880 op0 = expand_expr (treeop0, subtarget,
7881 VOIDmode, EXPAND_NORMAL);
7882 if (modifier == EXPAND_STACK_PARM)
7885 /* ABS_EXPR is not valid for complex arguments. */
7886 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7887 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
7889 /* Unsigned abs is simply the operand. Testing here means we don't
7890 risk generating incorrect code below. */
7891 if (TYPE_UNSIGNED (type))
7894 return expand_abs (mode, op0, target, unsignedp,
7895 safe_from_p (target, treeop0, 1));
7899 target = original_target;
7901 || modifier == EXPAND_STACK_PARM
7902 || (MEM_P (target) && MEM_VOLATILE_P (target))
7903 || GET_MODE (target) != mode
7905 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7906 target = gen_reg_rtx (mode);
7907 expand_operands (treeop0, treeop1,
7908 target, &op0, &op1, EXPAND_NORMAL);
7910 /* First try to do it with a special MIN or MAX instruction.
7911 If that does not win, use a conditional jump to select the proper
7913 this_optab = optab_for_tree_code (code, type, optab_default);
7914 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7919 /* At this point, a MEM target is no longer useful; we will get better
7922 if (! REG_P (target))
7923 target = gen_reg_rtx (mode);
7925 /* If op1 was placed in target, swap op0 and op1. */
7926 if (target != op0 && target == op1)
7933 /* We generate better code and avoid problems with op1 mentioning
7934 target by forcing op1 into a pseudo if it isn't a constant. */
7935 if (! CONSTANT_P (op1))
7936 op1 = force_reg (mode, op1);
7939 enum rtx_code comparison_code;
7942 if (code == MAX_EXPR)
7943 comparison_code = unsignedp ? GEU : GE;
7945 comparison_code = unsignedp ? LEU : LE;
7947 /* Canonicalize to comparisons against 0. */
7948 if (op1 == const1_rtx)
7950 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
7951 or (a != 0 ? a : 1) for unsigned.
7952 For MIN we are safe converting (a <= 1 ? a : 1)
7953 into (a <= 0 ? a : 1) */
7954 cmpop1 = const0_rtx;
7955 if (code == MAX_EXPR)
7956 comparison_code = unsignedp ? NE : GT;
7958 if (op1 == constm1_rtx && !unsignedp)
7960 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
7961 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
7962 cmpop1 = const0_rtx;
7963 if (code == MIN_EXPR)
7964 comparison_code = LT;
7966 #ifdef HAVE_conditional_move
7967 /* Use a conditional move if possible. */
7968 if (can_conditionally_move_p (mode))
7972 /* ??? Same problem as in expmed.c: emit_conditional_move
7973 forces a stack adjustment via compare_from_rtx, and we
7974 lose the stack adjustment if the sequence we are about
7975 to create is discarded. */
7976 do_pending_stack_adjust ();
7980 /* Try to emit the conditional move. */
7981 insn = emit_conditional_move (target, comparison_code,
7986 /* If we could do the conditional move, emit the sequence,
7990 rtx seq = get_insns ();
7996 /* Otherwise discard the sequence and fall back to code with
8002 emit_move_insn (target, op0);
8004 temp = gen_label_rtx ();
8005 do_compare_rtx_and_jump (target, cmpop1, comparison_code,
8006 unsignedp, mode, NULL_RTX, NULL_RTX, temp,
8009 emit_move_insn (target, op1);
8014 op0 = expand_expr (treeop0, subtarget,
8015 VOIDmode, EXPAND_NORMAL);
8016 if (modifier == EXPAND_STACK_PARM)
8018 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8022 /* ??? Can optimize bitwise operations with one arg constant.
8023 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8024 and (a bitwise1 b) bitwise2 b (etc)
8025 but that is probably not worth while. */
8027 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8028 boolean values when we want in all cases to compute both of them. In
8029 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8030 as actual zero-or-1 values and then bitwise anding. In cases where
8031 there cannot be any side effects, better code would be made by
8032 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8033 how to recognize those cases. */
8035 case TRUTH_AND_EXPR:
8036 code = BIT_AND_EXPR;
8041 code = BIT_IOR_EXPR;
8045 case TRUTH_XOR_EXPR:
8046 code = BIT_XOR_EXPR;
8052 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type))
8053 || (GET_MODE_PRECISION (TYPE_MODE (type))
8054 == TYPE_PRECISION (type)));
8059 /* If this is a fixed-point operation, then we cannot use the code
8060 below because "expand_shift" doesn't support sat/no-sat fixed-point
8062 if (ALL_FIXED_POINT_MODE_P (mode))
8065 if (! safe_from_p (subtarget, treeop1, 1))
8067 if (modifier == EXPAND_STACK_PARM)
8069 op0 = expand_expr (treeop0, subtarget,
8070 VOIDmode, EXPAND_NORMAL);
8071 temp = expand_variable_shift (code, mode, op0, treeop1, target,
8073 if (code == LSHIFT_EXPR)
8074 temp = REDUCE_BIT_FIELD (temp);
8077 /* Could determine the answer when only additive constants differ. Also,
8078 the addition of one can be handled by changing the condition. */
8085 case UNORDERED_EXPR:
8093 temp = do_store_flag (ops,
8094 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8095 tmode != VOIDmode ? tmode : mode);
8099 /* Use a compare and a jump for BLKmode comparisons, or for function
8100 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8103 || modifier == EXPAND_STACK_PARM
8104 || ! safe_from_p (target, treeop0, 1)
8105 || ! safe_from_p (target, treeop1, 1)
8106 /* Make sure we don't have a hard reg (such as function's return
8107 value) live across basic blocks, if not optimizing. */
8108 || (!optimize && REG_P (target)
8109 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8110 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8112 emit_move_insn (target, const0_rtx);
8114 op1 = gen_label_rtx ();
8115 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
8117 if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
8118 emit_move_insn (target, constm1_rtx);
8120 emit_move_insn (target, const1_rtx);
8125 case TRUTH_NOT_EXPR:
8126 if (modifier == EXPAND_STACK_PARM)
8128 op0 = expand_expr (treeop0, target,
8129 VOIDmode, EXPAND_NORMAL);
8130 /* The parser is careful to generate TRUTH_NOT_EXPR
8131 only with operands that are always zero or one. */
8132 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8133 target, 1, OPTAB_LIB_WIDEN);
8138 /* Get the rtx code of the operands. */
8139 op0 = expand_normal (treeop0);
8140 op1 = expand_normal (treeop1);
8143 target = gen_reg_rtx (TYPE_MODE (type));
8145 /* Move the real (op0) and imaginary (op1) parts to their location. */
8146 write_complex_part (target, op0, false);
8147 write_complex_part (target, op1, true);
8151 case WIDEN_SUM_EXPR:
8153 tree oprnd0 = treeop0;
8154 tree oprnd1 = treeop1;
8156 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8157 target = expand_widen_pattern_expr (ops, op0, NULL_RTX, op1,
8162 case REDUC_MAX_EXPR:
8163 case REDUC_MIN_EXPR:
8164 case REDUC_PLUS_EXPR:
8166 op0 = expand_normal (treeop0);
8167 this_optab = optab_for_tree_code (code, type, optab_default);
8168 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8173 case VEC_EXTRACT_EVEN_EXPR:
8174 case VEC_EXTRACT_ODD_EXPR:
8176 expand_operands (treeop0, treeop1,
8177 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8178 this_optab = optab_for_tree_code (code, type, optab_default);
8179 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8185 case VEC_INTERLEAVE_HIGH_EXPR:
8186 case VEC_INTERLEAVE_LOW_EXPR:
8188 expand_operands (treeop0, treeop1,
8189 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8190 this_optab = optab_for_tree_code (code, type, optab_default);
8191 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8197 case VEC_LSHIFT_EXPR:
8198 case VEC_RSHIFT_EXPR:
8200 target = expand_vec_shift_expr (ops, target);
8204 case VEC_UNPACK_HI_EXPR:
8205 case VEC_UNPACK_LO_EXPR:
8207 op0 = expand_normal (treeop0);
8208 temp = expand_widen_pattern_expr (ops, op0, NULL_RTX, NULL_RTX,
8214 case VEC_UNPACK_FLOAT_HI_EXPR:
8215 case VEC_UNPACK_FLOAT_LO_EXPR:
8217 op0 = expand_normal (treeop0);
8218 /* The signedness is determined from input operand. */
8219 temp = expand_widen_pattern_expr
8220 (ops, op0, NULL_RTX, NULL_RTX,
8221 target, TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8227 case VEC_WIDEN_MULT_HI_EXPR:
8228 case VEC_WIDEN_MULT_LO_EXPR:
8230 tree oprnd0 = treeop0;
8231 tree oprnd1 = treeop1;
8233 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8234 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8236 gcc_assert (target);
8240 case VEC_PACK_TRUNC_EXPR:
8241 case VEC_PACK_SAT_EXPR:
8242 case VEC_PACK_FIX_TRUNC_EXPR:
8243 mode = TYPE_MODE (TREE_TYPE (treeop0));
8248 tree oprnd0 = treeop0;
8249 tree oprnd1 = treeop1;
8250 tree oprnd2 = treeop2;
8253 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8254 op2 = expand_normal (oprnd2);
8255 target = expand_widen_pattern_expr (ops, op0, op1, op2,
8260 case REALIGN_LOAD_EXPR:
8262 tree oprnd0 = treeop0;
8263 tree oprnd1 = treeop1;
8264 tree oprnd2 = treeop2;
8267 this_optab = optab_for_tree_code (code, type, optab_default);
8268 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8269 op2 = expand_normal (oprnd2);
8270 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
8280 /* Here to do an ordinary binary operator. */
8282 expand_operands (treeop0, treeop1,
8283 subtarget, &op0, &op1, EXPAND_NORMAL);
8285 this_optab = optab_for_tree_code (code, type, optab_default);
8287 if (modifier == EXPAND_STACK_PARM)
8289 temp = expand_binop (mode, this_optab, op0, op1, target,
8290 unsignedp, OPTAB_LIB_WIDEN);
8292 return REDUCE_BIT_FIELD (temp);
8294 #undef REDUCE_BIT_FIELD
8297 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
8298 enum expand_modifier modifier, rtx *alt_rtl)
8300 rtx op0, op1, temp, decl_rtl;
8303 enum machine_mode mode;
8304 enum tree_code code = TREE_CODE (exp);
8305 rtx subtarget, original_target;
8308 bool reduce_bit_field;
8309 location_t loc = EXPR_LOCATION (exp);
8310 struct separate_ops ops;
8311 tree treeop0, treeop1, treeop2;
8312 tree ssa_name = NULL_TREE;
8315 type = TREE_TYPE (exp);
8316 mode = TYPE_MODE (type);
8317 unsignedp = TYPE_UNSIGNED (type);
8319 treeop0 = treeop1 = treeop2 = NULL_TREE;
8320 if (!VL_EXP_CLASS_P (exp))
8321 switch (TREE_CODE_LENGTH (code))
8324 case 3: treeop2 = TREE_OPERAND (exp, 2);
8325 case 2: treeop1 = TREE_OPERAND (exp, 1);
8326 case 1: treeop0 = TREE_OPERAND (exp, 0);
8336 ignore = (target == const0_rtx
8337 || ((CONVERT_EXPR_CODE_P (code)
8338 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
8339 && TREE_CODE (type) == VOID_TYPE));
8341 /* An operation in what may be a bit-field type needs the
8342 result to be reduced to the precision of the bit-field type,
8343 which is narrower than that of the type's mode. */
8344 reduce_bit_field = (!ignore
8345 && INTEGRAL_TYPE_P (type)
8346 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
8348 /* If we are going to ignore this result, we need only do something
8349 if there is a side-effect somewhere in the expression. If there
8350 is, short-circuit the most common cases here. Note that we must
8351 not call expand_expr with anything but const0_rtx in case this
8352 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
8356 if (! TREE_SIDE_EFFECTS (exp))
8359 /* Ensure we reference a volatile object even if value is ignored, but
8360 don't do this if all we are doing is taking its address. */
8361 if (TREE_THIS_VOLATILE (exp)
8362 && TREE_CODE (exp) != FUNCTION_DECL
8363 && mode != VOIDmode && mode != BLKmode
8364 && modifier != EXPAND_CONST_ADDRESS)
8366 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
8372 if (TREE_CODE_CLASS (code) == tcc_unary
8373 || code == COMPONENT_REF || code == INDIRECT_REF)
8374 return expand_expr (treeop0, const0_rtx, VOIDmode,
8377 else if (TREE_CODE_CLASS (code) == tcc_binary
8378 || TREE_CODE_CLASS (code) == tcc_comparison
8379 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
8381 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8382 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8385 else if (code == BIT_FIELD_REF)
8387 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8388 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8389 expand_expr (treeop2, const0_rtx, VOIDmode, modifier);
8396 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
8399 /* Use subtarget as the target for operand 0 of a binary operation. */
8400 subtarget = get_subtarget (target);
8401 original_target = target;
8407 tree function = decl_function_context (exp);
8409 temp = label_rtx (exp);
8410 temp = gen_rtx_LABEL_REF (Pmode, temp);
8412 if (function != current_function_decl
8414 LABEL_REF_NONLOCAL_P (temp) = 1;
8416 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
8421 /* ??? ivopts calls expander, without any preparation from
8422 out-of-ssa. So fake instructions as if this was an access to the
8423 base variable. This unnecessarily allocates a pseudo, see how we can
8424 reuse it, if partition base vars have it set already. */
8425 if (!currently_expanding_to_rtl)
8426 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier,
8429 g = get_gimple_for_ssa_name (exp);
8430 /* For EXPAND_INITIALIZER try harder to get something simpler. */
8432 && modifier == EXPAND_INITIALIZER
8433 && !SSA_NAME_IS_DEFAULT_DEF (exp)
8434 && (optimize || DECL_IGNORED_P (SSA_NAME_VAR (exp)))
8435 && stmt_is_replaceable_p (SSA_NAME_DEF_STMT (exp)))
8436 g = SSA_NAME_DEF_STMT (exp);
8438 return expand_expr_real (gimple_assign_rhs_to_tree (g), target, tmode,
8442 decl_rtl = get_rtx_for_ssa_name (ssa_name);
8443 exp = SSA_NAME_VAR (ssa_name);
8444 goto expand_decl_rtl;
8448 /* If a static var's type was incomplete when the decl was written,
8449 but the type is complete now, lay out the decl now. */
8450 if (DECL_SIZE (exp) == 0
8451 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
8452 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
8453 layout_decl (exp, 0);
8455 /* ... fall through ... */
8459 decl_rtl = DECL_RTL (exp);
8461 gcc_assert (decl_rtl);
8462 decl_rtl = copy_rtx (decl_rtl);
8463 /* Record writes to register variables. */
8464 if (modifier == EXPAND_WRITE
8466 && HARD_REGISTER_P (decl_rtl))
8467 add_to_hard_reg_set (&crtl->asm_clobbers,
8468 GET_MODE (decl_rtl), REGNO (decl_rtl));
8470 /* Ensure variable marked as used even if it doesn't go through
8471 a parser. If it hasn't be used yet, write out an external
8473 if (! TREE_USED (exp))
8475 assemble_external (exp);
8476 TREE_USED (exp) = 1;
8479 /* Show we haven't gotten RTL for this yet. */
8482 /* Variables inherited from containing functions should have
8483 been lowered by this point. */
8484 context = decl_function_context (exp);
8485 gcc_assert (!context
8486 || context == current_function_decl
8487 || TREE_STATIC (exp)
8488 || DECL_EXTERNAL (exp)
8489 /* ??? C++ creates functions that are not TREE_STATIC. */
8490 || TREE_CODE (exp) == FUNCTION_DECL);
8492 /* This is the case of an array whose size is to be determined
8493 from its initializer, while the initializer is still being parsed.
8496 if (MEM_P (decl_rtl) && REG_P (XEXP (decl_rtl, 0)))
8497 temp = validize_mem (decl_rtl);
8499 /* If DECL_RTL is memory, we are in the normal case and the
8500 address is not valid, get the address into a register. */
8502 else if (MEM_P (decl_rtl) && modifier != EXPAND_INITIALIZER)
8505 *alt_rtl = decl_rtl;
8506 decl_rtl = use_anchored_address (decl_rtl);
8507 if (modifier != EXPAND_CONST_ADDRESS
8508 && modifier != EXPAND_SUM
8509 && !memory_address_addr_space_p (DECL_MODE (exp),
8511 MEM_ADDR_SPACE (decl_rtl)))
8512 temp = replace_equiv_address (decl_rtl,
8513 copy_rtx (XEXP (decl_rtl, 0)));
8516 /* If we got something, return it. But first, set the alignment
8517 if the address is a register. */
8520 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
8521 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
8526 /* If the mode of DECL_RTL does not match that of the decl, it
8527 must be a promoted value. We return a SUBREG of the wanted mode,
8528 but mark it so that we know that it was already extended. */
8529 if (REG_P (decl_rtl) && GET_MODE (decl_rtl) != DECL_MODE (exp))
8531 enum machine_mode pmode;
8533 /* Get the signedness to be used for this variable. Ensure we get
8534 the same mode we got when the variable was declared. */
8535 if (code == SSA_NAME
8536 && (g = SSA_NAME_DEF_STMT (ssa_name))
8537 && gimple_code (g) == GIMPLE_CALL)
8539 gcc_assert (!gimple_call_internal_p (g));
8540 pmode = promote_function_mode (type, mode, &unsignedp,
8541 gimple_call_fntype (g),
8545 pmode = promote_decl_mode (exp, &unsignedp);
8546 gcc_assert (GET_MODE (decl_rtl) == pmode);
8548 temp = gen_lowpart_SUBREG (mode, decl_rtl);
8549 SUBREG_PROMOTED_VAR_P (temp) = 1;
8550 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
8557 temp = immed_double_const (TREE_INT_CST_LOW (exp),
8558 TREE_INT_CST_HIGH (exp), mode);
8564 tree tmp = NULL_TREE;
8565 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
8566 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT
8567 || GET_MODE_CLASS (mode) == MODE_VECTOR_FRACT
8568 || GET_MODE_CLASS (mode) == MODE_VECTOR_UFRACT
8569 || GET_MODE_CLASS (mode) == MODE_VECTOR_ACCUM
8570 || GET_MODE_CLASS (mode) == MODE_VECTOR_UACCUM)
8571 return const_vector_from_tree (exp);
8572 if (GET_MODE_CLASS (mode) == MODE_INT)
8574 tree type_for_mode = lang_hooks.types.type_for_mode (mode, 1);
8576 tmp = fold_unary_loc (loc, VIEW_CONVERT_EXPR, type_for_mode, exp);
8579 tmp = build_constructor_from_list (type,
8580 TREE_VECTOR_CST_ELTS (exp));
8581 return expand_expr (tmp, ignore ? const0_rtx : target,
8586 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
8589 /* If optimized, generate immediate CONST_DOUBLE
8590 which will be turned into memory by reload if necessary.
8592 We used to force a register so that loop.c could see it. But
8593 this does not allow gen_* patterns to perform optimizations with
8594 the constants. It also produces two insns in cases like "x = 1.0;".
8595 On most machines, floating-point constants are not permitted in
8596 many insns, so we'd end up copying it to a register in any case.
8598 Now, we do the copying in expand_binop, if appropriate. */
8599 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
8600 TYPE_MODE (TREE_TYPE (exp)));
8603 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp),
8604 TYPE_MODE (TREE_TYPE (exp)));
8607 /* Handle evaluating a complex constant in a CONCAT target. */
8608 if (original_target && GET_CODE (original_target) == CONCAT)
8610 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8613 rtarg = XEXP (original_target, 0);
8614 itarg = XEXP (original_target, 1);
8616 /* Move the real and imaginary parts separately. */
8617 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, EXPAND_NORMAL);
8618 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, EXPAND_NORMAL);
8621 emit_move_insn (rtarg, op0);
8623 emit_move_insn (itarg, op1);
8625 return original_target;
8628 /* ... fall through ... */
8631 temp = expand_expr_constant (exp, 1, modifier);
8633 /* temp contains a constant address.
8634 On RISC machines where a constant address isn't valid,
8635 make some insns to get that address into a register. */
8636 if (modifier != EXPAND_CONST_ADDRESS
8637 && modifier != EXPAND_INITIALIZER
8638 && modifier != EXPAND_SUM
8639 && ! memory_address_addr_space_p (mode, XEXP (temp, 0),
8640 MEM_ADDR_SPACE (temp)))
8641 return replace_equiv_address (temp,
8642 copy_rtx (XEXP (temp, 0)));
8648 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
8650 if (!SAVE_EXPR_RESOLVED_P (exp))
8652 /* We can indeed still hit this case, typically via builtin
8653 expanders calling save_expr immediately before expanding
8654 something. Assume this means that we only have to deal
8655 with non-BLKmode values. */
8656 gcc_assert (GET_MODE (ret) != BLKmode);
8658 val = build_decl (EXPR_LOCATION (exp),
8659 VAR_DECL, NULL, TREE_TYPE (exp));
8660 DECL_ARTIFICIAL (val) = 1;
8661 DECL_IGNORED_P (val) = 1;
8663 TREE_OPERAND (exp, 0) = treeop0;
8664 SAVE_EXPR_RESOLVED_P (exp) = 1;
8666 if (!CONSTANT_P (ret))
8667 ret = copy_to_reg (ret);
8668 SET_DECL_RTL (val, ret);
8676 /* If we don't need the result, just ensure we evaluate any
8680 unsigned HOST_WIDE_INT idx;
8683 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
8684 expand_expr (value, const0_rtx, VOIDmode, EXPAND_NORMAL);
8689 return expand_constructor (exp, target, modifier, false);
8691 case TARGET_MEM_REF:
8693 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (exp));
8694 struct mem_address addr;
8697 get_address_description (exp, &addr);
8698 op0 = addr_for_mem_ref (&addr, as, true);
8699 op0 = memory_address_addr_space (mode, op0, as);
8700 temp = gen_rtx_MEM (mode, op0);
8701 set_mem_attributes (temp, exp, 0);
8702 set_mem_addr_space (temp, as);
8703 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)),
8704 get_object_alignment (exp, BIGGEST_ALIGNMENT));
8706 && (unsigned) align < GET_MODE_ALIGNMENT (mode)
8707 /* If the target does not have special handling for unaligned
8708 loads of mode then it can use regular moves for them. */
8709 && ((icode = optab_handler (movmisalign_optab, mode))
8710 != CODE_FOR_nothing))
8714 /* We've already validated the memory, and we're creating a
8715 new pseudo destination. The predicates really can't fail. */
8716 reg = gen_reg_rtx (mode);
8718 /* Nor can the insn generator. */
8719 insn = GEN_FCN (icode) (reg, temp);
8720 gcc_assert (insn != NULL_RTX);
8731 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))));
8732 enum machine_mode address_mode;
8733 tree base = TREE_OPERAND (exp, 0);
8736 /* Handle expansion of non-aliased memory with non-BLKmode. That
8737 might end up in a register. */
8738 if (TREE_CODE (base) == ADDR_EXPR)
8740 HOST_WIDE_INT offset = mem_ref_offset (exp).low;
8742 base = TREE_OPERAND (base, 0);
8746 base = get_addr_base_and_unit_offset (base, &off);
8750 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
8751 decl we must use bitfield operations. */
8753 && !TREE_ADDRESSABLE (base)
8754 && DECL_MODE (base) != BLKmode
8755 && DECL_RTL_SET_P (base)
8756 && !MEM_P (DECL_RTL (base)))
8760 && host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)
8761 && (GET_MODE_BITSIZE (DECL_MODE (base))
8762 == TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp)))))
8763 return expand_expr (build1 (VIEW_CONVERT_EXPR,
8764 TREE_TYPE (exp), base),
8765 target, tmode, modifier);
8766 bit_offset = bitsize_int (offset * BITS_PER_UNIT);
8767 bftype = TREE_TYPE (base);
8768 if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode)
8769 bftype = TREE_TYPE (exp);
8770 return expand_expr (build3 (BIT_FIELD_REF, bftype,
8772 TYPE_SIZE (TREE_TYPE (exp)),
8774 target, tmode, modifier);
8777 address_mode = targetm.addr_space.address_mode (as);
8778 base = TREE_OPERAND (exp, 0);
8779 if ((def_stmt = get_def_for_expr (base, BIT_AND_EXPR)))
8781 tree mask = gimple_assign_rhs2 (def_stmt);
8782 base = build2 (BIT_AND_EXPR, TREE_TYPE (base),
8783 gimple_assign_rhs1 (def_stmt), mask);
8784 TREE_OPERAND (exp, 0) = base;
8786 align = MAX (TYPE_ALIGN (TREE_TYPE (exp)),
8787 get_object_alignment (exp, BIGGEST_ALIGNMENT));
8788 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_SUM);
8789 op0 = memory_address_addr_space (address_mode, op0, as);
8790 if (!integer_zerop (TREE_OPERAND (exp, 1)))
8793 = immed_double_int_const (mem_ref_offset (exp), address_mode);
8794 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
8796 op0 = memory_address_addr_space (mode, op0, as);
8797 temp = gen_rtx_MEM (mode, op0);
8798 set_mem_attributes (temp, exp, 0);
8799 set_mem_addr_space (temp, as);
8800 if (TREE_THIS_VOLATILE (exp))
8801 MEM_VOLATILE_P (temp) = 1;
8803 && (unsigned) align < GET_MODE_ALIGNMENT (mode)
8804 /* If the target does not have special handling for unaligned
8805 loads of mode then it can use regular moves for them. */
8806 && ((icode = optab_handler (movmisalign_optab, mode))
8807 != CODE_FOR_nothing))
8811 /* We've already validated the memory, and we're creating a
8812 new pseudo destination. The predicates really can't fail. */
8813 reg = gen_reg_rtx (mode);
8815 /* Nor can the insn generator. */
8816 insn = GEN_FCN (icode) (reg, temp);
8827 tree array = treeop0;
8828 tree index = treeop1;
8830 /* Fold an expression like: "foo"[2].
8831 This is not done in fold so it won't happen inside &.
8832 Don't fold if this is for wide characters since it's too
8833 difficult to do correctly and this is a very rare case. */
8835 if (modifier != EXPAND_CONST_ADDRESS
8836 && modifier != EXPAND_INITIALIZER
8837 && modifier != EXPAND_MEMORY)
8839 tree t = fold_read_from_constant_string (exp);
8842 return expand_expr (t, target, tmode, modifier);
8845 /* If this is a constant index into a constant array,
8846 just get the value from the array. Handle both the cases when
8847 we have an explicit constructor and when our operand is a variable
8848 that was declared const. */
8850 if (modifier != EXPAND_CONST_ADDRESS
8851 && modifier != EXPAND_INITIALIZER
8852 && modifier != EXPAND_MEMORY
8853 && TREE_CODE (array) == CONSTRUCTOR
8854 && ! TREE_SIDE_EFFECTS (array)
8855 && TREE_CODE (index) == INTEGER_CST)
8857 unsigned HOST_WIDE_INT ix;
8860 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array), ix,
8862 if (tree_int_cst_equal (field, index))
8864 if (!TREE_SIDE_EFFECTS (value))
8865 return expand_expr (fold (value), target, tmode, modifier);
8870 else if (optimize >= 1
8871 && modifier != EXPAND_CONST_ADDRESS
8872 && modifier != EXPAND_INITIALIZER
8873 && modifier != EXPAND_MEMORY
8874 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
8875 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
8876 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
8877 && const_value_known_p (array))
8879 if (TREE_CODE (index) == INTEGER_CST)
8881 tree init = DECL_INITIAL (array);
8883 if (TREE_CODE (init) == CONSTRUCTOR)
8885 unsigned HOST_WIDE_INT ix;
8888 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), ix,
8890 if (tree_int_cst_equal (field, index))
8892 if (TREE_SIDE_EFFECTS (value))
8895 if (TREE_CODE (value) == CONSTRUCTOR)
8897 /* If VALUE is a CONSTRUCTOR, this
8898 optimization is only useful if
8899 this doesn't store the CONSTRUCTOR
8900 into memory. If it does, it is more
8901 efficient to just load the data from
8902 the array directly. */
8903 rtx ret = expand_constructor (value, target,
8905 if (ret == NULL_RTX)
8909 return expand_expr (fold (value), target, tmode,
8913 else if(TREE_CODE (init) == STRING_CST)
8915 tree index1 = index;
8916 tree low_bound = array_ref_low_bound (exp);
8917 index1 = fold_convert_loc (loc, sizetype,
8920 /* Optimize the special-case of a zero lower bound.
8922 We convert the low_bound to sizetype to avoid some problems
8923 with constant folding. (E.g. suppose the lower bound is 1,
8924 and its mode is QI. Without the conversion,l (ARRAY
8925 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
8926 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
8928 if (! integer_zerop (low_bound))
8929 index1 = size_diffop_loc (loc, index1,
8930 fold_convert_loc (loc, sizetype,
8933 if (0 > compare_tree_int (index1,
8934 TREE_STRING_LENGTH (init)))
8936 tree type = TREE_TYPE (TREE_TYPE (init));
8937 enum machine_mode mode = TYPE_MODE (type);
8939 if (GET_MODE_CLASS (mode) == MODE_INT
8940 && GET_MODE_SIZE (mode) == 1)
8941 return gen_int_mode (TREE_STRING_POINTER (init)
8942 [TREE_INT_CST_LOW (index1)],
8949 goto normal_inner_ref;
8952 /* If the operand is a CONSTRUCTOR, we can just extract the
8953 appropriate field if it is present. */
8954 if (TREE_CODE (treeop0) == CONSTRUCTOR)
8956 unsigned HOST_WIDE_INT idx;
8959 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0),
8961 if (field == treeop1
8962 /* We can normally use the value of the field in the
8963 CONSTRUCTOR. However, if this is a bitfield in
8964 an integral mode that we can fit in a HOST_WIDE_INT,
8965 we must mask only the number of bits in the bitfield,
8966 since this is done implicitly by the constructor. If
8967 the bitfield does not meet either of those conditions,
8968 we can't do this optimization. */
8969 && (! DECL_BIT_FIELD (field)
8970 || ((GET_MODE_CLASS (DECL_MODE (field)) == MODE_INT)
8971 && (GET_MODE_BITSIZE (DECL_MODE (field))
8972 <= HOST_BITS_PER_WIDE_INT))))
8974 if (DECL_BIT_FIELD (field)
8975 && modifier == EXPAND_STACK_PARM)
8977 op0 = expand_expr (value, target, tmode, modifier);
8978 if (DECL_BIT_FIELD (field))
8980 HOST_WIDE_INT bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
8981 enum machine_mode imode = TYPE_MODE (TREE_TYPE (field));
8983 if (TYPE_UNSIGNED (TREE_TYPE (field)))
8985 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
8986 op0 = expand_and (imode, op0, op1, target);
8990 int count = GET_MODE_BITSIZE (imode) - bitsize;
8992 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
8994 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
9002 goto normal_inner_ref;
9005 case ARRAY_RANGE_REF:
9008 enum machine_mode mode1, mode2;
9009 HOST_WIDE_INT bitsize, bitpos;
9011 int volatilep = 0, must_force_mem;
9012 bool packedp = false;
9013 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
9014 &mode1, &unsignedp, &volatilep, true);
9015 rtx orig_op0, memloc;
9017 /* If we got back the original object, something is wrong. Perhaps
9018 we are evaluating an expression too early. In any event, don't
9019 infinitely recurse. */
9020 gcc_assert (tem != exp);
9022 if (TYPE_PACKED (TREE_TYPE (TREE_OPERAND (exp, 0)))
9023 || (TREE_CODE (TREE_OPERAND (exp, 1)) == FIELD_DECL
9024 && DECL_PACKED (TREE_OPERAND (exp, 1))))
9027 /* If TEM's type is a union of variable size, pass TARGET to the inner
9028 computation, since it will need a temporary and TARGET is known
9029 to have to do. This occurs in unchecked conversion in Ada. */
9032 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9033 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9035 && modifier != EXPAND_STACK_PARM
9036 ? target : NULL_RTX),
9038 (modifier == EXPAND_INITIALIZER
9039 || modifier == EXPAND_CONST_ADDRESS
9040 || modifier == EXPAND_STACK_PARM)
9041 ? modifier : EXPAND_NORMAL);
9044 /* If the bitfield is volatile, we want to access it in the
9045 field's mode, not the computed mode.
9046 If a MEM has VOIDmode (external with incomplete type),
9047 use BLKmode for it instead. */
9050 if (volatilep && flag_strict_volatile_bitfields > 0)
9051 op0 = adjust_address (op0, mode1, 0);
9052 else if (GET_MODE (op0) == VOIDmode)
9053 op0 = adjust_address (op0, BLKmode, 0);
9057 = CONSTANT_P (op0) ? TYPE_MODE (TREE_TYPE (tem)) : GET_MODE (op0);
9059 /* If we have either an offset, a BLKmode result, or a reference
9060 outside the underlying object, we must force it to memory.
9061 Such a case can occur in Ada if we have unchecked conversion
9062 of an expression from a scalar type to an aggregate type or
9063 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
9064 passed a partially uninitialized object or a view-conversion
9065 to a larger size. */
9066 must_force_mem = (offset
9068 || bitpos + bitsize > GET_MODE_BITSIZE (mode2));
9070 /* Handle CONCAT first. */
9071 if (GET_CODE (op0) == CONCAT && !must_force_mem)
9074 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
9077 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9080 op0 = XEXP (op0, 0);
9081 mode2 = GET_MODE (op0);
9083 else if (bitpos == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9084 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 1)))
9088 op0 = XEXP (op0, 1);
9090 mode2 = GET_MODE (op0);
9093 /* Otherwise force into memory. */
9097 /* If this is a constant, put it in a register if it is a legitimate
9098 constant and we don't need a memory reference. */
9099 if (CONSTANT_P (op0)
9101 && targetm.legitimate_constant_p (mode2, op0)
9103 op0 = force_reg (mode2, op0);
9105 /* Otherwise, if this is a constant, try to force it to the constant
9106 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9107 is a legitimate constant. */
9108 else if (CONSTANT_P (op0) && (memloc = force_const_mem (mode2, op0)))
9109 op0 = validize_mem (memloc);
9111 /* Otherwise, if this is a constant or the object is not in memory
9112 and need be, put it there. */
9113 else if (CONSTANT_P (op0) || (!MEM_P (op0) && must_force_mem))
9115 tree nt = build_qualified_type (TREE_TYPE (tem),
9116 (TYPE_QUALS (TREE_TYPE (tem))
9117 | TYPE_QUAL_CONST));
9118 memloc = assign_temp (nt, 1, 1, 1);
9119 emit_move_insn (memloc, op0);
9125 enum machine_mode address_mode;
9126 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
9129 gcc_assert (MEM_P (op0));
9132 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (op0));
9133 if (GET_MODE (offset_rtx) != address_mode)
9134 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
9136 if (GET_MODE (op0) == BLKmode
9137 /* A constant address in OP0 can have VOIDmode, we must
9138 not try to call force_reg in that case. */
9139 && GET_MODE (XEXP (op0, 0)) != VOIDmode
9141 && (bitpos % bitsize) == 0
9142 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
9143 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
9145 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9149 op0 = offset_address (op0, offset_rtx,
9150 highest_pow2_factor (offset));
9153 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9154 record its alignment as BIGGEST_ALIGNMENT. */
9155 if (MEM_P (op0) && bitpos == 0 && offset != 0
9156 && is_aligning_offset (offset, tem))
9157 set_mem_align (op0, BIGGEST_ALIGNMENT);
9159 /* Don't forget about volatility even if this is a bitfield. */
9160 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
9162 if (op0 == orig_op0)
9163 op0 = copy_rtx (op0);
9165 MEM_VOLATILE_P (op0) = 1;
9168 /* In cases where an aligned union has an unaligned object
9169 as a field, we might be extracting a BLKmode value from
9170 an integer-mode (e.g., SImode) object. Handle this case
9171 by doing the extract into an object as wide as the field
9172 (which we know to be the width of a basic mode), then
9173 storing into memory, and changing the mode to BLKmode. */
9174 if (mode1 == VOIDmode
9175 || REG_P (op0) || GET_CODE (op0) == SUBREG
9176 || (mode1 != BLKmode && ! direct_load[(int) mode1]
9177 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
9178 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
9179 && modifier != EXPAND_CONST_ADDRESS
9180 && modifier != EXPAND_INITIALIZER)
9181 /* If the field is volatile, we always want an aligned
9182 access. Only do this if the access is not already naturally
9183 aligned, otherwise "normal" (non-bitfield) volatile fields
9184 become non-addressable. */
9185 || (volatilep && flag_strict_volatile_bitfields > 0
9186 && (bitpos % GET_MODE_ALIGNMENT (mode) != 0))
9187 /* If the field isn't aligned enough to fetch as a memref,
9188 fetch it as a bit field. */
9189 || (mode1 != BLKmode
9190 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
9191 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
9193 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
9194 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
9195 && ((modifier == EXPAND_CONST_ADDRESS
9196 || modifier == EXPAND_INITIALIZER)
9198 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
9199 || (bitpos % BITS_PER_UNIT != 0)))
9200 /* If the type and the field are a constant size and the
9201 size of the type isn't the same size as the bitfield,
9202 we must use bitfield operations. */
9204 && TYPE_SIZE (TREE_TYPE (exp))
9205 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9206 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
9209 enum machine_mode ext_mode = mode;
9211 if (ext_mode == BLKmode
9212 && ! (target != 0 && MEM_P (op0)
9214 && bitpos % BITS_PER_UNIT == 0))
9215 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
9217 if (ext_mode == BLKmode)
9220 target = assign_temp (type, 0, 1, 1);
9225 /* In this case, BITPOS must start at a byte boundary and
9226 TARGET, if specified, must be a MEM. */
9227 gcc_assert (MEM_P (op0)
9228 && (!target || MEM_P (target))
9229 && !(bitpos % BITS_PER_UNIT));
9231 emit_block_move (target,
9232 adjust_address (op0, VOIDmode,
9233 bitpos / BITS_PER_UNIT),
9234 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
9236 (modifier == EXPAND_STACK_PARM
9237 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9242 op0 = validize_mem (op0);
9244 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
9245 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9247 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp, packedp,
9248 (modifier == EXPAND_STACK_PARM
9249 ? NULL_RTX : target),
9250 ext_mode, ext_mode);
9252 /* If the result is a record type and BITSIZE is narrower than
9253 the mode of OP0, an integral mode, and this is a big endian
9254 machine, we must put the field into the high-order bits. */
9255 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
9256 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
9257 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
9258 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
9259 GET_MODE_BITSIZE (GET_MODE (op0))
9262 /* If the result type is BLKmode, store the data into a temporary
9263 of the appropriate type, but with the mode corresponding to the
9264 mode for the data we have (op0's mode). It's tempting to make
9265 this a constant type, since we know it's only being stored once,
9266 but that can cause problems if we are taking the address of this
9267 COMPONENT_REF because the MEM of any reference via that address
9268 will have flags corresponding to the type, which will not
9269 necessarily be constant. */
9270 if (mode == BLKmode)
9272 HOST_WIDE_INT size = GET_MODE_BITSIZE (ext_mode);
9275 /* If the reference doesn't use the alias set of its type,
9276 we cannot create the temporary using that type. */
9277 if (component_uses_parent_alias_set (exp))
9279 new_rtx = assign_stack_local (ext_mode, size, 0);
9280 set_mem_alias_set (new_rtx, get_alias_set (exp));
9283 new_rtx = assign_stack_temp_for_type (ext_mode, size, 0, type);
9285 emit_move_insn (new_rtx, op0);
9286 op0 = copy_rtx (new_rtx);
9287 PUT_MODE (op0, BLKmode);
9288 set_mem_attributes (op0, exp, 1);
9294 /* If the result is BLKmode, use that to access the object
9296 if (mode == BLKmode)
9299 /* Get a reference to just this component. */
9300 if (modifier == EXPAND_CONST_ADDRESS
9301 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
9302 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
9304 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9306 if (op0 == orig_op0)
9307 op0 = copy_rtx (op0);
9309 set_mem_attributes (op0, exp, 0);
9310 if (REG_P (XEXP (op0, 0)))
9311 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9313 MEM_VOLATILE_P (op0) |= volatilep;
9314 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
9315 || modifier == EXPAND_CONST_ADDRESS
9316 || modifier == EXPAND_INITIALIZER)
9318 else if (target == 0)
9319 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9321 convert_move (target, op0, unsignedp);
9326 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
9329 /* All valid uses of __builtin_va_arg_pack () are removed during
9331 if (CALL_EXPR_VA_ARG_PACK (exp))
9332 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
9334 tree fndecl = get_callee_fndecl (exp), attr;
9337 && (attr = lookup_attribute ("error",
9338 DECL_ATTRIBUTES (fndecl))) != NULL)
9339 error ("%Kcall to %qs declared with attribute error: %s",
9340 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9341 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9343 && (attr = lookup_attribute ("warning",
9344 DECL_ATTRIBUTES (fndecl))) != NULL)
9345 warning_at (tree_nonartificial_location (exp),
9346 0, "%Kcall to %qs declared with attribute warning: %s",
9347 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9348 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9350 /* Check for a built-in function. */
9351 if (fndecl && DECL_BUILT_IN (fndecl))
9353 gcc_assert (DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_FRONTEND);
9354 return expand_builtin (exp, target, subtarget, tmode, ignore);
9357 return expand_call (exp, target, ignore);
9359 case VIEW_CONVERT_EXPR:
9362 /* If we are converting to BLKmode, try to avoid an intermediate
9363 temporary by fetching an inner memory reference. */
9365 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9366 && TYPE_MODE (TREE_TYPE (treeop0)) != BLKmode
9367 && handled_component_p (treeop0))
9369 enum machine_mode mode1;
9370 HOST_WIDE_INT bitsize, bitpos;
9375 = get_inner_reference (treeop0, &bitsize, &bitpos,
9376 &offset, &mode1, &unsignedp, &volatilep,
9380 /* ??? We should work harder and deal with non-zero offsets. */
9382 && (bitpos % BITS_PER_UNIT) == 0
9384 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) == 0)
9386 /* See the normal_inner_ref case for the rationale. */
9389 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9390 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9392 && modifier != EXPAND_STACK_PARM
9393 ? target : NULL_RTX),
9395 (modifier == EXPAND_INITIALIZER
9396 || modifier == EXPAND_CONST_ADDRESS
9397 || modifier == EXPAND_STACK_PARM)
9398 ? modifier : EXPAND_NORMAL);
9400 if (MEM_P (orig_op0))
9404 /* Get a reference to just this component. */
9405 if (modifier == EXPAND_CONST_ADDRESS
9406 || modifier == EXPAND_SUM
9407 || modifier == EXPAND_INITIALIZER)
9408 op0 = adjust_address_nv (op0, mode, bitpos / BITS_PER_UNIT);
9410 op0 = adjust_address (op0, mode, bitpos / BITS_PER_UNIT);
9412 if (op0 == orig_op0)
9413 op0 = copy_rtx (op0);
9415 set_mem_attributes (op0, treeop0, 0);
9416 if (REG_P (XEXP (op0, 0)))
9417 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9419 MEM_VOLATILE_P (op0) |= volatilep;
9425 op0 = expand_expr (treeop0,
9426 NULL_RTX, VOIDmode, modifier);
9428 /* If the input and output modes are both the same, we are done. */
9429 if (mode == GET_MODE (op0))
9431 /* If neither mode is BLKmode, and both modes are the same size
9432 then we can use gen_lowpart. */
9433 else if (mode != BLKmode && GET_MODE (op0) != BLKmode
9434 && GET_MODE_SIZE (mode) == GET_MODE_SIZE (GET_MODE (op0))
9435 && !COMPLEX_MODE_P (GET_MODE (op0)))
9437 if (GET_CODE (op0) == SUBREG)
9438 op0 = force_reg (GET_MODE (op0), op0);
9439 temp = gen_lowpart_common (mode, op0);
9444 if (!REG_P (op0) && !MEM_P (op0))
9445 op0 = force_reg (GET_MODE (op0), op0);
9446 op0 = gen_lowpart (mode, op0);
9449 /* If both types are integral, convert from one mode to the other. */
9450 else if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (TREE_TYPE (treeop0)))
9451 op0 = convert_modes (mode, GET_MODE (op0), op0,
9452 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
9453 /* As a last resort, spill op0 to memory, and reload it in a
9455 else if (!MEM_P (op0))
9457 /* If the operand is not a MEM, force it into memory. Since we
9458 are going to be changing the mode of the MEM, don't call
9459 force_const_mem for constants because we don't allow pool
9460 constants to change mode. */
9461 tree inner_type = TREE_TYPE (treeop0);
9463 gcc_assert (!TREE_ADDRESSABLE (exp));
9465 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
9467 = assign_stack_temp_for_type
9468 (TYPE_MODE (inner_type),
9469 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
9471 emit_move_insn (target, op0);
9475 /* At this point, OP0 is in the correct mode. If the output type is
9476 such that the operand is known to be aligned, indicate that it is.
9477 Otherwise, we need only be concerned about alignment for non-BLKmode
9481 op0 = copy_rtx (op0);
9483 if (TYPE_ALIGN_OK (type))
9484 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
9485 else if (STRICT_ALIGNMENT
9487 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode))
9489 tree inner_type = TREE_TYPE (treeop0);
9490 HOST_WIDE_INT temp_size
9491 = MAX (int_size_in_bytes (inner_type),
9492 (HOST_WIDE_INT) GET_MODE_SIZE (mode));
9494 = assign_stack_temp_for_type (mode, temp_size, 0, type);
9495 rtx new_with_op0_mode
9496 = adjust_address (new_rtx, GET_MODE (op0), 0);
9498 gcc_assert (!TREE_ADDRESSABLE (exp));
9500 if (GET_MODE (op0) == BLKmode)
9501 emit_block_move (new_with_op0_mode, op0,
9502 GEN_INT (GET_MODE_SIZE (mode)),
9503 (modifier == EXPAND_STACK_PARM
9504 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9506 emit_move_insn (new_with_op0_mode, op0);
9511 op0 = adjust_address (op0, mode, 0);
9516 /* Use a compare and a jump for BLKmode comparisons, or for function
9517 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
9519 /* Although TRUTH_{AND,OR}IF_EXPR aren't present in GIMPLE, they
9520 are occassionally created by folding during expansion. */
9521 case TRUTH_ANDIF_EXPR:
9522 case TRUTH_ORIF_EXPR:
9525 || modifier == EXPAND_STACK_PARM
9526 || ! safe_from_p (target, treeop0, 1)
9527 || ! safe_from_p (target, treeop1, 1)
9528 /* Make sure we don't have a hard reg (such as function's return
9529 value) live across basic blocks, if not optimizing. */
9530 || (!optimize && REG_P (target)
9531 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
9532 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9535 emit_move_insn (target, const0_rtx);
9537 op1 = gen_label_rtx ();
9538 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
9541 emit_move_insn (target, const1_rtx);
9544 return ignore ? const0_rtx : target;
9546 case STATEMENT_LIST:
9548 tree_stmt_iterator iter;
9550 gcc_assert (ignore);
9552 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
9553 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
9558 /* A COND_EXPR with its type being VOID_TYPE represents a
9559 conditional jump and is handled in
9560 expand_gimple_cond_expr. */
9561 gcc_assert (!VOID_TYPE_P (type));
9563 /* Note that COND_EXPRs whose type is a structure or union
9564 are required to be constructed to contain assignments of
9565 a temporary variable, so that we can evaluate them here
9566 for side effect only. If type is void, we must do likewise. */
9568 gcc_assert (!TREE_ADDRESSABLE (type)
9570 && TREE_TYPE (treeop1) != void_type_node
9571 && TREE_TYPE (treeop2) != void_type_node);
9573 /* If we are not to produce a result, we have no target. Otherwise,
9574 if a target was specified use it; it will not be used as an
9575 intermediate target unless it is safe. If no target, use a
9578 if (modifier != EXPAND_STACK_PARM
9580 && safe_from_p (original_target, treeop0, 1)
9581 && GET_MODE (original_target) == mode
9582 #ifdef HAVE_conditional_move
9583 && (! can_conditionally_move_p (mode)
9584 || REG_P (original_target))
9586 && !MEM_P (original_target))
9587 temp = original_target;
9589 temp = assign_temp (type, 0, 0, 1);
9591 do_pending_stack_adjust ();
9593 op0 = gen_label_rtx ();
9594 op1 = gen_label_rtx ();
9595 jumpifnot (treeop0, op0, -1);
9596 store_expr (treeop1, temp,
9597 modifier == EXPAND_STACK_PARM,
9600 emit_jump_insn (gen_jump (op1));
9603 store_expr (treeop2, temp,
9604 modifier == EXPAND_STACK_PARM,
9612 target = expand_vec_cond_expr (type, treeop0, treeop1, treeop2, target);
9619 gcc_assert (ignore);
9621 /* Check for |= or &= of a bitfield of size one into another bitfield
9622 of size 1. In this case, (unless we need the result of the
9623 assignment) we can do this more efficiently with a
9624 test followed by an assignment, if necessary.
9626 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9627 things change so we do, this code should be enhanced to
9629 if (TREE_CODE (lhs) == COMPONENT_REF
9630 && (TREE_CODE (rhs) == BIT_IOR_EXPR
9631 || TREE_CODE (rhs) == BIT_AND_EXPR)
9632 && TREE_OPERAND (rhs, 0) == lhs
9633 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
9634 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
9635 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
9637 rtx label = gen_label_rtx ();
9638 int value = TREE_CODE (rhs) == BIT_IOR_EXPR;
9639 do_jump (TREE_OPERAND (rhs, 1),
9641 value ? 0 : label, -1);
9642 expand_assignment (lhs, build_int_cst (TREE_TYPE (rhs), value),
9643 MOVE_NONTEMPORAL (exp));
9644 do_pending_stack_adjust ();
9649 expand_assignment (lhs, rhs, MOVE_NONTEMPORAL (exp));
9654 return expand_expr_addr_expr (exp, target, tmode, modifier);
9657 op0 = expand_normal (treeop0);
9658 return read_complex_part (op0, false);
9661 op0 = expand_normal (treeop0);
9662 return read_complex_part (op0, true);
9669 /* Expanded in cfgexpand.c. */
9672 case TRY_CATCH_EXPR:
9674 case EH_FILTER_EXPR:
9675 case TRY_FINALLY_EXPR:
9676 /* Lowered by tree-eh.c. */
9679 case WITH_CLEANUP_EXPR:
9680 case CLEANUP_POINT_EXPR:
9682 case CASE_LABEL_EXPR:
9688 case PREINCREMENT_EXPR:
9689 case PREDECREMENT_EXPR:
9690 case POSTINCREMENT_EXPR:
9691 case POSTDECREMENT_EXPR:
9694 /* Lowered by gimplify.c. */
9698 /* Function descriptors are not valid except for as
9699 initialization constants, and should not be expanded. */
9702 case WITH_SIZE_EXPR:
9703 /* WITH_SIZE_EXPR expands to its first argument. The caller should
9704 have pulled out the size to use in whatever context it needed. */
9705 return expand_expr_real (treeop0, original_target, tmode,
9708 case COMPOUND_LITERAL_EXPR:
9710 /* Initialize the anonymous variable declared in the compound
9711 literal, then return the variable. */
9712 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
9714 /* Create RTL for this variable. */
9715 if (!DECL_RTL_SET_P (decl))
9717 if (DECL_HARD_REGISTER (decl))
9718 /* The user specified an assembler name for this variable.
9720 rest_of_decl_compilation (decl, 0, 0);
9725 return expand_expr_real (decl, original_target, tmode,
9730 return expand_expr_real_2 (&ops, target, tmode, modifier);
9734 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
9735 signedness of TYPE), possibly returning the result in TARGET. */
9737 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
9739 HOST_WIDE_INT prec = TYPE_PRECISION (type);
9740 if (target && GET_MODE (target) != GET_MODE (exp))
9742 /* For constant values, reduce using build_int_cst_type. */
9743 if (CONST_INT_P (exp))
9745 HOST_WIDE_INT value = INTVAL (exp);
9746 tree t = build_int_cst_type (type, value);
9747 return expand_expr (t, target, VOIDmode, EXPAND_NORMAL);
9749 else if (TYPE_UNSIGNED (type))
9751 rtx mask = immed_double_int_const (double_int_mask (prec),
9753 return expand_and (GET_MODE (exp), exp, mask, target);
9757 int count = GET_MODE_BITSIZE (GET_MODE (exp)) - prec;
9758 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp),
9759 exp, count, target, 0);
9760 return expand_shift (RSHIFT_EXPR, GET_MODE (exp),
9761 exp, count, target, 0);
9765 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9766 when applied to the address of EXP produces an address known to be
9767 aligned more than BIGGEST_ALIGNMENT. */
9770 is_aligning_offset (const_tree offset, const_tree exp)
9772 /* Strip off any conversions. */
9773 while (CONVERT_EXPR_P (offset))
9774 offset = TREE_OPERAND (offset, 0);
9776 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9777 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9778 if (TREE_CODE (offset) != BIT_AND_EXPR
9779 || !host_integerp (TREE_OPERAND (offset, 1), 1)
9780 || compare_tree_int (TREE_OPERAND (offset, 1),
9781 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
9782 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
9785 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9786 It must be NEGATE_EXPR. Then strip any more conversions. */
9787 offset = TREE_OPERAND (offset, 0);
9788 while (CONVERT_EXPR_P (offset))
9789 offset = TREE_OPERAND (offset, 0);
9791 if (TREE_CODE (offset) != NEGATE_EXPR)
9794 offset = TREE_OPERAND (offset, 0);
9795 while (CONVERT_EXPR_P (offset))
9796 offset = TREE_OPERAND (offset, 0);
9798 /* This must now be the address of EXP. */
9799 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
9802 /* Return the tree node if an ARG corresponds to a string constant or zero
9803 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
9804 in bytes within the string that ARG is accessing. The type of the
9805 offset will be `sizetype'. */
9808 string_constant (tree arg, tree *ptr_offset)
9810 tree array, offset, lower_bound;
9813 if (TREE_CODE (arg) == ADDR_EXPR)
9815 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
9817 *ptr_offset = size_zero_node;
9818 return TREE_OPERAND (arg, 0);
9820 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
9822 array = TREE_OPERAND (arg, 0);
9823 offset = size_zero_node;
9825 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
9827 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
9828 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
9829 if (TREE_CODE (array) != STRING_CST
9830 && TREE_CODE (array) != VAR_DECL)
9833 /* Check if the array has a nonzero lower bound. */
9834 lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
9835 if (!integer_zerop (lower_bound))
9837 /* If the offset and base aren't both constants, return 0. */
9838 if (TREE_CODE (lower_bound) != INTEGER_CST)
9840 if (TREE_CODE (offset) != INTEGER_CST)
9842 /* Adjust offset by the lower bound. */
9843 offset = size_diffop (fold_convert (sizetype, offset),
9844 fold_convert (sizetype, lower_bound));
9850 else if (TREE_CODE (arg) == PLUS_EXPR || TREE_CODE (arg) == POINTER_PLUS_EXPR)
9852 tree arg0 = TREE_OPERAND (arg, 0);
9853 tree arg1 = TREE_OPERAND (arg, 1);
9858 if (TREE_CODE (arg0) == ADDR_EXPR
9859 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
9860 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
9862 array = TREE_OPERAND (arg0, 0);
9865 else if (TREE_CODE (arg1) == ADDR_EXPR
9866 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
9867 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
9869 array = TREE_OPERAND (arg1, 0);
9878 if (TREE_CODE (array) == STRING_CST)
9880 *ptr_offset = fold_convert (sizetype, offset);
9883 else if (TREE_CODE (array) == VAR_DECL
9884 || TREE_CODE (array) == CONST_DECL)
9888 /* Variables initialized to string literals can be handled too. */
9889 if (!const_value_known_p (array)
9890 || !DECL_INITIAL (array)
9891 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
9894 /* Avoid const char foo[4] = "abcde"; */
9895 if (DECL_SIZE_UNIT (array) == NULL_TREE
9896 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
9897 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
9898 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
9901 /* If variable is bigger than the string literal, OFFSET must be constant
9902 and inside of the bounds of the string literal. */
9903 offset = fold_convert (sizetype, offset);
9904 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
9905 && (! host_integerp (offset, 1)
9906 || compare_tree_int (offset, length) >= 0))
9909 *ptr_offset = offset;
9910 return DECL_INITIAL (array);
9916 /* Generate code to calculate OPS, and exploded expression
9917 using a store-flag instruction and return an rtx for the result.
9918 OPS reflects a comparison.
9920 If TARGET is nonzero, store the result there if convenient.
9922 Return zero if there is no suitable set-flag instruction
9923 available on this machine.
9925 Once expand_expr has been called on the arguments of the comparison,
9926 we are committed to doing the store flag, since it is not safe to
9927 re-evaluate the expression. We emit the store-flag insn by calling
9928 emit_store_flag, but only expand the arguments if we have a reason
9929 to believe that emit_store_flag will be successful. If we think that
9930 it will, but it isn't, we have to simulate the store-flag with a
9931 set/jump/set sequence. */
9934 do_store_flag (sepops ops, rtx target, enum machine_mode mode)
9937 tree arg0, arg1, type;
9939 enum machine_mode operand_mode;
9942 rtx subtarget = target;
9943 location_t loc = ops->location;
9948 /* Don't crash if the comparison was erroneous. */
9949 if (arg0 == error_mark_node || arg1 == error_mark_node)
9952 type = TREE_TYPE (arg0);
9953 operand_mode = TYPE_MODE (type);
9954 unsignedp = TYPE_UNSIGNED (type);
9956 /* We won't bother with BLKmode store-flag operations because it would mean
9957 passing a lot of information to emit_store_flag. */
9958 if (operand_mode == BLKmode)
9961 /* We won't bother with store-flag operations involving function pointers
9962 when function pointers must be canonicalized before comparisons. */
9963 #ifdef HAVE_canonicalize_funcptr_for_compare
9964 if (HAVE_canonicalize_funcptr_for_compare
9965 && ((TREE_CODE (TREE_TYPE (arg0)) == POINTER_TYPE
9966 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0)))
9968 || (TREE_CODE (TREE_TYPE (arg1)) == POINTER_TYPE
9969 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1)))
9970 == FUNCTION_TYPE))))
9977 /* Get the rtx comparison code to use. We know that EXP is a comparison
9978 operation of some type. Some comparisons against 1 and -1 can be
9979 converted to comparisons with zero. Do so here so that the tests
9980 below will be aware that we have a comparison with zero. These
9981 tests will not catch constants in the first operand, but constants
9982 are rarely passed as the first operand. */
9993 if (integer_onep (arg1))
9994 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
9996 code = unsignedp ? LTU : LT;
9999 if (! unsignedp && integer_all_onesp (arg1))
10000 arg1 = integer_zero_node, code = LT;
10002 code = unsignedp ? LEU : LE;
10005 if (! unsignedp && integer_all_onesp (arg1))
10006 arg1 = integer_zero_node, code = GE;
10008 code = unsignedp ? GTU : GT;
10011 if (integer_onep (arg1))
10012 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10014 code = unsignedp ? GEU : GE;
10017 case UNORDERED_EXPR:
10043 gcc_unreachable ();
10046 /* Put a constant second. */
10047 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST
10048 || TREE_CODE (arg0) == FIXED_CST)
10050 tem = arg0; arg0 = arg1; arg1 = tem;
10051 code = swap_condition (code);
10054 /* If this is an equality or inequality test of a single bit, we can
10055 do this by shifting the bit being tested to the low-order bit and
10056 masking the result with the constant 1. If the condition was EQ,
10057 we xor it with 1. This does not require an scc insn and is faster
10058 than an scc insn even if we have it.
10060 The code to make this transformation was moved into fold_single_bit_test,
10061 so we just call into the folder and expand its result. */
10063 if ((code == NE || code == EQ)
10064 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
10065 && integer_pow2p (TREE_OPERAND (arg0, 1))
10066 && (TYPE_PRECISION (ops->type) != 1 || TYPE_UNSIGNED (ops->type)))
10068 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
10069 return expand_expr (fold_single_bit_test (loc,
10070 code == NE ? NE_EXPR : EQ_EXPR,
10072 target, VOIDmode, EXPAND_NORMAL);
10075 if (! get_subtarget (target)
10076 || GET_MODE (subtarget) != operand_mode)
10079 expand_operands (arg0, arg1, subtarget, &op0, &op1, EXPAND_NORMAL);
10082 target = gen_reg_rtx (mode);
10084 /* Try a cstore if possible. */
10085 return emit_store_flag_force (target, code, op0, op1,
10086 operand_mode, unsignedp,
10087 (TYPE_PRECISION (ops->type) == 1
10088 && !TYPE_UNSIGNED (ops->type)) ? -1 : 1);
10092 /* Stubs in case we haven't got a casesi insn. */
10093 #ifndef HAVE_casesi
10094 # define HAVE_casesi 0
10095 # define gen_casesi(a, b, c, d, e) (0)
10096 # define CODE_FOR_casesi CODE_FOR_nothing
10099 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10100 0 otherwise (i.e. if there is no casesi instruction). */
10102 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
10103 rtx table_label ATTRIBUTE_UNUSED, rtx default_label,
10104 rtx fallback_label ATTRIBUTE_UNUSED)
10106 struct expand_operand ops[5];
10107 enum machine_mode index_mode = SImode;
10108 int index_bits = GET_MODE_BITSIZE (index_mode);
10109 rtx op1, op2, index;
10114 /* Convert the index to SImode. */
10115 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10117 enum machine_mode omode = TYPE_MODE (index_type);
10118 rtx rangertx = expand_normal (range);
10120 /* We must handle the endpoints in the original mode. */
10121 index_expr = build2 (MINUS_EXPR, index_type,
10122 index_expr, minval);
10123 minval = integer_zero_node;
10124 index = expand_normal (index_expr);
10126 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10127 omode, 1, default_label);
10128 /* Now we can safely truncate. */
10129 index = convert_to_mode (index_mode, index, 0);
10133 if (TYPE_MODE (index_type) != index_mode)
10135 index_type = lang_hooks.types.type_for_size (index_bits, 0);
10136 index_expr = fold_convert (index_type, index_expr);
10139 index = expand_normal (index_expr);
10142 do_pending_stack_adjust ();
10144 op1 = expand_normal (minval);
10145 op2 = expand_normal (range);
10147 create_input_operand (&ops[0], index, index_mode);
10148 create_convert_operand_from_type (&ops[1], op1, TREE_TYPE (minval));
10149 create_convert_operand_from_type (&ops[2], op2, TREE_TYPE (range));
10150 create_fixed_operand (&ops[3], table_label);
10151 create_fixed_operand (&ops[4], (default_label
10153 : fallback_label));
10154 expand_jump_insn (CODE_FOR_casesi, 5, ops);
10158 /* Attempt to generate a tablejump instruction; same concept. */
10159 #ifndef HAVE_tablejump
10160 #define HAVE_tablejump 0
10161 #define gen_tablejump(x, y) (0)
10164 /* Subroutine of the next function.
10166 INDEX is the value being switched on, with the lowest value
10167 in the table already subtracted.
10168 MODE is its expected mode (needed if INDEX is constant).
10169 RANGE is the length of the jump table.
10170 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10172 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10173 index value is out of range. */
10176 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
10181 if (INTVAL (range) > cfun->cfg->max_jumptable_ents)
10182 cfun->cfg->max_jumptable_ents = INTVAL (range);
10184 /* Do an unsigned comparison (in the proper mode) between the index
10185 expression and the value which represents the length of the range.
10186 Since we just finished subtracting the lower bound of the range
10187 from the index expression, this comparison allows us to simultaneously
10188 check that the original index expression value is both greater than
10189 or equal to the minimum value of the range and less than or equal to
10190 the maximum value of the range. */
10193 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10196 /* If index is in range, it must fit in Pmode.
10197 Convert to Pmode so we can index with it. */
10199 index = convert_to_mode (Pmode, index, 1);
10201 /* Don't let a MEM slip through, because then INDEX that comes
10202 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10203 and break_out_memory_refs will go to work on it and mess it up. */
10204 #ifdef PIC_CASE_VECTOR_ADDRESS
10205 if (flag_pic && !REG_P (index))
10206 index = copy_to_mode_reg (Pmode, index);
10209 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10210 GET_MODE_SIZE, because this indicates how large insns are. The other
10211 uses should all be Pmode, because they are addresses. This code
10212 could fail if addresses and insns are not the same size. */
10213 index = gen_rtx_PLUS (Pmode,
10214 gen_rtx_MULT (Pmode, index,
10215 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10216 gen_rtx_LABEL_REF (Pmode, table_label));
10217 #ifdef PIC_CASE_VECTOR_ADDRESS
10219 index = PIC_CASE_VECTOR_ADDRESS (index);
10222 index = memory_address (CASE_VECTOR_MODE, index);
10223 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10224 vector = gen_const_mem (CASE_VECTOR_MODE, index);
10225 convert_move (temp, vector, 0);
10227 emit_jump_insn (gen_tablejump (temp, table_label));
10229 /* If we are generating PIC code or if the table is PC-relative, the
10230 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10231 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10236 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
10237 rtx table_label, rtx default_label)
10241 if (! HAVE_tablejump)
10244 index_expr = fold_build2 (MINUS_EXPR, index_type,
10245 fold_convert (index_type, index_expr),
10246 fold_convert (index_type, minval));
10247 index = expand_normal (index_expr);
10248 do_pending_stack_adjust ();
10250 do_tablejump (index, TYPE_MODE (index_type),
10251 convert_modes (TYPE_MODE (index_type),
10252 TYPE_MODE (TREE_TYPE (range)),
10253 expand_normal (range),
10254 TYPE_UNSIGNED (TREE_TYPE (range))),
10255 table_label, default_label);
10259 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10261 const_vector_from_tree (tree exp)
10266 enum machine_mode inner, mode;
10268 mode = TYPE_MODE (TREE_TYPE (exp));
10270 if (initializer_zerop (exp))
10271 return CONST0_RTX (mode);
10273 units = GET_MODE_NUNITS (mode);
10274 inner = GET_MODE_INNER (mode);
10276 v = rtvec_alloc (units);
10278 link = TREE_VECTOR_CST_ELTS (exp);
10279 for (i = 0; link; link = TREE_CHAIN (link), ++i)
10281 elt = TREE_VALUE (link);
10283 if (TREE_CODE (elt) == REAL_CST)
10284 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
10286 else if (TREE_CODE (elt) == FIXED_CST)
10287 RTVEC_ELT (v, i) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt),
10290 RTVEC_ELT (v, i) = immed_double_int_const (tree_to_double_int (elt),
10294 /* Initialize remaining elements to 0. */
10295 for (; i < units; ++i)
10296 RTVEC_ELT (v, i) = CONST0_RTX (inner);
10298 return gen_rtx_CONST_VECTOR (mode, v);
10301 /* Build a decl for a personality function given a language prefix. */
10304 build_personality_function (const char *lang)
10306 const char *unwind_and_version;
10310 switch (targetm_common.except_unwind_info (&global_options))
10315 unwind_and_version = "_sj0";
10319 unwind_and_version = "_v0";
10322 gcc_unreachable ();
10325 name = ACONCAT (("__", lang, "_personality", unwind_and_version, NULL));
10327 type = build_function_type_list (integer_type_node, integer_type_node,
10328 long_long_unsigned_type_node,
10329 ptr_type_node, ptr_type_node, NULL_TREE);
10330 decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
10331 get_identifier (name), type);
10332 DECL_ARTIFICIAL (decl) = 1;
10333 DECL_EXTERNAL (decl) = 1;
10334 TREE_PUBLIC (decl) = 1;
10336 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
10337 are the flags assigned by targetm.encode_section_info. */
10338 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl), 0), NULL);
10343 /* Extracts the personality function of DECL and returns the corresponding
10347 get_personality_function (tree decl)
10349 tree personality = DECL_FUNCTION_PERSONALITY (decl);
10350 enum eh_personality_kind pk;
10352 pk = function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl));
10353 if (pk == eh_personality_none)
10357 && pk == eh_personality_any)
10358 personality = lang_hooks.eh_personality ();
10360 if (pk == eh_personality_lang)
10361 gcc_assert (personality != NULL_TREE);
10363 return XEXP (DECL_RTL (personality), 0);
10366 #include "gt-expr.h"