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 2012 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. */
42 #include "typeclass.h"
44 #include "langhooks.h"
47 #include "tree-iterator.h"
48 #include "tree-flow.h"
50 #include "common/common-target.h"
53 #include "diagnostic.h"
54 #include "ssaexpand.h"
55 #include "target-globals.h"
58 /* Decide whether a function's arguments should be processed
59 from first to last or from last to first.
61 They should if the stack and args grow in opposite directions, but
62 only if we have push insns. */
66 #ifndef PUSH_ARGS_REVERSED
67 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
68 #define PUSH_ARGS_REVERSED /* If it's last to first. */
74 #ifndef STACK_PUSH_CODE
75 #ifdef STACK_GROWS_DOWNWARD
76 #define STACK_PUSH_CODE PRE_DEC
78 #define STACK_PUSH_CODE PRE_INC
83 /* If this is nonzero, we do not bother generating VOLATILE
84 around volatile memory references, and we are willing to
85 output indirect addresses. If cse is to follow, we reject
86 indirect addresses so a useful potential cse is generated;
87 if it is used only once, instruction combination will produce
88 the same indirect address eventually. */
91 /* This structure is used by move_by_pieces to describe the move to
93 struct move_by_pieces_d
102 int explicit_inc_from;
103 unsigned HOST_WIDE_INT len;
104 HOST_WIDE_INT offset;
108 /* This structure is used by store_by_pieces to describe the clear to
111 struct store_by_pieces_d
117 unsigned HOST_WIDE_INT len;
118 HOST_WIDE_INT offset;
119 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode);
124 static void move_by_pieces_1 (rtx (*) (rtx, ...), enum machine_mode,
125 struct move_by_pieces_d *);
126 static bool block_move_libcall_safe_for_call_parm (void);
127 static bool emit_block_move_via_movmem (rtx, rtx, rtx, unsigned, unsigned, HOST_WIDE_INT);
128 static tree emit_block_move_libcall_fn (int);
129 static void emit_block_move_via_loop (rtx, rtx, rtx, unsigned);
130 static rtx clear_by_pieces_1 (void *, HOST_WIDE_INT, enum machine_mode);
131 static void clear_by_pieces (rtx, unsigned HOST_WIDE_INT, unsigned int);
132 static void store_by_pieces_1 (struct store_by_pieces_d *, unsigned int);
133 static void store_by_pieces_2 (rtx (*) (rtx, ...), enum machine_mode,
134 struct store_by_pieces_d *);
135 static tree clear_storage_libcall_fn (int);
136 static rtx compress_float_constant (rtx, rtx);
137 static rtx get_subtarget (rtx);
138 static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
139 HOST_WIDE_INT, enum machine_mode,
140 tree, tree, int, alias_set_type);
141 static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
142 static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT,
143 unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT,
145 tree, tree, alias_set_type, bool);
147 static unsigned HOST_WIDE_INT highest_pow2_factor_for_target (const_tree, const_tree);
149 static int is_aligning_offset (const_tree, const_tree);
150 static void expand_operands (tree, tree, rtx, rtx*, rtx*,
151 enum expand_modifier);
152 static rtx reduce_to_bit_field_precision (rtx, rtx, tree);
153 static rtx do_store_flag (sepops, rtx, enum machine_mode);
155 static void emit_single_push_insn (enum machine_mode, rtx, tree);
157 static void do_tablejump (rtx, enum machine_mode, rtx, rtx, rtx, int);
158 static rtx const_vector_from_tree (tree);
159 static void write_complex_part (rtx, rtx, bool);
161 /* This macro is used to determine whether move_by_pieces should be called
162 to perform a structure copy. */
163 #ifndef MOVE_BY_PIECES_P
164 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
165 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
166 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
169 /* This macro is used to determine whether clear_by_pieces should be
170 called to clear storage. */
171 #ifndef CLEAR_BY_PIECES_P
172 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
173 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
174 < (unsigned int) CLEAR_RATIO (optimize_insn_for_speed_p ()))
177 /* This macro is used to determine whether store_by_pieces should be
178 called to "memset" storage with byte values other than zero. */
179 #ifndef SET_BY_PIECES_P
180 #define SET_BY_PIECES_P(SIZE, ALIGN) \
181 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
182 < (unsigned int) SET_RATIO (optimize_insn_for_speed_p ()))
185 /* This macro is used to determine whether store_by_pieces should be
186 called to "memcpy" storage when the source is a constant string. */
187 #ifndef STORE_BY_PIECES_P
188 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
189 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
190 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
193 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
195 #ifndef SLOW_UNALIGNED_ACCESS
196 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
199 /* This is run to set up which modes can be used
200 directly in memory and to initialize the block move optab. It is run
201 at the beginning of compilation and when the target is reinitialized. */
204 init_expr_target (void)
207 enum machine_mode mode;
212 /* Try indexing by frame ptr and try by stack ptr.
213 It is known that on the Convex the stack ptr isn't a valid index.
214 With luck, one or the other is valid on any machine. */
215 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
216 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
218 /* A scratch register we can modify in-place below to avoid
219 useless RTL allocations. */
220 reg = gen_rtx_REG (VOIDmode, -1);
222 insn = rtx_alloc (INSN);
223 pat = gen_rtx_SET (VOIDmode, NULL_RTX, NULL_RTX);
224 PATTERN (insn) = pat;
226 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
227 mode = (enum machine_mode) ((int) mode + 1))
231 direct_load[(int) mode] = direct_store[(int) mode] = 0;
232 PUT_MODE (mem, mode);
233 PUT_MODE (mem1, mode);
234 PUT_MODE (reg, mode);
236 /* See if there is some register that can be used in this mode and
237 directly loaded or stored from memory. */
239 if (mode != VOIDmode && mode != BLKmode)
240 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
241 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
244 if (! HARD_REGNO_MODE_OK (regno, mode))
247 SET_REGNO (reg, regno);
250 SET_DEST (pat) = reg;
251 if (recog (pat, insn, &num_clobbers) >= 0)
252 direct_load[(int) mode] = 1;
254 SET_SRC (pat) = mem1;
255 SET_DEST (pat) = reg;
256 if (recog (pat, insn, &num_clobbers) >= 0)
257 direct_load[(int) mode] = 1;
260 SET_DEST (pat) = mem;
261 if (recog (pat, insn, &num_clobbers) >= 0)
262 direct_store[(int) mode] = 1;
265 SET_DEST (pat) = mem1;
266 if (recog (pat, insn, &num_clobbers) >= 0)
267 direct_store[(int) mode] = 1;
271 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
273 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
274 mode = GET_MODE_WIDER_MODE (mode))
276 enum machine_mode srcmode;
277 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
278 srcmode = GET_MODE_WIDER_MODE (srcmode))
282 ic = can_extend_p (mode, srcmode, 0);
283 if (ic == CODE_FOR_nothing)
286 PUT_MODE (mem, srcmode);
288 if (insn_operand_matches (ic, 1, mem))
289 float_extend_from_mem[mode][srcmode] = true;
294 /* This is run at the start of compiling a function. */
299 memset (&crtl->expr, 0, sizeof (crtl->expr));
302 /* Copy data from FROM to TO, where the machine modes are not the same.
303 Both modes may be integer, or both may be floating, or both may be
305 UNSIGNEDP should be nonzero if FROM is an unsigned type.
306 This causes zero-extension instead of sign-extension. */
309 convert_move (rtx to, rtx from, int unsignedp)
311 enum machine_mode to_mode = GET_MODE (to);
312 enum machine_mode from_mode = GET_MODE (from);
313 int to_real = SCALAR_FLOAT_MODE_P (to_mode);
314 int from_real = SCALAR_FLOAT_MODE_P (from_mode);
318 /* rtx code for making an equivalent value. */
319 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
320 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
323 gcc_assert (to_real == from_real);
324 gcc_assert (to_mode != BLKmode);
325 gcc_assert (from_mode != BLKmode);
327 /* If the source and destination are already the same, then there's
332 /* If FROM is a SUBREG that indicates that we have already done at least
333 the required extension, strip it. We don't handle such SUBREGs as
336 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
337 && (GET_MODE_PRECISION (GET_MODE (SUBREG_REG (from)))
338 >= GET_MODE_PRECISION (to_mode))
339 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
340 from = gen_lowpart (to_mode, from), from_mode = to_mode;
342 gcc_assert (GET_CODE (to) != SUBREG || !SUBREG_PROMOTED_VAR_P (to));
344 if (to_mode == from_mode
345 || (from_mode == VOIDmode && CONSTANT_P (from)))
347 emit_move_insn (to, from);
351 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
353 gcc_assert (GET_MODE_BITSIZE (from_mode) == GET_MODE_BITSIZE (to_mode));
355 if (VECTOR_MODE_P (to_mode))
356 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
358 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
360 emit_move_insn (to, from);
364 if (GET_CODE (to) == CONCAT && GET_CODE (from) == CONCAT)
366 convert_move (XEXP (to, 0), XEXP (from, 0), unsignedp);
367 convert_move (XEXP (to, 1), XEXP (from, 1), unsignedp);
376 gcc_assert ((GET_MODE_PRECISION (from_mode)
377 != GET_MODE_PRECISION (to_mode))
378 || (DECIMAL_FLOAT_MODE_P (from_mode)
379 != DECIMAL_FLOAT_MODE_P (to_mode)));
381 if (GET_MODE_PRECISION (from_mode) == GET_MODE_PRECISION (to_mode))
382 /* Conversion between decimal float and binary float, same size. */
383 tab = DECIMAL_FLOAT_MODE_P (from_mode) ? trunc_optab : sext_optab;
384 else if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode))
389 /* Try converting directly if the insn is supported. */
391 code = convert_optab_handler (tab, to_mode, from_mode);
392 if (code != CODE_FOR_nothing)
394 emit_unop_insn (code, to, from,
395 tab == sext_optab ? FLOAT_EXTEND : FLOAT_TRUNCATE);
399 /* Otherwise use a libcall. */
400 libcall = convert_optab_libfunc (tab, to_mode, from_mode);
402 /* Is this conversion implemented yet? */
403 gcc_assert (libcall);
406 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
408 insns = get_insns ();
410 emit_libcall_block (insns, to, value,
411 tab == trunc_optab ? gen_rtx_FLOAT_TRUNCATE (to_mode,
413 : gen_rtx_FLOAT_EXTEND (to_mode, from));
417 /* Handle pointer conversion. */ /* SPEE 900220. */
418 /* Targets are expected to provide conversion insns between PxImode and
419 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
420 if (GET_MODE_CLASS (to_mode) == MODE_PARTIAL_INT)
422 enum machine_mode full_mode
423 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode), MODE_INT);
425 gcc_assert (convert_optab_handler (trunc_optab, to_mode, full_mode)
426 != CODE_FOR_nothing);
428 if (full_mode != from_mode)
429 from = convert_to_mode (full_mode, from, unsignedp);
430 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, full_mode),
434 if (GET_MODE_CLASS (from_mode) == MODE_PARTIAL_INT)
437 enum machine_mode full_mode
438 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode), MODE_INT);
439 convert_optab ctab = unsignedp ? zext_optab : sext_optab;
440 enum insn_code icode;
442 icode = convert_optab_handler (ctab, full_mode, from_mode);
443 gcc_assert (icode != CODE_FOR_nothing);
445 if (to_mode == full_mode)
447 emit_unop_insn (icode, to, from, UNKNOWN);
451 new_from = gen_reg_rtx (full_mode);
452 emit_unop_insn (icode, new_from, from, UNKNOWN);
454 /* else proceed to integer conversions below. */
455 from_mode = full_mode;
459 /* Make sure both are fixed-point modes or both are not. */
460 gcc_assert (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode) ==
461 ALL_SCALAR_FIXED_POINT_MODE_P (to_mode));
462 if (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode))
464 /* If we widen from_mode to to_mode and they are in the same class,
465 we won't saturate the result.
466 Otherwise, always saturate the result to play safe. */
467 if (GET_MODE_CLASS (from_mode) == GET_MODE_CLASS (to_mode)
468 && GET_MODE_SIZE (from_mode) < GET_MODE_SIZE (to_mode))
469 expand_fixed_convert (to, from, 0, 0);
471 expand_fixed_convert (to, from, 0, 1);
475 /* Now both modes are integers. */
477 /* Handle expanding beyond a word. */
478 if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode)
479 && GET_MODE_PRECISION (to_mode) > BITS_PER_WORD)
486 enum machine_mode lowpart_mode;
487 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
489 /* Try converting directly if the insn is supported. */
490 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
493 /* If FROM is a SUBREG, put it into a register. Do this
494 so that we always generate the same set of insns for
495 better cse'ing; if an intermediate assignment occurred,
496 we won't be doing the operation directly on the SUBREG. */
497 if (optimize > 0 && GET_CODE (from) == SUBREG)
498 from = force_reg (from_mode, from);
499 emit_unop_insn (code, to, from, equiv_code);
502 /* Next, try converting via full word. */
503 else if (GET_MODE_PRECISION (from_mode) < BITS_PER_WORD
504 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
505 != CODE_FOR_nothing))
507 rtx word_to = gen_reg_rtx (word_mode);
510 if (reg_overlap_mentioned_p (to, from))
511 from = force_reg (from_mode, from);
514 convert_move (word_to, from, unsignedp);
515 emit_unop_insn (code, to, word_to, equiv_code);
519 /* No special multiword conversion insn; do it by hand. */
522 /* Since we will turn this into a no conflict block, we must ensure the
523 the source does not overlap the target so force it into an isolated
524 register when maybe so. Likewise for any MEM input, since the
525 conversion sequence might require several references to it and we
526 must ensure we're getting the same value every time. */
528 if (MEM_P (from) || 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_PRECISION (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_PRECISION (from_mode) > BITS_PER_WORD
571 && GET_MODE_PRECISION (to_mode) <= BITS_PER_WORD)
574 && ! MEM_VOLATILE_P (from)
575 && direct_load[(int) to_mode]
576 && ! mode_dependent_address_p (XEXP (from, 0),
577 MEM_ADDR_SPACE (from)))
579 || GET_CODE (from) == SUBREG))
580 from = force_reg (from_mode, from);
581 convert_move (to, gen_lowpart (word_mode, from), 0);
585 /* Now follow all the conversions between integers
586 no more than a word long. */
588 /* For truncation, usually we can just refer to FROM in a narrower mode. */
589 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
590 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode, from_mode))
593 && ! MEM_VOLATILE_P (from)
594 && direct_load[(int) to_mode]
595 && ! mode_dependent_address_p (XEXP (from, 0),
596 MEM_ADDR_SPACE (from)))
598 || GET_CODE (from) == SUBREG))
599 from = force_reg (from_mode, from);
600 if (REG_P (from) && REGNO (from) < FIRST_PSEUDO_REGISTER
601 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
602 from = copy_to_reg (from);
603 emit_move_insn (to, gen_lowpart (to_mode, from));
607 /* Handle extension. */
608 if (GET_MODE_PRECISION (to_mode) > GET_MODE_PRECISION (from_mode))
610 /* Convert directly if that works. */
611 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
614 emit_unop_insn (code, to, from, equiv_code);
619 enum machine_mode intermediate;
623 /* Search for a mode to convert via. */
624 for (intermediate = from_mode; intermediate != VOIDmode;
625 intermediate = GET_MODE_WIDER_MODE (intermediate))
626 if (((can_extend_p (to_mode, intermediate, unsignedp)
628 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
629 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode, intermediate)))
630 && (can_extend_p (intermediate, from_mode, unsignedp)
631 != CODE_FOR_nothing))
633 convert_move (to, convert_to_mode (intermediate, from,
634 unsignedp), unsignedp);
638 /* No suitable intermediate mode.
639 Generate what we need with shifts. */
640 shift_amount = (GET_MODE_PRECISION (to_mode)
641 - GET_MODE_PRECISION (from_mode));
642 from = gen_lowpart (to_mode, force_reg (from_mode, from));
643 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
645 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
648 emit_move_insn (to, tmp);
653 /* Support special truncate insns for certain modes. */
654 if (convert_optab_handler (trunc_optab, to_mode,
655 from_mode) != CODE_FOR_nothing)
657 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, from_mode),
662 /* Handle truncation of volatile memrefs, and so on;
663 the things that couldn't be truncated directly,
664 and for which there was no special instruction.
666 ??? Code above formerly short-circuited this, for most integer
667 mode pairs, with a force_reg in from_mode followed by a recursive
668 call to this routine. Appears always to have been wrong. */
669 if (GET_MODE_PRECISION (to_mode) < GET_MODE_PRECISION (from_mode))
671 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
672 emit_move_insn (to, temp);
676 /* Mode combination is not recognized. */
680 /* Return an rtx for a value that would result
681 from converting X to mode MODE.
682 Both X and MODE may be floating, or both integer.
683 UNSIGNEDP is nonzero if X is an unsigned value.
684 This can be done by referring to a part of X in place
685 or by copying to a new temporary with conversion. */
688 convert_to_mode (enum machine_mode mode, rtx x, int unsignedp)
690 return convert_modes (mode, VOIDmode, x, unsignedp);
693 /* Return an rtx for a value that would result
694 from converting X from mode OLDMODE to mode MODE.
695 Both modes may be floating, or both integer.
696 UNSIGNEDP is nonzero if X is an unsigned value.
698 This can be done by referring to a part of X in place
699 or by copying to a new temporary with conversion.
701 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
704 convert_modes (enum machine_mode mode, enum machine_mode oldmode, rtx x, int unsignedp)
708 /* If FROM is a SUBREG that indicates that we have already done at least
709 the required extension, strip it. */
711 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
712 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
713 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
714 x = gen_lowpart (mode, x);
716 if (GET_MODE (x) != VOIDmode)
717 oldmode = GET_MODE (x);
722 /* There is one case that we must handle specially: If we are converting
723 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
724 we are to interpret the constant as unsigned, gen_lowpart will do
725 the wrong if the constant appears negative. What we want to do is
726 make the high-order word of the constant zero, not all ones. */
728 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
729 && GET_MODE_BITSIZE (mode) == HOST_BITS_PER_DOUBLE_INT
730 && CONST_INT_P (x) && INTVAL (x) < 0)
732 double_int val = double_int::from_uhwi (INTVAL (x));
734 /* We need to zero extend VAL. */
735 if (oldmode != VOIDmode)
736 val = val.zext (GET_MODE_BITSIZE (oldmode));
738 return immed_double_int_const (val, mode);
741 /* We can do this with a gen_lowpart if both desired and current modes
742 are integer, and this is either a constant integer, a register, or a
743 non-volatile MEM. Except for the constant case where MODE is no
744 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
747 && GET_MODE_PRECISION (mode) <= HOST_BITS_PER_WIDE_INT)
748 || (GET_MODE_CLASS (mode) == MODE_INT
749 && GET_MODE_CLASS (oldmode) == MODE_INT
750 && (CONST_DOUBLE_AS_INT_P (x)
751 || (GET_MODE_PRECISION (mode) <= GET_MODE_PRECISION (oldmode)
752 && ((MEM_P (x) && ! MEM_VOLATILE_P (x)
753 && direct_load[(int) mode])
755 && (! HARD_REGISTER_P (x)
756 || HARD_REGNO_MODE_OK (REGNO (x), mode))
757 && TRULY_NOOP_TRUNCATION_MODES_P (mode,
760 /* ?? If we don't know OLDMODE, we have to assume here that
761 X does not need sign- or zero-extension. This may not be
762 the case, but it's the best we can do. */
763 if (CONST_INT_P (x) && oldmode != VOIDmode
764 && GET_MODE_PRECISION (mode) > GET_MODE_PRECISION (oldmode))
766 HOST_WIDE_INT val = INTVAL (x);
768 /* We must sign or zero-extend in this case. Start by
769 zero-extending, then sign extend if we need to. */
770 val &= GET_MODE_MASK (oldmode);
772 && val_signbit_known_set_p (oldmode, val))
773 val |= ~GET_MODE_MASK (oldmode);
775 return gen_int_mode (val, mode);
778 return gen_lowpart (mode, x);
781 /* Converting from integer constant into mode is always equivalent to an
783 if (VECTOR_MODE_P (mode) && GET_MODE (x) == VOIDmode)
785 gcc_assert (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (oldmode));
786 return simplify_gen_subreg (mode, x, oldmode, 0);
789 temp = gen_reg_rtx (mode);
790 convert_move (temp, x, unsignedp);
794 /* Return the largest alignment we can use for doing a move (or store)
795 of MAX_PIECES. ALIGN is the largest alignment we could use. */
798 alignment_for_piecewise_move (unsigned int max_pieces, unsigned int align)
800 enum machine_mode tmode;
802 tmode = mode_for_size (max_pieces * BITS_PER_UNIT, MODE_INT, 1);
803 if (align >= GET_MODE_ALIGNMENT (tmode))
804 align = GET_MODE_ALIGNMENT (tmode);
807 enum machine_mode tmode, xmode;
809 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
811 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
812 if (GET_MODE_SIZE (tmode) > max_pieces
813 || SLOW_UNALIGNED_ACCESS (tmode, align))
816 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
822 /* Return the widest integer mode no wider than SIZE. If no such mode
823 can be found, return VOIDmode. */
825 static enum machine_mode
826 widest_int_mode_for_size (unsigned int size)
828 enum machine_mode tmode, mode = VOIDmode;
830 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
831 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
832 if (GET_MODE_SIZE (tmode) < size)
838 /* STORE_MAX_PIECES is the number of bytes at a time that we can
839 store efficiently. Due to internal GCC limitations, this is
840 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
841 for an immediate constant. */
843 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
845 /* Determine whether the LEN bytes can be moved by using several move
846 instructions. Return nonzero if a call to move_by_pieces should
850 can_move_by_pieces (unsigned HOST_WIDE_INT len,
851 unsigned int align ATTRIBUTE_UNUSED)
853 return MOVE_BY_PIECES_P (len, align);
856 /* Generate several move instructions to copy LEN bytes from block FROM to
857 block TO. (These are MEM rtx's with BLKmode).
859 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
860 used to push FROM to the stack.
862 ALIGN is maximum stack alignment we can assume.
864 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
865 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
869 move_by_pieces (rtx to, rtx from, unsigned HOST_WIDE_INT len,
870 unsigned int align, int endp)
872 struct move_by_pieces_d data;
873 enum machine_mode to_addr_mode;
874 enum machine_mode from_addr_mode = get_address_mode (from);
875 rtx to_addr, from_addr = XEXP (from, 0);
876 unsigned int max_size = MOVE_MAX_PIECES + 1;
877 enum insn_code icode;
879 align = MIN (to ? MEM_ALIGN (to) : align, MEM_ALIGN (from));
882 data.from_addr = from_addr;
885 to_addr_mode = get_address_mode (to);
886 to_addr = XEXP (to, 0);
889 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
890 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
892 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
896 to_addr_mode = VOIDmode;
900 #ifdef STACK_GROWS_DOWNWARD
906 data.to_addr = to_addr;
909 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
910 || GET_CODE (from_addr) == POST_INC
911 || GET_CODE (from_addr) == POST_DEC);
913 data.explicit_inc_from = 0;
914 data.explicit_inc_to = 0;
915 if (data.reverse) data.offset = len;
918 /* If copying requires more than two move insns,
919 copy addresses to registers (to make displacements shorter)
920 and use post-increment if available. */
921 if (!(data.autinc_from && data.autinc_to)
922 && move_by_pieces_ninsns (len, align, max_size) > 2)
924 /* Find the mode of the largest move...
925 MODE might not be used depending on the definitions of the
926 USE_* macros below. */
927 enum machine_mode mode ATTRIBUTE_UNUSED
928 = widest_int_mode_for_size (max_size);
930 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
932 data.from_addr = copy_to_mode_reg (from_addr_mode,
933 plus_constant (from_addr_mode,
935 data.autinc_from = 1;
936 data.explicit_inc_from = -1;
938 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
940 data.from_addr = copy_to_mode_reg (from_addr_mode, from_addr);
941 data.autinc_from = 1;
942 data.explicit_inc_from = 1;
944 if (!data.autinc_from && CONSTANT_P (from_addr))
945 data.from_addr = copy_to_mode_reg (from_addr_mode, from_addr);
946 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
948 data.to_addr = copy_to_mode_reg (to_addr_mode,
949 plus_constant (to_addr_mode,
952 data.explicit_inc_to = -1;
954 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
956 data.to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
958 data.explicit_inc_to = 1;
960 if (!data.autinc_to && CONSTANT_P (to_addr))
961 data.to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
964 align = alignment_for_piecewise_move (MOVE_MAX_PIECES, align);
966 /* First move what we can in the largest integer mode, then go to
967 successively smaller modes. */
969 while (max_size > 1 && data.len > 0)
971 enum machine_mode mode = widest_int_mode_for_size (max_size);
973 if (mode == VOIDmode)
976 icode = optab_handler (mov_optab, mode);
977 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
978 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
980 max_size = GET_MODE_SIZE (mode);
983 /* The code above should have handled everything. */
984 gcc_assert (!data.len);
990 gcc_assert (!data.reverse);
995 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
996 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
998 data.to_addr = copy_to_mode_reg (to_addr_mode,
999 plus_constant (to_addr_mode,
1003 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
1010 to1 = adjust_address (data.to, QImode, data.offset);
1018 /* Return number of insns required to move L bytes by pieces.
1019 ALIGN (in bits) is maximum alignment we can assume. */
1021 unsigned HOST_WIDE_INT
1022 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l, unsigned int align,
1023 unsigned int max_size)
1025 unsigned HOST_WIDE_INT n_insns = 0;
1027 align = alignment_for_piecewise_move (MOVE_MAX_PIECES, align);
1029 while (max_size > 1 && l > 0)
1031 enum machine_mode mode;
1032 enum insn_code icode;
1034 mode = widest_int_mode_for_size (max_size);
1036 if (mode == VOIDmode)
1039 icode = optab_handler (mov_optab, mode);
1040 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1041 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1043 max_size = GET_MODE_SIZE (mode);
1050 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1051 with move instructions for mode MODE. GENFUN is the gen_... function
1052 to make a move insn for that mode. DATA has all the other info. */
1055 move_by_pieces_1 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
1056 struct move_by_pieces_d *data)
1058 unsigned int size = GET_MODE_SIZE (mode);
1059 rtx to1 = NULL_RTX, from1;
1061 while (data->len >= size)
1064 data->offset -= size;
1068 if (data->autinc_to)
1069 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1072 to1 = adjust_address (data->to, mode, data->offset);
1075 if (data->autinc_from)
1076 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1079 from1 = adjust_address (data->from, mode, data->offset);
1081 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1082 emit_insn (gen_add2_insn (data->to_addr,
1083 GEN_INT (-(HOST_WIDE_INT)size)));
1084 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1085 emit_insn (gen_add2_insn (data->from_addr,
1086 GEN_INT (-(HOST_WIDE_INT)size)));
1089 emit_insn ((*genfun) (to1, from1));
1092 #ifdef PUSH_ROUNDING
1093 emit_single_push_insn (mode, from1, NULL);
1099 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1100 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1101 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1102 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1104 if (! data->reverse)
1105 data->offset += size;
1111 /* Emit code to move a block Y to a block X. This may be done with
1112 string-move instructions, with multiple scalar move instructions,
1113 or with a library call.
1115 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1116 SIZE is an rtx that says how long they are.
1117 ALIGN is the maximum alignment we can assume they have.
1118 METHOD describes what kind of copy this is, and what mechanisms may be used.
1120 Return the address of the new block, if memcpy is called and returns it,
1124 emit_block_move_hints (rtx x, rtx y, rtx size, enum block_op_methods method,
1125 unsigned int expected_align, HOST_WIDE_INT expected_size)
1132 if (CONST_INT_P (size)
1133 && INTVAL (size) == 0)
1138 case BLOCK_OP_NORMAL:
1139 case BLOCK_OP_TAILCALL:
1140 may_use_call = true;
1143 case BLOCK_OP_CALL_PARM:
1144 may_use_call = block_move_libcall_safe_for_call_parm ();
1146 /* Make inhibit_defer_pop nonzero around the library call
1147 to force it to pop the arguments right away. */
1151 case BLOCK_OP_NO_LIBCALL:
1152 may_use_call = false;
1159 gcc_assert (MEM_P (x) && MEM_P (y));
1160 align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1161 gcc_assert (align >= BITS_PER_UNIT);
1163 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1164 block copy is more efficient for other large modes, e.g. DCmode. */
1165 x = adjust_address (x, BLKmode, 0);
1166 y = adjust_address (y, BLKmode, 0);
1168 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1169 can be incorrect is coming from __builtin_memcpy. */
1170 if (CONST_INT_P (size))
1172 x = shallow_copy_rtx (x);
1173 y = shallow_copy_rtx (y);
1174 set_mem_size (x, INTVAL (size));
1175 set_mem_size (y, INTVAL (size));
1178 if (CONST_INT_P (size) && MOVE_BY_PIECES_P (INTVAL (size), align))
1179 move_by_pieces (x, y, INTVAL (size), align, 0);
1180 else if (emit_block_move_via_movmem (x, y, size, align,
1181 expected_align, expected_size))
1183 else if (may_use_call
1184 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (x))
1185 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (y)))
1187 /* Since x and y are passed to a libcall, mark the corresponding
1188 tree EXPR as addressable. */
1189 tree y_expr = MEM_EXPR (y);
1190 tree x_expr = MEM_EXPR (x);
1192 mark_addressable (y_expr);
1194 mark_addressable (x_expr);
1195 retval = emit_block_move_via_libcall (x, y, size,
1196 method == BLOCK_OP_TAILCALL);
1200 emit_block_move_via_loop (x, y, size, align);
1202 if (method == BLOCK_OP_CALL_PARM)
1209 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1211 return emit_block_move_hints (x, y, size, method, 0, -1);
1214 /* A subroutine of emit_block_move. Returns true if calling the
1215 block move libcall will not clobber any parameters which may have
1216 already been placed on the stack. */
1219 block_move_libcall_safe_for_call_parm (void)
1221 #if defined (REG_PARM_STACK_SPACE)
1225 /* If arguments are pushed on the stack, then they're safe. */
1229 /* If registers go on the stack anyway, any argument is sure to clobber
1230 an outgoing argument. */
1231 #if defined (REG_PARM_STACK_SPACE)
1232 fn = emit_block_move_libcall_fn (false);
1233 /* Avoid set but not used warning if *REG_PARM_STACK_SPACE doesn't
1234 depend on its argument. */
1236 if (OUTGOING_REG_PARM_STACK_SPACE ((!fn ? NULL_TREE : TREE_TYPE (fn)))
1237 && REG_PARM_STACK_SPACE (fn) != 0)
1241 /* If any argument goes in memory, then it might clobber an outgoing
1244 CUMULATIVE_ARGS args_so_far_v;
1245 cumulative_args_t args_so_far;
1248 fn = emit_block_move_libcall_fn (false);
1249 INIT_CUMULATIVE_ARGS (args_so_far_v, TREE_TYPE (fn), NULL_RTX, 0, 3);
1250 args_so_far = pack_cumulative_args (&args_so_far_v);
1252 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1253 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1255 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1256 rtx tmp = targetm.calls.function_arg (args_so_far, mode,
1258 if (!tmp || !REG_P (tmp))
1260 if (targetm.calls.arg_partial_bytes (args_so_far, mode, NULL, 1))
1262 targetm.calls.function_arg_advance (args_so_far, mode,
1269 /* A subroutine of emit_block_move. Expand a movmem pattern;
1270 return true if successful. */
1273 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align,
1274 unsigned int expected_align, HOST_WIDE_INT expected_size)
1276 int save_volatile_ok = volatile_ok;
1277 enum machine_mode mode;
1279 if (expected_align < align)
1280 expected_align = align;
1282 /* Since this is a move insn, we don't care about volatility. */
1285 /* Try the most limited insn first, because there's no point
1286 including more than one in the machine description unless
1287 the more limited one has some advantage. */
1289 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1290 mode = GET_MODE_WIDER_MODE (mode))
1292 enum insn_code code = direct_optab_handler (movmem_optab, mode);
1294 if (code != CODE_FOR_nothing
1295 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1296 here because if SIZE is less than the mode mask, as it is
1297 returned by the macro, it will definitely be less than the
1298 actual mode mask. */
1299 && ((CONST_INT_P (size)
1300 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1301 <= (GET_MODE_MASK (mode) >> 1)))
1302 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD))
1304 struct expand_operand ops[6];
1307 /* ??? When called via emit_block_move_for_call, it'd be
1308 nice if there were some way to inform the backend, so
1309 that it doesn't fail the expansion because it thinks
1310 emitting the libcall would be more efficient. */
1311 nops = insn_data[(int) code].n_generator_args;
1312 gcc_assert (nops == 4 || nops == 6);
1314 create_fixed_operand (&ops[0], x);
1315 create_fixed_operand (&ops[1], y);
1316 /* The check above guarantees that this size conversion is valid. */
1317 create_convert_operand_to (&ops[2], size, mode, true);
1318 create_integer_operand (&ops[3], align / BITS_PER_UNIT);
1321 create_integer_operand (&ops[4], expected_align / BITS_PER_UNIT);
1322 create_integer_operand (&ops[5], expected_size);
1324 if (maybe_expand_insn (code, nops, ops))
1326 volatile_ok = save_volatile_ok;
1332 volatile_ok = save_volatile_ok;
1336 /* A subroutine of emit_block_move. Expand a call to memcpy.
1337 Return the return value from memcpy, 0 otherwise. */
1340 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1342 rtx dst_addr, src_addr;
1343 tree call_expr, fn, src_tree, dst_tree, size_tree;
1344 enum machine_mode size_mode;
1347 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1348 pseudos. We can then place those new pseudos into a VAR_DECL and
1351 dst_addr = copy_addr_to_reg (XEXP (dst, 0));
1352 src_addr = copy_addr_to_reg (XEXP (src, 0));
1354 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1355 src_addr = convert_memory_address (ptr_mode, src_addr);
1357 dst_tree = make_tree (ptr_type_node, dst_addr);
1358 src_tree = make_tree (ptr_type_node, src_addr);
1360 size_mode = TYPE_MODE (sizetype);
1362 size = convert_to_mode (size_mode, size, 1);
1363 size = copy_to_mode_reg (size_mode, size);
1365 /* It is incorrect to use the libcall calling conventions to call
1366 memcpy in this context. This could be a user call to memcpy and
1367 the user may wish to examine the return value from memcpy. For
1368 targets where libcalls and normal calls have different conventions
1369 for returning pointers, we could end up generating incorrect code. */
1371 size_tree = make_tree (sizetype, size);
1373 fn = emit_block_move_libcall_fn (true);
1374 call_expr = build_call_expr (fn, 3, dst_tree, src_tree, size_tree);
1375 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1377 retval = expand_normal (call_expr);
1382 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1383 for the function we use for block copies. */
1385 static GTY(()) tree block_move_fn;
1388 init_block_move_fn (const char *asmspec)
1392 tree args, fn, attrs, attr_args;
1394 fn = get_identifier ("memcpy");
1395 args = build_function_type_list (ptr_type_node, ptr_type_node,
1396 const_ptr_type_node, sizetype,
1399 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
1400 DECL_EXTERNAL (fn) = 1;
1401 TREE_PUBLIC (fn) = 1;
1402 DECL_ARTIFICIAL (fn) = 1;
1403 TREE_NOTHROW (fn) = 1;
1404 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
1405 DECL_VISIBILITY_SPECIFIED (fn) = 1;
1407 attr_args = build_tree_list (NULL_TREE, build_string (1, "1"));
1408 attrs = tree_cons (get_identifier ("fn spec"), attr_args, NULL);
1410 decl_attributes (&fn, attrs, ATTR_FLAG_BUILT_IN);
1416 set_user_assembler_name (block_move_fn, asmspec);
1420 emit_block_move_libcall_fn (int for_call)
1422 static bool emitted_extern;
1425 init_block_move_fn (NULL);
1427 if (for_call && !emitted_extern)
1429 emitted_extern = true;
1430 make_decl_rtl (block_move_fn);
1433 return block_move_fn;
1436 /* A subroutine of emit_block_move. Copy the data via an explicit
1437 loop. This is used only when libcalls are forbidden. */
1438 /* ??? It'd be nice to copy in hunks larger than QImode. */
1441 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1442 unsigned int align ATTRIBUTE_UNUSED)
1444 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1445 enum machine_mode x_addr_mode = get_address_mode (x);
1446 enum machine_mode y_addr_mode = get_address_mode (y);
1447 enum machine_mode iter_mode;
1449 iter_mode = GET_MODE (size);
1450 if (iter_mode == VOIDmode)
1451 iter_mode = word_mode;
1453 top_label = gen_label_rtx ();
1454 cmp_label = gen_label_rtx ();
1455 iter = gen_reg_rtx (iter_mode);
1457 emit_move_insn (iter, const0_rtx);
1459 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1460 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1461 do_pending_stack_adjust ();
1463 emit_jump (cmp_label);
1464 emit_label (top_label);
1466 tmp = convert_modes (x_addr_mode, iter_mode, iter, true);
1467 x_addr = gen_rtx_PLUS (x_addr_mode, x_addr, tmp);
1469 if (x_addr_mode != y_addr_mode)
1470 tmp = convert_modes (y_addr_mode, iter_mode, iter, true);
1471 y_addr = gen_rtx_PLUS (y_addr_mode, y_addr, tmp);
1473 x = change_address (x, QImode, x_addr);
1474 y = change_address (y, QImode, y_addr);
1476 emit_move_insn (x, y);
1478 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1479 true, OPTAB_LIB_WIDEN);
1481 emit_move_insn (iter, tmp);
1483 emit_label (cmp_label);
1485 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1486 true, top_label, REG_BR_PROB_BASE * 90 / 100);
1489 /* Copy all or part of a value X into registers starting at REGNO.
1490 The number of registers to be filled is NREGS. */
1493 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1496 #ifdef HAVE_load_multiple
1504 if (CONSTANT_P (x) && !targetm.legitimate_constant_p (mode, x))
1505 x = validize_mem (force_const_mem (mode, x));
1507 /* See if the machine can do this with a load multiple insn. */
1508 #ifdef HAVE_load_multiple
1509 if (HAVE_load_multiple)
1511 last = get_last_insn ();
1512 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1520 delete_insns_since (last);
1524 for (i = 0; i < nregs; i++)
1525 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1526 operand_subword_force (x, i, mode));
1529 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1530 The number of registers to be filled is NREGS. */
1533 move_block_from_reg (int regno, rtx x, int nregs)
1540 /* See if the machine can do this with a store multiple insn. */
1541 #ifdef HAVE_store_multiple
1542 if (HAVE_store_multiple)
1544 rtx last = get_last_insn ();
1545 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1553 delete_insns_since (last);
1557 for (i = 0; i < nregs; i++)
1559 rtx tem = operand_subword (x, i, 1, BLKmode);
1563 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1567 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1568 ORIG, where ORIG is a non-consecutive group of registers represented by
1569 a PARALLEL. The clone is identical to the original except in that the
1570 original set of registers is replaced by a new set of pseudo registers.
1571 The new set has the same modes as the original set. */
1574 gen_group_rtx (rtx orig)
1579 gcc_assert (GET_CODE (orig) == PARALLEL);
1581 length = XVECLEN (orig, 0);
1582 tmps = XALLOCAVEC (rtx, length);
1584 /* Skip a NULL entry in first slot. */
1585 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1590 for (; i < length; i++)
1592 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1593 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1595 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1598 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1601 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1602 except that values are placed in TMPS[i], and must later be moved
1603 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1606 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1610 enum machine_mode m = GET_MODE (orig_src);
1612 gcc_assert (GET_CODE (dst) == PARALLEL);
1615 && !SCALAR_INT_MODE_P (m)
1616 && !MEM_P (orig_src)
1617 && GET_CODE (orig_src) != CONCAT)
1619 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1620 if (imode == BLKmode)
1621 src = assign_stack_temp (GET_MODE (orig_src), ssize);
1623 src = gen_reg_rtx (imode);
1624 if (imode != BLKmode)
1625 src = gen_lowpart (GET_MODE (orig_src), src);
1626 emit_move_insn (src, orig_src);
1627 /* ...and back again. */
1628 if (imode != BLKmode)
1629 src = gen_lowpart (imode, src);
1630 emit_group_load_1 (tmps, dst, src, type, ssize);
1634 /* Check for a NULL entry, used to indicate that the parameter goes
1635 both on the stack and in registers. */
1636 if (XEXP (XVECEXP (dst, 0, 0), 0))
1641 /* Process the pieces. */
1642 for (i = start; i < XVECLEN (dst, 0); i++)
1644 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1645 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1646 unsigned int bytelen = GET_MODE_SIZE (mode);
1649 /* Handle trailing fragments that run over the size of the struct. */
1650 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1652 /* Arrange to shift the fragment to where it belongs.
1653 extract_bit_field loads to the lsb of the reg. */
1655 #ifdef BLOCK_REG_PADDING
1656 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1657 == (BYTES_BIG_ENDIAN ? upward : downward)
1662 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1663 bytelen = ssize - bytepos;
1664 gcc_assert (bytelen > 0);
1667 /* If we won't be loading directly from memory, protect the real source
1668 from strange tricks we might play; but make sure that the source can
1669 be loaded directly into the destination. */
1671 if (!MEM_P (orig_src)
1672 && (!CONSTANT_P (orig_src)
1673 || (GET_MODE (orig_src) != mode
1674 && GET_MODE (orig_src) != VOIDmode)))
1676 if (GET_MODE (orig_src) == VOIDmode)
1677 src = gen_reg_rtx (mode);
1679 src = gen_reg_rtx (GET_MODE (orig_src));
1681 emit_move_insn (src, orig_src);
1684 /* Optimize the access just a bit. */
1686 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1687 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1688 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1689 && bytelen == GET_MODE_SIZE (mode))
1691 tmps[i] = gen_reg_rtx (mode);
1692 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1694 else if (COMPLEX_MODE_P (mode)
1695 && GET_MODE (src) == mode
1696 && bytelen == GET_MODE_SIZE (mode))
1697 /* Let emit_move_complex do the bulk of the work. */
1699 else if (GET_CODE (src) == CONCAT)
1701 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1702 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1704 if ((bytepos == 0 && bytelen == slen0)
1705 || (bytepos != 0 && bytepos + bytelen <= slen))
1707 /* The following assumes that the concatenated objects all
1708 have the same size. In this case, a simple calculation
1709 can be used to determine the object and the bit field
1711 tmps[i] = XEXP (src, bytepos / slen0);
1712 if (! CONSTANT_P (tmps[i])
1713 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1714 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1715 (bytepos % slen0) * BITS_PER_UNIT,
1716 1, false, NULL_RTX, mode, mode);
1722 gcc_assert (!bytepos);
1723 mem = assign_stack_temp (GET_MODE (src), slen);
1724 emit_move_insn (mem, src);
1725 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1726 0, 1, false, NULL_RTX, mode, mode);
1729 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1730 SIMD register, which is currently broken. While we get GCC
1731 to emit proper RTL for these cases, let's dump to memory. */
1732 else if (VECTOR_MODE_P (GET_MODE (dst))
1735 int slen = GET_MODE_SIZE (GET_MODE (src));
1738 mem = assign_stack_temp (GET_MODE (src), slen);
1739 emit_move_insn (mem, src);
1740 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1742 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1743 && XVECLEN (dst, 0) > 1)
1744 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1745 else if (CONSTANT_P (src))
1747 HOST_WIDE_INT len = (HOST_WIDE_INT) bytelen;
1755 gcc_assert (2 * len == ssize);
1756 split_double (src, &first, &second);
1763 else if (REG_P (src) && GET_MODE (src) == mode)
1766 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1767 bytepos * BITS_PER_UNIT, 1, false, NULL_RTX,
1771 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1776 /* Emit code to move a block SRC of type TYPE to a block DST,
1777 where DST is non-consecutive registers represented by a PARALLEL.
1778 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1782 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1787 tmps = XALLOCAVEC (rtx, XVECLEN (dst, 0));
1788 emit_group_load_1 (tmps, dst, src, type, ssize);
1790 /* Copy the extracted pieces into the proper (probable) hard regs. */
1791 for (i = 0; i < XVECLEN (dst, 0); i++)
1793 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1796 emit_move_insn (d, tmps[i]);
1800 /* Similar, but load SRC into new pseudos in a format that looks like
1801 PARALLEL. This can later be fed to emit_group_move to get things
1802 in the right place. */
1805 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1810 vec = rtvec_alloc (XVECLEN (parallel, 0));
1811 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1813 /* Convert the vector to look just like the original PARALLEL, except
1814 with the computed values. */
1815 for (i = 0; i < XVECLEN (parallel, 0); i++)
1817 rtx e = XVECEXP (parallel, 0, i);
1818 rtx d = XEXP (e, 0);
1822 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1823 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1825 RTVEC_ELT (vec, i) = e;
1828 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1831 /* Emit code to move a block SRC to block DST, where SRC and DST are
1832 non-consecutive groups of registers, each represented by a PARALLEL. */
1835 emit_group_move (rtx dst, rtx src)
1839 gcc_assert (GET_CODE (src) == PARALLEL
1840 && GET_CODE (dst) == PARALLEL
1841 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1843 /* Skip first entry if NULL. */
1844 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1845 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1846 XEXP (XVECEXP (src, 0, i), 0));
1849 /* Move a group of registers represented by a PARALLEL into pseudos. */
1852 emit_group_move_into_temps (rtx src)
1854 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1857 for (i = 0; i < XVECLEN (src, 0); i++)
1859 rtx e = XVECEXP (src, 0, i);
1860 rtx d = XEXP (e, 0);
1863 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1864 RTVEC_ELT (vec, i) = e;
1867 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1870 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1871 where SRC is non-consecutive registers represented by a PARALLEL.
1872 SSIZE represents the total size of block ORIG_DST, or -1 if not
1876 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1879 int start, finish, i;
1880 enum machine_mode m = GET_MODE (orig_dst);
1882 gcc_assert (GET_CODE (src) == PARALLEL);
1884 if (!SCALAR_INT_MODE_P (m)
1885 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1887 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1888 if (imode == BLKmode)
1889 dst = assign_stack_temp (GET_MODE (orig_dst), ssize);
1891 dst = gen_reg_rtx (imode);
1892 emit_group_store (dst, src, type, ssize);
1893 if (imode != BLKmode)
1894 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1895 emit_move_insn (orig_dst, dst);
1899 /* Check for a NULL entry, used to indicate that the parameter goes
1900 both on the stack and in registers. */
1901 if (XEXP (XVECEXP (src, 0, 0), 0))
1905 finish = XVECLEN (src, 0);
1907 tmps = XALLOCAVEC (rtx, finish);
1909 /* Copy the (probable) hard regs into pseudos. */
1910 for (i = start; i < finish; i++)
1912 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1913 if (!REG_P (reg) || REGNO (reg) < FIRST_PSEUDO_REGISTER)
1915 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1916 emit_move_insn (tmps[i], reg);
1922 /* If we won't be storing directly into memory, protect the real destination
1923 from strange tricks we might play. */
1925 if (GET_CODE (dst) == PARALLEL)
1929 /* We can get a PARALLEL dst if there is a conditional expression in
1930 a return statement. In that case, the dst and src are the same,
1931 so no action is necessary. */
1932 if (rtx_equal_p (dst, src))
1935 /* It is unclear if we can ever reach here, but we may as well handle
1936 it. Allocate a temporary, and split this into a store/load to/from
1939 temp = assign_stack_temp (GET_MODE (dst), ssize);
1940 emit_group_store (temp, src, type, ssize);
1941 emit_group_load (dst, temp, type, ssize);
1944 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1946 enum machine_mode outer = GET_MODE (dst);
1947 enum machine_mode inner;
1948 HOST_WIDE_INT bytepos;
1952 if (!REG_P (dst) || REGNO (dst) < FIRST_PSEUDO_REGISTER)
1953 dst = gen_reg_rtx (outer);
1955 /* Make life a bit easier for combine. */
1956 /* If the first element of the vector is the low part
1957 of the destination mode, use a paradoxical subreg to
1958 initialize the destination. */
1961 inner = GET_MODE (tmps[start]);
1962 bytepos = subreg_lowpart_offset (inner, outer);
1963 if (INTVAL (XEXP (XVECEXP (src, 0, start), 1)) == bytepos)
1965 temp = simplify_gen_subreg (outer, tmps[start],
1969 emit_move_insn (dst, temp);
1976 /* If the first element wasn't the low part, try the last. */
1978 && start < finish - 1)
1980 inner = GET_MODE (tmps[finish - 1]);
1981 bytepos = subreg_lowpart_offset (inner, outer);
1982 if (INTVAL (XEXP (XVECEXP (src, 0, finish - 1), 1)) == bytepos)
1984 temp = simplify_gen_subreg (outer, tmps[finish - 1],
1988 emit_move_insn (dst, temp);
1995 /* Otherwise, simply initialize the result to zero. */
1997 emit_move_insn (dst, CONST0_RTX (outer));
2000 /* Process the pieces. */
2001 for (i = start; i < finish; i++)
2003 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2004 enum machine_mode mode = GET_MODE (tmps[i]);
2005 unsigned int bytelen = GET_MODE_SIZE (mode);
2006 unsigned int adj_bytelen = bytelen;
2009 /* Handle trailing fragments that run over the size of the struct. */
2010 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2011 adj_bytelen = ssize - bytepos;
2013 if (GET_CODE (dst) == CONCAT)
2015 if (bytepos + adj_bytelen
2016 <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2017 dest = XEXP (dst, 0);
2018 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2020 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2021 dest = XEXP (dst, 1);
2025 enum machine_mode dest_mode = GET_MODE (dest);
2026 enum machine_mode tmp_mode = GET_MODE (tmps[i]);
2028 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
2030 if (GET_MODE_ALIGNMENT (dest_mode)
2031 >= GET_MODE_ALIGNMENT (tmp_mode))
2033 dest = assign_stack_temp (dest_mode,
2034 GET_MODE_SIZE (dest_mode));
2035 emit_move_insn (adjust_address (dest,
2043 dest = assign_stack_temp (tmp_mode,
2044 GET_MODE_SIZE (tmp_mode));
2045 emit_move_insn (dest, tmps[i]);
2046 dst = adjust_address (dest, dest_mode, bytepos);
2052 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2054 /* store_bit_field always takes its value from the lsb.
2055 Move the fragment to the lsb if it's not already there. */
2057 #ifdef BLOCK_REG_PADDING
2058 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
2059 == (BYTES_BIG_ENDIAN ? upward : downward)
2065 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2066 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
2069 bytelen = adj_bytelen;
2072 /* Optimize the access just a bit. */
2074 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
2075 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
2076 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2077 && bytelen == GET_MODE_SIZE (mode))
2078 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2080 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2081 0, 0, mode, tmps[i]);
2084 /* Copy from the pseudo into the (probable) hard reg. */
2085 if (orig_dst != dst)
2086 emit_move_insn (orig_dst, dst);
2089 /* Copy a BLKmode object of TYPE out of a register SRCREG into TARGET.
2091 This is used on targets that return BLKmode values in registers. */
2094 copy_blkmode_from_reg (rtx target, rtx srcreg, tree type)
2096 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2097 rtx src = NULL, dst = NULL;
2098 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2099 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
2100 enum machine_mode mode = GET_MODE (srcreg);
2101 enum machine_mode tmode = GET_MODE (target);
2102 enum machine_mode copy_mode;
2104 /* BLKmode registers created in the back-end shouldn't have survived. */
2105 gcc_assert (mode != BLKmode);
2107 /* If the structure doesn't take up a whole number of words, see whether
2108 SRCREG is padded on the left or on the right. If it's on the left,
2109 set PADDING_CORRECTION to the number of bits to skip.
2111 In most ABIs, the structure will be returned at the least end of
2112 the register, which translates to right padding on little-endian
2113 targets and left padding on big-endian targets. The opposite
2114 holds if the structure is returned at the most significant
2115 end of the register. */
2116 if (bytes % UNITS_PER_WORD != 0
2117 && (targetm.calls.return_in_msb (type)
2119 : BYTES_BIG_ENDIAN))
2121 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2123 /* We can use a single move if we have an exact mode for the size. */
2124 else if (MEM_P (target)
2125 && (!SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target))
2126 || MEM_ALIGN (target) >= GET_MODE_ALIGNMENT (mode))
2127 && bytes == GET_MODE_SIZE (mode))
2129 emit_move_insn (adjust_address (target, mode, 0), srcreg);
2133 /* And if we additionally have the same mode for a register. */
2134 else if (REG_P (target)
2135 && GET_MODE (target) == mode
2136 && bytes == GET_MODE_SIZE (mode))
2138 emit_move_insn (target, srcreg);
2142 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2143 into a new pseudo which is a full word. */
2144 if (GET_MODE_SIZE (mode) < UNITS_PER_WORD)
2146 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
2150 /* Copy the structure BITSIZE bits at a time. If the target lives in
2151 memory, take care of not reading/writing past its end by selecting
2152 a copy mode suited to BITSIZE. This should always be possible given
2155 If the target lives in register, make sure not to select a copy mode
2156 larger than the mode of the register.
2158 We could probably emit more efficient code for machines which do not use
2159 strict alignment, but it doesn't seem worth the effort at the current
2162 copy_mode = word_mode;
2165 enum machine_mode mem_mode = mode_for_size (bitsize, MODE_INT, 1);
2166 if (mem_mode != BLKmode)
2167 copy_mode = mem_mode;
2169 else if (REG_P (target) && GET_MODE_BITSIZE (tmode) < BITS_PER_WORD)
2172 for (bitpos = 0, xbitpos = padding_correction;
2173 bitpos < bytes * BITS_PER_UNIT;
2174 bitpos += bitsize, xbitpos += bitsize)
2176 /* We need a new source operand each time xbitpos is on a
2177 word boundary and when xbitpos == padding_correction
2178 (the first time through). */
2179 if (xbitpos % BITS_PER_WORD == 0 || xbitpos == padding_correction)
2180 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD, mode);
2182 /* We need a new destination operand each time bitpos is on
2184 if (REG_P (target) && GET_MODE_BITSIZE (tmode) < BITS_PER_WORD)
2186 else if (bitpos % BITS_PER_WORD == 0)
2187 dst = operand_subword (target, bitpos / BITS_PER_WORD, 1, tmode);
2189 /* Use xbitpos for the source extraction (right justified) and
2190 bitpos for the destination store (left justified). */
2191 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, 0, 0, copy_mode,
2192 extract_bit_field (src, bitsize,
2193 xbitpos % BITS_PER_WORD, 1, false,
2194 NULL_RTX, copy_mode, copy_mode));
2198 /* Copy BLKmode value SRC into a register of mode MODE. Return the
2199 register if it contains any data, otherwise return null.
2201 This is used on targets that return BLKmode values in registers. */
2204 copy_blkmode_to_reg (enum machine_mode mode, tree src)
2207 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0, bytes;
2208 unsigned int bitsize;
2209 rtx *dst_words, dst, x, src_word = NULL_RTX, dst_word = NULL_RTX;
2210 enum machine_mode dst_mode;
2212 gcc_assert (TYPE_MODE (TREE_TYPE (src)) == BLKmode);
2214 x = expand_normal (src);
2216 bytes = int_size_in_bytes (TREE_TYPE (src));
2220 /* If the structure doesn't take up a whole number of words, see
2221 whether the register value should be padded on the left or on
2222 the right. Set PADDING_CORRECTION to the number of padding
2223 bits needed on the left side.
2225 In most ABIs, the structure will be returned at the least end of
2226 the register, which translates to right padding on little-endian
2227 targets and left padding on big-endian targets. The opposite
2228 holds if the structure is returned at the most significant
2229 end of the register. */
2230 if (bytes % UNITS_PER_WORD != 0
2231 && (targetm.calls.return_in_msb (TREE_TYPE (src))
2233 : BYTES_BIG_ENDIAN))
2234 padding_correction = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD)
2237 n_regs = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD;
2238 dst_words = XALLOCAVEC (rtx, n_regs);
2239 bitsize = MIN (TYPE_ALIGN (TREE_TYPE (src)), BITS_PER_WORD);
2241 /* Copy the structure BITSIZE bits at a time. */
2242 for (bitpos = 0, xbitpos = padding_correction;
2243 bitpos < bytes * BITS_PER_UNIT;
2244 bitpos += bitsize, xbitpos += bitsize)
2246 /* We need a new destination pseudo each time xbitpos is
2247 on a word boundary and when xbitpos == padding_correction
2248 (the first time through). */
2249 if (xbitpos % BITS_PER_WORD == 0
2250 || xbitpos == padding_correction)
2252 /* Generate an appropriate register. */
2253 dst_word = gen_reg_rtx (word_mode);
2254 dst_words[xbitpos / BITS_PER_WORD] = dst_word;
2256 /* Clear the destination before we move anything into it. */
2257 emit_move_insn (dst_word, CONST0_RTX (word_mode));
2260 /* We need a new source operand each time bitpos is on a word
2262 if (bitpos % BITS_PER_WORD == 0)
2263 src_word = operand_subword_force (x, bitpos / BITS_PER_WORD, BLKmode);
2265 /* Use bitpos for the source extraction (left justified) and
2266 xbitpos for the destination store (right justified). */
2267 store_bit_field (dst_word, bitsize, xbitpos % BITS_PER_WORD,
2269 extract_bit_field (src_word, bitsize,
2270 bitpos % BITS_PER_WORD, 1, false,
2271 NULL_RTX, word_mode, word_mode));
2274 if (mode == BLKmode)
2276 /* Find the smallest integer mode large enough to hold the
2277 entire structure. */
2278 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2280 mode = GET_MODE_WIDER_MODE (mode))
2281 /* Have we found a large enough mode? */
2282 if (GET_MODE_SIZE (mode) >= bytes)
2285 /* A suitable mode should have been found. */
2286 gcc_assert (mode != VOIDmode);
2289 if (GET_MODE_SIZE (mode) < GET_MODE_SIZE (word_mode))
2290 dst_mode = word_mode;
2293 dst = gen_reg_rtx (dst_mode);
2295 for (i = 0; i < n_regs; i++)
2296 emit_move_insn (operand_subword (dst, i, 0, dst_mode), dst_words[i]);
2298 if (mode != dst_mode)
2299 dst = gen_lowpart (mode, dst);
2304 /* Add a USE expression for REG to the (possibly empty) list pointed
2305 to by CALL_FUSAGE. REG must denote a hard register. */
2308 use_reg_mode (rtx *call_fusage, rtx reg, enum machine_mode mode)
2310 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2313 = gen_rtx_EXPR_LIST (mode, gen_rtx_USE (VOIDmode, reg), *call_fusage);
2316 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2317 starting at REGNO. All of these registers must be hard registers. */
2320 use_regs (rtx *call_fusage, int regno, int nregs)
2324 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2326 for (i = 0; i < nregs; i++)
2327 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2330 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2331 PARALLEL REGS. This is for calls that pass values in multiple
2332 non-contiguous locations. The Irix 6 ABI has examples of this. */
2335 use_group_regs (rtx *call_fusage, rtx regs)
2339 for (i = 0; i < XVECLEN (regs, 0); i++)
2341 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2343 /* A NULL entry means the parameter goes both on the stack and in
2344 registers. This can also be a MEM for targets that pass values
2345 partially on the stack and partially in registers. */
2346 if (reg != 0 && REG_P (reg))
2347 use_reg (call_fusage, reg);
2351 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2352 assigment and the code of the expresion on the RHS is CODE. Return
2356 get_def_for_expr (tree name, enum tree_code code)
2360 if (TREE_CODE (name) != SSA_NAME)
2363 def_stmt = get_gimple_for_ssa_name (name);
2365 || gimple_assign_rhs_code (def_stmt) != code)
2371 #ifdef HAVE_conditional_move
2372 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2373 assigment and the class of the expresion on the RHS is CLASS. Return
2377 get_def_for_expr_class (tree name, enum tree_code_class tclass)
2381 if (TREE_CODE (name) != SSA_NAME)
2384 def_stmt = get_gimple_for_ssa_name (name);
2386 || TREE_CODE_CLASS (gimple_assign_rhs_code (def_stmt)) != tclass)
2394 /* Determine whether the LEN bytes generated by CONSTFUN can be
2395 stored to memory using several move instructions. CONSTFUNDATA is
2396 a pointer which will be passed as argument in every CONSTFUN call.
2397 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2398 a memset operation and false if it's a copy of a constant string.
2399 Return nonzero if a call to store_by_pieces should succeed. */
2402 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2403 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2404 void *constfundata, unsigned int align, bool memsetp)
2406 unsigned HOST_WIDE_INT l;
2407 unsigned int max_size;
2408 HOST_WIDE_INT offset = 0;
2409 enum machine_mode mode;
2410 enum insn_code icode;
2412 /* cst is set but not used if LEGITIMATE_CONSTANT doesn't use it. */
2413 rtx cst ATTRIBUTE_UNUSED;
2419 ? SET_BY_PIECES_P (len, align)
2420 : STORE_BY_PIECES_P (len, align)))
2423 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2425 /* We would first store what we can in the largest integer mode, then go to
2426 successively smaller modes. */
2429 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2433 max_size = STORE_MAX_PIECES + 1;
2434 while (max_size > 1 && l > 0)
2436 mode = widest_int_mode_for_size (max_size);
2438 if (mode == VOIDmode)
2441 icode = optab_handler (mov_optab, mode);
2442 if (icode != CODE_FOR_nothing
2443 && align >= GET_MODE_ALIGNMENT (mode))
2445 unsigned int size = GET_MODE_SIZE (mode);
2452 cst = (*constfun) (constfundata, offset, mode);
2453 if (!targetm.legitimate_constant_p (mode, cst))
2463 max_size = GET_MODE_SIZE (mode);
2466 /* The code above should have handled everything. */
2473 /* Generate several move instructions to store LEN bytes generated by
2474 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2475 pointer which will be passed as argument in every CONSTFUN call.
2476 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2477 a memset operation and false if it's a copy of a constant string.
2478 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2479 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2483 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2484 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2485 void *constfundata, unsigned int align, bool memsetp, int endp)
2487 enum machine_mode to_addr_mode = get_address_mode (to);
2488 struct store_by_pieces_d data;
2492 gcc_assert (endp != 2);
2497 ? SET_BY_PIECES_P (len, align)
2498 : STORE_BY_PIECES_P (len, align));
2499 data.constfun = constfun;
2500 data.constfundata = constfundata;
2503 store_by_pieces_1 (&data, align);
2508 gcc_assert (!data.reverse);
2513 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2514 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2516 data.to_addr = copy_to_mode_reg (to_addr_mode,
2517 plus_constant (to_addr_mode,
2521 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2528 to1 = adjust_address (data.to, QImode, data.offset);
2536 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2537 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2540 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2542 struct store_by_pieces_d data;
2547 data.constfun = clear_by_pieces_1;
2548 data.constfundata = NULL;
2551 store_by_pieces_1 (&data, align);
2554 /* Callback routine for clear_by_pieces.
2555 Return const0_rtx unconditionally. */
2558 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2559 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2560 enum machine_mode mode ATTRIBUTE_UNUSED)
2565 /* Subroutine of clear_by_pieces and store_by_pieces.
2566 Generate several move instructions to store LEN bytes of block TO. (A MEM
2567 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2570 store_by_pieces_1 (struct store_by_pieces_d *data ATTRIBUTE_UNUSED,
2571 unsigned int align ATTRIBUTE_UNUSED)
2573 enum machine_mode to_addr_mode = get_address_mode (data->to);
2574 rtx to_addr = XEXP (data->to, 0);
2575 unsigned int max_size = STORE_MAX_PIECES + 1;
2576 enum insn_code icode;
2579 data->to_addr = to_addr;
2581 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2582 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2584 data->explicit_inc_to = 0;
2586 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2588 data->offset = data->len;
2590 /* If storing requires more than two move insns,
2591 copy addresses to registers (to make displacements shorter)
2592 and use post-increment if available. */
2593 if (!data->autinc_to
2594 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2596 /* Determine the main mode we'll be using.
2597 MODE might not be used depending on the definitions of the
2598 USE_* macros below. */
2599 enum machine_mode mode ATTRIBUTE_UNUSED
2600 = widest_int_mode_for_size (max_size);
2602 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2604 data->to_addr = copy_to_mode_reg (to_addr_mode,
2605 plus_constant (to_addr_mode,
2608 data->autinc_to = 1;
2609 data->explicit_inc_to = -1;
2612 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2613 && ! data->autinc_to)
2615 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2616 data->autinc_to = 1;
2617 data->explicit_inc_to = 1;
2620 if ( !data->autinc_to && CONSTANT_P (to_addr))
2621 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2624 align = alignment_for_piecewise_move (STORE_MAX_PIECES, align);
2626 /* First store what we can in the largest integer mode, then go to
2627 successively smaller modes. */
2629 while (max_size > 1 && data->len > 0)
2631 enum machine_mode mode = widest_int_mode_for_size (max_size);
2633 if (mode == VOIDmode)
2636 icode = optab_handler (mov_optab, mode);
2637 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2638 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2640 max_size = GET_MODE_SIZE (mode);
2643 /* The code above should have handled everything. */
2644 gcc_assert (!data->len);
2647 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2648 with move instructions for mode MODE. GENFUN is the gen_... function
2649 to make a move insn for that mode. DATA has all the other info. */
2652 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2653 struct store_by_pieces_d *data)
2655 unsigned int size = GET_MODE_SIZE (mode);
2658 while (data->len >= size)
2661 data->offset -= size;
2663 if (data->autinc_to)
2664 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2667 to1 = adjust_address (data->to, mode, data->offset);
2669 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2670 emit_insn (gen_add2_insn (data->to_addr,
2671 GEN_INT (-(HOST_WIDE_INT) size)));
2673 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2674 emit_insn ((*genfun) (to1, cst));
2676 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2677 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2679 if (! data->reverse)
2680 data->offset += size;
2686 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2687 its length in bytes. */
2690 clear_storage_hints (rtx object, rtx size, enum block_op_methods method,
2691 unsigned int expected_align, HOST_WIDE_INT expected_size)
2693 enum machine_mode mode = GET_MODE (object);
2696 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2698 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2699 just move a zero. Otherwise, do this a piece at a time. */
2701 && CONST_INT_P (size)
2702 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2704 rtx zero = CONST0_RTX (mode);
2707 emit_move_insn (object, zero);
2711 if (COMPLEX_MODE_P (mode))
2713 zero = CONST0_RTX (GET_MODE_INNER (mode));
2716 write_complex_part (object, zero, 0);
2717 write_complex_part (object, zero, 1);
2723 if (size == const0_rtx)
2726 align = MEM_ALIGN (object);
2728 if (CONST_INT_P (size)
2729 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2730 clear_by_pieces (object, INTVAL (size), align);
2731 else if (set_storage_via_setmem (object, size, const0_rtx, align,
2732 expected_align, expected_size))
2734 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object)))
2735 return set_storage_via_libcall (object, size, const0_rtx,
2736 method == BLOCK_OP_TAILCALL);
2744 clear_storage (rtx object, rtx size, enum block_op_methods method)
2746 return clear_storage_hints (object, size, method, 0, -1);
2750 /* A subroutine of clear_storage. Expand a call to memset.
2751 Return the return value of memset, 0 otherwise. */
2754 set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
2756 tree call_expr, fn, object_tree, size_tree, val_tree;
2757 enum machine_mode size_mode;
2760 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2761 place those into new pseudos into a VAR_DECL and use them later. */
2763 object = copy_addr_to_reg (XEXP (object, 0));
2765 size_mode = TYPE_MODE (sizetype);
2766 size = convert_to_mode (size_mode, size, 1);
2767 size = copy_to_mode_reg (size_mode, size);
2769 /* It is incorrect to use the libcall calling conventions to call
2770 memset in this context. This could be a user call to memset and
2771 the user may wish to examine the return value from memset. For
2772 targets where libcalls and normal calls have different conventions
2773 for returning pointers, we could end up generating incorrect code. */
2775 object_tree = make_tree (ptr_type_node, object);
2776 if (!CONST_INT_P (val))
2777 val = convert_to_mode (TYPE_MODE (integer_type_node), val, 1);
2778 size_tree = make_tree (sizetype, size);
2779 val_tree = make_tree (integer_type_node, val);
2781 fn = clear_storage_libcall_fn (true);
2782 call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
2783 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2785 retval = expand_normal (call_expr);
2790 /* A subroutine of set_storage_via_libcall. Create the tree node
2791 for the function we use for block clears. */
2793 tree block_clear_fn;
2796 init_block_clear_fn (const char *asmspec)
2798 if (!block_clear_fn)
2802 fn = get_identifier ("memset");
2803 args = build_function_type_list (ptr_type_node, ptr_type_node,
2804 integer_type_node, sizetype,
2807 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
2808 DECL_EXTERNAL (fn) = 1;
2809 TREE_PUBLIC (fn) = 1;
2810 DECL_ARTIFICIAL (fn) = 1;
2811 TREE_NOTHROW (fn) = 1;
2812 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
2813 DECL_VISIBILITY_SPECIFIED (fn) = 1;
2815 block_clear_fn = fn;
2819 set_user_assembler_name (block_clear_fn, asmspec);
2823 clear_storage_libcall_fn (int for_call)
2825 static bool emitted_extern;
2827 if (!block_clear_fn)
2828 init_block_clear_fn (NULL);
2830 if (for_call && !emitted_extern)
2832 emitted_extern = true;
2833 make_decl_rtl (block_clear_fn);
2836 return block_clear_fn;
2839 /* Expand a setmem pattern; return true if successful. */
2842 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align,
2843 unsigned int expected_align, HOST_WIDE_INT expected_size)
2845 /* Try the most limited insn first, because there's no point
2846 including more than one in the machine description unless
2847 the more limited one has some advantage. */
2849 enum machine_mode mode;
2851 if (expected_align < align)
2852 expected_align = align;
2854 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2855 mode = GET_MODE_WIDER_MODE (mode))
2857 enum insn_code code = direct_optab_handler (setmem_optab, mode);
2859 if (code != CODE_FOR_nothing
2860 /* We don't need MODE to be narrower than
2861 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2862 the mode mask, as it is returned by the macro, it will
2863 definitely be less than the actual mode mask. */
2864 && ((CONST_INT_P (size)
2865 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2866 <= (GET_MODE_MASK (mode) >> 1)))
2867 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD))
2869 struct expand_operand ops[6];
2872 nops = insn_data[(int) code].n_generator_args;
2873 gcc_assert (nops == 4 || nops == 6);
2875 create_fixed_operand (&ops[0], object);
2876 /* The check above guarantees that this size conversion is valid. */
2877 create_convert_operand_to (&ops[1], size, mode, true);
2878 create_convert_operand_from (&ops[2], val, byte_mode, true);
2879 create_integer_operand (&ops[3], align / BITS_PER_UNIT);
2882 create_integer_operand (&ops[4], expected_align / BITS_PER_UNIT);
2883 create_integer_operand (&ops[5], expected_size);
2885 if (maybe_expand_insn (code, nops, ops))
2894 /* Write to one of the components of the complex value CPLX. Write VAL to
2895 the real part if IMAG_P is false, and the imaginary part if its true. */
2898 write_complex_part (rtx cplx, rtx val, bool imag_p)
2900 enum machine_mode cmode;
2901 enum machine_mode imode;
2904 if (GET_CODE (cplx) == CONCAT)
2906 emit_move_insn (XEXP (cplx, imag_p), val);
2910 cmode = GET_MODE (cplx);
2911 imode = GET_MODE_INNER (cmode);
2912 ibitsize = GET_MODE_BITSIZE (imode);
2914 /* For MEMs simplify_gen_subreg may generate an invalid new address
2915 because, e.g., the original address is considered mode-dependent
2916 by the target, which restricts simplify_subreg from invoking
2917 adjust_address_nv. Instead of preparing fallback support for an
2918 invalid address, we call adjust_address_nv directly. */
2921 emit_move_insn (adjust_address_nv (cplx, imode,
2922 imag_p ? GET_MODE_SIZE (imode) : 0),
2927 /* If the sub-object is at least word sized, then we know that subregging
2928 will work. This special case is important, since store_bit_field
2929 wants to operate on integer modes, and there's rarely an OImode to
2930 correspond to TCmode. */
2931 if (ibitsize >= BITS_PER_WORD
2932 /* For hard regs we have exact predicates. Assume we can split
2933 the original object if it spans an even number of hard regs.
2934 This special case is important for SCmode on 64-bit platforms
2935 where the natural size of floating-point regs is 32-bit. */
2937 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2938 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2940 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2941 imag_p ? GET_MODE_SIZE (imode) : 0);
2944 emit_move_insn (part, val);
2948 /* simplify_gen_subreg may fail for sub-word MEMs. */
2949 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2952 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, 0, 0, imode, val);
2955 /* Extract one of the components of the complex value CPLX. Extract the
2956 real part if IMAG_P is false, and the imaginary part if it's true. */
2959 read_complex_part (rtx cplx, bool imag_p)
2961 enum machine_mode cmode, imode;
2964 if (GET_CODE (cplx) == CONCAT)
2965 return XEXP (cplx, imag_p);
2967 cmode = GET_MODE (cplx);
2968 imode = GET_MODE_INNER (cmode);
2969 ibitsize = GET_MODE_BITSIZE (imode);
2971 /* Special case reads from complex constants that got spilled to memory. */
2972 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2974 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2975 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2977 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2978 if (CONSTANT_CLASS_P (part))
2979 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2983 /* For MEMs simplify_gen_subreg may generate an invalid new address
2984 because, e.g., the original address is considered mode-dependent
2985 by the target, which restricts simplify_subreg from invoking
2986 adjust_address_nv. Instead of preparing fallback support for an
2987 invalid address, we call adjust_address_nv directly. */
2989 return adjust_address_nv (cplx, imode,
2990 imag_p ? GET_MODE_SIZE (imode) : 0);
2992 /* If the sub-object is at least word sized, then we know that subregging
2993 will work. This special case is important, since extract_bit_field
2994 wants to operate on integer modes, and there's rarely an OImode to
2995 correspond to TCmode. */
2996 if (ibitsize >= BITS_PER_WORD
2997 /* For hard regs we have exact predicates. Assume we can split
2998 the original object if it spans an even number of hard regs.
2999 This special case is important for SCmode on 64-bit platforms
3000 where the natural size of floating-point regs is 32-bit. */
3002 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
3003 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
3005 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
3006 imag_p ? GET_MODE_SIZE (imode) : 0);
3010 /* simplify_gen_subreg may fail for sub-word MEMs. */
3011 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
3014 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
3015 true, false, NULL_RTX, imode, imode);
3018 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
3019 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
3020 represented in NEW_MODE. If FORCE is true, this will never happen, as
3021 we'll force-create a SUBREG if needed. */
3024 emit_move_change_mode (enum machine_mode new_mode,
3025 enum machine_mode old_mode, rtx x, bool force)
3029 if (push_operand (x, GET_MODE (x)))
3031 ret = gen_rtx_MEM (new_mode, XEXP (x, 0));
3032 MEM_COPY_ATTRIBUTES (ret, x);
3036 /* We don't have to worry about changing the address since the
3037 size in bytes is supposed to be the same. */
3038 if (reload_in_progress)
3040 /* Copy the MEM to change the mode and move any
3041 substitutions from the old MEM to the new one. */
3042 ret = adjust_address_nv (x, new_mode, 0);
3043 copy_replacements (x, ret);
3046 ret = adjust_address (x, new_mode, 0);
3050 /* Note that we do want simplify_subreg's behavior of validating
3051 that the new mode is ok for a hard register. If we were to use
3052 simplify_gen_subreg, we would create the subreg, but would
3053 probably run into the target not being able to implement it. */
3054 /* Except, of course, when FORCE is true, when this is exactly what
3055 we want. Which is needed for CCmodes on some targets. */
3057 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
3059 ret = simplify_subreg (new_mode, x, old_mode, 0);
3065 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
3066 an integer mode of the same size as MODE. Returns the instruction
3067 emitted, or NULL if such a move could not be generated. */
3070 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y, bool force)
3072 enum machine_mode imode;
3073 enum insn_code code;
3075 /* There must exist a mode of the exact size we require. */
3076 imode = int_mode_for_mode (mode);
3077 if (imode == BLKmode)
3080 /* The target must support moves in this mode. */
3081 code = optab_handler (mov_optab, imode);
3082 if (code == CODE_FOR_nothing)
3085 x = emit_move_change_mode (imode, mode, x, force);
3088 y = emit_move_change_mode (imode, mode, y, force);
3091 return emit_insn (GEN_FCN (code) (x, y));
3094 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
3095 Return an equivalent MEM that does not use an auto-increment. */
3098 emit_move_resolve_push (enum machine_mode mode, rtx x)
3100 enum rtx_code code = GET_CODE (XEXP (x, 0));
3101 HOST_WIDE_INT adjust;
3104 adjust = GET_MODE_SIZE (mode);
3105 #ifdef PUSH_ROUNDING
3106 adjust = PUSH_ROUNDING (adjust);
3108 if (code == PRE_DEC || code == POST_DEC)
3110 else if (code == PRE_MODIFY || code == POST_MODIFY)
3112 rtx expr = XEXP (XEXP (x, 0), 1);
3115 gcc_assert (GET_CODE (expr) == PLUS || GET_CODE (expr) == MINUS);
3116 gcc_assert (CONST_INT_P (XEXP (expr, 1)));
3117 val = INTVAL (XEXP (expr, 1));
3118 if (GET_CODE (expr) == MINUS)
3120 gcc_assert (adjust == val || adjust == -val);
3124 /* Do not use anti_adjust_stack, since we don't want to update
3125 stack_pointer_delta. */
3126 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
3127 GEN_INT (adjust), stack_pointer_rtx,
3128 0, OPTAB_LIB_WIDEN);
3129 if (temp != stack_pointer_rtx)
3130 emit_move_insn (stack_pointer_rtx, temp);
3137 temp = stack_pointer_rtx;
3142 temp = plus_constant (Pmode, stack_pointer_rtx, -adjust);
3148 return replace_equiv_address (x, temp);
3151 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3152 X is known to satisfy push_operand, and MODE is known to be complex.
3153 Returns the last instruction emitted. */
3156 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
3158 enum machine_mode submode = GET_MODE_INNER (mode);
3161 #ifdef PUSH_ROUNDING
3162 unsigned int submodesize = GET_MODE_SIZE (submode);
3164 /* In case we output to the stack, but the size is smaller than the
3165 machine can push exactly, we need to use move instructions. */
3166 if (PUSH_ROUNDING (submodesize) != submodesize)
3168 x = emit_move_resolve_push (mode, x);
3169 return emit_move_insn (x, y);
3173 /* Note that the real part always precedes the imag part in memory
3174 regardless of machine's endianness. */
3175 switch (GET_CODE (XEXP (x, 0)))
3189 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3190 read_complex_part (y, imag_first));
3191 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3192 read_complex_part (y, !imag_first));
3195 /* A subroutine of emit_move_complex. Perform the move from Y to X
3196 via two moves of the parts. Returns the last instruction emitted. */
3199 emit_move_complex_parts (rtx x, rtx y)
3201 /* Show the output dies here. This is necessary for SUBREGs
3202 of pseudos since we cannot track their lifetimes correctly;
3203 hard regs shouldn't appear here except as return values. */
3204 if (!reload_completed && !reload_in_progress
3205 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
3208 write_complex_part (x, read_complex_part (y, false), false);
3209 write_complex_part (x, read_complex_part (y, true), true);
3211 return get_last_insn ();
3214 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3215 MODE is known to be complex. Returns the last instruction emitted. */
3218 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
3222 /* Need to take special care for pushes, to maintain proper ordering
3223 of the data, and possibly extra padding. */
3224 if (push_operand (x, mode))
3225 return emit_move_complex_push (mode, x, y);
3227 /* See if we can coerce the target into moving both values at once. */
3229 /* Move floating point as parts. */
3230 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
3231 && optab_handler (mov_optab, GET_MODE_INNER (mode)) != CODE_FOR_nothing)
3233 /* Not possible if the values are inherently not adjacent. */
3234 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
3236 /* Is possible if both are registers (or subregs of registers). */
3237 else if (register_operand (x, mode) && register_operand (y, mode))
3239 /* If one of the operands is a memory, and alignment constraints
3240 are friendly enough, we may be able to do combined memory operations.
3241 We do not attempt this if Y is a constant because that combination is
3242 usually better with the by-parts thing below. */
3243 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
3244 && (!STRICT_ALIGNMENT
3245 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
3254 /* For memory to memory moves, optimal behavior can be had with the
3255 existing block move logic. */
3256 if (MEM_P (x) && MEM_P (y))
3258 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
3259 BLOCK_OP_NO_LIBCALL);
3260 return get_last_insn ();
3263 ret = emit_move_via_integer (mode, x, y, true);
3268 return emit_move_complex_parts (x, y);
3271 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3272 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3275 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
3279 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3282 enum insn_code code = optab_handler (mov_optab, CCmode);
3283 if (code != CODE_FOR_nothing)
3285 x = emit_move_change_mode (CCmode, mode, x, true);
3286 y = emit_move_change_mode (CCmode, mode, y, true);
3287 return emit_insn (GEN_FCN (code) (x, y));
3291 /* Otherwise, find the MODE_INT mode of the same width. */
3292 ret = emit_move_via_integer (mode, x, y, false);
3293 gcc_assert (ret != NULL);
3297 /* Return true if word I of OP lies entirely in the
3298 undefined bits of a paradoxical subreg. */
3301 undefined_operand_subword_p (const_rtx op, int i)
3303 enum machine_mode innermode, innermostmode;
3305 if (GET_CODE (op) != SUBREG)
3307 innermode = GET_MODE (op);
3308 innermostmode = GET_MODE (SUBREG_REG (op));
3309 offset = i * UNITS_PER_WORD + SUBREG_BYTE (op);
3310 /* The SUBREG_BYTE represents offset, as if the value were stored in
3311 memory, except for a paradoxical subreg where we define
3312 SUBREG_BYTE to be 0; undo this exception as in
3314 if (SUBREG_BYTE (op) == 0
3315 && GET_MODE_SIZE (innermostmode) < GET_MODE_SIZE (innermode))
3317 int difference = (GET_MODE_SIZE (innermostmode) - GET_MODE_SIZE (innermode));
3318 if (WORDS_BIG_ENDIAN)
3319 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
3320 if (BYTES_BIG_ENDIAN)
3321 offset += difference % UNITS_PER_WORD;
3323 if (offset >= GET_MODE_SIZE (innermostmode)
3324 || offset <= -GET_MODE_SIZE (word_mode))
3329 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3330 MODE is any multi-word or full-word mode that lacks a move_insn
3331 pattern. Note that you will get better code if you define such
3332 patterns, even if they must turn into multiple assembler instructions. */
3335 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3342 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3344 /* If X is a push on the stack, do the push now and replace
3345 X with a reference to the stack pointer. */
3346 if (push_operand (x, mode))
3347 x = emit_move_resolve_push (mode, x);
3349 /* If we are in reload, see if either operand is a MEM whose address
3350 is scheduled for replacement. */
3351 if (reload_in_progress && MEM_P (x)
3352 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3353 x = replace_equiv_address_nv (x, inner);
3354 if (reload_in_progress && MEM_P (y)
3355 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3356 y = replace_equiv_address_nv (y, inner);
3360 need_clobber = false;
3362 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3365 rtx xpart = operand_subword (x, i, 1, mode);
3368 /* Do not generate code for a move if it would come entirely
3369 from the undefined bits of a paradoxical subreg. */
3370 if (undefined_operand_subword_p (y, i))
3373 ypart = operand_subword (y, i, 1, mode);
3375 /* If we can't get a part of Y, put Y into memory if it is a
3376 constant. Otherwise, force it into a register. Then we must
3377 be able to get a part of Y. */
3378 if (ypart == 0 && CONSTANT_P (y))
3380 y = use_anchored_address (force_const_mem (mode, y));
3381 ypart = operand_subword (y, i, 1, mode);
3383 else if (ypart == 0)
3384 ypart = operand_subword_force (y, i, mode);
3386 gcc_assert (xpart && ypart);
3388 need_clobber |= (GET_CODE (xpart) == SUBREG);
3390 last_insn = emit_move_insn (xpart, ypart);
3396 /* Show the output dies here. This is necessary for SUBREGs
3397 of pseudos since we cannot track their lifetimes correctly;
3398 hard regs shouldn't appear here except as return values.
3399 We never want to emit such a clobber after reload. */
3401 && ! (reload_in_progress || reload_completed)
3402 && need_clobber != 0)
3410 /* Low level part of emit_move_insn.
3411 Called just like emit_move_insn, but assumes X and Y
3412 are basically valid. */
3415 emit_move_insn_1 (rtx x, rtx y)
3417 enum machine_mode mode = GET_MODE (x);
3418 enum insn_code code;
3420 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3422 code = optab_handler (mov_optab, mode);
3423 if (code != CODE_FOR_nothing)
3424 return emit_insn (GEN_FCN (code) (x, y));
3426 /* Expand complex moves by moving real part and imag part. */
3427 if (COMPLEX_MODE_P (mode))
3428 return emit_move_complex (mode, x, y);
3430 if (GET_MODE_CLASS (mode) == MODE_DECIMAL_FLOAT
3431 || ALL_FIXED_POINT_MODE_P (mode))
3433 rtx result = emit_move_via_integer (mode, x, y, true);
3435 /* If we can't find an integer mode, use multi words. */
3439 return emit_move_multi_word (mode, x, y);
3442 if (GET_MODE_CLASS (mode) == MODE_CC)
3443 return emit_move_ccmode (mode, x, y);
3445 /* Try using a move pattern for the corresponding integer mode. This is
3446 only safe when simplify_subreg can convert MODE constants into integer
3447 constants. At present, it can only do this reliably if the value
3448 fits within a HOST_WIDE_INT. */
3449 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3451 rtx ret = emit_move_via_integer (mode, x, y, false);
3456 return emit_move_multi_word (mode, x, y);
3459 /* Generate code to copy Y into X.
3460 Both Y and X must have the same mode, except that
3461 Y can be a constant with VOIDmode.
3462 This mode cannot be BLKmode; use emit_block_move for that.
3464 Return the last instruction emitted. */
3467 emit_move_insn (rtx x, rtx y)
3469 enum machine_mode mode = GET_MODE (x);
3470 rtx y_cst = NULL_RTX;
3473 gcc_assert (mode != BLKmode
3474 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3479 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3480 && (last_insn = compress_float_constant (x, y)))
3485 if (!targetm.legitimate_constant_p (mode, y))
3487 y = force_const_mem (mode, y);
3489 /* If the target's cannot_force_const_mem prevented the spill,
3490 assume that the target's move expanders will also take care
3491 of the non-legitimate constant. */
3495 y = use_anchored_address (y);
3499 /* If X or Y are memory references, verify that their addresses are valid
3502 && (! memory_address_addr_space_p (GET_MODE (x), XEXP (x, 0),
3504 && ! push_operand (x, GET_MODE (x))))
3505 x = validize_mem (x);
3508 && ! memory_address_addr_space_p (GET_MODE (y), XEXP (y, 0),
3509 MEM_ADDR_SPACE (y)))
3510 y = validize_mem (y);
3512 gcc_assert (mode != BLKmode);
3514 last_insn = emit_move_insn_1 (x, y);
3516 if (y_cst && REG_P (x)
3517 && (set = single_set (last_insn)) != NULL_RTX
3518 && SET_DEST (set) == x
3519 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3520 set_unique_reg_note (last_insn, REG_EQUAL, copy_rtx (y_cst));
3525 /* If Y is representable exactly in a narrower mode, and the target can
3526 perform the extension directly from constant or memory, then emit the
3527 move as an extension. */
3530 compress_float_constant (rtx x, rtx y)
3532 enum machine_mode dstmode = GET_MODE (x);
3533 enum machine_mode orig_srcmode = GET_MODE (y);
3534 enum machine_mode srcmode;
3536 int oldcost, newcost;
3537 bool speed = optimize_insn_for_speed_p ();
3539 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3541 if (targetm.legitimate_constant_p (dstmode, y))
3542 oldcost = set_src_cost (y, speed);
3544 oldcost = set_src_cost (force_const_mem (dstmode, y), speed);
3546 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3547 srcmode != orig_srcmode;
3548 srcmode = GET_MODE_WIDER_MODE (srcmode))
3551 rtx trunc_y, last_insn;
3553 /* Skip if the target can't extend this way. */
3554 ic = can_extend_p (dstmode, srcmode, 0);
3555 if (ic == CODE_FOR_nothing)
3558 /* Skip if the narrowed value isn't exact. */
3559 if (! exact_real_truncate (srcmode, &r))
3562 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3564 if (targetm.legitimate_constant_p (srcmode, trunc_y))
3566 /* Skip if the target needs extra instructions to perform
3568 if (!insn_operand_matches (ic, 1, trunc_y))
3570 /* This is valid, but may not be cheaper than the original. */
3571 newcost = set_src_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y),
3573 if (oldcost < newcost)
3576 else if (float_extend_from_mem[dstmode][srcmode])
3578 trunc_y = force_const_mem (srcmode, trunc_y);
3579 /* This is valid, but may not be cheaper than the original. */
3580 newcost = set_src_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y),
3582 if (oldcost < newcost)
3584 trunc_y = validize_mem (trunc_y);
3589 /* For CSE's benefit, force the compressed constant pool entry
3590 into a new pseudo. This constant may be used in different modes,
3591 and if not, combine will put things back together for us. */
3592 trunc_y = force_reg (srcmode, trunc_y);
3593 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3594 last_insn = get_last_insn ();
3597 set_unique_reg_note (last_insn, REG_EQUAL, y);
3605 /* Pushing data onto the stack. */
3607 /* Push a block of length SIZE (perhaps variable)
3608 and return an rtx to address the beginning of the block.
3609 The value may be virtual_outgoing_args_rtx.
3611 EXTRA is the number of bytes of padding to push in addition to SIZE.
3612 BELOW nonzero means this padding comes at low addresses;
3613 otherwise, the padding comes at high addresses. */
3616 push_block (rtx size, int extra, int below)
3620 size = convert_modes (Pmode, ptr_mode, size, 1);
3621 if (CONSTANT_P (size))
3622 anti_adjust_stack (plus_constant (Pmode, size, extra));
3623 else if (REG_P (size) && extra == 0)
3624 anti_adjust_stack (size);
3627 temp = copy_to_mode_reg (Pmode, size);
3629 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3630 temp, 0, OPTAB_LIB_WIDEN);
3631 anti_adjust_stack (temp);
3634 #ifndef STACK_GROWS_DOWNWARD
3640 temp = virtual_outgoing_args_rtx;
3641 if (extra != 0 && below)
3642 temp = plus_constant (Pmode, temp, extra);
3646 if (CONST_INT_P (size))
3647 temp = plus_constant (Pmode, virtual_outgoing_args_rtx,
3648 -INTVAL (size) - (below ? 0 : extra));
3649 else if (extra != 0 && !below)
3650 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3651 negate_rtx (Pmode, plus_constant (Pmode, size,
3654 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3655 negate_rtx (Pmode, size));
3658 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3661 /* A utility routine that returns the base of an auto-inc memory, or NULL. */
3664 mem_autoinc_base (rtx mem)
3668 rtx addr = XEXP (mem, 0);
3669 if (GET_RTX_CLASS (GET_CODE (addr)) == RTX_AUTOINC)
3670 return XEXP (addr, 0);
3675 /* A utility routine used here, in reload, and in try_split. The insns
3676 after PREV up to and including LAST are known to adjust the stack,
3677 with a final value of END_ARGS_SIZE. Iterate backward from LAST
3678 placing notes as appropriate. PREV may be NULL, indicating the
3679 entire insn sequence prior to LAST should be scanned.
3681 The set of allowed stack pointer modifications is small:
3682 (1) One or more auto-inc style memory references (aka pushes),
3683 (2) One or more addition/subtraction with the SP as destination,
3684 (3) A single move insn with the SP as destination,
3685 (4) A call_pop insn,
3686 (5) Noreturn call insns if !ACCUMULATE_OUTGOING_ARGS.
3688 Insns in the sequence that do not modify the SP are ignored,
3689 except for noreturn calls.
3691 The return value is the amount of adjustment that can be trivially
3692 verified, via immediate operand or auto-inc. If the adjustment
3693 cannot be trivially extracted, the return value is INT_MIN. */
3696 find_args_size_adjust (rtx insn)
3701 pat = PATTERN (insn);
3704 /* Look for a call_pop pattern. */
3707 /* We have to allow non-call_pop patterns for the case
3708 of emit_single_push_insn of a TLS address. */
3709 if (GET_CODE (pat) != PARALLEL)
3712 /* All call_pop have a stack pointer adjust in the parallel.
3713 The call itself is always first, and the stack adjust is
3714 usually last, so search from the end. */
3715 for (i = XVECLEN (pat, 0) - 1; i > 0; --i)
3717 set = XVECEXP (pat, 0, i);
3718 if (GET_CODE (set) != SET)
3720 dest = SET_DEST (set);
3721 if (dest == stack_pointer_rtx)
3724 /* We'd better have found the stack pointer adjust. */
3727 /* Fall through to process the extracted SET and DEST
3728 as if it was a standalone insn. */
3730 else if (GET_CODE (pat) == SET)
3732 else if ((set = single_set (insn)) != NULL)
3734 else if (GET_CODE (pat) == PARALLEL)
3736 /* ??? Some older ports use a parallel with a stack adjust
3737 and a store for a PUSH_ROUNDING pattern, rather than a
3738 PRE/POST_MODIFY rtx. Don't force them to update yet... */
3739 /* ??? See h8300 and m68k, pushqi1. */
3740 for (i = XVECLEN (pat, 0) - 1; i >= 0; --i)
3742 set = XVECEXP (pat, 0, i);
3743 if (GET_CODE (set) != SET)
3745 dest = SET_DEST (set);
3746 if (dest == stack_pointer_rtx)
3749 /* We do not expect an auto-inc of the sp in the parallel. */
3750 gcc_checking_assert (mem_autoinc_base (dest) != stack_pointer_rtx);
3751 gcc_checking_assert (mem_autoinc_base (SET_SRC (set))
3752 != stack_pointer_rtx);
3760 dest = SET_DEST (set);
3762 /* Look for direct modifications of the stack pointer. */
3763 if (REG_P (dest) && REGNO (dest) == STACK_POINTER_REGNUM)
3765 /* Look for a trivial adjustment, otherwise assume nothing. */
3766 /* Note that the SPU restore_stack_block pattern refers to
3767 the stack pointer in V4SImode. Consider that non-trivial. */
3768 if (SCALAR_INT_MODE_P (GET_MODE (dest))
3769 && GET_CODE (SET_SRC (set)) == PLUS
3770 && XEXP (SET_SRC (set), 0) == stack_pointer_rtx
3771 && CONST_INT_P (XEXP (SET_SRC (set), 1)))
3772 return INTVAL (XEXP (SET_SRC (set), 1));
3773 /* ??? Reload can generate no-op moves, which will be cleaned
3774 up later. Recognize it and continue searching. */
3775 else if (rtx_equal_p (dest, SET_SRC (set)))
3778 return HOST_WIDE_INT_MIN;
3784 /* Otherwise only think about autoinc patterns. */
3785 if (mem_autoinc_base (dest) == stack_pointer_rtx)
3788 gcc_checking_assert (mem_autoinc_base (SET_SRC (set))
3789 != stack_pointer_rtx);
3791 else if (mem_autoinc_base (SET_SRC (set)) == stack_pointer_rtx)
3792 mem = SET_SRC (set);
3796 addr = XEXP (mem, 0);
3797 switch (GET_CODE (addr))
3801 return GET_MODE_SIZE (GET_MODE (mem));
3804 return -GET_MODE_SIZE (GET_MODE (mem));
3807 addr = XEXP (addr, 1);
3808 gcc_assert (GET_CODE (addr) == PLUS);
3809 gcc_assert (XEXP (addr, 0) == stack_pointer_rtx);
3810 gcc_assert (CONST_INT_P (XEXP (addr, 1)));
3811 return INTVAL (XEXP (addr, 1));
3819 fixup_args_size_notes (rtx prev, rtx last, int end_args_size)
3821 int args_size = end_args_size;
3822 bool saw_unknown = false;
3825 for (insn = last; insn != prev; insn = PREV_INSN (insn))
3827 HOST_WIDE_INT this_delta;
3829 if (!NONDEBUG_INSN_P (insn))
3832 this_delta = find_args_size_adjust (insn);
3833 if (this_delta == 0)
3836 || ACCUMULATE_OUTGOING_ARGS
3837 || find_reg_note (insn, REG_NORETURN, NULL_RTX) == NULL_RTX)
3841 gcc_assert (!saw_unknown);
3842 if (this_delta == HOST_WIDE_INT_MIN)
3845 add_reg_note (insn, REG_ARGS_SIZE, GEN_INT (args_size));
3846 #ifdef STACK_GROWS_DOWNWARD
3847 this_delta = -(unsigned HOST_WIDE_INT) this_delta;
3849 args_size -= this_delta;
3852 return saw_unknown ? INT_MIN : args_size;
3855 #ifdef PUSH_ROUNDING
3856 /* Emit single push insn. */
3859 emit_single_push_insn_1 (enum machine_mode mode, rtx x, tree type)
3862 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3864 enum insn_code icode;
3866 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3867 /* If there is push pattern, use it. Otherwise try old way of throwing
3868 MEM representing push operation to move expander. */
3869 icode = optab_handler (push_optab, mode);
3870 if (icode != CODE_FOR_nothing)
3872 struct expand_operand ops[1];
3874 create_input_operand (&ops[0], x, mode);
3875 if (maybe_expand_insn (icode, 1, ops))
3878 if (GET_MODE_SIZE (mode) == rounded_size)
3879 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3880 /* If we are to pad downward, adjust the stack pointer first and
3881 then store X into the stack location using an offset. This is
3882 because emit_move_insn does not know how to pad; it does not have
3884 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3886 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3887 HOST_WIDE_INT offset;
3889 emit_move_insn (stack_pointer_rtx,
3890 expand_binop (Pmode,
3891 #ifdef STACK_GROWS_DOWNWARD
3897 GEN_INT (rounded_size),
3898 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3900 offset = (HOST_WIDE_INT) padding_size;
3901 #ifdef STACK_GROWS_DOWNWARD
3902 if (STACK_PUSH_CODE == POST_DEC)
3903 /* We have already decremented the stack pointer, so get the
3905 offset += (HOST_WIDE_INT) rounded_size;
3907 if (STACK_PUSH_CODE == POST_INC)
3908 /* We have already incremented the stack pointer, so get the
3910 offset -= (HOST_WIDE_INT) rounded_size;
3912 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3916 #ifdef STACK_GROWS_DOWNWARD
3917 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3918 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3919 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3921 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3922 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3923 GEN_INT (rounded_size));
3925 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3928 dest = gen_rtx_MEM (mode, dest_addr);
3932 set_mem_attributes (dest, type, 1);
3934 if (flag_optimize_sibling_calls)
3935 /* Function incoming arguments may overlap with sibling call
3936 outgoing arguments and we cannot allow reordering of reads
3937 from function arguments with stores to outgoing arguments
3938 of sibling calls. */
3939 set_mem_alias_set (dest, 0);
3941 emit_move_insn (dest, x);
3944 /* Emit and annotate a single push insn. */
3947 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3949 int delta, old_delta = stack_pointer_delta;
3950 rtx prev = get_last_insn ();
3953 emit_single_push_insn_1 (mode, x, type);
3955 last = get_last_insn ();
3957 /* Notice the common case where we emitted exactly one insn. */
3958 if (PREV_INSN (last) == prev)
3960 add_reg_note (last, REG_ARGS_SIZE, GEN_INT (stack_pointer_delta));
3964 delta = fixup_args_size_notes (prev, last, stack_pointer_delta);
3965 gcc_assert (delta == INT_MIN || delta == old_delta);
3969 /* Generate code to push X onto the stack, assuming it has mode MODE and
3971 MODE is redundant except when X is a CONST_INT (since they don't
3973 SIZE is an rtx for the size of data to be copied (in bytes),
3974 needed only if X is BLKmode.
3976 ALIGN (in bits) is maximum alignment we can assume.
3978 If PARTIAL and REG are both nonzero, then copy that many of the first
3979 bytes of X into registers starting with REG, and push the rest of X.
3980 The amount of space pushed is decreased by PARTIAL bytes.
3981 REG must be a hard register in this case.
3982 If REG is zero but PARTIAL is not, take any all others actions for an
3983 argument partially in registers, but do not actually load any
3986 EXTRA is the amount in bytes of extra space to leave next to this arg.
3987 This is ignored if an argument block has already been allocated.
3989 On a machine that lacks real push insns, ARGS_ADDR is the address of
3990 the bottom of the argument block for this call. We use indexing off there
3991 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3992 argument block has not been preallocated.
3994 ARGS_SO_FAR is the size of args previously pushed for this call.
3996 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3997 for arguments passed in registers. If nonzero, it will be the number
3998 of bytes required. */
4001 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
4002 unsigned int align, int partial, rtx reg, int extra,
4003 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
4007 enum direction stack_direction
4008 #ifdef STACK_GROWS_DOWNWARD
4014 /* Decide where to pad the argument: `downward' for below,
4015 `upward' for above, or `none' for don't pad it.
4016 Default is below for small data on big-endian machines; else above. */
4017 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
4019 /* Invert direction if stack is post-decrement.
4021 if (STACK_PUSH_CODE == POST_DEC)
4022 if (where_pad != none)
4023 where_pad = (where_pad == downward ? upward : downward);
4028 || (STRICT_ALIGNMENT && align < GET_MODE_ALIGNMENT (mode)))
4030 /* Copy a block into the stack, entirely or partially. */
4037 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
4038 used = partial - offset;
4040 if (mode != BLKmode)
4042 /* A value is to be stored in an insufficiently aligned
4043 stack slot; copy via a suitably aligned slot if
4045 size = GEN_INT (GET_MODE_SIZE (mode));
4046 if (!MEM_P (xinner))
4048 temp = assign_temp (type, 1, 1);
4049 emit_move_insn (temp, xinner);
4056 /* USED is now the # of bytes we need not copy to the stack
4057 because registers will take care of them. */
4060 xinner = adjust_address (xinner, BLKmode, used);
4062 /* If the partial register-part of the arg counts in its stack size,
4063 skip the part of stack space corresponding to the registers.
4064 Otherwise, start copying to the beginning of the stack space,
4065 by setting SKIP to 0. */
4066 skip = (reg_parm_stack_space == 0) ? 0 : used;
4068 #ifdef PUSH_ROUNDING
4069 /* Do it with several push insns if that doesn't take lots of insns
4070 and if there is no difficulty with push insns that skip bytes
4071 on the stack for alignment purposes. */
4074 && CONST_INT_P (size)
4076 && MEM_ALIGN (xinner) >= align
4077 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
4078 /* Here we avoid the case of a structure whose weak alignment
4079 forces many pushes of a small amount of data,
4080 and such small pushes do rounding that causes trouble. */
4081 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
4082 || align >= BIGGEST_ALIGNMENT
4083 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
4084 == (align / BITS_PER_UNIT)))
4085 && (HOST_WIDE_INT) PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
4087 /* Push padding now if padding above and stack grows down,
4088 or if padding below and stack grows up.
4089 But if space already allocated, this has already been done. */
4090 if (extra && args_addr == 0
4091 && where_pad != none && where_pad != stack_direction)
4092 anti_adjust_stack (GEN_INT (extra));
4094 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
4097 #endif /* PUSH_ROUNDING */
4101 /* Otherwise make space on the stack and copy the data
4102 to the address of that space. */
4104 /* Deduct words put into registers from the size we must copy. */
4107 if (CONST_INT_P (size))
4108 size = GEN_INT (INTVAL (size) - used);
4110 size = expand_binop (GET_MODE (size), sub_optab, size,
4111 GEN_INT (used), NULL_RTX, 0,
4115 /* Get the address of the stack space.
4116 In this case, we do not deal with EXTRA separately.
4117 A single stack adjust will do. */
4120 temp = push_block (size, extra, where_pad == downward);
4123 else if (CONST_INT_P (args_so_far))
4124 temp = memory_address (BLKmode,
4125 plus_constant (Pmode, args_addr,
4126 skip + INTVAL (args_so_far)));
4128 temp = memory_address (BLKmode,
4129 plus_constant (Pmode,
4130 gen_rtx_PLUS (Pmode,
4135 if (!ACCUMULATE_OUTGOING_ARGS)
4137 /* If the source is referenced relative to the stack pointer,
4138 copy it to another register to stabilize it. We do not need
4139 to do this if we know that we won't be changing sp. */
4141 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
4142 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
4143 temp = copy_to_reg (temp);
4146 target = gen_rtx_MEM (BLKmode, temp);
4148 /* We do *not* set_mem_attributes here, because incoming arguments
4149 may overlap with sibling call outgoing arguments and we cannot
4150 allow reordering of reads from function arguments with stores
4151 to outgoing arguments of sibling calls. We do, however, want
4152 to record the alignment of the stack slot. */
4153 /* ALIGN may well be better aligned than TYPE, e.g. due to
4154 PARM_BOUNDARY. Assume the caller isn't lying. */
4155 set_mem_align (target, align);
4157 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
4160 else if (partial > 0)
4162 /* Scalar partly in registers. */
4164 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
4167 /* # bytes of start of argument
4168 that we must make space for but need not store. */
4169 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
4170 int args_offset = INTVAL (args_so_far);
4173 /* Push padding now if padding above and stack grows down,
4174 or if padding below and stack grows up.
4175 But if space already allocated, this has already been done. */
4176 if (extra && args_addr == 0
4177 && where_pad != none && where_pad != stack_direction)
4178 anti_adjust_stack (GEN_INT (extra));
4180 /* If we make space by pushing it, we might as well push
4181 the real data. Otherwise, we can leave OFFSET nonzero
4182 and leave the space uninitialized. */
4186 /* Now NOT_STACK gets the number of words that we don't need to
4187 allocate on the stack. Convert OFFSET to words too. */
4188 not_stack = (partial - offset) / UNITS_PER_WORD;
4189 offset /= UNITS_PER_WORD;
4191 /* If the partial register-part of the arg counts in its stack size,
4192 skip the part of stack space corresponding to the registers.
4193 Otherwise, start copying to the beginning of the stack space,
4194 by setting SKIP to 0. */
4195 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
4197 if (CONSTANT_P (x) && !targetm.legitimate_constant_p (mode, x))
4198 x = validize_mem (force_const_mem (mode, x));
4200 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
4201 SUBREGs of such registers are not allowed. */
4202 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
4203 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
4204 x = copy_to_reg (x);
4206 /* Loop over all the words allocated on the stack for this arg. */
4207 /* We can do it by words, because any scalar bigger than a word
4208 has a size a multiple of a word. */
4209 #ifndef PUSH_ARGS_REVERSED
4210 for (i = not_stack; i < size; i++)
4212 for (i = size - 1; i >= not_stack; i--)
4214 if (i >= not_stack + offset)
4215 emit_push_insn (operand_subword_force (x, i, mode),
4216 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
4218 GEN_INT (args_offset + ((i - not_stack + skip)
4220 reg_parm_stack_space, alignment_pad);
4227 /* Push padding now if padding above and stack grows down,
4228 or if padding below and stack grows up.
4229 But if space already allocated, this has already been done. */
4230 if (extra && args_addr == 0
4231 && where_pad != none && where_pad != stack_direction)
4232 anti_adjust_stack (GEN_INT (extra));
4234 #ifdef PUSH_ROUNDING
4235 if (args_addr == 0 && PUSH_ARGS)
4236 emit_single_push_insn (mode, x, type);
4240 if (CONST_INT_P (args_so_far))
4242 = memory_address (mode,
4243 plus_constant (Pmode, args_addr,
4244 INTVAL (args_so_far)));
4246 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
4248 dest = gen_rtx_MEM (mode, addr);
4250 /* We do *not* set_mem_attributes here, because incoming arguments
4251 may overlap with sibling call outgoing arguments and we cannot
4252 allow reordering of reads from function arguments with stores
4253 to outgoing arguments of sibling calls. We do, however, want
4254 to record the alignment of the stack slot. */
4255 /* ALIGN may well be better aligned than TYPE, e.g. due to
4256 PARM_BOUNDARY. Assume the caller isn't lying. */
4257 set_mem_align (dest, align);
4259 emit_move_insn (dest, x);
4263 /* If part should go in registers, copy that part
4264 into the appropriate registers. Do this now, at the end,
4265 since mem-to-mem copies above may do function calls. */
4266 if (partial > 0 && reg != 0)
4268 /* Handle calls that pass values in multiple non-contiguous locations.
4269 The Irix 6 ABI has examples of this. */
4270 if (GET_CODE (reg) == PARALLEL)
4271 emit_group_load (reg, x, type, -1);
4274 gcc_assert (partial % UNITS_PER_WORD == 0);
4275 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
4279 if (extra && args_addr == 0 && where_pad == stack_direction)
4280 anti_adjust_stack (GEN_INT (extra));
4282 if (alignment_pad && args_addr == 0)
4283 anti_adjust_stack (alignment_pad);
4286 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4290 get_subtarget (rtx x)
4294 /* Only registers can be subtargets. */
4296 /* Don't use hard regs to avoid extending their life. */
4297 || REGNO (x) < FIRST_PSEUDO_REGISTER
4301 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
4302 FIELD is a bitfield. Returns true if the optimization was successful,
4303 and there's nothing else to do. */
4306 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
4307 unsigned HOST_WIDE_INT bitpos,
4308 unsigned HOST_WIDE_INT bitregion_start,
4309 unsigned HOST_WIDE_INT bitregion_end,
4310 enum machine_mode mode1, rtx str_rtx,
4313 enum machine_mode str_mode = GET_MODE (str_rtx);
4314 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
4319 enum tree_code code;
4321 if (mode1 != VOIDmode
4322 || bitsize >= BITS_PER_WORD
4323 || str_bitsize > BITS_PER_WORD
4324 || TREE_SIDE_EFFECTS (to)
4325 || TREE_THIS_VOLATILE (to))
4329 if (TREE_CODE (src) != SSA_NAME)
4331 if (TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
4334 srcstmt = get_gimple_for_ssa_name (src);
4336 || TREE_CODE_CLASS (gimple_assign_rhs_code (srcstmt)) != tcc_binary)
4339 code = gimple_assign_rhs_code (srcstmt);
4341 op0 = gimple_assign_rhs1 (srcstmt);
4343 /* If OP0 is an SSA_NAME, then we want to walk the use-def chain
4344 to find its initialization. Hopefully the initialization will
4345 be from a bitfield load. */
4346 if (TREE_CODE (op0) == SSA_NAME)
4348 gimple op0stmt = get_gimple_for_ssa_name (op0);
4350 /* We want to eventually have OP0 be the same as TO, which
4351 should be a bitfield. */
4353 || !is_gimple_assign (op0stmt)
4354 || gimple_assign_rhs_code (op0stmt) != TREE_CODE (to))
4356 op0 = gimple_assign_rhs1 (op0stmt);
4359 op1 = gimple_assign_rhs2 (srcstmt);
4361 if (!operand_equal_p (to, op0, 0))
4364 if (MEM_P (str_rtx))
4366 unsigned HOST_WIDE_INT offset1;
4368 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
4369 str_mode = word_mode;
4370 str_mode = get_best_mode (bitsize, bitpos,
4371 bitregion_start, bitregion_end,
4372 MEM_ALIGN (str_rtx), str_mode, 0);
4373 if (str_mode == VOIDmode)
4375 str_bitsize = GET_MODE_BITSIZE (str_mode);
4378 bitpos %= str_bitsize;
4379 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
4380 str_rtx = adjust_address (str_rtx, str_mode, offset1);
4382 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
4385 /* If the bit field covers the whole REG/MEM, store_field
4386 will likely generate better code. */
4387 if (bitsize >= str_bitsize)
4390 /* We can't handle fields split across multiple entities. */
4391 if (bitpos + bitsize > str_bitsize)
4394 if (BYTES_BIG_ENDIAN)
4395 bitpos = str_bitsize - bitpos - bitsize;
4401 /* For now, just optimize the case of the topmost bitfield
4402 where we don't need to do any masking and also
4403 1 bit bitfields where xor can be used.
4404 We might win by one instruction for the other bitfields
4405 too if insv/extv instructions aren't used, so that
4406 can be added later. */
4407 if (bitpos + bitsize != str_bitsize
4408 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
4411 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4412 value = convert_modes (str_mode,
4413 TYPE_MODE (TREE_TYPE (op1)), value,
4414 TYPE_UNSIGNED (TREE_TYPE (op1)));
4416 /* We may be accessing data outside the field, which means
4417 we can alias adjacent data. */
4418 if (MEM_P (str_rtx))
4420 str_rtx = shallow_copy_rtx (str_rtx);
4421 set_mem_alias_set (str_rtx, 0);
4422 set_mem_expr (str_rtx, 0);
4425 binop = code == PLUS_EXPR ? add_optab : sub_optab;
4426 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
4428 value = expand_and (str_mode, value, const1_rtx, NULL);
4431 value = expand_shift (LSHIFT_EXPR, str_mode, value, bitpos, NULL_RTX, 1);
4432 result = expand_binop (str_mode, binop, str_rtx,
4433 value, str_rtx, 1, OPTAB_WIDEN);
4434 if (result != str_rtx)
4435 emit_move_insn (str_rtx, result);
4440 if (TREE_CODE (op1) != INTEGER_CST)
4442 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4443 value = convert_modes (str_mode,
4444 TYPE_MODE (TREE_TYPE (op1)), value,
4445 TYPE_UNSIGNED (TREE_TYPE (op1)));
4447 /* We may be accessing data outside the field, which means
4448 we can alias adjacent data. */
4449 if (MEM_P (str_rtx))
4451 str_rtx = shallow_copy_rtx (str_rtx);
4452 set_mem_alias_set (str_rtx, 0);
4453 set_mem_expr (str_rtx, 0);
4456 binop = code == BIT_IOR_EXPR ? ior_optab : xor_optab;
4457 if (bitpos + bitsize != str_bitsize)
4459 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize) - 1);
4460 value = expand_and (str_mode, value, mask, NULL_RTX);
4462 value = expand_shift (LSHIFT_EXPR, str_mode, value, bitpos, NULL_RTX, 1);
4463 result = expand_binop (str_mode, binop, str_rtx,
4464 value, str_rtx, 1, OPTAB_WIDEN);
4465 if (result != str_rtx)
4466 emit_move_insn (str_rtx, result);
4476 /* In the C++ memory model, consecutive bit fields in a structure are
4477 considered one memory location.
4479 Given a COMPONENT_REF EXP at position (BITPOS, OFFSET), this function
4480 returns the bit range of consecutive bits in which this COMPONENT_REF
4481 belongs. The values are returned in *BITSTART and *BITEND. *BITPOS
4482 and *OFFSET may be adjusted in the process.
4484 If the access does not need to be restricted, 0 is returned in both
4485 *BITSTART and *BITEND. */
4488 get_bit_range (unsigned HOST_WIDE_INT *bitstart,
4489 unsigned HOST_WIDE_INT *bitend,
4491 HOST_WIDE_INT *bitpos,
4494 HOST_WIDE_INT bitoffset;
4497 gcc_assert (TREE_CODE (exp) == COMPONENT_REF);
4499 field = TREE_OPERAND (exp, 1);
4500 repr = DECL_BIT_FIELD_REPRESENTATIVE (field);
4501 /* If we do not have a DECL_BIT_FIELD_REPRESENTATIVE there is no
4502 need to limit the range we can access. */
4505 *bitstart = *bitend = 0;
4509 /* If we have a DECL_BIT_FIELD_REPRESENTATIVE but the enclosing record is
4510 part of a larger bit field, then the representative does not serve any
4511 useful purpose. This can occur in Ada. */
4512 if (handled_component_p (TREE_OPERAND (exp, 0)))
4514 enum machine_mode rmode;
4515 HOST_WIDE_INT rbitsize, rbitpos;
4519 get_inner_reference (TREE_OPERAND (exp, 0), &rbitsize, &rbitpos,
4520 &roffset, &rmode, &unsignedp, &volatilep, false);
4521 if ((rbitpos % BITS_PER_UNIT) != 0)
4523 *bitstart = *bitend = 0;
4528 /* Compute the adjustment to bitpos from the offset of the field
4529 relative to the representative. DECL_FIELD_OFFSET of field and
4530 repr are the same by construction if they are not constants,
4531 see finish_bitfield_layout. */
4532 if (host_integerp (DECL_FIELD_OFFSET (field), 1)
4533 && host_integerp (DECL_FIELD_OFFSET (repr), 1))
4534 bitoffset = (tree_low_cst (DECL_FIELD_OFFSET (field), 1)
4535 - tree_low_cst (DECL_FIELD_OFFSET (repr), 1)) * BITS_PER_UNIT;
4538 bitoffset += (tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1)
4539 - tree_low_cst (DECL_FIELD_BIT_OFFSET (repr), 1));
4541 /* If the adjustment is larger than bitpos, we would have a negative bit
4542 position for the lower bound and this may wreak havoc later. This can
4543 occur only if we have a non-null offset, so adjust offset and bitpos
4544 to make the lower bound non-negative. */
4545 if (bitoffset > *bitpos)
4547 HOST_WIDE_INT adjust = bitoffset - *bitpos;
4549 gcc_assert ((adjust % BITS_PER_UNIT) == 0);
4550 gcc_assert (*offset != NULL_TREE);
4554 = size_binop (MINUS_EXPR, *offset, size_int (adjust / BITS_PER_UNIT));
4558 *bitstart = *bitpos - bitoffset;
4560 *bitend = *bitstart + tree_low_cst (DECL_SIZE (repr), 1) - 1;
4563 /* Returns true if the MEM_REF REF refers to an object that does not
4564 reside in memory and has non-BLKmode. */
4567 mem_ref_refers_to_non_mem_p (tree ref)
4569 tree base = TREE_OPERAND (ref, 0);
4570 if (TREE_CODE (base) != ADDR_EXPR)
4572 base = TREE_OPERAND (base, 0);
4573 return (DECL_P (base)
4574 && !TREE_ADDRESSABLE (base)
4575 && DECL_MODE (base) != BLKmode
4576 && DECL_RTL_SET_P (base)
4577 && !MEM_P (DECL_RTL (base)));
4580 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4581 is true, try generating a nontemporal store. */
4584 expand_assignment (tree to, tree from, bool nontemporal)
4588 enum machine_mode mode;
4590 enum insn_code icode;
4592 /* Don't crash if the lhs of the assignment was erroneous. */
4593 if (TREE_CODE (to) == ERROR_MARK)
4595 expand_normal (from);
4599 /* Optimize away no-op moves without side-effects. */
4600 if (operand_equal_p (to, from, 0))
4603 /* Handle misaligned stores. */
4604 mode = TYPE_MODE (TREE_TYPE (to));
4605 if ((TREE_CODE (to) == MEM_REF
4606 || TREE_CODE (to) == TARGET_MEM_REF)
4608 && !mem_ref_refers_to_non_mem_p (to)
4609 && ((align = get_object_alignment (to))
4610 < GET_MODE_ALIGNMENT (mode))
4611 && (((icode = optab_handler (movmisalign_optab, mode))
4612 != CODE_FOR_nothing)
4613 || SLOW_UNALIGNED_ACCESS (mode, align)))
4617 reg = expand_expr (from, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4618 reg = force_not_mem (reg);
4619 mem = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4621 if (icode != CODE_FOR_nothing)
4623 struct expand_operand ops[2];
4625 create_fixed_operand (&ops[0], mem);
4626 create_input_operand (&ops[1], reg, mode);
4627 /* The movmisalign<mode> pattern cannot fail, else the assignment
4628 would silently be omitted. */
4629 expand_insn (icode, 2, ops);
4632 store_bit_field (mem, GET_MODE_BITSIZE (mode),
4633 0, 0, 0, mode, reg);
4637 /* Assignment of a structure component needs special treatment
4638 if the structure component's rtx is not simply a MEM.
4639 Assignment of an array element at a constant index, and assignment of
4640 an array element in an unaligned packed structure field, has the same
4641 problem. Same for (partially) storing into a non-memory object. */
4642 if (handled_component_p (to)
4643 || (TREE_CODE (to) == MEM_REF
4644 && mem_ref_refers_to_non_mem_p (to))
4645 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4647 enum machine_mode mode1;
4648 HOST_WIDE_INT bitsize, bitpos;
4649 unsigned HOST_WIDE_INT bitregion_start = 0;
4650 unsigned HOST_WIDE_INT bitregion_end = 0;
4659 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4660 &unsignedp, &volatilep, true);
4662 if (TREE_CODE (to) == COMPONENT_REF
4663 && DECL_BIT_FIELD_TYPE (TREE_OPERAND (to, 1)))
4664 get_bit_range (&bitregion_start, &bitregion_end, to, &bitpos, &offset);
4666 /* If we are going to use store_bit_field and extract_bit_field,
4667 make sure to_rtx will be safe for multiple use. */
4668 mode = TYPE_MODE (TREE_TYPE (tem));
4669 if (TREE_CODE (tem) == MEM_REF
4671 && ((align = get_object_alignment (tem))
4672 < GET_MODE_ALIGNMENT (mode))
4673 && ((icode = optab_handler (movmisalign_optab, mode))
4674 != CODE_FOR_nothing))
4676 struct expand_operand ops[2];
4679 to_rtx = gen_reg_rtx (mode);
4680 mem = expand_expr (tem, NULL_RTX, VOIDmode, EXPAND_WRITE);
4682 /* If the misaligned store doesn't overwrite all bits, perform
4683 rmw cycle on MEM. */
4684 if (bitsize != GET_MODE_BITSIZE (mode))
4686 create_input_operand (&ops[0], to_rtx, mode);
4687 create_fixed_operand (&ops[1], mem);
4688 /* The movmisalign<mode> pattern cannot fail, else the assignment
4689 would silently be omitted. */
4690 expand_insn (icode, 2, ops);
4692 mem = copy_rtx (mem);
4698 to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, EXPAND_WRITE);
4701 /* If the bitfield is volatile, we want to access it in the
4702 field's mode, not the computed mode.
4703 If a MEM has VOIDmode (external with incomplete type),
4704 use BLKmode for it instead. */
4707 if (volatilep && flag_strict_volatile_bitfields > 0)
4708 to_rtx = adjust_address (to_rtx, mode1, 0);
4709 else if (GET_MODE (to_rtx) == VOIDmode)
4710 to_rtx = adjust_address (to_rtx, BLKmode, 0);
4715 enum machine_mode address_mode;
4718 if (!MEM_P (to_rtx))
4720 /* We can get constant negative offsets into arrays with broken
4721 user code. Translate this to a trap instead of ICEing. */
4722 gcc_assert (TREE_CODE (offset) == INTEGER_CST);
4723 expand_builtin_trap ();
4724 to_rtx = gen_rtx_MEM (BLKmode, const0_rtx);
4727 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4728 address_mode = get_address_mode (to_rtx);
4729 if (GET_MODE (offset_rtx) != address_mode)
4730 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
4732 /* A constant address in TO_RTX can have VOIDmode, we must not try
4733 to call force_reg for that case. Avoid that case. */
4735 && GET_MODE (to_rtx) == BLKmode
4736 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4738 && (bitpos % bitsize) == 0
4739 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4740 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4742 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4746 to_rtx = offset_address (to_rtx, offset_rtx,
4747 highest_pow2_factor_for_target (to,
4751 /* No action is needed if the target is not a memory and the field
4752 lies completely outside that target. This can occur if the source
4753 code contains an out-of-bounds access to a small array. */
4755 && GET_MODE (to_rtx) != BLKmode
4756 && (unsigned HOST_WIDE_INT) bitpos
4757 >= GET_MODE_PRECISION (GET_MODE (to_rtx)))
4759 expand_normal (from);
4762 /* Handle expand_expr of a complex value returning a CONCAT. */
4763 else if (GET_CODE (to_rtx) == CONCAT)
4765 unsigned short mode_bitsize = GET_MODE_BITSIZE (GET_MODE (to_rtx));
4766 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from)))
4768 && bitsize == mode_bitsize)
4769 result = store_expr (from, to_rtx, false, nontemporal);
4770 else if (bitsize == mode_bitsize / 2
4771 && (bitpos == 0 || bitpos == mode_bitsize / 2))
4772 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false,
4774 else if (bitpos + bitsize <= mode_bitsize / 2)
4775 result = store_field (XEXP (to_rtx, 0), bitsize, bitpos,
4776 bitregion_start, bitregion_end,
4777 mode1, from, TREE_TYPE (tem),
4778 get_alias_set (to), nontemporal);
4779 else if (bitpos >= mode_bitsize / 2)
4780 result = store_field (XEXP (to_rtx, 1), bitsize,
4781 bitpos - mode_bitsize / 2,
4782 bitregion_start, bitregion_end,
4784 TREE_TYPE (tem), get_alias_set (to),
4786 else if (bitpos == 0 && bitsize == mode_bitsize)
4789 result = expand_normal (from);
4790 from_rtx = simplify_gen_subreg (GET_MODE (to_rtx), result,
4791 TYPE_MODE (TREE_TYPE (from)), 0);
4792 emit_move_insn (XEXP (to_rtx, 0),
4793 read_complex_part (from_rtx, false));
4794 emit_move_insn (XEXP (to_rtx, 1),
4795 read_complex_part (from_rtx, true));
4799 rtx temp = assign_stack_temp (GET_MODE (to_rtx),
4800 GET_MODE_SIZE (GET_MODE (to_rtx)));
4801 write_complex_part (temp, XEXP (to_rtx, 0), false);
4802 write_complex_part (temp, XEXP (to_rtx, 1), true);
4803 result = store_field (temp, bitsize, bitpos,
4804 bitregion_start, bitregion_end,
4806 TREE_TYPE (tem), get_alias_set (to),
4808 emit_move_insn (XEXP (to_rtx, 0), read_complex_part (temp, false));
4809 emit_move_insn (XEXP (to_rtx, 1), read_complex_part (temp, true));
4816 /* If the field is at offset zero, we could have been given the
4817 DECL_RTX of the parent struct. Don't munge it. */
4818 to_rtx = shallow_copy_rtx (to_rtx);
4820 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4822 /* Deal with volatile and readonly fields. The former is only
4823 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4825 MEM_VOLATILE_P (to_rtx) = 1;
4826 if (component_uses_parent_alias_set (to))
4827 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4830 if (optimize_bitfield_assignment_op (bitsize, bitpos,
4831 bitregion_start, bitregion_end,
4836 result = store_field (to_rtx, bitsize, bitpos,
4837 bitregion_start, bitregion_end,
4839 TREE_TYPE (tem), get_alias_set (to),
4845 struct expand_operand ops[2];
4847 create_fixed_operand (&ops[0], mem);
4848 create_input_operand (&ops[1], to_rtx, mode);
4849 /* The movmisalign<mode> pattern cannot fail, else the assignment
4850 would silently be omitted. */
4851 expand_insn (icode, 2, ops);
4855 preserve_temp_slots (result);
4860 /* If the rhs is a function call and its value is not an aggregate,
4861 call the function before we start to compute the lhs.
4862 This is needed for correct code for cases such as
4863 val = setjmp (buf) on machines where reference to val
4864 requires loading up part of an address in a separate insn.
4866 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4867 since it might be a promoted variable where the zero- or sign- extension
4868 needs to be done. Handling this in the normal way is safe because no
4869 computation is done before the call. The same is true for SSA names. */
4870 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
4871 && COMPLETE_TYPE_P (TREE_TYPE (from))
4872 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4873 && ! (((TREE_CODE (to) == VAR_DECL
4874 || TREE_CODE (to) == PARM_DECL
4875 || TREE_CODE (to) == RESULT_DECL)
4876 && REG_P (DECL_RTL (to)))
4877 || TREE_CODE (to) == SSA_NAME))
4882 value = expand_normal (from);
4884 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4886 /* Handle calls that return values in multiple non-contiguous locations.
4887 The Irix 6 ABI has examples of this. */
4888 if (GET_CODE (to_rtx) == PARALLEL)
4890 if (GET_CODE (value) == PARALLEL)
4891 emit_group_move (to_rtx, value);
4893 emit_group_load (to_rtx, value, TREE_TYPE (from),
4894 int_size_in_bytes (TREE_TYPE (from)));
4896 else if (GET_CODE (value) == PARALLEL)
4897 emit_group_store (to_rtx, value, TREE_TYPE (from),
4898 int_size_in_bytes (TREE_TYPE (from)));
4899 else if (GET_MODE (to_rtx) == BLKmode)
4902 copy_blkmode_from_reg (to_rtx, value, TREE_TYPE (from));
4904 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4908 if (POINTER_TYPE_P (TREE_TYPE (to)))
4909 value = convert_memory_address_addr_space
4910 (GET_MODE (to_rtx), value,
4911 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to))));
4913 emit_move_insn (to_rtx, value);
4915 preserve_temp_slots (to_rtx);
4920 /* Ordinary treatment. Expand TO to get a REG or MEM rtx. */
4921 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4923 /* Don't move directly into a return register. */
4924 if (TREE_CODE (to) == RESULT_DECL
4925 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4930 if (REG_P (to_rtx) && TYPE_MODE (TREE_TYPE (from)) == BLKmode)
4931 temp = copy_blkmode_to_reg (GET_MODE (to_rtx), from);
4933 temp = expand_expr (from, NULL_RTX, GET_MODE (to_rtx), EXPAND_NORMAL);
4935 /* Handle calls that return values in multiple non-contiguous locations.
4936 The Irix 6 ABI has examples of this. */
4937 if (GET_CODE (to_rtx) == PARALLEL)
4939 if (GET_CODE (temp) == PARALLEL)
4940 emit_group_move (to_rtx, temp);
4942 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4943 int_size_in_bytes (TREE_TYPE (from)));
4946 emit_move_insn (to_rtx, temp);
4948 preserve_temp_slots (to_rtx);
4953 /* In case we are returning the contents of an object which overlaps
4954 the place the value is being stored, use a safe function when copying
4955 a value through a pointer into a structure value return block. */
4956 if (TREE_CODE (to) == RESULT_DECL
4957 && TREE_CODE (from) == INDIRECT_REF
4958 && ADDR_SPACE_GENERIC_P
4959 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from, 0)))))
4960 && refs_may_alias_p (to, from)
4961 && cfun->returns_struct
4962 && !cfun->returns_pcc_struct)
4967 size = expr_size (from);
4968 from_rtx = expand_normal (from);
4970 emit_library_call (memmove_libfunc, LCT_NORMAL,
4971 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4972 XEXP (from_rtx, 0), Pmode,
4973 convert_to_mode (TYPE_MODE (sizetype),
4974 size, TYPE_UNSIGNED (sizetype)),
4975 TYPE_MODE (sizetype));
4977 preserve_temp_slots (to_rtx);
4982 /* Compute FROM and store the value in the rtx we got. */
4985 result = store_expr (from, to_rtx, 0, nontemporal);
4986 preserve_temp_slots (result);
4991 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4992 succeeded, false otherwise. */
4995 emit_storent_insn (rtx to, rtx from)
4997 struct expand_operand ops[2];
4998 enum machine_mode mode = GET_MODE (to);
4999 enum insn_code code = optab_handler (storent_optab, mode);
5001 if (code == CODE_FOR_nothing)
5004 create_fixed_operand (&ops[0], to);
5005 create_input_operand (&ops[1], from, mode);
5006 return maybe_expand_insn (code, 2, ops);
5009 /* Generate code for computing expression EXP,
5010 and storing the value into TARGET.
5012 If the mode is BLKmode then we may return TARGET itself.
5013 It turns out that in BLKmode it doesn't cause a problem.
5014 because C has no operators that could combine two different
5015 assignments into the same BLKmode object with different values
5016 with no sequence point. Will other languages need this to
5019 If CALL_PARAM_P is nonzero, this is a store into a call param on the
5020 stack, and block moves may need to be treated specially.
5022 If NONTEMPORAL is true, try using a nontemporal store instruction. */
5025 store_expr (tree exp, rtx target, int call_param_p, bool nontemporal)
5028 rtx alt_rtl = NULL_RTX;
5029 location_t loc = EXPR_LOCATION (exp);
5031 if (VOID_TYPE_P (TREE_TYPE (exp)))
5033 /* C++ can generate ?: expressions with a throw expression in one
5034 branch and an rvalue in the other. Here, we resolve attempts to
5035 store the throw expression's nonexistent result. */
5036 gcc_assert (!call_param_p);
5037 expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5040 if (TREE_CODE (exp) == COMPOUND_EXPR)
5042 /* Perform first part of compound expression, then assign from second
5044 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
5045 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
5046 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
5049 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
5051 /* For conditional expression, get safe form of the target. Then
5052 test the condition, doing the appropriate assignment on either
5053 side. This avoids the creation of unnecessary temporaries.
5054 For non-BLKmode, it is more efficient not to do this. */
5056 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
5058 do_pending_stack_adjust ();
5060 jumpifnot (TREE_OPERAND (exp, 0), lab1, -1);
5061 store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
5063 emit_jump_insn (gen_jump (lab2));
5066 store_expr (TREE_OPERAND (exp, 2), target, call_param_p,
5073 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
5074 /* If this is a scalar in a register that is stored in a wider mode
5075 than the declared mode, compute the result into its declared mode
5076 and then convert to the wider mode. Our value is the computed
5079 rtx inner_target = 0;
5081 /* We can do the conversion inside EXP, which will often result
5082 in some optimizations. Do the conversion in two steps: first
5083 change the signedness, if needed, then the extend. But don't
5084 do this if the type of EXP is a subtype of something else
5085 since then the conversion might involve more than just
5086 converting modes. */
5087 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
5088 && TREE_TYPE (TREE_TYPE (exp)) == 0
5089 && GET_MODE_PRECISION (GET_MODE (target))
5090 == TYPE_PRECISION (TREE_TYPE (exp)))
5092 if (TYPE_UNSIGNED (TREE_TYPE (exp))
5093 != SUBREG_PROMOTED_UNSIGNED_P (target))
5095 /* Some types, e.g. Fortran's logical*4, won't have a signed
5096 version, so use the mode instead. */
5098 = (signed_or_unsigned_type_for
5099 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)));
5101 ntype = lang_hooks.types.type_for_mode
5102 (TYPE_MODE (TREE_TYPE (exp)),
5103 SUBREG_PROMOTED_UNSIGNED_P (target));
5105 exp = fold_convert_loc (loc, ntype, exp);
5108 exp = fold_convert_loc (loc, lang_hooks.types.type_for_mode
5109 (GET_MODE (SUBREG_REG (target)),
5110 SUBREG_PROMOTED_UNSIGNED_P (target)),
5113 inner_target = SUBREG_REG (target);
5116 temp = expand_expr (exp, inner_target, VOIDmode,
5117 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
5119 /* If TEMP is a VOIDmode constant, use convert_modes to make
5120 sure that we properly convert it. */
5121 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
5123 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
5124 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
5125 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
5126 GET_MODE (target), temp,
5127 SUBREG_PROMOTED_UNSIGNED_P (target));
5130 convert_move (SUBREG_REG (target), temp,
5131 SUBREG_PROMOTED_UNSIGNED_P (target));
5135 else if ((TREE_CODE (exp) == STRING_CST
5136 || (TREE_CODE (exp) == MEM_REF
5137 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
5138 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
5140 && integer_zerop (TREE_OPERAND (exp, 1))))
5141 && !nontemporal && !call_param_p
5144 /* Optimize initialization of an array with a STRING_CST. */
5145 HOST_WIDE_INT exp_len, str_copy_len;
5147 tree str = TREE_CODE (exp) == STRING_CST
5148 ? exp : TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
5150 exp_len = int_expr_size (exp);
5154 if (TREE_STRING_LENGTH (str) <= 0)
5157 str_copy_len = strlen (TREE_STRING_POINTER (str));
5158 if (str_copy_len < TREE_STRING_LENGTH (str) - 1)
5161 str_copy_len = TREE_STRING_LENGTH (str);
5162 if ((STORE_MAX_PIECES & (STORE_MAX_PIECES - 1)) == 0
5163 && TREE_STRING_POINTER (str)[TREE_STRING_LENGTH (str) - 1] == '\0')
5165 str_copy_len += STORE_MAX_PIECES - 1;
5166 str_copy_len &= ~(STORE_MAX_PIECES - 1);
5168 str_copy_len = MIN (str_copy_len, exp_len);
5169 if (!can_store_by_pieces (str_copy_len, builtin_strncpy_read_str,
5170 CONST_CAST (char *, TREE_STRING_POINTER (str)),
5171 MEM_ALIGN (target), false))
5176 dest_mem = store_by_pieces (dest_mem,
5177 str_copy_len, builtin_strncpy_read_str,
5179 TREE_STRING_POINTER (str)),
5180 MEM_ALIGN (target), false,
5181 exp_len > str_copy_len ? 1 : 0);
5182 if (exp_len > str_copy_len)
5183 clear_storage (adjust_address (dest_mem, BLKmode, 0),
5184 GEN_INT (exp_len - str_copy_len),
5193 /* If we want to use a nontemporal store, force the value to
5195 tmp_target = nontemporal ? NULL_RTX : target;
5196 temp = expand_expr_real (exp, tmp_target, GET_MODE (target),
5198 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
5202 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
5203 the same as that of TARGET, adjust the constant. This is needed, for
5204 example, in case it is a CONST_DOUBLE and we want only a word-sized
5206 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
5207 && TREE_CODE (exp) != ERROR_MARK
5208 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
5209 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
5210 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
5212 /* If value was not generated in the target, store it there.
5213 Convert the value to TARGET's type first if necessary and emit the
5214 pending incrementations that have been queued when expanding EXP.
5215 Note that we cannot emit the whole queue blindly because this will
5216 effectively disable the POST_INC optimization later.
5218 If TEMP and TARGET compare equal according to rtx_equal_p, but
5219 one or both of them are volatile memory refs, we have to distinguish
5221 - expand_expr has used TARGET. In this case, we must not generate
5222 another copy. This can be detected by TARGET being equal according
5224 - expand_expr has not used TARGET - that means that the source just
5225 happens to have the same RTX form. Since temp will have been created
5226 by expand_expr, it will compare unequal according to == .
5227 We must generate a copy in this case, to reach the correct number
5228 of volatile memory references. */
5230 if ((! rtx_equal_p (temp, target)
5231 || (temp != target && (side_effects_p (temp)
5232 || side_effects_p (target))))
5233 && TREE_CODE (exp) != ERROR_MARK
5234 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
5235 but TARGET is not valid memory reference, TEMP will differ
5236 from TARGET although it is really the same location. */
5238 && rtx_equal_p (alt_rtl, target)
5239 && !side_effects_p (alt_rtl)
5240 && !side_effects_p (target))
5241 /* If there's nothing to copy, don't bother. Don't call
5242 expr_size unless necessary, because some front-ends (C++)
5243 expr_size-hook must not be given objects that are not
5244 supposed to be bit-copied or bit-initialized. */
5245 && expr_size (exp) != const0_rtx)
5247 if (GET_MODE (temp) != GET_MODE (target) && GET_MODE (temp) != VOIDmode)
5249 if (GET_MODE (target) == BLKmode)
5253 if (TREE_CODE (exp) == CALL_EXPR)
5254 copy_blkmode_from_reg (target, temp, TREE_TYPE (exp));
5256 store_bit_field (target,
5257 INTVAL (expr_size (exp)) * BITS_PER_UNIT,
5258 0, 0, 0, GET_MODE (temp), temp);
5261 emit_block_move (target, temp, expr_size (exp),
5263 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
5266 convert_move (target, temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
5269 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
5271 /* Handle copying a string constant into an array. The string
5272 constant may be shorter than the array. So copy just the string's
5273 actual length, and clear the rest. First get the size of the data
5274 type of the string, which is actually the size of the target. */
5275 rtx size = expr_size (exp);
5277 if (CONST_INT_P (size)
5278 && INTVAL (size) < TREE_STRING_LENGTH (exp))
5279 emit_block_move (target, temp, size,
5281 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
5284 enum machine_mode pointer_mode
5285 = targetm.addr_space.pointer_mode (MEM_ADDR_SPACE (target));
5286 enum machine_mode address_mode = get_address_mode (target);
5288 /* Compute the size of the data to copy from the string. */
5290 = size_binop_loc (loc, MIN_EXPR,
5291 make_tree (sizetype, size),
5292 size_int (TREE_STRING_LENGTH (exp)));
5294 = expand_expr (copy_size, NULL_RTX, VOIDmode,
5296 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
5299 /* Copy that much. */
5300 copy_size_rtx = convert_to_mode (pointer_mode, copy_size_rtx,
5301 TYPE_UNSIGNED (sizetype));
5302 emit_block_move (target, temp, copy_size_rtx,
5304 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
5306 /* Figure out how much is left in TARGET that we have to clear.
5307 Do all calculations in pointer_mode. */
5308 if (CONST_INT_P (copy_size_rtx))
5310 size = plus_constant (address_mode, size,
5311 -INTVAL (copy_size_rtx));
5312 target = adjust_address (target, BLKmode,
5313 INTVAL (copy_size_rtx));
5317 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
5318 copy_size_rtx, NULL_RTX, 0,
5321 if (GET_MODE (copy_size_rtx) != address_mode)
5322 copy_size_rtx = convert_to_mode (address_mode,
5324 TYPE_UNSIGNED (sizetype));
5326 target = offset_address (target, copy_size_rtx,
5327 highest_pow2_factor (copy_size));
5328 label = gen_label_rtx ();
5329 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
5330 GET_MODE (size), 0, label);
5333 if (size != const0_rtx)
5334 clear_storage (target, size, BLOCK_OP_NORMAL);
5340 /* Handle calls that return values in multiple non-contiguous locations.
5341 The Irix 6 ABI has examples of this. */
5342 else if (GET_CODE (target) == PARALLEL)
5344 if (GET_CODE (temp) == PARALLEL)
5345 emit_group_move (target, temp);
5347 emit_group_load (target, temp, TREE_TYPE (exp),
5348 int_size_in_bytes (TREE_TYPE (exp)));
5350 else if (GET_CODE (temp) == PARALLEL)
5351 emit_group_store (target, temp, TREE_TYPE (exp),
5352 int_size_in_bytes (TREE_TYPE (exp)));
5353 else if (GET_MODE (temp) == BLKmode)
5354 emit_block_move (target, temp, expr_size (exp),
5356 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
5357 /* If we emit a nontemporal store, there is nothing else to do. */
5358 else if (nontemporal && emit_storent_insn (target, temp))
5362 temp = force_operand (temp, target);
5364 emit_move_insn (target, temp);
5371 /* Return true if field F of structure TYPE is a flexible array. */
5374 flexible_array_member_p (const_tree f, const_tree type)
5379 return (DECL_CHAIN (f) == NULL
5380 && TREE_CODE (tf) == ARRAY_TYPE
5382 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf))
5383 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf)))
5384 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf))
5385 && int_size_in_bytes (type) >= 0);
5388 /* If FOR_CTOR_P, return the number of top-level elements that a constructor
5389 must have in order for it to completely initialize a value of type TYPE.
5390 Return -1 if the number isn't known.
5392 If !FOR_CTOR_P, return an estimate of the number of scalars in TYPE. */
5394 static HOST_WIDE_INT
5395 count_type_elements (const_tree type, bool for_ctor_p)
5397 switch (TREE_CODE (type))
5403 nelts = array_type_nelts (type);
5404 if (nelts && host_integerp (nelts, 1))
5406 unsigned HOST_WIDE_INT n;
5408 n = tree_low_cst (nelts, 1) + 1;
5409 if (n == 0 || for_ctor_p)
5412 return n * count_type_elements (TREE_TYPE (type), false);
5414 return for_ctor_p ? -1 : 1;
5419 unsigned HOST_WIDE_INT n;
5423 for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f))
5424 if (TREE_CODE (f) == FIELD_DECL)
5427 n += count_type_elements (TREE_TYPE (f), false);
5428 else if (!flexible_array_member_p (f, type))
5429 /* Don't count flexible arrays, which are not supposed
5430 to be initialized. */
5438 case QUAL_UNION_TYPE:
5443 gcc_assert (!for_ctor_p);
5444 /* Estimate the number of scalars in each field and pick the
5445 maximum. Other estimates would do instead; the idea is simply
5446 to make sure that the estimate is not sensitive to the ordering
5449 for (f = TYPE_FIELDS (type); f ; f = DECL_CHAIN (f))
5450 if (TREE_CODE (f) == FIELD_DECL)
5452 m = count_type_elements (TREE_TYPE (f), false);
5453 /* If the field doesn't span the whole union, add an extra
5454 scalar for the rest. */
5455 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (f)),
5456 TYPE_SIZE (type)) != 1)
5468 return TYPE_VECTOR_SUBPARTS (type);
5472 case FIXED_POINT_TYPE:
5477 case REFERENCE_TYPE:
5493 /* Helper for categorize_ctor_elements. Identical interface. */
5496 categorize_ctor_elements_1 (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
5497 HOST_WIDE_INT *p_init_elts, bool *p_complete)
5499 unsigned HOST_WIDE_INT idx;
5500 HOST_WIDE_INT nz_elts, init_elts, num_fields;
5501 tree value, purpose, elt_type;
5503 /* Whether CTOR is a valid constant initializer, in accordance with what
5504 initializer_constant_valid_p does. If inferred from the constructor
5505 elements, true until proven otherwise. */
5506 bool const_from_elts_p = constructor_static_from_elts_p (ctor);
5507 bool const_p = const_from_elts_p ? true : TREE_STATIC (ctor);
5512 elt_type = NULL_TREE;
5514 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), idx, purpose, value)
5516 HOST_WIDE_INT mult = 1;
5518 if (purpose && TREE_CODE (purpose) == RANGE_EXPR)
5520 tree lo_index = TREE_OPERAND (purpose, 0);
5521 tree hi_index = TREE_OPERAND (purpose, 1);
5523 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
5524 mult = (tree_low_cst (hi_index, 1)
5525 - tree_low_cst (lo_index, 1) + 1);
5528 elt_type = TREE_TYPE (value);
5530 switch (TREE_CODE (value))
5534 HOST_WIDE_INT nz = 0, ic = 0;
5536 bool const_elt_p = categorize_ctor_elements_1 (value, &nz, &ic,
5539 nz_elts += mult * nz;
5540 init_elts += mult * ic;
5542 if (const_from_elts_p && const_p)
5543 const_p = const_elt_p;
5550 if (!initializer_zerop (value))
5556 nz_elts += mult * TREE_STRING_LENGTH (value);
5557 init_elts += mult * TREE_STRING_LENGTH (value);
5561 if (!initializer_zerop (TREE_REALPART (value)))
5563 if (!initializer_zerop (TREE_IMAGPART (value)))
5571 for (i = 0; i < VECTOR_CST_NELTS (value); ++i)
5573 tree v = VECTOR_CST_ELT (value, i);
5574 if (!initializer_zerop (v))
5583 HOST_WIDE_INT tc = count_type_elements (elt_type, false);
5584 nz_elts += mult * tc;
5585 init_elts += mult * tc;
5587 if (const_from_elts_p && const_p)
5588 const_p = initializer_constant_valid_p (value, elt_type)
5595 if (*p_complete && !complete_ctor_at_level_p (TREE_TYPE (ctor),
5596 num_fields, elt_type))
5597 *p_complete = false;
5599 *p_nz_elts += nz_elts;
5600 *p_init_elts += init_elts;
5605 /* Examine CTOR to discover:
5606 * how many scalar fields are set to nonzero values,
5607 and place it in *P_NZ_ELTS;
5608 * how many scalar fields in total are in CTOR,
5609 and place it in *P_ELT_COUNT.
5610 * whether the constructor is complete -- in the sense that every
5611 meaningful byte is explicitly given a value --
5612 and place it in *P_COMPLETE.
5614 Return whether or not CTOR is a valid static constant initializer, the same
5615 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
5618 categorize_ctor_elements (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
5619 HOST_WIDE_INT *p_init_elts, bool *p_complete)
5625 return categorize_ctor_elements_1 (ctor, p_nz_elts, p_init_elts, p_complete);
5628 /* TYPE is initialized by a constructor with NUM_ELTS elements, the last
5629 of which had type LAST_TYPE. Each element was itself a complete
5630 initializer, in the sense that every meaningful byte was explicitly
5631 given a value. Return true if the same is true for the constructor
5635 complete_ctor_at_level_p (const_tree type, HOST_WIDE_INT num_elts,
5636 const_tree last_type)
5638 if (TREE_CODE (type) == UNION_TYPE
5639 || TREE_CODE (type) == QUAL_UNION_TYPE)
5644 gcc_assert (num_elts == 1 && last_type);
5646 /* ??? We could look at each element of the union, and find the
5647 largest element. Which would avoid comparing the size of the
5648 initialized element against any tail padding in the union.
5649 Doesn't seem worth the effort... */
5650 return simple_cst_equal (TYPE_SIZE (type), TYPE_SIZE (last_type)) == 1;
5653 return count_type_elements (type, true) == num_elts;
5656 /* Return 1 if EXP contains mostly (3/4) zeros. */
5659 mostly_zeros_p (const_tree exp)
5661 if (TREE_CODE (exp) == CONSTRUCTOR)
5663 HOST_WIDE_INT nz_elts, init_elts;
5666 categorize_ctor_elements (exp, &nz_elts, &init_elts, &complete_p);
5667 return !complete_p || nz_elts < init_elts / 4;
5670 return initializer_zerop (exp);
5673 /* Return 1 if EXP contains all zeros. */
5676 all_zeros_p (const_tree exp)
5678 if (TREE_CODE (exp) == CONSTRUCTOR)
5680 HOST_WIDE_INT nz_elts, init_elts;
5683 categorize_ctor_elements (exp, &nz_elts, &init_elts, &complete_p);
5684 return nz_elts == 0;
5687 return initializer_zerop (exp);
5690 /* Helper function for store_constructor.
5691 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5692 TYPE is the type of the CONSTRUCTOR, not the element type.
5693 CLEARED is as for store_constructor.
5694 ALIAS_SET is the alias set to use for any stores.
5696 This provides a recursive shortcut back to store_constructor when it isn't
5697 necessary to go through store_field. This is so that we can pass through
5698 the cleared field to let store_constructor know that we may not have to
5699 clear a substructure if the outer structure has already been cleared. */
5702 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
5703 HOST_WIDE_INT bitpos, enum machine_mode mode,
5704 tree exp, tree type, int cleared,
5705 alias_set_type alias_set)
5707 if (TREE_CODE (exp) == CONSTRUCTOR
5708 /* We can only call store_constructor recursively if the size and
5709 bit position are on a byte boundary. */
5710 && bitpos % BITS_PER_UNIT == 0
5711 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
5712 /* If we have a nonzero bitpos for a register target, then we just
5713 let store_field do the bitfield handling. This is unlikely to
5714 generate unnecessary clear instructions anyways. */
5715 && (bitpos == 0 || MEM_P (target)))
5719 = adjust_address (target,
5720 GET_MODE (target) == BLKmode
5722 % GET_MODE_ALIGNMENT (GET_MODE (target)))
5723 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
5726 /* Update the alias set, if required. */
5727 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
5728 && MEM_ALIAS_SET (target) != 0)
5730 target = copy_rtx (target);
5731 set_mem_alias_set (target, alias_set);
5734 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
5737 store_field (target, bitsize, bitpos, 0, 0, mode, exp, type, alias_set,
5741 /* Store the value of constructor EXP into the rtx TARGET.
5742 TARGET is either a REG or a MEM; we know it cannot conflict, since
5743 safe_from_p has been called.
5744 CLEARED is true if TARGET is known to have been zero'd.
5745 SIZE is the number of bytes of TARGET we are allowed to modify: this
5746 may not be the same as the size of EXP if we are assigning to a field
5747 which has been packed to exclude padding bits. */
5750 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
5752 tree type = TREE_TYPE (exp);
5753 #ifdef WORD_REGISTER_OPERATIONS
5754 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
5757 switch (TREE_CODE (type))
5761 case QUAL_UNION_TYPE:
5763 unsigned HOST_WIDE_INT idx;
5766 /* If size is zero or the target is already cleared, do nothing. */
5767 if (size == 0 || cleared)
5769 /* We either clear the aggregate or indicate the value is dead. */
5770 else if ((TREE_CODE (type) == UNION_TYPE
5771 || TREE_CODE (type) == QUAL_UNION_TYPE)
5772 && ! CONSTRUCTOR_ELTS (exp))
5773 /* If the constructor is empty, clear the union. */
5775 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
5779 /* If we are building a static constructor into a register,
5780 set the initial value as zero so we can fold the value into
5781 a constant. But if more than one register is involved,
5782 this probably loses. */
5783 else if (REG_P (target) && TREE_STATIC (exp)
5784 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
5786 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5790 /* If the constructor has fewer fields than the structure or
5791 if we are initializing the structure to mostly zeros, clear
5792 the whole structure first. Don't do this if TARGET is a
5793 register whose mode size isn't equal to SIZE since
5794 clear_storage can't handle this case. */
5796 && (((int)VEC_length (constructor_elt, CONSTRUCTOR_ELTS (exp))
5797 != fields_length (type))
5798 || mostly_zeros_p (exp))
5800 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
5803 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5807 if (REG_P (target) && !cleared)
5808 emit_clobber (target);
5810 /* Store each element of the constructor into the
5811 corresponding field of TARGET. */
5812 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, field, value)
5814 enum machine_mode mode;
5815 HOST_WIDE_INT bitsize;
5816 HOST_WIDE_INT bitpos = 0;
5818 rtx to_rtx = target;
5820 /* Just ignore missing fields. We cleared the whole
5821 structure, above, if any fields are missing. */
5825 if (cleared && initializer_zerop (value))
5828 if (host_integerp (DECL_SIZE (field), 1))
5829 bitsize = tree_low_cst (DECL_SIZE (field), 1);
5833 mode = DECL_MODE (field);
5834 if (DECL_BIT_FIELD (field))
5837 offset = DECL_FIELD_OFFSET (field);
5838 if (host_integerp (offset, 0)
5839 && host_integerp (bit_position (field), 0))
5841 bitpos = int_bit_position (field);
5845 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
5849 enum machine_mode address_mode;
5853 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
5854 make_tree (TREE_TYPE (exp),
5857 offset_rtx = expand_normal (offset);
5858 gcc_assert (MEM_P (to_rtx));
5860 address_mode = get_address_mode (to_rtx);
5861 if (GET_MODE (offset_rtx) != address_mode)
5862 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
5864 to_rtx = offset_address (to_rtx, offset_rtx,
5865 highest_pow2_factor (offset));
5868 #ifdef WORD_REGISTER_OPERATIONS
5869 /* If this initializes a field that is smaller than a
5870 word, at the start of a word, try to widen it to a full
5871 word. This special case allows us to output C++ member
5872 function initializations in a form that the optimizers
5875 && bitsize < BITS_PER_WORD
5876 && bitpos % BITS_PER_WORD == 0
5877 && GET_MODE_CLASS (mode) == MODE_INT
5878 && TREE_CODE (value) == INTEGER_CST
5880 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5882 tree type = TREE_TYPE (value);
5884 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5886 type = lang_hooks.types.type_for_mode
5887 (word_mode, TYPE_UNSIGNED (type));
5888 value = fold_convert (type, value);
5891 if (BYTES_BIG_ENDIAN)
5893 = fold_build2 (LSHIFT_EXPR, type, value,
5894 build_int_cst (type,
5895 BITS_PER_WORD - bitsize));
5896 bitsize = BITS_PER_WORD;
5901 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5902 && DECL_NONADDRESSABLE_P (field))
5904 to_rtx = copy_rtx (to_rtx);
5905 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5908 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5909 value, type, cleared,
5910 get_alias_set (TREE_TYPE (field)));
5917 unsigned HOST_WIDE_INT i;
5920 tree elttype = TREE_TYPE (type);
5922 HOST_WIDE_INT minelt = 0;
5923 HOST_WIDE_INT maxelt = 0;
5925 domain = TYPE_DOMAIN (type);
5926 const_bounds_p = (TYPE_MIN_VALUE (domain)
5927 && TYPE_MAX_VALUE (domain)
5928 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5929 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5931 /* If we have constant bounds for the range of the type, get them. */
5934 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5935 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5938 /* If the constructor has fewer elements than the array, clear
5939 the whole array first. Similarly if this is static
5940 constructor of a non-BLKmode object. */
5943 else if (REG_P (target) && TREE_STATIC (exp))
5947 unsigned HOST_WIDE_INT idx;
5949 HOST_WIDE_INT count = 0, zero_count = 0;
5950 need_to_clear = ! const_bounds_p;
5952 /* This loop is a more accurate version of the loop in
5953 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5954 is also needed to check for missing elements. */
5955 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, index, value)
5957 HOST_WIDE_INT this_node_count;
5962 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5964 tree lo_index = TREE_OPERAND (index, 0);
5965 tree hi_index = TREE_OPERAND (index, 1);
5967 if (! host_integerp (lo_index, 1)
5968 || ! host_integerp (hi_index, 1))
5974 this_node_count = (tree_low_cst (hi_index, 1)
5975 - tree_low_cst (lo_index, 1) + 1);
5978 this_node_count = 1;
5980 count += this_node_count;
5981 if (mostly_zeros_p (value))
5982 zero_count += this_node_count;
5985 /* Clear the entire array first if there are any missing
5986 elements, or if the incidence of zero elements is >=
5989 && (count < maxelt - minelt + 1
5990 || 4 * zero_count >= 3 * count))
5994 if (need_to_clear && size > 0)
5997 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5999 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
6003 if (!cleared && REG_P (target))
6004 /* Inform later passes that the old value is dead. */
6005 emit_clobber (target);
6007 /* Store each element of the constructor into the
6008 corresponding element of TARGET, determined by counting the
6010 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), i, index, value)
6012 enum machine_mode mode;
6013 HOST_WIDE_INT bitsize;
6014 HOST_WIDE_INT bitpos;
6015 rtx xtarget = target;
6017 if (cleared && initializer_zerop (value))
6020 mode = TYPE_MODE (elttype);
6021 if (mode == BLKmode)
6022 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
6023 ? tree_low_cst (TYPE_SIZE (elttype), 1)
6026 bitsize = GET_MODE_BITSIZE (mode);
6028 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
6030 tree lo_index = TREE_OPERAND (index, 0);
6031 tree hi_index = TREE_OPERAND (index, 1);
6032 rtx index_r, pos_rtx;
6033 HOST_WIDE_INT lo, hi, count;
6036 /* If the range is constant and "small", unroll the loop. */
6038 && host_integerp (lo_index, 0)
6039 && host_integerp (hi_index, 0)
6040 && (lo = tree_low_cst (lo_index, 0),
6041 hi = tree_low_cst (hi_index, 0),
6042 count = hi - lo + 1,
6045 || (host_integerp (TYPE_SIZE (elttype), 1)
6046 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
6049 lo -= minelt; hi -= minelt;
6050 for (; lo <= hi; lo++)
6052 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
6055 && !MEM_KEEP_ALIAS_SET_P (target)
6056 && TREE_CODE (type) == ARRAY_TYPE
6057 && TYPE_NONALIASED_COMPONENT (type))
6059 target = copy_rtx (target);
6060 MEM_KEEP_ALIAS_SET_P (target) = 1;
6063 store_constructor_field
6064 (target, bitsize, bitpos, mode, value, type, cleared,
6065 get_alias_set (elttype));
6070 rtx loop_start = gen_label_rtx ();
6071 rtx loop_end = gen_label_rtx ();
6074 expand_normal (hi_index);
6076 index = build_decl (EXPR_LOCATION (exp),
6077 VAR_DECL, NULL_TREE, domain);
6078 index_r = gen_reg_rtx (promote_decl_mode (index, NULL));
6079 SET_DECL_RTL (index, index_r);
6080 store_expr (lo_index, index_r, 0, false);
6082 /* Build the head of the loop. */
6083 do_pending_stack_adjust ();
6084 emit_label (loop_start);
6086 /* Assign value to element index. */
6088 fold_convert (ssizetype,
6089 fold_build2 (MINUS_EXPR,
6092 TYPE_MIN_VALUE (domain)));
6095 size_binop (MULT_EXPR, position,
6096 fold_convert (ssizetype,
6097 TYPE_SIZE_UNIT (elttype)));
6099 pos_rtx = expand_normal (position);
6100 xtarget = offset_address (target, pos_rtx,
6101 highest_pow2_factor (position));
6102 xtarget = adjust_address (xtarget, mode, 0);
6103 if (TREE_CODE (value) == CONSTRUCTOR)
6104 store_constructor (value, xtarget, cleared,
6105 bitsize / BITS_PER_UNIT);
6107 store_expr (value, xtarget, 0, false);
6109 /* Generate a conditional jump to exit the loop. */
6110 exit_cond = build2 (LT_EXPR, integer_type_node,
6112 jumpif (exit_cond, loop_end, -1);
6114 /* Update the loop counter, and jump to the head of
6116 expand_assignment (index,
6117 build2 (PLUS_EXPR, TREE_TYPE (index),
6118 index, integer_one_node),
6121 emit_jump (loop_start);
6123 /* Build the end of the loop. */
6124 emit_label (loop_end);
6127 else if ((index != 0 && ! host_integerp (index, 0))
6128 || ! host_integerp (TYPE_SIZE (elttype), 1))
6133 index = ssize_int (1);
6136 index = fold_convert (ssizetype,
6137 fold_build2 (MINUS_EXPR,
6140 TYPE_MIN_VALUE (domain)));
6143 size_binop (MULT_EXPR, index,
6144 fold_convert (ssizetype,
6145 TYPE_SIZE_UNIT (elttype)));
6146 xtarget = offset_address (target,
6147 expand_normal (position),
6148 highest_pow2_factor (position));
6149 xtarget = adjust_address (xtarget, mode, 0);
6150 store_expr (value, xtarget, 0, false);
6155 bitpos = ((tree_low_cst (index, 0) - minelt)
6156 * tree_low_cst (TYPE_SIZE (elttype), 1));
6158 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
6160 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
6161 && TREE_CODE (type) == ARRAY_TYPE
6162 && TYPE_NONALIASED_COMPONENT (type))
6164 target = copy_rtx (target);
6165 MEM_KEEP_ALIAS_SET_P (target) = 1;
6167 store_constructor_field (target, bitsize, bitpos, mode, value,
6168 type, cleared, get_alias_set (elttype));
6176 unsigned HOST_WIDE_INT idx;
6177 constructor_elt *ce;
6180 int icode = CODE_FOR_nothing;
6181 tree elttype = TREE_TYPE (type);
6182 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
6183 enum machine_mode eltmode = TYPE_MODE (elttype);
6184 HOST_WIDE_INT bitsize;
6185 HOST_WIDE_INT bitpos;
6186 rtvec vector = NULL;
6188 alias_set_type alias;
6190 gcc_assert (eltmode != BLKmode);
6192 n_elts = TYPE_VECTOR_SUBPARTS (type);
6193 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
6195 enum machine_mode mode = GET_MODE (target);
6197 icode = (int) optab_handler (vec_init_optab, mode);
6198 if (icode != CODE_FOR_nothing)
6202 vector = rtvec_alloc (n_elts);
6203 for (i = 0; i < n_elts; i++)
6204 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
6208 /* If the constructor has fewer elements than the vector,
6209 clear the whole array first. Similarly if this is static
6210 constructor of a non-BLKmode object. */
6213 else if (REG_P (target) && TREE_STATIC (exp))
6217 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
6220 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
6222 int n_elts_here = tree_low_cst
6223 (int_const_binop (TRUNC_DIV_EXPR,
6224 TYPE_SIZE (TREE_TYPE (value)),
6225 TYPE_SIZE (elttype)), 1);
6227 count += n_elts_here;
6228 if (mostly_zeros_p (value))
6229 zero_count += n_elts_here;
6232 /* Clear the entire vector first if there are any missing elements,
6233 or if the incidence of zero elements is >= 75%. */
6234 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
6237 if (need_to_clear && size > 0 && !vector)
6240 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
6242 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
6246 /* Inform later passes that the old value is dead. */
6247 if (!cleared && !vector && REG_P (target))
6248 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
6251 alias = MEM_ALIAS_SET (target);
6253 alias = get_alias_set (elttype);
6255 /* Store each element of the constructor into the corresponding
6256 element of TARGET, determined by counting the elements. */
6257 for (idx = 0, i = 0;
6258 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
6259 idx++, i += bitsize / elt_size)
6261 HOST_WIDE_INT eltpos;
6262 tree value = ce->value;
6264 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
6265 if (cleared && initializer_zerop (value))
6269 eltpos = tree_low_cst (ce->index, 1);
6275 /* Vector CONSTRUCTORs should only be built from smaller
6276 vectors in the case of BLKmode vectors. */
6277 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
6278 RTVEC_ELT (vector, eltpos)
6279 = expand_normal (value);
6283 enum machine_mode value_mode =
6284 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
6285 ? TYPE_MODE (TREE_TYPE (value))
6287 bitpos = eltpos * elt_size;
6288 store_constructor_field (target, bitsize, bitpos,
6289 value_mode, value, type,
6295 emit_insn (GEN_FCN (icode)
6297 gen_rtx_PARALLEL (GET_MODE (target), vector)));
6306 /* Store the value of EXP (an expression tree)
6307 into a subfield of TARGET which has mode MODE and occupies
6308 BITSIZE bits, starting BITPOS bits from the start of TARGET.
6309 If MODE is VOIDmode, it means that we are storing into a bit-field.
6311 BITREGION_START is bitpos of the first bitfield in this region.
6312 BITREGION_END is the bitpos of the ending bitfield in this region.
6313 These two fields are 0, if the C++ memory model does not apply,
6314 or we are not interested in keeping track of bitfield regions.
6316 Always return const0_rtx unless we have something particular to
6319 TYPE is the type of the underlying object,
6321 ALIAS_SET is the alias set for the destination. This value will
6322 (in general) be different from that for TARGET, since TARGET is a
6323 reference to the containing structure.
6325 If NONTEMPORAL is true, try generating a nontemporal store. */
6328 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
6329 unsigned HOST_WIDE_INT bitregion_start,
6330 unsigned HOST_WIDE_INT bitregion_end,
6331 enum machine_mode mode, tree exp, tree type,
6332 alias_set_type alias_set, bool nontemporal)
6334 if (TREE_CODE (exp) == ERROR_MARK)
6337 /* If we have nothing to store, do nothing unless the expression has
6340 return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
6342 /* If we are storing into an unaligned field of an aligned union that is
6343 in a register, we may have the mode of TARGET being an integer mode but
6344 MODE == BLKmode. In that case, get an aligned object whose size and
6345 alignment are the same as TARGET and store TARGET into it (we can avoid
6346 the store if the field being stored is the entire width of TARGET). Then
6347 call ourselves recursively to store the field into a BLKmode version of
6348 that object. Finally, load from the object into TARGET. This is not
6349 very efficient in general, but should only be slightly more expensive
6350 than the otherwise-required unaligned accesses. Perhaps this can be
6351 cleaned up later. It's tempting to make OBJECT readonly, but it's set
6352 twice, once with emit_move_insn and once via store_field. */
6355 && (REG_P (target) || GET_CODE (target) == SUBREG)
6356 && TREE_CODE (exp) != CALL_EXPR)
6358 rtx object = assign_temp (type, 1, 1);
6359 rtx blk_object = adjust_address (object, BLKmode, 0);
6361 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
6362 emit_move_insn (object, target);
6364 store_field (blk_object, bitsize, bitpos,
6365 bitregion_start, bitregion_end,
6366 mode, exp, type, MEM_ALIAS_SET (blk_object), nontemporal);
6368 emit_move_insn (target, object);
6370 /* We want to return the BLKmode version of the data. */
6374 if (GET_CODE (target) == CONCAT)
6376 /* We're storing into a struct containing a single __complex. */
6378 gcc_assert (!bitpos);
6379 return store_expr (exp, target, 0, nontemporal);
6382 /* If the structure is in a register or if the component
6383 is a bit field, we cannot use addressing to access it.
6384 Use bit-field techniques or SUBREG to store in it. */
6386 if (mode == VOIDmode
6387 || (mode != BLKmode && ! direct_store[(int) mode]
6388 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
6389 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
6391 || GET_CODE (target) == SUBREG
6392 /* If the field isn't aligned enough to store as an ordinary memref,
6393 store it as a bit field. */
6395 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
6396 || bitpos % GET_MODE_ALIGNMENT (mode))
6397 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
6398 || (bitpos % BITS_PER_UNIT != 0)))
6399 || (bitsize >= 0 && mode != BLKmode
6400 && GET_MODE_BITSIZE (mode) > bitsize)
6401 /* If the RHS and field are a constant size and the size of the
6402 RHS isn't the same size as the bitfield, we must use bitfield
6405 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
6406 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0)
6407 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
6408 decl we must use bitfield operations. */
6410 && TREE_CODE (exp) == MEM_REF
6411 && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
6412 && DECL_P (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
6413 && !TREE_ADDRESSABLE (TREE_OPERAND (TREE_OPERAND (exp, 0),0 ))
6414 && DECL_MODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)) != BLKmode))
6419 /* If EXP is a NOP_EXPR of precision less than its mode, then that
6420 implies a mask operation. If the precision is the same size as
6421 the field we're storing into, that mask is redundant. This is
6422 particularly common with bit field assignments generated by the
6424 nop_def = get_def_for_expr (exp, NOP_EXPR);
6427 tree type = TREE_TYPE (exp);
6428 if (INTEGRAL_TYPE_P (type)
6429 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
6430 && bitsize == TYPE_PRECISION (type))
6432 tree op = gimple_assign_rhs1 (nop_def);
6433 type = TREE_TYPE (op);
6434 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
6439 temp = expand_normal (exp);
6441 /* If BITSIZE is narrower than the size of the type of EXP
6442 we will be narrowing TEMP. Normally, what's wanted are the
6443 low-order bits. However, if EXP's type is a record and this is
6444 big-endian machine, we want the upper BITSIZE bits. */
6445 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
6446 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
6447 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
6448 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
6449 GET_MODE_BITSIZE (GET_MODE (temp)) - bitsize,
6452 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to MODE. */
6453 if (mode != VOIDmode && mode != BLKmode
6454 && mode != TYPE_MODE (TREE_TYPE (exp)))
6455 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
6457 /* If the modes of TEMP and TARGET are both BLKmode, both
6458 must be in memory and BITPOS must be aligned on a byte
6459 boundary. If so, we simply do a block copy. Likewise
6460 for a BLKmode-like TARGET. */
6461 if (GET_MODE (temp) == BLKmode
6462 && (GET_MODE (target) == BLKmode
6464 && GET_MODE_CLASS (GET_MODE (target)) == MODE_INT
6465 && (bitpos % BITS_PER_UNIT) == 0
6466 && (bitsize % BITS_PER_UNIT) == 0)))
6468 gcc_assert (MEM_P (target) && MEM_P (temp)
6469 && (bitpos % BITS_PER_UNIT) == 0);
6471 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
6472 emit_block_move (target, temp,
6473 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
6480 /* Handle calls that return values in multiple non-contiguous locations.
6481 The Irix 6 ABI has examples of this. */
6482 if (GET_CODE (temp) == PARALLEL)
6486 /* We are not supposed to have a true bitfield in this case. */
6487 gcc_assert (bitsize == GET_MODE_BITSIZE (mode));
6489 /* If we don't store at bit 0, we need an intermediate pseudo
6490 since emit_group_store only stores at bit 0. */
6492 temp_target = gen_reg_rtx (mode);
6494 temp_target = target;
6496 emit_group_store (temp_target, temp, TREE_TYPE (exp),
6497 int_size_in_bytes (TREE_TYPE (exp)));
6499 if (temp_target == target)
6505 /* Handle calls that return BLKmode values in registers. */
6506 else if (mode == BLKmode
6508 && TREE_CODE (exp) == CALL_EXPR)
6510 rtx temp_target = gen_reg_rtx (GET_MODE (temp));
6511 copy_blkmode_from_reg (temp_target, temp, TREE_TYPE (exp));
6515 /* Store the value in the bitfield. */
6516 store_bit_field (target, bitsize, bitpos,
6517 bitregion_start, bitregion_end,
6524 /* Now build a reference to just the desired component. */
6525 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
6527 if (to_rtx == target)
6528 to_rtx = copy_rtx (to_rtx);
6530 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
6531 set_mem_alias_set (to_rtx, alias_set);
6533 return store_expr (exp, to_rtx, 0, nontemporal);
6537 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
6538 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
6539 codes and find the ultimate containing object, which we return.
6541 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
6542 bit position, and *PUNSIGNEDP to the signedness of the field.
6543 If the position of the field is variable, we store a tree
6544 giving the variable offset (in units) in *POFFSET.
6545 This offset is in addition to the bit position.
6546 If the position is not variable, we store 0 in *POFFSET.
6548 If any of the extraction expressions is volatile,
6549 we store 1 in *PVOLATILEP. Otherwise we don't change that.
6551 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
6552 Otherwise, it is a mode that can be used to access the field.
6554 If the field describes a variable-sized object, *PMODE is set to
6555 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
6556 this case, but the address of the object can be found.
6558 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
6559 look through nodes that serve as markers of a greater alignment than
6560 the one that can be deduced from the expression. These nodes make it
6561 possible for front-ends to prevent temporaries from being created by
6562 the middle-end on alignment considerations. For that purpose, the
6563 normal operating mode at high-level is to always pass FALSE so that
6564 the ultimate containing object is really returned; moreover, the
6565 associated predicate handled_component_p will always return TRUE
6566 on these nodes, thus indicating that they are essentially handled
6567 by get_inner_reference. TRUE should only be passed when the caller
6568 is scanning the expression in order to build another representation
6569 and specifically knows how to handle these nodes; as such, this is
6570 the normal operating mode in the RTL expanders. */
6573 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
6574 HOST_WIDE_INT *pbitpos, tree *poffset,
6575 enum machine_mode *pmode, int *punsignedp,
6576 int *pvolatilep, bool keep_aligning)
6579 enum machine_mode mode = VOIDmode;
6580 bool blkmode_bitfield = false;
6581 tree offset = size_zero_node;
6582 double_int bit_offset = double_int_zero;
6584 /* First get the mode, signedness, and size. We do this from just the
6585 outermost expression. */
6587 if (TREE_CODE (exp) == COMPONENT_REF)
6589 tree field = TREE_OPERAND (exp, 1);
6590 size_tree = DECL_SIZE (field);
6591 if (!DECL_BIT_FIELD (field))
6592 mode = DECL_MODE (field);
6593 else if (DECL_MODE (field) == BLKmode)
6594 blkmode_bitfield = true;
6595 else if (TREE_THIS_VOLATILE (exp)
6596 && flag_strict_volatile_bitfields > 0)
6597 /* Volatile bitfields should be accessed in the mode of the
6598 field's type, not the mode computed based on the bit
6600 mode = TYPE_MODE (DECL_BIT_FIELD_TYPE (field));
6602 *punsignedp = DECL_UNSIGNED (field);
6604 else if (TREE_CODE (exp) == BIT_FIELD_REF)
6606 size_tree = TREE_OPERAND (exp, 1);
6607 *punsignedp = (! INTEGRAL_TYPE_P (TREE_TYPE (exp))
6608 || TYPE_UNSIGNED (TREE_TYPE (exp)));
6610 /* For vector types, with the correct size of access, use the mode of
6612 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == VECTOR_TYPE
6613 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))
6614 && tree_int_cst_equal (size_tree, TYPE_SIZE (TREE_TYPE (exp))))
6615 mode = TYPE_MODE (TREE_TYPE (exp));
6619 mode = TYPE_MODE (TREE_TYPE (exp));
6620 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
6622 if (mode == BLKmode)
6623 size_tree = TYPE_SIZE (TREE_TYPE (exp));
6625 *pbitsize = GET_MODE_BITSIZE (mode);
6630 if (! host_integerp (size_tree, 1))
6631 mode = BLKmode, *pbitsize = -1;
6633 *pbitsize = tree_low_cst (size_tree, 1);
6636 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6637 and find the ultimate containing object. */
6640 switch (TREE_CODE (exp))
6643 bit_offset += tree_to_double_int (TREE_OPERAND (exp, 2));
6648 tree field = TREE_OPERAND (exp, 1);
6649 tree this_offset = component_ref_field_offset (exp);
6651 /* If this field hasn't been filled in yet, don't go past it.
6652 This should only happen when folding expressions made during
6653 type construction. */
6654 if (this_offset == 0)
6657 offset = size_binop (PLUS_EXPR, offset, this_offset);
6658 bit_offset += tree_to_double_int (DECL_FIELD_BIT_OFFSET (field));
6660 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6665 case ARRAY_RANGE_REF:
6667 tree index = TREE_OPERAND (exp, 1);
6668 tree low_bound = array_ref_low_bound (exp);
6669 tree unit_size = array_ref_element_size (exp);
6671 /* We assume all arrays have sizes that are a multiple of a byte.
6672 First subtract the lower bound, if any, in the type of the
6673 index, then convert to sizetype and multiply by the size of
6674 the array element. */
6675 if (! integer_zerop (low_bound))
6676 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
6679 offset = size_binop (PLUS_EXPR, offset,
6680 size_binop (MULT_EXPR,
6681 fold_convert (sizetype, index),
6690 bit_offset += double_int::from_uhwi (*pbitsize);
6693 case VIEW_CONVERT_EXPR:
6694 if (keep_aligning && STRICT_ALIGNMENT
6695 && (TYPE_ALIGN (TREE_TYPE (exp))
6696 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
6697 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
6698 < BIGGEST_ALIGNMENT)
6699 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
6700 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
6705 /* Hand back the decl for MEM[&decl, off]. */
6706 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)
6708 tree off = TREE_OPERAND (exp, 1);
6709 if (!integer_zerop (off))
6711 double_int boff, coff = mem_ref_offset (exp);
6712 boff = coff.alshift (BITS_PER_UNIT == 8
6713 ? 3 : exact_log2 (BITS_PER_UNIT),
6714 HOST_BITS_PER_DOUBLE_INT);
6717 exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
6725 /* If any reference in the chain is volatile, the effect is volatile. */
6726 if (TREE_THIS_VOLATILE (exp))
6729 exp = TREE_OPERAND (exp, 0);
6733 /* If OFFSET is constant, see if we can return the whole thing as a
6734 constant bit position. Make sure to handle overflow during
6736 if (TREE_CODE (offset) == INTEGER_CST)
6738 double_int tem = tree_to_double_int (offset);
6739 tem = tem.sext (TYPE_PRECISION (sizetype));
6740 tem = tem.alshift (BITS_PER_UNIT == 8 ? 3 : exact_log2 (BITS_PER_UNIT),
6741 HOST_BITS_PER_DOUBLE_INT);
6743 if (tem.fits_shwi ())
6745 *pbitpos = tem.to_shwi ();
6746 *poffset = offset = NULL_TREE;
6750 /* Otherwise, split it up. */
6753 /* Avoid returning a negative bitpos as this may wreak havoc later. */
6754 if (bit_offset.is_negative ())
6757 = double_int::mask (BITS_PER_UNIT == 8
6758 ? 3 : exact_log2 (BITS_PER_UNIT));
6759 double_int tem = bit_offset.and_not (mask);
6760 /* TEM is the bitpos rounded to BITS_PER_UNIT towards -Inf.
6761 Subtract it to BIT_OFFSET and add it (scaled) to OFFSET. */
6763 tem = tem.arshift (BITS_PER_UNIT == 8
6764 ? 3 : exact_log2 (BITS_PER_UNIT),
6765 HOST_BITS_PER_DOUBLE_INT);
6766 offset = size_binop (PLUS_EXPR, offset,
6767 double_int_to_tree (sizetype, tem));
6770 *pbitpos = bit_offset.to_shwi ();
6774 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6775 if (mode == VOIDmode
6777 && (*pbitpos % BITS_PER_UNIT) == 0
6778 && (*pbitsize % BITS_PER_UNIT) == 0)
6786 /* Return a tree of sizetype representing the size, in bytes, of the element
6787 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6790 array_ref_element_size (tree exp)
6792 tree aligned_size = TREE_OPERAND (exp, 3);
6793 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6794 location_t loc = EXPR_LOCATION (exp);
6796 /* If a size was specified in the ARRAY_REF, it's the size measured
6797 in alignment units of the element type. So multiply by that value. */
6800 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6801 sizetype from another type of the same width and signedness. */
6802 if (TREE_TYPE (aligned_size) != sizetype)
6803 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
6804 return size_binop_loc (loc, MULT_EXPR, aligned_size,
6805 size_int (TYPE_ALIGN_UNIT (elmt_type)));
6808 /* Otherwise, take the size from that of the element type. Substitute
6809 any PLACEHOLDER_EXPR that we have. */
6811 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
6814 /* Return a tree representing the lower bound of the array mentioned in
6815 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6818 array_ref_low_bound (tree exp)
6820 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6822 /* If a lower bound is specified in EXP, use it. */
6823 if (TREE_OPERAND (exp, 2))
6824 return TREE_OPERAND (exp, 2);
6826 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6827 substituting for a PLACEHOLDER_EXPR as needed. */
6828 if (domain_type && TYPE_MIN_VALUE (domain_type))
6829 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
6831 /* Otherwise, return a zero of the appropriate type. */
6832 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
6835 /* Returns true if REF is an array reference to an array at the end of
6836 a structure. If this is the case, the array may be allocated larger
6837 than its upper bound implies. */
6840 array_at_struct_end_p (tree ref)
6842 if (TREE_CODE (ref) != ARRAY_REF
6843 && TREE_CODE (ref) != ARRAY_RANGE_REF)
6846 while (handled_component_p (ref))
6848 /* If the reference chain contains a component reference to a
6849 non-union type and there follows another field the reference
6850 is not at the end of a structure. */
6851 if (TREE_CODE (ref) == COMPONENT_REF
6852 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref, 0))) == RECORD_TYPE)
6854 tree nextf = DECL_CHAIN (TREE_OPERAND (ref, 1));
6855 while (nextf && TREE_CODE (nextf) != FIELD_DECL)
6856 nextf = DECL_CHAIN (nextf);
6861 ref = TREE_OPERAND (ref, 0);
6864 /* If the reference is based on a declared entity, the size of the array
6865 is constrained by its given domain. */
6872 /* Return a tree representing the upper bound of the array mentioned in
6873 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6876 array_ref_up_bound (tree exp)
6878 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6880 /* If there is a domain type and it has an upper bound, use it, substituting
6881 for a PLACEHOLDER_EXPR as needed. */
6882 if (domain_type && TYPE_MAX_VALUE (domain_type))
6883 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
6885 /* Otherwise fail. */
6889 /* Return a tree representing the offset, in bytes, of the field referenced
6890 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6893 component_ref_field_offset (tree exp)
6895 tree aligned_offset = TREE_OPERAND (exp, 2);
6896 tree field = TREE_OPERAND (exp, 1);
6897 location_t loc = EXPR_LOCATION (exp);
6899 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6900 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6904 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6905 sizetype from another type of the same width and signedness. */
6906 if (TREE_TYPE (aligned_offset) != sizetype)
6907 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
6908 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
6909 size_int (DECL_OFFSET_ALIGN (field)
6913 /* Otherwise, take the offset from that of the field. Substitute
6914 any PLACEHOLDER_EXPR that we have. */
6916 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
6919 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6921 static unsigned HOST_WIDE_INT
6922 target_align (const_tree target)
6924 /* We might have a chain of nested references with intermediate misaligning
6925 bitfields components, so need to recurse to find out. */
6927 unsigned HOST_WIDE_INT this_align, outer_align;
6929 switch (TREE_CODE (target))
6935 this_align = DECL_ALIGN (TREE_OPERAND (target, 1));
6936 outer_align = target_align (TREE_OPERAND (target, 0));
6937 return MIN (this_align, outer_align);
6940 case ARRAY_RANGE_REF:
6941 this_align = TYPE_ALIGN (TREE_TYPE (target));
6942 outer_align = target_align (TREE_OPERAND (target, 0));
6943 return MIN (this_align, outer_align);
6946 case NON_LVALUE_EXPR:
6947 case VIEW_CONVERT_EXPR:
6948 this_align = TYPE_ALIGN (TREE_TYPE (target));
6949 outer_align = target_align (TREE_OPERAND (target, 0));
6950 return MAX (this_align, outer_align);
6953 return TYPE_ALIGN (TREE_TYPE (target));
6958 /* Given an rtx VALUE that may contain additions and multiplications, return
6959 an equivalent value that just refers to a register, memory, or constant.
6960 This is done by generating instructions to perform the arithmetic and
6961 returning a pseudo-register containing the value.
6963 The returned value may be a REG, SUBREG, MEM or constant. */
6966 force_operand (rtx value, rtx target)
6969 /* Use subtarget as the target for operand 0 of a binary operation. */
6970 rtx subtarget = get_subtarget (target);
6971 enum rtx_code code = GET_CODE (value);
6973 /* Check for subreg applied to an expression produced by loop optimizer. */
6975 && !REG_P (SUBREG_REG (value))
6976 && !MEM_P (SUBREG_REG (value)))
6979 = simplify_gen_subreg (GET_MODE (value),
6980 force_reg (GET_MODE (SUBREG_REG (value)),
6981 force_operand (SUBREG_REG (value),
6983 GET_MODE (SUBREG_REG (value)),
6984 SUBREG_BYTE (value));
6985 code = GET_CODE (value);
6988 /* Check for a PIC address load. */
6989 if ((code == PLUS || code == MINUS)
6990 && XEXP (value, 0) == pic_offset_table_rtx
6991 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
6992 || GET_CODE (XEXP (value, 1)) == LABEL_REF
6993 || GET_CODE (XEXP (value, 1)) == CONST))
6996 subtarget = gen_reg_rtx (GET_MODE (value));
6997 emit_move_insn (subtarget, value);
7001 if (ARITHMETIC_P (value))
7003 op2 = XEXP (value, 1);
7004 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
7006 if (code == MINUS && CONST_INT_P (op2))
7009 op2 = negate_rtx (GET_MODE (value), op2);
7012 /* Check for an addition with OP2 a constant integer and our first
7013 operand a PLUS of a virtual register and something else. In that
7014 case, we want to emit the sum of the virtual register and the
7015 constant first and then add the other value. This allows virtual
7016 register instantiation to simply modify the constant rather than
7017 creating another one around this addition. */
7018 if (code == PLUS && CONST_INT_P (op2)
7019 && GET_CODE (XEXP (value, 0)) == PLUS
7020 && REG_P (XEXP (XEXP (value, 0), 0))
7021 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
7022 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
7024 rtx temp = expand_simple_binop (GET_MODE (value), code,
7025 XEXP (XEXP (value, 0), 0), op2,
7026 subtarget, 0, OPTAB_LIB_WIDEN);
7027 return expand_simple_binop (GET_MODE (value), code, temp,
7028 force_operand (XEXP (XEXP (value,
7030 target, 0, OPTAB_LIB_WIDEN);
7033 op1 = force_operand (XEXP (value, 0), subtarget);
7034 op2 = force_operand (op2, NULL_RTX);
7038 return expand_mult (GET_MODE (value), op1, op2, target, 1);
7040 if (!INTEGRAL_MODE_P (GET_MODE (value)))
7041 return expand_simple_binop (GET_MODE (value), code, op1, op2,
7042 target, 1, OPTAB_LIB_WIDEN);
7044 return expand_divmod (0,
7045 FLOAT_MODE_P (GET_MODE (value))
7046 ? RDIV_EXPR : TRUNC_DIV_EXPR,
7047 GET_MODE (value), op1, op2, target, 0);
7049 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
7052 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
7055 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
7058 return expand_simple_binop (GET_MODE (value), code, op1, op2,
7059 target, 0, OPTAB_LIB_WIDEN);
7061 return expand_simple_binop (GET_MODE (value), code, op1, op2,
7062 target, 1, OPTAB_LIB_WIDEN);
7065 if (UNARY_P (value))
7068 target = gen_reg_rtx (GET_MODE (value));
7069 op1 = force_operand (XEXP (value, 0), NULL_RTX);
7076 case FLOAT_TRUNCATE:
7077 convert_move (target, op1, code == ZERO_EXTEND);
7082 expand_fix (target, op1, code == UNSIGNED_FIX);
7086 case UNSIGNED_FLOAT:
7087 expand_float (target, op1, code == UNSIGNED_FLOAT);
7091 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
7095 #ifdef INSN_SCHEDULING
7096 /* On machines that have insn scheduling, we want all memory reference to be
7097 explicit, so we need to deal with such paradoxical SUBREGs. */
7098 if (paradoxical_subreg_p (value) && MEM_P (SUBREG_REG (value)))
7100 = simplify_gen_subreg (GET_MODE (value),
7101 force_reg (GET_MODE (SUBREG_REG (value)),
7102 force_operand (SUBREG_REG (value),
7104 GET_MODE (SUBREG_REG (value)),
7105 SUBREG_BYTE (value));
7111 /* Subroutine of expand_expr: return nonzero iff there is no way that
7112 EXP can reference X, which is being modified. TOP_P is nonzero if this
7113 call is going to be used to determine whether we need a temporary
7114 for EXP, as opposed to a recursive call to this function.
7116 It is always safe for this routine to return zero since it merely
7117 searches for optimization opportunities. */
7120 safe_from_p (const_rtx x, tree exp, int top_p)
7126 /* If EXP has varying size, we MUST use a target since we currently
7127 have no way of allocating temporaries of variable size
7128 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
7129 So we assume here that something at a higher level has prevented a
7130 clash. This is somewhat bogus, but the best we can do. Only
7131 do this when X is BLKmode and when we are at the top level. */
7132 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
7133 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
7134 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
7135 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
7136 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
7138 && GET_MODE (x) == BLKmode)
7139 /* If X is in the outgoing argument area, it is always safe. */
7141 && (XEXP (x, 0) == virtual_outgoing_args_rtx
7142 || (GET_CODE (XEXP (x, 0)) == PLUS
7143 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
7146 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
7147 find the underlying pseudo. */
7148 if (GET_CODE (x) == SUBREG)
7151 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
7155 /* Now look at our tree code and possibly recurse. */
7156 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
7158 case tcc_declaration:
7159 exp_rtl = DECL_RTL_IF_SET (exp);
7165 case tcc_exceptional:
7166 if (TREE_CODE (exp) == TREE_LIST)
7170 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
7172 exp = TREE_CHAIN (exp);
7175 if (TREE_CODE (exp) != TREE_LIST)
7176 return safe_from_p (x, exp, 0);
7179 else if (TREE_CODE (exp) == CONSTRUCTOR)
7181 constructor_elt *ce;
7182 unsigned HOST_WIDE_INT idx;
7184 FOR_EACH_VEC_ELT (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce)
7185 if ((ce->index != NULL_TREE && !safe_from_p (x, ce->index, 0))
7186 || !safe_from_p (x, ce->value, 0))
7190 else if (TREE_CODE (exp) == ERROR_MARK)
7191 return 1; /* An already-visited SAVE_EXPR? */
7196 /* The only case we look at here is the DECL_INITIAL inside a
7198 return (TREE_CODE (exp) != DECL_EXPR
7199 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
7200 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
7201 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
7204 case tcc_comparison:
7205 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
7210 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
7212 case tcc_expression:
7215 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
7216 the expression. If it is set, we conflict iff we are that rtx or
7217 both are in memory. Otherwise, we check all operands of the
7218 expression recursively. */
7220 switch (TREE_CODE (exp))
7223 /* If the operand is static or we are static, we can't conflict.
7224 Likewise if we don't conflict with the operand at all. */
7225 if (staticp (TREE_OPERAND (exp, 0))
7226 || TREE_STATIC (exp)
7227 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
7230 /* Otherwise, the only way this can conflict is if we are taking
7231 the address of a DECL a that address if part of X, which is
7233 exp = TREE_OPERAND (exp, 0);
7236 if (!DECL_RTL_SET_P (exp)
7237 || !MEM_P (DECL_RTL (exp)))
7240 exp_rtl = XEXP (DECL_RTL (exp), 0);
7246 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
7247 get_alias_set (exp)))
7252 /* Assume that the call will clobber all hard registers and
7254 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
7259 case WITH_CLEANUP_EXPR:
7260 case CLEANUP_POINT_EXPR:
7261 /* Lowered by gimplify.c. */
7265 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
7271 /* If we have an rtx, we do not need to scan our operands. */
7275 nops = TREE_OPERAND_LENGTH (exp);
7276 for (i = 0; i < nops; i++)
7277 if (TREE_OPERAND (exp, i) != 0
7278 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
7284 /* Should never get a type here. */
7288 /* If we have an rtl, find any enclosed object. Then see if we conflict
7292 if (GET_CODE (exp_rtl) == SUBREG)
7294 exp_rtl = SUBREG_REG (exp_rtl);
7296 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
7300 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
7301 are memory and they conflict. */
7302 return ! (rtx_equal_p (x, exp_rtl)
7303 || (MEM_P (x) && MEM_P (exp_rtl)
7304 && true_dependence (exp_rtl, VOIDmode, x)));
7307 /* If we reach here, it is safe. */
7312 /* Return the highest power of two that EXP is known to be a multiple of.
7313 This is used in updating alignment of MEMs in array references. */
7315 unsigned HOST_WIDE_INT
7316 highest_pow2_factor (const_tree exp)
7318 unsigned HOST_WIDE_INT c0, c1;
7320 switch (TREE_CODE (exp))
7323 /* We can find the lowest bit that's a one. If the low
7324 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
7325 We need to handle this case since we can find it in a COND_EXPR,
7326 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
7327 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
7329 if (TREE_OVERFLOW (exp))
7330 return BIGGEST_ALIGNMENT;
7333 /* Note: tree_low_cst is intentionally not used here,
7334 we don't care about the upper bits. */
7335 c0 = TREE_INT_CST_LOW (exp);
7337 return c0 ? c0 : BIGGEST_ALIGNMENT;
7341 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
7342 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
7343 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
7344 return MIN (c0, c1);
7347 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
7348 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
7351 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
7353 if (integer_pow2p (TREE_OPERAND (exp, 1))
7354 && host_integerp (TREE_OPERAND (exp, 1), 1))
7356 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
7357 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
7358 return MAX (1, c0 / c1);
7363 /* The highest power of two of a bit-and expression is the maximum of
7364 that of its operands. We typically get here for a complex LHS and
7365 a constant negative power of two on the RHS to force an explicit
7366 alignment, so don't bother looking at the LHS. */
7367 return highest_pow2_factor (TREE_OPERAND (exp, 1));
7371 return highest_pow2_factor (TREE_OPERAND (exp, 0));
7374 return highest_pow2_factor (TREE_OPERAND (exp, 1));
7377 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
7378 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
7379 return MIN (c0, c1);
7388 /* Similar, except that the alignment requirements of TARGET are
7389 taken into account. Assume it is at least as aligned as its
7390 type, unless it is a COMPONENT_REF in which case the layout of
7391 the structure gives the alignment. */
7393 static unsigned HOST_WIDE_INT
7394 highest_pow2_factor_for_target (const_tree target, const_tree exp)
7396 unsigned HOST_WIDE_INT talign = target_align (target) / BITS_PER_UNIT;
7397 unsigned HOST_WIDE_INT factor = highest_pow2_factor (exp);
7399 return MAX (factor, talign);
7402 #ifdef HAVE_conditional_move
7403 /* Convert the tree comparison code TCODE to the rtl one where the
7404 signedness is UNSIGNEDP. */
7406 static enum rtx_code
7407 convert_tree_comp_to_rtx (enum tree_code tcode, int unsignedp)
7419 code = unsignedp ? LTU : LT;
7422 code = unsignedp ? LEU : LE;
7425 code = unsignedp ? GTU : GT;
7428 code = unsignedp ? GEU : GE;
7430 case UNORDERED_EXPR:
7462 /* Subroutine of expand_expr. Expand the two operands of a binary
7463 expression EXP0 and EXP1 placing the results in OP0 and OP1.
7464 The value may be stored in TARGET if TARGET is nonzero. The
7465 MODIFIER argument is as documented by expand_expr. */
7468 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
7469 enum expand_modifier modifier)
7471 if (! safe_from_p (target, exp1, 1))
7473 if (operand_equal_p (exp0, exp1, 0))
7475 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
7476 *op1 = copy_rtx (*op0);
7480 /* If we need to preserve evaluation order, copy exp0 into its own
7481 temporary variable so that it can't be clobbered by exp1. */
7482 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
7483 exp0 = save_expr (exp0);
7484 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
7485 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
7490 /* Return a MEM that contains constant EXP. DEFER is as for
7491 output_constant_def and MODIFIER is as for expand_expr. */
7494 expand_expr_constant (tree exp, int defer, enum expand_modifier modifier)
7498 mem = output_constant_def (exp, defer);
7499 if (modifier != EXPAND_INITIALIZER)
7500 mem = use_anchored_address (mem);
7504 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
7505 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7508 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
7509 enum expand_modifier modifier, addr_space_t as)
7511 rtx result, subtarget;
7513 HOST_WIDE_INT bitsize, bitpos;
7514 int volatilep, unsignedp;
7515 enum machine_mode mode1;
7517 /* If we are taking the address of a constant and are at the top level,
7518 we have to use output_constant_def since we can't call force_const_mem
7520 /* ??? This should be considered a front-end bug. We should not be
7521 generating ADDR_EXPR of something that isn't an LVALUE. The only
7522 exception here is STRING_CST. */
7523 if (CONSTANT_CLASS_P (exp))
7525 result = XEXP (expand_expr_constant (exp, 0, modifier), 0);
7526 if (modifier < EXPAND_SUM)
7527 result = force_operand (result, target);
7531 /* Everything must be something allowed by is_gimple_addressable. */
7532 switch (TREE_CODE (exp))
7535 /* This case will happen via recursion for &a->b. */
7536 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
7540 tree tem = TREE_OPERAND (exp, 0);
7541 if (!integer_zerop (TREE_OPERAND (exp, 1)))
7542 tem = fold_build_pointer_plus (tem, TREE_OPERAND (exp, 1));
7543 return expand_expr (tem, target, tmode, modifier);
7547 /* Expand the initializer like constants above. */
7548 result = XEXP (expand_expr_constant (DECL_INITIAL (exp),
7550 if (modifier < EXPAND_SUM)
7551 result = force_operand (result, target);
7555 /* The real part of the complex number is always first, therefore
7556 the address is the same as the address of the parent object. */
7559 inner = TREE_OPERAND (exp, 0);
7563 /* The imaginary part of the complex number is always second.
7564 The expression is therefore always offset by the size of the
7567 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
7568 inner = TREE_OPERAND (exp, 0);
7572 /* If the object is a DECL, then expand it for its rtl. Don't bypass
7573 expand_expr, as that can have various side effects; LABEL_DECLs for
7574 example, may not have their DECL_RTL set yet. Expand the rtl of
7575 CONSTRUCTORs too, which should yield a memory reference for the
7576 constructor's contents. Assume language specific tree nodes can
7577 be expanded in some interesting way. */
7578 gcc_assert (TREE_CODE (exp) < LAST_AND_UNUSED_TREE_CODE);
7580 || TREE_CODE (exp) == CONSTRUCTOR
7581 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
7583 result = expand_expr (exp, target, tmode,
7584 modifier == EXPAND_INITIALIZER
7585 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
7587 /* If the DECL isn't in memory, then the DECL wasn't properly
7588 marked TREE_ADDRESSABLE, which will be either a front-end
7589 or a tree optimizer bug. */
7591 if (TREE_ADDRESSABLE (exp)
7593 && ! targetm.calls.allocate_stack_slots_for_args())
7595 error ("local frame unavailable (naked function?)");
7599 gcc_assert (MEM_P (result));
7600 result = XEXP (result, 0);
7602 /* ??? Is this needed anymore? */
7604 TREE_USED (exp) = 1;
7606 if (modifier != EXPAND_INITIALIZER
7607 && modifier != EXPAND_CONST_ADDRESS
7608 && modifier != EXPAND_SUM)
7609 result = force_operand (result, target);
7613 /* Pass FALSE as the last argument to get_inner_reference although
7614 we are expanding to RTL. The rationale is that we know how to
7615 handle "aligning nodes" here: we can just bypass them because
7616 they won't change the final object whose address will be returned
7617 (they actually exist only for that purpose). */
7618 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
7619 &mode1, &unsignedp, &volatilep, false);
7623 /* We must have made progress. */
7624 gcc_assert (inner != exp);
7626 subtarget = offset || bitpos ? NULL_RTX : target;
7627 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
7628 inner alignment, force the inner to be sufficiently aligned. */
7629 if (CONSTANT_CLASS_P (inner)
7630 && TYPE_ALIGN (TREE_TYPE (inner)) < TYPE_ALIGN (TREE_TYPE (exp)))
7632 inner = copy_node (inner);
7633 TREE_TYPE (inner) = copy_node (TREE_TYPE (inner));
7634 TYPE_ALIGN (TREE_TYPE (inner)) = TYPE_ALIGN (TREE_TYPE (exp));
7635 TYPE_USER_ALIGN (TREE_TYPE (inner)) = 1;
7637 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier, as);
7643 if (modifier != EXPAND_NORMAL)
7644 result = force_operand (result, NULL);
7645 tmp = expand_expr (offset, NULL_RTX, tmode,
7646 modifier == EXPAND_INITIALIZER
7647 ? EXPAND_INITIALIZER : EXPAND_NORMAL);
7649 result = convert_memory_address_addr_space (tmode, result, as);
7650 tmp = convert_memory_address_addr_space (tmode, tmp, as);
7652 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7653 result = simplify_gen_binary (PLUS, tmode, result, tmp);
7656 subtarget = bitpos ? NULL_RTX : target;
7657 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
7658 1, OPTAB_LIB_WIDEN);
7664 /* Someone beforehand should have rejected taking the address
7665 of such an object. */
7666 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
7668 result = convert_memory_address_addr_space (tmode, result, as);
7669 result = plus_constant (tmode, result, bitpos / BITS_PER_UNIT);
7670 if (modifier < EXPAND_SUM)
7671 result = force_operand (result, target);
7677 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
7678 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7681 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
7682 enum expand_modifier modifier)
7684 addr_space_t as = ADDR_SPACE_GENERIC;
7685 enum machine_mode address_mode = Pmode;
7686 enum machine_mode pointer_mode = ptr_mode;
7687 enum machine_mode rmode;
7690 /* Target mode of VOIDmode says "whatever's natural". */
7691 if (tmode == VOIDmode)
7692 tmode = TYPE_MODE (TREE_TYPE (exp));
7694 if (POINTER_TYPE_P (TREE_TYPE (exp)))
7696 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
7697 address_mode = targetm.addr_space.address_mode (as);
7698 pointer_mode = targetm.addr_space.pointer_mode (as);
7701 /* We can get called with some Weird Things if the user does silliness
7702 like "(short) &a". In that case, convert_memory_address won't do
7703 the right thing, so ignore the given target mode. */
7704 if (tmode != address_mode && tmode != pointer_mode)
7705 tmode = address_mode;
7707 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
7708 tmode, modifier, as);
7710 /* Despite expand_expr claims concerning ignoring TMODE when not
7711 strictly convenient, stuff breaks if we don't honor it. Note
7712 that combined with the above, we only do this for pointer modes. */
7713 rmode = GET_MODE (result);
7714 if (rmode == VOIDmode)
7717 result = convert_memory_address_addr_space (tmode, result, as);
7722 /* Generate code for computing CONSTRUCTOR EXP.
7723 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7724 is TRUE, instead of creating a temporary variable in memory
7725 NULL is returned and the caller needs to handle it differently. */
7728 expand_constructor (tree exp, rtx target, enum expand_modifier modifier,
7729 bool avoid_temp_mem)
7731 tree type = TREE_TYPE (exp);
7732 enum machine_mode mode = TYPE_MODE (type);
7734 /* Try to avoid creating a temporary at all. This is possible
7735 if all of the initializer is zero.
7736 FIXME: try to handle all [0..255] initializers we can handle
7738 if (TREE_STATIC (exp)
7739 && !TREE_ADDRESSABLE (exp)
7740 && target != 0 && mode == BLKmode
7741 && all_zeros_p (exp))
7743 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
7747 /* All elts simple constants => refer to a constant in memory. But
7748 if this is a non-BLKmode mode, let it store a field at a time
7749 since that should make a CONST_INT or CONST_DOUBLE when we
7750 fold. Likewise, if we have a target we can use, it is best to
7751 store directly into the target unless the type is large enough
7752 that memcpy will be used. If we are making an initializer and
7753 all operands are constant, put it in memory as well.
7755 FIXME: Avoid trying to fill vector constructors piece-meal.
7756 Output them with output_constant_def below unless we're sure
7757 they're zeros. This should go away when vector initializers
7758 are treated like VECTOR_CST instead of arrays. */
7759 if ((TREE_STATIC (exp)
7760 && ((mode == BLKmode
7761 && ! (target != 0 && safe_from_p (target, exp, 1)))
7762 || TREE_ADDRESSABLE (exp)
7763 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7764 && (! MOVE_BY_PIECES_P
7765 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7767 && ! mostly_zeros_p (exp))))
7768 || ((modifier == EXPAND_INITIALIZER || modifier == EXPAND_CONST_ADDRESS)
7769 && TREE_CONSTANT (exp)))
7776 constructor = expand_expr_constant (exp, 1, modifier);
7778 if (modifier != EXPAND_CONST_ADDRESS
7779 && modifier != EXPAND_INITIALIZER
7780 && modifier != EXPAND_SUM)
7781 constructor = validize_mem (constructor);
7786 /* Handle calls that pass values in multiple non-contiguous
7787 locations. The Irix 6 ABI has examples of this. */
7788 if (target == 0 || ! safe_from_p (target, exp, 1)
7789 || GET_CODE (target) == PARALLEL || modifier == EXPAND_STACK_PARM)
7795 = assign_temp (build_qualified_type (type, (TYPE_QUALS (type)
7796 | (TREE_READONLY (exp)
7797 * TYPE_QUAL_CONST))),
7798 TREE_ADDRESSABLE (exp), 1);
7801 store_constructor (exp, target, 0, int_expr_size (exp));
7806 /* expand_expr: generate code for computing expression EXP.
7807 An rtx for the computed value is returned. The value is never null.
7808 In the case of a void EXP, const0_rtx is returned.
7810 The value may be stored in TARGET if TARGET is nonzero.
7811 TARGET is just a suggestion; callers must assume that
7812 the rtx returned may not be the same as TARGET.
7814 If TARGET is CONST0_RTX, it means that the value will be ignored.
7816 If TMODE is not VOIDmode, it suggests generating the
7817 result in mode TMODE. But this is done only when convenient.
7818 Otherwise, TMODE is ignored and the value generated in its natural mode.
7819 TMODE is just a suggestion; callers must assume that
7820 the rtx returned may not have mode TMODE.
7822 Note that TARGET may have neither TMODE nor MODE. In that case, it
7823 probably will not be used.
7825 If MODIFIER is EXPAND_SUM then when EXP is an addition
7826 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7827 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7828 products as above, or REG or MEM, or constant.
7829 Ordinarily in such cases we would output mul or add instructions
7830 and then return a pseudo reg containing the sum.
7832 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7833 it also marks a label as absolutely required (it can't be dead).
7834 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7835 This is used for outputting expressions used in initializers.
7837 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7838 with a constant address even if that address is not normally legitimate.
7839 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7841 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7842 a call parameter. Such targets require special care as we haven't yet
7843 marked TARGET so that it's safe from being trashed by libcalls. We
7844 don't want to use TARGET for anything but the final result;
7845 Intermediate values must go elsewhere. Additionally, calls to
7846 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7848 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7849 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7850 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7851 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7855 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
7856 enum expand_modifier modifier, rtx *alt_rtl)
7860 /* Handle ERROR_MARK before anybody tries to access its type. */
7861 if (TREE_CODE (exp) == ERROR_MARK
7862 || (TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK))
7864 ret = CONST0_RTX (tmode);
7865 return ret ? ret : const0_rtx;
7868 /* If this is an expression of some kind and it has an associated line
7869 number, then emit the line number before expanding the expression.
7871 We need to save and restore the file and line information so that
7872 errors discovered during expansion are emitted with the right
7873 information. It would be better of the diagnostic routines
7874 used the file/line information embedded in the tree nodes rather
7876 if (cfun && EXPR_HAS_LOCATION (exp))
7878 location_t saved_location = input_location;
7879 location_t saved_curr_loc = curr_insn_location ();
7880 input_location = EXPR_LOCATION (exp);
7881 set_curr_insn_location (input_location);
7883 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7885 input_location = saved_location;
7886 set_curr_insn_location (saved_curr_loc);
7890 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7896 /* Try to expand the conditional expression which is represented by
7897 TREEOP0 ? TREEOP1 : TREEOP2 using conditonal moves. If succeseds
7898 return the rtl reg which repsents the result. Otherwise return
7902 expand_cond_expr_using_cmove (tree treeop0 ATTRIBUTE_UNUSED,
7903 tree treeop1 ATTRIBUTE_UNUSED,
7904 tree treeop2 ATTRIBUTE_UNUSED)
7906 #ifdef HAVE_conditional_move
7908 rtx op00, op01, op1, op2;
7909 enum rtx_code comparison_code;
7910 enum machine_mode comparison_mode;
7913 tree type = TREE_TYPE (treeop1);
7914 int unsignedp = TYPE_UNSIGNED (type);
7915 enum machine_mode mode = TYPE_MODE (type);
7917 temp = assign_temp (type, 0, 1);
7919 /* If we cannot do a conditional move on the mode, try doing it
7920 with the promoted mode. */
7921 if (!can_conditionally_move_p (mode))
7922 mode = promote_mode (type, mode, &unsignedp);
7924 if (!can_conditionally_move_p (mode))
7928 expand_operands (treeop1, treeop2,
7929 temp, &op1, &op2, EXPAND_NORMAL);
7931 if (TREE_CODE (treeop0) == SSA_NAME
7932 && (srcstmt = get_def_for_expr_class (treeop0, tcc_comparison)))
7934 tree type = TREE_TYPE (gimple_assign_rhs1 (srcstmt));
7935 enum tree_code cmpcode = gimple_assign_rhs_code (srcstmt);
7936 op00 = expand_normal (gimple_assign_rhs1 (srcstmt));
7937 op01 = expand_normal (gimple_assign_rhs2 (srcstmt));
7938 comparison_mode = TYPE_MODE (type);
7939 unsignedp = TYPE_UNSIGNED (type);
7940 comparison_code = convert_tree_comp_to_rtx (cmpcode, unsignedp);
7942 else if (TREE_CODE_CLASS (TREE_CODE (treeop0)) == tcc_comparison)
7944 tree type = TREE_TYPE (TREE_OPERAND (treeop0, 0));
7945 enum tree_code cmpcode = TREE_CODE (treeop0);
7946 op00 = expand_normal (TREE_OPERAND (treeop0, 0));
7947 op01 = expand_normal (TREE_OPERAND (treeop0, 1));
7948 unsignedp = TYPE_UNSIGNED (type);
7949 comparison_mode = TYPE_MODE (type);
7950 comparison_code = convert_tree_comp_to_rtx (cmpcode, unsignedp);
7954 op00 = expand_normal (treeop0);
7956 comparison_code = NE;
7957 comparison_mode = TYPE_MODE (TREE_TYPE (treeop0));
7960 if (GET_MODE (op1) != mode)
7961 op1 = gen_lowpart (mode, op1);
7963 if (GET_MODE (op2) != mode)
7964 op2 = gen_lowpart (mode, op2);
7966 /* Try to emit the conditional move. */
7967 insn = emit_conditional_move (temp, comparison_code,
7968 op00, op01, comparison_mode,
7972 /* If we could do the conditional move, emit the sequence,
7976 rtx seq = get_insns ();
7982 /* Otherwise discard the sequence and fall back to code with
7990 expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
7991 enum expand_modifier modifier)
7993 rtx op0, op1, op2, temp;
7996 enum machine_mode mode;
7997 enum tree_code code = ops->code;
7999 rtx subtarget, original_target;
8001 bool reduce_bit_field;
8002 location_t loc = ops->location;
8003 tree treeop0, treeop1, treeop2;
8004 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
8005 ? reduce_to_bit_field_precision ((expr), \
8011 mode = TYPE_MODE (type);
8012 unsignedp = TYPE_UNSIGNED (type);
8018 /* We should be called only on simple (binary or unary) expressions,
8019 exactly those that are valid in gimple expressions that aren't
8020 GIMPLE_SINGLE_RHS (or invalid). */
8021 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS
8022 || get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS
8023 || get_gimple_rhs_class (code) == GIMPLE_TERNARY_RHS);
8025 ignore = (target == const0_rtx
8026 || ((CONVERT_EXPR_CODE_P (code)
8027 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
8028 && TREE_CODE (type) == VOID_TYPE));
8030 /* We should be called only if we need the result. */
8031 gcc_assert (!ignore);
8033 /* An operation in what may be a bit-field type needs the
8034 result to be reduced to the precision of the bit-field type,
8035 which is narrower than that of the type's mode. */
8036 reduce_bit_field = (INTEGRAL_TYPE_P (type)
8037 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
8039 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
8042 /* Use subtarget as the target for operand 0 of a binary operation. */
8043 subtarget = get_subtarget (target);
8044 original_target = target;
8048 case NON_LVALUE_EXPR:
8051 if (treeop0 == error_mark_node)
8054 if (TREE_CODE (type) == UNION_TYPE)
8056 tree valtype = TREE_TYPE (treeop0);
8058 /* If both input and output are BLKmode, this conversion isn't doing
8059 anything except possibly changing memory attribute. */
8060 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
8062 rtx result = expand_expr (treeop0, target, tmode,
8065 result = copy_rtx (result);
8066 set_mem_attributes (result, type, 0);
8072 if (TYPE_MODE (type) != BLKmode)
8073 target = gen_reg_rtx (TYPE_MODE (type));
8075 target = assign_temp (type, 1, 1);
8079 /* Store data into beginning of memory target. */
8080 store_expr (treeop0,
8081 adjust_address (target, TYPE_MODE (valtype), 0),
8082 modifier == EXPAND_STACK_PARM,
8087 gcc_assert (REG_P (target));
8089 /* Store this field into a union of the proper type. */
8090 store_field (target,
8091 MIN ((int_size_in_bytes (TREE_TYPE
8094 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
8095 0, 0, 0, TYPE_MODE (valtype), treeop0,
8099 /* Return the entire union. */
8103 if (mode == TYPE_MODE (TREE_TYPE (treeop0)))
8105 op0 = expand_expr (treeop0, target, VOIDmode,
8108 /* If the signedness of the conversion differs and OP0 is
8109 a promoted SUBREG, clear that indication since we now
8110 have to do the proper extension. */
8111 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)) != unsignedp
8112 && GET_CODE (op0) == SUBREG)
8113 SUBREG_PROMOTED_VAR_P (op0) = 0;
8115 return REDUCE_BIT_FIELD (op0);
8118 op0 = expand_expr (treeop0, NULL_RTX, mode,
8119 modifier == EXPAND_SUM ? EXPAND_NORMAL : modifier);
8120 if (GET_MODE (op0) == mode)
8123 /* If OP0 is a constant, just convert it into the proper mode. */
8124 else if (CONSTANT_P (op0))
8126 tree inner_type = TREE_TYPE (treeop0);
8127 enum machine_mode inner_mode = GET_MODE (op0);
8129 if (inner_mode == VOIDmode)
8130 inner_mode = TYPE_MODE (inner_type);
8132 if (modifier == EXPAND_INITIALIZER)
8133 op0 = simplify_gen_subreg (mode, op0, inner_mode,
8134 subreg_lowpart_offset (mode,
8137 op0= convert_modes (mode, inner_mode, op0,
8138 TYPE_UNSIGNED (inner_type));
8141 else if (modifier == EXPAND_INITIALIZER)
8142 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
8144 else if (target == 0)
8145 op0 = convert_to_mode (mode, op0,
8146 TYPE_UNSIGNED (TREE_TYPE
8150 convert_move (target, op0,
8151 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8155 return REDUCE_BIT_FIELD (op0);
8157 case ADDR_SPACE_CONVERT_EXPR:
8159 tree treeop0_type = TREE_TYPE (treeop0);
8161 addr_space_t as_from;
8163 gcc_assert (POINTER_TYPE_P (type));
8164 gcc_assert (POINTER_TYPE_P (treeop0_type));
8166 as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
8167 as_from = TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type));
8169 /* Conversions between pointers to the same address space should
8170 have been implemented via CONVERT_EXPR / NOP_EXPR. */
8171 gcc_assert (as_to != as_from);
8173 /* Ask target code to handle conversion between pointers
8174 to overlapping address spaces. */
8175 if (targetm.addr_space.subset_p (as_to, as_from)
8176 || targetm.addr_space.subset_p (as_from, as_to))
8178 op0 = expand_expr (treeop0, NULL_RTX, VOIDmode, modifier);
8179 op0 = targetm.addr_space.convert (op0, treeop0_type, type);
8184 /* For disjoint address spaces, converting anything but
8185 a null pointer invokes undefined behaviour. We simply
8186 always return a null pointer here. */
8187 return CONST0_RTX (mode);
8190 case POINTER_PLUS_EXPR:
8191 /* Even though the sizetype mode and the pointer's mode can be different
8192 expand is able to handle this correctly and get the correct result out
8193 of the PLUS_EXPR code. */
8194 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
8195 if sizetype precision is smaller than pointer precision. */
8196 if (TYPE_PRECISION (sizetype) < TYPE_PRECISION (type))
8197 treeop1 = fold_convert_loc (loc, type,
8198 fold_convert_loc (loc, ssizetype,
8200 /* If sizetype precision is larger than pointer precision, truncate the
8201 offset to have matching modes. */
8202 else if (TYPE_PRECISION (sizetype) > TYPE_PRECISION (type))
8203 treeop1 = fold_convert_loc (loc, type, treeop1);
8206 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
8207 something else, make sure we add the register to the constant and
8208 then to the other thing. This case can occur during strength
8209 reduction and doing it this way will produce better code if the
8210 frame pointer or argument pointer is eliminated.
8212 fold-const.c will ensure that the constant is always in the inner
8213 PLUS_EXPR, so the only case we need to do anything about is if
8214 sp, ap, or fp is our second argument, in which case we must swap
8215 the innermost first argument and our second argument. */
8217 if (TREE_CODE (treeop0) == PLUS_EXPR
8218 && TREE_CODE (TREE_OPERAND (treeop0, 1)) == INTEGER_CST
8219 && TREE_CODE (treeop1) == VAR_DECL
8220 && (DECL_RTL (treeop1) == frame_pointer_rtx
8221 || DECL_RTL (treeop1) == stack_pointer_rtx
8222 || DECL_RTL (treeop1) == arg_pointer_rtx))
8227 /* If the result is to be ptr_mode and we are adding an integer to
8228 something, we might be forming a constant. So try to use
8229 plus_constant. If it produces a sum and we can't accept it,
8230 use force_operand. This allows P = &ARR[const] to generate
8231 efficient code on machines where a SYMBOL_REF is not a valid
8234 If this is an EXPAND_SUM call, always return the sum. */
8235 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
8236 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
8238 if (modifier == EXPAND_STACK_PARM)
8240 if (TREE_CODE (treeop0) == INTEGER_CST
8241 && GET_MODE_PRECISION (mode) <= HOST_BITS_PER_WIDE_INT
8242 && TREE_CONSTANT (treeop1))
8246 op1 = expand_expr (treeop1, subtarget, VOIDmode,
8248 /* Use immed_double_const to ensure that the constant is
8249 truncated according to the mode of OP1, then sign extended
8250 to a HOST_WIDE_INT. Using the constant directly can result
8251 in non-canonical RTL in a 64x32 cross compile. */
8253 = immed_double_const (TREE_INT_CST_LOW (treeop0),
8255 TYPE_MODE (TREE_TYPE (treeop1)));
8256 op1 = plus_constant (mode, op1, INTVAL (constant_part));
8257 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8258 op1 = force_operand (op1, target);
8259 return REDUCE_BIT_FIELD (op1);
8262 else if (TREE_CODE (treeop1) == INTEGER_CST
8263 && GET_MODE_PRECISION (mode) <= HOST_BITS_PER_WIDE_INT
8264 && TREE_CONSTANT (treeop0))
8268 op0 = expand_expr (treeop0, subtarget, VOIDmode,
8269 (modifier == EXPAND_INITIALIZER
8270 ? EXPAND_INITIALIZER : EXPAND_SUM));
8271 if (! CONSTANT_P (op0))
8273 op1 = expand_expr (treeop1, NULL_RTX,
8274 VOIDmode, modifier);
8275 /* Return a PLUS if modifier says it's OK. */
8276 if (modifier == EXPAND_SUM
8277 || modifier == EXPAND_INITIALIZER)
8278 return simplify_gen_binary (PLUS, mode, op0, op1);
8281 /* Use immed_double_const to ensure that the constant is
8282 truncated according to the mode of OP1, then sign extended
8283 to a HOST_WIDE_INT. Using the constant directly can result
8284 in non-canonical RTL in a 64x32 cross compile. */
8286 = immed_double_const (TREE_INT_CST_LOW (treeop1),
8288 TYPE_MODE (TREE_TYPE (treeop0)));
8289 op0 = plus_constant (mode, op0, INTVAL (constant_part));
8290 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8291 op0 = force_operand (op0, target);
8292 return REDUCE_BIT_FIELD (op0);
8296 /* Use TER to expand pointer addition of a negated value
8297 as pointer subtraction. */
8298 if ((POINTER_TYPE_P (TREE_TYPE (treeop0))
8299 || (TREE_CODE (TREE_TYPE (treeop0)) == VECTOR_TYPE
8300 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0)))))
8301 && TREE_CODE (treeop1) == SSA_NAME
8302 && TYPE_MODE (TREE_TYPE (treeop0))
8303 == TYPE_MODE (TREE_TYPE (treeop1)))
8305 gimple def = get_def_for_expr (treeop1, NEGATE_EXPR);
8308 treeop1 = gimple_assign_rhs1 (def);
8314 /* No sense saving up arithmetic to be done
8315 if it's all in the wrong mode to form part of an address.
8316 And force_operand won't know whether to sign-extend or
8318 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8319 || mode != ptr_mode)
8321 expand_operands (treeop0, treeop1,
8322 subtarget, &op0, &op1, EXPAND_NORMAL);
8323 if (op0 == const0_rtx)
8325 if (op1 == const0_rtx)
8330 expand_operands (treeop0, treeop1,
8331 subtarget, &op0, &op1, modifier);
8332 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
8336 /* For initializers, we are allowed to return a MINUS of two
8337 symbolic constants. Here we handle all cases when both operands
8339 /* Handle difference of two symbolic constants,
8340 for the sake of an initializer. */
8341 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
8342 && really_constant_p (treeop0)
8343 && really_constant_p (treeop1))
8345 expand_operands (treeop0, treeop1,
8346 NULL_RTX, &op0, &op1, modifier);
8348 /* If the last operand is a CONST_INT, use plus_constant of
8349 the negated constant. Else make the MINUS. */
8350 if (CONST_INT_P (op1))
8351 return REDUCE_BIT_FIELD (plus_constant (mode, op0,
8354 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
8357 /* No sense saving up arithmetic to be done
8358 if it's all in the wrong mode to form part of an address.
8359 And force_operand won't know whether to sign-extend or
8361 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
8362 || mode != ptr_mode)
8365 expand_operands (treeop0, treeop1,
8366 subtarget, &op0, &op1, modifier);
8368 /* Convert A - const to A + (-const). */
8369 if (CONST_INT_P (op1))
8371 op1 = negate_rtx (mode, op1);
8372 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
8377 case WIDEN_MULT_PLUS_EXPR:
8378 case WIDEN_MULT_MINUS_EXPR:
8379 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8380 op2 = expand_normal (treeop2);
8381 target = expand_widen_pattern_expr (ops, op0, op1, op2,
8385 case WIDEN_MULT_EXPR:
8386 /* If first operand is constant, swap them.
8387 Thus the following special case checks need only
8388 check the second operand. */
8389 if (TREE_CODE (treeop0) == INTEGER_CST)
8396 /* First, check if we have a multiplication of one signed and one
8397 unsigned operand. */
8398 if (TREE_CODE (treeop1) != INTEGER_CST
8399 && (TYPE_UNSIGNED (TREE_TYPE (treeop0))
8400 != TYPE_UNSIGNED (TREE_TYPE (treeop1))))
8402 enum machine_mode innermode = TYPE_MODE (TREE_TYPE (treeop0));
8403 this_optab = usmul_widen_optab;
8404 if (find_widening_optab_handler (this_optab, mode, innermode, 0)
8405 != CODE_FOR_nothing)
8407 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)))
8408 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
8411 expand_operands (treeop0, treeop1, NULL_RTX, &op1, &op0,
8416 /* Check for a multiplication with matching signedness. */
8417 else if ((TREE_CODE (treeop1) == INTEGER_CST
8418 && int_fits_type_p (treeop1, TREE_TYPE (treeop0)))
8419 || (TYPE_UNSIGNED (TREE_TYPE (treeop1))
8420 == TYPE_UNSIGNED (TREE_TYPE (treeop0))))
8422 tree op0type = TREE_TYPE (treeop0);
8423 enum machine_mode innermode = TYPE_MODE (op0type);
8424 bool zextend_p = TYPE_UNSIGNED (op0type);
8425 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
8426 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
8428 if (TREE_CODE (treeop0) != INTEGER_CST)
8430 if (find_widening_optab_handler (this_optab, mode, innermode, 0)
8431 != CODE_FOR_nothing)
8433 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1,
8435 temp = expand_widening_mult (mode, op0, op1, target,
8436 unsignedp, this_optab);
8437 return REDUCE_BIT_FIELD (temp);
8439 if (find_widening_optab_handler (other_optab, mode, innermode, 0)
8441 && innermode == word_mode)
8444 op0 = expand_normal (treeop0);
8445 if (TREE_CODE (treeop1) == INTEGER_CST)
8446 op1 = convert_modes (innermode, mode,
8447 expand_normal (treeop1), unsignedp);
8449 op1 = expand_normal (treeop1);
8450 temp = expand_binop (mode, other_optab, op0, op1, target,
8451 unsignedp, OPTAB_LIB_WIDEN);
8452 hipart = gen_highpart (innermode, temp);
8453 htem = expand_mult_highpart_adjust (innermode, hipart,
8457 emit_move_insn (hipart, htem);
8458 return REDUCE_BIT_FIELD (temp);
8462 treeop0 = fold_build1 (CONVERT_EXPR, type, treeop0);
8463 treeop1 = fold_build1 (CONVERT_EXPR, type, treeop1);
8464 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
8465 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
8469 optab opt = fma_optab;
8472 /* If there is no insn for FMA, emit it as __builtin_fma{,f,l}
8474 if (optab_handler (fma_optab, mode) == CODE_FOR_nothing)
8476 tree fn = mathfn_built_in (TREE_TYPE (treeop0), BUILT_IN_FMA);
8479 gcc_assert (fn != NULL_TREE);
8480 call_expr = build_call_expr (fn, 3, treeop0, treeop1, treeop2);
8481 return expand_builtin (call_expr, target, subtarget, mode, false);
8484 def0 = get_def_for_expr (treeop0, NEGATE_EXPR);
8485 def2 = get_def_for_expr (treeop2, NEGATE_EXPR);
8490 && optab_handler (fnms_optab, mode) != CODE_FOR_nothing)
8493 op0 = expand_normal (gimple_assign_rhs1 (def0));
8494 op2 = expand_normal (gimple_assign_rhs1 (def2));
8497 && optab_handler (fnma_optab, mode) != CODE_FOR_nothing)
8500 op0 = expand_normal (gimple_assign_rhs1 (def0));
8503 && optab_handler (fms_optab, mode) != CODE_FOR_nothing)
8506 op2 = expand_normal (gimple_assign_rhs1 (def2));
8510 op0 = expand_expr (treeop0, subtarget, VOIDmode, EXPAND_NORMAL);
8512 op2 = expand_normal (treeop2);
8513 op1 = expand_normal (treeop1);
8515 return expand_ternary_op (TYPE_MODE (type), opt,
8516 op0, op1, op2, target, 0);
8520 /* If this is a fixed-point operation, then we cannot use the code
8521 below because "expand_mult" doesn't support sat/no-sat fixed-point
8523 if (ALL_FIXED_POINT_MODE_P (mode))
8526 /* If first operand is constant, swap them.
8527 Thus the following special case checks need only
8528 check the second operand. */
8529 if (TREE_CODE (treeop0) == INTEGER_CST)
8536 /* Attempt to return something suitable for generating an
8537 indexed address, for machines that support that. */
8539 if (modifier == EXPAND_SUM && mode == ptr_mode
8540 && host_integerp (treeop1, 0))
8542 tree exp1 = treeop1;
8544 op0 = expand_expr (treeop0, subtarget, VOIDmode,
8548 op0 = force_operand (op0, NULL_RTX);
8550 op0 = copy_to_mode_reg (mode, op0);
8552 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
8553 gen_int_mode (tree_low_cst (exp1, 0),
8554 TYPE_MODE (TREE_TYPE (exp1)))));
8557 if (modifier == EXPAND_STACK_PARM)
8560 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
8561 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
8563 case TRUNC_DIV_EXPR:
8564 case FLOOR_DIV_EXPR:
8566 case ROUND_DIV_EXPR:
8567 case EXACT_DIV_EXPR:
8568 /* If this is a fixed-point operation, then we cannot use the code
8569 below because "expand_divmod" doesn't support sat/no-sat fixed-point
8571 if (ALL_FIXED_POINT_MODE_P (mode))
8574 if (modifier == EXPAND_STACK_PARM)
8576 /* Possible optimization: compute the dividend with EXPAND_SUM
8577 then if the divisor is constant can optimize the case
8578 where some terms of the dividend have coeffs divisible by it. */
8579 expand_operands (treeop0, treeop1,
8580 subtarget, &op0, &op1, EXPAND_NORMAL);
8581 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
8586 case MULT_HIGHPART_EXPR:
8587 expand_operands (treeop0, treeop1, subtarget, &op0, &op1, EXPAND_NORMAL);
8588 temp = expand_mult_highpart (mode, op0, op1, target, unsignedp);
8592 case TRUNC_MOD_EXPR:
8593 case FLOOR_MOD_EXPR:
8595 case ROUND_MOD_EXPR:
8596 if (modifier == EXPAND_STACK_PARM)
8598 expand_operands (treeop0, treeop1,
8599 subtarget, &op0, &op1, EXPAND_NORMAL);
8600 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
8602 case FIXED_CONVERT_EXPR:
8603 op0 = expand_normal (treeop0);
8604 if (target == 0 || modifier == EXPAND_STACK_PARM)
8605 target = gen_reg_rtx (mode);
8607 if ((TREE_CODE (TREE_TYPE (treeop0)) == INTEGER_TYPE
8608 && TYPE_UNSIGNED (TREE_TYPE (treeop0)))
8609 || (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type)))
8610 expand_fixed_convert (target, op0, 1, TYPE_SATURATING (type));
8612 expand_fixed_convert (target, op0, 0, TYPE_SATURATING (type));
8615 case FIX_TRUNC_EXPR:
8616 op0 = expand_normal (treeop0);
8617 if (target == 0 || modifier == EXPAND_STACK_PARM)
8618 target = gen_reg_rtx (mode);
8619 expand_fix (target, op0, unsignedp);
8623 op0 = expand_normal (treeop0);
8624 if (target == 0 || modifier == EXPAND_STACK_PARM)
8625 target = gen_reg_rtx (mode);
8626 /* expand_float can't figure out what to do if FROM has VOIDmode.
8627 So give it the correct mode. With -O, cse will optimize this. */
8628 if (GET_MODE (op0) == VOIDmode)
8629 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0)),
8631 expand_float (target, op0,
8632 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8636 op0 = expand_expr (treeop0, subtarget,
8637 VOIDmode, EXPAND_NORMAL);
8638 if (modifier == EXPAND_STACK_PARM)
8640 temp = expand_unop (mode,
8641 optab_for_tree_code (NEGATE_EXPR, type,
8645 return REDUCE_BIT_FIELD (temp);
8648 op0 = expand_expr (treeop0, subtarget,
8649 VOIDmode, EXPAND_NORMAL);
8650 if (modifier == EXPAND_STACK_PARM)
8653 /* ABS_EXPR is not valid for complex arguments. */
8654 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
8655 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
8657 /* Unsigned abs is simply the operand. Testing here means we don't
8658 risk generating incorrect code below. */
8659 if (TYPE_UNSIGNED (type))
8662 return expand_abs (mode, op0, target, unsignedp,
8663 safe_from_p (target, treeop0, 1));
8667 target = original_target;
8669 || modifier == EXPAND_STACK_PARM
8670 || (MEM_P (target) && MEM_VOLATILE_P (target))
8671 || GET_MODE (target) != mode
8673 && REGNO (target) < FIRST_PSEUDO_REGISTER))
8674 target = gen_reg_rtx (mode);
8675 expand_operands (treeop0, treeop1,
8676 target, &op0, &op1, EXPAND_NORMAL);
8678 /* First try to do it with a special MIN or MAX instruction.
8679 If that does not win, use a conditional jump to select the proper
8681 this_optab = optab_for_tree_code (code, type, optab_default);
8682 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8687 /* At this point, a MEM target is no longer useful; we will get better
8690 if (! REG_P (target))
8691 target = gen_reg_rtx (mode);
8693 /* If op1 was placed in target, swap op0 and op1. */
8694 if (target != op0 && target == op1)
8701 /* We generate better code and avoid problems with op1 mentioning
8702 target by forcing op1 into a pseudo if it isn't a constant. */
8703 if (! CONSTANT_P (op1))
8704 op1 = force_reg (mode, op1);
8707 enum rtx_code comparison_code;
8710 if (code == MAX_EXPR)
8711 comparison_code = unsignedp ? GEU : GE;
8713 comparison_code = unsignedp ? LEU : LE;
8715 /* Canonicalize to comparisons against 0. */
8716 if (op1 == const1_rtx)
8718 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
8719 or (a != 0 ? a : 1) for unsigned.
8720 For MIN we are safe converting (a <= 1 ? a : 1)
8721 into (a <= 0 ? a : 1) */
8722 cmpop1 = const0_rtx;
8723 if (code == MAX_EXPR)
8724 comparison_code = unsignedp ? NE : GT;
8726 if (op1 == constm1_rtx && !unsignedp)
8728 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
8729 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
8730 cmpop1 = const0_rtx;
8731 if (code == MIN_EXPR)
8732 comparison_code = LT;
8734 #ifdef HAVE_conditional_move
8735 /* Use a conditional move if possible. */
8736 if (can_conditionally_move_p (mode))
8740 /* ??? Same problem as in expmed.c: emit_conditional_move
8741 forces a stack adjustment via compare_from_rtx, and we
8742 lose the stack adjustment if the sequence we are about
8743 to create is discarded. */
8744 do_pending_stack_adjust ();
8748 /* Try to emit the conditional move. */
8749 insn = emit_conditional_move (target, comparison_code,
8754 /* If we could do the conditional move, emit the sequence,
8758 rtx seq = get_insns ();
8764 /* Otherwise discard the sequence and fall back to code with
8770 emit_move_insn (target, op0);
8772 temp = gen_label_rtx ();
8773 do_compare_rtx_and_jump (target, cmpop1, comparison_code,
8774 unsignedp, mode, NULL_RTX, NULL_RTX, temp,
8777 emit_move_insn (target, op1);
8782 op0 = expand_expr (treeop0, subtarget,
8783 VOIDmode, EXPAND_NORMAL);
8784 if (modifier == EXPAND_STACK_PARM)
8786 /* In case we have to reduce the result to bitfield precision
8787 for unsigned bitfield expand this as XOR with a proper constant
8789 if (reduce_bit_field && TYPE_UNSIGNED (type))
8790 temp = expand_binop (mode, xor_optab, op0,
8791 immed_double_int_const
8792 (double_int::mask (TYPE_PRECISION (type)), mode),
8793 target, 1, OPTAB_LIB_WIDEN);
8795 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8799 /* ??? Can optimize bitwise operations with one arg constant.
8800 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8801 and (a bitwise1 b) bitwise2 b (etc)
8802 but that is probably not worth while. */
8811 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type))
8812 || (GET_MODE_PRECISION (TYPE_MODE (type))
8813 == TYPE_PRECISION (type)));
8818 /* If this is a fixed-point operation, then we cannot use the code
8819 below because "expand_shift" doesn't support sat/no-sat fixed-point
8821 if (ALL_FIXED_POINT_MODE_P (mode))
8824 if (! safe_from_p (subtarget, treeop1, 1))
8826 if (modifier == EXPAND_STACK_PARM)
8828 op0 = expand_expr (treeop0, subtarget,
8829 VOIDmode, EXPAND_NORMAL);
8830 temp = expand_variable_shift (code, mode, op0, treeop1, target,
8832 if (code == LSHIFT_EXPR)
8833 temp = REDUCE_BIT_FIELD (temp);
8836 /* Could determine the answer when only additive constants differ. Also,
8837 the addition of one can be handled by changing the condition. */
8844 case UNORDERED_EXPR:
8852 temp = do_store_flag (ops,
8853 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8854 tmode != VOIDmode ? tmode : mode);
8858 /* Use a compare and a jump for BLKmode comparisons, or for function
8859 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8862 || modifier == EXPAND_STACK_PARM
8863 || ! safe_from_p (target, treeop0, 1)
8864 || ! safe_from_p (target, treeop1, 1)
8865 /* Make sure we don't have a hard reg (such as function's return
8866 value) live across basic blocks, if not optimizing. */
8867 || (!optimize && REG_P (target)
8868 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8869 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8871 emit_move_insn (target, const0_rtx);
8873 op1 = gen_label_rtx ();
8874 jumpifnot_1 (code, treeop0, treeop1, op1, -1);
8876 if (TYPE_PRECISION (type) == 1 && !TYPE_UNSIGNED (type))
8877 emit_move_insn (target, constm1_rtx);
8879 emit_move_insn (target, const1_rtx);
8885 /* Get the rtx code of the operands. */
8886 op0 = expand_normal (treeop0);
8887 op1 = expand_normal (treeop1);
8890 target = gen_reg_rtx (TYPE_MODE (type));
8892 /* Move the real (op0) and imaginary (op1) parts to their location. */
8893 write_complex_part (target, op0, false);
8894 write_complex_part (target, op1, true);
8898 case WIDEN_SUM_EXPR:
8900 tree oprnd0 = treeop0;
8901 tree oprnd1 = treeop1;
8903 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8904 target = expand_widen_pattern_expr (ops, op0, NULL_RTX, op1,
8909 case REDUC_MAX_EXPR:
8910 case REDUC_MIN_EXPR:
8911 case REDUC_PLUS_EXPR:
8913 op0 = expand_normal (treeop0);
8914 this_optab = optab_for_tree_code (code, type, optab_default);
8915 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8920 case VEC_LSHIFT_EXPR:
8921 case VEC_RSHIFT_EXPR:
8923 target = expand_vec_shift_expr (ops, target);
8927 case VEC_UNPACK_HI_EXPR:
8928 case VEC_UNPACK_LO_EXPR:
8930 op0 = expand_normal (treeop0);
8931 temp = expand_widen_pattern_expr (ops, op0, NULL_RTX, NULL_RTX,
8937 case VEC_UNPACK_FLOAT_HI_EXPR:
8938 case VEC_UNPACK_FLOAT_LO_EXPR:
8940 op0 = expand_normal (treeop0);
8941 /* The signedness is determined from input operand. */
8942 temp = expand_widen_pattern_expr
8943 (ops, op0, NULL_RTX, NULL_RTX,
8944 target, TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8950 case VEC_WIDEN_MULT_HI_EXPR:
8951 case VEC_WIDEN_MULT_LO_EXPR:
8952 case VEC_WIDEN_MULT_EVEN_EXPR:
8953 case VEC_WIDEN_MULT_ODD_EXPR:
8954 case VEC_WIDEN_LSHIFT_HI_EXPR:
8955 case VEC_WIDEN_LSHIFT_LO_EXPR:
8956 expand_operands (treeop0, treeop1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8957 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8959 gcc_assert (target);
8962 case VEC_PACK_TRUNC_EXPR:
8963 case VEC_PACK_SAT_EXPR:
8964 case VEC_PACK_FIX_TRUNC_EXPR:
8965 mode = TYPE_MODE (TREE_TYPE (treeop0));
8969 expand_operands (treeop0, treeop1, target, &op0, &op1, EXPAND_NORMAL);
8970 op2 = expand_normal (treeop2);
8972 /* Careful here: if the target doesn't support integral vector modes,
8973 a constant selection vector could wind up smooshed into a normal
8974 integral constant. */
8975 if (CONSTANT_P (op2) && GET_CODE (op2) != CONST_VECTOR)
8977 tree sel_type = TREE_TYPE (treeop2);
8978 enum machine_mode vmode
8979 = mode_for_vector (TYPE_MODE (TREE_TYPE (sel_type)),
8980 TYPE_VECTOR_SUBPARTS (sel_type));
8981 gcc_assert (GET_MODE_CLASS (vmode) == MODE_VECTOR_INT);
8982 op2 = simplify_subreg (vmode, op2, TYPE_MODE (sel_type), 0);
8983 gcc_assert (op2 && GET_CODE (op2) == CONST_VECTOR);
8986 gcc_assert (GET_MODE_CLASS (GET_MODE (op2)) == MODE_VECTOR_INT);
8988 temp = expand_vec_perm (mode, op0, op1, op2, target);
8994 tree oprnd0 = treeop0;
8995 tree oprnd1 = treeop1;
8996 tree oprnd2 = treeop2;
8999 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
9000 op2 = expand_normal (oprnd2);
9001 target = expand_widen_pattern_expr (ops, op0, op1, op2,
9006 case REALIGN_LOAD_EXPR:
9008 tree oprnd0 = treeop0;
9009 tree oprnd1 = treeop1;
9010 tree oprnd2 = treeop2;
9013 this_optab = optab_for_tree_code (code, type, optab_default);
9014 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
9015 op2 = expand_normal (oprnd2);
9016 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
9023 /* A COND_EXPR with its type being VOID_TYPE represents a
9024 conditional jump and is handled in
9025 expand_gimple_cond_expr. */
9026 gcc_assert (!VOID_TYPE_P (type));
9028 /* Note that COND_EXPRs whose type is a structure or union
9029 are required to be constructed to contain assignments of
9030 a temporary variable, so that we can evaluate them here
9031 for side effect only. If type is void, we must do likewise. */
9033 gcc_assert (!TREE_ADDRESSABLE (type)
9035 && TREE_TYPE (treeop1) != void_type_node
9036 && TREE_TYPE (treeop2) != void_type_node);
9038 temp = expand_cond_expr_using_cmove (treeop0, treeop1, treeop2);
9042 /* If we are not to produce a result, we have no target. Otherwise,
9043 if a target was specified use it; it will not be used as an
9044 intermediate target unless it is safe. If no target, use a
9047 if (modifier != EXPAND_STACK_PARM
9049 && safe_from_p (original_target, treeop0, 1)
9050 && GET_MODE (original_target) == mode
9051 && !MEM_P (original_target))
9052 temp = original_target;
9054 temp = assign_temp (type, 0, 1);
9056 do_pending_stack_adjust ();
9058 op0 = gen_label_rtx ();
9059 op1 = gen_label_rtx ();
9060 jumpifnot (treeop0, op0, -1);
9061 store_expr (treeop1, temp,
9062 modifier == EXPAND_STACK_PARM,
9065 emit_jump_insn (gen_jump (op1));
9068 store_expr (treeop2, temp,
9069 modifier == EXPAND_STACK_PARM,
9077 target = expand_vec_cond_expr (type, treeop0, treeop1, treeop2, target);
9084 /* Here to do an ordinary binary operator. */
9086 expand_operands (treeop0, treeop1,
9087 subtarget, &op0, &op1, EXPAND_NORMAL);
9089 this_optab = optab_for_tree_code (code, type, optab_default);
9091 if (modifier == EXPAND_STACK_PARM)
9093 temp = expand_binop (mode, this_optab, op0, op1, target,
9094 unsignedp, OPTAB_LIB_WIDEN);
9096 /* Bitwise operations do not need bitfield reduction as we expect their
9097 operands being properly truncated. */
9098 if (code == BIT_XOR_EXPR
9099 || code == BIT_AND_EXPR
9100 || code == BIT_IOR_EXPR)
9102 return REDUCE_BIT_FIELD (temp);
9104 #undef REDUCE_BIT_FIELD
9107 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
9108 enum expand_modifier modifier, rtx *alt_rtl)
9110 rtx op0, op1, temp, decl_rtl;
9113 enum machine_mode mode;
9114 enum tree_code code = TREE_CODE (exp);
9115 rtx subtarget, original_target;
9118 bool reduce_bit_field;
9119 location_t loc = EXPR_LOCATION (exp);
9120 struct separate_ops ops;
9121 tree treeop0, treeop1, treeop2;
9122 tree ssa_name = NULL_TREE;
9125 type = TREE_TYPE (exp);
9126 mode = TYPE_MODE (type);
9127 unsignedp = TYPE_UNSIGNED (type);
9129 treeop0 = treeop1 = treeop2 = NULL_TREE;
9130 if (!VL_EXP_CLASS_P (exp))
9131 switch (TREE_CODE_LENGTH (code))
9134 case 3: treeop2 = TREE_OPERAND (exp, 2);
9135 case 2: treeop1 = TREE_OPERAND (exp, 1);
9136 case 1: treeop0 = TREE_OPERAND (exp, 0);
9146 ignore = (target == const0_rtx
9147 || ((CONVERT_EXPR_CODE_P (code)
9148 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
9149 && TREE_CODE (type) == VOID_TYPE));
9151 /* An operation in what may be a bit-field type needs the
9152 result to be reduced to the precision of the bit-field type,
9153 which is narrower than that of the type's mode. */
9154 reduce_bit_field = (!ignore
9155 && INTEGRAL_TYPE_P (type)
9156 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
9158 /* If we are going to ignore this result, we need only do something
9159 if there is a side-effect somewhere in the expression. If there
9160 is, short-circuit the most common cases here. Note that we must
9161 not call expand_expr with anything but const0_rtx in case this
9162 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
9166 if (! TREE_SIDE_EFFECTS (exp))
9169 /* Ensure we reference a volatile object even if value is ignored, but
9170 don't do this if all we are doing is taking its address. */
9171 if (TREE_THIS_VOLATILE (exp)
9172 && TREE_CODE (exp) != FUNCTION_DECL
9173 && mode != VOIDmode && mode != BLKmode
9174 && modifier != EXPAND_CONST_ADDRESS)
9176 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
9182 if (TREE_CODE_CLASS (code) == tcc_unary
9183 || code == BIT_FIELD_REF
9184 || code == COMPONENT_REF
9185 || code == INDIRECT_REF)
9186 return expand_expr (treeop0, const0_rtx, VOIDmode,
9189 else if (TREE_CODE_CLASS (code) == tcc_binary
9190 || TREE_CODE_CLASS (code) == tcc_comparison
9191 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
9193 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
9194 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
9201 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
9204 /* Use subtarget as the target for operand 0 of a binary operation. */
9205 subtarget = get_subtarget (target);
9206 original_target = target;
9212 tree function = decl_function_context (exp);
9214 temp = label_rtx (exp);
9215 temp = gen_rtx_LABEL_REF (Pmode, temp);
9217 if (function != current_function_decl
9219 LABEL_REF_NONLOCAL_P (temp) = 1;
9221 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
9226 /* ??? ivopts calls expander, without any preparation from
9227 out-of-ssa. So fake instructions as if this was an access to the
9228 base variable. This unnecessarily allocates a pseudo, see how we can
9229 reuse it, if partition base vars have it set already. */
9230 if (!currently_expanding_to_rtl)
9232 tree var = SSA_NAME_VAR (exp);
9233 if (var && DECL_RTL_SET_P (var))
9234 return DECL_RTL (var);
9235 return gen_raw_REG (TYPE_MODE (TREE_TYPE (exp)),
9236 LAST_VIRTUAL_REGISTER + 1);
9239 g = get_gimple_for_ssa_name (exp);
9240 /* For EXPAND_INITIALIZER try harder to get something simpler. */
9242 && modifier == EXPAND_INITIALIZER
9243 && !SSA_NAME_IS_DEFAULT_DEF (exp)
9244 && (optimize || DECL_IGNORED_P (SSA_NAME_VAR (exp)))
9245 && stmt_is_replaceable_p (SSA_NAME_DEF_STMT (exp)))
9246 g = SSA_NAME_DEF_STMT (exp);
9249 rtx r = expand_expr_real (gimple_assign_rhs_to_tree (g), target,
9250 tmode, modifier, NULL);
9251 if (REG_P (r) && !REG_EXPR (r))
9252 set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (exp), r);
9257 decl_rtl = get_rtx_for_ssa_name (ssa_name);
9258 exp = SSA_NAME_VAR (ssa_name);
9259 goto expand_decl_rtl;
9263 /* If a static var's type was incomplete when the decl was written,
9264 but the type is complete now, lay out the decl now. */
9265 if (DECL_SIZE (exp) == 0
9266 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
9267 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
9268 layout_decl (exp, 0);
9270 /* ... fall through ... */
9274 decl_rtl = DECL_RTL (exp);
9276 gcc_assert (decl_rtl);
9277 decl_rtl = copy_rtx (decl_rtl);
9278 /* Record writes to register variables. */
9279 if (modifier == EXPAND_WRITE
9281 && HARD_REGISTER_P (decl_rtl))
9282 add_to_hard_reg_set (&crtl->asm_clobbers,
9283 GET_MODE (decl_rtl), REGNO (decl_rtl));
9285 /* Ensure variable marked as used even if it doesn't go through
9286 a parser. If it hasn't be used yet, write out an external
9288 TREE_USED (exp) = 1;
9290 /* Show we haven't gotten RTL for this yet. */
9293 /* Variables inherited from containing functions should have
9294 been lowered by this point. */
9295 context = decl_function_context (exp);
9296 gcc_assert (!context
9297 || context == current_function_decl
9298 || TREE_STATIC (exp)
9299 || DECL_EXTERNAL (exp)
9300 /* ??? C++ creates functions that are not TREE_STATIC. */
9301 || TREE_CODE (exp) == FUNCTION_DECL);
9303 /* This is the case of an array whose size is to be determined
9304 from its initializer, while the initializer is still being parsed.
9305 ??? We aren't parsing while expanding anymore. */
9307 if (MEM_P (decl_rtl) && REG_P (XEXP (decl_rtl, 0)))
9308 temp = validize_mem (decl_rtl);
9310 /* If DECL_RTL is memory, we are in the normal case and the
9311 address is not valid, get the address into a register. */
9313 else if (MEM_P (decl_rtl) && modifier != EXPAND_INITIALIZER)
9316 *alt_rtl = decl_rtl;
9317 decl_rtl = use_anchored_address (decl_rtl);
9318 if (modifier != EXPAND_CONST_ADDRESS
9319 && modifier != EXPAND_SUM
9320 && !memory_address_addr_space_p (DECL_MODE (exp),
9322 MEM_ADDR_SPACE (decl_rtl)))
9323 temp = replace_equiv_address (decl_rtl,
9324 copy_rtx (XEXP (decl_rtl, 0)));
9327 /* If we got something, return it. But first, set the alignment
9328 if the address is a register. */
9331 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
9332 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
9337 /* If the mode of DECL_RTL does not match that of the decl,
9338 there are two cases: we are dealing with a BLKmode value
9339 that is returned in a register, or we are dealing with
9340 a promoted value. In the latter case, return a SUBREG
9341 of the wanted mode, but mark it so that we know that it
9342 was already extended. */
9343 if (REG_P (decl_rtl)
9344 && DECL_MODE (exp) != BLKmode
9345 && GET_MODE (decl_rtl) != DECL_MODE (exp))
9347 enum machine_mode pmode;
9349 /* Get the signedness to be used for this variable. Ensure we get
9350 the same mode we got when the variable was declared. */
9351 if (code == SSA_NAME
9352 && (g = SSA_NAME_DEF_STMT (ssa_name))
9353 && gimple_code (g) == GIMPLE_CALL)
9355 gcc_assert (!gimple_call_internal_p (g));
9356 pmode = promote_function_mode (type, mode, &unsignedp,
9357 gimple_call_fntype (g),
9361 pmode = promote_decl_mode (exp, &unsignedp);
9362 gcc_assert (GET_MODE (decl_rtl) == pmode);
9364 temp = gen_lowpart_SUBREG (mode, decl_rtl);
9365 SUBREG_PROMOTED_VAR_P (temp) = 1;
9366 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
9373 temp = immed_double_const (TREE_INT_CST_LOW (exp),
9374 TREE_INT_CST_HIGH (exp), mode);
9380 tree tmp = NULL_TREE;
9381 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
9382 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT
9383 || GET_MODE_CLASS (mode) == MODE_VECTOR_FRACT
9384 || GET_MODE_CLASS (mode) == MODE_VECTOR_UFRACT
9385 || GET_MODE_CLASS (mode) == MODE_VECTOR_ACCUM
9386 || GET_MODE_CLASS (mode) == MODE_VECTOR_UACCUM)
9387 return const_vector_from_tree (exp);
9388 if (GET_MODE_CLASS (mode) == MODE_INT)
9390 tree type_for_mode = lang_hooks.types.type_for_mode (mode, 1);
9392 tmp = fold_unary_loc (loc, VIEW_CONVERT_EXPR, type_for_mode, exp);
9396 VEC(constructor_elt,gc) *v;
9398 v = VEC_alloc (constructor_elt, gc, VECTOR_CST_NELTS (exp));
9399 for (i = 0; i < VECTOR_CST_NELTS (exp); ++i)
9400 CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, VECTOR_CST_ELT (exp, i));
9401 tmp = build_constructor (type, v);
9403 return expand_expr (tmp, ignore ? const0_rtx : target,
9408 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
9411 /* If optimized, generate immediate CONST_DOUBLE
9412 which will be turned into memory by reload if necessary.
9414 We used to force a register so that loop.c could see it. But
9415 this does not allow gen_* patterns to perform optimizations with
9416 the constants. It also produces two insns in cases like "x = 1.0;".
9417 On most machines, floating-point constants are not permitted in
9418 many insns, so we'd end up copying it to a register in any case.
9420 Now, we do the copying in expand_binop, if appropriate. */
9421 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
9422 TYPE_MODE (TREE_TYPE (exp)));
9425 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp),
9426 TYPE_MODE (TREE_TYPE (exp)));
9429 /* Handle evaluating a complex constant in a CONCAT target. */
9430 if (original_target && GET_CODE (original_target) == CONCAT)
9432 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
9435 rtarg = XEXP (original_target, 0);
9436 itarg = XEXP (original_target, 1);
9438 /* Move the real and imaginary parts separately. */
9439 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, EXPAND_NORMAL);
9440 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, EXPAND_NORMAL);
9443 emit_move_insn (rtarg, op0);
9445 emit_move_insn (itarg, op1);
9447 return original_target;
9450 /* ... fall through ... */
9453 temp = expand_expr_constant (exp, 1, modifier);
9455 /* temp contains a constant address.
9456 On RISC machines where a constant address isn't valid,
9457 make some insns to get that address into a register. */
9458 if (modifier != EXPAND_CONST_ADDRESS
9459 && modifier != EXPAND_INITIALIZER
9460 && modifier != EXPAND_SUM
9461 && ! memory_address_addr_space_p (mode, XEXP (temp, 0),
9462 MEM_ADDR_SPACE (temp)))
9463 return replace_equiv_address (temp,
9464 copy_rtx (XEXP (temp, 0)));
9470 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
9472 if (!SAVE_EXPR_RESOLVED_P (exp))
9474 /* We can indeed still hit this case, typically via builtin
9475 expanders calling save_expr immediately before expanding
9476 something. Assume this means that we only have to deal
9477 with non-BLKmode values. */
9478 gcc_assert (GET_MODE (ret) != BLKmode);
9480 val = build_decl (EXPR_LOCATION (exp),
9481 VAR_DECL, NULL, TREE_TYPE (exp));
9482 DECL_ARTIFICIAL (val) = 1;
9483 DECL_IGNORED_P (val) = 1;
9485 TREE_OPERAND (exp, 0) = treeop0;
9486 SAVE_EXPR_RESOLVED_P (exp) = 1;
9488 if (!CONSTANT_P (ret))
9489 ret = copy_to_reg (ret);
9490 SET_DECL_RTL (val, ret);
9498 /* If we don't need the result, just ensure we evaluate any
9502 unsigned HOST_WIDE_INT idx;
9505 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
9506 expand_expr (value, const0_rtx, VOIDmode, EXPAND_NORMAL);
9511 return expand_constructor (exp, target, modifier, false);
9513 case TARGET_MEM_REF:
9516 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))));
9517 struct mem_address addr;
9518 enum insn_code icode;
9521 get_address_description (exp, &addr);
9522 op0 = addr_for_mem_ref (&addr, as, true);
9523 op0 = memory_address_addr_space (mode, op0, as);
9524 temp = gen_rtx_MEM (mode, op0);
9525 set_mem_attributes (temp, exp, 0);
9526 set_mem_addr_space (temp, as);
9527 align = get_object_alignment (exp);
9528 if (modifier != EXPAND_WRITE
9530 && align < GET_MODE_ALIGNMENT (mode)
9531 /* If the target does not have special handling for unaligned
9532 loads of mode then it can use regular moves for them. */
9533 && ((icode = optab_handler (movmisalign_optab, mode))
9534 != CODE_FOR_nothing))
9536 struct expand_operand ops[2];
9538 /* We've already validated the memory, and we're creating a
9539 new pseudo destination. The predicates really can't fail,
9540 nor can the generator. */
9541 create_output_operand (&ops[0], NULL_RTX, mode);
9542 create_fixed_operand (&ops[1], temp);
9543 expand_insn (icode, 2, ops);
9544 return ops[0].value;
9552 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))));
9553 enum machine_mode address_mode;
9554 tree base = TREE_OPERAND (exp, 0);
9556 enum insn_code icode;
9558 /* Handle expansion of non-aliased memory with non-BLKmode. That
9559 might end up in a register. */
9560 if (mem_ref_refers_to_non_mem_p (exp))
9562 HOST_WIDE_INT offset = mem_ref_offset (exp).low;
9565 base = TREE_OPERAND (base, 0);
9567 && host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)
9568 && (GET_MODE_BITSIZE (DECL_MODE (base))
9569 == TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp)))))
9570 return expand_expr (build1 (VIEW_CONVERT_EXPR,
9571 TREE_TYPE (exp), base),
9572 target, tmode, modifier);
9573 bit_offset = bitsize_int (offset * BITS_PER_UNIT);
9574 bftype = TREE_TYPE (base);
9575 if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode)
9576 bftype = TREE_TYPE (exp);
9579 temp = assign_stack_temp (DECL_MODE (base),
9580 GET_MODE_SIZE (DECL_MODE (base)));
9581 store_expr (base, temp, 0, false);
9582 temp = adjust_address (temp, BLKmode, offset);
9583 set_mem_size (temp, int_size_in_bytes (TREE_TYPE (exp)));
9586 return expand_expr (build3 (BIT_FIELD_REF, bftype,
9588 TYPE_SIZE (TREE_TYPE (exp)),
9590 target, tmode, modifier);
9592 address_mode = targetm.addr_space.address_mode (as);
9593 base = TREE_OPERAND (exp, 0);
9594 if ((def_stmt = get_def_for_expr (base, BIT_AND_EXPR)))
9596 tree mask = gimple_assign_rhs2 (def_stmt);
9597 base = build2 (BIT_AND_EXPR, TREE_TYPE (base),
9598 gimple_assign_rhs1 (def_stmt), mask);
9599 TREE_OPERAND (exp, 0) = base;
9601 align = get_object_alignment (exp);
9602 op0 = expand_expr (base, NULL_RTX, VOIDmode, EXPAND_SUM);
9603 op0 = memory_address_addr_space (address_mode, op0, as);
9604 if (!integer_zerop (TREE_OPERAND (exp, 1)))
9607 = immed_double_int_const (mem_ref_offset (exp), address_mode);
9608 op0 = simplify_gen_binary (PLUS, address_mode, op0, off);
9610 op0 = memory_address_addr_space (mode, op0, as);
9611 temp = gen_rtx_MEM (mode, op0);
9612 set_mem_attributes (temp, exp, 0);
9613 set_mem_addr_space (temp, as);
9614 if (TREE_THIS_VOLATILE (exp))
9615 MEM_VOLATILE_P (temp) = 1;
9616 if (modifier != EXPAND_WRITE
9618 && align < GET_MODE_ALIGNMENT (mode))
9620 if ((icode = optab_handler (movmisalign_optab, mode))
9621 != CODE_FOR_nothing)
9623 struct expand_operand ops[2];
9625 /* We've already validated the memory, and we're creating a
9626 new pseudo destination. The predicates really can't fail,
9627 nor can the generator. */
9628 create_output_operand (&ops[0], NULL_RTX, mode);
9629 create_fixed_operand (&ops[1], temp);
9630 expand_insn (icode, 2, ops);
9631 return ops[0].value;
9633 else if (SLOW_UNALIGNED_ACCESS (mode, align))
9634 temp = extract_bit_field (temp, GET_MODE_BITSIZE (mode),
9635 0, TYPE_UNSIGNED (TREE_TYPE (exp)),
9636 true, (modifier == EXPAND_STACK_PARM
9637 ? NULL_RTX : target),
9646 tree array = treeop0;
9647 tree index = treeop1;
9649 /* Fold an expression like: "foo"[2].
9650 This is not done in fold so it won't happen inside &.
9651 Don't fold if this is for wide characters since it's too
9652 difficult to do correctly and this is a very rare case. */
9654 if (modifier != EXPAND_CONST_ADDRESS
9655 && modifier != EXPAND_INITIALIZER
9656 && modifier != EXPAND_MEMORY)
9658 tree t = fold_read_from_constant_string (exp);
9661 return expand_expr (t, target, tmode, modifier);
9664 /* If this is a constant index into a constant array,
9665 just get the value from the array. Handle both the cases when
9666 we have an explicit constructor and when our operand is a variable
9667 that was declared const. */
9669 if (modifier != EXPAND_CONST_ADDRESS
9670 && modifier != EXPAND_INITIALIZER
9671 && modifier != EXPAND_MEMORY
9672 && TREE_CODE (array) == CONSTRUCTOR
9673 && ! TREE_SIDE_EFFECTS (array)
9674 && TREE_CODE (index) == INTEGER_CST)
9676 unsigned HOST_WIDE_INT ix;
9679 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array), ix,
9681 if (tree_int_cst_equal (field, index))
9683 if (!TREE_SIDE_EFFECTS (value))
9684 return expand_expr (fold (value), target, tmode, modifier);
9689 else if (optimize >= 1
9690 && modifier != EXPAND_CONST_ADDRESS
9691 && modifier != EXPAND_INITIALIZER
9692 && modifier != EXPAND_MEMORY
9693 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
9694 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
9695 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
9696 && const_value_known_p (array))
9698 if (TREE_CODE (index) == INTEGER_CST)
9700 tree init = DECL_INITIAL (array);
9702 if (TREE_CODE (init) == CONSTRUCTOR)
9704 unsigned HOST_WIDE_INT ix;
9707 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), ix,
9709 if (tree_int_cst_equal (field, index))
9711 if (TREE_SIDE_EFFECTS (value))
9714 if (TREE_CODE (value) == CONSTRUCTOR)
9716 /* If VALUE is a CONSTRUCTOR, this
9717 optimization is only useful if
9718 this doesn't store the CONSTRUCTOR
9719 into memory. If it does, it is more
9720 efficient to just load the data from
9721 the array directly. */
9722 rtx ret = expand_constructor (value, target,
9724 if (ret == NULL_RTX)
9728 return expand_expr (fold (value), target, tmode,
9732 else if(TREE_CODE (init) == STRING_CST)
9734 tree index1 = index;
9735 tree low_bound = array_ref_low_bound (exp);
9736 index1 = fold_convert_loc (loc, sizetype,
9739 /* Optimize the special-case of a zero lower bound.
9741 We convert the low_bound to sizetype to avoid some problems
9742 with constant folding. (E.g. suppose the lower bound is 1,
9743 and its mode is QI. Without the conversion,l (ARRAY
9744 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
9745 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
9747 if (! integer_zerop (low_bound))
9748 index1 = size_diffop_loc (loc, index1,
9749 fold_convert_loc (loc, sizetype,
9752 if (0 > compare_tree_int (index1,
9753 TREE_STRING_LENGTH (init)))
9755 tree type = TREE_TYPE (TREE_TYPE (init));
9756 enum machine_mode mode = TYPE_MODE (type);
9758 if (GET_MODE_CLASS (mode) == MODE_INT
9759 && GET_MODE_SIZE (mode) == 1)
9760 return gen_int_mode (TREE_STRING_POINTER (init)
9761 [TREE_INT_CST_LOW (index1)],
9768 goto normal_inner_ref;
9771 /* If the operand is a CONSTRUCTOR, we can just extract the
9772 appropriate field if it is present. */
9773 if (TREE_CODE (treeop0) == CONSTRUCTOR)
9775 unsigned HOST_WIDE_INT idx;
9778 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0),
9780 if (field == treeop1
9781 /* We can normally use the value of the field in the
9782 CONSTRUCTOR. However, if this is a bitfield in
9783 an integral mode that we can fit in a HOST_WIDE_INT,
9784 we must mask only the number of bits in the bitfield,
9785 since this is done implicitly by the constructor. If
9786 the bitfield does not meet either of those conditions,
9787 we can't do this optimization. */
9788 && (! DECL_BIT_FIELD (field)
9789 || ((GET_MODE_CLASS (DECL_MODE (field)) == MODE_INT)
9790 && (GET_MODE_PRECISION (DECL_MODE (field))
9791 <= HOST_BITS_PER_WIDE_INT))))
9793 if (DECL_BIT_FIELD (field)
9794 && modifier == EXPAND_STACK_PARM)
9796 op0 = expand_expr (value, target, tmode, modifier);
9797 if (DECL_BIT_FIELD (field))
9799 HOST_WIDE_INT bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
9800 enum machine_mode imode = TYPE_MODE (TREE_TYPE (field));
9802 if (TYPE_UNSIGNED (TREE_TYPE (field)))
9804 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
9805 op0 = expand_and (imode, op0, op1, target);
9809 int count = GET_MODE_PRECISION (imode) - bitsize;
9811 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
9813 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
9821 goto normal_inner_ref;
9824 case ARRAY_RANGE_REF:
9827 enum machine_mode mode1, mode2;
9828 HOST_WIDE_INT bitsize, bitpos;
9830 int volatilep = 0, must_force_mem;
9831 bool packedp = false;
9832 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
9833 &mode1, &unsignedp, &volatilep, true);
9834 rtx orig_op0, memloc;
9835 bool mem_attrs_from_type = false;
9837 /* If we got back the original object, something is wrong. Perhaps
9838 we are evaluating an expression too early. In any event, don't
9839 infinitely recurse. */
9840 gcc_assert (tem != exp);
9842 if (TYPE_PACKED (TREE_TYPE (TREE_OPERAND (exp, 0)))
9843 || (TREE_CODE (TREE_OPERAND (exp, 1)) == FIELD_DECL
9844 && DECL_PACKED (TREE_OPERAND (exp, 1))))
9847 /* If TEM's type is a union of variable size, pass TARGET to the inner
9848 computation, since it will need a temporary and TARGET is known
9849 to have to do. This occurs in unchecked conversion in Ada. */
9852 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9853 && COMPLETE_TYPE_P (TREE_TYPE (tem))
9854 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9856 && modifier != EXPAND_STACK_PARM
9857 ? target : NULL_RTX),
9859 (modifier == EXPAND_INITIALIZER
9860 || modifier == EXPAND_CONST_ADDRESS
9861 || modifier == EXPAND_STACK_PARM)
9862 ? modifier : EXPAND_NORMAL);
9865 /* If the bitfield is volatile, we want to access it in the
9866 field's mode, not the computed mode.
9867 If a MEM has VOIDmode (external with incomplete type),
9868 use BLKmode for it instead. */
9871 if (volatilep && flag_strict_volatile_bitfields > 0)
9872 op0 = adjust_address (op0, mode1, 0);
9873 else if (GET_MODE (op0) == VOIDmode)
9874 op0 = adjust_address (op0, BLKmode, 0);
9878 = CONSTANT_P (op0) ? TYPE_MODE (TREE_TYPE (tem)) : GET_MODE (op0);
9880 /* If we have either an offset, a BLKmode result, or a reference
9881 outside the underlying object, we must force it to memory.
9882 Such a case can occur in Ada if we have unchecked conversion
9883 of an expression from a scalar type to an aggregate type or
9884 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
9885 passed a partially uninitialized object or a view-conversion
9886 to a larger size. */
9887 must_force_mem = (offset
9889 || bitpos + bitsize > GET_MODE_BITSIZE (mode2));
9891 /* Handle CONCAT first. */
9892 if (GET_CODE (op0) == CONCAT && !must_force_mem)
9895 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
9898 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9901 op0 = XEXP (op0, 0);
9902 mode2 = GET_MODE (op0);
9904 else if (bitpos == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
9905 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 1)))
9909 op0 = XEXP (op0, 1);
9911 mode2 = GET_MODE (op0);
9914 /* Otherwise force into memory. */
9918 /* If this is a constant, put it in a register if it is a legitimate
9919 constant and we don't need a memory reference. */
9920 if (CONSTANT_P (op0)
9922 && targetm.legitimate_constant_p (mode2, op0)
9924 op0 = force_reg (mode2, op0);
9926 /* Otherwise, if this is a constant, try to force it to the constant
9927 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9928 is a legitimate constant. */
9929 else if (CONSTANT_P (op0) && (memloc = force_const_mem (mode2, op0)))
9930 op0 = validize_mem (memloc);
9932 /* Otherwise, if this is a constant or the object is not in memory
9933 and need be, put it there. */
9934 else if (CONSTANT_P (op0) || (!MEM_P (op0) && must_force_mem))
9936 tree nt = build_qualified_type (TREE_TYPE (tem),
9937 (TYPE_QUALS (TREE_TYPE (tem))
9938 | TYPE_QUAL_CONST));
9939 memloc = assign_temp (nt, 1, 1);
9940 emit_move_insn (memloc, op0);
9942 mem_attrs_from_type = true;
9947 enum machine_mode address_mode;
9948 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
9951 gcc_assert (MEM_P (op0));
9953 address_mode = get_address_mode (op0);
9954 if (GET_MODE (offset_rtx) != address_mode)
9955 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
9957 if (GET_MODE (op0) == BLKmode
9958 /* A constant address in OP0 can have VOIDmode, we must
9959 not try to call force_reg in that case. */
9960 && GET_MODE (XEXP (op0, 0)) != VOIDmode
9962 && (bitpos % bitsize) == 0
9963 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
9964 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
9966 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9970 op0 = offset_address (op0, offset_rtx,
9971 highest_pow2_factor (offset));
9974 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9975 record its alignment as BIGGEST_ALIGNMENT. */
9976 if (MEM_P (op0) && bitpos == 0 && offset != 0
9977 && is_aligning_offset (offset, tem))
9978 set_mem_align (op0, BIGGEST_ALIGNMENT);
9980 /* Don't forget about volatility even if this is a bitfield. */
9981 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
9983 if (op0 == orig_op0)
9984 op0 = copy_rtx (op0);
9986 MEM_VOLATILE_P (op0) = 1;
9989 /* In cases where an aligned union has an unaligned object
9990 as a field, we might be extracting a BLKmode value from
9991 an integer-mode (e.g., SImode) object. Handle this case
9992 by doing the extract into an object as wide as the field
9993 (which we know to be the width of a basic mode), then
9994 storing into memory, and changing the mode to BLKmode. */
9995 if (mode1 == VOIDmode
9996 || REG_P (op0) || GET_CODE (op0) == SUBREG
9997 || (mode1 != BLKmode && ! direct_load[(int) mode1]
9998 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
9999 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
10000 && modifier != EXPAND_CONST_ADDRESS
10001 && modifier != EXPAND_INITIALIZER)
10002 /* If the field is volatile, we always want an aligned
10003 access. Do this in following two situations:
10004 1. the access is not already naturally
10005 aligned, otherwise "normal" (non-bitfield) volatile fields
10006 become non-addressable.
10007 2. the bitsize is narrower than the access size. Need
10008 to extract bitfields from the access. */
10009 || (volatilep && flag_strict_volatile_bitfields > 0
10010 && (bitpos % GET_MODE_ALIGNMENT (mode) != 0
10011 || (mode1 != BLKmode
10012 && bitsize < GET_MODE_SIZE (mode1) * BITS_PER_UNIT)))
10013 /* If the field isn't aligned enough to fetch as a memref,
10014 fetch it as a bit field. */
10015 || (mode1 != BLKmode
10016 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
10017 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
10019 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
10020 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
10021 && ((modifier == EXPAND_CONST_ADDRESS
10022 || modifier == EXPAND_INITIALIZER)
10024 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
10025 || (bitpos % BITS_PER_UNIT != 0)))
10026 /* If the type and the field are a constant size and the
10027 size of the type isn't the same size as the bitfield,
10028 we must use bitfield operations. */
10030 && TYPE_SIZE (TREE_TYPE (exp))
10031 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
10032 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
10035 enum machine_mode ext_mode = mode;
10037 if (ext_mode == BLKmode
10038 && ! (target != 0 && MEM_P (op0)
10040 && bitpos % BITS_PER_UNIT == 0))
10041 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
10043 if (ext_mode == BLKmode)
10046 target = assign_temp (type, 1, 1);
10051 /* In this case, BITPOS must start at a byte boundary and
10052 TARGET, if specified, must be a MEM. */
10053 gcc_assert (MEM_P (op0)
10054 && (!target || MEM_P (target))
10055 && !(bitpos % BITS_PER_UNIT));
10057 emit_block_move (target,
10058 adjust_address (op0, VOIDmode,
10059 bitpos / BITS_PER_UNIT),
10060 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
10062 (modifier == EXPAND_STACK_PARM
10063 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
10068 op0 = validize_mem (op0);
10070 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
10071 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
10073 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp, packedp,
10074 (modifier == EXPAND_STACK_PARM
10075 ? NULL_RTX : target),
10076 ext_mode, ext_mode);
10078 /* If the result is a record type and BITSIZE is narrower than
10079 the mode of OP0, an integral mode, and this is a big endian
10080 machine, we must put the field into the high-order bits. */
10081 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
10082 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
10083 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
10084 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
10085 GET_MODE_BITSIZE (GET_MODE (op0))
10086 - bitsize, op0, 1);
10088 /* If the result type is BLKmode, store the data into a temporary
10089 of the appropriate type, but with the mode corresponding to the
10090 mode for the data we have (op0's mode). It's tempting to make
10091 this a constant type, since we know it's only being stored once,
10092 but that can cause problems if we are taking the address of this
10093 COMPONENT_REF because the MEM of any reference via that address
10094 will have flags corresponding to the type, which will not
10095 necessarily be constant. */
10096 if (mode == BLKmode)
10100 new_rtx = assign_stack_temp_for_type (ext_mode,
10101 GET_MODE_BITSIZE (ext_mode),
10103 emit_move_insn (new_rtx, op0);
10104 op0 = copy_rtx (new_rtx);
10105 PUT_MODE (op0, BLKmode);
10111 /* If the result is BLKmode, use that to access the object
10113 if (mode == BLKmode)
10116 /* Get a reference to just this component. */
10117 if (modifier == EXPAND_CONST_ADDRESS
10118 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
10119 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
10121 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
10123 if (op0 == orig_op0)
10124 op0 = copy_rtx (op0);
10126 /* If op0 is a temporary because of forcing to memory, pass only the
10127 type to set_mem_attributes so that the original expression is never
10128 marked as ADDRESSABLE through MEM_EXPR of the temporary. */
10129 if (mem_attrs_from_type)
10130 set_mem_attributes (op0, type, 0);
10132 set_mem_attributes (op0, exp, 0);
10134 if (REG_P (XEXP (op0, 0)))
10135 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
10137 MEM_VOLATILE_P (op0) |= volatilep;
10138 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
10139 || modifier == EXPAND_CONST_ADDRESS
10140 || modifier == EXPAND_INITIALIZER)
10142 else if (target == 0)
10143 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
10145 convert_move (target, op0, unsignedp);
10150 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
10153 /* All valid uses of __builtin_va_arg_pack () are removed during
10155 if (CALL_EXPR_VA_ARG_PACK (exp))
10156 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
10158 tree fndecl = get_callee_fndecl (exp), attr;
10161 && (attr = lookup_attribute ("error",
10162 DECL_ATTRIBUTES (fndecl))) != NULL)
10163 error ("%Kcall to %qs declared with attribute error: %s",
10164 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
10165 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
10167 && (attr = lookup_attribute ("warning",
10168 DECL_ATTRIBUTES (fndecl))) != NULL)
10169 warning_at (tree_nonartificial_location (exp),
10170 0, "%Kcall to %qs declared with attribute warning: %s",
10171 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
10172 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
10174 /* Check for a built-in function. */
10175 if (fndecl && DECL_BUILT_IN (fndecl))
10177 gcc_assert (DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_FRONTEND);
10178 return expand_builtin (exp, target, subtarget, tmode, ignore);
10181 return expand_call (exp, target, ignore);
10183 case VIEW_CONVERT_EXPR:
10186 /* If we are converting to BLKmode, try to avoid an intermediate
10187 temporary by fetching an inner memory reference. */
10188 if (mode == BLKmode
10189 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
10190 && TYPE_MODE (TREE_TYPE (treeop0)) != BLKmode
10191 && handled_component_p (treeop0))
10193 enum machine_mode mode1;
10194 HOST_WIDE_INT bitsize, bitpos;
10199 = get_inner_reference (treeop0, &bitsize, &bitpos,
10200 &offset, &mode1, &unsignedp, &volatilep,
10204 /* ??? We should work harder and deal with non-zero offsets. */
10206 && (bitpos % BITS_PER_UNIT) == 0
10208 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) == 0)
10210 /* See the normal_inner_ref case for the rationale. */
10212 = expand_expr (tem,
10213 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
10214 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
10216 && modifier != EXPAND_STACK_PARM
10217 ? target : NULL_RTX),
10219 (modifier == EXPAND_INITIALIZER
10220 || modifier == EXPAND_CONST_ADDRESS
10221 || modifier == EXPAND_STACK_PARM)
10222 ? modifier : EXPAND_NORMAL);
10224 if (MEM_P (orig_op0))
10228 /* Get a reference to just this component. */
10229 if (modifier == EXPAND_CONST_ADDRESS
10230 || modifier == EXPAND_SUM
10231 || modifier == EXPAND_INITIALIZER)
10232 op0 = adjust_address_nv (op0, mode, bitpos / BITS_PER_UNIT);
10234 op0 = adjust_address (op0, mode, bitpos / BITS_PER_UNIT);
10236 if (op0 == orig_op0)
10237 op0 = copy_rtx (op0);
10239 set_mem_attributes (op0, treeop0, 0);
10240 if (REG_P (XEXP (op0, 0)))
10241 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
10243 MEM_VOLATILE_P (op0) |= volatilep;
10249 op0 = expand_expr (treeop0,
10250 NULL_RTX, VOIDmode, modifier);
10252 /* If the input and output modes are both the same, we are done. */
10253 if (mode == GET_MODE (op0))
10255 /* If neither mode is BLKmode, and both modes are the same size
10256 then we can use gen_lowpart. */
10257 else if (mode != BLKmode && GET_MODE (op0) != BLKmode
10258 && (GET_MODE_PRECISION (mode)
10259 == GET_MODE_PRECISION (GET_MODE (op0)))
10260 && !COMPLEX_MODE_P (GET_MODE (op0)))
10262 if (GET_CODE (op0) == SUBREG)
10263 op0 = force_reg (GET_MODE (op0), op0);
10264 temp = gen_lowpart_common (mode, op0);
10269 if (!REG_P (op0) && !MEM_P (op0))
10270 op0 = force_reg (GET_MODE (op0), op0);
10271 op0 = gen_lowpart (mode, op0);
10274 /* If both types are integral, convert from one mode to the other. */
10275 else if (INTEGRAL_TYPE_P (type) && INTEGRAL_TYPE_P (TREE_TYPE (treeop0)))
10276 op0 = convert_modes (mode, GET_MODE (op0), op0,
10277 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
10278 /* As a last resort, spill op0 to memory, and reload it in a
10280 else if (!MEM_P (op0))
10282 /* If the operand is not a MEM, force it into memory. Since we
10283 are going to be changing the mode of the MEM, don't call
10284 force_const_mem for constants because we don't allow pool
10285 constants to change mode. */
10286 tree inner_type = TREE_TYPE (treeop0);
10288 gcc_assert (!TREE_ADDRESSABLE (exp));
10290 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
10292 = assign_stack_temp_for_type
10293 (TYPE_MODE (inner_type),
10294 GET_MODE_SIZE (TYPE_MODE (inner_type)), inner_type);
10296 emit_move_insn (target, op0);
10300 /* At this point, OP0 is in the correct mode. If the output type is
10301 such that the operand is known to be aligned, indicate that it is.
10302 Otherwise, we need only be concerned about alignment for non-BLKmode
10306 enum insn_code icode;
10308 if (TYPE_ALIGN_OK (type))
10310 /* ??? Copying the MEM without substantially changing it might
10311 run afoul of the code handling volatile memory references in
10312 store_expr, which assumes that TARGET is returned unmodified
10313 if it has been used. */
10314 op0 = copy_rtx (op0);
10315 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
10317 else if (mode != BLKmode
10318 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode)
10319 /* If the target does have special handling for unaligned
10320 loads of mode then use them. */
10321 && ((icode = optab_handler (movmisalign_optab, mode))
10322 != CODE_FOR_nothing))
10326 op0 = adjust_address (op0, mode, 0);
10327 /* We've already validated the memory, and we're creating a
10328 new pseudo destination. The predicates really can't
10330 reg = gen_reg_rtx (mode);
10332 /* Nor can the insn generator. */
10333 insn = GEN_FCN (icode) (reg, op0);
10337 else if (STRICT_ALIGNMENT
10339 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode))
10341 tree inner_type = TREE_TYPE (treeop0);
10342 HOST_WIDE_INT temp_size
10343 = MAX (int_size_in_bytes (inner_type),
10344 (HOST_WIDE_INT) GET_MODE_SIZE (mode));
10346 = assign_stack_temp_for_type (mode, temp_size, type);
10347 rtx new_with_op0_mode
10348 = adjust_address (new_rtx, GET_MODE (op0), 0);
10350 gcc_assert (!TREE_ADDRESSABLE (exp));
10352 if (GET_MODE (op0) == BLKmode)
10353 emit_block_move (new_with_op0_mode, op0,
10354 GEN_INT (GET_MODE_SIZE (mode)),
10355 (modifier == EXPAND_STACK_PARM
10356 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
10358 emit_move_insn (new_with_op0_mode, op0);
10363 op0 = adjust_address (op0, mode, 0);
10370 tree lhs = treeop0;
10371 tree rhs = treeop1;
10372 gcc_assert (ignore);
10374 /* Check for |= or &= of a bitfield of size one into another bitfield
10375 of size 1. In this case, (unless we need the result of the
10376 assignment) we can do this more efficiently with a
10377 test followed by an assignment, if necessary.
10379 ??? At this point, we can't get a BIT_FIELD_REF here. But if
10380 things change so we do, this code should be enhanced to
10382 if (TREE_CODE (lhs) == COMPONENT_REF
10383 && (TREE_CODE (rhs) == BIT_IOR_EXPR
10384 || TREE_CODE (rhs) == BIT_AND_EXPR)
10385 && TREE_OPERAND (rhs, 0) == lhs
10386 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
10387 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
10388 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
10390 rtx label = gen_label_rtx ();
10391 int value = TREE_CODE (rhs) == BIT_IOR_EXPR;
10392 do_jump (TREE_OPERAND (rhs, 1),
10394 value ? 0 : label, -1);
10395 expand_assignment (lhs, build_int_cst (TREE_TYPE (rhs), value),
10397 do_pending_stack_adjust ();
10398 emit_label (label);
10402 expand_assignment (lhs, rhs, false);
10407 return expand_expr_addr_expr (exp, target, tmode, modifier);
10409 case REALPART_EXPR:
10410 op0 = expand_normal (treeop0);
10411 return read_complex_part (op0, false);
10413 case IMAGPART_EXPR:
10414 op0 = expand_normal (treeop0);
10415 return read_complex_part (op0, true);
10422 /* Expanded in cfgexpand.c. */
10423 gcc_unreachable ();
10425 case TRY_CATCH_EXPR:
10427 case EH_FILTER_EXPR:
10428 case TRY_FINALLY_EXPR:
10429 /* Lowered by tree-eh.c. */
10430 gcc_unreachable ();
10432 case WITH_CLEANUP_EXPR:
10433 case CLEANUP_POINT_EXPR:
10435 case CASE_LABEL_EXPR:
10440 case COMPOUND_EXPR:
10441 case PREINCREMENT_EXPR:
10442 case PREDECREMENT_EXPR:
10443 case POSTINCREMENT_EXPR:
10444 case POSTDECREMENT_EXPR:
10447 case COMPOUND_LITERAL_EXPR:
10448 /* Lowered by gimplify.c. */
10449 gcc_unreachable ();
10452 /* Function descriptors are not valid except for as
10453 initialization constants, and should not be expanded. */
10454 gcc_unreachable ();
10456 case WITH_SIZE_EXPR:
10457 /* WITH_SIZE_EXPR expands to its first argument. The caller should
10458 have pulled out the size to use in whatever context it needed. */
10459 return expand_expr_real (treeop0, original_target, tmode,
10460 modifier, alt_rtl);
10463 return expand_expr_real_2 (&ops, target, tmode, modifier);
10467 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
10468 signedness of TYPE), possibly returning the result in TARGET. */
10470 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
10472 HOST_WIDE_INT prec = TYPE_PRECISION (type);
10473 if (target && GET_MODE (target) != GET_MODE (exp))
10475 /* For constant values, reduce using build_int_cst_type. */
10476 if (CONST_INT_P (exp))
10478 HOST_WIDE_INT value = INTVAL (exp);
10479 tree t = build_int_cst_type (type, value);
10480 return expand_expr (t, target, VOIDmode, EXPAND_NORMAL);
10482 else if (TYPE_UNSIGNED (type))
10484 rtx mask = immed_double_int_const (double_int::mask (prec),
10486 return expand_and (GET_MODE (exp), exp, mask, target);
10490 int count = GET_MODE_PRECISION (GET_MODE (exp)) - prec;
10491 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp),
10492 exp, count, target, 0);
10493 return expand_shift (RSHIFT_EXPR, GET_MODE (exp),
10494 exp, count, target, 0);
10498 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
10499 when applied to the address of EXP produces an address known to be
10500 aligned more than BIGGEST_ALIGNMENT. */
10503 is_aligning_offset (const_tree offset, const_tree exp)
10505 /* Strip off any conversions. */
10506 while (CONVERT_EXPR_P (offset))
10507 offset = TREE_OPERAND (offset, 0);
10509 /* We must now have a BIT_AND_EXPR with a constant that is one less than
10510 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
10511 if (TREE_CODE (offset) != BIT_AND_EXPR
10512 || !host_integerp (TREE_OPERAND (offset, 1), 1)
10513 || compare_tree_int (TREE_OPERAND (offset, 1),
10514 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
10515 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
10518 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
10519 It must be NEGATE_EXPR. Then strip any more conversions. */
10520 offset = TREE_OPERAND (offset, 0);
10521 while (CONVERT_EXPR_P (offset))
10522 offset = TREE_OPERAND (offset, 0);
10524 if (TREE_CODE (offset) != NEGATE_EXPR)
10527 offset = TREE_OPERAND (offset, 0);
10528 while (CONVERT_EXPR_P (offset))
10529 offset = TREE_OPERAND (offset, 0);
10531 /* This must now be the address of EXP. */
10532 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
10535 /* Return the tree node if an ARG corresponds to a string constant or zero
10536 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
10537 in bytes within the string that ARG is accessing. The type of the
10538 offset will be `sizetype'. */
10541 string_constant (tree arg, tree *ptr_offset)
10543 tree array, offset, lower_bound;
10546 if (TREE_CODE (arg) == ADDR_EXPR)
10548 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
10550 *ptr_offset = size_zero_node;
10551 return TREE_OPERAND (arg, 0);
10553 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
10555 array = TREE_OPERAND (arg, 0);
10556 offset = size_zero_node;
10558 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
10560 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
10561 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
10562 if (TREE_CODE (array) != STRING_CST
10563 && TREE_CODE (array) != VAR_DECL)
10566 /* Check if the array has a nonzero lower bound. */
10567 lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
10568 if (!integer_zerop (lower_bound))
10570 /* If the offset and base aren't both constants, return 0. */
10571 if (TREE_CODE (lower_bound) != INTEGER_CST)
10573 if (TREE_CODE (offset) != INTEGER_CST)
10575 /* Adjust offset by the lower bound. */
10576 offset = size_diffop (fold_convert (sizetype, offset),
10577 fold_convert (sizetype, lower_bound));
10580 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == MEM_REF)
10582 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
10583 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
10584 if (TREE_CODE (array) != ADDR_EXPR)
10586 array = TREE_OPERAND (array, 0);
10587 if (TREE_CODE (array) != STRING_CST
10588 && TREE_CODE (array) != VAR_DECL)
10594 else if (TREE_CODE (arg) == PLUS_EXPR || TREE_CODE (arg) == POINTER_PLUS_EXPR)
10596 tree arg0 = TREE_OPERAND (arg, 0);
10597 tree arg1 = TREE_OPERAND (arg, 1);
10602 if (TREE_CODE (arg0) == ADDR_EXPR
10603 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
10604 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
10606 array = TREE_OPERAND (arg0, 0);
10609 else if (TREE_CODE (arg1) == ADDR_EXPR
10610 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
10611 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
10613 array = TREE_OPERAND (arg1, 0);
10622 if (TREE_CODE (array) == STRING_CST)
10624 *ptr_offset = fold_convert (sizetype, offset);
10627 else if (TREE_CODE (array) == VAR_DECL
10628 || TREE_CODE (array) == CONST_DECL)
10632 /* Variables initialized to string literals can be handled too. */
10633 if (!const_value_known_p (array)
10634 || !DECL_INITIAL (array)
10635 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
10638 /* Avoid const char foo[4] = "abcde"; */
10639 if (DECL_SIZE_UNIT (array) == NULL_TREE
10640 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
10641 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
10642 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
10645 /* If variable is bigger than the string literal, OFFSET must be constant
10646 and inside of the bounds of the string literal. */
10647 offset = fold_convert (sizetype, offset);
10648 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
10649 && (! host_integerp (offset, 1)
10650 || compare_tree_int (offset, length) >= 0))
10653 *ptr_offset = offset;
10654 return DECL_INITIAL (array);
10660 /* Generate code to calculate OPS, and exploded expression
10661 using a store-flag instruction and return an rtx for the result.
10662 OPS reflects a comparison.
10664 If TARGET is nonzero, store the result there if convenient.
10666 Return zero if there is no suitable set-flag instruction
10667 available on this machine.
10669 Once expand_expr has been called on the arguments of the comparison,
10670 we are committed to doing the store flag, since it is not safe to
10671 re-evaluate the expression. We emit the store-flag insn by calling
10672 emit_store_flag, but only expand the arguments if we have a reason
10673 to believe that emit_store_flag will be successful. If we think that
10674 it will, but it isn't, we have to simulate the store-flag with a
10675 set/jump/set sequence. */
10678 do_store_flag (sepops ops, rtx target, enum machine_mode mode)
10680 enum rtx_code code;
10681 tree arg0, arg1, type;
10683 enum machine_mode operand_mode;
10686 rtx subtarget = target;
10687 location_t loc = ops->location;
10692 /* Don't crash if the comparison was erroneous. */
10693 if (arg0 == error_mark_node || arg1 == error_mark_node)
10696 type = TREE_TYPE (arg0);
10697 operand_mode = TYPE_MODE (type);
10698 unsignedp = TYPE_UNSIGNED (type);
10700 /* We won't bother with BLKmode store-flag operations because it would mean
10701 passing a lot of information to emit_store_flag. */
10702 if (operand_mode == BLKmode)
10705 /* We won't bother with store-flag operations involving function pointers
10706 when function pointers must be canonicalized before comparisons. */
10707 #ifdef HAVE_canonicalize_funcptr_for_compare
10708 if (HAVE_canonicalize_funcptr_for_compare
10709 && ((TREE_CODE (TREE_TYPE (arg0)) == POINTER_TYPE
10710 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0)))
10712 || (TREE_CODE (TREE_TYPE (arg1)) == POINTER_TYPE
10713 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1)))
10714 == FUNCTION_TYPE))))
10721 /* For vector typed comparisons emit code to generate the desired
10722 all-ones or all-zeros mask. Conveniently use the VEC_COND_EXPR
10723 expander for this. */
10724 if (TREE_CODE (ops->type) == VECTOR_TYPE)
10726 tree ifexp = build2 (ops->code, ops->type, arg0, arg1);
10727 tree if_true = constant_boolean_node (true, ops->type);
10728 tree if_false = constant_boolean_node (false, ops->type);
10729 return expand_vec_cond_expr (ops->type, ifexp, if_true, if_false, target);
10732 /* Get the rtx comparison code to use. We know that EXP is a comparison
10733 operation of some type. Some comparisons against 1 and -1 can be
10734 converted to comparisons with zero. Do so here so that the tests
10735 below will be aware that we have a comparison with zero. These
10736 tests will not catch constants in the first operand, but constants
10737 are rarely passed as the first operand. */
10748 if (integer_onep (arg1))
10749 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
10751 code = unsignedp ? LTU : LT;
10754 if (! unsignedp && integer_all_onesp (arg1))
10755 arg1 = integer_zero_node, code = LT;
10757 code = unsignedp ? LEU : LE;
10760 if (! unsignedp && integer_all_onesp (arg1))
10761 arg1 = integer_zero_node, code = GE;
10763 code = unsignedp ? GTU : GT;
10766 if (integer_onep (arg1))
10767 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
10769 code = unsignedp ? GEU : GE;
10772 case UNORDERED_EXPR:
10798 gcc_unreachable ();
10801 /* Put a constant second. */
10802 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST
10803 || TREE_CODE (arg0) == FIXED_CST)
10805 tem = arg0; arg0 = arg1; arg1 = tem;
10806 code = swap_condition (code);
10809 /* If this is an equality or inequality test of a single bit, we can
10810 do this by shifting the bit being tested to the low-order bit and
10811 masking the result with the constant 1. If the condition was EQ,
10812 we xor it with 1. This does not require an scc insn and is faster
10813 than an scc insn even if we have it.
10815 The code to make this transformation was moved into fold_single_bit_test,
10816 so we just call into the folder and expand its result. */
10818 if ((code == NE || code == EQ)
10819 && integer_zerop (arg1)
10820 && (TYPE_PRECISION (ops->type) != 1 || TYPE_UNSIGNED (ops->type)))
10822 gimple srcstmt = get_def_for_expr (arg0, BIT_AND_EXPR);
10824 && integer_pow2p (gimple_assign_rhs2 (srcstmt)))
10826 enum tree_code tcode = code == NE ? NE_EXPR : EQ_EXPR;
10827 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
10828 tree temp = fold_build2_loc (loc, BIT_AND_EXPR, TREE_TYPE (arg1),
10829 gimple_assign_rhs1 (srcstmt),
10830 gimple_assign_rhs2 (srcstmt));
10831 temp = fold_single_bit_test (loc, tcode, temp, arg1, type);
10833 return expand_expr (temp, target, VOIDmode, EXPAND_NORMAL);
10837 if (! get_subtarget (target)
10838 || GET_MODE (subtarget) != operand_mode)
10841 expand_operands (arg0, arg1, subtarget, &op0, &op1, EXPAND_NORMAL);
10844 target = gen_reg_rtx (mode);
10846 /* Try a cstore if possible. */
10847 return emit_store_flag_force (target, code, op0, op1,
10848 operand_mode, unsignedp,
10849 (TYPE_PRECISION (ops->type) == 1
10850 && !TYPE_UNSIGNED (ops->type)) ? -1 : 1);
10854 /* Stubs in case we haven't got a casesi insn. */
10855 #ifndef HAVE_casesi
10856 # define HAVE_casesi 0
10857 # define gen_casesi(a, b, c, d, e) (0)
10858 # define CODE_FOR_casesi CODE_FOR_nothing
10861 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10862 0 otherwise (i.e. if there is no casesi instruction).
10864 DEFAULT_PROBABILITY is the probability of jumping to the default
10867 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
10868 rtx table_label, rtx default_label, rtx fallback_label,
10869 int default_probability)
10871 struct expand_operand ops[5];
10872 enum machine_mode index_mode = SImode;
10873 rtx op1, op2, index;
10878 /* Convert the index to SImode. */
10879 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10881 enum machine_mode omode = TYPE_MODE (index_type);
10882 rtx rangertx = expand_normal (range);
10884 /* We must handle the endpoints in the original mode. */
10885 index_expr = build2 (MINUS_EXPR, index_type,
10886 index_expr, minval);
10887 minval = integer_zero_node;
10888 index = expand_normal (index_expr);
10890 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10891 omode, 1, default_label,
10892 default_probability);
10893 /* Now we can safely truncate. */
10894 index = convert_to_mode (index_mode, index, 0);
10898 if (TYPE_MODE (index_type) != index_mode)
10900 index_type = lang_hooks.types.type_for_mode (index_mode, 0);
10901 index_expr = fold_convert (index_type, index_expr);
10904 index = expand_normal (index_expr);
10907 do_pending_stack_adjust ();
10909 op1 = expand_normal (minval);
10910 op2 = expand_normal (range);
10912 create_input_operand (&ops[0], index, index_mode);
10913 create_convert_operand_from_type (&ops[1], op1, TREE_TYPE (minval));
10914 create_convert_operand_from_type (&ops[2], op2, TREE_TYPE (range));
10915 create_fixed_operand (&ops[3], table_label);
10916 create_fixed_operand (&ops[4], (default_label
10918 : fallback_label));
10919 expand_jump_insn (CODE_FOR_casesi, 5, ops);
10923 /* Attempt to generate a tablejump instruction; same concept. */
10924 #ifndef HAVE_tablejump
10925 #define HAVE_tablejump 0
10926 #define gen_tablejump(x, y) (0)
10929 /* Subroutine of the next function.
10931 INDEX is the value being switched on, with the lowest value
10932 in the table already subtracted.
10933 MODE is its expected mode (needed if INDEX is constant).
10934 RANGE is the length of the jump table.
10935 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10937 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10938 index value is out of range.
10939 DEFAULT_PROBABILITY is the probability of jumping to
10940 the default label. */
10943 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
10944 rtx default_label, int default_probability)
10948 if (INTVAL (range) > cfun->cfg->max_jumptable_ents)
10949 cfun->cfg->max_jumptable_ents = INTVAL (range);
10951 /* Do an unsigned comparison (in the proper mode) between the index
10952 expression and the value which represents the length of the range.
10953 Since we just finished subtracting the lower bound of the range
10954 from the index expression, this comparison allows us to simultaneously
10955 check that the original index expression value is both greater than
10956 or equal to the minimum value of the range and less than or equal to
10957 the maximum value of the range. */
10960 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10961 default_label, default_probability);
10964 /* If index is in range, it must fit in Pmode.
10965 Convert to Pmode so we can index with it. */
10967 index = convert_to_mode (Pmode, index, 1);
10969 /* Don't let a MEM slip through, because then INDEX that comes
10970 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10971 and break_out_memory_refs will go to work on it and mess it up. */
10972 #ifdef PIC_CASE_VECTOR_ADDRESS
10973 if (flag_pic && !REG_P (index))
10974 index = copy_to_mode_reg (Pmode, index);
10977 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10978 GET_MODE_SIZE, because this indicates how large insns are. The other
10979 uses should all be Pmode, because they are addresses. This code
10980 could fail if addresses and insns are not the same size. */
10981 index = gen_rtx_PLUS (Pmode,
10982 gen_rtx_MULT (Pmode, index,
10983 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10984 gen_rtx_LABEL_REF (Pmode, table_label));
10985 #ifdef PIC_CASE_VECTOR_ADDRESS
10987 index = PIC_CASE_VECTOR_ADDRESS (index);
10990 index = memory_address (CASE_VECTOR_MODE, index);
10991 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10992 vector = gen_const_mem (CASE_VECTOR_MODE, index);
10993 convert_move (temp, vector, 0);
10995 emit_jump_insn (gen_tablejump (temp, table_label));
10997 /* If we are generating PIC code or if the table is PC-relative, the
10998 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10999 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
11004 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
11005 rtx table_label, rtx default_label, int default_probability)
11009 if (! HAVE_tablejump)
11012 index_expr = fold_build2 (MINUS_EXPR, index_type,
11013 fold_convert (index_type, index_expr),
11014 fold_convert (index_type, minval));
11015 index = expand_normal (index_expr);
11016 do_pending_stack_adjust ();
11018 do_tablejump (index, TYPE_MODE (index_type),
11019 convert_modes (TYPE_MODE (index_type),
11020 TYPE_MODE (TREE_TYPE (range)),
11021 expand_normal (range),
11022 TYPE_UNSIGNED (TREE_TYPE (range))),
11023 table_label, default_label, default_probability);
11027 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
11029 const_vector_from_tree (tree exp)
11035 enum machine_mode inner, mode;
11037 mode = TYPE_MODE (TREE_TYPE (exp));
11039 if (initializer_zerop (exp))
11040 return CONST0_RTX (mode);
11042 units = GET_MODE_NUNITS (mode);
11043 inner = GET_MODE_INNER (mode);
11045 v = rtvec_alloc (units);
11047 for (i = 0; i < VECTOR_CST_NELTS (exp); ++i)
11049 elt = VECTOR_CST_ELT (exp, i);
11051 if (TREE_CODE (elt) == REAL_CST)
11052 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
11054 else if (TREE_CODE (elt) == FIXED_CST)
11055 RTVEC_ELT (v, i) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt),
11058 RTVEC_ELT (v, i) = immed_double_int_const (tree_to_double_int (elt),
11062 return gen_rtx_CONST_VECTOR (mode, v);
11065 /* Build a decl for a personality function given a language prefix. */
11068 build_personality_function (const char *lang)
11070 const char *unwind_and_version;
11074 switch (targetm_common.except_unwind_info (&global_options))
11079 unwind_and_version = "_sj0";
11083 unwind_and_version = "_v0";
11086 unwind_and_version = "_seh0";
11089 gcc_unreachable ();
11092 name = ACONCAT (("__", lang, "_personality", unwind_and_version, NULL));
11094 type = build_function_type_list (integer_type_node, integer_type_node,
11095 long_long_unsigned_type_node,
11096 ptr_type_node, ptr_type_node, NULL_TREE);
11097 decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
11098 get_identifier (name), type);
11099 DECL_ARTIFICIAL (decl) = 1;
11100 DECL_EXTERNAL (decl) = 1;
11101 TREE_PUBLIC (decl) = 1;
11103 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
11104 are the flags assigned by targetm.encode_section_info. */
11105 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl), 0), NULL);
11110 /* Extracts the personality function of DECL and returns the corresponding
11114 get_personality_function (tree decl)
11116 tree personality = DECL_FUNCTION_PERSONALITY (decl);
11117 enum eh_personality_kind pk;
11119 pk = function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl));
11120 if (pk == eh_personality_none)
11124 && pk == eh_personality_any)
11125 personality = lang_hooks.eh_personality ();
11127 if (pk == eh_personality_lang)
11128 gcc_assert (personality != NULL_TREE);
11130 return XEXP (DECL_RTL (personality), 0);
11133 #include "gt-expr.h"