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
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
32 #include "hard-reg-set.h"
35 #include "insn-config.h"
36 #include "insn-attr.h"
37 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
44 #include "typeclass.h"
47 #include "langhooks.h"
50 #include "tree-iterator.h"
51 #include "tree-pass.h"
52 #include "tree-flow.h"
56 #include "diagnostic.h"
57 #include "ssaexpand.h"
59 /* Decide whether a function's arguments should be processed
60 from first to last or from last to first.
62 They should if the stack and args grow in opposite directions, but
63 only if we have push insns. */
67 #ifndef PUSH_ARGS_REVERSED
68 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
69 #define PUSH_ARGS_REVERSED /* If it's last to first. */
75 #ifndef STACK_PUSH_CODE
76 #ifdef STACK_GROWS_DOWNWARD
77 #define STACK_PUSH_CODE PRE_DEC
79 #define STACK_PUSH_CODE PRE_INC
84 /* If this is nonzero, we do not bother generating VOLATILE
85 around volatile memory references, and we are willing to
86 output indirect addresses. If cse is to follow, we reject
87 indirect addresses so a useful potential cse is generated;
88 if it is used only once, instruction combination will produce
89 the same indirect address eventually. */
92 /* This structure is used by move_by_pieces to describe the move to
94 struct move_by_pieces_d
103 int explicit_inc_from;
104 unsigned HOST_WIDE_INT len;
105 HOST_WIDE_INT offset;
109 /* This structure is used by store_by_pieces to describe the clear to
112 struct store_by_pieces_d
118 unsigned HOST_WIDE_INT len;
119 HOST_WIDE_INT offset;
120 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode);
125 static unsigned HOST_WIDE_INT move_by_pieces_ninsns (unsigned HOST_WIDE_INT,
128 static void move_by_pieces_1 (rtx (*) (rtx, ...), enum machine_mode,
129 struct move_by_pieces_d *);
130 static bool block_move_libcall_safe_for_call_parm (void);
131 static bool emit_block_move_via_movmem (rtx, rtx, rtx, unsigned, unsigned, HOST_WIDE_INT);
132 static tree emit_block_move_libcall_fn (int);
133 static void emit_block_move_via_loop (rtx, rtx, rtx, unsigned);
134 static rtx clear_by_pieces_1 (void *, HOST_WIDE_INT, enum machine_mode);
135 static void clear_by_pieces (rtx, unsigned HOST_WIDE_INT, unsigned int);
136 static void store_by_pieces_1 (struct store_by_pieces_d *, unsigned int);
137 static void store_by_pieces_2 (rtx (*) (rtx, ...), enum machine_mode,
138 struct store_by_pieces_d *);
139 static tree clear_storage_libcall_fn (int);
140 static rtx compress_float_constant (rtx, rtx);
141 static rtx get_subtarget (rtx);
142 static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
143 HOST_WIDE_INT, enum machine_mode,
144 tree, tree, int, alias_set_type);
145 static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
146 static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT, enum machine_mode,
147 tree, tree, alias_set_type, bool);
149 static unsigned HOST_WIDE_INT highest_pow2_factor_for_target (const_tree, const_tree);
151 static int is_aligning_offset (const_tree, const_tree);
152 static void expand_operands (tree, tree, rtx, rtx*, rtx*,
153 enum expand_modifier);
154 static rtx reduce_to_bit_field_precision (rtx, rtx, tree);
155 static rtx do_store_flag (sepops, rtx, enum machine_mode);
157 static void emit_single_push_insn (enum machine_mode, rtx, tree);
159 static void do_tablejump (rtx, enum machine_mode, rtx, rtx, rtx);
160 static rtx const_vector_from_tree (tree);
161 static void write_complex_part (rtx, rtx, bool);
163 /* Record for each mode whether we can move a register directly to or
164 from an object of that mode in memory. If we can't, we won't try
165 to use that mode directly when accessing a field of that mode. */
167 static char direct_load[NUM_MACHINE_MODES];
168 static char direct_store[NUM_MACHINE_MODES];
170 /* Record for each mode whether we can float-extend from memory. */
172 static bool float_extend_from_mem[NUM_MACHINE_MODES][NUM_MACHINE_MODES];
174 /* This macro is used to determine whether move_by_pieces should be called
175 to perform a structure copy. */
176 #ifndef MOVE_BY_PIECES_P
177 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
178 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
179 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
182 /* This macro is used to determine whether clear_by_pieces should be
183 called to clear storage. */
184 #ifndef CLEAR_BY_PIECES_P
185 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
186 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
187 < (unsigned int) CLEAR_RATIO (optimize_insn_for_speed_p ()))
190 /* This macro is used to determine whether store_by_pieces should be
191 called to "memset" storage with byte values other than zero. */
192 #ifndef SET_BY_PIECES_P
193 #define SET_BY_PIECES_P(SIZE, ALIGN) \
194 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
195 < (unsigned int) SET_RATIO (optimize_insn_for_speed_p ()))
198 /* This macro is used to determine whether store_by_pieces should be
199 called to "memcpy" storage when the source is a constant string. */
200 #ifndef STORE_BY_PIECES_P
201 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
202 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
203 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
206 /* This array records the insn_code of insns to perform block moves. */
207 enum insn_code movmem_optab[NUM_MACHINE_MODES];
209 /* This array records the insn_code of insns to perform block sets. */
210 enum insn_code setmem_optab[NUM_MACHINE_MODES];
212 /* These arrays record the insn_code of three different kinds of insns
213 to perform block compares. */
214 enum insn_code cmpstr_optab[NUM_MACHINE_MODES];
215 enum insn_code cmpstrn_optab[NUM_MACHINE_MODES];
216 enum insn_code cmpmem_optab[NUM_MACHINE_MODES];
218 /* Synchronization primitives. */
219 enum insn_code sync_add_optab[NUM_MACHINE_MODES];
220 enum insn_code sync_sub_optab[NUM_MACHINE_MODES];
221 enum insn_code sync_ior_optab[NUM_MACHINE_MODES];
222 enum insn_code sync_and_optab[NUM_MACHINE_MODES];
223 enum insn_code sync_xor_optab[NUM_MACHINE_MODES];
224 enum insn_code sync_nand_optab[NUM_MACHINE_MODES];
225 enum insn_code sync_old_add_optab[NUM_MACHINE_MODES];
226 enum insn_code sync_old_sub_optab[NUM_MACHINE_MODES];
227 enum insn_code sync_old_ior_optab[NUM_MACHINE_MODES];
228 enum insn_code sync_old_and_optab[NUM_MACHINE_MODES];
229 enum insn_code sync_old_xor_optab[NUM_MACHINE_MODES];
230 enum insn_code sync_old_nand_optab[NUM_MACHINE_MODES];
231 enum insn_code sync_new_add_optab[NUM_MACHINE_MODES];
232 enum insn_code sync_new_sub_optab[NUM_MACHINE_MODES];
233 enum insn_code sync_new_ior_optab[NUM_MACHINE_MODES];
234 enum insn_code sync_new_and_optab[NUM_MACHINE_MODES];
235 enum insn_code sync_new_xor_optab[NUM_MACHINE_MODES];
236 enum insn_code sync_new_nand_optab[NUM_MACHINE_MODES];
237 enum insn_code sync_compare_and_swap[NUM_MACHINE_MODES];
238 enum insn_code sync_lock_test_and_set[NUM_MACHINE_MODES];
239 enum insn_code sync_lock_release[NUM_MACHINE_MODES];
241 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
243 #ifndef SLOW_UNALIGNED_ACCESS
244 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
247 /* This is run to set up which modes can be used
248 directly in memory and to initialize the block move optab. It is run
249 at the beginning of compilation and when the target is reinitialized. */
252 init_expr_target (void)
255 enum machine_mode mode;
260 /* Try indexing by frame ptr and try by stack ptr.
261 It is known that on the Convex the stack ptr isn't a valid index.
262 With luck, one or the other is valid on any machine. */
263 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
264 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
266 /* A scratch register we can modify in-place below to avoid
267 useless RTL allocations. */
268 reg = gen_rtx_REG (VOIDmode, -1);
270 insn = rtx_alloc (INSN);
271 pat = gen_rtx_SET (VOIDmode, NULL_RTX, NULL_RTX);
272 PATTERN (insn) = pat;
274 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
275 mode = (enum machine_mode) ((int) mode + 1))
279 direct_load[(int) mode] = direct_store[(int) mode] = 0;
280 PUT_MODE (mem, mode);
281 PUT_MODE (mem1, mode);
282 PUT_MODE (reg, mode);
284 /* See if there is some register that can be used in this mode and
285 directly loaded or stored from memory. */
287 if (mode != VOIDmode && mode != BLKmode)
288 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
289 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
292 if (! HARD_REGNO_MODE_OK (regno, mode))
295 SET_REGNO (reg, regno);
298 SET_DEST (pat) = reg;
299 if (recog (pat, insn, &num_clobbers) >= 0)
300 direct_load[(int) mode] = 1;
302 SET_SRC (pat) = mem1;
303 SET_DEST (pat) = reg;
304 if (recog (pat, insn, &num_clobbers) >= 0)
305 direct_load[(int) mode] = 1;
308 SET_DEST (pat) = mem;
309 if (recog (pat, insn, &num_clobbers) >= 0)
310 direct_store[(int) mode] = 1;
313 SET_DEST (pat) = mem1;
314 if (recog (pat, insn, &num_clobbers) >= 0)
315 direct_store[(int) mode] = 1;
319 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
321 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
322 mode = GET_MODE_WIDER_MODE (mode))
324 enum machine_mode srcmode;
325 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
326 srcmode = GET_MODE_WIDER_MODE (srcmode))
330 ic = can_extend_p (mode, srcmode, 0);
331 if (ic == CODE_FOR_nothing)
334 PUT_MODE (mem, srcmode);
336 if ((*insn_data[ic].operand[1].predicate) (mem, srcmode))
337 float_extend_from_mem[mode][srcmode] = true;
342 /* This is run at the start of compiling a function. */
347 memset (&crtl->expr, 0, sizeof (crtl->expr));
350 /* Copy data from FROM to TO, where the machine modes are not the same.
351 Both modes may be integer, or both may be floating, or both may be
353 UNSIGNEDP should be nonzero if FROM is an unsigned type.
354 This causes zero-extension instead of sign-extension. */
357 convert_move (rtx to, rtx from, int unsignedp)
359 enum machine_mode to_mode = GET_MODE (to);
360 enum machine_mode from_mode = GET_MODE (from);
361 int to_real = SCALAR_FLOAT_MODE_P (to_mode);
362 int from_real = SCALAR_FLOAT_MODE_P (from_mode);
366 /* rtx code for making an equivalent value. */
367 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
368 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
371 gcc_assert (to_real == from_real);
372 gcc_assert (to_mode != BLKmode);
373 gcc_assert (from_mode != BLKmode);
375 /* If the source and destination are already the same, then there's
380 /* If FROM is a SUBREG that indicates that we have already done at least
381 the required extension, strip it. We don't handle such SUBREGs as
384 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
385 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
386 >= GET_MODE_SIZE (to_mode))
387 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
388 from = gen_lowpart (to_mode, from), from_mode = to_mode;
390 gcc_assert (GET_CODE (to) != SUBREG || !SUBREG_PROMOTED_VAR_P (to));
392 if (to_mode == from_mode
393 || (from_mode == VOIDmode && CONSTANT_P (from)))
395 emit_move_insn (to, from);
399 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
401 gcc_assert (GET_MODE_BITSIZE (from_mode) == GET_MODE_BITSIZE (to_mode));
403 if (VECTOR_MODE_P (to_mode))
404 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
406 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
408 emit_move_insn (to, from);
412 if (GET_CODE (to) == CONCAT && GET_CODE (from) == CONCAT)
414 convert_move (XEXP (to, 0), XEXP (from, 0), unsignedp);
415 convert_move (XEXP (to, 1), XEXP (from, 1), unsignedp);
424 gcc_assert ((GET_MODE_PRECISION (from_mode)
425 != GET_MODE_PRECISION (to_mode))
426 || (DECIMAL_FLOAT_MODE_P (from_mode)
427 != DECIMAL_FLOAT_MODE_P (to_mode)));
429 if (GET_MODE_PRECISION (from_mode) == GET_MODE_PRECISION (to_mode))
430 /* Conversion between decimal float and binary float, same size. */
431 tab = DECIMAL_FLOAT_MODE_P (from_mode) ? trunc_optab : sext_optab;
432 else if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode))
437 /* Try converting directly if the insn is supported. */
439 code = convert_optab_handler (tab, to_mode, from_mode)->insn_code;
440 if (code != CODE_FOR_nothing)
442 emit_unop_insn (code, to, from,
443 tab == sext_optab ? FLOAT_EXTEND : FLOAT_TRUNCATE);
447 /* Otherwise use a libcall. */
448 libcall = convert_optab_libfunc (tab, to_mode, from_mode);
450 /* Is this conversion implemented yet? */
451 gcc_assert (libcall);
454 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
456 insns = get_insns ();
458 emit_libcall_block (insns, to, value,
459 tab == trunc_optab ? gen_rtx_FLOAT_TRUNCATE (to_mode,
461 : gen_rtx_FLOAT_EXTEND (to_mode, from));
465 /* Handle pointer conversion. */ /* SPEE 900220. */
466 /* Targets are expected to provide conversion insns between PxImode and
467 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
468 if (GET_MODE_CLASS (to_mode) == MODE_PARTIAL_INT)
470 enum machine_mode full_mode
471 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode), MODE_INT);
473 gcc_assert (convert_optab_handler (trunc_optab, to_mode, full_mode)->insn_code
474 != CODE_FOR_nothing);
476 if (full_mode != from_mode)
477 from = convert_to_mode (full_mode, from, unsignedp);
478 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, full_mode)->insn_code,
482 if (GET_MODE_CLASS (from_mode) == MODE_PARTIAL_INT)
485 enum machine_mode full_mode
486 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode), MODE_INT);
488 gcc_assert (convert_optab_handler (sext_optab, full_mode, from_mode)->insn_code
489 != CODE_FOR_nothing);
491 if (to_mode == full_mode)
493 emit_unop_insn (convert_optab_handler (sext_optab, full_mode, from_mode)->insn_code,
498 new_from = gen_reg_rtx (full_mode);
499 emit_unop_insn (convert_optab_handler (sext_optab, full_mode, from_mode)->insn_code,
500 new_from, from, UNKNOWN);
502 /* else proceed to integer conversions below. */
503 from_mode = full_mode;
507 /* Make sure both are fixed-point modes or both are not. */
508 gcc_assert (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode) ==
509 ALL_SCALAR_FIXED_POINT_MODE_P (to_mode));
510 if (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode))
512 /* If we widen from_mode to to_mode and they are in the same class,
513 we won't saturate the result.
514 Otherwise, always saturate the result to play safe. */
515 if (GET_MODE_CLASS (from_mode) == GET_MODE_CLASS (to_mode)
516 && GET_MODE_SIZE (from_mode) < GET_MODE_SIZE (to_mode))
517 expand_fixed_convert (to, from, 0, 0);
519 expand_fixed_convert (to, from, 0, 1);
523 /* Now both modes are integers. */
525 /* Handle expanding beyond a word. */
526 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
527 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
534 enum machine_mode lowpart_mode;
535 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
537 /* Try converting directly if the insn is supported. */
538 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
541 /* If FROM is a SUBREG, put it into a register. Do this
542 so that we always generate the same set of insns for
543 better cse'ing; if an intermediate assignment occurred,
544 we won't be doing the operation directly on the SUBREG. */
545 if (optimize > 0 && GET_CODE (from) == SUBREG)
546 from = force_reg (from_mode, from);
547 emit_unop_insn (code, to, from, equiv_code);
550 /* Next, try converting via full word. */
551 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
552 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
553 != CODE_FOR_nothing))
555 rtx word_to = gen_reg_rtx (word_mode);
558 if (reg_overlap_mentioned_p (to, from))
559 from = force_reg (from_mode, from);
562 convert_move (word_to, from, unsignedp);
563 emit_unop_insn (code, to, word_to, equiv_code);
567 /* No special multiword conversion insn; do it by hand. */
570 /* Since we will turn this into a no conflict block, we must ensure
571 that the source does not overlap the target. */
573 if (reg_overlap_mentioned_p (to, from))
574 from = force_reg (from_mode, from);
576 /* Get a copy of FROM widened to a word, if necessary. */
577 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
578 lowpart_mode = word_mode;
580 lowpart_mode = from_mode;
582 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
584 lowpart = gen_lowpart (lowpart_mode, to);
585 emit_move_insn (lowpart, lowfrom);
587 /* Compute the value to put in each remaining word. */
589 fill_value = const0_rtx;
591 fill_value = emit_store_flag (gen_reg_rtx (word_mode),
592 LT, lowfrom, const0_rtx,
595 /* Fill the remaining words. */
596 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
598 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
599 rtx subword = operand_subword (to, index, 1, to_mode);
601 gcc_assert (subword);
603 if (fill_value != subword)
604 emit_move_insn (subword, fill_value);
607 insns = get_insns ();
614 /* Truncating multi-word to a word or less. */
615 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
616 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
619 && ! MEM_VOLATILE_P (from)
620 && direct_load[(int) to_mode]
621 && ! mode_dependent_address_p (XEXP (from, 0)))
623 || GET_CODE (from) == SUBREG))
624 from = force_reg (from_mode, from);
625 convert_move (to, gen_lowpart (word_mode, from), 0);
629 /* Now follow all the conversions between integers
630 no more than a word long. */
632 /* For truncation, usually we can just refer to FROM in a narrower mode. */
633 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
634 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
635 GET_MODE_BITSIZE (from_mode)))
638 && ! MEM_VOLATILE_P (from)
639 && direct_load[(int) to_mode]
640 && ! mode_dependent_address_p (XEXP (from, 0)))
642 || GET_CODE (from) == SUBREG))
643 from = force_reg (from_mode, from);
644 if (REG_P (from) && REGNO (from) < FIRST_PSEUDO_REGISTER
645 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
646 from = copy_to_reg (from);
647 emit_move_insn (to, gen_lowpart (to_mode, from));
651 /* Handle extension. */
652 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
654 /* Convert directly if that works. */
655 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
658 emit_unop_insn (code, to, from, equiv_code);
663 enum machine_mode intermediate;
667 /* Search for a mode to convert via. */
668 for (intermediate = from_mode; intermediate != VOIDmode;
669 intermediate = GET_MODE_WIDER_MODE (intermediate))
670 if (((can_extend_p (to_mode, intermediate, unsignedp)
672 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
673 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
674 GET_MODE_BITSIZE (intermediate))))
675 && (can_extend_p (intermediate, from_mode, unsignedp)
676 != CODE_FOR_nothing))
678 convert_move (to, convert_to_mode (intermediate, from,
679 unsignedp), unsignedp);
683 /* No suitable intermediate mode.
684 Generate what we need with shifts. */
685 shift_amount = build_int_cst (NULL_TREE,
686 GET_MODE_BITSIZE (to_mode)
687 - GET_MODE_BITSIZE (from_mode));
688 from = gen_lowpart (to_mode, force_reg (from_mode, from));
689 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
691 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
694 emit_move_insn (to, tmp);
699 /* Support special truncate insns for certain modes. */
700 if (convert_optab_handler (trunc_optab, to_mode, from_mode)->insn_code != CODE_FOR_nothing)
702 emit_unop_insn (convert_optab_handler (trunc_optab, to_mode, from_mode)->insn_code,
707 /* Handle truncation of volatile memrefs, and so on;
708 the things that couldn't be truncated directly,
709 and for which there was no special instruction.
711 ??? Code above formerly short-circuited this, for most integer
712 mode pairs, with a force_reg in from_mode followed by a recursive
713 call to this routine. Appears always to have been wrong. */
714 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
716 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
717 emit_move_insn (to, temp);
721 /* Mode combination is not recognized. */
725 /* Return an rtx for a value that would result
726 from converting X to mode MODE.
727 Both X and MODE may be floating, or both integer.
728 UNSIGNEDP is nonzero if X is an unsigned value.
729 This can be done by referring to a part of X in place
730 or by copying to a new temporary with conversion. */
733 convert_to_mode (enum machine_mode mode, rtx x, int unsignedp)
735 return convert_modes (mode, VOIDmode, x, unsignedp);
738 /* Return an rtx for a value that would result
739 from converting X from mode OLDMODE to mode MODE.
740 Both modes may be floating, or both integer.
741 UNSIGNEDP is nonzero if X is an unsigned value.
743 This can be done by referring to a part of X in place
744 or by copying to a new temporary with conversion.
746 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
749 convert_modes (enum machine_mode mode, enum machine_mode oldmode, rtx x, int unsignedp)
753 /* If FROM is a SUBREG that indicates that we have already done at least
754 the required extension, strip it. */
756 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
757 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
758 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
759 x = gen_lowpart (mode, x);
761 if (GET_MODE (x) != VOIDmode)
762 oldmode = GET_MODE (x);
767 /* There is one case that we must handle specially: If we are converting
768 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
769 we are to interpret the constant as unsigned, gen_lowpart will do
770 the wrong if the constant appears negative. What we want to do is
771 make the high-order word of the constant zero, not all ones. */
773 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
774 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
775 && CONST_INT_P (x) && INTVAL (x) < 0)
777 HOST_WIDE_INT val = INTVAL (x);
779 if (oldmode != VOIDmode
780 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
782 int width = GET_MODE_BITSIZE (oldmode);
784 /* We need to zero extend VAL. */
785 val &= ((HOST_WIDE_INT) 1 << width) - 1;
788 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
791 /* We can do this with a gen_lowpart if both desired and current modes
792 are integer, and this is either a constant integer, a register, or a
793 non-volatile MEM. Except for the constant case where MODE is no
794 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
797 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
798 || (GET_MODE_CLASS (mode) == MODE_INT
799 && GET_MODE_CLASS (oldmode) == MODE_INT
800 && (GET_CODE (x) == CONST_DOUBLE
801 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
802 && ((MEM_P (x) && ! MEM_VOLATILE_P (x)
803 && direct_load[(int) mode])
805 && (! HARD_REGISTER_P (x)
806 || HARD_REGNO_MODE_OK (REGNO (x), mode))
807 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
808 GET_MODE_BITSIZE (GET_MODE (x)))))))))
810 /* ?? If we don't know OLDMODE, we have to assume here that
811 X does not need sign- or zero-extension. This may not be
812 the case, but it's the best we can do. */
813 if (CONST_INT_P (x) && oldmode != VOIDmode
814 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
816 HOST_WIDE_INT val = INTVAL (x);
817 int width = GET_MODE_BITSIZE (oldmode);
819 /* We must sign or zero-extend in this case. Start by
820 zero-extending, then sign extend if we need to. */
821 val &= ((HOST_WIDE_INT) 1 << width) - 1;
823 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
824 val |= (HOST_WIDE_INT) (-1) << width;
826 return gen_int_mode (val, mode);
829 return gen_lowpart (mode, x);
832 /* Converting from integer constant into mode is always equivalent to an
834 if (VECTOR_MODE_P (mode) && GET_MODE (x) == VOIDmode)
836 gcc_assert (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (oldmode));
837 return simplify_gen_subreg (mode, x, oldmode, 0);
840 temp = gen_reg_rtx (mode);
841 convert_move (temp, x, unsignedp);
845 /* STORE_MAX_PIECES is the number of bytes at a time that we can
846 store efficiently. Due to internal GCC limitations, this is
847 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
848 for an immediate constant. */
850 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
852 /* Determine whether the LEN bytes can be moved by using several move
853 instructions. Return nonzero if a call to move_by_pieces should
857 can_move_by_pieces (unsigned HOST_WIDE_INT len,
858 unsigned int align ATTRIBUTE_UNUSED)
860 return MOVE_BY_PIECES_P (len, align);
863 /* Generate several move instructions to copy LEN bytes from block FROM to
864 block TO. (These are MEM rtx's with BLKmode).
866 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
867 used to push FROM to the stack.
869 ALIGN is maximum stack alignment we can assume.
871 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
872 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
876 move_by_pieces (rtx to, rtx from, unsigned HOST_WIDE_INT len,
877 unsigned int align, int endp)
879 struct move_by_pieces_d data;
880 enum machine_mode to_addr_mode, from_addr_mode
881 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (from));
882 rtx to_addr, from_addr = XEXP (from, 0);
883 unsigned int max_size = MOVE_MAX_PIECES + 1;
884 enum machine_mode mode = VOIDmode, tmode;
885 enum insn_code icode;
887 align = MIN (to ? MEM_ALIGN (to) : align, MEM_ALIGN (from));
890 data.from_addr = from_addr;
893 to_addr_mode = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
894 to_addr = XEXP (to, 0);
897 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
898 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
900 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
904 to_addr_mode = VOIDmode;
908 #ifdef STACK_GROWS_DOWNWARD
914 data.to_addr = to_addr;
917 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
918 || GET_CODE (from_addr) == POST_INC
919 || GET_CODE (from_addr) == POST_DEC);
921 data.explicit_inc_from = 0;
922 data.explicit_inc_to = 0;
923 if (data.reverse) data.offset = len;
926 /* If copying requires more than two move insns,
927 copy addresses to registers (to make displacements shorter)
928 and use post-increment if available. */
929 if (!(data.autinc_from && data.autinc_to)
930 && move_by_pieces_ninsns (len, align, max_size) > 2)
932 /* Find the mode of the largest move... */
933 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
934 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
935 if (GET_MODE_SIZE (tmode) < max_size)
938 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
940 data.from_addr = copy_to_mode_reg (from_addr_mode,
941 plus_constant (from_addr, len));
942 data.autinc_from = 1;
943 data.explicit_inc_from = -1;
945 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
947 data.from_addr = copy_to_mode_reg (from_addr_mode, from_addr);
948 data.autinc_from = 1;
949 data.explicit_inc_from = 1;
951 if (!data.autinc_from && CONSTANT_P (from_addr))
952 data.from_addr = copy_to_mode_reg (from_addr_mode, from_addr);
953 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
955 data.to_addr = copy_to_mode_reg (to_addr_mode,
956 plus_constant (to_addr, len));
958 data.explicit_inc_to = -1;
960 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
962 data.to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
964 data.explicit_inc_to = 1;
966 if (!data.autinc_to && CONSTANT_P (to_addr))
967 data.to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
970 tmode = mode_for_size (MOVE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
971 if (align >= GET_MODE_ALIGNMENT (tmode))
972 align = GET_MODE_ALIGNMENT (tmode);
975 enum machine_mode xmode;
977 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
979 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
980 if (GET_MODE_SIZE (tmode) > MOVE_MAX_PIECES
981 || SLOW_UNALIGNED_ACCESS (tmode, align))
984 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
987 /* First move what we can in the largest integer mode, then go to
988 successively smaller modes. */
992 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
993 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
994 if (GET_MODE_SIZE (tmode) < max_size)
997 if (mode == VOIDmode)
1000 icode = optab_handler (mov_optab, mode)->insn_code;
1001 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1002 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
1004 max_size = GET_MODE_SIZE (mode);
1007 /* The code above should have handled everything. */
1008 gcc_assert (!data.len);
1014 gcc_assert (!data.reverse);
1019 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
1020 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
1022 data.to_addr = copy_to_mode_reg (to_addr_mode,
1023 plus_constant (data.to_addr,
1026 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
1033 to1 = adjust_address (data.to, QImode, data.offset);
1041 /* Return number of insns required to move L bytes by pieces.
1042 ALIGN (in bits) is maximum alignment we can assume. */
1044 static unsigned HOST_WIDE_INT
1045 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l, unsigned int align,
1046 unsigned int max_size)
1048 unsigned HOST_WIDE_INT n_insns = 0;
1049 enum machine_mode tmode;
1051 tmode = mode_for_size (MOVE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
1052 if (align >= GET_MODE_ALIGNMENT (tmode))
1053 align = GET_MODE_ALIGNMENT (tmode);
1056 enum machine_mode tmode, xmode;
1058 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
1060 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
1061 if (GET_MODE_SIZE (tmode) > MOVE_MAX_PIECES
1062 || SLOW_UNALIGNED_ACCESS (tmode, align))
1065 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
1068 while (max_size > 1)
1070 enum machine_mode mode = VOIDmode;
1071 enum insn_code icode;
1073 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1074 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1075 if (GET_MODE_SIZE (tmode) < max_size)
1078 if (mode == VOIDmode)
1081 icode = optab_handler (mov_optab, mode)->insn_code;
1082 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1083 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1085 max_size = GET_MODE_SIZE (mode);
1092 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1093 with move instructions for mode MODE. GENFUN is the gen_... function
1094 to make a move insn for that mode. DATA has all the other info. */
1097 move_by_pieces_1 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
1098 struct move_by_pieces_d *data)
1100 unsigned int size = GET_MODE_SIZE (mode);
1101 rtx to1 = NULL_RTX, from1;
1103 while (data->len >= size)
1106 data->offset -= size;
1110 if (data->autinc_to)
1111 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1114 to1 = adjust_address (data->to, mode, data->offset);
1117 if (data->autinc_from)
1118 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1121 from1 = adjust_address (data->from, mode, data->offset);
1123 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1124 emit_insn (gen_add2_insn (data->to_addr,
1125 GEN_INT (-(HOST_WIDE_INT)size)));
1126 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1127 emit_insn (gen_add2_insn (data->from_addr,
1128 GEN_INT (-(HOST_WIDE_INT)size)));
1131 emit_insn ((*genfun) (to1, from1));
1134 #ifdef PUSH_ROUNDING
1135 emit_single_push_insn (mode, from1, NULL);
1141 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1142 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1143 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1144 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1146 if (! data->reverse)
1147 data->offset += size;
1153 /* Emit code to move a block Y to a block X. This may be done with
1154 string-move instructions, with multiple scalar move instructions,
1155 or with a library call.
1157 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1158 SIZE is an rtx that says how long they are.
1159 ALIGN is the maximum alignment we can assume they have.
1160 METHOD describes what kind of copy this is, and what mechanisms may be used.
1162 Return the address of the new block, if memcpy is called and returns it,
1166 emit_block_move_hints (rtx x, rtx y, rtx size, enum block_op_methods method,
1167 unsigned int expected_align, HOST_WIDE_INT expected_size)
1175 case BLOCK_OP_NORMAL:
1176 case BLOCK_OP_TAILCALL:
1177 may_use_call = true;
1180 case BLOCK_OP_CALL_PARM:
1181 may_use_call = block_move_libcall_safe_for_call_parm ();
1183 /* Make inhibit_defer_pop nonzero around the library call
1184 to force it to pop the arguments right away. */
1188 case BLOCK_OP_NO_LIBCALL:
1189 may_use_call = false;
1196 align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1197 gcc_assert (align >= BITS_PER_UNIT);
1199 gcc_assert (MEM_P (x));
1200 gcc_assert (MEM_P (y));
1203 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1204 block copy is more efficient for other large modes, e.g. DCmode. */
1205 x = adjust_address (x, BLKmode, 0);
1206 y = adjust_address (y, BLKmode, 0);
1208 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1209 can be incorrect is coming from __builtin_memcpy. */
1210 if (CONST_INT_P (size))
1212 if (INTVAL (size) == 0)
1215 x = shallow_copy_rtx (x);
1216 y = shallow_copy_rtx (y);
1217 set_mem_size (x, size);
1218 set_mem_size (y, size);
1221 if (CONST_INT_P (size) && MOVE_BY_PIECES_P (INTVAL (size), align))
1222 move_by_pieces (x, y, INTVAL (size), align, 0);
1223 else if (emit_block_move_via_movmem (x, y, size, align,
1224 expected_align, expected_size))
1226 else if (may_use_call
1227 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (x))
1228 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (y)))
1229 retval = emit_block_move_via_libcall (x, y, size,
1230 method == BLOCK_OP_TAILCALL);
1232 emit_block_move_via_loop (x, y, size, align);
1234 if (method == BLOCK_OP_CALL_PARM)
1241 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1243 return emit_block_move_hints (x, y, size, method, 0, -1);
1246 /* A subroutine of emit_block_move. Returns true if calling the
1247 block move libcall will not clobber any parameters which may have
1248 already been placed on the stack. */
1251 block_move_libcall_safe_for_call_parm (void)
1253 #if defined (REG_PARM_STACK_SPACE)
1257 /* If arguments are pushed on the stack, then they're safe. */
1261 /* If registers go on the stack anyway, any argument is sure to clobber
1262 an outgoing argument. */
1263 #if defined (REG_PARM_STACK_SPACE)
1264 fn = emit_block_move_libcall_fn (false);
1265 if (OUTGOING_REG_PARM_STACK_SPACE ((!fn ? NULL_TREE : TREE_TYPE (fn)))
1266 && REG_PARM_STACK_SPACE (fn) != 0)
1270 /* If any argument goes in memory, then it might clobber an outgoing
1273 CUMULATIVE_ARGS args_so_far;
1276 fn = emit_block_move_libcall_fn (false);
1277 INIT_CUMULATIVE_ARGS (args_so_far, TREE_TYPE (fn), NULL_RTX, 0, 3);
1279 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1280 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1282 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1283 rtx tmp = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
1284 if (!tmp || !REG_P (tmp))
1286 if (targetm.calls.arg_partial_bytes (&args_so_far, mode, NULL, 1))
1288 FUNCTION_ARG_ADVANCE (args_so_far, mode, NULL_TREE, 1);
1294 /* A subroutine of emit_block_move. Expand a movmem pattern;
1295 return true if successful. */
1298 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align,
1299 unsigned int expected_align, HOST_WIDE_INT expected_size)
1301 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1302 int save_volatile_ok = volatile_ok;
1303 enum machine_mode mode;
1305 if (expected_align < align)
1306 expected_align = align;
1308 /* Since this is a move insn, we don't care about volatility. */
1311 /* Try the most limited insn first, because there's no point
1312 including more than one in the machine description unless
1313 the more limited one has some advantage. */
1315 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1316 mode = GET_MODE_WIDER_MODE (mode))
1318 enum insn_code code = movmem_optab[(int) mode];
1319 insn_operand_predicate_fn pred;
1321 if (code != CODE_FOR_nothing
1322 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1323 here because if SIZE is less than the mode mask, as it is
1324 returned by the macro, it will definitely be less than the
1325 actual mode mask. */
1326 && ((CONST_INT_P (size)
1327 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1328 <= (GET_MODE_MASK (mode) >> 1)))
1329 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1330 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1331 || (*pred) (x, BLKmode))
1332 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1333 || (*pred) (y, BLKmode))
1334 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1335 || (*pred) (opalign, VOIDmode)))
1338 rtx last = get_last_insn ();
1341 op2 = convert_to_mode (mode, size, 1);
1342 pred = insn_data[(int) code].operand[2].predicate;
1343 if (pred != 0 && ! (*pred) (op2, mode))
1344 op2 = copy_to_mode_reg (mode, op2);
1346 /* ??? When called via emit_block_move_for_call, it'd be
1347 nice if there were some way to inform the backend, so
1348 that it doesn't fail the expansion because it thinks
1349 emitting the libcall would be more efficient. */
1351 if (insn_data[(int) code].n_operands == 4)
1352 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1354 pat = GEN_FCN ((int) code) (x, y, op2, opalign,
1355 GEN_INT (expected_align
1357 GEN_INT (expected_size));
1361 volatile_ok = save_volatile_ok;
1365 delete_insns_since (last);
1369 volatile_ok = save_volatile_ok;
1373 /* A subroutine of emit_block_move. Expand a call to memcpy.
1374 Return the return value from memcpy, 0 otherwise. */
1377 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1379 rtx dst_addr, src_addr;
1380 tree call_expr, fn, src_tree, dst_tree, size_tree;
1381 enum machine_mode size_mode;
1384 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1385 pseudos. We can then place those new pseudos into a VAR_DECL and
1388 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1389 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1391 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1392 src_addr = convert_memory_address (ptr_mode, src_addr);
1394 dst_tree = make_tree (ptr_type_node, dst_addr);
1395 src_tree = make_tree (ptr_type_node, src_addr);
1397 size_mode = TYPE_MODE (sizetype);
1399 size = convert_to_mode (size_mode, size, 1);
1400 size = copy_to_mode_reg (size_mode, size);
1402 /* It is incorrect to use the libcall calling conventions to call
1403 memcpy in this context. This could be a user call to memcpy and
1404 the user may wish to examine the return value from memcpy. For
1405 targets where libcalls and normal calls have different conventions
1406 for returning pointers, we could end up generating incorrect code. */
1408 size_tree = make_tree (sizetype, size);
1410 fn = emit_block_move_libcall_fn (true);
1411 call_expr = build_call_expr (fn, 3, dst_tree, src_tree, size_tree);
1412 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1414 retval = expand_normal (call_expr);
1419 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1420 for the function we use for block copies. The first time FOR_CALL
1421 is true, we call assemble_external. */
1423 static GTY(()) tree block_move_fn;
1426 init_block_move_fn (const char *asmspec)
1432 fn = get_identifier ("memcpy");
1433 args = build_function_type_list (ptr_type_node, ptr_type_node,
1434 const_ptr_type_node, sizetype,
1437 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
1438 DECL_EXTERNAL (fn) = 1;
1439 TREE_PUBLIC (fn) = 1;
1440 DECL_ARTIFICIAL (fn) = 1;
1441 TREE_NOTHROW (fn) = 1;
1442 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
1443 DECL_VISIBILITY_SPECIFIED (fn) = 1;
1449 set_user_assembler_name (block_move_fn, asmspec);
1453 emit_block_move_libcall_fn (int for_call)
1455 static bool emitted_extern;
1458 init_block_move_fn (NULL);
1460 if (for_call && !emitted_extern)
1462 emitted_extern = true;
1463 make_decl_rtl (block_move_fn);
1464 assemble_external (block_move_fn);
1467 return block_move_fn;
1470 /* A subroutine of emit_block_move. Copy the data via an explicit
1471 loop. This is used only when libcalls are forbidden. */
1472 /* ??? It'd be nice to copy in hunks larger than QImode. */
1475 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1476 unsigned int align ATTRIBUTE_UNUSED)
1478 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1479 enum machine_mode x_addr_mode
1480 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (x));
1481 enum machine_mode y_addr_mode
1482 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (y));
1483 enum machine_mode iter_mode;
1485 iter_mode = GET_MODE (size);
1486 if (iter_mode == VOIDmode)
1487 iter_mode = word_mode;
1489 top_label = gen_label_rtx ();
1490 cmp_label = gen_label_rtx ();
1491 iter = gen_reg_rtx (iter_mode);
1493 emit_move_insn (iter, const0_rtx);
1495 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1496 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1497 do_pending_stack_adjust ();
1499 emit_jump (cmp_label);
1500 emit_label (top_label);
1502 tmp = convert_modes (x_addr_mode, iter_mode, iter, true);
1503 x_addr = gen_rtx_PLUS (x_addr_mode, x_addr, tmp);
1505 if (x_addr_mode != y_addr_mode)
1506 tmp = convert_modes (y_addr_mode, iter_mode, iter, true);
1507 y_addr = gen_rtx_PLUS (y_addr_mode, y_addr, tmp);
1509 x = change_address (x, QImode, x_addr);
1510 y = change_address (y, QImode, y_addr);
1512 emit_move_insn (x, y);
1514 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1515 true, OPTAB_LIB_WIDEN);
1517 emit_move_insn (iter, tmp);
1519 emit_label (cmp_label);
1521 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1525 /* Copy all or part of a value X into registers starting at REGNO.
1526 The number of registers to be filled is NREGS. */
1529 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1532 #ifdef HAVE_load_multiple
1540 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1541 x = validize_mem (force_const_mem (mode, x));
1543 /* See if the machine can do this with a load multiple insn. */
1544 #ifdef HAVE_load_multiple
1545 if (HAVE_load_multiple)
1547 last = get_last_insn ();
1548 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1556 delete_insns_since (last);
1560 for (i = 0; i < nregs; i++)
1561 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1562 operand_subword_force (x, i, mode));
1565 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1566 The number of registers to be filled is NREGS. */
1569 move_block_from_reg (int regno, rtx x, int nregs)
1576 /* See if the machine can do this with a store multiple insn. */
1577 #ifdef HAVE_store_multiple
1578 if (HAVE_store_multiple)
1580 rtx last = get_last_insn ();
1581 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1589 delete_insns_since (last);
1593 for (i = 0; i < nregs; i++)
1595 rtx tem = operand_subword (x, i, 1, BLKmode);
1599 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1603 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1604 ORIG, where ORIG is a non-consecutive group of registers represented by
1605 a PARALLEL. The clone is identical to the original except in that the
1606 original set of registers is replaced by a new set of pseudo registers.
1607 The new set has the same modes as the original set. */
1610 gen_group_rtx (rtx orig)
1615 gcc_assert (GET_CODE (orig) == PARALLEL);
1617 length = XVECLEN (orig, 0);
1618 tmps = XALLOCAVEC (rtx, length);
1620 /* Skip a NULL entry in first slot. */
1621 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1626 for (; i < length; i++)
1628 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1629 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1631 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1634 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1637 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1638 except that values are placed in TMPS[i], and must later be moved
1639 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1642 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1646 enum machine_mode m = GET_MODE (orig_src);
1648 gcc_assert (GET_CODE (dst) == PARALLEL);
1651 && !SCALAR_INT_MODE_P (m)
1652 && !MEM_P (orig_src)
1653 && GET_CODE (orig_src) != CONCAT)
1655 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1656 if (imode == BLKmode)
1657 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1659 src = gen_reg_rtx (imode);
1660 if (imode != BLKmode)
1661 src = gen_lowpart (GET_MODE (orig_src), src);
1662 emit_move_insn (src, orig_src);
1663 /* ...and back again. */
1664 if (imode != BLKmode)
1665 src = gen_lowpart (imode, src);
1666 emit_group_load_1 (tmps, dst, src, type, ssize);
1670 /* Check for a NULL entry, used to indicate that the parameter goes
1671 both on the stack and in registers. */
1672 if (XEXP (XVECEXP (dst, 0, 0), 0))
1677 /* Process the pieces. */
1678 for (i = start; i < XVECLEN (dst, 0); i++)
1680 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1681 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1682 unsigned int bytelen = GET_MODE_SIZE (mode);
1685 /* Handle trailing fragments that run over the size of the struct. */
1686 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1688 /* Arrange to shift the fragment to where it belongs.
1689 extract_bit_field loads to the lsb of the reg. */
1691 #ifdef BLOCK_REG_PADDING
1692 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1693 == (BYTES_BIG_ENDIAN ? upward : downward)
1698 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1699 bytelen = ssize - bytepos;
1700 gcc_assert (bytelen > 0);
1703 /* If we won't be loading directly from memory, protect the real source
1704 from strange tricks we might play; but make sure that the source can
1705 be loaded directly into the destination. */
1707 if (!MEM_P (orig_src)
1708 && (!CONSTANT_P (orig_src)
1709 || (GET_MODE (orig_src) != mode
1710 && GET_MODE (orig_src) != VOIDmode)))
1712 if (GET_MODE (orig_src) == VOIDmode)
1713 src = gen_reg_rtx (mode);
1715 src = gen_reg_rtx (GET_MODE (orig_src));
1717 emit_move_insn (src, orig_src);
1720 /* Optimize the access just a bit. */
1722 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1723 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1724 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1725 && bytelen == GET_MODE_SIZE (mode))
1727 tmps[i] = gen_reg_rtx (mode);
1728 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1730 else if (COMPLEX_MODE_P (mode)
1731 && GET_MODE (src) == mode
1732 && bytelen == GET_MODE_SIZE (mode))
1733 /* Let emit_move_complex do the bulk of the work. */
1735 else if (GET_CODE (src) == CONCAT)
1737 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1738 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1740 if ((bytepos == 0 && bytelen == slen0)
1741 || (bytepos != 0 && bytepos + bytelen <= slen))
1743 /* The following assumes that the concatenated objects all
1744 have the same size. In this case, a simple calculation
1745 can be used to determine the object and the bit field
1747 tmps[i] = XEXP (src, bytepos / slen0);
1748 if (! CONSTANT_P (tmps[i])
1749 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1750 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1751 (bytepos % slen0) * BITS_PER_UNIT,
1752 1, NULL_RTX, mode, mode);
1758 gcc_assert (!bytepos);
1759 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1760 emit_move_insn (mem, src);
1761 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1762 0, 1, NULL_RTX, mode, mode);
1765 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1766 SIMD register, which is currently broken. While we get GCC
1767 to emit proper RTL for these cases, let's dump to memory. */
1768 else if (VECTOR_MODE_P (GET_MODE (dst))
1771 int slen = GET_MODE_SIZE (GET_MODE (src));
1774 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1775 emit_move_insn (mem, src);
1776 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1778 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1779 && XVECLEN (dst, 0) > 1)
1780 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1781 else if (CONSTANT_P (src))
1783 HOST_WIDE_INT len = (HOST_WIDE_INT) bytelen;
1791 gcc_assert (2 * len == ssize);
1792 split_double (src, &first, &second);
1799 else if (REG_P (src) && GET_MODE (src) == mode)
1802 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1803 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
1807 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1808 build_int_cst (NULL_TREE, shift), tmps[i], 0);
1812 /* Emit code to move a block SRC of type TYPE to a block DST,
1813 where DST is non-consecutive registers represented by a PARALLEL.
1814 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1818 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1823 tmps = XALLOCAVEC (rtx, XVECLEN (dst, 0));
1824 emit_group_load_1 (tmps, dst, src, type, ssize);
1826 /* Copy the extracted pieces into the proper (probable) hard regs. */
1827 for (i = 0; i < XVECLEN (dst, 0); i++)
1829 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1832 emit_move_insn (d, tmps[i]);
1836 /* Similar, but load SRC into new pseudos in a format that looks like
1837 PARALLEL. This can later be fed to emit_group_move to get things
1838 in the right place. */
1841 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1846 vec = rtvec_alloc (XVECLEN (parallel, 0));
1847 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1849 /* Convert the vector to look just like the original PARALLEL, except
1850 with the computed values. */
1851 for (i = 0; i < XVECLEN (parallel, 0); i++)
1853 rtx e = XVECEXP (parallel, 0, i);
1854 rtx d = XEXP (e, 0);
1858 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1859 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1861 RTVEC_ELT (vec, i) = e;
1864 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1867 /* Emit code to move a block SRC to block DST, where SRC and DST are
1868 non-consecutive groups of registers, each represented by a PARALLEL. */
1871 emit_group_move (rtx dst, rtx src)
1875 gcc_assert (GET_CODE (src) == PARALLEL
1876 && GET_CODE (dst) == PARALLEL
1877 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1879 /* Skip first entry if NULL. */
1880 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1881 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1882 XEXP (XVECEXP (src, 0, i), 0));
1885 /* Move a group of registers represented by a PARALLEL into pseudos. */
1888 emit_group_move_into_temps (rtx src)
1890 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1893 for (i = 0; i < XVECLEN (src, 0); i++)
1895 rtx e = XVECEXP (src, 0, i);
1896 rtx d = XEXP (e, 0);
1899 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1900 RTVEC_ELT (vec, i) = e;
1903 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1906 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1907 where SRC is non-consecutive registers represented by a PARALLEL.
1908 SSIZE represents the total size of block ORIG_DST, or -1 if not
1912 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1915 int start, finish, i;
1916 enum machine_mode m = GET_MODE (orig_dst);
1918 gcc_assert (GET_CODE (src) == PARALLEL);
1920 if (!SCALAR_INT_MODE_P (m)
1921 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1923 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1924 if (imode == BLKmode)
1925 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1927 dst = gen_reg_rtx (imode);
1928 emit_group_store (dst, src, type, ssize);
1929 if (imode != BLKmode)
1930 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1931 emit_move_insn (orig_dst, dst);
1935 /* Check for a NULL entry, used to indicate that the parameter goes
1936 both on the stack and in registers. */
1937 if (XEXP (XVECEXP (src, 0, 0), 0))
1941 finish = XVECLEN (src, 0);
1943 tmps = XALLOCAVEC (rtx, finish);
1945 /* Copy the (probable) hard regs into pseudos. */
1946 for (i = start; i < finish; i++)
1948 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1949 if (!REG_P (reg) || REGNO (reg) < FIRST_PSEUDO_REGISTER)
1951 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1952 emit_move_insn (tmps[i], reg);
1958 /* If we won't be storing directly into memory, protect the real destination
1959 from strange tricks we might play. */
1961 if (GET_CODE (dst) == PARALLEL)
1965 /* We can get a PARALLEL dst if there is a conditional expression in
1966 a return statement. In that case, the dst and src are the same,
1967 so no action is necessary. */
1968 if (rtx_equal_p (dst, src))
1971 /* It is unclear if we can ever reach here, but we may as well handle
1972 it. Allocate a temporary, and split this into a store/load to/from
1975 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1976 emit_group_store (temp, src, type, ssize);
1977 emit_group_load (dst, temp, type, ssize);
1980 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1982 enum machine_mode outer = GET_MODE (dst);
1983 enum machine_mode inner;
1984 HOST_WIDE_INT bytepos;
1988 if (!REG_P (dst) || REGNO (dst) < FIRST_PSEUDO_REGISTER)
1989 dst = gen_reg_rtx (outer);
1991 /* Make life a bit easier for combine. */
1992 /* If the first element of the vector is the low part
1993 of the destination mode, use a paradoxical subreg to
1994 initialize the destination. */
1997 inner = GET_MODE (tmps[start]);
1998 bytepos = subreg_lowpart_offset (inner, outer);
1999 if (INTVAL (XEXP (XVECEXP (src, 0, start), 1)) == bytepos)
2001 temp = simplify_gen_subreg (outer, tmps[start],
2005 emit_move_insn (dst, temp);
2012 /* If the first element wasn't the low part, try the last. */
2014 && start < finish - 1)
2016 inner = GET_MODE (tmps[finish - 1]);
2017 bytepos = subreg_lowpart_offset (inner, outer);
2018 if (INTVAL (XEXP (XVECEXP (src, 0, finish - 1), 1)) == bytepos)
2020 temp = simplify_gen_subreg (outer, tmps[finish - 1],
2024 emit_move_insn (dst, temp);
2031 /* Otherwise, simply initialize the result to zero. */
2033 emit_move_insn (dst, CONST0_RTX (outer));
2036 /* Process the pieces. */
2037 for (i = start; i < finish; i++)
2039 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2040 enum machine_mode mode = GET_MODE (tmps[i]);
2041 unsigned int bytelen = GET_MODE_SIZE (mode);
2042 unsigned int adj_bytelen = bytelen;
2045 /* Handle trailing fragments that run over the size of the struct. */
2046 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2047 adj_bytelen = ssize - bytepos;
2049 if (GET_CODE (dst) == CONCAT)
2051 if (bytepos + adj_bytelen
2052 <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2053 dest = XEXP (dst, 0);
2054 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2056 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2057 dest = XEXP (dst, 1);
2061 enum machine_mode dest_mode = GET_MODE (dest);
2062 enum machine_mode tmp_mode = GET_MODE (tmps[i]);
2064 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
2066 if (GET_MODE_ALIGNMENT (dest_mode)
2067 >= GET_MODE_ALIGNMENT (tmp_mode))
2069 dest = assign_stack_temp (dest_mode,
2070 GET_MODE_SIZE (dest_mode),
2072 emit_move_insn (adjust_address (dest,
2080 dest = assign_stack_temp (tmp_mode,
2081 GET_MODE_SIZE (tmp_mode),
2083 emit_move_insn (dest, tmps[i]);
2084 dst = adjust_address (dest, dest_mode, bytepos);
2090 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2092 /* store_bit_field always takes its value from the lsb.
2093 Move the fragment to the lsb if it's not already there. */
2095 #ifdef BLOCK_REG_PADDING
2096 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
2097 == (BYTES_BIG_ENDIAN ? upward : downward)
2103 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2104 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
2105 build_int_cst (NULL_TREE, shift),
2108 bytelen = adj_bytelen;
2111 /* Optimize the access just a bit. */
2113 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
2114 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
2115 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2116 && bytelen == GET_MODE_SIZE (mode))
2117 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2119 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2123 /* Copy from the pseudo into the (probable) hard reg. */
2124 if (orig_dst != dst)
2125 emit_move_insn (orig_dst, dst);
2128 /* Generate code to copy a BLKmode object of TYPE out of a
2129 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2130 is null, a stack temporary is created. TGTBLK is returned.
2132 The purpose of this routine is to handle functions that return
2133 BLKmode structures in registers. Some machines (the PA for example)
2134 want to return all small structures in registers regardless of the
2135 structure's alignment. */
2138 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
2140 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2141 rtx src = NULL, dst = NULL;
2142 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2143 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
2144 enum machine_mode copy_mode;
2148 tgtblk = assign_temp (build_qualified_type (type,
2150 | TYPE_QUAL_CONST)),
2152 preserve_temp_slots (tgtblk);
2155 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2156 into a new pseudo which is a full word. */
2158 if (GET_MODE (srcreg) != BLKmode
2159 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2160 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
2162 /* If the structure doesn't take up a whole number of words, see whether
2163 SRCREG is padded on the left or on the right. If it's on the left,
2164 set PADDING_CORRECTION to the number of bits to skip.
2166 In most ABIs, the structure will be returned at the least end of
2167 the register, which translates to right padding on little-endian
2168 targets and left padding on big-endian targets. The opposite
2169 holds if the structure is returned at the most significant
2170 end of the register. */
2171 if (bytes % UNITS_PER_WORD != 0
2172 && (targetm.calls.return_in_msb (type)
2174 : BYTES_BIG_ENDIAN))
2176 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2178 /* Copy the structure BITSIZE bits at a time. If the target lives in
2179 memory, take care of not reading/writing past its end by selecting
2180 a copy mode suited to BITSIZE. This should always be possible given
2183 We could probably emit more efficient code for machines which do not use
2184 strict alignment, but it doesn't seem worth the effort at the current
2187 copy_mode = word_mode;
2190 enum machine_mode mem_mode = mode_for_size (bitsize, MODE_INT, 1);
2191 if (mem_mode != BLKmode)
2192 copy_mode = mem_mode;
2195 for (bitpos = 0, xbitpos = padding_correction;
2196 bitpos < bytes * BITS_PER_UNIT;
2197 bitpos += bitsize, xbitpos += bitsize)
2199 /* We need a new source operand each time xbitpos is on a
2200 word boundary and when xbitpos == padding_correction
2201 (the first time through). */
2202 if (xbitpos % BITS_PER_WORD == 0
2203 || xbitpos == padding_correction)
2204 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2207 /* We need a new destination operand each time bitpos is on
2209 if (bitpos % BITS_PER_WORD == 0)
2210 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2212 /* Use xbitpos for the source extraction (right justified) and
2213 bitpos for the destination store (left justified). */
2214 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, copy_mode,
2215 extract_bit_field (src, bitsize,
2216 xbitpos % BITS_PER_WORD, 1,
2217 NULL_RTX, copy_mode, copy_mode));
2223 /* Add a USE expression for REG to the (possibly empty) list pointed
2224 to by CALL_FUSAGE. REG must denote a hard register. */
2227 use_reg (rtx *call_fusage, rtx reg)
2229 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2232 = gen_rtx_EXPR_LIST (VOIDmode,
2233 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2236 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2237 starting at REGNO. All of these registers must be hard registers. */
2240 use_regs (rtx *call_fusage, int regno, int nregs)
2244 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2246 for (i = 0; i < nregs; i++)
2247 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2250 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2251 PARALLEL REGS. This is for calls that pass values in multiple
2252 non-contiguous locations. The Irix 6 ABI has examples of this. */
2255 use_group_regs (rtx *call_fusage, rtx regs)
2259 for (i = 0; i < XVECLEN (regs, 0); i++)
2261 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2263 /* A NULL entry means the parameter goes both on the stack and in
2264 registers. This can also be a MEM for targets that pass values
2265 partially on the stack and partially in registers. */
2266 if (reg != 0 && REG_P (reg))
2267 use_reg (call_fusage, reg);
2271 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2272 assigment and the code of the expresion on the RHS is CODE. Return
2276 get_def_for_expr (tree name, enum tree_code code)
2280 if (TREE_CODE (name) != SSA_NAME)
2283 def_stmt = get_gimple_for_ssa_name (name);
2285 || gimple_assign_rhs_code (def_stmt) != code)
2292 /* Determine whether the LEN bytes generated by CONSTFUN can be
2293 stored to memory using several move instructions. CONSTFUNDATA is
2294 a pointer which will be passed as argument in every CONSTFUN call.
2295 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2296 a memset operation and false if it's a copy of a constant string.
2297 Return nonzero if a call to store_by_pieces should succeed. */
2300 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2301 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2302 void *constfundata, unsigned int align, bool memsetp)
2304 unsigned HOST_WIDE_INT l;
2305 unsigned int max_size;
2306 HOST_WIDE_INT offset = 0;
2307 enum machine_mode mode, tmode;
2308 enum insn_code icode;
2316 ? SET_BY_PIECES_P (len, align)
2317 : STORE_BY_PIECES_P (len, align)))
2320 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2321 if (align >= GET_MODE_ALIGNMENT (tmode))
2322 align = GET_MODE_ALIGNMENT (tmode);
2325 enum machine_mode xmode;
2327 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2329 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2330 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2331 || SLOW_UNALIGNED_ACCESS (tmode, align))
2334 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2337 /* We would first store what we can in the largest integer mode, then go to
2338 successively smaller modes. */
2341 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2346 max_size = STORE_MAX_PIECES + 1;
2347 while (max_size > 1)
2349 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2350 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2351 if (GET_MODE_SIZE (tmode) < max_size)
2354 if (mode == VOIDmode)
2357 icode = optab_handler (mov_optab, mode)->insn_code;
2358 if (icode != CODE_FOR_nothing
2359 && align >= GET_MODE_ALIGNMENT (mode))
2361 unsigned int size = GET_MODE_SIZE (mode);
2368 cst = (*constfun) (constfundata, offset, mode);
2369 if (!LEGITIMATE_CONSTANT_P (cst))
2379 max_size = GET_MODE_SIZE (mode);
2382 /* The code above should have handled everything. */
2389 /* Generate several move instructions to store LEN bytes generated by
2390 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2391 pointer which will be passed as argument in every CONSTFUN call.
2392 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2393 a memset operation and false if it's a copy of a constant string.
2394 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2395 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2399 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2400 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2401 void *constfundata, unsigned int align, bool memsetp, int endp)
2403 enum machine_mode to_addr_mode
2404 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
2405 struct store_by_pieces_d data;
2409 gcc_assert (endp != 2);
2414 ? SET_BY_PIECES_P (len, align)
2415 : STORE_BY_PIECES_P (len, align));
2416 data.constfun = constfun;
2417 data.constfundata = constfundata;
2420 store_by_pieces_1 (&data, align);
2425 gcc_assert (!data.reverse);
2430 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2431 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2433 data.to_addr = copy_to_mode_reg (to_addr_mode,
2434 plus_constant (data.to_addr,
2437 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2444 to1 = adjust_address (data.to, QImode, data.offset);
2452 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2453 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2456 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2458 struct store_by_pieces_d data;
2463 data.constfun = clear_by_pieces_1;
2464 data.constfundata = NULL;
2467 store_by_pieces_1 (&data, align);
2470 /* Callback routine for clear_by_pieces.
2471 Return const0_rtx unconditionally. */
2474 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2475 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2476 enum machine_mode mode ATTRIBUTE_UNUSED)
2481 /* Subroutine of clear_by_pieces and store_by_pieces.
2482 Generate several move instructions to store LEN bytes of block TO. (A MEM
2483 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2486 store_by_pieces_1 (struct store_by_pieces_d *data ATTRIBUTE_UNUSED,
2487 unsigned int align ATTRIBUTE_UNUSED)
2489 enum machine_mode to_addr_mode
2490 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (data->to));
2491 rtx to_addr = XEXP (data->to, 0);
2492 unsigned int max_size = STORE_MAX_PIECES + 1;
2493 enum machine_mode mode = VOIDmode, tmode;
2494 enum insn_code icode;
2497 data->to_addr = to_addr;
2499 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2500 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2502 data->explicit_inc_to = 0;
2504 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2506 data->offset = data->len;
2508 /* If storing requires more than two move insns,
2509 copy addresses to registers (to make displacements shorter)
2510 and use post-increment if available. */
2511 if (!data->autinc_to
2512 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2514 /* Determine the main mode we'll be using. */
2515 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2516 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2517 if (GET_MODE_SIZE (tmode) < max_size)
2520 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2522 data->to_addr = copy_to_mode_reg (to_addr_mode,
2523 plus_constant (to_addr, data->len));
2524 data->autinc_to = 1;
2525 data->explicit_inc_to = -1;
2528 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2529 && ! data->autinc_to)
2531 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2532 data->autinc_to = 1;
2533 data->explicit_inc_to = 1;
2536 if ( !data->autinc_to && CONSTANT_P (to_addr))
2537 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2540 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2541 if (align >= GET_MODE_ALIGNMENT (tmode))
2542 align = GET_MODE_ALIGNMENT (tmode);
2545 enum machine_mode xmode;
2547 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2549 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2550 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2551 || SLOW_UNALIGNED_ACCESS (tmode, align))
2554 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2557 /* First store what we can in the largest integer mode, then go to
2558 successively smaller modes. */
2560 while (max_size > 1)
2562 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2563 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2564 if (GET_MODE_SIZE (tmode) < max_size)
2567 if (mode == VOIDmode)
2570 icode = optab_handler (mov_optab, mode)->insn_code;
2571 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2572 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2574 max_size = GET_MODE_SIZE (mode);
2577 /* The code above should have handled everything. */
2578 gcc_assert (!data->len);
2581 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2582 with move instructions for mode MODE. GENFUN is the gen_... function
2583 to make a move insn for that mode. DATA has all the other info. */
2586 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2587 struct store_by_pieces_d *data)
2589 unsigned int size = GET_MODE_SIZE (mode);
2592 while (data->len >= size)
2595 data->offset -= size;
2597 if (data->autinc_to)
2598 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2601 to1 = adjust_address (data->to, mode, data->offset);
2603 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2604 emit_insn (gen_add2_insn (data->to_addr,
2605 GEN_INT (-(HOST_WIDE_INT) size)));
2607 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2608 emit_insn ((*genfun) (to1, cst));
2610 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2611 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2613 if (! data->reverse)
2614 data->offset += size;
2620 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2621 its length in bytes. */
2624 clear_storage_hints (rtx object, rtx size, enum block_op_methods method,
2625 unsigned int expected_align, HOST_WIDE_INT expected_size)
2627 enum machine_mode mode = GET_MODE (object);
2630 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2632 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2633 just move a zero. Otherwise, do this a piece at a time. */
2635 && CONST_INT_P (size)
2636 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2638 rtx zero = CONST0_RTX (mode);
2641 emit_move_insn (object, zero);
2645 if (COMPLEX_MODE_P (mode))
2647 zero = CONST0_RTX (GET_MODE_INNER (mode));
2650 write_complex_part (object, zero, 0);
2651 write_complex_part (object, zero, 1);
2657 if (size == const0_rtx)
2660 align = MEM_ALIGN (object);
2662 if (CONST_INT_P (size)
2663 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2664 clear_by_pieces (object, INTVAL (size), align);
2665 else if (set_storage_via_setmem (object, size, const0_rtx, align,
2666 expected_align, expected_size))
2668 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object)))
2669 return set_storage_via_libcall (object, size, const0_rtx,
2670 method == BLOCK_OP_TAILCALL);
2678 clear_storage (rtx object, rtx size, enum block_op_methods method)
2680 return clear_storage_hints (object, size, method, 0, -1);
2684 /* A subroutine of clear_storage. Expand a call to memset.
2685 Return the return value of memset, 0 otherwise. */
2688 set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
2690 tree call_expr, fn, object_tree, size_tree, val_tree;
2691 enum machine_mode size_mode;
2694 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2695 place those into new pseudos into a VAR_DECL and use them later. */
2697 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2699 size_mode = TYPE_MODE (sizetype);
2700 size = convert_to_mode (size_mode, size, 1);
2701 size = copy_to_mode_reg (size_mode, size);
2703 /* It is incorrect to use the libcall calling conventions to call
2704 memset in this context. This could be a user call to memset and
2705 the user may wish to examine the return value from memset. For
2706 targets where libcalls and normal calls have different conventions
2707 for returning pointers, we could end up generating incorrect code. */
2709 object_tree = make_tree (ptr_type_node, object);
2710 if (!CONST_INT_P (val))
2711 val = convert_to_mode (TYPE_MODE (integer_type_node), val, 1);
2712 size_tree = make_tree (sizetype, size);
2713 val_tree = make_tree (integer_type_node, val);
2715 fn = clear_storage_libcall_fn (true);
2716 call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
2717 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2719 retval = expand_normal (call_expr);
2724 /* A subroutine of set_storage_via_libcall. Create the tree node
2725 for the function we use for block clears. The first time FOR_CALL
2726 is true, we call assemble_external. */
2728 tree block_clear_fn;
2731 init_block_clear_fn (const char *asmspec)
2733 if (!block_clear_fn)
2737 fn = get_identifier ("memset");
2738 args = build_function_type_list (ptr_type_node, ptr_type_node,
2739 integer_type_node, sizetype,
2742 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
2743 DECL_EXTERNAL (fn) = 1;
2744 TREE_PUBLIC (fn) = 1;
2745 DECL_ARTIFICIAL (fn) = 1;
2746 TREE_NOTHROW (fn) = 1;
2747 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
2748 DECL_VISIBILITY_SPECIFIED (fn) = 1;
2750 block_clear_fn = fn;
2754 set_user_assembler_name (block_clear_fn, asmspec);
2758 clear_storage_libcall_fn (int for_call)
2760 static bool emitted_extern;
2762 if (!block_clear_fn)
2763 init_block_clear_fn (NULL);
2765 if (for_call && !emitted_extern)
2767 emitted_extern = true;
2768 make_decl_rtl (block_clear_fn);
2769 assemble_external (block_clear_fn);
2772 return block_clear_fn;
2775 /* Expand a setmem pattern; return true if successful. */
2778 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align,
2779 unsigned int expected_align, HOST_WIDE_INT expected_size)
2781 /* Try the most limited insn first, because there's no point
2782 including more than one in the machine description unless
2783 the more limited one has some advantage. */
2785 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2786 enum machine_mode mode;
2788 if (expected_align < align)
2789 expected_align = align;
2791 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2792 mode = GET_MODE_WIDER_MODE (mode))
2794 enum insn_code code = setmem_optab[(int) mode];
2795 insn_operand_predicate_fn pred;
2797 if (code != CODE_FOR_nothing
2798 /* We don't need MODE to be narrower than
2799 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2800 the mode mask, as it is returned by the macro, it will
2801 definitely be less than the actual mode mask. */
2802 && ((CONST_INT_P (size)
2803 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2804 <= (GET_MODE_MASK (mode) >> 1)))
2805 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2806 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2807 || (*pred) (object, BLKmode))
2808 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
2809 || (*pred) (opalign, VOIDmode)))
2812 enum machine_mode char_mode;
2813 rtx last = get_last_insn ();
2816 opsize = convert_to_mode (mode, size, 1);
2817 pred = insn_data[(int) code].operand[1].predicate;
2818 if (pred != 0 && ! (*pred) (opsize, mode))
2819 opsize = copy_to_mode_reg (mode, opsize);
2822 char_mode = insn_data[(int) code].operand[2].mode;
2823 if (char_mode != VOIDmode)
2825 opchar = convert_to_mode (char_mode, opchar, 1);
2826 pred = insn_data[(int) code].operand[2].predicate;
2827 if (pred != 0 && ! (*pred) (opchar, char_mode))
2828 opchar = copy_to_mode_reg (char_mode, opchar);
2831 if (insn_data[(int) code].n_operands == 4)
2832 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign);
2834 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign,
2835 GEN_INT (expected_align
2837 GEN_INT (expected_size));
2844 delete_insns_since (last);
2852 /* Write to one of the components of the complex value CPLX. Write VAL to
2853 the real part if IMAG_P is false, and the imaginary part if its true. */
2856 write_complex_part (rtx cplx, rtx val, bool imag_p)
2858 enum machine_mode cmode;
2859 enum machine_mode imode;
2862 if (GET_CODE (cplx) == CONCAT)
2864 emit_move_insn (XEXP (cplx, imag_p), val);
2868 cmode = GET_MODE (cplx);
2869 imode = GET_MODE_INNER (cmode);
2870 ibitsize = GET_MODE_BITSIZE (imode);
2872 /* For MEMs simplify_gen_subreg may generate an invalid new address
2873 because, e.g., the original address is considered mode-dependent
2874 by the target, which restricts simplify_subreg from invoking
2875 adjust_address_nv. Instead of preparing fallback support for an
2876 invalid address, we call adjust_address_nv directly. */
2879 emit_move_insn (adjust_address_nv (cplx, imode,
2880 imag_p ? GET_MODE_SIZE (imode) : 0),
2885 /* If the sub-object is at least word sized, then we know that subregging
2886 will work. This special case is important, since store_bit_field
2887 wants to operate on integer modes, and there's rarely an OImode to
2888 correspond to TCmode. */
2889 if (ibitsize >= BITS_PER_WORD
2890 /* For hard regs we have exact predicates. Assume we can split
2891 the original object if it spans an even number of hard regs.
2892 This special case is important for SCmode on 64-bit platforms
2893 where the natural size of floating-point regs is 32-bit. */
2895 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2896 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2898 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2899 imag_p ? GET_MODE_SIZE (imode) : 0);
2902 emit_move_insn (part, val);
2906 /* simplify_gen_subreg may fail for sub-word MEMs. */
2907 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2910 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2913 /* Extract one of the components of the complex value CPLX. Extract the
2914 real part if IMAG_P is false, and the imaginary part if it's true. */
2917 read_complex_part (rtx cplx, bool imag_p)
2919 enum machine_mode cmode, imode;
2922 if (GET_CODE (cplx) == CONCAT)
2923 return XEXP (cplx, imag_p);
2925 cmode = GET_MODE (cplx);
2926 imode = GET_MODE_INNER (cmode);
2927 ibitsize = GET_MODE_BITSIZE (imode);
2929 /* Special case reads from complex constants that got spilled to memory. */
2930 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2932 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2933 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2935 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2936 if (CONSTANT_CLASS_P (part))
2937 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2941 /* For MEMs simplify_gen_subreg may generate an invalid new address
2942 because, e.g., the original address is considered mode-dependent
2943 by the target, which restricts simplify_subreg from invoking
2944 adjust_address_nv. Instead of preparing fallback support for an
2945 invalid address, we call adjust_address_nv directly. */
2947 return adjust_address_nv (cplx, imode,
2948 imag_p ? GET_MODE_SIZE (imode) : 0);
2950 /* If the sub-object is at least word sized, then we know that subregging
2951 will work. This special case is important, since extract_bit_field
2952 wants to operate on integer modes, and there's rarely an OImode to
2953 correspond to TCmode. */
2954 if (ibitsize >= BITS_PER_WORD
2955 /* For hard regs we have exact predicates. Assume we can split
2956 the original object if it spans an even number of hard regs.
2957 This special case is important for SCmode on 64-bit platforms
2958 where the natural size of floating-point regs is 32-bit. */
2960 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2961 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2963 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2964 imag_p ? GET_MODE_SIZE (imode) : 0);
2968 /* simplify_gen_subreg may fail for sub-word MEMs. */
2969 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2972 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2973 true, NULL_RTX, imode, imode);
2976 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2977 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2978 represented in NEW_MODE. If FORCE is true, this will never happen, as
2979 we'll force-create a SUBREG if needed. */
2982 emit_move_change_mode (enum machine_mode new_mode,
2983 enum machine_mode old_mode, rtx x, bool force)
2987 if (push_operand (x, GET_MODE (x)))
2989 ret = gen_rtx_MEM (new_mode, XEXP (x, 0));
2990 MEM_COPY_ATTRIBUTES (ret, x);
2994 /* We don't have to worry about changing the address since the
2995 size in bytes is supposed to be the same. */
2996 if (reload_in_progress)
2998 /* Copy the MEM to change the mode and move any
2999 substitutions from the old MEM to the new one. */
3000 ret = adjust_address_nv (x, new_mode, 0);
3001 copy_replacements (x, ret);
3004 ret = adjust_address (x, new_mode, 0);
3008 /* Note that we do want simplify_subreg's behavior of validating
3009 that the new mode is ok for a hard register. If we were to use
3010 simplify_gen_subreg, we would create the subreg, but would
3011 probably run into the target not being able to implement it. */
3012 /* Except, of course, when FORCE is true, when this is exactly what
3013 we want. Which is needed for CCmodes on some targets. */
3015 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
3017 ret = simplify_subreg (new_mode, x, old_mode, 0);
3023 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
3024 an integer mode of the same size as MODE. Returns the instruction
3025 emitted, or NULL if such a move could not be generated. */
3028 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y, bool force)
3030 enum machine_mode imode;
3031 enum insn_code code;
3033 /* There must exist a mode of the exact size we require. */
3034 imode = int_mode_for_mode (mode);
3035 if (imode == BLKmode)
3038 /* The target must support moves in this mode. */
3039 code = optab_handler (mov_optab, imode)->insn_code;
3040 if (code == CODE_FOR_nothing)
3043 x = emit_move_change_mode (imode, mode, x, force);
3046 y = emit_move_change_mode (imode, mode, y, force);
3049 return emit_insn (GEN_FCN (code) (x, y));
3052 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
3053 Return an equivalent MEM that does not use an auto-increment. */
3056 emit_move_resolve_push (enum machine_mode mode, rtx x)
3058 enum rtx_code code = GET_CODE (XEXP (x, 0));
3059 HOST_WIDE_INT adjust;
3062 adjust = GET_MODE_SIZE (mode);
3063 #ifdef PUSH_ROUNDING
3064 adjust = PUSH_ROUNDING (adjust);
3066 if (code == PRE_DEC || code == POST_DEC)
3068 else if (code == PRE_MODIFY || code == POST_MODIFY)
3070 rtx expr = XEXP (XEXP (x, 0), 1);
3073 gcc_assert (GET_CODE (expr) == PLUS || GET_CODE (expr) == MINUS);
3074 gcc_assert (CONST_INT_P (XEXP (expr, 1)));
3075 val = INTVAL (XEXP (expr, 1));
3076 if (GET_CODE (expr) == MINUS)
3078 gcc_assert (adjust == val || adjust == -val);
3082 /* Do not use anti_adjust_stack, since we don't want to update
3083 stack_pointer_delta. */
3084 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
3085 GEN_INT (adjust), stack_pointer_rtx,
3086 0, OPTAB_LIB_WIDEN);
3087 if (temp != stack_pointer_rtx)
3088 emit_move_insn (stack_pointer_rtx, temp);
3095 temp = stack_pointer_rtx;
3100 temp = plus_constant (stack_pointer_rtx, -adjust);
3106 return replace_equiv_address (x, temp);
3109 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3110 X is known to satisfy push_operand, and MODE is known to be complex.
3111 Returns the last instruction emitted. */
3114 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
3116 enum machine_mode submode = GET_MODE_INNER (mode);
3119 #ifdef PUSH_ROUNDING
3120 unsigned int submodesize = GET_MODE_SIZE (submode);
3122 /* In case we output to the stack, but the size is smaller than the
3123 machine can push exactly, we need to use move instructions. */
3124 if (PUSH_ROUNDING (submodesize) != submodesize)
3126 x = emit_move_resolve_push (mode, x);
3127 return emit_move_insn (x, y);
3131 /* Note that the real part always precedes the imag part in memory
3132 regardless of machine's endianness. */
3133 switch (GET_CODE (XEXP (x, 0)))
3147 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3148 read_complex_part (y, imag_first));
3149 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3150 read_complex_part (y, !imag_first));
3153 /* A subroutine of emit_move_complex. Perform the move from Y to X
3154 via two moves of the parts. Returns the last instruction emitted. */
3157 emit_move_complex_parts (rtx x, rtx y)
3159 /* Show the output dies here. This is necessary for SUBREGs
3160 of pseudos since we cannot track their lifetimes correctly;
3161 hard regs shouldn't appear here except as return values. */
3162 if (!reload_completed && !reload_in_progress
3163 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
3166 write_complex_part (x, read_complex_part (y, false), false);
3167 write_complex_part (x, read_complex_part (y, true), true);
3169 return get_last_insn ();
3172 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3173 MODE is known to be complex. Returns the last instruction emitted. */
3176 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
3180 /* Need to take special care for pushes, to maintain proper ordering
3181 of the data, and possibly extra padding. */
3182 if (push_operand (x, mode))
3183 return emit_move_complex_push (mode, x, y);
3185 /* See if we can coerce the target into moving both values at once. */
3187 /* Move floating point as parts. */
3188 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
3189 && optab_handler (mov_optab, GET_MODE_INNER (mode))->insn_code != CODE_FOR_nothing)
3191 /* Not possible if the values are inherently not adjacent. */
3192 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
3194 /* Is possible if both are registers (or subregs of registers). */
3195 else if (register_operand (x, mode) && register_operand (y, mode))
3197 /* If one of the operands is a memory, and alignment constraints
3198 are friendly enough, we may be able to do combined memory operations.
3199 We do not attempt this if Y is a constant because that combination is
3200 usually better with the by-parts thing below. */
3201 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
3202 && (!STRICT_ALIGNMENT
3203 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
3212 /* For memory to memory moves, optimal behavior can be had with the
3213 existing block move logic. */
3214 if (MEM_P (x) && MEM_P (y))
3216 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
3217 BLOCK_OP_NO_LIBCALL);
3218 return get_last_insn ();
3221 ret = emit_move_via_integer (mode, x, y, true);
3226 return emit_move_complex_parts (x, y);
3229 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3230 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3233 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
3237 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3240 enum insn_code code = optab_handler (mov_optab, CCmode)->insn_code;
3241 if (code != CODE_FOR_nothing)
3243 x = emit_move_change_mode (CCmode, mode, x, true);
3244 y = emit_move_change_mode (CCmode, mode, y, true);
3245 return emit_insn (GEN_FCN (code) (x, y));
3249 /* Otherwise, find the MODE_INT mode of the same width. */
3250 ret = emit_move_via_integer (mode, x, y, false);
3251 gcc_assert (ret != NULL);
3255 /* Return true if word I of OP lies entirely in the
3256 undefined bits of a paradoxical subreg. */
3259 undefined_operand_subword_p (const_rtx op, int i)
3261 enum machine_mode innermode, innermostmode;
3263 if (GET_CODE (op) != SUBREG)
3265 innermode = GET_MODE (op);
3266 innermostmode = GET_MODE (SUBREG_REG (op));
3267 offset = i * UNITS_PER_WORD + SUBREG_BYTE (op);
3268 /* The SUBREG_BYTE represents offset, as if the value were stored in
3269 memory, except for a paradoxical subreg where we define
3270 SUBREG_BYTE to be 0; undo this exception as in
3272 if (SUBREG_BYTE (op) == 0
3273 && GET_MODE_SIZE (innermostmode) < GET_MODE_SIZE (innermode))
3275 int difference = (GET_MODE_SIZE (innermostmode) - GET_MODE_SIZE (innermode));
3276 if (WORDS_BIG_ENDIAN)
3277 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
3278 if (BYTES_BIG_ENDIAN)
3279 offset += difference % UNITS_PER_WORD;
3281 if (offset >= GET_MODE_SIZE (innermostmode)
3282 || offset <= -GET_MODE_SIZE (word_mode))
3287 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3288 MODE is any multi-word or full-word mode that lacks a move_insn
3289 pattern. Note that you will get better code if you define such
3290 patterns, even if they must turn into multiple assembler instructions. */
3293 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3300 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3302 /* If X is a push on the stack, do the push now and replace
3303 X with a reference to the stack pointer. */
3304 if (push_operand (x, mode))
3305 x = emit_move_resolve_push (mode, x);
3307 /* If we are in reload, see if either operand is a MEM whose address
3308 is scheduled for replacement. */
3309 if (reload_in_progress && MEM_P (x)
3310 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3311 x = replace_equiv_address_nv (x, inner);
3312 if (reload_in_progress && MEM_P (y)
3313 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3314 y = replace_equiv_address_nv (y, inner);
3318 need_clobber = false;
3320 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3323 rtx xpart = operand_subword (x, i, 1, mode);
3326 /* Do not generate code for a move if it would come entirely
3327 from the undefined bits of a paradoxical subreg. */
3328 if (undefined_operand_subword_p (y, i))
3331 ypart = operand_subword (y, i, 1, mode);
3333 /* If we can't get a part of Y, put Y into memory if it is a
3334 constant. Otherwise, force it into a register. Then we must
3335 be able to get a part of Y. */
3336 if (ypart == 0 && CONSTANT_P (y))
3338 y = use_anchored_address (force_const_mem (mode, y));
3339 ypart = operand_subword (y, i, 1, mode);
3341 else if (ypart == 0)
3342 ypart = operand_subword_force (y, i, mode);
3344 gcc_assert (xpart && ypart);
3346 need_clobber |= (GET_CODE (xpart) == SUBREG);
3348 last_insn = emit_move_insn (xpart, ypart);
3354 /* Show the output dies here. This is necessary for SUBREGs
3355 of pseudos since we cannot track their lifetimes correctly;
3356 hard regs shouldn't appear here except as return values.
3357 We never want to emit such a clobber after reload. */
3359 && ! (reload_in_progress || reload_completed)
3360 && need_clobber != 0)
3368 /* Low level part of emit_move_insn.
3369 Called just like emit_move_insn, but assumes X and Y
3370 are basically valid. */
3373 emit_move_insn_1 (rtx x, rtx y)
3375 enum machine_mode mode = GET_MODE (x);
3376 enum insn_code code;
3378 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3380 code = optab_handler (mov_optab, mode)->insn_code;
3381 if (code != CODE_FOR_nothing)
3382 return emit_insn (GEN_FCN (code) (x, y));
3384 /* Expand complex moves by moving real part and imag part. */
3385 if (COMPLEX_MODE_P (mode))
3386 return emit_move_complex (mode, x, y);
3388 if (GET_MODE_CLASS (mode) == MODE_DECIMAL_FLOAT
3389 || ALL_FIXED_POINT_MODE_P (mode))
3391 rtx result = emit_move_via_integer (mode, x, y, true);
3393 /* If we can't find an integer mode, use multi words. */
3397 return emit_move_multi_word (mode, x, y);
3400 if (GET_MODE_CLASS (mode) == MODE_CC)
3401 return emit_move_ccmode (mode, x, y);
3403 /* Try using a move pattern for the corresponding integer mode. This is
3404 only safe when simplify_subreg can convert MODE constants into integer
3405 constants. At present, it can only do this reliably if the value
3406 fits within a HOST_WIDE_INT. */
3407 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3409 rtx ret = emit_move_via_integer (mode, x, y, false);
3414 return emit_move_multi_word (mode, x, y);
3417 /* Generate code to copy Y into X.
3418 Both Y and X must have the same mode, except that
3419 Y can be a constant with VOIDmode.
3420 This mode cannot be BLKmode; use emit_block_move for that.
3422 Return the last instruction emitted. */
3425 emit_move_insn (rtx x, rtx y)
3427 enum machine_mode mode = GET_MODE (x);
3428 rtx y_cst = NULL_RTX;
3431 gcc_assert (mode != BLKmode
3432 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3437 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3438 && (last_insn = compress_float_constant (x, y)))
3443 if (!LEGITIMATE_CONSTANT_P (y))
3445 y = force_const_mem (mode, y);
3447 /* If the target's cannot_force_const_mem prevented the spill,
3448 assume that the target's move expanders will also take care
3449 of the non-legitimate constant. */
3453 y = use_anchored_address (y);
3457 /* If X or Y are memory references, verify that their addresses are valid
3460 && (! memory_address_addr_space_p (GET_MODE (x), XEXP (x, 0),
3462 && ! push_operand (x, GET_MODE (x))))
3463 x = validize_mem (x);
3466 && ! memory_address_addr_space_p (GET_MODE (y), XEXP (y, 0),
3467 MEM_ADDR_SPACE (y)))
3468 y = validize_mem (y);
3470 gcc_assert (mode != BLKmode);
3472 last_insn = emit_move_insn_1 (x, y);
3474 if (y_cst && REG_P (x)
3475 && (set = single_set (last_insn)) != NULL_RTX
3476 && SET_DEST (set) == x
3477 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3478 set_unique_reg_note (last_insn, REG_EQUAL, y_cst);
3483 /* If Y is representable exactly in a narrower mode, and the target can
3484 perform the extension directly from constant or memory, then emit the
3485 move as an extension. */
3488 compress_float_constant (rtx x, rtx y)
3490 enum machine_mode dstmode = GET_MODE (x);
3491 enum machine_mode orig_srcmode = GET_MODE (y);
3492 enum machine_mode srcmode;
3494 int oldcost, newcost;
3495 bool speed = optimize_insn_for_speed_p ();
3497 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3499 if (LEGITIMATE_CONSTANT_P (y))
3500 oldcost = rtx_cost (y, SET, speed);
3502 oldcost = rtx_cost (force_const_mem (dstmode, y), SET, speed);
3504 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3505 srcmode != orig_srcmode;
3506 srcmode = GET_MODE_WIDER_MODE (srcmode))
3509 rtx trunc_y, last_insn;
3511 /* Skip if the target can't extend this way. */
3512 ic = can_extend_p (dstmode, srcmode, 0);
3513 if (ic == CODE_FOR_nothing)
3516 /* Skip if the narrowed value isn't exact. */
3517 if (! exact_real_truncate (srcmode, &r))
3520 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3522 if (LEGITIMATE_CONSTANT_P (trunc_y))
3524 /* Skip if the target needs extra instructions to perform
3526 if (! (*insn_data[ic].operand[1].predicate) (trunc_y, srcmode))
3528 /* This is valid, but may not be cheaper than the original. */
3529 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3530 if (oldcost < newcost)
3533 else if (float_extend_from_mem[dstmode][srcmode])
3535 trunc_y = force_const_mem (srcmode, trunc_y);
3536 /* This is valid, but may not be cheaper than the original. */
3537 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3538 if (oldcost < newcost)
3540 trunc_y = validize_mem (trunc_y);
3545 /* For CSE's benefit, force the compressed constant pool entry
3546 into a new pseudo. This constant may be used in different modes,
3547 and if not, combine will put things back together for us. */
3548 trunc_y = force_reg (srcmode, trunc_y);
3549 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3550 last_insn = get_last_insn ();
3553 set_unique_reg_note (last_insn, REG_EQUAL, y);
3561 /* Pushing data onto the stack. */
3563 /* Push a block of length SIZE (perhaps variable)
3564 and return an rtx to address the beginning of the block.
3565 The value may be virtual_outgoing_args_rtx.
3567 EXTRA is the number of bytes of padding to push in addition to SIZE.
3568 BELOW nonzero means this padding comes at low addresses;
3569 otherwise, the padding comes at high addresses. */
3572 push_block (rtx size, int extra, int below)
3576 size = convert_modes (Pmode, ptr_mode, size, 1);
3577 if (CONSTANT_P (size))
3578 anti_adjust_stack (plus_constant (size, extra));
3579 else if (REG_P (size) && extra == 0)
3580 anti_adjust_stack (size);
3583 temp = copy_to_mode_reg (Pmode, size);
3585 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3586 temp, 0, OPTAB_LIB_WIDEN);
3587 anti_adjust_stack (temp);
3590 #ifndef STACK_GROWS_DOWNWARD
3596 temp = virtual_outgoing_args_rtx;
3597 if (extra != 0 && below)
3598 temp = plus_constant (temp, extra);
3602 if (CONST_INT_P (size))
3603 temp = plus_constant (virtual_outgoing_args_rtx,
3604 -INTVAL (size) - (below ? 0 : extra));
3605 else if (extra != 0 && !below)
3606 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3607 negate_rtx (Pmode, plus_constant (size, extra)));
3609 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3610 negate_rtx (Pmode, size));
3613 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3616 #ifdef PUSH_ROUNDING
3618 /* Emit single push insn. */
3621 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3624 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3626 enum insn_code icode;
3627 insn_operand_predicate_fn pred;
3629 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3630 /* If there is push pattern, use it. Otherwise try old way of throwing
3631 MEM representing push operation to move expander. */
3632 icode = optab_handler (push_optab, mode)->insn_code;
3633 if (icode != CODE_FOR_nothing)
3635 if (((pred = insn_data[(int) icode].operand[0].predicate)
3636 && !((*pred) (x, mode))))
3637 x = force_reg (mode, x);
3638 emit_insn (GEN_FCN (icode) (x));
3641 if (GET_MODE_SIZE (mode) == rounded_size)
3642 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3643 /* If we are to pad downward, adjust the stack pointer first and
3644 then store X into the stack location using an offset. This is
3645 because emit_move_insn does not know how to pad; it does not have
3647 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3649 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3650 HOST_WIDE_INT offset;
3652 emit_move_insn (stack_pointer_rtx,
3653 expand_binop (Pmode,
3654 #ifdef STACK_GROWS_DOWNWARD
3660 GEN_INT (rounded_size),
3661 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3663 offset = (HOST_WIDE_INT) padding_size;
3664 #ifdef STACK_GROWS_DOWNWARD
3665 if (STACK_PUSH_CODE == POST_DEC)
3666 /* We have already decremented the stack pointer, so get the
3668 offset += (HOST_WIDE_INT) rounded_size;
3670 if (STACK_PUSH_CODE == POST_INC)
3671 /* We have already incremented the stack pointer, so get the
3673 offset -= (HOST_WIDE_INT) rounded_size;
3675 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3679 #ifdef STACK_GROWS_DOWNWARD
3680 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3681 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3682 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3684 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3685 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3686 GEN_INT (rounded_size));
3688 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3691 dest = gen_rtx_MEM (mode, dest_addr);
3695 set_mem_attributes (dest, type, 1);
3697 if (flag_optimize_sibling_calls)
3698 /* Function incoming arguments may overlap with sibling call
3699 outgoing arguments and we cannot allow reordering of reads
3700 from function arguments with stores to outgoing arguments
3701 of sibling calls. */
3702 set_mem_alias_set (dest, 0);
3704 emit_move_insn (dest, x);
3708 /* Generate code to push X onto the stack, assuming it has mode MODE and
3710 MODE is redundant except when X is a CONST_INT (since they don't
3712 SIZE is an rtx for the size of data to be copied (in bytes),
3713 needed only if X is BLKmode.
3715 ALIGN (in bits) is maximum alignment we can assume.
3717 If PARTIAL and REG are both nonzero, then copy that many of the first
3718 bytes of X into registers starting with REG, and push the rest of X.
3719 The amount of space pushed is decreased by PARTIAL bytes.
3720 REG must be a hard register in this case.
3721 If REG is zero but PARTIAL is not, take any all others actions for an
3722 argument partially in registers, but do not actually load any
3725 EXTRA is the amount in bytes of extra space to leave next to this arg.
3726 This is ignored if an argument block has already been allocated.
3728 On a machine that lacks real push insns, ARGS_ADDR is the address of
3729 the bottom of the argument block for this call. We use indexing off there
3730 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3731 argument block has not been preallocated.
3733 ARGS_SO_FAR is the size of args previously pushed for this call.
3735 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3736 for arguments passed in registers. If nonzero, it will be the number
3737 of bytes required. */
3740 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3741 unsigned int align, int partial, rtx reg, int extra,
3742 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3746 enum direction stack_direction
3747 #ifdef STACK_GROWS_DOWNWARD
3753 /* Decide where to pad the argument: `downward' for below,
3754 `upward' for above, or `none' for don't pad it.
3755 Default is below for small data on big-endian machines; else above. */
3756 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3758 /* Invert direction if stack is post-decrement.
3760 if (STACK_PUSH_CODE == POST_DEC)
3761 if (where_pad != none)
3762 where_pad = (where_pad == downward ? upward : downward);
3767 || (STRICT_ALIGNMENT && align < GET_MODE_ALIGNMENT (mode)))
3769 /* Copy a block into the stack, entirely or partially. */
3776 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3777 used = partial - offset;
3779 if (mode != BLKmode)
3781 /* A value is to be stored in an insufficiently aligned
3782 stack slot; copy via a suitably aligned slot if
3784 size = GEN_INT (GET_MODE_SIZE (mode));
3785 if (!MEM_P (xinner))
3787 temp = assign_temp (type, 0, 1, 1);
3788 emit_move_insn (temp, xinner);
3795 /* USED is now the # of bytes we need not copy to the stack
3796 because registers will take care of them. */
3799 xinner = adjust_address (xinner, BLKmode, used);
3801 /* If the partial register-part of the arg counts in its stack size,
3802 skip the part of stack space corresponding to the registers.
3803 Otherwise, start copying to the beginning of the stack space,
3804 by setting SKIP to 0. */
3805 skip = (reg_parm_stack_space == 0) ? 0 : used;
3807 #ifdef PUSH_ROUNDING
3808 /* Do it with several push insns if that doesn't take lots of insns
3809 and if there is no difficulty with push insns that skip bytes
3810 on the stack for alignment purposes. */
3813 && CONST_INT_P (size)
3815 && MEM_ALIGN (xinner) >= align
3816 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3817 /* Here we avoid the case of a structure whose weak alignment
3818 forces many pushes of a small amount of data,
3819 and such small pushes do rounding that causes trouble. */
3820 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3821 || align >= BIGGEST_ALIGNMENT
3822 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3823 == (align / BITS_PER_UNIT)))
3824 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3826 /* Push padding now if padding above and stack grows down,
3827 or if padding below and stack grows up.
3828 But if space already allocated, this has already been done. */
3829 if (extra && args_addr == 0
3830 && where_pad != none && where_pad != stack_direction)
3831 anti_adjust_stack (GEN_INT (extra));
3833 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3836 #endif /* PUSH_ROUNDING */
3840 /* Otherwise make space on the stack and copy the data
3841 to the address of that space. */
3843 /* Deduct words put into registers from the size we must copy. */
3846 if (CONST_INT_P (size))
3847 size = GEN_INT (INTVAL (size) - used);
3849 size = expand_binop (GET_MODE (size), sub_optab, size,
3850 GEN_INT (used), NULL_RTX, 0,
3854 /* Get the address of the stack space.
3855 In this case, we do not deal with EXTRA separately.
3856 A single stack adjust will do. */
3859 temp = push_block (size, extra, where_pad == downward);
3862 else if (CONST_INT_P (args_so_far))
3863 temp = memory_address (BLKmode,
3864 plus_constant (args_addr,
3865 skip + INTVAL (args_so_far)));
3867 temp = memory_address (BLKmode,
3868 plus_constant (gen_rtx_PLUS (Pmode,
3873 if (!ACCUMULATE_OUTGOING_ARGS)
3875 /* If the source is referenced relative to the stack pointer,
3876 copy it to another register to stabilize it. We do not need
3877 to do this if we know that we won't be changing sp. */
3879 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3880 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3881 temp = copy_to_reg (temp);
3884 target = gen_rtx_MEM (BLKmode, temp);
3886 /* We do *not* set_mem_attributes here, because incoming arguments
3887 may overlap with sibling call outgoing arguments and we cannot
3888 allow reordering of reads from function arguments with stores
3889 to outgoing arguments of sibling calls. We do, however, want
3890 to record the alignment of the stack slot. */
3891 /* ALIGN may well be better aligned than TYPE, e.g. due to
3892 PARM_BOUNDARY. Assume the caller isn't lying. */
3893 set_mem_align (target, align);
3895 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3898 else if (partial > 0)
3900 /* Scalar partly in registers. */
3902 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3905 /* # bytes of start of argument
3906 that we must make space for but need not store. */
3907 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3908 int args_offset = INTVAL (args_so_far);
3911 /* Push padding now if padding above and stack grows down,
3912 or if padding below and stack grows up.
3913 But if space already allocated, this has already been done. */
3914 if (extra && args_addr == 0
3915 && where_pad != none && where_pad != stack_direction)
3916 anti_adjust_stack (GEN_INT (extra));
3918 /* If we make space by pushing it, we might as well push
3919 the real data. Otherwise, we can leave OFFSET nonzero
3920 and leave the space uninitialized. */
3924 /* Now NOT_STACK gets the number of words that we don't need to
3925 allocate on the stack. Convert OFFSET to words too. */
3926 not_stack = (partial - offset) / UNITS_PER_WORD;
3927 offset /= UNITS_PER_WORD;
3929 /* If the partial register-part of the arg counts in its stack size,
3930 skip the part of stack space corresponding to the registers.
3931 Otherwise, start copying to the beginning of the stack space,
3932 by setting SKIP to 0. */
3933 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3935 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3936 x = validize_mem (force_const_mem (mode, x));
3938 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3939 SUBREGs of such registers are not allowed. */
3940 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3941 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3942 x = copy_to_reg (x);
3944 /* Loop over all the words allocated on the stack for this arg. */
3945 /* We can do it by words, because any scalar bigger than a word
3946 has a size a multiple of a word. */
3947 #ifndef PUSH_ARGS_REVERSED
3948 for (i = not_stack; i < size; i++)
3950 for (i = size - 1; i >= not_stack; i--)
3952 if (i >= not_stack + offset)
3953 emit_push_insn (operand_subword_force (x, i, mode),
3954 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3956 GEN_INT (args_offset + ((i - not_stack + skip)
3958 reg_parm_stack_space, alignment_pad);
3965 /* Push padding now if padding above and stack grows down,
3966 or if padding below and stack grows up.
3967 But if space already allocated, this has already been done. */
3968 if (extra && args_addr == 0
3969 && where_pad != none && where_pad != stack_direction)
3970 anti_adjust_stack (GEN_INT (extra));
3972 #ifdef PUSH_ROUNDING
3973 if (args_addr == 0 && PUSH_ARGS)
3974 emit_single_push_insn (mode, x, type);
3978 if (CONST_INT_P (args_so_far))
3980 = memory_address (mode,
3981 plus_constant (args_addr,
3982 INTVAL (args_so_far)));
3984 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3986 dest = gen_rtx_MEM (mode, addr);
3988 /* We do *not* set_mem_attributes here, because incoming arguments
3989 may overlap with sibling call outgoing arguments and we cannot
3990 allow reordering of reads from function arguments with stores
3991 to outgoing arguments of sibling calls. We do, however, want
3992 to record the alignment of the stack slot. */
3993 /* ALIGN may well be better aligned than TYPE, e.g. due to
3994 PARM_BOUNDARY. Assume the caller isn't lying. */
3995 set_mem_align (dest, align);
3997 emit_move_insn (dest, x);
4001 /* If part should go in registers, copy that part
4002 into the appropriate registers. Do this now, at the end,
4003 since mem-to-mem copies above may do function calls. */
4004 if (partial > 0 && reg != 0)
4006 /* Handle calls that pass values in multiple non-contiguous locations.
4007 The Irix 6 ABI has examples of this. */
4008 if (GET_CODE (reg) == PARALLEL)
4009 emit_group_load (reg, x, type, -1);
4012 gcc_assert (partial % UNITS_PER_WORD == 0);
4013 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
4017 if (extra && args_addr == 0 && where_pad == stack_direction)
4018 anti_adjust_stack (GEN_INT (extra));
4020 if (alignment_pad && args_addr == 0)
4021 anti_adjust_stack (alignment_pad);
4024 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4028 get_subtarget (rtx x)
4032 /* Only registers can be subtargets. */
4034 /* Don't use hard regs to avoid extending their life. */
4035 || REGNO (x) < FIRST_PSEUDO_REGISTER
4039 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
4040 FIELD is a bitfield. Returns true if the optimization was successful,
4041 and there's nothing else to do. */
4044 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
4045 unsigned HOST_WIDE_INT bitpos,
4046 enum machine_mode mode1, rtx str_rtx,
4049 enum machine_mode str_mode = GET_MODE (str_rtx);
4050 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
4055 if (mode1 != VOIDmode
4056 || bitsize >= BITS_PER_WORD
4057 || str_bitsize > BITS_PER_WORD
4058 || TREE_SIDE_EFFECTS (to)
4059 || TREE_THIS_VOLATILE (to))
4063 if (!BINARY_CLASS_P (src)
4064 || TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
4067 op0 = TREE_OPERAND (src, 0);
4068 op1 = TREE_OPERAND (src, 1);
4071 if (!operand_equal_p (to, op0, 0))
4074 if (MEM_P (str_rtx))
4076 unsigned HOST_WIDE_INT offset1;
4078 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
4079 str_mode = word_mode;
4080 str_mode = get_best_mode (bitsize, bitpos,
4081 MEM_ALIGN (str_rtx), str_mode, 0);
4082 if (str_mode == VOIDmode)
4084 str_bitsize = GET_MODE_BITSIZE (str_mode);
4087 bitpos %= str_bitsize;
4088 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
4089 str_rtx = adjust_address (str_rtx, str_mode, offset1);
4091 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
4094 /* If the bit field covers the whole REG/MEM, store_field
4095 will likely generate better code. */
4096 if (bitsize >= str_bitsize)
4099 /* We can't handle fields split across multiple entities. */
4100 if (bitpos + bitsize > str_bitsize)
4103 if (BYTES_BIG_ENDIAN)
4104 bitpos = str_bitsize - bitpos - bitsize;
4106 switch (TREE_CODE (src))
4110 /* For now, just optimize the case of the topmost bitfield
4111 where we don't need to do any masking and also
4112 1 bit bitfields where xor can be used.
4113 We might win by one instruction for the other bitfields
4114 too if insv/extv instructions aren't used, so that
4115 can be added later. */
4116 if (bitpos + bitsize != str_bitsize
4117 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
4120 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4121 value = convert_modes (str_mode,
4122 TYPE_MODE (TREE_TYPE (op1)), value,
4123 TYPE_UNSIGNED (TREE_TYPE (op1)));
4125 /* We may be accessing data outside the field, which means
4126 we can alias adjacent data. */
4127 if (MEM_P (str_rtx))
4129 str_rtx = shallow_copy_rtx (str_rtx);
4130 set_mem_alias_set (str_rtx, 0);
4131 set_mem_expr (str_rtx, 0);
4134 binop = TREE_CODE (src) == PLUS_EXPR ? add_optab : sub_optab;
4135 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
4137 value = expand_and (str_mode, value, const1_rtx, NULL);
4140 value = expand_shift (LSHIFT_EXPR, str_mode, value,
4141 build_int_cst (NULL_TREE, bitpos),
4143 result = expand_binop (str_mode, binop, str_rtx,
4144 value, str_rtx, 1, OPTAB_WIDEN);
4145 if (result != str_rtx)
4146 emit_move_insn (str_rtx, result);
4151 if (TREE_CODE (op1) != INTEGER_CST)
4153 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), EXPAND_NORMAL);
4154 value = convert_modes (GET_MODE (str_rtx),
4155 TYPE_MODE (TREE_TYPE (op1)), value,
4156 TYPE_UNSIGNED (TREE_TYPE (op1)));
4158 /* We may be accessing data outside the field, which means
4159 we can alias adjacent data. */
4160 if (MEM_P (str_rtx))
4162 str_rtx = shallow_copy_rtx (str_rtx);
4163 set_mem_alias_set (str_rtx, 0);
4164 set_mem_expr (str_rtx, 0);
4167 binop = TREE_CODE (src) == BIT_IOR_EXPR ? ior_optab : xor_optab;
4168 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
4170 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
4172 value = expand_and (GET_MODE (str_rtx), value, mask,
4175 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
4176 build_int_cst (NULL_TREE, bitpos),
4178 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
4179 value, str_rtx, 1, OPTAB_WIDEN);
4180 if (result != str_rtx)
4181 emit_move_insn (str_rtx, result);
4192 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4193 is true, try generating a nontemporal store. */
4196 expand_assignment (tree to, tree from, bool nontemporal)
4201 /* Don't crash if the lhs of the assignment was erroneous. */
4202 if (TREE_CODE (to) == ERROR_MARK)
4204 result = expand_normal (from);
4208 /* Optimize away no-op moves without side-effects. */
4209 if (operand_equal_p (to, from, 0))
4212 /* Assignment of a structure component needs special treatment
4213 if the structure component's rtx is not simply a MEM.
4214 Assignment of an array element at a constant index, and assignment of
4215 an array element in an unaligned packed structure field, has the same
4217 if (handled_component_p (to)
4218 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4220 enum machine_mode mode1;
4221 HOST_WIDE_INT bitsize, bitpos;
4228 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4229 &unsignedp, &volatilep, true);
4231 /* If we are going to use store_bit_field and extract_bit_field,
4232 make sure to_rtx will be safe for multiple use. */
4234 to_rtx = expand_normal (tem);
4238 enum machine_mode address_mode;
4241 if (!MEM_P (to_rtx))
4243 /* We can get constant negative offsets into arrays with broken
4244 user code. Translate this to a trap instead of ICEing. */
4245 gcc_assert (TREE_CODE (offset) == INTEGER_CST);
4246 expand_builtin_trap ();
4247 to_rtx = gen_rtx_MEM (BLKmode, const0_rtx);
4250 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4252 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
4253 if (GET_MODE (offset_rtx) != address_mode)
4254 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
4256 /* A constant address in TO_RTX can have VOIDmode, we must not try
4257 to call force_reg for that case. Avoid that case. */
4259 && GET_MODE (to_rtx) == BLKmode
4260 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4262 && (bitpos % bitsize) == 0
4263 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4264 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4266 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4270 to_rtx = offset_address (to_rtx, offset_rtx,
4271 highest_pow2_factor_for_target (to,
4275 /* Handle expand_expr of a complex value returning a CONCAT. */
4276 if (GET_CODE (to_rtx) == CONCAT)
4278 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from))))
4280 gcc_assert (bitpos == 0);
4281 result = store_expr (from, to_rtx, false, nontemporal);
4285 gcc_assert (bitpos == 0 || bitpos == GET_MODE_BITSIZE (mode1));
4286 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false,
4294 /* If the field is at offset zero, we could have been given the
4295 DECL_RTX of the parent struct. Don't munge it. */
4296 to_rtx = shallow_copy_rtx (to_rtx);
4298 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4300 /* Deal with volatile and readonly fields. The former is only
4301 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4303 MEM_VOLATILE_P (to_rtx) = 1;
4304 if (component_uses_parent_alias_set (to))
4305 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4308 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
4312 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
4313 TREE_TYPE (tem), get_alias_set (to),
4318 preserve_temp_slots (result);
4324 else if (TREE_CODE (to) == MISALIGNED_INDIRECT_REF)
4326 addr_space_t as = ADDR_SPACE_GENERIC;
4327 enum machine_mode mode, op_mode1;
4328 enum insn_code icode;
4329 rtx reg, addr, mem, insn;
4331 if (POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (to, 0))))
4332 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (to, 0))));
4334 reg = expand_expr (from, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4335 reg = force_not_mem (reg);
4337 mode = TYPE_MODE (TREE_TYPE (to));
4338 addr = expand_expr (TREE_OPERAND (to, 0), NULL_RTX, VOIDmode,
4340 addr = memory_address_addr_space (mode, addr, as);
4341 mem = gen_rtx_MEM (mode, addr);
4343 set_mem_attributes (mem, to, 0);
4344 set_mem_addr_space (mem, as);
4346 icode = movmisalign_optab->handlers[mode].insn_code;
4347 gcc_assert (icode != CODE_FOR_nothing);
4349 op_mode1 = insn_data[icode].operand[1].mode;
4350 if (! (*insn_data[icode].operand[1].predicate) (reg, op_mode1)
4351 && op_mode1 != VOIDmode)
4352 reg = copy_to_mode_reg (op_mode1, reg);
4354 insn = GEN_FCN (icode) (mem, reg);
4359 /* If the rhs is a function call and its value is not an aggregate,
4360 call the function before we start to compute the lhs.
4361 This is needed for correct code for cases such as
4362 val = setjmp (buf) on machines where reference to val
4363 requires loading up part of an address in a separate insn.
4365 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4366 since it might be a promoted variable where the zero- or sign- extension
4367 needs to be done. Handling this in the normal way is safe because no
4368 computation is done before the call. The same is true for SSA names. */
4369 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
4370 && COMPLETE_TYPE_P (TREE_TYPE (from))
4371 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4372 && ! (((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
4373 && REG_P (DECL_RTL (to)))
4374 || TREE_CODE (to) == SSA_NAME))
4379 value = expand_normal (from);
4381 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4383 /* Handle calls that return values in multiple non-contiguous locations.
4384 The Irix 6 ABI has examples of this. */
4385 if (GET_CODE (to_rtx) == PARALLEL)
4386 emit_group_load (to_rtx, value, TREE_TYPE (from),
4387 int_size_in_bytes (TREE_TYPE (from)));
4388 else if (GET_MODE (to_rtx) == BLKmode)
4389 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4392 if (POINTER_TYPE_P (TREE_TYPE (to)))
4393 value = convert_memory_address_addr_space
4394 (GET_MODE (to_rtx), value,
4395 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to))));
4397 emit_move_insn (to_rtx, value);
4399 preserve_temp_slots (to_rtx);
4405 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4406 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4409 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4411 /* Don't move directly into a return register. */
4412 if (TREE_CODE (to) == RESULT_DECL
4413 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4418 temp = expand_expr (from, NULL_RTX, GET_MODE (to_rtx), EXPAND_NORMAL);
4420 if (GET_CODE (to_rtx) == PARALLEL)
4421 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4422 int_size_in_bytes (TREE_TYPE (from)));
4424 emit_move_insn (to_rtx, temp);
4426 preserve_temp_slots (to_rtx);
4432 /* In case we are returning the contents of an object which overlaps
4433 the place the value is being stored, use a safe function when copying
4434 a value through a pointer into a structure value return block. */
4435 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
4436 && ADDR_SPACE_GENERIC_P
4437 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from, 0)))))
4438 && cfun->returns_struct
4439 && !cfun->returns_pcc_struct)
4444 size = expr_size (from);
4445 from_rtx = expand_normal (from);
4447 emit_library_call (memmove_libfunc, LCT_NORMAL,
4448 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4449 XEXP (from_rtx, 0), Pmode,
4450 convert_to_mode (TYPE_MODE (sizetype),
4451 size, TYPE_UNSIGNED (sizetype)),
4452 TYPE_MODE (sizetype));
4454 preserve_temp_slots (to_rtx);
4460 /* Compute FROM and store the value in the rtx we got. */
4463 result = store_expr (from, to_rtx, 0, nontemporal);
4464 preserve_temp_slots (result);
4470 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4471 succeeded, false otherwise. */
4474 emit_storent_insn (rtx to, rtx from)
4476 enum machine_mode mode = GET_MODE (to), imode;
4477 enum insn_code code = optab_handler (storent_optab, mode)->insn_code;
4480 if (code == CODE_FOR_nothing)
4483 imode = insn_data[code].operand[0].mode;
4484 if (!insn_data[code].operand[0].predicate (to, imode))
4487 imode = insn_data[code].operand[1].mode;
4488 if (!insn_data[code].operand[1].predicate (from, imode))
4490 from = copy_to_mode_reg (imode, from);
4491 if (!insn_data[code].operand[1].predicate (from, imode))
4495 pattern = GEN_FCN (code) (to, from);
4496 if (pattern == NULL_RTX)
4499 emit_insn (pattern);
4503 /* Generate code for computing expression EXP,
4504 and storing the value into TARGET.
4506 If the mode is BLKmode then we may return TARGET itself.
4507 It turns out that in BLKmode it doesn't cause a problem.
4508 because C has no operators that could combine two different
4509 assignments into the same BLKmode object with different values
4510 with no sequence point. Will other languages need this to
4513 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4514 stack, and block moves may need to be treated specially.
4516 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4519 store_expr (tree exp, rtx target, int call_param_p, bool nontemporal)
4522 rtx alt_rtl = NULL_RTX;
4523 location_t loc = EXPR_LOCATION (exp);
4525 if (VOID_TYPE_P (TREE_TYPE (exp)))
4527 /* C++ can generate ?: expressions with a throw expression in one
4528 branch and an rvalue in the other. Here, we resolve attempts to
4529 store the throw expression's nonexistent result. */
4530 gcc_assert (!call_param_p);
4531 expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4534 if (TREE_CODE (exp) == COMPOUND_EXPR)
4536 /* Perform first part of compound expression, then assign from second
4538 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4539 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4540 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4543 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4545 /* For conditional expression, get safe form of the target. Then
4546 test the condition, doing the appropriate assignment on either
4547 side. This avoids the creation of unnecessary temporaries.
4548 For non-BLKmode, it is more efficient not to do this. */
4550 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4552 do_pending_stack_adjust ();
4554 jumpifnot (TREE_OPERAND (exp, 0), lab1);
4555 store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4557 emit_jump_insn (gen_jump (lab2));
4560 store_expr (TREE_OPERAND (exp, 2), target, call_param_p,
4567 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4568 /* If this is a scalar in a register that is stored in a wider mode
4569 than the declared mode, compute the result into its declared mode
4570 and then convert to the wider mode. Our value is the computed
4573 rtx inner_target = 0;
4575 /* We can do the conversion inside EXP, which will often result
4576 in some optimizations. Do the conversion in two steps: first
4577 change the signedness, if needed, then the extend. But don't
4578 do this if the type of EXP is a subtype of something else
4579 since then the conversion might involve more than just
4580 converting modes. */
4581 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4582 && TREE_TYPE (TREE_TYPE (exp)) == 0
4583 && GET_MODE_PRECISION (GET_MODE (target))
4584 == TYPE_PRECISION (TREE_TYPE (exp)))
4586 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4587 != SUBREG_PROMOTED_UNSIGNED_P (target))
4589 /* Some types, e.g. Fortran's logical*4, won't have a signed
4590 version, so use the mode instead. */
4592 = (signed_or_unsigned_type_for
4593 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)));
4595 ntype = lang_hooks.types.type_for_mode
4596 (TYPE_MODE (TREE_TYPE (exp)),
4597 SUBREG_PROMOTED_UNSIGNED_P (target));
4599 exp = fold_convert_loc (loc, ntype, exp);
4602 exp = fold_convert_loc (loc, lang_hooks.types.type_for_mode
4603 (GET_MODE (SUBREG_REG (target)),
4604 SUBREG_PROMOTED_UNSIGNED_P (target)),
4607 inner_target = SUBREG_REG (target);
4610 temp = expand_expr (exp, inner_target, VOIDmode,
4611 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4613 /* If TEMP is a VOIDmode constant, use convert_modes to make
4614 sure that we properly convert it. */
4615 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4617 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4618 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4619 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4620 GET_MODE (target), temp,
4621 SUBREG_PROMOTED_UNSIGNED_P (target));
4624 convert_move (SUBREG_REG (target), temp,
4625 SUBREG_PROMOTED_UNSIGNED_P (target));
4629 else if (TREE_CODE (exp) == STRING_CST
4630 && !nontemporal && !call_param_p
4631 && TREE_STRING_LENGTH (exp) > 0
4632 && TYPE_MODE (TREE_TYPE (exp)) == BLKmode)
4634 /* Optimize initialization of an array with a STRING_CST. */
4635 HOST_WIDE_INT exp_len, str_copy_len;
4638 exp_len = int_expr_size (exp);
4642 str_copy_len = strlen (TREE_STRING_POINTER (exp));
4643 if (str_copy_len < TREE_STRING_LENGTH (exp) - 1)
4646 str_copy_len = TREE_STRING_LENGTH (exp);
4647 if ((STORE_MAX_PIECES & (STORE_MAX_PIECES - 1)) == 0)
4649 str_copy_len += STORE_MAX_PIECES - 1;
4650 str_copy_len &= ~(STORE_MAX_PIECES - 1);
4652 str_copy_len = MIN (str_copy_len, exp_len);
4653 if (!can_store_by_pieces (str_copy_len, builtin_strncpy_read_str,
4654 CONST_CAST(char *, TREE_STRING_POINTER (exp)),
4655 MEM_ALIGN (target), false))
4660 dest_mem = store_by_pieces (dest_mem,
4661 str_copy_len, builtin_strncpy_read_str,
4662 CONST_CAST(char *, TREE_STRING_POINTER (exp)),
4663 MEM_ALIGN (target), false,
4664 exp_len > str_copy_len ? 1 : 0);
4665 if (exp_len > str_copy_len)
4666 clear_storage (adjust_address (dest_mem, BLKmode, 0),
4667 GEN_INT (exp_len - str_copy_len),
4676 /* If we want to use a nontemporal store, force the value to
4678 tmp_target = nontemporal ? NULL_RTX : target;
4679 temp = expand_expr_real (exp, tmp_target, GET_MODE (target),
4681 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4685 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4686 the same as that of TARGET, adjust the constant. This is needed, for
4687 example, in case it is a CONST_DOUBLE and we want only a word-sized
4689 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4690 && TREE_CODE (exp) != ERROR_MARK
4691 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4692 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4693 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4695 /* If value was not generated in the target, store it there.
4696 Convert the value to TARGET's type first if necessary and emit the
4697 pending incrementations that have been queued when expanding EXP.
4698 Note that we cannot emit the whole queue blindly because this will
4699 effectively disable the POST_INC optimization later.
4701 If TEMP and TARGET compare equal according to rtx_equal_p, but
4702 one or both of them are volatile memory refs, we have to distinguish
4704 - expand_expr has used TARGET. In this case, we must not generate
4705 another copy. This can be detected by TARGET being equal according
4707 - expand_expr has not used TARGET - that means that the source just
4708 happens to have the same RTX form. Since temp will have been created
4709 by expand_expr, it will compare unequal according to == .
4710 We must generate a copy in this case, to reach the correct number
4711 of volatile memory references. */
4713 if ((! rtx_equal_p (temp, target)
4714 || (temp != target && (side_effects_p (temp)
4715 || side_effects_p (target))))
4716 && TREE_CODE (exp) != ERROR_MARK
4717 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4718 but TARGET is not valid memory reference, TEMP will differ
4719 from TARGET although it is really the same location. */
4720 && !(alt_rtl && rtx_equal_p (alt_rtl, target))
4721 /* If there's nothing to copy, don't bother. Don't call
4722 expr_size unless necessary, because some front-ends (C++)
4723 expr_size-hook must not be given objects that are not
4724 supposed to be bit-copied or bit-initialized. */
4725 && expr_size (exp) != const0_rtx)
4727 if (GET_MODE (temp) != GET_MODE (target)
4728 && GET_MODE (temp) != VOIDmode)
4730 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4731 if (GET_MODE (target) == BLKmode
4732 || GET_MODE (temp) == BLKmode)
4733 emit_block_move (target, temp, expr_size (exp),
4735 ? BLOCK_OP_CALL_PARM
4736 : BLOCK_OP_NORMAL));
4738 convert_move (target, temp, unsignedp);
4741 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4743 /* Handle copying a string constant into an array. The string
4744 constant may be shorter than the array. So copy just the string's
4745 actual length, and clear the rest. First get the size of the data
4746 type of the string, which is actually the size of the target. */
4747 rtx size = expr_size (exp);
4749 if (CONST_INT_P (size)
4750 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4751 emit_block_move (target, temp, size,
4753 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4756 enum machine_mode pointer_mode
4757 = targetm.addr_space.pointer_mode (MEM_ADDR_SPACE (target));
4758 enum machine_mode address_mode
4759 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (target));
4761 /* Compute the size of the data to copy from the string. */
4763 = size_binop_loc (loc, MIN_EXPR,
4764 make_tree (sizetype, size),
4765 size_int (TREE_STRING_LENGTH (exp)));
4767 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4769 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4772 /* Copy that much. */
4773 copy_size_rtx = convert_to_mode (pointer_mode, copy_size_rtx,
4774 TYPE_UNSIGNED (sizetype));
4775 emit_block_move (target, temp, copy_size_rtx,
4777 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4779 /* Figure out how much is left in TARGET that we have to clear.
4780 Do all calculations in pointer_mode. */
4781 if (CONST_INT_P (copy_size_rtx))
4783 size = plus_constant (size, -INTVAL (copy_size_rtx));
4784 target = adjust_address (target, BLKmode,
4785 INTVAL (copy_size_rtx));
4789 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4790 copy_size_rtx, NULL_RTX, 0,
4793 if (GET_MODE (copy_size_rtx) != address_mode)
4794 copy_size_rtx = convert_to_mode (address_mode,
4796 TYPE_UNSIGNED (sizetype));
4798 target = offset_address (target, copy_size_rtx,
4799 highest_pow2_factor (copy_size));
4800 label = gen_label_rtx ();
4801 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4802 GET_MODE (size), 0, label);
4805 if (size != const0_rtx)
4806 clear_storage (target, size, BLOCK_OP_NORMAL);
4812 /* Handle calls that return values in multiple non-contiguous locations.
4813 The Irix 6 ABI has examples of this. */
4814 else if (GET_CODE (target) == PARALLEL)
4815 emit_group_load (target, temp, TREE_TYPE (exp),
4816 int_size_in_bytes (TREE_TYPE (exp)));
4817 else if (GET_MODE (temp) == BLKmode)
4818 emit_block_move (target, temp, expr_size (exp),
4820 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4821 else if (nontemporal
4822 && emit_storent_insn (target, temp))
4823 /* If we managed to emit a nontemporal store, there is nothing else to
4828 temp = force_operand (temp, target);
4830 emit_move_insn (target, temp);
4837 /* Helper for categorize_ctor_elements. Identical interface. */
4840 categorize_ctor_elements_1 (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4841 HOST_WIDE_INT *p_elt_count,
4844 unsigned HOST_WIDE_INT idx;
4845 HOST_WIDE_INT nz_elts, elt_count;
4846 tree value, purpose;
4848 /* Whether CTOR is a valid constant initializer, in accordance with what
4849 initializer_constant_valid_p does. If inferred from the constructor
4850 elements, true until proven otherwise. */
4851 bool const_from_elts_p = constructor_static_from_elts_p (ctor);
4852 bool const_p = const_from_elts_p ? true : TREE_STATIC (ctor);
4857 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), idx, purpose, value)
4862 if (TREE_CODE (purpose) == RANGE_EXPR)
4864 tree lo_index = TREE_OPERAND (purpose, 0);
4865 tree hi_index = TREE_OPERAND (purpose, 1);
4867 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
4868 mult = (tree_low_cst (hi_index, 1)
4869 - tree_low_cst (lo_index, 1) + 1);
4872 switch (TREE_CODE (value))
4876 HOST_WIDE_INT nz = 0, ic = 0;
4879 = categorize_ctor_elements_1 (value, &nz, &ic, p_must_clear);
4881 nz_elts += mult * nz;
4882 elt_count += mult * ic;
4884 if (const_from_elts_p && const_p)
4885 const_p = const_elt_p;
4892 if (!initializer_zerop (value))
4898 nz_elts += mult * TREE_STRING_LENGTH (value);
4899 elt_count += mult * TREE_STRING_LENGTH (value);
4903 if (!initializer_zerop (TREE_REALPART (value)))
4905 if (!initializer_zerop (TREE_IMAGPART (value)))
4913 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
4915 if (!initializer_zerop (TREE_VALUE (v)))
4926 if (const_from_elts_p && const_p)
4927 const_p = initializer_constant_valid_p (value, TREE_TYPE (value))
4934 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4935 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
4938 bool clear_this = true;
4940 if (!VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (ctor)))
4942 /* We don't expect more than one element of the union to be
4943 initialized. Not sure what we should do otherwise... */
4944 gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ctor))
4947 init_sub_type = TREE_TYPE (VEC_index (constructor_elt,
4948 CONSTRUCTOR_ELTS (ctor),
4951 /* ??? We could look at each element of the union, and find the
4952 largest element. Which would avoid comparing the size of the
4953 initialized element against any tail padding in the union.
4954 Doesn't seem worth the effort... */
4955 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
4956 TYPE_SIZE (init_sub_type)) == 1)
4958 /* And now we have to find out if the element itself is fully
4959 constructed. E.g. for union { struct { int a, b; } s; } u
4960 = { .s = { .a = 1 } }. */
4961 if (elt_count == count_type_elements (init_sub_type, false))
4966 *p_must_clear = clear_this;
4969 *p_nz_elts += nz_elts;
4970 *p_elt_count += elt_count;
4975 /* Examine CTOR to discover:
4976 * how many scalar fields are set to nonzero values,
4977 and place it in *P_NZ_ELTS;
4978 * how many scalar fields in total are in CTOR,
4979 and place it in *P_ELT_COUNT.
4980 * if a type is a union, and the initializer from the constructor
4981 is not the largest element in the union, then set *p_must_clear.
4983 Return whether or not CTOR is a valid static constant initializer, the same
4984 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4987 categorize_ctor_elements (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4988 HOST_WIDE_INT *p_elt_count,
4993 *p_must_clear = false;
4996 categorize_ctor_elements_1 (ctor, p_nz_elts, p_elt_count, p_must_clear);
4999 /* Count the number of scalars in TYPE. Return -1 on overflow or
5000 variable-sized. If ALLOW_FLEXARR is true, don't count flexible
5001 array member at the end of the structure. */
5004 count_type_elements (const_tree type, bool allow_flexarr)
5006 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
5007 switch (TREE_CODE (type))
5011 tree telts = array_type_nelts (type);
5012 if (telts && host_integerp (telts, 1))
5014 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
5015 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type), false);
5018 else if (max / n > m)
5026 HOST_WIDE_INT n = 0, t;
5029 for (f = TYPE_FIELDS (type); f ; f = TREE_CHAIN (f))
5030 if (TREE_CODE (f) == FIELD_DECL)
5032 t = count_type_elements (TREE_TYPE (f), false);
5035 /* Check for structures with flexible array member. */
5036 tree tf = TREE_TYPE (f);
5038 && TREE_CHAIN (f) == NULL
5039 && TREE_CODE (tf) == ARRAY_TYPE
5041 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf))
5042 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf)))
5043 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf))
5044 && int_size_in_bytes (type) >= 0)
5056 case QUAL_UNION_TYPE:
5063 return TYPE_VECTOR_SUBPARTS (type);
5067 case FIXED_POINT_TYPE:
5072 case REFERENCE_TYPE:
5087 /* Return 1 if EXP contains mostly (3/4) zeros. */
5090 mostly_zeros_p (const_tree exp)
5092 if (TREE_CODE (exp) == CONSTRUCTOR)
5095 HOST_WIDE_INT nz_elts, count, elts;
5098 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5102 elts = count_type_elements (TREE_TYPE (exp), false);
5104 return nz_elts < elts / 4;
5107 return initializer_zerop (exp);
5110 /* Return 1 if EXP contains all zeros. */
5113 all_zeros_p (const_tree exp)
5115 if (TREE_CODE (exp) == CONSTRUCTOR)
5118 HOST_WIDE_INT nz_elts, count;
5121 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5122 return nz_elts == 0;
5125 return initializer_zerop (exp);
5128 /* Helper function for store_constructor.
5129 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5130 TYPE is the type of the CONSTRUCTOR, not the element type.
5131 CLEARED is as for store_constructor.
5132 ALIAS_SET is the alias set to use for any stores.
5134 This provides a recursive shortcut back to store_constructor when it isn't
5135 necessary to go through store_field. This is so that we can pass through
5136 the cleared field to let store_constructor know that we may not have to
5137 clear a substructure if the outer structure has already been cleared. */
5140 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
5141 HOST_WIDE_INT bitpos, enum machine_mode mode,
5142 tree exp, tree type, int cleared,
5143 alias_set_type alias_set)
5145 if (TREE_CODE (exp) == CONSTRUCTOR
5146 /* We can only call store_constructor recursively if the size and
5147 bit position are on a byte boundary. */
5148 && bitpos % BITS_PER_UNIT == 0
5149 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
5150 /* If we have a nonzero bitpos for a register target, then we just
5151 let store_field do the bitfield handling. This is unlikely to
5152 generate unnecessary clear instructions anyways. */
5153 && (bitpos == 0 || MEM_P (target)))
5157 = adjust_address (target,
5158 GET_MODE (target) == BLKmode
5160 % GET_MODE_ALIGNMENT (GET_MODE (target)))
5161 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
5164 /* Update the alias set, if required. */
5165 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
5166 && MEM_ALIAS_SET (target) != 0)
5168 target = copy_rtx (target);
5169 set_mem_alias_set (target, alias_set);
5172 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
5175 store_field (target, bitsize, bitpos, mode, exp, type, alias_set, false);
5178 /* Store the value of constructor EXP into the rtx TARGET.
5179 TARGET is either a REG or a MEM; we know it cannot conflict, since
5180 safe_from_p has been called.
5181 CLEARED is true if TARGET is known to have been zero'd.
5182 SIZE is the number of bytes of TARGET we are allowed to modify: this
5183 may not be the same as the size of EXP if we are assigning to a field
5184 which has been packed to exclude padding bits. */
5187 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
5189 tree type = TREE_TYPE (exp);
5190 #ifdef WORD_REGISTER_OPERATIONS
5191 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
5194 switch (TREE_CODE (type))
5198 case QUAL_UNION_TYPE:
5200 unsigned HOST_WIDE_INT idx;
5203 /* If size is zero or the target is already cleared, do nothing. */
5204 if (size == 0 || cleared)
5206 /* We either clear the aggregate or indicate the value is dead. */
5207 else if ((TREE_CODE (type) == UNION_TYPE
5208 || TREE_CODE (type) == QUAL_UNION_TYPE)
5209 && ! CONSTRUCTOR_ELTS (exp))
5210 /* If the constructor is empty, clear the union. */
5212 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
5216 /* If we are building a static constructor into a register,
5217 set the initial value as zero so we can fold the value into
5218 a constant. But if more than one register is involved,
5219 this probably loses. */
5220 else if (REG_P (target) && TREE_STATIC (exp)
5221 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
5223 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5227 /* If the constructor has fewer fields than the structure or
5228 if we are initializing the structure to mostly zeros, clear
5229 the whole structure first. Don't do this if TARGET is a
5230 register whose mode size isn't equal to SIZE since
5231 clear_storage can't handle this case. */
5233 && (((int)VEC_length (constructor_elt, CONSTRUCTOR_ELTS (exp))
5234 != fields_length (type))
5235 || mostly_zeros_p (exp))
5237 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
5240 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5244 if (REG_P (target) && !cleared)
5245 emit_clobber (target);
5247 /* Store each element of the constructor into the
5248 corresponding field of TARGET. */
5249 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, field, value)
5251 enum machine_mode mode;
5252 HOST_WIDE_INT bitsize;
5253 HOST_WIDE_INT bitpos = 0;
5255 rtx to_rtx = target;
5257 /* Just ignore missing fields. We cleared the whole
5258 structure, above, if any fields are missing. */
5262 if (cleared && initializer_zerop (value))
5265 if (host_integerp (DECL_SIZE (field), 1))
5266 bitsize = tree_low_cst (DECL_SIZE (field), 1);
5270 mode = DECL_MODE (field);
5271 if (DECL_BIT_FIELD (field))
5274 offset = DECL_FIELD_OFFSET (field);
5275 if (host_integerp (offset, 0)
5276 && host_integerp (bit_position (field), 0))
5278 bitpos = int_bit_position (field);
5282 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
5286 enum machine_mode address_mode;
5290 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
5291 make_tree (TREE_TYPE (exp),
5294 offset_rtx = expand_normal (offset);
5295 gcc_assert (MEM_P (to_rtx));
5298 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
5299 if (GET_MODE (offset_rtx) != address_mode)
5300 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
5302 to_rtx = offset_address (to_rtx, offset_rtx,
5303 highest_pow2_factor (offset));
5306 #ifdef WORD_REGISTER_OPERATIONS
5307 /* If this initializes a field that is smaller than a
5308 word, at the start of a word, try to widen it to a full
5309 word. This special case allows us to output C++ member
5310 function initializations in a form that the optimizers
5313 && bitsize < BITS_PER_WORD
5314 && bitpos % BITS_PER_WORD == 0
5315 && GET_MODE_CLASS (mode) == MODE_INT
5316 && TREE_CODE (value) == INTEGER_CST
5318 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5320 tree type = TREE_TYPE (value);
5322 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5324 type = lang_hooks.types.type_for_size
5325 (BITS_PER_WORD, TYPE_UNSIGNED (type));
5326 value = fold_convert (type, value);
5329 if (BYTES_BIG_ENDIAN)
5331 = fold_build2 (LSHIFT_EXPR, type, value,
5332 build_int_cst (type,
5333 BITS_PER_WORD - bitsize));
5334 bitsize = BITS_PER_WORD;
5339 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5340 && DECL_NONADDRESSABLE_P (field))
5342 to_rtx = copy_rtx (to_rtx);
5343 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5346 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5347 value, type, cleared,
5348 get_alias_set (TREE_TYPE (field)));
5355 unsigned HOST_WIDE_INT i;
5358 tree elttype = TREE_TYPE (type);
5360 HOST_WIDE_INT minelt = 0;
5361 HOST_WIDE_INT maxelt = 0;
5363 domain = TYPE_DOMAIN (type);
5364 const_bounds_p = (TYPE_MIN_VALUE (domain)
5365 && TYPE_MAX_VALUE (domain)
5366 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5367 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5369 /* If we have constant bounds for the range of the type, get them. */
5372 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5373 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5376 /* If the constructor has fewer elements than the array, clear
5377 the whole array first. Similarly if this is static
5378 constructor of a non-BLKmode object. */
5381 else if (REG_P (target) && TREE_STATIC (exp))
5385 unsigned HOST_WIDE_INT idx;
5387 HOST_WIDE_INT count = 0, zero_count = 0;
5388 need_to_clear = ! const_bounds_p;
5390 /* This loop is a more accurate version of the loop in
5391 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5392 is also needed to check for missing elements. */
5393 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, index, value)
5395 HOST_WIDE_INT this_node_count;
5400 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5402 tree lo_index = TREE_OPERAND (index, 0);
5403 tree hi_index = TREE_OPERAND (index, 1);
5405 if (! host_integerp (lo_index, 1)
5406 || ! host_integerp (hi_index, 1))
5412 this_node_count = (tree_low_cst (hi_index, 1)
5413 - tree_low_cst (lo_index, 1) + 1);
5416 this_node_count = 1;
5418 count += this_node_count;
5419 if (mostly_zeros_p (value))
5420 zero_count += this_node_count;
5423 /* Clear the entire array first if there are any missing
5424 elements, or if the incidence of zero elements is >=
5427 && (count < maxelt - minelt + 1
5428 || 4 * zero_count >= 3 * count))
5432 if (need_to_clear && size > 0)
5435 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5437 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5441 if (!cleared && REG_P (target))
5442 /* Inform later passes that the old value is dead. */
5443 emit_clobber (target);
5445 /* Store each element of the constructor into the
5446 corresponding element of TARGET, determined by counting the
5448 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), i, index, value)
5450 enum machine_mode mode;
5451 HOST_WIDE_INT bitsize;
5452 HOST_WIDE_INT bitpos;
5453 rtx xtarget = target;
5455 if (cleared && initializer_zerop (value))
5458 mode = TYPE_MODE (elttype);
5459 if (mode == BLKmode)
5460 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
5461 ? tree_low_cst (TYPE_SIZE (elttype), 1)
5464 bitsize = GET_MODE_BITSIZE (mode);
5466 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5468 tree lo_index = TREE_OPERAND (index, 0);
5469 tree hi_index = TREE_OPERAND (index, 1);
5470 rtx index_r, pos_rtx;
5471 HOST_WIDE_INT lo, hi, count;
5474 /* If the range is constant and "small", unroll the loop. */
5476 && host_integerp (lo_index, 0)
5477 && host_integerp (hi_index, 0)
5478 && (lo = tree_low_cst (lo_index, 0),
5479 hi = tree_low_cst (hi_index, 0),
5480 count = hi - lo + 1,
5483 || (host_integerp (TYPE_SIZE (elttype), 1)
5484 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
5487 lo -= minelt; hi -= minelt;
5488 for (; lo <= hi; lo++)
5490 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
5493 && !MEM_KEEP_ALIAS_SET_P (target)
5494 && TREE_CODE (type) == ARRAY_TYPE
5495 && TYPE_NONALIASED_COMPONENT (type))
5497 target = copy_rtx (target);
5498 MEM_KEEP_ALIAS_SET_P (target) = 1;
5501 store_constructor_field
5502 (target, bitsize, bitpos, mode, value, type, cleared,
5503 get_alias_set (elttype));
5508 rtx loop_start = gen_label_rtx ();
5509 rtx loop_end = gen_label_rtx ();
5512 expand_normal (hi_index);
5514 index = build_decl (EXPR_LOCATION (exp),
5515 VAR_DECL, NULL_TREE, domain);
5516 index_r = gen_reg_rtx (promote_decl_mode (index, NULL));
5517 SET_DECL_RTL (index, index_r);
5518 store_expr (lo_index, index_r, 0, false);
5520 /* Build the head of the loop. */
5521 do_pending_stack_adjust ();
5522 emit_label (loop_start);
5524 /* Assign value to element index. */
5526 fold_convert (ssizetype,
5527 fold_build2 (MINUS_EXPR,
5530 TYPE_MIN_VALUE (domain)));
5533 size_binop (MULT_EXPR, position,
5534 fold_convert (ssizetype,
5535 TYPE_SIZE_UNIT (elttype)));
5537 pos_rtx = expand_normal (position);
5538 xtarget = offset_address (target, pos_rtx,
5539 highest_pow2_factor (position));
5540 xtarget = adjust_address (xtarget, mode, 0);
5541 if (TREE_CODE (value) == CONSTRUCTOR)
5542 store_constructor (value, xtarget, cleared,
5543 bitsize / BITS_PER_UNIT);
5545 store_expr (value, xtarget, 0, false);
5547 /* Generate a conditional jump to exit the loop. */
5548 exit_cond = build2 (LT_EXPR, integer_type_node,
5550 jumpif (exit_cond, loop_end);
5552 /* Update the loop counter, and jump to the head of
5554 expand_assignment (index,
5555 build2 (PLUS_EXPR, TREE_TYPE (index),
5556 index, integer_one_node),
5559 emit_jump (loop_start);
5561 /* Build the end of the loop. */
5562 emit_label (loop_end);
5565 else if ((index != 0 && ! host_integerp (index, 0))
5566 || ! host_integerp (TYPE_SIZE (elttype), 1))
5571 index = ssize_int (1);
5574 index = fold_convert (ssizetype,
5575 fold_build2 (MINUS_EXPR,
5578 TYPE_MIN_VALUE (domain)));
5581 size_binop (MULT_EXPR, index,
5582 fold_convert (ssizetype,
5583 TYPE_SIZE_UNIT (elttype)));
5584 xtarget = offset_address (target,
5585 expand_normal (position),
5586 highest_pow2_factor (position));
5587 xtarget = adjust_address (xtarget, mode, 0);
5588 store_expr (value, xtarget, 0, false);
5593 bitpos = ((tree_low_cst (index, 0) - minelt)
5594 * tree_low_cst (TYPE_SIZE (elttype), 1));
5596 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5598 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5599 && TREE_CODE (type) == ARRAY_TYPE
5600 && TYPE_NONALIASED_COMPONENT (type))
5602 target = copy_rtx (target);
5603 MEM_KEEP_ALIAS_SET_P (target) = 1;
5605 store_constructor_field (target, bitsize, bitpos, mode, value,
5606 type, cleared, get_alias_set (elttype));
5614 unsigned HOST_WIDE_INT idx;
5615 constructor_elt *ce;
5619 tree elttype = TREE_TYPE (type);
5620 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5621 enum machine_mode eltmode = TYPE_MODE (elttype);
5622 HOST_WIDE_INT bitsize;
5623 HOST_WIDE_INT bitpos;
5624 rtvec vector = NULL;
5626 alias_set_type alias;
5628 gcc_assert (eltmode != BLKmode);
5630 n_elts = TYPE_VECTOR_SUBPARTS (type);
5631 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5633 enum machine_mode mode = GET_MODE (target);
5635 icode = (int) optab_handler (vec_init_optab, mode)->insn_code;
5636 if (icode != CODE_FOR_nothing)
5640 vector = rtvec_alloc (n_elts);
5641 for (i = 0; i < n_elts; i++)
5642 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5646 /* If the constructor has fewer elements than the vector,
5647 clear the whole array first. Similarly if this is static
5648 constructor of a non-BLKmode object. */
5651 else if (REG_P (target) && TREE_STATIC (exp))
5655 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5658 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
5660 int n_elts_here = tree_low_cst
5661 (int_const_binop (TRUNC_DIV_EXPR,
5662 TYPE_SIZE (TREE_TYPE (value)),
5663 TYPE_SIZE (elttype), 0), 1);
5665 count += n_elts_here;
5666 if (mostly_zeros_p (value))
5667 zero_count += n_elts_here;
5670 /* Clear the entire vector first if there are any missing elements,
5671 or if the incidence of zero elements is >= 75%. */
5672 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5675 if (need_to_clear && size > 0 && !vector)
5678 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5680 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5684 /* Inform later passes that the old value is dead. */
5685 if (!cleared && !vector && REG_P (target))
5686 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5689 alias = MEM_ALIAS_SET (target);
5691 alias = get_alias_set (elttype);
5693 /* Store each element of the constructor into the corresponding
5694 element of TARGET, determined by counting the elements. */
5695 for (idx = 0, i = 0;
5696 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
5697 idx++, i += bitsize / elt_size)
5699 HOST_WIDE_INT eltpos;
5700 tree value = ce->value;
5702 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5703 if (cleared && initializer_zerop (value))
5707 eltpos = tree_low_cst (ce->index, 1);
5713 /* Vector CONSTRUCTORs should only be built from smaller
5714 vectors in the case of BLKmode vectors. */
5715 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5716 RTVEC_ELT (vector, eltpos)
5717 = expand_normal (value);
5721 enum machine_mode value_mode =
5722 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5723 ? TYPE_MODE (TREE_TYPE (value))
5725 bitpos = eltpos * elt_size;
5726 store_constructor_field (target, bitsize, bitpos,
5727 value_mode, value, type,
5733 emit_insn (GEN_FCN (icode)
5735 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5744 /* Store the value of EXP (an expression tree)
5745 into a subfield of TARGET which has mode MODE and occupies
5746 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5747 If MODE is VOIDmode, it means that we are storing into a bit-field.
5749 Always return const0_rtx unless we have something particular to
5752 TYPE is the type of the underlying object,
5754 ALIAS_SET is the alias set for the destination. This value will
5755 (in general) be different from that for TARGET, since TARGET is a
5756 reference to the containing structure.
5758 If NONTEMPORAL is true, try generating a nontemporal store. */
5761 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5762 enum machine_mode mode, tree exp, tree type,
5763 alias_set_type alias_set, bool nontemporal)
5765 if (TREE_CODE (exp) == ERROR_MARK)
5768 /* If we have nothing to store, do nothing unless the expression has
5771 return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5773 /* If we are storing into an unaligned field of an aligned union that is
5774 in a register, we may have the mode of TARGET being an integer mode but
5775 MODE == BLKmode. In that case, get an aligned object whose size and
5776 alignment are the same as TARGET and store TARGET into it (we can avoid
5777 the store if the field being stored is the entire width of TARGET). Then
5778 call ourselves recursively to store the field into a BLKmode version of
5779 that object. Finally, load from the object into TARGET. This is not
5780 very efficient in general, but should only be slightly more expensive
5781 than the otherwise-required unaligned accesses. Perhaps this can be
5782 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5783 twice, once with emit_move_insn and once via store_field. */
5786 && (REG_P (target) || GET_CODE (target) == SUBREG))
5788 rtx object = assign_temp (type, 0, 1, 1);
5789 rtx blk_object = adjust_address (object, BLKmode, 0);
5791 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5792 emit_move_insn (object, target);
5794 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set,
5797 emit_move_insn (target, object);
5799 /* We want to return the BLKmode version of the data. */
5803 if (GET_CODE (target) == CONCAT)
5805 /* We're storing into a struct containing a single __complex. */
5807 gcc_assert (!bitpos);
5808 return store_expr (exp, target, 0, nontemporal);
5811 /* If the structure is in a register or if the component
5812 is a bit field, we cannot use addressing to access it.
5813 Use bit-field techniques or SUBREG to store in it. */
5815 if (mode == VOIDmode
5816 || (mode != BLKmode && ! direct_store[(int) mode]
5817 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5818 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5820 || GET_CODE (target) == SUBREG
5821 /* If the field isn't aligned enough to store as an ordinary memref,
5822 store it as a bit field. */
5824 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5825 || bitpos % GET_MODE_ALIGNMENT (mode))
5826 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5827 || (bitpos % BITS_PER_UNIT != 0)))
5828 /* If the RHS and field are a constant size and the size of the
5829 RHS isn't the same size as the bitfield, we must use bitfield
5832 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5833 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5838 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5839 implies a mask operation. If the precision is the same size as
5840 the field we're storing into, that mask is redundant. This is
5841 particularly common with bit field assignments generated by the
5843 nop_def = get_def_for_expr (exp, NOP_EXPR);
5846 tree type = TREE_TYPE (exp);
5847 if (INTEGRAL_TYPE_P (type)
5848 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
5849 && bitsize == TYPE_PRECISION (type))
5851 tree op = gimple_assign_rhs1 (nop_def);
5852 type = TREE_TYPE (op);
5853 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
5858 temp = expand_normal (exp);
5860 /* If BITSIZE is narrower than the size of the type of EXP
5861 we will be narrowing TEMP. Normally, what's wanted are the
5862 low-order bits. However, if EXP's type is a record and this is
5863 big-endian machine, we want the upper BITSIZE bits. */
5864 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5865 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5866 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5867 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5868 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5872 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5874 if (mode != VOIDmode && mode != BLKmode
5875 && mode != TYPE_MODE (TREE_TYPE (exp)))
5876 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5878 /* If the modes of TEMP and TARGET are both BLKmode, both
5879 must be in memory and BITPOS must be aligned on a byte
5880 boundary. If so, we simply do a block copy. Likewise
5881 for a BLKmode-like TARGET. */
5882 if (GET_MODE (temp) == BLKmode
5883 && (GET_MODE (target) == BLKmode
5885 && GET_MODE_CLASS (GET_MODE (target)) == MODE_INT
5886 && (bitpos % BITS_PER_UNIT) == 0
5887 && (bitsize % BITS_PER_UNIT) == 0)))
5889 gcc_assert (MEM_P (target) && MEM_P (temp)
5890 && (bitpos % BITS_PER_UNIT) == 0);
5892 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5893 emit_block_move (target, temp,
5894 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5901 /* Store the value in the bitfield. */
5902 store_bit_field (target, bitsize, bitpos, mode, temp);
5908 /* Now build a reference to just the desired component. */
5909 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5911 if (to_rtx == target)
5912 to_rtx = copy_rtx (to_rtx);
5914 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5915 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5916 set_mem_alias_set (to_rtx, alias_set);
5918 return store_expr (exp, to_rtx, 0, nontemporal);
5922 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5923 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5924 codes and find the ultimate containing object, which we return.
5926 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5927 bit position, and *PUNSIGNEDP to the signedness of the field.
5928 If the position of the field is variable, we store a tree
5929 giving the variable offset (in units) in *POFFSET.
5930 This offset is in addition to the bit position.
5931 If the position is not variable, we store 0 in *POFFSET.
5933 If any of the extraction expressions is volatile,
5934 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5936 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
5937 Otherwise, it is a mode that can be used to access the field.
5939 If the field describes a variable-sized object, *PMODE is set to
5940 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
5941 this case, but the address of the object can be found.
5943 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5944 look through nodes that serve as markers of a greater alignment than
5945 the one that can be deduced from the expression. These nodes make it
5946 possible for front-ends to prevent temporaries from being created by
5947 the middle-end on alignment considerations. For that purpose, the
5948 normal operating mode at high-level is to always pass FALSE so that
5949 the ultimate containing object is really returned; moreover, the
5950 associated predicate handled_component_p will always return TRUE
5951 on these nodes, thus indicating that they are essentially handled
5952 by get_inner_reference. TRUE should only be passed when the caller
5953 is scanning the expression in order to build another representation
5954 and specifically knows how to handle these nodes; as such, this is
5955 the normal operating mode in the RTL expanders. */
5958 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
5959 HOST_WIDE_INT *pbitpos, tree *poffset,
5960 enum machine_mode *pmode, int *punsignedp,
5961 int *pvolatilep, bool keep_aligning)
5964 enum machine_mode mode = VOIDmode;
5965 bool blkmode_bitfield = false;
5966 tree offset = size_zero_node;
5967 tree bit_offset = bitsize_zero_node;
5969 /* First get the mode, signedness, and size. We do this from just the
5970 outermost expression. */
5971 if (TREE_CODE (exp) == COMPONENT_REF)
5973 tree field = TREE_OPERAND (exp, 1);
5974 size_tree = DECL_SIZE (field);
5975 if (!DECL_BIT_FIELD (field))
5976 mode = DECL_MODE (field);
5977 else if (DECL_MODE (field) == BLKmode)
5978 blkmode_bitfield = true;
5980 *punsignedp = DECL_UNSIGNED (field);
5982 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5984 size_tree = TREE_OPERAND (exp, 1);
5985 *punsignedp = (! INTEGRAL_TYPE_P (TREE_TYPE (exp))
5986 || TYPE_UNSIGNED (TREE_TYPE (exp)));
5988 /* For vector types, with the correct size of access, use the mode of
5990 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == VECTOR_TYPE
5991 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))
5992 && tree_int_cst_equal (size_tree, TYPE_SIZE (TREE_TYPE (exp))))
5993 mode = TYPE_MODE (TREE_TYPE (exp));
5997 mode = TYPE_MODE (TREE_TYPE (exp));
5998 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
6000 if (mode == BLKmode)
6001 size_tree = TYPE_SIZE (TREE_TYPE (exp));
6003 *pbitsize = GET_MODE_BITSIZE (mode);
6008 if (! host_integerp (size_tree, 1))
6009 mode = BLKmode, *pbitsize = -1;
6011 *pbitsize = tree_low_cst (size_tree, 1);
6014 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6015 and find the ultimate containing object. */
6018 switch (TREE_CODE (exp))
6021 bit_offset = size_binop (PLUS_EXPR, bit_offset,
6022 TREE_OPERAND (exp, 2));
6027 tree field = TREE_OPERAND (exp, 1);
6028 tree this_offset = component_ref_field_offset (exp);
6030 /* If this field hasn't been filled in yet, don't go past it.
6031 This should only happen when folding expressions made during
6032 type construction. */
6033 if (this_offset == 0)
6036 offset = size_binop (PLUS_EXPR, offset, this_offset);
6037 bit_offset = size_binop (PLUS_EXPR, bit_offset,
6038 DECL_FIELD_BIT_OFFSET (field));
6040 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6045 case ARRAY_RANGE_REF:
6047 tree index = TREE_OPERAND (exp, 1);
6048 tree low_bound = array_ref_low_bound (exp);
6049 tree unit_size = array_ref_element_size (exp);
6051 /* We assume all arrays have sizes that are a multiple of a byte.
6052 First subtract the lower bound, if any, in the type of the
6053 index, then convert to sizetype and multiply by the size of
6054 the array element. */
6055 if (! integer_zerop (low_bound))
6056 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
6059 offset = size_binop (PLUS_EXPR, offset,
6060 size_binop (MULT_EXPR,
6061 fold_convert (sizetype, index),
6070 bit_offset = size_binop (PLUS_EXPR, bit_offset,
6071 bitsize_int (*pbitsize));
6074 case VIEW_CONVERT_EXPR:
6075 if (keep_aligning && STRICT_ALIGNMENT
6076 && (TYPE_ALIGN (TREE_TYPE (exp))
6077 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
6078 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
6079 < BIGGEST_ALIGNMENT)
6080 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
6081 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
6089 /* If any reference in the chain is volatile, the effect is volatile. */
6090 if (TREE_THIS_VOLATILE (exp))
6093 exp = TREE_OPERAND (exp, 0);
6097 /* If OFFSET is constant, see if we can return the whole thing as a
6098 constant bit position. Make sure to handle overflow during
6100 if (host_integerp (offset, 0))
6102 double_int tem = double_int_mul (tree_to_double_int (offset),
6103 uhwi_to_double_int (BITS_PER_UNIT));
6104 tem = double_int_add (tem, tree_to_double_int (bit_offset));
6105 if (double_int_fits_in_shwi_p (tem))
6107 *pbitpos = double_int_to_shwi (tem);
6108 *poffset = offset = NULL_TREE;
6112 /* Otherwise, split it up. */
6115 *pbitpos = tree_low_cst (bit_offset, 0);
6119 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6120 if (mode == VOIDmode
6122 && (*pbitpos % BITS_PER_UNIT) == 0
6123 && (*pbitsize % BITS_PER_UNIT) == 0)
6131 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
6132 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
6133 EXP is marked as PACKED. */
6136 contains_packed_reference (const_tree exp)
6138 bool packed_p = false;
6142 switch (TREE_CODE (exp))
6146 tree field = TREE_OPERAND (exp, 1);
6147 packed_p = DECL_PACKED (field)
6148 || TYPE_PACKED (TREE_TYPE (field))
6149 || TYPE_PACKED (TREE_TYPE (exp));
6157 case ARRAY_RANGE_REF:
6160 case VIEW_CONVERT_EXPR:
6166 exp = TREE_OPERAND (exp, 0);
6172 /* Return a tree of sizetype representing the size, in bytes, of the element
6173 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6176 array_ref_element_size (tree exp)
6178 tree aligned_size = TREE_OPERAND (exp, 3);
6179 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6180 location_t loc = EXPR_LOCATION (exp);
6182 /* If a size was specified in the ARRAY_REF, it's the size measured
6183 in alignment units of the element type. So multiply by that value. */
6186 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6187 sizetype from another type of the same width and signedness. */
6188 if (TREE_TYPE (aligned_size) != sizetype)
6189 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
6190 return size_binop_loc (loc, MULT_EXPR, aligned_size,
6191 size_int (TYPE_ALIGN_UNIT (elmt_type)));
6194 /* Otherwise, take the size from that of the element type. Substitute
6195 any PLACEHOLDER_EXPR that we have. */
6197 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
6200 /* Return a tree representing the lower bound of the array mentioned in
6201 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6204 array_ref_low_bound (tree exp)
6206 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6208 /* If a lower bound is specified in EXP, use it. */
6209 if (TREE_OPERAND (exp, 2))
6210 return TREE_OPERAND (exp, 2);
6212 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6213 substituting for a PLACEHOLDER_EXPR as needed. */
6214 if (domain_type && TYPE_MIN_VALUE (domain_type))
6215 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
6217 /* Otherwise, return a zero of the appropriate type. */
6218 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
6221 /* Return a tree representing the upper bound of the array mentioned in
6222 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6225 array_ref_up_bound (tree exp)
6227 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6229 /* If there is a domain type and it has an upper bound, use it, substituting
6230 for a PLACEHOLDER_EXPR as needed. */
6231 if (domain_type && TYPE_MAX_VALUE (domain_type))
6232 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
6234 /* Otherwise fail. */
6238 /* Return a tree representing the offset, in bytes, of the field referenced
6239 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6242 component_ref_field_offset (tree exp)
6244 tree aligned_offset = TREE_OPERAND (exp, 2);
6245 tree field = TREE_OPERAND (exp, 1);
6246 location_t loc = EXPR_LOCATION (exp);
6248 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6249 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6253 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6254 sizetype from another type of the same width and signedness. */
6255 if (TREE_TYPE (aligned_offset) != sizetype)
6256 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
6257 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
6258 size_int (DECL_OFFSET_ALIGN (field)
6262 /* Otherwise, take the offset from that of the field. Substitute
6263 any PLACEHOLDER_EXPR that we have. */
6265 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
6268 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6270 static unsigned HOST_WIDE_INT
6271 target_align (const_tree target)
6273 /* We might have a chain of nested references with intermediate misaligning
6274 bitfields components, so need to recurse to find out. */
6276 unsigned HOST_WIDE_INT this_align, outer_align;
6278 switch (TREE_CODE (target))
6284 this_align = DECL_ALIGN (TREE_OPERAND (target, 1));
6285 outer_align = target_align (TREE_OPERAND (target, 0));
6286 return MIN (this_align, outer_align);
6289 case ARRAY_RANGE_REF:
6290 this_align = TYPE_ALIGN (TREE_TYPE (target));
6291 outer_align = target_align (TREE_OPERAND (target, 0));
6292 return MIN (this_align, outer_align);
6295 case NON_LVALUE_EXPR:
6296 case VIEW_CONVERT_EXPR:
6297 this_align = TYPE_ALIGN (TREE_TYPE (target));
6298 outer_align = target_align (TREE_OPERAND (target, 0));
6299 return MAX (this_align, outer_align);
6302 return TYPE_ALIGN (TREE_TYPE (target));
6307 /* Given an rtx VALUE that may contain additions and multiplications, return
6308 an equivalent value that just refers to a register, memory, or constant.
6309 This is done by generating instructions to perform the arithmetic and
6310 returning a pseudo-register containing the value.
6312 The returned value may be a REG, SUBREG, MEM or constant. */
6315 force_operand (rtx value, rtx target)
6318 /* Use subtarget as the target for operand 0 of a binary operation. */
6319 rtx subtarget = get_subtarget (target);
6320 enum rtx_code code = GET_CODE (value);
6322 /* Check for subreg applied to an expression produced by loop optimizer. */
6324 && !REG_P (SUBREG_REG (value))
6325 && !MEM_P (SUBREG_REG (value)))
6328 = simplify_gen_subreg (GET_MODE (value),
6329 force_reg (GET_MODE (SUBREG_REG (value)),
6330 force_operand (SUBREG_REG (value),
6332 GET_MODE (SUBREG_REG (value)),
6333 SUBREG_BYTE (value));
6334 code = GET_CODE (value);
6337 /* Check for a PIC address load. */
6338 if ((code == PLUS || code == MINUS)
6339 && XEXP (value, 0) == pic_offset_table_rtx
6340 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
6341 || GET_CODE (XEXP (value, 1)) == LABEL_REF
6342 || GET_CODE (XEXP (value, 1)) == CONST))
6345 subtarget = gen_reg_rtx (GET_MODE (value));
6346 emit_move_insn (subtarget, value);
6350 if (ARITHMETIC_P (value))
6352 op2 = XEXP (value, 1);
6353 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
6355 if (code == MINUS && CONST_INT_P (op2))
6358 op2 = negate_rtx (GET_MODE (value), op2);
6361 /* Check for an addition with OP2 a constant integer and our first
6362 operand a PLUS of a virtual register and something else. In that
6363 case, we want to emit the sum of the virtual register and the
6364 constant first and then add the other value. This allows virtual
6365 register instantiation to simply modify the constant rather than
6366 creating another one around this addition. */
6367 if (code == PLUS && CONST_INT_P (op2)
6368 && GET_CODE (XEXP (value, 0)) == PLUS
6369 && REG_P (XEXP (XEXP (value, 0), 0))
6370 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6371 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
6373 rtx temp = expand_simple_binop (GET_MODE (value), code,
6374 XEXP (XEXP (value, 0), 0), op2,
6375 subtarget, 0, OPTAB_LIB_WIDEN);
6376 return expand_simple_binop (GET_MODE (value), code, temp,
6377 force_operand (XEXP (XEXP (value,
6379 target, 0, OPTAB_LIB_WIDEN);
6382 op1 = force_operand (XEXP (value, 0), subtarget);
6383 op2 = force_operand (op2, NULL_RTX);
6387 return expand_mult (GET_MODE (value), op1, op2, target, 1);
6389 if (!INTEGRAL_MODE_P (GET_MODE (value)))
6390 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6391 target, 1, OPTAB_LIB_WIDEN);
6393 return expand_divmod (0,
6394 FLOAT_MODE_P (GET_MODE (value))
6395 ? RDIV_EXPR : TRUNC_DIV_EXPR,
6396 GET_MODE (value), op1, op2, target, 0);
6398 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6401 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
6404 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6407 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6408 target, 0, OPTAB_LIB_WIDEN);
6410 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6411 target, 1, OPTAB_LIB_WIDEN);
6414 if (UNARY_P (value))
6417 target = gen_reg_rtx (GET_MODE (value));
6418 op1 = force_operand (XEXP (value, 0), NULL_RTX);
6425 case FLOAT_TRUNCATE:
6426 convert_move (target, op1, code == ZERO_EXTEND);
6431 expand_fix (target, op1, code == UNSIGNED_FIX);
6435 case UNSIGNED_FLOAT:
6436 expand_float (target, op1, code == UNSIGNED_FLOAT);
6440 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
6444 #ifdef INSN_SCHEDULING
6445 /* On machines that have insn scheduling, we want all memory reference to be
6446 explicit, so we need to deal with such paradoxical SUBREGs. */
6447 if (GET_CODE (value) == SUBREG && MEM_P (SUBREG_REG (value))
6448 && (GET_MODE_SIZE (GET_MODE (value))
6449 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
6451 = simplify_gen_subreg (GET_MODE (value),
6452 force_reg (GET_MODE (SUBREG_REG (value)),
6453 force_operand (SUBREG_REG (value),
6455 GET_MODE (SUBREG_REG (value)),
6456 SUBREG_BYTE (value));
6462 /* Subroutine of expand_expr: return nonzero iff there is no way that
6463 EXP can reference X, which is being modified. TOP_P is nonzero if this
6464 call is going to be used to determine whether we need a temporary
6465 for EXP, as opposed to a recursive call to this function.
6467 It is always safe for this routine to return zero since it merely
6468 searches for optimization opportunities. */
6471 safe_from_p (const_rtx x, tree exp, int top_p)
6477 /* If EXP has varying size, we MUST use a target since we currently
6478 have no way of allocating temporaries of variable size
6479 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6480 So we assume here that something at a higher level has prevented a
6481 clash. This is somewhat bogus, but the best we can do. Only
6482 do this when X is BLKmode and when we are at the top level. */
6483 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6484 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
6485 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
6486 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
6487 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
6489 && GET_MODE (x) == BLKmode)
6490 /* If X is in the outgoing argument area, it is always safe. */
6492 && (XEXP (x, 0) == virtual_outgoing_args_rtx
6493 || (GET_CODE (XEXP (x, 0)) == PLUS
6494 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
6497 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6498 find the underlying pseudo. */
6499 if (GET_CODE (x) == SUBREG)
6502 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6506 /* Now look at our tree code and possibly recurse. */
6507 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
6509 case tcc_declaration:
6510 exp_rtl = DECL_RTL_IF_SET (exp);
6516 case tcc_exceptional:
6517 if (TREE_CODE (exp) == TREE_LIST)
6521 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
6523 exp = TREE_CHAIN (exp);
6526 if (TREE_CODE (exp) != TREE_LIST)
6527 return safe_from_p (x, exp, 0);
6530 else if (TREE_CODE (exp) == CONSTRUCTOR)
6532 constructor_elt *ce;
6533 unsigned HOST_WIDE_INT idx;
6536 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
6538 if ((ce->index != NULL_TREE && !safe_from_p (x, ce->index, 0))
6539 || !safe_from_p (x, ce->value, 0))
6543 else if (TREE_CODE (exp) == ERROR_MARK)
6544 return 1; /* An already-visited SAVE_EXPR? */
6549 /* The only case we look at here is the DECL_INITIAL inside a
6551 return (TREE_CODE (exp) != DECL_EXPR
6552 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
6553 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
6554 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
6557 case tcc_comparison:
6558 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
6563 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6565 case tcc_expression:
6568 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6569 the expression. If it is set, we conflict iff we are that rtx or
6570 both are in memory. Otherwise, we check all operands of the
6571 expression recursively. */
6573 switch (TREE_CODE (exp))
6576 /* If the operand is static or we are static, we can't conflict.
6577 Likewise if we don't conflict with the operand at all. */
6578 if (staticp (TREE_OPERAND (exp, 0))
6579 || TREE_STATIC (exp)
6580 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
6583 /* Otherwise, the only way this can conflict is if we are taking
6584 the address of a DECL a that address if part of X, which is
6586 exp = TREE_OPERAND (exp, 0);
6589 if (!DECL_RTL_SET_P (exp)
6590 || !MEM_P (DECL_RTL (exp)))
6593 exp_rtl = XEXP (DECL_RTL (exp), 0);
6597 case MISALIGNED_INDIRECT_REF:
6598 case ALIGN_INDIRECT_REF:
6601 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
6602 get_alias_set (exp)))
6607 /* Assume that the call will clobber all hard registers and
6609 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6614 case WITH_CLEANUP_EXPR:
6615 case CLEANUP_POINT_EXPR:
6616 /* Lowered by gimplify.c. */
6620 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6626 /* If we have an rtx, we do not need to scan our operands. */
6630 nops = TREE_OPERAND_LENGTH (exp);
6631 for (i = 0; i < nops; i++)
6632 if (TREE_OPERAND (exp, i) != 0
6633 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
6639 /* Should never get a type here. */
6643 /* If we have an rtl, find any enclosed object. Then see if we conflict
6647 if (GET_CODE (exp_rtl) == SUBREG)
6649 exp_rtl = SUBREG_REG (exp_rtl);
6651 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
6655 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6656 are memory and they conflict. */
6657 return ! (rtx_equal_p (x, exp_rtl)
6658 || (MEM_P (x) && MEM_P (exp_rtl)
6659 && true_dependence (exp_rtl, VOIDmode, x,
6660 rtx_addr_varies_p)));
6663 /* If we reach here, it is safe. */
6668 /* Return the highest power of two that EXP is known to be a multiple of.
6669 This is used in updating alignment of MEMs in array references. */
6671 unsigned HOST_WIDE_INT
6672 highest_pow2_factor (const_tree exp)
6674 unsigned HOST_WIDE_INT c0, c1;
6676 switch (TREE_CODE (exp))
6679 /* We can find the lowest bit that's a one. If the low
6680 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6681 We need to handle this case since we can find it in a COND_EXPR,
6682 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
6683 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6685 if (TREE_OVERFLOW (exp))
6686 return BIGGEST_ALIGNMENT;
6689 /* Note: tree_low_cst is intentionally not used here,
6690 we don't care about the upper bits. */
6691 c0 = TREE_INT_CST_LOW (exp);
6693 return c0 ? c0 : BIGGEST_ALIGNMENT;
6697 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6698 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6699 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6700 return MIN (c0, c1);
6703 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6704 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6707 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6709 if (integer_pow2p (TREE_OPERAND (exp, 1))
6710 && host_integerp (TREE_OPERAND (exp, 1), 1))
6712 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6713 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6714 return MAX (1, c0 / c1);
6719 /* The highest power of two of a bit-and expression is the maximum of
6720 that of its operands. We typically get here for a complex LHS and
6721 a constant negative power of two on the RHS to force an explicit
6722 alignment, so don't bother looking at the LHS. */
6723 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6727 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6730 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6733 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6734 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6735 return MIN (c0, c1);
6744 /* Similar, except that the alignment requirements of TARGET are
6745 taken into account. Assume it is at least as aligned as its
6746 type, unless it is a COMPONENT_REF in which case the layout of
6747 the structure gives the alignment. */
6749 static unsigned HOST_WIDE_INT
6750 highest_pow2_factor_for_target (const_tree target, const_tree exp)
6752 unsigned HOST_WIDE_INT talign = target_align (target) / BITS_PER_UNIT;
6753 unsigned HOST_WIDE_INT factor = highest_pow2_factor (exp);
6755 return MAX (factor, talign);
6758 /* Return &VAR expression for emulated thread local VAR. */
6761 emutls_var_address (tree var)
6763 tree emuvar = emutls_decl (var);
6764 tree fn = built_in_decls [BUILT_IN_EMUTLS_GET_ADDRESS];
6765 tree arg = build_fold_addr_expr_with_type (emuvar, ptr_type_node);
6766 tree arglist = build_tree_list (NULL_TREE, arg);
6767 tree call = build_function_call_expr (UNKNOWN_LOCATION, fn, arglist);
6768 return fold_convert (build_pointer_type (TREE_TYPE (var)), call);
6772 /* Subroutine of expand_expr. Expand the two operands of a binary
6773 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6774 The value may be stored in TARGET if TARGET is nonzero. The
6775 MODIFIER argument is as documented by expand_expr. */
6778 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6779 enum expand_modifier modifier)
6781 if (! safe_from_p (target, exp1, 1))
6783 if (operand_equal_p (exp0, exp1, 0))
6785 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6786 *op1 = copy_rtx (*op0);
6790 /* If we need to preserve evaluation order, copy exp0 into its own
6791 temporary variable so that it can't be clobbered by exp1. */
6792 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6793 exp0 = save_expr (exp0);
6794 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6795 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6800 /* Return a MEM that contains constant EXP. DEFER is as for
6801 output_constant_def and MODIFIER is as for expand_expr. */
6804 expand_expr_constant (tree exp, int defer, enum expand_modifier modifier)
6808 mem = output_constant_def (exp, defer);
6809 if (modifier != EXPAND_INITIALIZER)
6810 mem = use_anchored_address (mem);
6814 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6815 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6818 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
6819 enum expand_modifier modifier, addr_space_t as)
6821 rtx result, subtarget;
6823 HOST_WIDE_INT bitsize, bitpos;
6824 int volatilep, unsignedp;
6825 enum machine_mode mode1;
6827 /* If we are taking the address of a constant and are at the top level,
6828 we have to use output_constant_def since we can't call force_const_mem
6830 /* ??? This should be considered a front-end bug. We should not be
6831 generating ADDR_EXPR of something that isn't an LVALUE. The only
6832 exception here is STRING_CST. */
6833 if (CONSTANT_CLASS_P (exp))
6834 return XEXP (expand_expr_constant (exp, 0, modifier), 0);
6836 /* Everything must be something allowed by is_gimple_addressable. */
6837 switch (TREE_CODE (exp))
6840 /* This case will happen via recursion for &a->b. */
6841 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6844 /* Expand the initializer like constants above. */
6845 return XEXP (expand_expr_constant (DECL_INITIAL (exp), 0, modifier), 0);
6848 /* The real part of the complex number is always first, therefore
6849 the address is the same as the address of the parent object. */
6852 inner = TREE_OPERAND (exp, 0);
6856 /* The imaginary part of the complex number is always second.
6857 The expression is therefore always offset by the size of the
6860 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
6861 inner = TREE_OPERAND (exp, 0);
6865 /* TLS emulation hook - replace __thread VAR's &VAR with
6866 __emutls_get_address (&_emutls.VAR). */
6867 if (! targetm.have_tls
6868 && TREE_CODE (exp) == VAR_DECL
6869 && DECL_THREAD_LOCAL_P (exp))
6871 exp = emutls_var_address (exp);
6872 return expand_expr (exp, target, tmode, modifier);
6877 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6878 expand_expr, as that can have various side effects; LABEL_DECLs for
6879 example, may not have their DECL_RTL set yet. Expand the rtl of
6880 CONSTRUCTORs too, which should yield a memory reference for the
6881 constructor's contents. Assume language specific tree nodes can
6882 be expanded in some interesting way. */
6883 gcc_assert (TREE_CODE (exp) < LAST_AND_UNUSED_TREE_CODE);
6885 || TREE_CODE (exp) == CONSTRUCTOR
6886 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
6888 result = expand_expr (exp, target, tmode,
6889 modifier == EXPAND_INITIALIZER
6890 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
6892 /* If the DECL isn't in memory, then the DECL wasn't properly
6893 marked TREE_ADDRESSABLE, which will be either a front-end
6894 or a tree optimizer bug. */
6895 gcc_assert (MEM_P (result));
6896 result = XEXP (result, 0);
6898 /* ??? Is this needed anymore? */
6899 if (DECL_P (exp) && !TREE_USED (exp) == 0)
6901 assemble_external (exp);
6902 TREE_USED (exp) = 1;
6905 if (modifier != EXPAND_INITIALIZER
6906 && modifier != EXPAND_CONST_ADDRESS)
6907 result = force_operand (result, target);
6911 /* Pass FALSE as the last argument to get_inner_reference although
6912 we are expanding to RTL. The rationale is that we know how to
6913 handle "aligning nodes" here: we can just bypass them because
6914 they won't change the final object whose address will be returned
6915 (they actually exist only for that purpose). */
6916 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6917 &mode1, &unsignedp, &volatilep, false);
6921 /* We must have made progress. */
6922 gcc_assert (inner != exp);
6924 subtarget = offset || bitpos ? NULL_RTX : target;
6925 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
6926 inner alignment, force the inner to be sufficiently aligned. */
6927 if (CONSTANT_CLASS_P (inner)
6928 && TYPE_ALIGN (TREE_TYPE (inner)) < TYPE_ALIGN (TREE_TYPE (exp)))
6930 inner = copy_node (inner);
6931 TREE_TYPE (inner) = copy_node (TREE_TYPE (inner));
6932 TYPE_ALIGN (TREE_TYPE (inner)) = TYPE_ALIGN (TREE_TYPE (exp));
6933 TYPE_USER_ALIGN (TREE_TYPE (inner)) = 1;
6935 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier, as);
6941 if (modifier != EXPAND_NORMAL)
6942 result = force_operand (result, NULL);
6943 tmp = expand_expr (offset, NULL_RTX, tmode,
6944 modifier == EXPAND_INITIALIZER
6945 ? EXPAND_INITIALIZER : EXPAND_NORMAL);
6947 result = convert_memory_address_addr_space (tmode, result, as);
6948 tmp = convert_memory_address_addr_space (tmode, tmp, as);
6950 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
6951 result = gen_rtx_PLUS (tmode, result, tmp);
6954 subtarget = bitpos ? NULL_RTX : target;
6955 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
6956 1, OPTAB_LIB_WIDEN);
6962 /* Someone beforehand should have rejected taking the address
6963 of such an object. */
6964 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
6966 result = plus_constant (result, bitpos / BITS_PER_UNIT);
6967 if (modifier < EXPAND_SUM)
6968 result = force_operand (result, target);
6974 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
6975 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6978 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
6979 enum expand_modifier modifier)
6981 addr_space_t as = ADDR_SPACE_GENERIC;
6982 enum machine_mode address_mode = Pmode;
6983 enum machine_mode pointer_mode = ptr_mode;
6984 enum machine_mode rmode;
6987 /* Target mode of VOIDmode says "whatever's natural". */
6988 if (tmode == VOIDmode)
6989 tmode = TYPE_MODE (TREE_TYPE (exp));
6991 if (POINTER_TYPE_P (TREE_TYPE (exp)))
6993 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
6994 address_mode = targetm.addr_space.address_mode (as);
6995 pointer_mode = targetm.addr_space.pointer_mode (as);
6998 /* We can get called with some Weird Things if the user does silliness
6999 like "(short) &a". In that case, convert_memory_address won't do
7000 the right thing, so ignore the given target mode. */
7001 if (tmode != address_mode && tmode != pointer_mode)
7002 tmode = address_mode;
7004 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
7005 tmode, modifier, as);
7007 /* Despite expand_expr claims concerning ignoring TMODE when not
7008 strictly convenient, stuff breaks if we don't honor it. Note
7009 that combined with the above, we only do this for pointer modes. */
7010 rmode = GET_MODE (result);
7011 if (rmode == VOIDmode)
7014 result = convert_memory_address_addr_space (tmode, result, as);
7019 /* Generate code for computing CONSTRUCTOR EXP.
7020 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7021 is TRUE, instead of creating a temporary variable in memory
7022 NULL is returned and the caller needs to handle it differently. */
7025 expand_constructor (tree exp, rtx target, enum expand_modifier modifier,
7026 bool avoid_temp_mem)
7028 tree type = TREE_TYPE (exp);
7029 enum machine_mode mode = TYPE_MODE (type);
7031 /* Try to avoid creating a temporary at all. This is possible
7032 if all of the initializer is zero.
7033 FIXME: try to handle all [0..255] initializers we can handle
7035 if (TREE_STATIC (exp)
7036 && !TREE_ADDRESSABLE (exp)
7037 && target != 0 && mode == BLKmode
7038 && all_zeros_p (exp))
7040 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
7044 /* All elts simple constants => refer to a constant in memory. But
7045 if this is a non-BLKmode mode, let it store a field at a time
7046 since that should make a CONST_INT or CONST_DOUBLE when we
7047 fold. Likewise, if we have a target we can use, it is best to
7048 store directly into the target unless the type is large enough
7049 that memcpy will be used. If we are making an initializer and
7050 all operands are constant, put it in memory as well.
7052 FIXME: Avoid trying to fill vector constructors piece-meal.
7053 Output them with output_constant_def below unless we're sure
7054 they're zeros. This should go away when vector initializers
7055 are treated like VECTOR_CST instead of arrays. */
7056 if ((TREE_STATIC (exp)
7057 && ((mode == BLKmode
7058 && ! (target != 0 && safe_from_p (target, exp, 1)))
7059 || TREE_ADDRESSABLE (exp)
7060 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7061 && (! MOVE_BY_PIECES_P
7062 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7064 && ! mostly_zeros_p (exp))))
7065 || ((modifier == EXPAND_INITIALIZER || modifier == EXPAND_CONST_ADDRESS)
7066 && TREE_CONSTANT (exp)))
7073 constructor = expand_expr_constant (exp, 1, modifier);
7075 if (modifier != EXPAND_CONST_ADDRESS
7076 && modifier != EXPAND_INITIALIZER
7077 && modifier != EXPAND_SUM)
7078 constructor = validize_mem (constructor);
7083 /* Handle calls that pass values in multiple non-contiguous
7084 locations. The Irix 6 ABI has examples of this. */
7085 if (target == 0 || ! safe_from_p (target, exp, 1)
7086 || GET_CODE (target) == PARALLEL || modifier == EXPAND_STACK_PARM)
7092 = assign_temp (build_qualified_type (type, (TYPE_QUALS (type)
7093 | (TREE_READONLY (exp)
7094 * TYPE_QUAL_CONST))),
7095 0, TREE_ADDRESSABLE (exp), 1);
7098 store_constructor (exp, target, 0, int_expr_size (exp));
7103 /* expand_expr: generate code for computing expression EXP.
7104 An rtx for the computed value is returned. The value is never null.
7105 In the case of a void EXP, const0_rtx is returned.
7107 The value may be stored in TARGET if TARGET is nonzero.
7108 TARGET is just a suggestion; callers must assume that
7109 the rtx returned may not be the same as TARGET.
7111 If TARGET is CONST0_RTX, it means that the value will be ignored.
7113 If TMODE is not VOIDmode, it suggests generating the
7114 result in mode TMODE. But this is done only when convenient.
7115 Otherwise, TMODE is ignored and the value generated in its natural mode.
7116 TMODE is just a suggestion; callers must assume that
7117 the rtx returned may not have mode TMODE.
7119 Note that TARGET may have neither TMODE nor MODE. In that case, it
7120 probably will not be used.
7122 If MODIFIER is EXPAND_SUM then when EXP is an addition
7123 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7124 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7125 products as above, or REG or MEM, or constant.
7126 Ordinarily in such cases we would output mul or add instructions
7127 and then return a pseudo reg containing the sum.
7129 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7130 it also marks a label as absolutely required (it can't be dead).
7131 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7132 This is used for outputting expressions used in initializers.
7134 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7135 with a constant address even if that address is not normally legitimate.
7136 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7138 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7139 a call parameter. Such targets require special care as we haven't yet
7140 marked TARGET so that it's safe from being trashed by libcalls. We
7141 don't want to use TARGET for anything but the final result;
7142 Intermediate values must go elsewhere. Additionally, calls to
7143 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7145 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7146 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7147 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7148 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7152 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
7153 enum expand_modifier modifier, rtx *alt_rtl)
7157 /* Handle ERROR_MARK before anybody tries to access its type. */
7158 if (TREE_CODE (exp) == ERROR_MARK
7159 || (TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK))
7161 ret = CONST0_RTX (tmode);
7162 return ret ? ret : const0_rtx;
7165 /* If this is an expression of some kind and it has an associated line
7166 number, then emit the line number before expanding the expression.
7168 We need to save and restore the file and line information so that
7169 errors discovered during expansion are emitted with the right
7170 information. It would be better of the diagnostic routines
7171 used the file/line information embedded in the tree nodes rather
7173 if (cfun && EXPR_HAS_LOCATION (exp))
7175 location_t saved_location = input_location;
7176 input_location = EXPR_LOCATION (exp);
7177 set_curr_insn_source_location (input_location);
7179 /* Record where the insns produced belong. */
7180 set_curr_insn_block (TREE_BLOCK (exp));
7182 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7184 input_location = saved_location;
7188 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7195 expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
7196 enum expand_modifier modifier)
7198 rtx op0, op1, op2, temp;
7201 enum machine_mode mode;
7202 enum tree_code code = ops->code;
7204 rtx subtarget, original_target;
7206 tree subexp0, subexp1;
7207 bool reduce_bit_field;
7208 gimple subexp0_def, subexp1_def;
7210 location_t loc = ops->location;
7211 tree treeop0, treeop1;
7212 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
7213 ? reduce_to_bit_field_precision ((expr), \
7219 mode = TYPE_MODE (type);
7220 unsignedp = TYPE_UNSIGNED (type);
7225 /* We should be called only on simple (binary or unary) expressions,
7226 exactly those that are valid in gimple expressions that aren't
7227 GIMPLE_SINGLE_RHS (or invalid). */
7228 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS
7229 || get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS);
7231 ignore = (target == const0_rtx
7232 || ((CONVERT_EXPR_CODE_P (code)
7233 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
7234 && TREE_CODE (type) == VOID_TYPE));
7236 /* We should be called only if we need the result. */
7237 gcc_assert (!ignore);
7239 /* An operation in what may be a bit-field type needs the
7240 result to be reduced to the precision of the bit-field type,
7241 which is narrower than that of the type's mode. */
7242 reduce_bit_field = (TREE_CODE (type) == INTEGER_TYPE
7243 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
7245 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
7248 /* Use subtarget as the target for operand 0 of a binary operation. */
7249 subtarget = get_subtarget (target);
7250 original_target = target;
7254 case NON_LVALUE_EXPR:
7257 if (treeop0 == error_mark_node)
7260 if (TREE_CODE (type) == UNION_TYPE)
7262 tree valtype = TREE_TYPE (treeop0);
7264 /* If both input and output are BLKmode, this conversion isn't doing
7265 anything except possibly changing memory attribute. */
7266 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7268 rtx result = expand_expr (treeop0, target, tmode,
7271 result = copy_rtx (result);
7272 set_mem_attributes (result, type, 0);
7278 if (TYPE_MODE (type) != BLKmode)
7279 target = gen_reg_rtx (TYPE_MODE (type));
7281 target = assign_temp (type, 0, 1, 1);
7285 /* Store data into beginning of memory target. */
7286 store_expr (treeop0,
7287 adjust_address (target, TYPE_MODE (valtype), 0),
7288 modifier == EXPAND_STACK_PARM,
7293 gcc_assert (REG_P (target));
7295 /* Store this field into a union of the proper type. */
7296 store_field (target,
7297 MIN ((int_size_in_bytes (TREE_TYPE
7300 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7301 0, TYPE_MODE (valtype), treeop0,
7305 /* Return the entire union. */
7309 if (mode == TYPE_MODE (TREE_TYPE (treeop0)))
7311 op0 = expand_expr (treeop0, target, VOIDmode,
7314 /* If the signedness of the conversion differs and OP0 is
7315 a promoted SUBREG, clear that indication since we now
7316 have to do the proper extension. */
7317 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)) != unsignedp
7318 && GET_CODE (op0) == SUBREG)
7319 SUBREG_PROMOTED_VAR_P (op0) = 0;
7321 return REDUCE_BIT_FIELD (op0);
7324 op0 = expand_expr (treeop0, NULL_RTX, mode,
7325 modifier == EXPAND_SUM ? EXPAND_NORMAL : modifier);
7326 if (GET_MODE (op0) == mode)
7329 /* If OP0 is a constant, just convert it into the proper mode. */
7330 else if (CONSTANT_P (op0))
7332 tree inner_type = TREE_TYPE (treeop0);
7333 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7335 if (modifier == EXPAND_INITIALIZER)
7336 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7337 subreg_lowpart_offset (mode,
7340 op0= convert_modes (mode, inner_mode, op0,
7341 TYPE_UNSIGNED (inner_type));
7344 else if (modifier == EXPAND_INITIALIZER)
7345 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7347 else if (target == 0)
7348 op0 = convert_to_mode (mode, op0,
7349 TYPE_UNSIGNED (TREE_TYPE
7353 convert_move (target, op0,
7354 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7358 return REDUCE_BIT_FIELD (op0);
7360 case ADDR_SPACE_CONVERT_EXPR:
7362 tree treeop0_type = TREE_TYPE (treeop0);
7364 addr_space_t as_from;
7366 gcc_assert (POINTER_TYPE_P (type));
7367 gcc_assert (POINTER_TYPE_P (treeop0_type));
7369 as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
7370 as_from = TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type));
7372 /* Conversions between pointers to the same address space should
7373 have been implemented via CONVERT_EXPR / NOP_EXPR. */
7374 gcc_assert (as_to != as_from);
7376 /* Ask target code to handle conversion between pointers
7377 to overlapping address spaces. */
7378 if (targetm.addr_space.subset_p (as_to, as_from)
7379 || targetm.addr_space.subset_p (as_from, as_to))
7381 op0 = expand_expr (treeop0, NULL_RTX, VOIDmode, modifier);
7382 op0 = targetm.addr_space.convert (op0, treeop0_type, type);
7387 /* For disjoint address spaces, converting anything but
7388 a null pointer invokes undefined behaviour. We simply
7389 always return a null pointer here. */
7390 return CONST0_RTX (mode);
7393 case POINTER_PLUS_EXPR:
7394 /* Even though the sizetype mode and the pointer's mode can be different
7395 expand is able to handle this correctly and get the correct result out
7396 of the PLUS_EXPR code. */
7397 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
7398 if sizetype precision is smaller than pointer precision. */
7399 if (TYPE_PRECISION (sizetype) < TYPE_PRECISION (type))
7400 treeop1 = fold_convert_loc (loc, type,
7401 fold_convert_loc (loc, ssizetype,
7405 /* Check if this is a case for multiplication and addition. */
7406 if ((TREE_CODE (type) == INTEGER_TYPE
7407 || TREE_CODE (type) == FIXED_POINT_TYPE)
7408 && (subexp0_def = get_def_for_expr (treeop0,
7411 tree subsubexp0, subsubexp1;
7412 gimple subsubexp0_def, subsubexp1_def;
7413 enum tree_code this_code;
7415 this_code = TREE_CODE (type) == INTEGER_TYPE ? NOP_EXPR
7416 : FIXED_CONVERT_EXPR;
7417 subsubexp0 = gimple_assign_rhs1 (subexp0_def);
7418 subsubexp0_def = get_def_for_expr (subsubexp0, this_code);
7419 subsubexp1 = gimple_assign_rhs2 (subexp0_def);
7420 subsubexp1_def = get_def_for_expr (subsubexp1, this_code);
7421 if (subsubexp0_def && subsubexp1_def
7422 && (top0 = gimple_assign_rhs1 (subsubexp0_def))
7423 && (top1 = gimple_assign_rhs1 (subsubexp1_def))
7424 && (TYPE_PRECISION (TREE_TYPE (top0))
7425 < TYPE_PRECISION (TREE_TYPE (subsubexp0)))
7426 && (TYPE_PRECISION (TREE_TYPE (top0))
7427 == TYPE_PRECISION (TREE_TYPE (top1)))
7428 && (TYPE_UNSIGNED (TREE_TYPE (top0))
7429 == TYPE_UNSIGNED (TREE_TYPE (top1))))
7431 tree op0type = TREE_TYPE (top0);
7432 enum machine_mode innermode = TYPE_MODE (op0type);
7433 bool zextend_p = TYPE_UNSIGNED (op0type);
7434 bool sat_p = TYPE_SATURATING (TREE_TYPE (subsubexp0));
7436 this_optab = zextend_p ? umadd_widen_optab : smadd_widen_optab;
7438 this_optab = zextend_p ? usmadd_widen_optab
7439 : ssmadd_widen_optab;
7440 if (mode == GET_MODE_2XWIDER_MODE (innermode)
7441 && (optab_handler (this_optab, mode)->insn_code
7442 != CODE_FOR_nothing))
7444 expand_operands (top0, top1, NULL_RTX, &op0, &op1,
7446 op2 = expand_expr (treeop1, subtarget,
7447 VOIDmode, EXPAND_NORMAL);
7448 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
7451 return REDUCE_BIT_FIELD (temp);
7456 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7457 something else, make sure we add the register to the constant and
7458 then to the other thing. This case can occur during strength
7459 reduction and doing it this way will produce better code if the
7460 frame pointer or argument pointer is eliminated.
7462 fold-const.c will ensure that the constant is always in the inner
7463 PLUS_EXPR, so the only case we need to do anything about is if
7464 sp, ap, or fp is our second argument, in which case we must swap
7465 the innermost first argument and our second argument. */
7467 if (TREE_CODE (treeop0) == PLUS_EXPR
7468 && TREE_CODE (TREE_OPERAND (treeop0, 1)) == INTEGER_CST
7469 && TREE_CODE (treeop1) == VAR_DECL
7470 && (DECL_RTL (treeop1) == frame_pointer_rtx
7471 || DECL_RTL (treeop1) == stack_pointer_rtx
7472 || DECL_RTL (treeop1) == arg_pointer_rtx))
7476 treeop1 = TREE_OPERAND (treeop0, 0);
7477 TREE_OPERAND (treeop0, 0) = t;
7480 /* If the result is to be ptr_mode and we are adding an integer to
7481 something, we might be forming a constant. So try to use
7482 plus_constant. If it produces a sum and we can't accept it,
7483 use force_operand. This allows P = &ARR[const] to generate
7484 efficient code on machines where a SYMBOL_REF is not a valid
7487 If this is an EXPAND_SUM call, always return the sum. */
7488 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7489 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7491 if (modifier == EXPAND_STACK_PARM)
7493 if (TREE_CODE (treeop0) == INTEGER_CST
7494 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7495 && TREE_CONSTANT (treeop1))
7499 op1 = expand_expr (treeop1, subtarget, VOIDmode,
7501 /* Use immed_double_const to ensure that the constant is
7502 truncated according to the mode of OP1, then sign extended
7503 to a HOST_WIDE_INT. Using the constant directly can result
7504 in non-canonical RTL in a 64x32 cross compile. */
7506 = immed_double_const (TREE_INT_CST_LOW (treeop0),
7508 TYPE_MODE (TREE_TYPE (treeop1)));
7509 op1 = plus_constant (op1, INTVAL (constant_part));
7510 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7511 op1 = force_operand (op1, target);
7512 return REDUCE_BIT_FIELD (op1);
7515 else if (TREE_CODE (treeop1) == INTEGER_CST
7516 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7517 && TREE_CONSTANT (treeop0))
7521 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7522 (modifier == EXPAND_INITIALIZER
7523 ? EXPAND_INITIALIZER : EXPAND_SUM));
7524 if (! CONSTANT_P (op0))
7526 op1 = expand_expr (treeop1, NULL_RTX,
7527 VOIDmode, modifier);
7528 /* Return a PLUS if modifier says it's OK. */
7529 if (modifier == EXPAND_SUM
7530 || modifier == EXPAND_INITIALIZER)
7531 return simplify_gen_binary (PLUS, mode, op0, op1);
7534 /* Use immed_double_const to ensure that the constant is
7535 truncated according to the mode of OP1, then sign extended
7536 to a HOST_WIDE_INT. Using the constant directly can result
7537 in non-canonical RTL in a 64x32 cross compile. */
7539 = immed_double_const (TREE_INT_CST_LOW (treeop1),
7541 TYPE_MODE (TREE_TYPE (treeop0)));
7542 op0 = plus_constant (op0, INTVAL (constant_part));
7543 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7544 op0 = force_operand (op0, target);
7545 return REDUCE_BIT_FIELD (op0);
7549 /* No sense saving up arithmetic to be done
7550 if it's all in the wrong mode to form part of an address.
7551 And force_operand won't know whether to sign-extend or
7553 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7554 || mode != ptr_mode)
7556 expand_operands (treeop0, treeop1,
7557 subtarget, &op0, &op1, EXPAND_NORMAL);
7558 if (op0 == const0_rtx)
7560 if (op1 == const0_rtx)
7565 expand_operands (treeop0, treeop1,
7566 subtarget, &op0, &op1, modifier);
7567 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7570 /* Check if this is a case for multiplication and subtraction. */
7571 if ((TREE_CODE (type) == INTEGER_TYPE
7572 || TREE_CODE (type) == FIXED_POINT_TYPE)
7573 && (subexp1_def = get_def_for_expr (treeop1,
7576 tree subsubexp0, subsubexp1;
7577 gimple subsubexp0_def, subsubexp1_def;
7578 enum tree_code this_code;
7580 this_code = TREE_CODE (type) == INTEGER_TYPE ? NOP_EXPR
7581 : FIXED_CONVERT_EXPR;
7582 subsubexp0 = gimple_assign_rhs1 (subexp1_def);
7583 subsubexp0_def = get_def_for_expr (subsubexp0, this_code);
7584 subsubexp1 = gimple_assign_rhs2 (subexp1_def);
7585 subsubexp1_def = get_def_for_expr (subsubexp1, this_code);
7586 if (subsubexp0_def && subsubexp1_def
7587 && (top0 = gimple_assign_rhs1 (subsubexp0_def))
7588 && (top1 = gimple_assign_rhs1 (subsubexp1_def))
7589 && (TYPE_PRECISION (TREE_TYPE (top0))
7590 < TYPE_PRECISION (TREE_TYPE (subsubexp0)))
7591 && (TYPE_PRECISION (TREE_TYPE (top0))
7592 == TYPE_PRECISION (TREE_TYPE (top1)))
7593 && (TYPE_UNSIGNED (TREE_TYPE (top0))
7594 == TYPE_UNSIGNED (TREE_TYPE (top1))))
7596 tree op0type = TREE_TYPE (top0);
7597 enum machine_mode innermode = TYPE_MODE (op0type);
7598 bool zextend_p = TYPE_UNSIGNED (op0type);
7599 bool sat_p = TYPE_SATURATING (TREE_TYPE (subsubexp0));
7601 this_optab = zextend_p ? umsub_widen_optab : smsub_widen_optab;
7603 this_optab = zextend_p ? usmsub_widen_optab
7604 : ssmsub_widen_optab;
7605 if (mode == GET_MODE_2XWIDER_MODE (innermode)
7606 && (optab_handler (this_optab, mode)->insn_code
7607 != CODE_FOR_nothing))
7609 expand_operands (top0, top1, NULL_RTX, &op0, &op1,
7611 op2 = expand_expr (treeop0, subtarget,
7612 VOIDmode, EXPAND_NORMAL);
7613 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
7616 return REDUCE_BIT_FIELD (temp);
7621 /* For initializers, we are allowed to return a MINUS of two
7622 symbolic constants. Here we handle all cases when both operands
7624 /* Handle difference of two symbolic constants,
7625 for the sake of an initializer. */
7626 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7627 && really_constant_p (treeop0)
7628 && really_constant_p (treeop1))
7630 expand_operands (treeop0, treeop1,
7631 NULL_RTX, &op0, &op1, modifier);
7633 /* If the last operand is a CONST_INT, use plus_constant of
7634 the negated constant. Else make the MINUS. */
7635 if (CONST_INT_P (op1))
7636 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7638 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7641 /* No sense saving up arithmetic to be done
7642 if it's all in the wrong mode to form part of an address.
7643 And force_operand won't know whether to sign-extend or
7645 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7646 || mode != ptr_mode)
7649 expand_operands (treeop0, treeop1,
7650 subtarget, &op0, &op1, modifier);
7652 /* Convert A - const to A + (-const). */
7653 if (CONST_INT_P (op1))
7655 op1 = negate_rtx (mode, op1);
7656 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7662 /* If this is a fixed-point operation, then we cannot use the code
7663 below because "expand_mult" doesn't support sat/no-sat fixed-point
7665 if (ALL_FIXED_POINT_MODE_P (mode))
7668 /* If first operand is constant, swap them.
7669 Thus the following special case checks need only
7670 check the second operand. */
7671 if (TREE_CODE (treeop0) == INTEGER_CST)
7678 /* Attempt to return something suitable for generating an
7679 indexed address, for machines that support that. */
7681 if (modifier == EXPAND_SUM && mode == ptr_mode
7682 && host_integerp (treeop1, 0))
7684 tree exp1 = treeop1;
7686 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7690 op0 = force_operand (op0, NULL_RTX);
7692 op0 = copy_to_mode_reg (mode, op0);
7694 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7695 gen_int_mode (tree_low_cst (exp1, 0),
7696 TYPE_MODE (TREE_TYPE (exp1)))));
7699 if (modifier == EXPAND_STACK_PARM)
7702 /* Check for multiplying things that have been extended
7703 from a narrower type. If this machine supports multiplying
7704 in that narrower type with a result in the desired type,
7705 do it that way, and avoid the explicit type-conversion. */
7709 subexp0_def = get_def_for_expr (subexp0, NOP_EXPR);
7710 subexp1_def = get_def_for_expr (subexp1, NOP_EXPR);
7711 top0 = top1 = NULL_TREE;
7713 /* First, check if we have a multiplication of one signed and one
7714 unsigned operand. */
7716 && (top0 = gimple_assign_rhs1 (subexp0_def))
7718 && (top1 = gimple_assign_rhs1 (subexp1_def))
7719 && TREE_CODE (type) == INTEGER_TYPE
7720 && (TYPE_PRECISION (TREE_TYPE (top0))
7721 < TYPE_PRECISION (TREE_TYPE (subexp0)))
7722 && (TYPE_PRECISION (TREE_TYPE (top0))
7723 == TYPE_PRECISION (TREE_TYPE (top1)))
7724 && (TYPE_UNSIGNED (TREE_TYPE (top0))
7725 != TYPE_UNSIGNED (TREE_TYPE (top1))))
7727 enum machine_mode innermode
7728 = TYPE_MODE (TREE_TYPE (top0));
7729 this_optab = usmul_widen_optab;
7730 if (mode == GET_MODE_WIDER_MODE (innermode))
7732 if (optab_handler (this_optab, mode)->insn_code != CODE_FOR_nothing)
7734 if (TYPE_UNSIGNED (TREE_TYPE (top0)))
7735 expand_operands (top0, top1, NULL_RTX, &op0, &op1,
7738 expand_operands (top0, top1, NULL_RTX, &op1, &op0,
7745 /* Check for a multiplication with matching signedness. If
7746 valid, TOP0 and TOP1 were set in the previous if
7749 && TREE_CODE (type) == INTEGER_TYPE
7750 && (TYPE_PRECISION (TREE_TYPE (top0))
7751 < TYPE_PRECISION (TREE_TYPE (subexp0)))
7752 && ((TREE_CODE (subexp1) == INTEGER_CST
7753 && int_fits_type_p (subexp1, TREE_TYPE (top0))
7754 /* Don't use a widening multiply if a shift will do. */
7755 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (subexp1)))
7756 > HOST_BITS_PER_WIDE_INT)
7757 || exact_log2 (TREE_INT_CST_LOW (subexp1)) < 0))
7760 && (TYPE_PRECISION (TREE_TYPE (top1))
7761 == TYPE_PRECISION (TREE_TYPE (top0))
7762 /* If both operands are extended, they must either both
7763 be zero-extended or both be sign-extended. */
7764 && (TYPE_UNSIGNED (TREE_TYPE (top1))
7765 == TYPE_UNSIGNED (TREE_TYPE (top0)))))))
7767 tree op0type = TREE_TYPE (top0);
7768 enum machine_mode innermode = TYPE_MODE (op0type);
7769 bool zextend_p = TYPE_UNSIGNED (op0type);
7770 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7771 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7773 if (mode == GET_MODE_2XWIDER_MODE (innermode))
7775 if (optab_handler (this_optab, mode)->insn_code != CODE_FOR_nothing)
7777 if (TREE_CODE (subexp1) == INTEGER_CST)
7778 expand_operands (top0, subexp1, NULL_RTX, &op0, &op1,
7781 expand_operands (top0, top1, NULL_RTX, &op0, &op1,
7785 else if (optab_handler (other_optab, mode)->insn_code != CODE_FOR_nothing
7786 && innermode == word_mode)
7789 op0 = expand_normal (top0);
7790 if (TREE_CODE (subexp1) == INTEGER_CST)
7791 op1 = convert_modes (innermode, mode,
7792 expand_normal (subexp1), unsignedp);
7794 op1 = expand_normal (top1);
7795 temp = expand_binop (mode, other_optab, op0, op1, target,
7796 unsignedp, OPTAB_LIB_WIDEN);
7797 hipart = gen_highpart (innermode, temp);
7798 htem = expand_mult_highpart_adjust (innermode, hipart,
7802 emit_move_insn (hipart, htem);
7803 return REDUCE_BIT_FIELD (temp);
7807 expand_operands (subexp0, subexp1, subtarget, &op0, &op1, EXPAND_NORMAL);
7808 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7810 case TRUNC_DIV_EXPR:
7811 case FLOOR_DIV_EXPR:
7813 case ROUND_DIV_EXPR:
7814 case EXACT_DIV_EXPR:
7815 /* If this is a fixed-point operation, then we cannot use the code
7816 below because "expand_divmod" doesn't support sat/no-sat fixed-point
7818 if (ALL_FIXED_POINT_MODE_P (mode))
7821 if (modifier == EXPAND_STACK_PARM)
7823 /* Possible optimization: compute the dividend with EXPAND_SUM
7824 then if the divisor is constant can optimize the case
7825 where some terms of the dividend have coeffs divisible by it. */
7826 expand_operands (treeop0, treeop1,
7827 subtarget, &op0, &op1, EXPAND_NORMAL);
7828 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7833 case TRUNC_MOD_EXPR:
7834 case FLOOR_MOD_EXPR:
7836 case ROUND_MOD_EXPR:
7837 if (modifier == EXPAND_STACK_PARM)
7839 expand_operands (treeop0, treeop1,
7840 subtarget, &op0, &op1, EXPAND_NORMAL);
7841 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7843 case FIXED_CONVERT_EXPR:
7844 op0 = expand_normal (treeop0);
7845 if (target == 0 || modifier == EXPAND_STACK_PARM)
7846 target = gen_reg_rtx (mode);
7848 if ((TREE_CODE (TREE_TYPE (treeop0)) == INTEGER_TYPE
7849 && TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7850 || (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type)))
7851 expand_fixed_convert (target, op0, 1, TYPE_SATURATING (type));
7853 expand_fixed_convert (target, op0, 0, TYPE_SATURATING (type));
7856 case FIX_TRUNC_EXPR:
7857 op0 = expand_normal (treeop0);
7858 if (target == 0 || modifier == EXPAND_STACK_PARM)
7859 target = gen_reg_rtx (mode);
7860 expand_fix (target, op0, unsignedp);
7864 op0 = expand_normal (treeop0);
7865 if (target == 0 || modifier == EXPAND_STACK_PARM)
7866 target = gen_reg_rtx (mode);
7867 /* expand_float can't figure out what to do if FROM has VOIDmode.
7868 So give it the correct mode. With -O, cse will optimize this. */
7869 if (GET_MODE (op0) == VOIDmode)
7870 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0)),
7872 expand_float (target, op0,
7873 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7877 op0 = expand_expr (treeop0, subtarget,
7878 VOIDmode, EXPAND_NORMAL);
7879 if (modifier == EXPAND_STACK_PARM)
7881 temp = expand_unop (mode,
7882 optab_for_tree_code (NEGATE_EXPR, type,
7886 return REDUCE_BIT_FIELD (temp);
7889 op0 = expand_expr (treeop0, subtarget,
7890 VOIDmode, EXPAND_NORMAL);
7891 if (modifier == EXPAND_STACK_PARM)
7894 /* ABS_EXPR is not valid for complex arguments. */
7895 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7896 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
7898 /* Unsigned abs is simply the operand. Testing here means we don't
7899 risk generating incorrect code below. */
7900 if (TYPE_UNSIGNED (type))
7903 return expand_abs (mode, op0, target, unsignedp,
7904 safe_from_p (target, treeop0, 1));
7908 target = original_target;
7910 || modifier == EXPAND_STACK_PARM
7911 || (MEM_P (target) && MEM_VOLATILE_P (target))
7912 || GET_MODE (target) != mode
7914 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7915 target = gen_reg_rtx (mode);
7916 expand_operands (treeop0, treeop1,
7917 target, &op0, &op1, EXPAND_NORMAL);
7919 /* First try to do it with a special MIN or MAX instruction.
7920 If that does not win, use a conditional jump to select the proper
7922 this_optab = optab_for_tree_code (code, type, optab_default);
7923 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7928 /* At this point, a MEM target is no longer useful; we will get better
7931 if (! REG_P (target))
7932 target = gen_reg_rtx (mode);
7934 /* If op1 was placed in target, swap op0 and op1. */
7935 if (target != op0 && target == op1)
7942 /* We generate better code and avoid problems with op1 mentioning
7943 target by forcing op1 into a pseudo if it isn't a constant. */
7944 if (! CONSTANT_P (op1))
7945 op1 = force_reg (mode, op1);
7948 enum rtx_code comparison_code;
7951 if (code == MAX_EXPR)
7952 comparison_code = unsignedp ? GEU : GE;
7954 comparison_code = unsignedp ? LEU : LE;
7956 /* Canonicalize to comparisons against 0. */
7957 if (op1 == const1_rtx)
7959 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
7960 or (a != 0 ? a : 1) for unsigned.
7961 For MIN we are safe converting (a <= 1 ? a : 1)
7962 into (a <= 0 ? a : 1) */
7963 cmpop1 = const0_rtx;
7964 if (code == MAX_EXPR)
7965 comparison_code = unsignedp ? NE : GT;
7967 if (op1 == constm1_rtx && !unsignedp)
7969 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
7970 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
7971 cmpop1 = const0_rtx;
7972 if (code == MIN_EXPR)
7973 comparison_code = LT;
7975 #ifdef HAVE_conditional_move
7976 /* Use a conditional move if possible. */
7977 if (can_conditionally_move_p (mode))
7981 /* ??? Same problem as in expmed.c: emit_conditional_move
7982 forces a stack adjustment via compare_from_rtx, and we
7983 lose the stack adjustment if the sequence we are about
7984 to create is discarded. */
7985 do_pending_stack_adjust ();
7989 /* Try to emit the conditional move. */
7990 insn = emit_conditional_move (target, comparison_code,
7995 /* If we could do the conditional move, emit the sequence,
7999 rtx seq = get_insns ();
8005 /* Otherwise discard the sequence and fall back to code with
8011 emit_move_insn (target, op0);
8013 temp = gen_label_rtx ();
8014 do_compare_rtx_and_jump (target, cmpop1, comparison_code,
8015 unsignedp, mode, NULL_RTX, NULL_RTX, temp);
8017 emit_move_insn (target, op1);
8022 op0 = expand_expr (treeop0, subtarget,
8023 VOIDmode, EXPAND_NORMAL);
8024 if (modifier == EXPAND_STACK_PARM)
8026 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8030 /* ??? Can optimize bitwise operations with one arg constant.
8031 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8032 and (a bitwise1 b) bitwise2 b (etc)
8033 but that is probably not worth while. */
8035 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8036 boolean values when we want in all cases to compute both of them. In
8037 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8038 as actual zero-or-1 values and then bitwise anding. In cases where
8039 there cannot be any side effects, better code would be made by
8040 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8041 how to recognize those cases. */
8043 case TRUTH_AND_EXPR:
8044 code = BIT_AND_EXPR;
8049 code = BIT_IOR_EXPR;
8053 case TRUTH_XOR_EXPR:
8054 code = BIT_XOR_EXPR;
8060 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type))
8061 || (GET_MODE_PRECISION (TYPE_MODE (type))
8062 == TYPE_PRECISION (type)));
8067 /* If this is a fixed-point operation, then we cannot use the code
8068 below because "expand_shift" doesn't support sat/no-sat fixed-point
8070 if (ALL_FIXED_POINT_MODE_P (mode))
8073 if (! safe_from_p (subtarget, treeop1, 1))
8075 if (modifier == EXPAND_STACK_PARM)
8077 op0 = expand_expr (treeop0, subtarget,
8078 VOIDmode, EXPAND_NORMAL);
8079 temp = expand_shift (code, mode, op0, treeop1, target,
8081 if (code == LSHIFT_EXPR)
8082 temp = REDUCE_BIT_FIELD (temp);
8085 /* Could determine the answer when only additive constants differ. Also,
8086 the addition of one can be handled by changing the condition. */
8093 case UNORDERED_EXPR:
8101 temp = do_store_flag (ops,
8102 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8103 tmode != VOIDmode ? tmode : mode);
8107 /* Use a compare and a jump for BLKmode comparisons, or for function
8108 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8111 || modifier == EXPAND_STACK_PARM
8112 || ! safe_from_p (target, treeop0, 1)
8113 || ! safe_from_p (target, treeop1, 1)
8114 /* Make sure we don't have a hard reg (such as function's return
8115 value) live across basic blocks, if not optimizing. */
8116 || (!optimize && REG_P (target)
8117 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8118 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8120 emit_move_insn (target, const0_rtx);
8122 op1 = gen_label_rtx ();
8123 jumpifnot_1 (code, treeop0, treeop1, op1);
8125 emit_move_insn (target, const1_rtx);
8130 case TRUTH_NOT_EXPR:
8131 if (modifier == EXPAND_STACK_PARM)
8133 op0 = expand_expr (treeop0, target,
8134 VOIDmode, EXPAND_NORMAL);
8135 /* The parser is careful to generate TRUTH_NOT_EXPR
8136 only with operands that are always zero or one. */
8137 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8138 target, 1, OPTAB_LIB_WIDEN);
8143 /* Get the rtx code of the operands. */
8144 op0 = expand_normal (treeop0);
8145 op1 = expand_normal (treeop1);
8148 target = gen_reg_rtx (TYPE_MODE (type));
8150 /* Move the real (op0) and imaginary (op1) parts to their location. */
8151 write_complex_part (target, op0, false);
8152 write_complex_part (target, op1, true);
8156 case WIDEN_SUM_EXPR:
8158 tree oprnd0 = treeop0;
8159 tree oprnd1 = treeop1;
8161 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8162 target = expand_widen_pattern_expr (ops, op0, NULL_RTX, op1,
8167 case REDUC_MAX_EXPR:
8168 case REDUC_MIN_EXPR:
8169 case REDUC_PLUS_EXPR:
8171 op0 = expand_normal (treeop0);
8172 this_optab = optab_for_tree_code (code, type, optab_default);
8173 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8178 case VEC_EXTRACT_EVEN_EXPR:
8179 case VEC_EXTRACT_ODD_EXPR:
8181 expand_operands (treeop0, treeop1,
8182 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8183 this_optab = optab_for_tree_code (code, type, optab_default);
8184 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8190 case VEC_INTERLEAVE_HIGH_EXPR:
8191 case VEC_INTERLEAVE_LOW_EXPR:
8193 expand_operands (treeop0, treeop1,
8194 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8195 this_optab = optab_for_tree_code (code, type, optab_default);
8196 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8202 case VEC_LSHIFT_EXPR:
8203 case VEC_RSHIFT_EXPR:
8205 target = expand_vec_shift_expr (ops, target);
8209 case VEC_UNPACK_HI_EXPR:
8210 case VEC_UNPACK_LO_EXPR:
8212 op0 = expand_normal (treeop0);
8213 this_optab = optab_for_tree_code (code, type, optab_default);
8214 temp = expand_widen_pattern_expr (ops, op0, NULL_RTX, NULL_RTX,
8220 case VEC_UNPACK_FLOAT_HI_EXPR:
8221 case VEC_UNPACK_FLOAT_LO_EXPR:
8223 op0 = expand_normal (treeop0);
8224 /* The signedness is determined from input operand. */
8225 this_optab = optab_for_tree_code (code,
8226 TREE_TYPE (treeop0),
8228 temp = expand_widen_pattern_expr
8229 (ops, op0, NULL_RTX, NULL_RTX,
8230 target, TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8236 case VEC_WIDEN_MULT_HI_EXPR:
8237 case VEC_WIDEN_MULT_LO_EXPR:
8239 tree oprnd0 = treeop0;
8240 tree oprnd1 = treeop1;
8242 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8243 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8245 gcc_assert (target);
8249 case VEC_PACK_TRUNC_EXPR:
8250 case VEC_PACK_SAT_EXPR:
8251 case VEC_PACK_FIX_TRUNC_EXPR:
8252 mode = TYPE_MODE (TREE_TYPE (treeop0));
8259 /* Here to do an ordinary binary operator. */
8261 expand_operands (treeop0, treeop1,
8262 subtarget, &op0, &op1, EXPAND_NORMAL);
8264 this_optab = optab_for_tree_code (code, type, optab_default);
8266 if (modifier == EXPAND_STACK_PARM)
8268 temp = expand_binop (mode, this_optab, op0, op1, target,
8269 unsignedp, OPTAB_LIB_WIDEN);
8271 return REDUCE_BIT_FIELD (temp);
8273 #undef REDUCE_BIT_FIELD
8276 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
8277 enum expand_modifier modifier, rtx *alt_rtl)
8279 rtx op0, op1, temp, decl_rtl;
8282 enum machine_mode mode;
8283 enum tree_code code = TREE_CODE (exp);
8285 rtx subtarget, original_target;
8288 bool reduce_bit_field;
8289 location_t loc = EXPR_LOCATION (exp);
8290 struct separate_ops ops;
8291 tree treeop0, treeop1, treeop2;
8293 type = TREE_TYPE (exp);
8294 mode = TYPE_MODE (type);
8295 unsignedp = TYPE_UNSIGNED (type);
8297 treeop0 = treeop1 = treeop2 = NULL_TREE;
8298 if (!VL_EXP_CLASS_P (exp))
8299 switch (TREE_CODE_LENGTH (code))
8302 case 3: treeop2 = TREE_OPERAND (exp, 2);
8303 case 2: treeop1 = TREE_OPERAND (exp, 1);
8304 case 1: treeop0 = TREE_OPERAND (exp, 0);
8314 ignore = (target == const0_rtx
8315 || ((CONVERT_EXPR_CODE_P (code)
8316 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
8317 && TREE_CODE (type) == VOID_TYPE));
8319 /* An operation in what may be a bit-field type needs the
8320 result to be reduced to the precision of the bit-field type,
8321 which is narrower than that of the type's mode. */
8322 reduce_bit_field = (!ignore
8323 && TREE_CODE (type) == INTEGER_TYPE
8324 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
8326 /* If we are going to ignore this result, we need only do something
8327 if there is a side-effect somewhere in the expression. If there
8328 is, short-circuit the most common cases here. Note that we must
8329 not call expand_expr with anything but const0_rtx in case this
8330 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
8334 if (! TREE_SIDE_EFFECTS (exp))
8337 /* Ensure we reference a volatile object even if value is ignored, but
8338 don't do this if all we are doing is taking its address. */
8339 if (TREE_THIS_VOLATILE (exp)
8340 && TREE_CODE (exp) != FUNCTION_DECL
8341 && mode != VOIDmode && mode != BLKmode
8342 && modifier != EXPAND_CONST_ADDRESS)
8344 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
8346 temp = copy_to_reg (temp);
8350 if (TREE_CODE_CLASS (code) == tcc_unary
8351 || code == COMPONENT_REF || code == INDIRECT_REF)
8352 return expand_expr (treeop0, const0_rtx, VOIDmode,
8355 else if (TREE_CODE_CLASS (code) == tcc_binary
8356 || TREE_CODE_CLASS (code) == tcc_comparison
8357 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
8359 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8360 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8363 else if (code == BIT_FIELD_REF)
8365 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8366 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8367 expand_expr (treeop2, const0_rtx, VOIDmode, modifier);
8374 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
8377 /* Use subtarget as the target for operand 0 of a binary operation. */
8378 subtarget = get_subtarget (target);
8379 original_target = target;
8385 tree function = decl_function_context (exp);
8387 temp = label_rtx (exp);
8388 temp = gen_rtx_LABEL_REF (Pmode, temp);
8390 if (function != current_function_decl
8392 LABEL_REF_NONLOCAL_P (temp) = 1;
8394 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
8399 /* ??? ivopts calls expander, without any preparation from
8400 out-of-ssa. So fake instructions as if this was an access to the
8401 base variable. This unnecessarily allocates a pseudo, see how we can
8402 reuse it, if partition base vars have it set already. */
8403 if (!currently_expanding_to_rtl)
8404 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier, NULL);
8406 gimple g = get_gimple_for_ssa_name (exp);
8408 return expand_expr_real_1 (gimple_assign_rhs_to_tree (g), target,
8409 tmode, modifier, NULL);
8411 decl_rtl = get_rtx_for_ssa_name (exp);
8412 exp = SSA_NAME_VAR (exp);
8413 goto expand_decl_rtl;
8417 /* If a static var's type was incomplete when the decl was written,
8418 but the type is complete now, lay out the decl now. */
8419 if (DECL_SIZE (exp) == 0
8420 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
8421 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
8422 layout_decl (exp, 0);
8424 /* TLS emulation hook - replace __thread vars with
8425 *__emutls_get_address (&_emutls.var). */
8426 if (! targetm.have_tls
8427 && TREE_CODE (exp) == VAR_DECL
8428 && DECL_THREAD_LOCAL_P (exp))
8430 exp = build_fold_indirect_ref_loc (loc, emutls_var_address (exp));
8431 return expand_expr_real_1 (exp, target, tmode, modifier, NULL);
8434 /* ... fall through ... */
8438 decl_rtl = DECL_RTL (exp);
8440 gcc_assert (decl_rtl);
8441 decl_rtl = copy_rtx (decl_rtl);
8443 /* Ensure variable marked as used even if it doesn't go through
8444 a parser. If it hasn't be used yet, write out an external
8446 if (! TREE_USED (exp))
8448 assemble_external (exp);
8449 TREE_USED (exp) = 1;
8452 /* Show we haven't gotten RTL for this yet. */
8455 /* Variables inherited from containing functions should have
8456 been lowered by this point. */
8457 context = decl_function_context (exp);
8458 gcc_assert (!context
8459 || context == current_function_decl
8460 || TREE_STATIC (exp)
8461 /* ??? C++ creates functions that are not TREE_STATIC. */
8462 || TREE_CODE (exp) == FUNCTION_DECL);
8464 /* This is the case of an array whose size is to be determined
8465 from its initializer, while the initializer is still being parsed.
8468 if (MEM_P (decl_rtl) && REG_P (XEXP (decl_rtl, 0)))
8469 temp = validize_mem (decl_rtl);
8471 /* If DECL_RTL is memory, we are in the normal case and the
8472 address is not valid, get the address into a register. */
8474 else if (MEM_P (decl_rtl) && modifier != EXPAND_INITIALIZER)
8477 *alt_rtl = decl_rtl;
8478 decl_rtl = use_anchored_address (decl_rtl);
8479 if (modifier != EXPAND_CONST_ADDRESS
8480 && modifier != EXPAND_SUM
8481 && !memory_address_addr_space_p (DECL_MODE (exp),
8483 MEM_ADDR_SPACE (decl_rtl)))
8484 temp = replace_equiv_address (decl_rtl,
8485 copy_rtx (XEXP (decl_rtl, 0)));
8488 /* If we got something, return it. But first, set the alignment
8489 if the address is a register. */
8492 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
8493 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
8498 /* If the mode of DECL_RTL does not match that of the decl, it
8499 must be a promoted value. We return a SUBREG of the wanted mode,
8500 but mark it so that we know that it was already extended. */
8502 if (REG_P (decl_rtl)
8503 && GET_MODE (decl_rtl) != DECL_MODE (exp))
8505 enum machine_mode pmode;
8507 /* Get the signedness used for this variable. Ensure we get the
8508 same mode we got when the variable was declared. */
8509 pmode = promote_decl_mode (exp, &unsignedp);
8510 gcc_assert (GET_MODE (decl_rtl) == pmode);
8512 temp = gen_lowpart_SUBREG (mode, decl_rtl);
8513 SUBREG_PROMOTED_VAR_P (temp) = 1;
8514 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
8521 temp = immed_double_const (TREE_INT_CST_LOW (exp),
8522 TREE_INT_CST_HIGH (exp), mode);
8528 tree tmp = NULL_TREE;
8529 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
8530 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT
8531 || GET_MODE_CLASS (mode) == MODE_VECTOR_FRACT
8532 || GET_MODE_CLASS (mode) == MODE_VECTOR_UFRACT
8533 || GET_MODE_CLASS (mode) == MODE_VECTOR_ACCUM
8534 || GET_MODE_CLASS (mode) == MODE_VECTOR_UACCUM)
8535 return const_vector_from_tree (exp);
8536 if (GET_MODE_CLASS (mode) == MODE_INT)
8538 tree type_for_mode = lang_hooks.types.type_for_mode (mode, 1);
8540 tmp = fold_unary_loc (loc, VIEW_CONVERT_EXPR, type_for_mode, exp);
8543 tmp = build_constructor_from_list (type,
8544 TREE_VECTOR_CST_ELTS (exp));
8545 return expand_expr (tmp, ignore ? const0_rtx : target,
8550 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
8553 /* If optimized, generate immediate CONST_DOUBLE
8554 which will be turned into memory by reload if necessary.
8556 We used to force a register so that loop.c could see it. But
8557 this does not allow gen_* patterns to perform optimizations with
8558 the constants. It also produces two insns in cases like "x = 1.0;".
8559 On most machines, floating-point constants are not permitted in
8560 many insns, so we'd end up copying it to a register in any case.
8562 Now, we do the copying in expand_binop, if appropriate. */
8563 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
8564 TYPE_MODE (TREE_TYPE (exp)));
8567 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp),
8568 TYPE_MODE (TREE_TYPE (exp)));
8571 /* Handle evaluating a complex constant in a CONCAT target. */
8572 if (original_target && GET_CODE (original_target) == CONCAT)
8574 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8577 rtarg = XEXP (original_target, 0);
8578 itarg = XEXP (original_target, 1);
8580 /* Move the real and imaginary parts separately. */
8581 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, EXPAND_NORMAL);
8582 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, EXPAND_NORMAL);
8585 emit_move_insn (rtarg, op0);
8587 emit_move_insn (itarg, op1);
8589 return original_target;
8592 /* ... fall through ... */
8595 temp = expand_expr_constant (exp, 1, modifier);
8597 /* temp contains a constant address.
8598 On RISC machines where a constant address isn't valid,
8599 make some insns to get that address into a register. */
8600 if (modifier != EXPAND_CONST_ADDRESS
8601 && modifier != EXPAND_INITIALIZER
8602 && modifier != EXPAND_SUM
8603 && ! memory_address_addr_space_p (mode, XEXP (temp, 0),
8604 MEM_ADDR_SPACE (temp)))
8605 return replace_equiv_address (temp,
8606 copy_rtx (XEXP (temp, 0)));
8612 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
8614 if (!SAVE_EXPR_RESOLVED_P (exp))
8616 /* We can indeed still hit this case, typically via builtin
8617 expanders calling save_expr immediately before expanding
8618 something. Assume this means that we only have to deal
8619 with non-BLKmode values. */
8620 gcc_assert (GET_MODE (ret) != BLKmode);
8622 val = build_decl (EXPR_LOCATION (exp),
8623 VAR_DECL, NULL, TREE_TYPE (exp));
8624 DECL_ARTIFICIAL (val) = 1;
8625 DECL_IGNORED_P (val) = 1;
8627 TREE_OPERAND (exp, 0) = treeop0;
8628 SAVE_EXPR_RESOLVED_P (exp) = 1;
8630 if (!CONSTANT_P (ret))
8631 ret = copy_to_reg (ret);
8632 SET_DECL_RTL (val, ret);
8640 /* If we don't need the result, just ensure we evaluate any
8644 unsigned HOST_WIDE_INT idx;
8647 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
8648 expand_expr (value, const0_rtx, VOIDmode, EXPAND_NORMAL);
8653 return expand_constructor (exp, target, modifier, false);
8655 case MISALIGNED_INDIRECT_REF:
8656 case ALIGN_INDIRECT_REF:
8659 tree exp1 = treeop0;
8660 addr_space_t as = ADDR_SPACE_GENERIC;
8661 enum machine_mode address_mode = Pmode;
8663 if (modifier != EXPAND_WRITE)
8667 t = fold_read_from_constant_string (exp);
8669 return expand_expr (t, target, tmode, modifier);
8672 if (POINTER_TYPE_P (TREE_TYPE (exp1)))
8674 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp1)));
8675 address_mode = targetm.addr_space.address_mode (as);
8678 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
8679 op0 = memory_address_addr_space (mode, op0, as);
8681 if (code == ALIGN_INDIRECT_REF)
8683 int align = TYPE_ALIGN_UNIT (type);
8684 op0 = gen_rtx_AND (address_mode, op0, GEN_INT (-align));
8685 op0 = memory_address_addr_space (mode, op0, as);
8688 temp = gen_rtx_MEM (mode, op0);
8690 set_mem_attributes (temp, exp, 0);
8691 set_mem_addr_space (temp, as);
8693 /* Resolve the misalignment now, so that we don't have to remember
8694 to resolve it later. Of course, this only works for reads. */
8695 if (code == MISALIGNED_INDIRECT_REF)
8700 gcc_assert (modifier == EXPAND_NORMAL
8701 || modifier == EXPAND_STACK_PARM);
8703 /* The vectorizer should have already checked the mode. */
8704 icode = optab_handler (movmisalign_optab, mode)->insn_code;
8705 gcc_assert (icode != CODE_FOR_nothing);
8707 /* We've already validated the memory, and we're creating a
8708 new pseudo destination. The predicates really can't fail. */
8709 reg = gen_reg_rtx (mode);
8711 /* Nor can the insn generator. */
8712 insn = GEN_FCN (icode) (reg, temp);
8721 case TARGET_MEM_REF:
8723 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (exp));
8724 struct mem_address addr;
8726 get_address_description (exp, &addr);
8727 op0 = addr_for_mem_ref (&addr, as, true);
8728 op0 = memory_address_addr_space (mode, op0, as);
8729 temp = gen_rtx_MEM (mode, op0);
8730 set_mem_attributes (temp, TMR_ORIGINAL (exp), 0);
8731 set_mem_addr_space (temp, as);
8738 tree array = treeop0;
8739 tree index = treeop1;
8741 /* Fold an expression like: "foo"[2].
8742 This is not done in fold so it won't happen inside &.
8743 Don't fold if this is for wide characters since it's too
8744 difficult to do correctly and this is a very rare case. */
8746 if (modifier != EXPAND_CONST_ADDRESS
8747 && modifier != EXPAND_INITIALIZER
8748 && modifier != EXPAND_MEMORY)
8750 tree t = fold_read_from_constant_string (exp);
8753 return expand_expr (t, target, tmode, modifier);
8756 /* If this is a constant index into a constant array,
8757 just get the value from the array. Handle both the cases when
8758 we have an explicit constructor and when our operand is a variable
8759 that was declared const. */
8761 if (modifier != EXPAND_CONST_ADDRESS
8762 && modifier != EXPAND_INITIALIZER
8763 && modifier != EXPAND_MEMORY
8764 && TREE_CODE (array) == CONSTRUCTOR
8765 && ! TREE_SIDE_EFFECTS (array)
8766 && TREE_CODE (index) == INTEGER_CST)
8768 unsigned HOST_WIDE_INT ix;
8771 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array), ix,
8773 if (tree_int_cst_equal (field, index))
8775 if (!TREE_SIDE_EFFECTS (value))
8776 return expand_expr (fold (value), target, tmode, modifier);
8781 else if (optimize >= 1
8782 && modifier != EXPAND_CONST_ADDRESS
8783 && modifier != EXPAND_INITIALIZER
8784 && modifier != EXPAND_MEMORY
8785 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
8786 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
8787 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
8788 && targetm.binds_local_p (array))
8790 if (TREE_CODE (index) == INTEGER_CST)
8792 tree init = DECL_INITIAL (array);
8794 if (TREE_CODE (init) == CONSTRUCTOR)
8796 unsigned HOST_WIDE_INT ix;
8799 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), ix,
8801 if (tree_int_cst_equal (field, index))
8803 if (TREE_SIDE_EFFECTS (value))
8806 if (TREE_CODE (value) == CONSTRUCTOR)
8808 /* If VALUE is a CONSTRUCTOR, this
8809 optimization is only useful if
8810 this doesn't store the CONSTRUCTOR
8811 into memory. If it does, it is more
8812 efficient to just load the data from
8813 the array directly. */
8814 rtx ret = expand_constructor (value, target,
8816 if (ret == NULL_RTX)
8820 return expand_expr (fold (value), target, tmode,
8824 else if(TREE_CODE (init) == STRING_CST)
8826 tree index1 = index;
8827 tree low_bound = array_ref_low_bound (exp);
8828 index1 = fold_convert_loc (loc, sizetype,
8831 /* Optimize the special-case of a zero lower bound.
8833 We convert the low_bound to sizetype to avoid some problems
8834 with constant folding. (E.g. suppose the lower bound is 1,
8835 and its mode is QI. Without the conversion,l (ARRAY
8836 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
8837 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
8839 if (! integer_zerop (low_bound))
8840 index1 = size_diffop_loc (loc, index1,
8841 fold_convert_loc (loc, sizetype,
8844 if (0 > compare_tree_int (index1,
8845 TREE_STRING_LENGTH (init)))
8847 tree type = TREE_TYPE (TREE_TYPE (init));
8848 enum machine_mode mode = TYPE_MODE (type);
8850 if (GET_MODE_CLASS (mode) == MODE_INT
8851 && GET_MODE_SIZE (mode) == 1)
8852 return gen_int_mode (TREE_STRING_POINTER (init)
8853 [TREE_INT_CST_LOW (index1)],
8860 goto normal_inner_ref;
8863 /* If the operand is a CONSTRUCTOR, we can just extract the
8864 appropriate field if it is present. */
8865 if (TREE_CODE (treeop0) == CONSTRUCTOR)
8867 unsigned HOST_WIDE_INT idx;
8870 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0),
8872 if (field == treeop1
8873 /* We can normally use the value of the field in the
8874 CONSTRUCTOR. However, if this is a bitfield in
8875 an integral mode that we can fit in a HOST_WIDE_INT,
8876 we must mask only the number of bits in the bitfield,
8877 since this is done implicitly by the constructor. If
8878 the bitfield does not meet either of those conditions,
8879 we can't do this optimization. */
8880 && (! DECL_BIT_FIELD (field)
8881 || ((GET_MODE_CLASS (DECL_MODE (field)) == MODE_INT)
8882 && (GET_MODE_BITSIZE (DECL_MODE (field))
8883 <= HOST_BITS_PER_WIDE_INT))))
8885 if (DECL_BIT_FIELD (field)
8886 && modifier == EXPAND_STACK_PARM)
8888 op0 = expand_expr (value, target, tmode, modifier);
8889 if (DECL_BIT_FIELD (field))
8891 HOST_WIDE_INT bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
8892 enum machine_mode imode = TYPE_MODE (TREE_TYPE (field));
8894 if (TYPE_UNSIGNED (TREE_TYPE (field)))
8896 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
8897 op0 = expand_and (imode, op0, op1, target);
8902 = build_int_cst (NULL_TREE,
8903 GET_MODE_BITSIZE (imode) - bitsize);
8905 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
8907 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
8915 goto normal_inner_ref;
8918 case ARRAY_RANGE_REF:
8921 enum machine_mode mode1, mode2;
8922 HOST_WIDE_INT bitsize, bitpos;
8924 int volatilep = 0, must_force_mem;
8925 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
8926 &mode1, &unsignedp, &volatilep, true);
8927 rtx orig_op0, memloc;
8929 /* If we got back the original object, something is wrong. Perhaps
8930 we are evaluating an expression too early. In any event, don't
8931 infinitely recurse. */
8932 gcc_assert (tem != exp);
8934 /* If TEM's type is a union of variable size, pass TARGET to the inner
8935 computation, since it will need a temporary and TARGET is known
8936 to have to do. This occurs in unchecked conversion in Ada. */
8939 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
8940 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
8942 && modifier != EXPAND_STACK_PARM
8943 ? target : NULL_RTX),
8945 (modifier == EXPAND_INITIALIZER
8946 || modifier == EXPAND_CONST_ADDRESS
8947 || modifier == EXPAND_STACK_PARM)
8948 ? modifier : EXPAND_NORMAL);
8951 = CONSTANT_P (op0) ? TYPE_MODE (TREE_TYPE (tem)) : GET_MODE (op0);
8953 /* If we have either an offset, a BLKmode result, or a reference
8954 outside the underlying object, we must force it to memory.
8955 Such a case can occur in Ada if we have unchecked conversion
8956 of an expression from a scalar type to an aggregate type or
8957 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
8958 passed a partially uninitialized object or a view-conversion
8959 to a larger size. */
8960 must_force_mem = (offset
8962 || bitpos + bitsize > GET_MODE_BITSIZE (mode2));
8964 /* Handle CONCAT first. */
8965 if (GET_CODE (op0) == CONCAT && !must_force_mem)
8968 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
8971 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
8974 op0 = XEXP (op0, 0);
8975 mode2 = GET_MODE (op0);
8977 else if (bitpos == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
8978 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 1)))
8982 op0 = XEXP (op0, 1);
8984 mode2 = GET_MODE (op0);
8987 /* Otherwise force into memory. */
8991 /* If this is a constant, put it in a register if it is a legitimate
8992 constant and we don't need a memory reference. */
8993 if (CONSTANT_P (op0)
8995 && LEGITIMATE_CONSTANT_P (op0)
8997 op0 = force_reg (mode2, op0);
8999 /* Otherwise, if this is a constant, try to force it to the constant
9000 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9001 is a legitimate constant. */
9002 else if (CONSTANT_P (op0) && (memloc = force_const_mem (mode2, op0)))
9003 op0 = validize_mem (memloc);
9005 /* Otherwise, if this is a constant or the object is not in memory
9006 and need be, put it there. */
9007 else if (CONSTANT_P (op0) || (!MEM_P (op0) && must_force_mem))
9009 tree nt = build_qualified_type (TREE_TYPE (tem),
9010 (TYPE_QUALS (TREE_TYPE (tem))
9011 | TYPE_QUAL_CONST));
9012 memloc = assign_temp (nt, 1, 1, 1);
9013 emit_move_insn (memloc, op0);
9019 enum machine_mode address_mode;
9020 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
9023 gcc_assert (MEM_P (op0));
9026 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (op0));
9027 if (GET_MODE (offset_rtx) != address_mode)
9028 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
9030 if (GET_MODE (op0) == BLKmode
9031 /* A constant address in OP0 can have VOIDmode, we must
9032 not try to call force_reg in that case. */
9033 && GET_MODE (XEXP (op0, 0)) != VOIDmode
9035 && (bitpos % bitsize) == 0
9036 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
9037 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
9039 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9043 op0 = offset_address (op0, offset_rtx,
9044 highest_pow2_factor (offset));
9047 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9048 record its alignment as BIGGEST_ALIGNMENT. */
9049 if (MEM_P (op0) && bitpos == 0 && offset != 0
9050 && is_aligning_offset (offset, tem))
9051 set_mem_align (op0, BIGGEST_ALIGNMENT);
9053 /* Don't forget about volatility even if this is a bitfield. */
9054 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
9056 if (op0 == orig_op0)
9057 op0 = copy_rtx (op0);
9059 MEM_VOLATILE_P (op0) = 1;
9062 /* In cases where an aligned union has an unaligned object
9063 as a field, we might be extracting a BLKmode value from
9064 an integer-mode (e.g., SImode) object. Handle this case
9065 by doing the extract into an object as wide as the field
9066 (which we know to be the width of a basic mode), then
9067 storing into memory, and changing the mode to BLKmode. */
9068 if (mode1 == VOIDmode
9069 || REG_P (op0) || GET_CODE (op0) == SUBREG
9070 || (mode1 != BLKmode && ! direct_load[(int) mode1]
9071 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
9072 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
9073 && modifier != EXPAND_CONST_ADDRESS
9074 && modifier != EXPAND_INITIALIZER)
9075 /* If the field isn't aligned enough to fetch as a memref,
9076 fetch it as a bit field. */
9077 || (mode1 != BLKmode
9078 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
9079 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
9081 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
9082 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
9083 && ((modifier == EXPAND_CONST_ADDRESS
9084 || modifier == EXPAND_INITIALIZER)
9086 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
9087 || (bitpos % BITS_PER_UNIT != 0)))
9088 /* If the type and the field are a constant size and the
9089 size of the type isn't the same size as the bitfield,
9090 we must use bitfield operations. */
9092 && TYPE_SIZE (TREE_TYPE (exp))
9093 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9094 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
9097 enum machine_mode ext_mode = mode;
9099 if (ext_mode == BLKmode
9100 && ! (target != 0 && MEM_P (op0)
9102 && bitpos % BITS_PER_UNIT == 0))
9103 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
9105 if (ext_mode == BLKmode)
9108 target = assign_temp (type, 0, 1, 1);
9113 /* In this case, BITPOS must start at a byte boundary and
9114 TARGET, if specified, must be a MEM. */
9115 gcc_assert (MEM_P (op0)
9116 && (!target || MEM_P (target))
9117 && !(bitpos % BITS_PER_UNIT));
9119 emit_block_move (target,
9120 adjust_address (op0, VOIDmode,
9121 bitpos / BITS_PER_UNIT),
9122 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
9124 (modifier == EXPAND_STACK_PARM
9125 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9130 op0 = validize_mem (op0);
9132 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
9133 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9135 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp,
9136 (modifier == EXPAND_STACK_PARM
9137 ? NULL_RTX : target),
9138 ext_mode, ext_mode);
9140 /* If the result is a record type and BITSIZE is narrower than
9141 the mode of OP0, an integral mode, and this is a big endian
9142 machine, we must put the field into the high-order bits. */
9143 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
9144 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
9145 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
9146 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
9147 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
9151 /* If the result type is BLKmode, store the data into a temporary
9152 of the appropriate type, but with the mode corresponding to the
9153 mode for the data we have (op0's mode). It's tempting to make
9154 this a constant type, since we know it's only being stored once,
9155 but that can cause problems if we are taking the address of this
9156 COMPONENT_REF because the MEM of any reference via that address
9157 will have flags corresponding to the type, which will not
9158 necessarily be constant. */
9159 if (mode == BLKmode)
9161 HOST_WIDE_INT size = GET_MODE_BITSIZE (ext_mode);
9164 /* If the reference doesn't use the alias set of its type,
9165 we cannot create the temporary using that type. */
9166 if (component_uses_parent_alias_set (exp))
9168 new_rtx = assign_stack_local (ext_mode, size, 0);
9169 set_mem_alias_set (new_rtx, get_alias_set (exp));
9172 new_rtx = assign_stack_temp_for_type (ext_mode, size, 0, type);
9174 emit_move_insn (new_rtx, op0);
9175 op0 = copy_rtx (new_rtx);
9176 PUT_MODE (op0, BLKmode);
9177 set_mem_attributes (op0, exp, 1);
9183 /* If the result is BLKmode, use that to access the object
9185 if (mode == BLKmode)
9188 /* Get a reference to just this component. */
9189 if (modifier == EXPAND_CONST_ADDRESS
9190 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
9191 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
9193 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9195 if (op0 == orig_op0)
9196 op0 = copy_rtx (op0);
9198 set_mem_attributes (op0, exp, 0);
9199 if (REG_P (XEXP (op0, 0)))
9200 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9202 MEM_VOLATILE_P (op0) |= volatilep;
9203 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
9204 || modifier == EXPAND_CONST_ADDRESS
9205 || modifier == EXPAND_INITIALIZER)
9207 else if (target == 0)
9208 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9210 convert_move (target, op0, unsignedp);
9215 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
9218 /* All valid uses of __builtin_va_arg_pack () are removed during
9220 if (CALL_EXPR_VA_ARG_PACK (exp))
9221 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
9223 tree fndecl = get_callee_fndecl (exp), attr;
9226 && (attr = lookup_attribute ("error",
9227 DECL_ATTRIBUTES (fndecl))) != NULL)
9228 error ("%Kcall to %qs declared with attribute error: %s",
9229 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9230 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9232 && (attr = lookup_attribute ("warning",
9233 DECL_ATTRIBUTES (fndecl))) != NULL)
9234 warning_at (tree_nonartificial_location (exp),
9235 0, "%Kcall to %qs declared with attribute warning: %s",
9236 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9237 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9239 /* Check for a built-in function. */
9240 if (fndecl && DECL_BUILT_IN (fndecl))
9242 gcc_assert (DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_FRONTEND);
9243 return expand_builtin (exp, target, subtarget, tmode, ignore);
9246 return expand_call (exp, target, ignore);
9248 case VIEW_CONVERT_EXPR:
9251 /* If we are converting to BLKmode, try to avoid an intermediate
9252 temporary by fetching an inner memory reference. */
9254 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9255 && TYPE_MODE (TREE_TYPE (treeop0)) != BLKmode
9256 && handled_component_p (treeop0))
9258 enum machine_mode mode1;
9259 HOST_WIDE_INT bitsize, bitpos;
9264 = get_inner_reference (treeop0, &bitsize, &bitpos,
9265 &offset, &mode1, &unsignedp, &volatilep,
9269 /* ??? We should work harder and deal with non-zero offsets. */
9271 && (bitpos % BITS_PER_UNIT) == 0
9273 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) == 0)
9275 /* See the normal_inner_ref case for the rationale. */
9278 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9279 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9281 && modifier != EXPAND_STACK_PARM
9282 ? target : NULL_RTX),
9284 (modifier == EXPAND_INITIALIZER
9285 || modifier == EXPAND_CONST_ADDRESS
9286 || modifier == EXPAND_STACK_PARM)
9287 ? modifier : EXPAND_NORMAL);
9289 if (MEM_P (orig_op0))
9293 /* Get a reference to just this component. */
9294 if (modifier == EXPAND_CONST_ADDRESS
9295 || modifier == EXPAND_SUM
9296 || modifier == EXPAND_INITIALIZER)
9297 op0 = adjust_address_nv (op0, mode, bitpos / BITS_PER_UNIT);
9299 op0 = adjust_address (op0, mode, bitpos / BITS_PER_UNIT);
9301 if (op0 == orig_op0)
9302 op0 = copy_rtx (op0);
9304 set_mem_attributes (op0, treeop0, 0);
9305 if (REG_P (XEXP (op0, 0)))
9306 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9308 MEM_VOLATILE_P (op0) |= volatilep;
9314 op0 = expand_expr (treeop0,
9315 NULL_RTX, VOIDmode, modifier);
9317 /* If the input and output modes are both the same, we are done. */
9318 if (mode == GET_MODE (op0))
9320 /* If neither mode is BLKmode, and both modes are the same size
9321 then we can use gen_lowpart. */
9322 else if (mode != BLKmode && GET_MODE (op0) != BLKmode
9323 && GET_MODE_SIZE (mode) == GET_MODE_SIZE (GET_MODE (op0))
9324 && !COMPLEX_MODE_P (GET_MODE (op0)))
9326 if (GET_CODE (op0) == SUBREG)
9327 op0 = force_reg (GET_MODE (op0), op0);
9328 op0 = gen_lowpart (mode, op0);
9330 /* If both modes are integral, then we can convert from one to the
9332 else if (SCALAR_INT_MODE_P (GET_MODE (op0)) && SCALAR_INT_MODE_P (mode))
9333 op0 = convert_modes (mode, GET_MODE (op0), op0,
9334 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
9335 /* As a last resort, spill op0 to memory, and reload it in a
9337 else if (!MEM_P (op0))
9339 /* If the operand is not a MEM, force it into memory. Since we
9340 are going to be changing the mode of the MEM, don't call
9341 force_const_mem for constants because we don't allow pool
9342 constants to change mode. */
9343 tree inner_type = TREE_TYPE (treeop0);
9345 gcc_assert (!TREE_ADDRESSABLE (exp));
9347 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
9349 = assign_stack_temp_for_type
9350 (TYPE_MODE (inner_type),
9351 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
9353 emit_move_insn (target, op0);
9357 /* At this point, OP0 is in the correct mode. If the output type is
9358 such that the operand is known to be aligned, indicate that it is.
9359 Otherwise, we need only be concerned about alignment for non-BLKmode
9363 op0 = copy_rtx (op0);
9365 if (TYPE_ALIGN_OK (type))
9366 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
9367 else if (STRICT_ALIGNMENT
9369 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode))
9371 tree inner_type = TREE_TYPE (treeop0);
9372 HOST_WIDE_INT temp_size
9373 = MAX (int_size_in_bytes (inner_type),
9374 (HOST_WIDE_INT) GET_MODE_SIZE (mode));
9376 = assign_stack_temp_for_type (mode, temp_size, 0, type);
9377 rtx new_with_op0_mode
9378 = adjust_address (new_rtx, GET_MODE (op0), 0);
9380 gcc_assert (!TREE_ADDRESSABLE (exp));
9382 if (GET_MODE (op0) == BLKmode)
9383 emit_block_move (new_with_op0_mode, op0,
9384 GEN_INT (GET_MODE_SIZE (mode)),
9385 (modifier == EXPAND_STACK_PARM
9386 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9388 emit_move_insn (new_with_op0_mode, op0);
9393 op0 = adjust_address (op0, mode, 0);
9398 /* Use a compare and a jump for BLKmode comparisons, or for function
9399 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
9401 /* Although TRUTH_{AND,OR}IF_EXPR aren't present in GIMPLE, they
9402 are occassionally created by folding during expansion. */
9403 case TRUTH_ANDIF_EXPR:
9404 case TRUTH_ORIF_EXPR:
9407 || modifier == EXPAND_STACK_PARM
9408 || ! safe_from_p (target, treeop0, 1)
9409 || ! safe_from_p (target, treeop1, 1)
9410 /* Make sure we don't have a hard reg (such as function's return
9411 value) live across basic blocks, if not optimizing. */
9412 || (!optimize && REG_P (target)
9413 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
9414 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9417 emit_move_insn (target, const0_rtx);
9419 op1 = gen_label_rtx ();
9420 jumpifnot_1 (code, treeop0, treeop1, op1);
9423 emit_move_insn (target, const1_rtx);
9426 return ignore ? const0_rtx : target;
9428 case STATEMENT_LIST:
9430 tree_stmt_iterator iter;
9432 gcc_assert (ignore);
9434 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
9435 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
9440 /* A COND_EXPR with its type being VOID_TYPE represents a
9441 conditional jump and is handled in
9442 expand_gimple_cond_expr. */
9443 gcc_assert (!VOID_TYPE_P (type));
9445 /* Note that COND_EXPRs whose type is a structure or union
9446 are required to be constructed to contain assignments of
9447 a temporary variable, so that we can evaluate them here
9448 for side effect only. If type is void, we must do likewise. */
9450 gcc_assert (!TREE_ADDRESSABLE (type)
9452 && TREE_TYPE (treeop1) != void_type_node
9453 && TREE_TYPE (treeop2) != void_type_node);
9455 /* If we are not to produce a result, we have no target. Otherwise,
9456 if a target was specified use it; it will not be used as an
9457 intermediate target unless it is safe. If no target, use a
9460 if (modifier != EXPAND_STACK_PARM
9462 && safe_from_p (original_target, treeop0, 1)
9463 && GET_MODE (original_target) == mode
9464 #ifdef HAVE_conditional_move
9465 && (! can_conditionally_move_p (mode)
9466 || REG_P (original_target))
9468 && !MEM_P (original_target))
9469 temp = original_target;
9471 temp = assign_temp (type, 0, 0, 1);
9473 do_pending_stack_adjust ();
9475 op0 = gen_label_rtx ();
9476 op1 = gen_label_rtx ();
9477 jumpifnot (treeop0, op0);
9478 store_expr (treeop1, temp,
9479 modifier == EXPAND_STACK_PARM,
9482 emit_jump_insn (gen_jump (op1));
9485 store_expr (treeop2, temp,
9486 modifier == EXPAND_STACK_PARM,
9494 target = expand_vec_cond_expr (type, treeop0, treeop1, treeop2, target);
9501 gcc_assert (ignore);
9503 /* Check for |= or &= of a bitfield of size one into another bitfield
9504 of size 1. In this case, (unless we need the result of the
9505 assignment) we can do this more efficiently with a
9506 test followed by an assignment, if necessary.
9508 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9509 things change so we do, this code should be enhanced to
9511 if (TREE_CODE (lhs) == COMPONENT_REF
9512 && (TREE_CODE (rhs) == BIT_IOR_EXPR
9513 || TREE_CODE (rhs) == BIT_AND_EXPR)
9514 && TREE_OPERAND (rhs, 0) == lhs
9515 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
9516 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
9517 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
9519 rtx label = gen_label_rtx ();
9520 int value = TREE_CODE (rhs) == BIT_IOR_EXPR;
9521 do_jump (TREE_OPERAND (rhs, 1),
9524 expand_assignment (lhs, build_int_cst (TREE_TYPE (rhs), value),
9525 MOVE_NONTEMPORAL (exp));
9526 do_pending_stack_adjust ();
9531 expand_assignment (lhs, rhs, MOVE_NONTEMPORAL (exp));
9536 return expand_expr_addr_expr (exp, target, tmode, modifier);
9539 op0 = expand_normal (treeop0);
9540 return read_complex_part (op0, false);
9543 op0 = expand_normal (treeop0);
9544 return read_complex_part (op0, true);
9551 /* Expanded in cfgexpand.c. */
9554 case TRY_CATCH_EXPR:
9556 case EH_FILTER_EXPR:
9557 case TRY_FINALLY_EXPR:
9558 /* Lowered by tree-eh.c. */
9561 case WITH_CLEANUP_EXPR:
9562 case CLEANUP_POINT_EXPR:
9564 case CASE_LABEL_EXPR:
9570 case PREINCREMENT_EXPR:
9571 case PREDECREMENT_EXPR:
9572 case POSTINCREMENT_EXPR:
9573 case POSTDECREMENT_EXPR:
9576 /* Lowered by gimplify.c. */
9580 /* Function descriptors are not valid except for as
9581 initialization constants, and should not be expanded. */
9584 case WITH_SIZE_EXPR:
9585 /* WITH_SIZE_EXPR expands to its first argument. The caller should
9586 have pulled out the size to use in whatever context it needed. */
9587 return expand_expr_real (treeop0, original_target, tmode,
9590 case REALIGN_LOAD_EXPR:
9592 tree oprnd0 = treeop0;
9593 tree oprnd1 = treeop1;
9594 tree oprnd2 = treeop2;
9597 this_optab = optab_for_tree_code (code, type, optab_default);
9598 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
9599 op2 = expand_normal (oprnd2);
9600 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
9608 tree oprnd0 = treeop0;
9609 tree oprnd1 = treeop1;
9610 tree oprnd2 = treeop2;
9613 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
9614 op2 = expand_normal (oprnd2);
9615 target = expand_widen_pattern_expr (&ops, op0, op1, op2,
9620 case COMPOUND_LITERAL_EXPR:
9622 /* Initialize the anonymous variable declared in the compound
9623 literal, then return the variable. */
9624 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
9626 /* Create RTL for this variable. */
9627 if (!DECL_RTL_SET_P (decl))
9629 if (DECL_HARD_REGISTER (decl))
9630 /* The user specified an assembler name for this variable.
9632 rest_of_decl_compilation (decl, 0, 0);
9637 return expand_expr_real (decl, original_target, tmode,
9642 return expand_expr_real_2 (&ops, target, tmode, modifier);
9646 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
9647 signedness of TYPE), possibly returning the result in TARGET. */
9649 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
9651 HOST_WIDE_INT prec = TYPE_PRECISION (type);
9652 if (target && GET_MODE (target) != GET_MODE (exp))
9654 /* For constant values, reduce using build_int_cst_type. */
9655 if (CONST_INT_P (exp))
9657 HOST_WIDE_INT value = INTVAL (exp);
9658 tree t = build_int_cst_type (type, value);
9659 return expand_expr (t, target, VOIDmode, EXPAND_NORMAL);
9661 else if (TYPE_UNSIGNED (type))
9664 if (prec < HOST_BITS_PER_WIDE_INT)
9665 mask = immed_double_const (((unsigned HOST_WIDE_INT) 1 << prec) - 1, 0,
9668 mask = immed_double_const ((unsigned HOST_WIDE_INT) -1,
9669 ((unsigned HOST_WIDE_INT) 1
9670 << (prec - HOST_BITS_PER_WIDE_INT)) - 1,
9672 return expand_and (GET_MODE (exp), exp, mask, target);
9676 tree count = build_int_cst (NULL_TREE,
9677 GET_MODE_BITSIZE (GET_MODE (exp)) - prec);
9678 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9679 return expand_shift (RSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9683 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9684 when applied to the address of EXP produces an address known to be
9685 aligned more than BIGGEST_ALIGNMENT. */
9688 is_aligning_offset (const_tree offset, const_tree exp)
9690 /* Strip off any conversions. */
9691 while (CONVERT_EXPR_P (offset))
9692 offset = TREE_OPERAND (offset, 0);
9694 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9695 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9696 if (TREE_CODE (offset) != BIT_AND_EXPR
9697 || !host_integerp (TREE_OPERAND (offset, 1), 1)
9698 || compare_tree_int (TREE_OPERAND (offset, 1),
9699 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
9700 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
9703 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9704 It must be NEGATE_EXPR. Then strip any more conversions. */
9705 offset = TREE_OPERAND (offset, 0);
9706 while (CONVERT_EXPR_P (offset))
9707 offset = TREE_OPERAND (offset, 0);
9709 if (TREE_CODE (offset) != NEGATE_EXPR)
9712 offset = TREE_OPERAND (offset, 0);
9713 while (CONVERT_EXPR_P (offset))
9714 offset = TREE_OPERAND (offset, 0);
9716 /* This must now be the address of EXP. */
9717 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
9720 /* Return the tree node if an ARG corresponds to a string constant or zero
9721 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
9722 in bytes within the string that ARG is accessing. The type of the
9723 offset will be `sizetype'. */
9726 string_constant (tree arg, tree *ptr_offset)
9728 tree array, offset, lower_bound;
9731 if (TREE_CODE (arg) == ADDR_EXPR)
9733 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
9735 *ptr_offset = size_zero_node;
9736 return TREE_OPERAND (arg, 0);
9738 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
9740 array = TREE_OPERAND (arg, 0);
9741 offset = size_zero_node;
9743 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
9745 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
9746 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
9747 if (TREE_CODE (array) != STRING_CST
9748 && TREE_CODE (array) != VAR_DECL)
9751 /* Check if the array has a nonzero lower bound. */
9752 lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
9753 if (!integer_zerop (lower_bound))
9755 /* If the offset and base aren't both constants, return 0. */
9756 if (TREE_CODE (lower_bound) != INTEGER_CST)
9758 if (TREE_CODE (offset) != INTEGER_CST)
9760 /* Adjust offset by the lower bound. */
9761 offset = size_diffop (fold_convert (sizetype, offset),
9762 fold_convert (sizetype, lower_bound));
9768 else if (TREE_CODE (arg) == PLUS_EXPR || TREE_CODE (arg) == POINTER_PLUS_EXPR)
9770 tree arg0 = TREE_OPERAND (arg, 0);
9771 tree arg1 = TREE_OPERAND (arg, 1);
9776 if (TREE_CODE (arg0) == ADDR_EXPR
9777 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
9778 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
9780 array = TREE_OPERAND (arg0, 0);
9783 else if (TREE_CODE (arg1) == ADDR_EXPR
9784 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
9785 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
9787 array = TREE_OPERAND (arg1, 0);
9796 if (TREE_CODE (array) == STRING_CST)
9798 *ptr_offset = fold_convert (sizetype, offset);
9801 else if (TREE_CODE (array) == VAR_DECL)
9805 /* Variables initialized to string literals can be handled too. */
9806 if (DECL_INITIAL (array) == NULL_TREE
9807 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
9810 /* If they are read-only, non-volatile and bind locally. */
9811 if (! TREE_READONLY (array)
9812 || TREE_SIDE_EFFECTS (array)
9813 || ! targetm.binds_local_p (array))
9816 /* Avoid const char foo[4] = "abcde"; */
9817 if (DECL_SIZE_UNIT (array) == NULL_TREE
9818 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
9819 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
9820 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
9823 /* If variable is bigger than the string literal, OFFSET must be constant
9824 and inside of the bounds of the string literal. */
9825 offset = fold_convert (sizetype, offset);
9826 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
9827 && (! host_integerp (offset, 1)
9828 || compare_tree_int (offset, length) >= 0))
9831 *ptr_offset = offset;
9832 return DECL_INITIAL (array);
9838 /* Generate code to calculate OPS, and exploded expression
9839 using a store-flag instruction and return an rtx for the result.
9840 OPS reflects a comparison.
9842 If TARGET is nonzero, store the result there if convenient.
9844 Return zero if there is no suitable set-flag instruction
9845 available on this machine.
9847 Once expand_expr has been called on the arguments of the comparison,
9848 we are committed to doing the store flag, since it is not safe to
9849 re-evaluate the expression. We emit the store-flag insn by calling
9850 emit_store_flag, but only expand the arguments if we have a reason
9851 to believe that emit_store_flag will be successful. If we think that
9852 it will, but it isn't, we have to simulate the store-flag with a
9853 set/jump/set sequence. */
9856 do_store_flag (sepops ops, rtx target, enum machine_mode mode)
9859 tree arg0, arg1, type;
9861 enum machine_mode operand_mode;
9864 rtx subtarget = target;
9865 location_t loc = ops->location;
9870 /* Don't crash if the comparison was erroneous. */
9871 if (arg0 == error_mark_node || arg1 == error_mark_node)
9874 type = TREE_TYPE (arg0);
9875 operand_mode = TYPE_MODE (type);
9876 unsignedp = TYPE_UNSIGNED (type);
9878 /* We won't bother with BLKmode store-flag operations because it would mean
9879 passing a lot of information to emit_store_flag. */
9880 if (operand_mode == BLKmode)
9883 /* We won't bother with store-flag operations involving function pointers
9884 when function pointers must be canonicalized before comparisons. */
9885 #ifdef HAVE_canonicalize_funcptr_for_compare
9886 if (HAVE_canonicalize_funcptr_for_compare
9887 && ((TREE_CODE (TREE_TYPE (arg0)) == POINTER_TYPE
9888 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0)))
9890 || (TREE_CODE (TREE_TYPE (arg1)) == POINTER_TYPE
9891 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1)))
9892 == FUNCTION_TYPE))))
9899 /* Get the rtx comparison code to use. We know that EXP is a comparison
9900 operation of some type. Some comparisons against 1 and -1 can be
9901 converted to comparisons with zero. Do so here so that the tests
9902 below will be aware that we have a comparison with zero. These
9903 tests will not catch constants in the first operand, but constants
9904 are rarely passed as the first operand. */
9915 if (integer_onep (arg1))
9916 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
9918 code = unsignedp ? LTU : LT;
9921 if (! unsignedp && integer_all_onesp (arg1))
9922 arg1 = integer_zero_node, code = LT;
9924 code = unsignedp ? LEU : LE;
9927 if (! unsignedp && integer_all_onesp (arg1))
9928 arg1 = integer_zero_node, code = GE;
9930 code = unsignedp ? GTU : GT;
9933 if (integer_onep (arg1))
9934 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
9936 code = unsignedp ? GEU : GE;
9939 case UNORDERED_EXPR:
9968 /* Put a constant second. */
9969 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST
9970 || TREE_CODE (arg0) == FIXED_CST)
9972 tem = arg0; arg0 = arg1; arg1 = tem;
9973 code = swap_condition (code);
9976 /* If this is an equality or inequality test of a single bit, we can
9977 do this by shifting the bit being tested to the low-order bit and
9978 masking the result with the constant 1. If the condition was EQ,
9979 we xor it with 1. This does not require an scc insn and is faster
9980 than an scc insn even if we have it.
9982 The code to make this transformation was moved into fold_single_bit_test,
9983 so we just call into the folder and expand its result. */
9985 if ((code == NE || code == EQ)
9986 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
9987 && integer_pow2p (TREE_OPERAND (arg0, 1)))
9989 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
9990 return expand_expr (fold_single_bit_test (loc,
9991 code == NE ? NE_EXPR : EQ_EXPR,
9993 target, VOIDmode, EXPAND_NORMAL);
9996 if (! get_subtarget (target)
9997 || GET_MODE (subtarget) != operand_mode)
10000 expand_operands (arg0, arg1, subtarget, &op0, &op1, EXPAND_NORMAL);
10003 target = gen_reg_rtx (mode);
10005 /* Try a cstore if possible. */
10006 return emit_store_flag_force (target, code, op0, op1,
10007 operand_mode, unsignedp, 1);
10011 /* Stubs in case we haven't got a casesi insn. */
10012 #ifndef HAVE_casesi
10013 # define HAVE_casesi 0
10014 # define gen_casesi(a, b, c, d, e) (0)
10015 # define CODE_FOR_casesi CODE_FOR_nothing
10018 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10019 0 otherwise (i.e. if there is no casesi instruction). */
10021 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
10022 rtx table_label ATTRIBUTE_UNUSED, rtx default_label,
10023 rtx fallback_label ATTRIBUTE_UNUSED)
10025 enum machine_mode index_mode = SImode;
10026 int index_bits = GET_MODE_BITSIZE (index_mode);
10027 rtx op1, op2, index;
10028 enum machine_mode op_mode;
10033 /* Convert the index to SImode. */
10034 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10036 enum machine_mode omode = TYPE_MODE (index_type);
10037 rtx rangertx = expand_normal (range);
10039 /* We must handle the endpoints in the original mode. */
10040 index_expr = build2 (MINUS_EXPR, index_type,
10041 index_expr, minval);
10042 minval = integer_zero_node;
10043 index = expand_normal (index_expr);
10045 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10046 omode, 1, default_label);
10047 /* Now we can safely truncate. */
10048 index = convert_to_mode (index_mode, index, 0);
10052 if (TYPE_MODE (index_type) != index_mode)
10054 index_type = lang_hooks.types.type_for_size (index_bits, 0);
10055 index_expr = fold_convert (index_type, index_expr);
10058 index = expand_normal (index_expr);
10061 do_pending_stack_adjust ();
10063 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
10064 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
10066 index = copy_to_mode_reg (op_mode, index);
10068 op1 = expand_normal (minval);
10070 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
10071 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
10072 op1, TYPE_UNSIGNED (TREE_TYPE (minval)));
10073 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
10075 op1 = copy_to_mode_reg (op_mode, op1);
10077 op2 = expand_normal (range);
10079 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
10080 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
10081 op2, TYPE_UNSIGNED (TREE_TYPE (range)));
10082 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
10084 op2 = copy_to_mode_reg (op_mode, op2);
10086 emit_jump_insn (gen_casesi (index, op1, op2,
10087 table_label, !default_label
10088 ? fallback_label : default_label));
10092 /* Attempt to generate a tablejump instruction; same concept. */
10093 #ifndef HAVE_tablejump
10094 #define HAVE_tablejump 0
10095 #define gen_tablejump(x, y) (0)
10098 /* Subroutine of the next function.
10100 INDEX is the value being switched on, with the lowest value
10101 in the table already subtracted.
10102 MODE is its expected mode (needed if INDEX is constant).
10103 RANGE is the length of the jump table.
10104 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10106 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10107 index value is out of range. */
10110 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
10115 if (INTVAL (range) > cfun->cfg->max_jumptable_ents)
10116 cfun->cfg->max_jumptable_ents = INTVAL (range);
10118 /* Do an unsigned comparison (in the proper mode) between the index
10119 expression and the value which represents the length of the range.
10120 Since we just finished subtracting the lower bound of the range
10121 from the index expression, this comparison allows us to simultaneously
10122 check that the original index expression value is both greater than
10123 or equal to the minimum value of the range and less than or equal to
10124 the maximum value of the range. */
10127 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10130 /* If index is in range, it must fit in Pmode.
10131 Convert to Pmode so we can index with it. */
10133 index = convert_to_mode (Pmode, index, 1);
10135 /* Don't let a MEM slip through, because then INDEX that comes
10136 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10137 and break_out_memory_refs will go to work on it and mess it up. */
10138 #ifdef PIC_CASE_VECTOR_ADDRESS
10139 if (flag_pic && !REG_P (index))
10140 index = copy_to_mode_reg (Pmode, index);
10143 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10144 GET_MODE_SIZE, because this indicates how large insns are. The other
10145 uses should all be Pmode, because they are addresses. This code
10146 could fail if addresses and insns are not the same size. */
10147 index = gen_rtx_PLUS (Pmode,
10148 gen_rtx_MULT (Pmode, index,
10149 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10150 gen_rtx_LABEL_REF (Pmode, table_label));
10151 #ifdef PIC_CASE_VECTOR_ADDRESS
10153 index = PIC_CASE_VECTOR_ADDRESS (index);
10156 index = memory_address (CASE_VECTOR_MODE, index);
10157 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10158 vector = gen_const_mem (CASE_VECTOR_MODE, index);
10159 convert_move (temp, vector, 0);
10161 emit_jump_insn (gen_tablejump (temp, table_label));
10163 /* If we are generating PIC code or if the table is PC-relative, the
10164 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10165 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10170 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
10171 rtx table_label, rtx default_label)
10175 if (! HAVE_tablejump)
10178 index_expr = fold_build2 (MINUS_EXPR, index_type,
10179 fold_convert (index_type, index_expr),
10180 fold_convert (index_type, minval));
10181 index = expand_normal (index_expr);
10182 do_pending_stack_adjust ();
10184 do_tablejump (index, TYPE_MODE (index_type),
10185 convert_modes (TYPE_MODE (index_type),
10186 TYPE_MODE (TREE_TYPE (range)),
10187 expand_normal (range),
10188 TYPE_UNSIGNED (TREE_TYPE (range))),
10189 table_label, default_label);
10193 /* Nonzero if the mode is a valid vector mode for this architecture.
10194 This returns nonzero even if there is no hardware support for the
10195 vector mode, but we can emulate with narrower modes. */
10198 vector_mode_valid_p (enum machine_mode mode)
10200 enum mode_class mclass = GET_MODE_CLASS (mode);
10201 enum machine_mode innermode;
10203 /* Doh! What's going on? */
10204 if (mclass != MODE_VECTOR_INT
10205 && mclass != MODE_VECTOR_FLOAT
10206 && mclass != MODE_VECTOR_FRACT
10207 && mclass != MODE_VECTOR_UFRACT
10208 && mclass != MODE_VECTOR_ACCUM
10209 && mclass != MODE_VECTOR_UACCUM)
10212 /* Hardware support. Woo hoo! */
10213 if (targetm.vector_mode_supported_p (mode))
10216 innermode = GET_MODE_INNER (mode);
10218 /* We should probably return 1 if requesting V4DI and we have no DI,
10219 but we have V2DI, but this is probably very unlikely. */
10221 /* If we have support for the inner mode, we can safely emulate it.
10222 We may not have V2DI, but me can emulate with a pair of DIs. */
10223 return targetm.scalar_mode_supported_p (innermode);
10226 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10228 const_vector_from_tree (tree exp)
10233 enum machine_mode inner, mode;
10235 mode = TYPE_MODE (TREE_TYPE (exp));
10237 if (initializer_zerop (exp))
10238 return CONST0_RTX (mode);
10240 units = GET_MODE_NUNITS (mode);
10241 inner = GET_MODE_INNER (mode);
10243 v = rtvec_alloc (units);
10245 link = TREE_VECTOR_CST_ELTS (exp);
10246 for (i = 0; link; link = TREE_CHAIN (link), ++i)
10248 elt = TREE_VALUE (link);
10250 if (TREE_CODE (elt) == REAL_CST)
10251 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
10253 else if (TREE_CODE (elt) == FIXED_CST)
10254 RTVEC_ELT (v, i) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt),
10257 RTVEC_ELT (v, i) = immed_double_const (TREE_INT_CST_LOW (elt),
10258 TREE_INT_CST_HIGH (elt),
10262 /* Initialize remaining elements to 0. */
10263 for (; i < units; ++i)
10264 RTVEC_ELT (v, i) = CONST0_RTX (inner);
10266 return gen_rtx_CONST_VECTOR (mode, v);
10270 /* Build a decl for a EH personality function named NAME. */
10273 build_personality_function (const char *name)
10277 type = build_function_type_list (integer_type_node, integer_type_node,
10278 long_long_unsigned_type_node,
10279 ptr_type_node, ptr_type_node, NULL_TREE);
10280 decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
10281 get_identifier (name), type);
10282 DECL_ARTIFICIAL (decl) = 1;
10283 DECL_EXTERNAL (decl) = 1;
10284 TREE_PUBLIC (decl) = 1;
10286 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
10287 are the flags assigned by targetm.encode_section_info. */
10288 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl), 0), NULL);
10293 /* Extracts the personality function of DECL and returns the corresponding
10297 get_personality_function (tree decl)
10299 tree personality = DECL_FUNCTION_PERSONALITY (decl);
10300 enum eh_personality_kind pk;
10302 pk = function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl));
10303 if (pk == eh_personality_none)
10307 && pk == eh_personality_any)
10308 personality = lang_hooks.eh_personality ();
10310 if (pk == eh_personality_lang)
10311 gcc_assert (personality != NULL_TREE);
10313 return XEXP (DECL_RTL (personality), 0);
10316 #include "gt-expr.h"