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));
1198 gcc_assert (MEM_P (x));
1199 gcc_assert (MEM_P (y));
1202 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1203 block copy is more efficient for other large modes, e.g. DCmode. */
1204 x = adjust_address (x, BLKmode, 0);
1205 y = adjust_address (y, BLKmode, 0);
1207 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1208 can be incorrect is coming from __builtin_memcpy. */
1209 if (CONST_INT_P (size))
1211 if (INTVAL (size) == 0)
1214 x = shallow_copy_rtx (x);
1215 y = shallow_copy_rtx (y);
1216 set_mem_size (x, size);
1217 set_mem_size (y, size);
1220 if (CONST_INT_P (size) && MOVE_BY_PIECES_P (INTVAL (size), align))
1221 move_by_pieces (x, y, INTVAL (size), align, 0);
1222 else if (emit_block_move_via_movmem (x, y, size, align,
1223 expected_align, expected_size))
1225 else if (may_use_call
1226 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (x))
1227 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (y)))
1228 retval = emit_block_move_via_libcall (x, y, size,
1229 method == BLOCK_OP_TAILCALL);
1231 emit_block_move_via_loop (x, y, size, align);
1233 if (method == BLOCK_OP_CALL_PARM)
1240 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1242 return emit_block_move_hints (x, y, size, method, 0, -1);
1245 /* A subroutine of emit_block_move. Returns true if calling the
1246 block move libcall will not clobber any parameters which may have
1247 already been placed on the stack. */
1250 block_move_libcall_safe_for_call_parm (void)
1252 #if defined (REG_PARM_STACK_SPACE)
1256 /* If arguments are pushed on the stack, then they're safe. */
1260 /* If registers go on the stack anyway, any argument is sure to clobber
1261 an outgoing argument. */
1262 #if defined (REG_PARM_STACK_SPACE)
1263 fn = emit_block_move_libcall_fn (false);
1264 if (OUTGOING_REG_PARM_STACK_SPACE ((!fn ? NULL_TREE : TREE_TYPE (fn)))
1265 && REG_PARM_STACK_SPACE (fn) != 0)
1269 /* If any argument goes in memory, then it might clobber an outgoing
1272 CUMULATIVE_ARGS args_so_far;
1275 fn = emit_block_move_libcall_fn (false);
1276 INIT_CUMULATIVE_ARGS (args_so_far, TREE_TYPE (fn), NULL_RTX, 0, 3);
1278 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1279 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1281 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1282 rtx tmp = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
1283 if (!tmp || !REG_P (tmp))
1285 if (targetm.calls.arg_partial_bytes (&args_so_far, mode, NULL, 1))
1287 FUNCTION_ARG_ADVANCE (args_so_far, mode, NULL_TREE, 1);
1293 /* A subroutine of emit_block_move. Expand a movmem pattern;
1294 return true if successful. */
1297 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align,
1298 unsigned int expected_align, HOST_WIDE_INT expected_size)
1300 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1301 int save_volatile_ok = volatile_ok;
1302 enum machine_mode mode;
1304 if (expected_align < align)
1305 expected_align = align;
1307 /* Since this is a move insn, we don't care about volatility. */
1310 /* Try the most limited insn first, because there's no point
1311 including more than one in the machine description unless
1312 the more limited one has some advantage. */
1314 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1315 mode = GET_MODE_WIDER_MODE (mode))
1317 enum insn_code code = movmem_optab[(int) mode];
1318 insn_operand_predicate_fn pred;
1320 if (code != CODE_FOR_nothing
1321 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1322 here because if SIZE is less than the mode mask, as it is
1323 returned by the macro, it will definitely be less than the
1324 actual mode mask. */
1325 && ((CONST_INT_P (size)
1326 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1327 <= (GET_MODE_MASK (mode) >> 1)))
1328 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1329 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1330 || (*pred) (x, BLKmode))
1331 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1332 || (*pred) (y, BLKmode))
1333 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1334 || (*pred) (opalign, VOIDmode)))
1337 rtx last = get_last_insn ();
1340 op2 = convert_to_mode (mode, size, 1);
1341 pred = insn_data[(int) code].operand[2].predicate;
1342 if (pred != 0 && ! (*pred) (op2, mode))
1343 op2 = copy_to_mode_reg (mode, op2);
1345 /* ??? When called via emit_block_move_for_call, it'd be
1346 nice if there were some way to inform the backend, so
1347 that it doesn't fail the expansion because it thinks
1348 emitting the libcall would be more efficient. */
1350 if (insn_data[(int) code].n_operands == 4)
1351 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1353 pat = GEN_FCN ((int) code) (x, y, op2, opalign,
1354 GEN_INT (expected_align
1356 GEN_INT (expected_size));
1360 volatile_ok = save_volatile_ok;
1364 delete_insns_since (last);
1368 volatile_ok = save_volatile_ok;
1372 /* A subroutine of emit_block_move. Expand a call to memcpy.
1373 Return the return value from memcpy, 0 otherwise. */
1376 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1378 rtx dst_addr, src_addr;
1379 tree call_expr, fn, src_tree, dst_tree, size_tree;
1380 enum machine_mode size_mode;
1383 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1384 pseudos. We can then place those new pseudos into a VAR_DECL and
1387 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1388 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1390 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1391 src_addr = convert_memory_address (ptr_mode, src_addr);
1393 dst_tree = make_tree (ptr_type_node, dst_addr);
1394 src_tree = make_tree (ptr_type_node, src_addr);
1396 size_mode = TYPE_MODE (sizetype);
1398 size = convert_to_mode (size_mode, size, 1);
1399 size = copy_to_mode_reg (size_mode, size);
1401 /* It is incorrect to use the libcall calling conventions to call
1402 memcpy in this context. This could be a user call to memcpy and
1403 the user may wish to examine the return value from memcpy. For
1404 targets where libcalls and normal calls have different conventions
1405 for returning pointers, we could end up generating incorrect code. */
1407 size_tree = make_tree (sizetype, size);
1409 fn = emit_block_move_libcall_fn (true);
1410 call_expr = build_call_expr (fn, 3, dst_tree, src_tree, size_tree);
1411 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1413 retval = expand_normal (call_expr);
1418 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1419 for the function we use for block copies. The first time FOR_CALL
1420 is true, we call assemble_external. */
1422 static GTY(()) tree block_move_fn;
1425 init_block_move_fn (const char *asmspec)
1431 fn = get_identifier ("memcpy");
1432 args = build_function_type_list (ptr_type_node, ptr_type_node,
1433 const_ptr_type_node, sizetype,
1436 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
1437 DECL_EXTERNAL (fn) = 1;
1438 TREE_PUBLIC (fn) = 1;
1439 DECL_ARTIFICIAL (fn) = 1;
1440 TREE_NOTHROW (fn) = 1;
1441 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
1442 DECL_VISIBILITY_SPECIFIED (fn) = 1;
1448 set_user_assembler_name (block_move_fn, asmspec);
1452 emit_block_move_libcall_fn (int for_call)
1454 static bool emitted_extern;
1457 init_block_move_fn (NULL);
1459 if (for_call && !emitted_extern)
1461 emitted_extern = true;
1462 make_decl_rtl (block_move_fn);
1463 assemble_external (block_move_fn);
1466 return block_move_fn;
1469 /* A subroutine of emit_block_move. Copy the data via an explicit
1470 loop. This is used only when libcalls are forbidden. */
1471 /* ??? It'd be nice to copy in hunks larger than QImode. */
1474 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1475 unsigned int align ATTRIBUTE_UNUSED)
1477 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1478 enum machine_mode x_addr_mode
1479 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (x));
1480 enum machine_mode y_addr_mode
1481 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (y));
1482 enum machine_mode iter_mode;
1484 iter_mode = GET_MODE (size);
1485 if (iter_mode == VOIDmode)
1486 iter_mode = word_mode;
1488 top_label = gen_label_rtx ();
1489 cmp_label = gen_label_rtx ();
1490 iter = gen_reg_rtx (iter_mode);
1492 emit_move_insn (iter, const0_rtx);
1494 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1495 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1496 do_pending_stack_adjust ();
1498 emit_jump (cmp_label);
1499 emit_label (top_label);
1501 tmp = convert_modes (x_addr_mode, iter_mode, iter, true);
1502 x_addr = gen_rtx_PLUS (x_addr_mode, x_addr, tmp);
1504 if (x_addr_mode != y_addr_mode)
1505 tmp = convert_modes (y_addr_mode, iter_mode, iter, true);
1506 y_addr = gen_rtx_PLUS (y_addr_mode, y_addr, tmp);
1508 x = change_address (x, QImode, x_addr);
1509 y = change_address (y, QImode, y_addr);
1511 emit_move_insn (x, y);
1513 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1514 true, OPTAB_LIB_WIDEN);
1516 emit_move_insn (iter, tmp);
1518 emit_label (cmp_label);
1520 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1524 /* Copy all or part of a value X into registers starting at REGNO.
1525 The number of registers to be filled is NREGS. */
1528 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1531 #ifdef HAVE_load_multiple
1539 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1540 x = validize_mem (force_const_mem (mode, x));
1542 /* See if the machine can do this with a load multiple insn. */
1543 #ifdef HAVE_load_multiple
1544 if (HAVE_load_multiple)
1546 last = get_last_insn ();
1547 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1555 delete_insns_since (last);
1559 for (i = 0; i < nregs; i++)
1560 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1561 operand_subword_force (x, i, mode));
1564 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1565 The number of registers to be filled is NREGS. */
1568 move_block_from_reg (int regno, rtx x, int nregs)
1575 /* See if the machine can do this with a store multiple insn. */
1576 #ifdef HAVE_store_multiple
1577 if (HAVE_store_multiple)
1579 rtx last = get_last_insn ();
1580 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1588 delete_insns_since (last);
1592 for (i = 0; i < nregs; i++)
1594 rtx tem = operand_subword (x, i, 1, BLKmode);
1598 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1602 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1603 ORIG, where ORIG is a non-consecutive group of registers represented by
1604 a PARALLEL. The clone is identical to the original except in that the
1605 original set of registers is replaced by a new set of pseudo registers.
1606 The new set has the same modes as the original set. */
1609 gen_group_rtx (rtx orig)
1614 gcc_assert (GET_CODE (orig) == PARALLEL);
1616 length = XVECLEN (orig, 0);
1617 tmps = XALLOCAVEC (rtx, length);
1619 /* Skip a NULL entry in first slot. */
1620 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1625 for (; i < length; i++)
1627 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1628 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1630 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1633 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1636 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1637 except that values are placed in TMPS[i], and must later be moved
1638 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1641 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1645 enum machine_mode m = GET_MODE (orig_src);
1647 gcc_assert (GET_CODE (dst) == PARALLEL);
1650 && !SCALAR_INT_MODE_P (m)
1651 && !MEM_P (orig_src)
1652 && GET_CODE (orig_src) != CONCAT)
1654 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1655 if (imode == BLKmode)
1656 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1658 src = gen_reg_rtx (imode);
1659 if (imode != BLKmode)
1660 src = gen_lowpart (GET_MODE (orig_src), src);
1661 emit_move_insn (src, orig_src);
1662 /* ...and back again. */
1663 if (imode != BLKmode)
1664 src = gen_lowpart (imode, src);
1665 emit_group_load_1 (tmps, dst, src, type, ssize);
1669 /* Check for a NULL entry, used to indicate that the parameter goes
1670 both on the stack and in registers. */
1671 if (XEXP (XVECEXP (dst, 0, 0), 0))
1676 /* Process the pieces. */
1677 for (i = start; i < XVECLEN (dst, 0); i++)
1679 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1680 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1681 unsigned int bytelen = GET_MODE_SIZE (mode);
1684 /* Handle trailing fragments that run over the size of the struct. */
1685 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1687 /* Arrange to shift the fragment to where it belongs.
1688 extract_bit_field loads to the lsb of the reg. */
1690 #ifdef BLOCK_REG_PADDING
1691 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1692 == (BYTES_BIG_ENDIAN ? upward : downward)
1697 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1698 bytelen = ssize - bytepos;
1699 gcc_assert (bytelen > 0);
1702 /* If we won't be loading directly from memory, protect the real source
1703 from strange tricks we might play; but make sure that the source can
1704 be loaded directly into the destination. */
1706 if (!MEM_P (orig_src)
1707 && (!CONSTANT_P (orig_src)
1708 || (GET_MODE (orig_src) != mode
1709 && GET_MODE (orig_src) != VOIDmode)))
1711 if (GET_MODE (orig_src) == VOIDmode)
1712 src = gen_reg_rtx (mode);
1714 src = gen_reg_rtx (GET_MODE (orig_src));
1716 emit_move_insn (src, orig_src);
1719 /* Optimize the access just a bit. */
1721 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1722 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1723 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1724 && bytelen == GET_MODE_SIZE (mode))
1726 tmps[i] = gen_reg_rtx (mode);
1727 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1729 else if (COMPLEX_MODE_P (mode)
1730 && GET_MODE (src) == mode
1731 && bytelen == GET_MODE_SIZE (mode))
1732 /* Let emit_move_complex do the bulk of the work. */
1734 else if (GET_CODE (src) == CONCAT)
1736 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1737 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1739 if ((bytepos == 0 && bytelen == slen0)
1740 || (bytepos != 0 && bytepos + bytelen <= slen))
1742 /* The following assumes that the concatenated objects all
1743 have the same size. In this case, a simple calculation
1744 can be used to determine the object and the bit field
1746 tmps[i] = XEXP (src, bytepos / slen0);
1747 if (! CONSTANT_P (tmps[i])
1748 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1749 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1750 (bytepos % slen0) * BITS_PER_UNIT,
1751 1, NULL_RTX, mode, mode);
1757 gcc_assert (!bytepos);
1758 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1759 emit_move_insn (mem, src);
1760 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1761 0, 1, NULL_RTX, mode, mode);
1764 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1765 SIMD register, which is currently broken. While we get GCC
1766 to emit proper RTL for these cases, let's dump to memory. */
1767 else if (VECTOR_MODE_P (GET_MODE (dst))
1770 int slen = GET_MODE_SIZE (GET_MODE (src));
1773 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1774 emit_move_insn (mem, src);
1775 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1777 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1778 && XVECLEN (dst, 0) > 1)
1779 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1780 else if (CONSTANT_P (src))
1782 HOST_WIDE_INT len = (HOST_WIDE_INT) bytelen;
1790 gcc_assert (2 * len == ssize);
1791 split_double (src, &first, &second);
1798 else if (REG_P (src) && GET_MODE (src) == mode)
1801 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1802 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
1806 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1807 build_int_cst (NULL_TREE, shift), tmps[i], 0);
1811 /* Emit code to move a block SRC of type TYPE to a block DST,
1812 where DST is non-consecutive registers represented by a PARALLEL.
1813 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1817 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1822 tmps = XALLOCAVEC (rtx, XVECLEN (dst, 0));
1823 emit_group_load_1 (tmps, dst, src, type, ssize);
1825 /* Copy the extracted pieces into the proper (probable) hard regs. */
1826 for (i = 0; i < XVECLEN (dst, 0); i++)
1828 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1831 emit_move_insn (d, tmps[i]);
1835 /* Similar, but load SRC into new pseudos in a format that looks like
1836 PARALLEL. This can later be fed to emit_group_move to get things
1837 in the right place. */
1840 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1845 vec = rtvec_alloc (XVECLEN (parallel, 0));
1846 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1848 /* Convert the vector to look just like the original PARALLEL, except
1849 with the computed values. */
1850 for (i = 0; i < XVECLEN (parallel, 0); i++)
1852 rtx e = XVECEXP (parallel, 0, i);
1853 rtx d = XEXP (e, 0);
1857 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1858 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1860 RTVEC_ELT (vec, i) = e;
1863 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1866 /* Emit code to move a block SRC to block DST, where SRC and DST are
1867 non-consecutive groups of registers, each represented by a PARALLEL. */
1870 emit_group_move (rtx dst, rtx src)
1874 gcc_assert (GET_CODE (src) == PARALLEL
1875 && GET_CODE (dst) == PARALLEL
1876 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1878 /* Skip first entry if NULL. */
1879 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1880 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1881 XEXP (XVECEXP (src, 0, i), 0));
1884 /* Move a group of registers represented by a PARALLEL into pseudos. */
1887 emit_group_move_into_temps (rtx src)
1889 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1892 for (i = 0; i < XVECLEN (src, 0); i++)
1894 rtx e = XVECEXP (src, 0, i);
1895 rtx d = XEXP (e, 0);
1898 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1899 RTVEC_ELT (vec, i) = e;
1902 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1905 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1906 where SRC is non-consecutive registers represented by a PARALLEL.
1907 SSIZE represents the total size of block ORIG_DST, or -1 if not
1911 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1914 int start, finish, i;
1915 enum machine_mode m = GET_MODE (orig_dst);
1917 gcc_assert (GET_CODE (src) == PARALLEL);
1919 if (!SCALAR_INT_MODE_P (m)
1920 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1922 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1923 if (imode == BLKmode)
1924 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1926 dst = gen_reg_rtx (imode);
1927 emit_group_store (dst, src, type, ssize);
1928 if (imode != BLKmode)
1929 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1930 emit_move_insn (orig_dst, dst);
1934 /* Check for a NULL entry, used to indicate that the parameter goes
1935 both on the stack and in registers. */
1936 if (XEXP (XVECEXP (src, 0, 0), 0))
1940 finish = XVECLEN (src, 0);
1942 tmps = XALLOCAVEC (rtx, finish);
1944 /* Copy the (probable) hard regs into pseudos. */
1945 for (i = start; i < finish; i++)
1947 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1948 if (!REG_P (reg) || REGNO (reg) < FIRST_PSEUDO_REGISTER)
1950 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1951 emit_move_insn (tmps[i], reg);
1957 /* If we won't be storing directly into memory, protect the real destination
1958 from strange tricks we might play. */
1960 if (GET_CODE (dst) == PARALLEL)
1964 /* We can get a PARALLEL dst if there is a conditional expression in
1965 a return statement. In that case, the dst and src are the same,
1966 so no action is necessary. */
1967 if (rtx_equal_p (dst, src))
1970 /* It is unclear if we can ever reach here, but we may as well handle
1971 it. Allocate a temporary, and split this into a store/load to/from
1974 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1975 emit_group_store (temp, src, type, ssize);
1976 emit_group_load (dst, temp, type, ssize);
1979 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1981 enum machine_mode outer = GET_MODE (dst);
1982 enum machine_mode inner;
1983 HOST_WIDE_INT bytepos;
1987 if (!REG_P (dst) || REGNO (dst) < FIRST_PSEUDO_REGISTER)
1988 dst = gen_reg_rtx (outer);
1990 /* Make life a bit easier for combine. */
1991 /* If the first element of the vector is the low part
1992 of the destination mode, use a paradoxical subreg to
1993 initialize the destination. */
1996 inner = GET_MODE (tmps[start]);
1997 bytepos = subreg_lowpart_offset (inner, outer);
1998 if (INTVAL (XEXP (XVECEXP (src, 0, start), 1)) == bytepos)
2000 temp = simplify_gen_subreg (outer, tmps[start],
2004 emit_move_insn (dst, temp);
2011 /* If the first element wasn't the low part, try the last. */
2013 && start < finish - 1)
2015 inner = GET_MODE (tmps[finish - 1]);
2016 bytepos = subreg_lowpart_offset (inner, outer);
2017 if (INTVAL (XEXP (XVECEXP (src, 0, finish - 1), 1)) == bytepos)
2019 temp = simplify_gen_subreg (outer, tmps[finish - 1],
2023 emit_move_insn (dst, temp);
2030 /* Otherwise, simply initialize the result to zero. */
2032 emit_move_insn (dst, CONST0_RTX (outer));
2035 /* Process the pieces. */
2036 for (i = start; i < finish; i++)
2038 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
2039 enum machine_mode mode = GET_MODE (tmps[i]);
2040 unsigned int bytelen = GET_MODE_SIZE (mode);
2041 unsigned int adj_bytelen = bytelen;
2044 /* Handle trailing fragments that run over the size of the struct. */
2045 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2046 adj_bytelen = ssize - bytepos;
2048 if (GET_CODE (dst) == CONCAT)
2050 if (bytepos + adj_bytelen
2051 <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2052 dest = XEXP (dst, 0);
2053 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
2055 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
2056 dest = XEXP (dst, 1);
2060 enum machine_mode dest_mode = GET_MODE (dest);
2061 enum machine_mode tmp_mode = GET_MODE (tmps[i]);
2063 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
2065 if (GET_MODE_ALIGNMENT (dest_mode)
2066 >= GET_MODE_ALIGNMENT (tmp_mode))
2068 dest = assign_stack_temp (dest_mode,
2069 GET_MODE_SIZE (dest_mode),
2071 emit_move_insn (adjust_address (dest,
2079 dest = assign_stack_temp (tmp_mode,
2080 GET_MODE_SIZE (tmp_mode),
2082 emit_move_insn (dest, tmps[i]);
2083 dst = adjust_address (dest, dest_mode, bytepos);
2089 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
2091 /* store_bit_field always takes its value from the lsb.
2092 Move the fragment to the lsb if it's not already there. */
2094 #ifdef BLOCK_REG_PADDING
2095 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
2096 == (BYTES_BIG_ENDIAN ? upward : downward)
2102 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
2103 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
2104 build_int_cst (NULL_TREE, shift),
2107 bytelen = adj_bytelen;
2110 /* Optimize the access just a bit. */
2112 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
2113 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
2114 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
2115 && bytelen == GET_MODE_SIZE (mode))
2116 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
2118 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
2122 /* Copy from the pseudo into the (probable) hard reg. */
2123 if (orig_dst != dst)
2124 emit_move_insn (orig_dst, dst);
2127 /* Generate code to copy a BLKmode object of TYPE out of a
2128 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2129 is null, a stack temporary is created. TGTBLK is returned.
2131 The purpose of this routine is to handle functions that return
2132 BLKmode structures in registers. Some machines (the PA for example)
2133 want to return all small structures in registers regardless of the
2134 structure's alignment. */
2137 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
2139 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
2140 rtx src = NULL, dst = NULL;
2141 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2142 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
2143 enum machine_mode copy_mode;
2147 tgtblk = assign_temp (build_qualified_type (type,
2149 | TYPE_QUAL_CONST)),
2151 preserve_temp_slots (tgtblk);
2154 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2155 into a new pseudo which is a full word. */
2157 if (GET_MODE (srcreg) != BLKmode
2158 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2159 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
2161 /* If the structure doesn't take up a whole number of words, see whether
2162 SRCREG is padded on the left or on the right. If it's on the left,
2163 set PADDING_CORRECTION to the number of bits to skip.
2165 In most ABIs, the structure will be returned at the least end of
2166 the register, which translates to right padding on little-endian
2167 targets and left padding on big-endian targets. The opposite
2168 holds if the structure is returned at the most significant
2169 end of the register. */
2170 if (bytes % UNITS_PER_WORD != 0
2171 && (targetm.calls.return_in_msb (type)
2173 : BYTES_BIG_ENDIAN))
2175 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2177 /* Copy the structure BITSIZE bits at a time. If the target lives in
2178 memory, take care of not reading/writing past its end by selecting
2179 a copy mode suited to BITSIZE. This should always be possible given
2182 We could probably emit more efficient code for machines which do not use
2183 strict alignment, but it doesn't seem worth the effort at the current
2186 copy_mode = word_mode;
2189 enum machine_mode mem_mode = mode_for_size (bitsize, MODE_INT, 1);
2190 if (mem_mode != BLKmode)
2191 copy_mode = mem_mode;
2194 for (bitpos = 0, xbitpos = padding_correction;
2195 bitpos < bytes * BITS_PER_UNIT;
2196 bitpos += bitsize, xbitpos += bitsize)
2198 /* We need a new source operand each time xbitpos is on a
2199 word boundary and when xbitpos == padding_correction
2200 (the first time through). */
2201 if (xbitpos % BITS_PER_WORD == 0
2202 || xbitpos == padding_correction)
2203 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2206 /* We need a new destination operand each time bitpos is on
2208 if (bitpos % BITS_PER_WORD == 0)
2209 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2211 /* Use xbitpos for the source extraction (right justified) and
2212 bitpos for the destination store (left justified). */
2213 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, copy_mode,
2214 extract_bit_field (src, bitsize,
2215 xbitpos % BITS_PER_WORD, 1,
2216 NULL_RTX, copy_mode, copy_mode));
2222 /* Add a USE expression for REG to the (possibly empty) list pointed
2223 to by CALL_FUSAGE. REG must denote a hard register. */
2226 use_reg (rtx *call_fusage, rtx reg)
2228 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2231 = gen_rtx_EXPR_LIST (VOIDmode,
2232 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2235 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2236 starting at REGNO. All of these registers must be hard registers. */
2239 use_regs (rtx *call_fusage, int regno, int nregs)
2243 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2245 for (i = 0; i < nregs; i++)
2246 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2249 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2250 PARALLEL REGS. This is for calls that pass values in multiple
2251 non-contiguous locations. The Irix 6 ABI has examples of this. */
2254 use_group_regs (rtx *call_fusage, rtx regs)
2258 for (i = 0; i < XVECLEN (regs, 0); i++)
2260 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2262 /* A NULL entry means the parameter goes both on the stack and in
2263 registers. This can also be a MEM for targets that pass values
2264 partially on the stack and partially in registers. */
2265 if (reg != 0 && REG_P (reg))
2266 use_reg (call_fusage, reg);
2270 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2271 assigment and the code of the expresion on the RHS is CODE. Return
2275 get_def_for_expr (tree name, enum tree_code code)
2279 if (TREE_CODE (name) != SSA_NAME)
2282 def_stmt = get_gimple_for_ssa_name (name);
2284 || gimple_assign_rhs_code (def_stmt) != code)
2291 /* Determine whether the LEN bytes generated by CONSTFUN can be
2292 stored to memory using several move instructions. CONSTFUNDATA is
2293 a pointer which will be passed as argument in every CONSTFUN call.
2294 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2295 a memset operation and false if it's a copy of a constant string.
2296 Return nonzero if a call to store_by_pieces should succeed. */
2299 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2300 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2301 void *constfundata, unsigned int align, bool memsetp)
2303 unsigned HOST_WIDE_INT l;
2304 unsigned int max_size;
2305 HOST_WIDE_INT offset = 0;
2306 enum machine_mode mode, tmode;
2307 enum insn_code icode;
2315 ? SET_BY_PIECES_P (len, align)
2316 : STORE_BY_PIECES_P (len, align)))
2319 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2320 if (align >= GET_MODE_ALIGNMENT (tmode))
2321 align = GET_MODE_ALIGNMENT (tmode);
2324 enum machine_mode xmode;
2326 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2328 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2329 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2330 || SLOW_UNALIGNED_ACCESS (tmode, align))
2333 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2336 /* We would first store what we can in the largest integer mode, then go to
2337 successively smaller modes. */
2340 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2345 max_size = STORE_MAX_PIECES + 1;
2346 while (max_size > 1)
2348 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2349 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2350 if (GET_MODE_SIZE (tmode) < max_size)
2353 if (mode == VOIDmode)
2356 icode = optab_handler (mov_optab, mode)->insn_code;
2357 if (icode != CODE_FOR_nothing
2358 && align >= GET_MODE_ALIGNMENT (mode))
2360 unsigned int size = GET_MODE_SIZE (mode);
2367 cst = (*constfun) (constfundata, offset, mode);
2368 if (!LEGITIMATE_CONSTANT_P (cst))
2378 max_size = GET_MODE_SIZE (mode);
2381 /* The code above should have handled everything. */
2388 /* Generate several move instructions to store LEN bytes generated by
2389 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2390 pointer which will be passed as argument in every CONSTFUN call.
2391 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2392 a memset operation and false if it's a copy of a constant string.
2393 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2394 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2398 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2399 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2400 void *constfundata, unsigned int align, bool memsetp, int endp)
2402 enum machine_mode to_addr_mode
2403 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to));
2404 struct store_by_pieces_d data;
2408 gcc_assert (endp != 2);
2413 ? SET_BY_PIECES_P (len, align)
2414 : STORE_BY_PIECES_P (len, align));
2415 data.constfun = constfun;
2416 data.constfundata = constfundata;
2419 store_by_pieces_1 (&data, align);
2424 gcc_assert (!data.reverse);
2429 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2430 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2432 data.to_addr = copy_to_mode_reg (to_addr_mode,
2433 plus_constant (data.to_addr,
2436 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2443 to1 = adjust_address (data.to, QImode, data.offset);
2451 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2452 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2455 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2457 struct store_by_pieces_d data;
2462 data.constfun = clear_by_pieces_1;
2463 data.constfundata = NULL;
2466 store_by_pieces_1 (&data, align);
2469 /* Callback routine for clear_by_pieces.
2470 Return const0_rtx unconditionally. */
2473 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2474 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2475 enum machine_mode mode ATTRIBUTE_UNUSED)
2480 /* Subroutine of clear_by_pieces and store_by_pieces.
2481 Generate several move instructions to store LEN bytes of block TO. (A MEM
2482 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2485 store_by_pieces_1 (struct store_by_pieces_d *data ATTRIBUTE_UNUSED,
2486 unsigned int align ATTRIBUTE_UNUSED)
2488 enum machine_mode to_addr_mode
2489 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (data->to));
2490 rtx to_addr = XEXP (data->to, 0);
2491 unsigned int max_size = STORE_MAX_PIECES + 1;
2492 enum machine_mode mode = VOIDmode, tmode;
2493 enum insn_code icode;
2496 data->to_addr = to_addr;
2498 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2499 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2501 data->explicit_inc_to = 0;
2503 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2505 data->offset = data->len;
2507 /* If storing requires more than two move insns,
2508 copy addresses to registers (to make displacements shorter)
2509 and use post-increment if available. */
2510 if (!data->autinc_to
2511 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2513 /* Determine the main mode we'll be using. */
2514 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2515 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2516 if (GET_MODE_SIZE (tmode) < max_size)
2519 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2521 data->to_addr = copy_to_mode_reg (to_addr_mode,
2522 plus_constant (to_addr, data->len));
2523 data->autinc_to = 1;
2524 data->explicit_inc_to = -1;
2527 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2528 && ! data->autinc_to)
2530 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2531 data->autinc_to = 1;
2532 data->explicit_inc_to = 1;
2535 if ( !data->autinc_to && CONSTANT_P (to_addr))
2536 data->to_addr = copy_to_mode_reg (to_addr_mode, to_addr);
2539 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2540 if (align >= GET_MODE_ALIGNMENT (tmode))
2541 align = GET_MODE_ALIGNMENT (tmode);
2544 enum machine_mode xmode;
2546 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2548 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2549 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2550 || SLOW_UNALIGNED_ACCESS (tmode, align))
2553 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2556 /* First store what we can in the largest integer mode, then go to
2557 successively smaller modes. */
2559 while (max_size > 1)
2561 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2562 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2563 if (GET_MODE_SIZE (tmode) < max_size)
2566 if (mode == VOIDmode)
2569 icode = optab_handler (mov_optab, mode)->insn_code;
2570 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2571 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2573 max_size = GET_MODE_SIZE (mode);
2576 /* The code above should have handled everything. */
2577 gcc_assert (!data->len);
2580 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2581 with move instructions for mode MODE. GENFUN is the gen_... function
2582 to make a move insn for that mode. DATA has all the other info. */
2585 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2586 struct store_by_pieces_d *data)
2588 unsigned int size = GET_MODE_SIZE (mode);
2591 while (data->len >= size)
2594 data->offset -= size;
2596 if (data->autinc_to)
2597 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2600 to1 = adjust_address (data->to, mode, data->offset);
2602 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2603 emit_insn (gen_add2_insn (data->to_addr,
2604 GEN_INT (-(HOST_WIDE_INT) size)));
2606 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2607 emit_insn ((*genfun) (to1, cst));
2609 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2610 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2612 if (! data->reverse)
2613 data->offset += size;
2619 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2620 its length in bytes. */
2623 clear_storage_hints (rtx object, rtx size, enum block_op_methods method,
2624 unsigned int expected_align, HOST_WIDE_INT expected_size)
2626 enum machine_mode mode = GET_MODE (object);
2629 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2631 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2632 just move a zero. Otherwise, do this a piece at a time. */
2634 && CONST_INT_P (size)
2635 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2637 rtx zero = CONST0_RTX (mode);
2640 emit_move_insn (object, zero);
2644 if (COMPLEX_MODE_P (mode))
2646 zero = CONST0_RTX (GET_MODE_INNER (mode));
2649 write_complex_part (object, zero, 0);
2650 write_complex_part (object, zero, 1);
2656 if (size == const0_rtx)
2659 align = MEM_ALIGN (object);
2661 if (CONST_INT_P (size)
2662 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2663 clear_by_pieces (object, INTVAL (size), align);
2664 else if (set_storage_via_setmem (object, size, const0_rtx, align,
2665 expected_align, expected_size))
2667 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object)))
2668 return set_storage_via_libcall (object, size, const0_rtx,
2669 method == BLOCK_OP_TAILCALL);
2677 clear_storage (rtx object, rtx size, enum block_op_methods method)
2679 return clear_storage_hints (object, size, method, 0, -1);
2683 /* A subroutine of clear_storage. Expand a call to memset.
2684 Return the return value of memset, 0 otherwise. */
2687 set_storage_via_libcall (rtx object, rtx size, rtx val, bool tailcall)
2689 tree call_expr, fn, object_tree, size_tree, val_tree;
2690 enum machine_mode size_mode;
2693 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2694 place those into new pseudos into a VAR_DECL and use them later. */
2696 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2698 size_mode = TYPE_MODE (sizetype);
2699 size = convert_to_mode (size_mode, size, 1);
2700 size = copy_to_mode_reg (size_mode, size);
2702 /* It is incorrect to use the libcall calling conventions to call
2703 memset in this context. This could be a user call to memset and
2704 the user may wish to examine the return value from memset. For
2705 targets where libcalls and normal calls have different conventions
2706 for returning pointers, we could end up generating incorrect code. */
2708 object_tree = make_tree (ptr_type_node, object);
2709 if (!CONST_INT_P (val))
2710 val = convert_to_mode (TYPE_MODE (integer_type_node), val, 1);
2711 size_tree = make_tree (sizetype, size);
2712 val_tree = make_tree (integer_type_node, val);
2714 fn = clear_storage_libcall_fn (true);
2715 call_expr = build_call_expr (fn, 3, object_tree, val_tree, size_tree);
2716 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2718 retval = expand_normal (call_expr);
2723 /* A subroutine of set_storage_via_libcall. Create the tree node
2724 for the function we use for block clears. The first time FOR_CALL
2725 is true, we call assemble_external. */
2727 tree block_clear_fn;
2730 init_block_clear_fn (const char *asmspec)
2732 if (!block_clear_fn)
2736 fn = get_identifier ("memset");
2737 args = build_function_type_list (ptr_type_node, ptr_type_node,
2738 integer_type_node, sizetype,
2741 fn = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL, fn, args);
2742 DECL_EXTERNAL (fn) = 1;
2743 TREE_PUBLIC (fn) = 1;
2744 DECL_ARTIFICIAL (fn) = 1;
2745 TREE_NOTHROW (fn) = 1;
2746 DECL_VISIBILITY (fn) = VISIBILITY_DEFAULT;
2747 DECL_VISIBILITY_SPECIFIED (fn) = 1;
2749 block_clear_fn = fn;
2753 set_user_assembler_name (block_clear_fn, asmspec);
2757 clear_storage_libcall_fn (int for_call)
2759 static bool emitted_extern;
2761 if (!block_clear_fn)
2762 init_block_clear_fn (NULL);
2764 if (for_call && !emitted_extern)
2766 emitted_extern = true;
2767 make_decl_rtl (block_clear_fn);
2768 assemble_external (block_clear_fn);
2771 return block_clear_fn;
2774 /* Expand a setmem pattern; return true if successful. */
2777 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align,
2778 unsigned int expected_align, HOST_WIDE_INT expected_size)
2780 /* Try the most limited insn first, because there's no point
2781 including more than one in the machine description unless
2782 the more limited one has some advantage. */
2784 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2785 enum machine_mode mode;
2787 if (expected_align < align)
2788 expected_align = align;
2790 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2791 mode = GET_MODE_WIDER_MODE (mode))
2793 enum insn_code code = setmem_optab[(int) mode];
2794 insn_operand_predicate_fn pred;
2796 if (code != CODE_FOR_nothing
2797 /* We don't need MODE to be narrower than
2798 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2799 the mode mask, as it is returned by the macro, it will
2800 definitely be less than the actual mode mask. */
2801 && ((CONST_INT_P (size)
2802 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2803 <= (GET_MODE_MASK (mode) >> 1)))
2804 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2805 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2806 || (*pred) (object, BLKmode))
2807 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
2808 || (*pred) (opalign, VOIDmode)))
2811 enum machine_mode char_mode;
2812 rtx last = get_last_insn ();
2815 opsize = convert_to_mode (mode, size, 1);
2816 pred = insn_data[(int) code].operand[1].predicate;
2817 if (pred != 0 && ! (*pred) (opsize, mode))
2818 opsize = copy_to_mode_reg (mode, opsize);
2821 char_mode = insn_data[(int) code].operand[2].mode;
2822 if (char_mode != VOIDmode)
2824 opchar = convert_to_mode (char_mode, opchar, 1);
2825 pred = insn_data[(int) code].operand[2].predicate;
2826 if (pred != 0 && ! (*pred) (opchar, char_mode))
2827 opchar = copy_to_mode_reg (char_mode, opchar);
2830 if (insn_data[(int) code].n_operands == 4)
2831 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign);
2833 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign,
2834 GEN_INT (expected_align
2836 GEN_INT (expected_size));
2843 delete_insns_since (last);
2851 /* Write to one of the components of the complex value CPLX. Write VAL to
2852 the real part if IMAG_P is false, and the imaginary part if its true. */
2855 write_complex_part (rtx cplx, rtx val, bool imag_p)
2857 enum machine_mode cmode;
2858 enum machine_mode imode;
2861 if (GET_CODE (cplx) == CONCAT)
2863 emit_move_insn (XEXP (cplx, imag_p), val);
2867 cmode = GET_MODE (cplx);
2868 imode = GET_MODE_INNER (cmode);
2869 ibitsize = GET_MODE_BITSIZE (imode);
2871 /* For MEMs simplify_gen_subreg may generate an invalid new address
2872 because, e.g., the original address is considered mode-dependent
2873 by the target, which restricts simplify_subreg from invoking
2874 adjust_address_nv. Instead of preparing fallback support for an
2875 invalid address, we call adjust_address_nv directly. */
2878 emit_move_insn (adjust_address_nv (cplx, imode,
2879 imag_p ? GET_MODE_SIZE (imode) : 0),
2884 /* If the sub-object is at least word sized, then we know that subregging
2885 will work. This special case is important, since store_bit_field
2886 wants to operate on integer modes, and there's rarely an OImode to
2887 correspond to TCmode. */
2888 if (ibitsize >= BITS_PER_WORD
2889 /* For hard regs we have exact predicates. Assume we can split
2890 the original object if it spans an even number of hard regs.
2891 This special case is important for SCmode on 64-bit platforms
2892 where the natural size of floating-point regs is 32-bit. */
2894 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2895 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2897 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2898 imag_p ? GET_MODE_SIZE (imode) : 0);
2901 emit_move_insn (part, val);
2905 /* simplify_gen_subreg may fail for sub-word MEMs. */
2906 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2909 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2912 /* Extract one of the components of the complex value CPLX. Extract the
2913 real part if IMAG_P is false, and the imaginary part if it's true. */
2916 read_complex_part (rtx cplx, bool imag_p)
2918 enum machine_mode cmode, imode;
2921 if (GET_CODE (cplx) == CONCAT)
2922 return XEXP (cplx, imag_p);
2924 cmode = GET_MODE (cplx);
2925 imode = GET_MODE_INNER (cmode);
2926 ibitsize = GET_MODE_BITSIZE (imode);
2928 /* Special case reads from complex constants that got spilled to memory. */
2929 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2931 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2932 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2934 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2935 if (CONSTANT_CLASS_P (part))
2936 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2940 /* For MEMs simplify_gen_subreg may generate an invalid new address
2941 because, e.g., the original address is considered mode-dependent
2942 by the target, which restricts simplify_subreg from invoking
2943 adjust_address_nv. Instead of preparing fallback support for an
2944 invalid address, we call adjust_address_nv directly. */
2946 return adjust_address_nv (cplx, imode,
2947 imag_p ? GET_MODE_SIZE (imode) : 0);
2949 /* If the sub-object is at least word sized, then we know that subregging
2950 will work. This special case is important, since extract_bit_field
2951 wants to operate on integer modes, and there's rarely an OImode to
2952 correspond to TCmode. */
2953 if (ibitsize >= BITS_PER_WORD
2954 /* For hard regs we have exact predicates. Assume we can split
2955 the original object if it spans an even number of hard regs.
2956 This special case is important for SCmode on 64-bit platforms
2957 where the natural size of floating-point regs is 32-bit. */
2959 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2960 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2962 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2963 imag_p ? GET_MODE_SIZE (imode) : 0);
2967 /* simplify_gen_subreg may fail for sub-word MEMs. */
2968 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2971 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2972 true, NULL_RTX, imode, imode);
2975 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2976 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2977 represented in NEW_MODE. If FORCE is true, this will never happen, as
2978 we'll force-create a SUBREG if needed. */
2981 emit_move_change_mode (enum machine_mode new_mode,
2982 enum machine_mode old_mode, rtx x, bool force)
2986 if (push_operand (x, GET_MODE (x)))
2988 ret = gen_rtx_MEM (new_mode, XEXP (x, 0));
2989 MEM_COPY_ATTRIBUTES (ret, x);
2993 /* We don't have to worry about changing the address since the
2994 size in bytes is supposed to be the same. */
2995 if (reload_in_progress)
2997 /* Copy the MEM to change the mode and move any
2998 substitutions from the old MEM to the new one. */
2999 ret = adjust_address_nv (x, new_mode, 0);
3000 copy_replacements (x, ret);
3003 ret = adjust_address (x, new_mode, 0);
3007 /* Note that we do want simplify_subreg's behavior of validating
3008 that the new mode is ok for a hard register. If we were to use
3009 simplify_gen_subreg, we would create the subreg, but would
3010 probably run into the target not being able to implement it. */
3011 /* Except, of course, when FORCE is true, when this is exactly what
3012 we want. Which is needed for CCmodes on some targets. */
3014 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
3016 ret = simplify_subreg (new_mode, x, old_mode, 0);
3022 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
3023 an integer mode of the same size as MODE. Returns the instruction
3024 emitted, or NULL if such a move could not be generated. */
3027 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y, bool force)
3029 enum machine_mode imode;
3030 enum insn_code code;
3032 /* There must exist a mode of the exact size we require. */
3033 imode = int_mode_for_mode (mode);
3034 if (imode == BLKmode)
3037 /* The target must support moves in this mode. */
3038 code = optab_handler (mov_optab, imode)->insn_code;
3039 if (code == CODE_FOR_nothing)
3042 x = emit_move_change_mode (imode, mode, x, force);
3045 y = emit_move_change_mode (imode, mode, y, force);
3048 return emit_insn (GEN_FCN (code) (x, y));
3051 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
3052 Return an equivalent MEM that does not use an auto-increment. */
3055 emit_move_resolve_push (enum machine_mode mode, rtx x)
3057 enum rtx_code code = GET_CODE (XEXP (x, 0));
3058 HOST_WIDE_INT adjust;
3061 adjust = GET_MODE_SIZE (mode);
3062 #ifdef PUSH_ROUNDING
3063 adjust = PUSH_ROUNDING (adjust);
3065 if (code == PRE_DEC || code == POST_DEC)
3067 else if (code == PRE_MODIFY || code == POST_MODIFY)
3069 rtx expr = XEXP (XEXP (x, 0), 1);
3072 gcc_assert (GET_CODE (expr) == PLUS || GET_CODE (expr) == MINUS);
3073 gcc_assert (CONST_INT_P (XEXP (expr, 1)));
3074 val = INTVAL (XEXP (expr, 1));
3075 if (GET_CODE (expr) == MINUS)
3077 gcc_assert (adjust == val || adjust == -val);
3081 /* Do not use anti_adjust_stack, since we don't want to update
3082 stack_pointer_delta. */
3083 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
3084 GEN_INT (adjust), stack_pointer_rtx,
3085 0, OPTAB_LIB_WIDEN);
3086 if (temp != stack_pointer_rtx)
3087 emit_move_insn (stack_pointer_rtx, temp);
3094 temp = stack_pointer_rtx;
3099 temp = plus_constant (stack_pointer_rtx, -adjust);
3105 return replace_equiv_address (x, temp);
3108 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3109 X is known to satisfy push_operand, and MODE is known to be complex.
3110 Returns the last instruction emitted. */
3113 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
3115 enum machine_mode submode = GET_MODE_INNER (mode);
3118 #ifdef PUSH_ROUNDING
3119 unsigned int submodesize = GET_MODE_SIZE (submode);
3121 /* In case we output to the stack, but the size is smaller than the
3122 machine can push exactly, we need to use move instructions. */
3123 if (PUSH_ROUNDING (submodesize) != submodesize)
3125 x = emit_move_resolve_push (mode, x);
3126 return emit_move_insn (x, y);
3130 /* Note that the real part always precedes the imag part in memory
3131 regardless of machine's endianness. */
3132 switch (GET_CODE (XEXP (x, 0)))
3146 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3147 read_complex_part (y, imag_first));
3148 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
3149 read_complex_part (y, !imag_first));
3152 /* A subroutine of emit_move_complex. Perform the move from Y to X
3153 via two moves of the parts. Returns the last instruction emitted. */
3156 emit_move_complex_parts (rtx x, rtx y)
3158 /* Show the output dies here. This is necessary for SUBREGs
3159 of pseudos since we cannot track their lifetimes correctly;
3160 hard regs shouldn't appear here except as return values. */
3161 if (!reload_completed && !reload_in_progress
3162 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
3165 write_complex_part (x, read_complex_part (y, false), false);
3166 write_complex_part (x, read_complex_part (y, true), true);
3168 return get_last_insn ();
3171 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3172 MODE is known to be complex. Returns the last instruction emitted. */
3175 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
3179 /* Need to take special care for pushes, to maintain proper ordering
3180 of the data, and possibly extra padding. */
3181 if (push_operand (x, mode))
3182 return emit_move_complex_push (mode, x, y);
3184 /* See if we can coerce the target into moving both values at once. */
3186 /* Move floating point as parts. */
3187 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
3188 && optab_handler (mov_optab, GET_MODE_INNER (mode))->insn_code != CODE_FOR_nothing)
3190 /* Not possible if the values are inherently not adjacent. */
3191 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
3193 /* Is possible if both are registers (or subregs of registers). */
3194 else if (register_operand (x, mode) && register_operand (y, mode))
3196 /* If one of the operands is a memory, and alignment constraints
3197 are friendly enough, we may be able to do combined memory operations.
3198 We do not attempt this if Y is a constant because that combination is
3199 usually better with the by-parts thing below. */
3200 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
3201 && (!STRICT_ALIGNMENT
3202 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
3211 /* For memory to memory moves, optimal behavior can be had with the
3212 existing block move logic. */
3213 if (MEM_P (x) && MEM_P (y))
3215 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
3216 BLOCK_OP_NO_LIBCALL);
3217 return get_last_insn ();
3220 ret = emit_move_via_integer (mode, x, y, true);
3225 return emit_move_complex_parts (x, y);
3228 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3229 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3232 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
3236 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3239 enum insn_code code = optab_handler (mov_optab, CCmode)->insn_code;
3240 if (code != CODE_FOR_nothing)
3242 x = emit_move_change_mode (CCmode, mode, x, true);
3243 y = emit_move_change_mode (CCmode, mode, y, true);
3244 return emit_insn (GEN_FCN (code) (x, y));
3248 /* Otherwise, find the MODE_INT mode of the same width. */
3249 ret = emit_move_via_integer (mode, x, y, false);
3250 gcc_assert (ret != NULL);
3254 /* Return true if word I of OP lies entirely in the
3255 undefined bits of a paradoxical subreg. */
3258 undefined_operand_subword_p (const_rtx op, int i)
3260 enum machine_mode innermode, innermostmode;
3262 if (GET_CODE (op) != SUBREG)
3264 innermode = GET_MODE (op);
3265 innermostmode = GET_MODE (SUBREG_REG (op));
3266 offset = i * UNITS_PER_WORD + SUBREG_BYTE (op);
3267 /* The SUBREG_BYTE represents offset, as if the value were stored in
3268 memory, except for a paradoxical subreg where we define
3269 SUBREG_BYTE to be 0; undo this exception as in
3271 if (SUBREG_BYTE (op) == 0
3272 && GET_MODE_SIZE (innermostmode) < GET_MODE_SIZE (innermode))
3274 int difference = (GET_MODE_SIZE (innermostmode) - GET_MODE_SIZE (innermode));
3275 if (WORDS_BIG_ENDIAN)
3276 offset += (difference / UNITS_PER_WORD) * UNITS_PER_WORD;
3277 if (BYTES_BIG_ENDIAN)
3278 offset += difference % UNITS_PER_WORD;
3280 if (offset >= GET_MODE_SIZE (innermostmode)
3281 || offset <= -GET_MODE_SIZE (word_mode))
3286 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3287 MODE is any multi-word or full-word mode that lacks a move_insn
3288 pattern. Note that you will get better code if you define such
3289 patterns, even if they must turn into multiple assembler instructions. */
3292 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3299 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3301 /* If X is a push on the stack, do the push now and replace
3302 X with a reference to the stack pointer. */
3303 if (push_operand (x, mode))
3304 x = emit_move_resolve_push (mode, x);
3306 /* If we are in reload, see if either operand is a MEM whose address
3307 is scheduled for replacement. */
3308 if (reload_in_progress && MEM_P (x)
3309 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3310 x = replace_equiv_address_nv (x, inner);
3311 if (reload_in_progress && MEM_P (y)
3312 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3313 y = replace_equiv_address_nv (y, inner);
3317 need_clobber = false;
3319 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3322 rtx xpart = operand_subword (x, i, 1, mode);
3325 /* Do not generate code for a move if it would come entirely
3326 from the undefined bits of a paradoxical subreg. */
3327 if (undefined_operand_subword_p (y, i))
3330 ypart = operand_subword (y, i, 1, mode);
3332 /* If we can't get a part of Y, put Y into memory if it is a
3333 constant. Otherwise, force it into a register. Then we must
3334 be able to get a part of Y. */
3335 if (ypart == 0 && CONSTANT_P (y))
3337 y = use_anchored_address (force_const_mem (mode, y));
3338 ypart = operand_subword (y, i, 1, mode);
3340 else if (ypart == 0)
3341 ypart = operand_subword_force (y, i, mode);
3343 gcc_assert (xpart && ypart);
3345 need_clobber |= (GET_CODE (xpart) == SUBREG);
3347 last_insn = emit_move_insn (xpart, ypart);
3353 /* Show the output dies here. This is necessary for SUBREGs
3354 of pseudos since we cannot track their lifetimes correctly;
3355 hard regs shouldn't appear here except as return values.
3356 We never want to emit such a clobber after reload. */
3358 && ! (reload_in_progress || reload_completed)
3359 && need_clobber != 0)
3367 /* Low level part of emit_move_insn.
3368 Called just like emit_move_insn, but assumes X and Y
3369 are basically valid. */
3372 emit_move_insn_1 (rtx x, rtx y)
3374 enum machine_mode mode = GET_MODE (x);
3375 enum insn_code code;
3377 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3379 code = optab_handler (mov_optab, mode)->insn_code;
3380 if (code != CODE_FOR_nothing)
3381 return emit_insn (GEN_FCN (code) (x, y));
3383 /* Expand complex moves by moving real part and imag part. */
3384 if (COMPLEX_MODE_P (mode))
3385 return emit_move_complex (mode, x, y);
3387 if (GET_MODE_CLASS (mode) == MODE_DECIMAL_FLOAT
3388 || ALL_FIXED_POINT_MODE_P (mode))
3390 rtx result = emit_move_via_integer (mode, x, y, true);
3392 /* If we can't find an integer mode, use multi words. */
3396 return emit_move_multi_word (mode, x, y);
3399 if (GET_MODE_CLASS (mode) == MODE_CC)
3400 return emit_move_ccmode (mode, x, y);
3402 /* Try using a move pattern for the corresponding integer mode. This is
3403 only safe when simplify_subreg can convert MODE constants into integer
3404 constants. At present, it can only do this reliably if the value
3405 fits within a HOST_WIDE_INT. */
3406 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3408 rtx ret = emit_move_via_integer (mode, x, y, false);
3413 return emit_move_multi_word (mode, x, y);
3416 /* Generate code to copy Y into X.
3417 Both Y and X must have the same mode, except that
3418 Y can be a constant with VOIDmode.
3419 This mode cannot be BLKmode; use emit_block_move for that.
3421 Return the last instruction emitted. */
3424 emit_move_insn (rtx x, rtx y)
3426 enum machine_mode mode = GET_MODE (x);
3427 rtx y_cst = NULL_RTX;
3430 gcc_assert (mode != BLKmode
3431 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3436 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3437 && (last_insn = compress_float_constant (x, y)))
3442 if (!LEGITIMATE_CONSTANT_P (y))
3444 y = force_const_mem (mode, y);
3446 /* If the target's cannot_force_const_mem prevented the spill,
3447 assume that the target's move expanders will also take care
3448 of the non-legitimate constant. */
3452 y = use_anchored_address (y);
3456 /* If X or Y are memory references, verify that their addresses are valid
3459 && (! memory_address_addr_space_p (GET_MODE (x), XEXP (x, 0),
3461 && ! push_operand (x, GET_MODE (x))))
3462 x = validize_mem (x);
3465 && ! memory_address_addr_space_p (GET_MODE (y), XEXP (y, 0),
3466 MEM_ADDR_SPACE (y)))
3467 y = validize_mem (y);
3469 gcc_assert (mode != BLKmode);
3471 last_insn = emit_move_insn_1 (x, y);
3473 if (y_cst && REG_P (x)
3474 && (set = single_set (last_insn)) != NULL_RTX
3475 && SET_DEST (set) == x
3476 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3477 set_unique_reg_note (last_insn, REG_EQUAL, y_cst);
3482 /* If Y is representable exactly in a narrower mode, and the target can
3483 perform the extension directly from constant or memory, then emit the
3484 move as an extension. */
3487 compress_float_constant (rtx x, rtx y)
3489 enum machine_mode dstmode = GET_MODE (x);
3490 enum machine_mode orig_srcmode = GET_MODE (y);
3491 enum machine_mode srcmode;
3493 int oldcost, newcost;
3494 bool speed = optimize_insn_for_speed_p ();
3496 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3498 if (LEGITIMATE_CONSTANT_P (y))
3499 oldcost = rtx_cost (y, SET, speed);
3501 oldcost = rtx_cost (force_const_mem (dstmode, y), SET, speed);
3503 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3504 srcmode != orig_srcmode;
3505 srcmode = GET_MODE_WIDER_MODE (srcmode))
3508 rtx trunc_y, last_insn;
3510 /* Skip if the target can't extend this way. */
3511 ic = can_extend_p (dstmode, srcmode, 0);
3512 if (ic == CODE_FOR_nothing)
3515 /* Skip if the narrowed value isn't exact. */
3516 if (! exact_real_truncate (srcmode, &r))
3519 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3521 if (LEGITIMATE_CONSTANT_P (trunc_y))
3523 /* Skip if the target needs extra instructions to perform
3525 if (! (*insn_data[ic].operand[1].predicate) (trunc_y, srcmode))
3527 /* This is valid, but may not be cheaper than the original. */
3528 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3529 if (oldcost < newcost)
3532 else if (float_extend_from_mem[dstmode][srcmode])
3534 trunc_y = force_const_mem (srcmode, trunc_y);
3535 /* This is valid, but may not be cheaper than the original. */
3536 newcost = rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode, trunc_y), SET, speed);
3537 if (oldcost < newcost)
3539 trunc_y = validize_mem (trunc_y);
3544 /* For CSE's benefit, force the compressed constant pool entry
3545 into a new pseudo. This constant may be used in different modes,
3546 and if not, combine will put things back together for us. */
3547 trunc_y = force_reg (srcmode, trunc_y);
3548 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3549 last_insn = get_last_insn ();
3552 set_unique_reg_note (last_insn, REG_EQUAL, y);
3560 /* Pushing data onto the stack. */
3562 /* Push a block of length SIZE (perhaps variable)
3563 and return an rtx to address the beginning of the block.
3564 The value may be virtual_outgoing_args_rtx.
3566 EXTRA is the number of bytes of padding to push in addition to SIZE.
3567 BELOW nonzero means this padding comes at low addresses;
3568 otherwise, the padding comes at high addresses. */
3571 push_block (rtx size, int extra, int below)
3575 size = convert_modes (Pmode, ptr_mode, size, 1);
3576 if (CONSTANT_P (size))
3577 anti_adjust_stack (plus_constant (size, extra));
3578 else if (REG_P (size) && extra == 0)
3579 anti_adjust_stack (size);
3582 temp = copy_to_mode_reg (Pmode, size);
3584 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3585 temp, 0, OPTAB_LIB_WIDEN);
3586 anti_adjust_stack (temp);
3589 #ifndef STACK_GROWS_DOWNWARD
3595 temp = virtual_outgoing_args_rtx;
3596 if (extra != 0 && below)
3597 temp = plus_constant (temp, extra);
3601 if (CONST_INT_P (size))
3602 temp = plus_constant (virtual_outgoing_args_rtx,
3603 -INTVAL (size) - (below ? 0 : extra));
3604 else if (extra != 0 && !below)
3605 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3606 negate_rtx (Pmode, plus_constant (size, extra)));
3608 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3609 negate_rtx (Pmode, size));
3612 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3615 #ifdef PUSH_ROUNDING
3617 /* Emit single push insn. */
3620 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3623 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3625 enum insn_code icode;
3626 insn_operand_predicate_fn pred;
3628 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3629 /* If there is push pattern, use it. Otherwise try old way of throwing
3630 MEM representing push operation to move expander. */
3631 icode = optab_handler (push_optab, mode)->insn_code;
3632 if (icode != CODE_FOR_nothing)
3634 if (((pred = insn_data[(int) icode].operand[0].predicate)
3635 && !((*pred) (x, mode))))
3636 x = force_reg (mode, x);
3637 emit_insn (GEN_FCN (icode) (x));
3640 if (GET_MODE_SIZE (mode) == rounded_size)
3641 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3642 /* If we are to pad downward, adjust the stack pointer first and
3643 then store X into the stack location using an offset. This is
3644 because emit_move_insn does not know how to pad; it does not have
3646 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3648 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3649 HOST_WIDE_INT offset;
3651 emit_move_insn (stack_pointer_rtx,
3652 expand_binop (Pmode,
3653 #ifdef STACK_GROWS_DOWNWARD
3659 GEN_INT (rounded_size),
3660 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3662 offset = (HOST_WIDE_INT) padding_size;
3663 #ifdef STACK_GROWS_DOWNWARD
3664 if (STACK_PUSH_CODE == POST_DEC)
3665 /* We have already decremented the stack pointer, so get the
3667 offset += (HOST_WIDE_INT) rounded_size;
3669 if (STACK_PUSH_CODE == POST_INC)
3670 /* We have already incremented the stack pointer, so get the
3672 offset -= (HOST_WIDE_INT) rounded_size;
3674 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3678 #ifdef STACK_GROWS_DOWNWARD
3679 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3680 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3681 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3683 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3684 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3685 GEN_INT (rounded_size));
3687 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3690 dest = gen_rtx_MEM (mode, dest_addr);
3694 set_mem_attributes (dest, type, 1);
3696 if (flag_optimize_sibling_calls)
3697 /* Function incoming arguments may overlap with sibling call
3698 outgoing arguments and we cannot allow reordering of reads
3699 from function arguments with stores to outgoing arguments
3700 of sibling calls. */
3701 set_mem_alias_set (dest, 0);
3703 emit_move_insn (dest, x);
3707 /* Generate code to push X onto the stack, assuming it has mode MODE and
3709 MODE is redundant except when X is a CONST_INT (since they don't
3711 SIZE is an rtx for the size of data to be copied (in bytes),
3712 needed only if X is BLKmode.
3714 ALIGN (in bits) is maximum alignment we can assume.
3716 If PARTIAL and REG are both nonzero, then copy that many of the first
3717 bytes of X into registers starting with REG, and push the rest of X.
3718 The amount of space pushed is decreased by PARTIAL bytes.
3719 REG must be a hard register in this case.
3720 If REG is zero but PARTIAL is not, take any all others actions for an
3721 argument partially in registers, but do not actually load any
3724 EXTRA is the amount in bytes of extra space to leave next to this arg.
3725 This is ignored if an argument block has already been allocated.
3727 On a machine that lacks real push insns, ARGS_ADDR is the address of
3728 the bottom of the argument block for this call. We use indexing off there
3729 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3730 argument block has not been preallocated.
3732 ARGS_SO_FAR is the size of args previously pushed for this call.
3734 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3735 for arguments passed in registers. If nonzero, it will be the number
3736 of bytes required. */
3739 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3740 unsigned int align, int partial, rtx reg, int extra,
3741 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3745 enum direction stack_direction
3746 #ifdef STACK_GROWS_DOWNWARD
3752 /* Decide where to pad the argument: `downward' for below,
3753 `upward' for above, or `none' for don't pad it.
3754 Default is below for small data on big-endian machines; else above. */
3755 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3757 /* Invert direction if stack is post-decrement.
3759 if (STACK_PUSH_CODE == POST_DEC)
3760 if (where_pad != none)
3761 where_pad = (where_pad == downward ? upward : downward);
3766 || (STRICT_ALIGNMENT && align < GET_MODE_ALIGNMENT (mode)))
3768 /* Copy a block into the stack, entirely or partially. */
3775 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3776 used = partial - offset;
3778 if (mode != BLKmode)
3780 /* A value is to be stored in an insufficiently aligned
3781 stack slot; copy via a suitably aligned slot if
3783 size = GEN_INT (GET_MODE_SIZE (mode));
3784 if (!MEM_P (xinner))
3786 temp = assign_temp (type, 0, 1, 1);
3787 emit_move_insn (temp, xinner);
3794 /* USED is now the # of bytes we need not copy to the stack
3795 because registers will take care of them. */
3798 xinner = adjust_address (xinner, BLKmode, used);
3800 /* If the partial register-part of the arg counts in its stack size,
3801 skip the part of stack space corresponding to the registers.
3802 Otherwise, start copying to the beginning of the stack space,
3803 by setting SKIP to 0. */
3804 skip = (reg_parm_stack_space == 0) ? 0 : used;
3806 #ifdef PUSH_ROUNDING
3807 /* Do it with several push insns if that doesn't take lots of insns
3808 and if there is no difficulty with push insns that skip bytes
3809 on the stack for alignment purposes. */
3812 && CONST_INT_P (size)
3814 && MEM_ALIGN (xinner) >= align
3815 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3816 /* Here we avoid the case of a structure whose weak alignment
3817 forces many pushes of a small amount of data,
3818 and such small pushes do rounding that causes trouble. */
3819 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3820 || align >= BIGGEST_ALIGNMENT
3821 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3822 == (align / BITS_PER_UNIT)))
3823 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3825 /* Push padding now if padding above and stack grows down,
3826 or if padding below and stack grows up.
3827 But if space already allocated, this has already been done. */
3828 if (extra && args_addr == 0
3829 && where_pad != none && where_pad != stack_direction)
3830 anti_adjust_stack (GEN_INT (extra));
3832 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3835 #endif /* PUSH_ROUNDING */
3839 /* Otherwise make space on the stack and copy the data
3840 to the address of that space. */
3842 /* Deduct words put into registers from the size we must copy. */
3845 if (CONST_INT_P (size))
3846 size = GEN_INT (INTVAL (size) - used);
3848 size = expand_binop (GET_MODE (size), sub_optab, size,
3849 GEN_INT (used), NULL_RTX, 0,
3853 /* Get the address of the stack space.
3854 In this case, we do not deal with EXTRA separately.
3855 A single stack adjust will do. */
3858 temp = push_block (size, extra, where_pad == downward);
3861 else if (CONST_INT_P (args_so_far))
3862 temp = memory_address (BLKmode,
3863 plus_constant (args_addr,
3864 skip + INTVAL (args_so_far)));
3866 temp = memory_address (BLKmode,
3867 plus_constant (gen_rtx_PLUS (Pmode,
3872 if (!ACCUMULATE_OUTGOING_ARGS)
3874 /* If the source is referenced relative to the stack pointer,
3875 copy it to another register to stabilize it. We do not need
3876 to do this if we know that we won't be changing sp. */
3878 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3879 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3880 temp = copy_to_reg (temp);
3883 target = gen_rtx_MEM (BLKmode, temp);
3885 /* We do *not* set_mem_attributes here, because incoming arguments
3886 may overlap with sibling call outgoing arguments and we cannot
3887 allow reordering of reads from function arguments with stores
3888 to outgoing arguments of sibling calls. We do, however, want
3889 to record the alignment of the stack slot. */
3890 /* ALIGN may well be better aligned than TYPE, e.g. due to
3891 PARM_BOUNDARY. Assume the caller isn't lying. */
3892 set_mem_align (target, align);
3894 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3897 else if (partial > 0)
3899 /* Scalar partly in registers. */
3901 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3904 /* # bytes of start of argument
3905 that we must make space for but need not store. */
3906 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3907 int args_offset = INTVAL (args_so_far);
3910 /* Push padding now if padding above and stack grows down,
3911 or if padding below and stack grows up.
3912 But if space already allocated, this has already been done. */
3913 if (extra && args_addr == 0
3914 && where_pad != none && where_pad != stack_direction)
3915 anti_adjust_stack (GEN_INT (extra));
3917 /* If we make space by pushing it, we might as well push
3918 the real data. Otherwise, we can leave OFFSET nonzero
3919 and leave the space uninitialized. */
3923 /* Now NOT_STACK gets the number of words that we don't need to
3924 allocate on the stack. Convert OFFSET to words too. */
3925 not_stack = (partial - offset) / UNITS_PER_WORD;
3926 offset /= UNITS_PER_WORD;
3928 /* If the partial register-part of the arg counts in its stack size,
3929 skip the part of stack space corresponding to the registers.
3930 Otherwise, start copying to the beginning of the stack space,
3931 by setting SKIP to 0. */
3932 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3934 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3935 x = validize_mem (force_const_mem (mode, x));
3937 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3938 SUBREGs of such registers are not allowed. */
3939 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3940 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3941 x = copy_to_reg (x);
3943 /* Loop over all the words allocated on the stack for this arg. */
3944 /* We can do it by words, because any scalar bigger than a word
3945 has a size a multiple of a word. */
3946 #ifndef PUSH_ARGS_REVERSED
3947 for (i = not_stack; i < size; i++)
3949 for (i = size - 1; i >= not_stack; i--)
3951 if (i >= not_stack + offset)
3952 emit_push_insn (operand_subword_force (x, i, mode),
3953 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3955 GEN_INT (args_offset + ((i - not_stack + skip)
3957 reg_parm_stack_space, alignment_pad);
3964 /* Push padding now if padding above and stack grows down,
3965 or if padding below and stack grows up.
3966 But if space already allocated, this has already been done. */
3967 if (extra && args_addr == 0
3968 && where_pad != none && where_pad != stack_direction)
3969 anti_adjust_stack (GEN_INT (extra));
3971 #ifdef PUSH_ROUNDING
3972 if (args_addr == 0 && PUSH_ARGS)
3973 emit_single_push_insn (mode, x, type);
3977 if (CONST_INT_P (args_so_far))
3979 = memory_address (mode,
3980 plus_constant (args_addr,
3981 INTVAL (args_so_far)));
3983 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3985 dest = gen_rtx_MEM (mode, addr);
3987 /* We do *not* set_mem_attributes here, because incoming arguments
3988 may overlap with sibling call outgoing arguments and we cannot
3989 allow reordering of reads from function arguments with stores
3990 to outgoing arguments of sibling calls. We do, however, want
3991 to record the alignment of the stack slot. */
3992 /* ALIGN may well be better aligned than TYPE, e.g. due to
3993 PARM_BOUNDARY. Assume the caller isn't lying. */
3994 set_mem_align (dest, align);
3996 emit_move_insn (dest, x);
4000 /* If part should go in registers, copy that part
4001 into the appropriate registers. Do this now, at the end,
4002 since mem-to-mem copies above may do function calls. */
4003 if (partial > 0 && reg != 0)
4005 /* Handle calls that pass values in multiple non-contiguous locations.
4006 The Irix 6 ABI has examples of this. */
4007 if (GET_CODE (reg) == PARALLEL)
4008 emit_group_load (reg, x, type, -1);
4011 gcc_assert (partial % UNITS_PER_WORD == 0);
4012 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
4016 if (extra && args_addr == 0 && where_pad == stack_direction)
4017 anti_adjust_stack (GEN_INT (extra));
4019 if (alignment_pad && args_addr == 0)
4020 anti_adjust_stack (alignment_pad);
4023 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4027 get_subtarget (rtx x)
4031 /* Only registers can be subtargets. */
4033 /* Don't use hard regs to avoid extending their life. */
4034 || REGNO (x) < FIRST_PSEUDO_REGISTER
4038 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
4039 FIELD is a bitfield. Returns true if the optimization was successful,
4040 and there's nothing else to do. */
4043 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
4044 unsigned HOST_WIDE_INT bitpos,
4045 enum machine_mode mode1, rtx str_rtx,
4048 enum machine_mode str_mode = GET_MODE (str_rtx);
4049 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
4054 if (mode1 != VOIDmode
4055 || bitsize >= BITS_PER_WORD
4056 || str_bitsize > BITS_PER_WORD
4057 || TREE_SIDE_EFFECTS (to)
4058 || TREE_THIS_VOLATILE (to))
4062 if (!BINARY_CLASS_P (src)
4063 || TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
4066 op0 = TREE_OPERAND (src, 0);
4067 op1 = TREE_OPERAND (src, 1);
4070 if (!operand_equal_p (to, op0, 0))
4073 if (MEM_P (str_rtx))
4075 unsigned HOST_WIDE_INT offset1;
4077 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
4078 str_mode = word_mode;
4079 str_mode = get_best_mode (bitsize, bitpos,
4080 MEM_ALIGN (str_rtx), str_mode, 0);
4081 if (str_mode == VOIDmode)
4083 str_bitsize = GET_MODE_BITSIZE (str_mode);
4086 bitpos %= str_bitsize;
4087 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
4088 str_rtx = adjust_address (str_rtx, str_mode, offset1);
4090 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
4093 /* If the bit field covers the whole REG/MEM, store_field
4094 will likely generate better code. */
4095 if (bitsize >= str_bitsize)
4098 /* We can't handle fields split across multiple entities. */
4099 if (bitpos + bitsize > str_bitsize)
4102 if (BYTES_BIG_ENDIAN)
4103 bitpos = str_bitsize - bitpos - bitsize;
4105 switch (TREE_CODE (src))
4109 /* For now, just optimize the case of the topmost bitfield
4110 where we don't need to do any masking and also
4111 1 bit bitfields where xor can be used.
4112 We might win by one instruction for the other bitfields
4113 too if insv/extv instructions aren't used, so that
4114 can be added later. */
4115 if (bitpos + bitsize != str_bitsize
4116 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
4119 value = expand_expr (op1, NULL_RTX, str_mode, EXPAND_NORMAL);
4120 value = convert_modes (str_mode,
4121 TYPE_MODE (TREE_TYPE (op1)), value,
4122 TYPE_UNSIGNED (TREE_TYPE (op1)));
4124 /* We may be accessing data outside the field, which means
4125 we can alias adjacent data. */
4126 if (MEM_P (str_rtx))
4128 str_rtx = shallow_copy_rtx (str_rtx);
4129 set_mem_alias_set (str_rtx, 0);
4130 set_mem_expr (str_rtx, 0);
4133 binop = TREE_CODE (src) == PLUS_EXPR ? add_optab : sub_optab;
4134 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
4136 value = expand_and (str_mode, value, const1_rtx, NULL);
4139 value = expand_shift (LSHIFT_EXPR, str_mode, value,
4140 build_int_cst (NULL_TREE, bitpos),
4142 result = expand_binop (str_mode, binop, str_rtx,
4143 value, str_rtx, 1, OPTAB_WIDEN);
4144 if (result != str_rtx)
4145 emit_move_insn (str_rtx, result);
4150 if (TREE_CODE (op1) != INTEGER_CST)
4152 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), EXPAND_NORMAL);
4153 value = convert_modes (GET_MODE (str_rtx),
4154 TYPE_MODE (TREE_TYPE (op1)), value,
4155 TYPE_UNSIGNED (TREE_TYPE (op1)));
4157 /* We may be accessing data outside the field, which means
4158 we can alias adjacent data. */
4159 if (MEM_P (str_rtx))
4161 str_rtx = shallow_copy_rtx (str_rtx);
4162 set_mem_alias_set (str_rtx, 0);
4163 set_mem_expr (str_rtx, 0);
4166 binop = TREE_CODE (src) == BIT_IOR_EXPR ? ior_optab : xor_optab;
4167 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
4169 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
4171 value = expand_and (GET_MODE (str_rtx), value, mask,
4174 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
4175 build_int_cst (NULL_TREE, bitpos),
4177 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
4178 value, str_rtx, 1, OPTAB_WIDEN);
4179 if (result != str_rtx)
4180 emit_move_insn (str_rtx, result);
4191 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4192 is true, try generating a nontemporal store. */
4195 expand_assignment (tree to, tree from, bool nontemporal)
4200 /* Don't crash if the lhs of the assignment was erroneous. */
4201 if (TREE_CODE (to) == ERROR_MARK)
4203 result = expand_normal (from);
4207 /* Optimize away no-op moves without side-effects. */
4208 if (operand_equal_p (to, from, 0))
4211 /* Assignment of a structure component needs special treatment
4212 if the structure component's rtx is not simply a MEM.
4213 Assignment of an array element at a constant index, and assignment of
4214 an array element in an unaligned packed structure field, has the same
4216 if (handled_component_p (to)
4217 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
4219 enum machine_mode mode1;
4220 HOST_WIDE_INT bitsize, bitpos;
4227 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
4228 &unsignedp, &volatilep, true);
4230 /* If we are going to use store_bit_field and extract_bit_field,
4231 make sure to_rtx will be safe for multiple use. */
4233 to_rtx = expand_normal (tem);
4237 enum machine_mode address_mode;
4240 if (!MEM_P (to_rtx))
4242 /* We can get constant negative offsets into arrays with broken
4243 user code. Translate this to a trap instead of ICEing. */
4244 gcc_assert (TREE_CODE (offset) == INTEGER_CST);
4245 expand_builtin_trap ();
4246 to_rtx = gen_rtx_MEM (BLKmode, const0_rtx);
4249 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
4251 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
4252 if (GET_MODE (offset_rtx) != address_mode)
4253 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
4255 /* A constant address in TO_RTX can have VOIDmode, we must not try
4256 to call force_reg for that case. Avoid that case. */
4258 && GET_MODE (to_rtx) == BLKmode
4259 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
4261 && (bitpos % bitsize) == 0
4262 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
4263 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
4265 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
4269 to_rtx = offset_address (to_rtx, offset_rtx,
4270 highest_pow2_factor_for_target (to,
4274 /* Handle expand_expr of a complex value returning a CONCAT. */
4275 if (GET_CODE (to_rtx) == CONCAT)
4277 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from))))
4279 gcc_assert (bitpos == 0);
4280 result = store_expr (from, to_rtx, false, nontemporal);
4284 gcc_assert (bitpos == 0 || bitpos == GET_MODE_BITSIZE (mode1));
4285 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false,
4293 /* If the field is at offset zero, we could have been given the
4294 DECL_RTX of the parent struct. Don't munge it. */
4295 to_rtx = shallow_copy_rtx (to_rtx);
4297 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
4299 /* Deal with volatile and readonly fields. The former is only
4300 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4302 MEM_VOLATILE_P (to_rtx) = 1;
4303 if (component_uses_parent_alias_set (to))
4304 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4307 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
4311 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
4312 TREE_TYPE (tem), get_alias_set (to),
4317 preserve_temp_slots (result);
4323 else if (TREE_CODE (to) == MISALIGNED_INDIRECT_REF)
4325 addr_space_t as = ADDR_SPACE_GENERIC;
4326 enum machine_mode mode, op_mode1;
4327 enum insn_code icode;
4328 rtx reg, addr, mem, insn;
4330 if (POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (to, 0))))
4331 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (to, 0))));
4333 reg = expand_expr (from, NULL_RTX, VOIDmode, EXPAND_NORMAL);
4334 reg = force_not_mem (reg);
4336 mode = TYPE_MODE (TREE_TYPE (to));
4337 addr = expand_expr (TREE_OPERAND (to, 0), NULL_RTX, VOIDmode,
4339 addr = memory_address_addr_space (mode, addr, as);
4340 mem = gen_rtx_MEM (mode, addr);
4342 set_mem_attributes (mem, to, 0);
4343 set_mem_addr_space (mem, as);
4345 icode = movmisalign_optab->handlers[mode].insn_code;
4346 gcc_assert (icode != CODE_FOR_nothing);
4348 op_mode1 = insn_data[icode].operand[1].mode;
4349 if (! (*insn_data[icode].operand[1].predicate) (reg, op_mode1)
4350 && op_mode1 != VOIDmode)
4351 reg = copy_to_mode_reg (op_mode1, reg);
4353 insn = GEN_FCN (icode) (mem, reg);
4358 /* If the rhs is a function call and its value is not an aggregate,
4359 call the function before we start to compute the lhs.
4360 This is needed for correct code for cases such as
4361 val = setjmp (buf) on machines where reference to val
4362 requires loading up part of an address in a separate insn.
4364 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4365 since it might be a promoted variable where the zero- or sign- extension
4366 needs to be done. Handling this in the normal way is safe because no
4367 computation is done before the call. The same is true for SSA names. */
4368 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
4369 && COMPLETE_TYPE_P (TREE_TYPE (from))
4370 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
4371 && ! (((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
4372 && REG_P (DECL_RTL (to)))
4373 || TREE_CODE (to) == SSA_NAME))
4378 value = expand_normal (from);
4380 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4382 /* Handle calls that return values in multiple non-contiguous locations.
4383 The Irix 6 ABI has examples of this. */
4384 if (GET_CODE (to_rtx) == PARALLEL)
4385 emit_group_load (to_rtx, value, TREE_TYPE (from),
4386 int_size_in_bytes (TREE_TYPE (from)));
4387 else if (GET_MODE (to_rtx) == BLKmode)
4388 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4391 if (POINTER_TYPE_P (TREE_TYPE (to)))
4392 value = convert_memory_address_addr_space
4393 (GET_MODE (to_rtx), value,
4394 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to))));
4396 emit_move_insn (to_rtx, value);
4398 preserve_temp_slots (to_rtx);
4404 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4405 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4408 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4410 /* Don't move directly into a return register. */
4411 if (TREE_CODE (to) == RESULT_DECL
4412 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4417 temp = expand_expr (from, NULL_RTX, GET_MODE (to_rtx), EXPAND_NORMAL);
4419 if (GET_CODE (to_rtx) == PARALLEL)
4420 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4421 int_size_in_bytes (TREE_TYPE (from)));
4423 emit_move_insn (to_rtx, temp);
4425 preserve_temp_slots (to_rtx);
4431 /* In case we are returning the contents of an object which overlaps
4432 the place the value is being stored, use a safe function when copying
4433 a value through a pointer into a structure value return block. */
4434 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
4435 && ADDR_SPACE_GENERIC_P
4436 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from, 0)))))
4437 && cfun->returns_struct
4438 && !cfun->returns_pcc_struct)
4443 size = expr_size (from);
4444 from_rtx = expand_normal (from);
4446 emit_library_call (memmove_libfunc, LCT_NORMAL,
4447 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4448 XEXP (from_rtx, 0), Pmode,
4449 convert_to_mode (TYPE_MODE (sizetype),
4450 size, TYPE_UNSIGNED (sizetype)),
4451 TYPE_MODE (sizetype));
4453 preserve_temp_slots (to_rtx);
4459 /* Compute FROM and store the value in the rtx we got. */
4462 result = store_expr (from, to_rtx, 0, nontemporal);
4463 preserve_temp_slots (result);
4469 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4470 succeeded, false otherwise. */
4473 emit_storent_insn (rtx to, rtx from)
4475 enum machine_mode mode = GET_MODE (to), imode;
4476 enum insn_code code = optab_handler (storent_optab, mode)->insn_code;
4479 if (code == CODE_FOR_nothing)
4482 imode = insn_data[code].operand[0].mode;
4483 if (!insn_data[code].operand[0].predicate (to, imode))
4486 imode = insn_data[code].operand[1].mode;
4487 if (!insn_data[code].operand[1].predicate (from, imode))
4489 from = copy_to_mode_reg (imode, from);
4490 if (!insn_data[code].operand[1].predicate (from, imode))
4494 pattern = GEN_FCN (code) (to, from);
4495 if (pattern == NULL_RTX)
4498 emit_insn (pattern);
4502 /* Generate code for computing expression EXP,
4503 and storing the value into TARGET.
4505 If the mode is BLKmode then we may return TARGET itself.
4506 It turns out that in BLKmode it doesn't cause a problem.
4507 because C has no operators that could combine two different
4508 assignments into the same BLKmode object with different values
4509 with no sequence point. Will other languages need this to
4512 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4513 stack, and block moves may need to be treated specially.
4515 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4518 store_expr (tree exp, rtx target, int call_param_p, bool nontemporal)
4521 rtx alt_rtl = NULL_RTX;
4522 location_t loc = EXPR_LOCATION (exp);
4524 if (VOID_TYPE_P (TREE_TYPE (exp)))
4526 /* C++ can generate ?: expressions with a throw expression in one
4527 branch and an rvalue in the other. Here, we resolve attempts to
4528 store the throw expression's nonexistent result. */
4529 gcc_assert (!call_param_p);
4530 expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
4533 if (TREE_CODE (exp) == COMPOUND_EXPR)
4535 /* Perform first part of compound expression, then assign from second
4537 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4538 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4539 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4542 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4544 /* For conditional expression, get safe form of the target. Then
4545 test the condition, doing the appropriate assignment on either
4546 side. This avoids the creation of unnecessary temporaries.
4547 For non-BLKmode, it is more efficient not to do this. */
4549 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4551 do_pending_stack_adjust ();
4553 jumpifnot (TREE_OPERAND (exp, 0), lab1);
4554 store_expr (TREE_OPERAND (exp, 1), target, call_param_p,
4556 emit_jump_insn (gen_jump (lab2));
4559 store_expr (TREE_OPERAND (exp, 2), target, call_param_p,
4566 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4567 /* If this is a scalar in a register that is stored in a wider mode
4568 than the declared mode, compute the result into its declared mode
4569 and then convert to the wider mode. Our value is the computed
4572 rtx inner_target = 0;
4574 /* We can do the conversion inside EXP, which will often result
4575 in some optimizations. Do the conversion in two steps: first
4576 change the signedness, if needed, then the extend. But don't
4577 do this if the type of EXP is a subtype of something else
4578 since then the conversion might involve more than just
4579 converting modes. */
4580 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4581 && TREE_TYPE (TREE_TYPE (exp)) == 0
4582 && GET_MODE_PRECISION (GET_MODE (target))
4583 == TYPE_PRECISION (TREE_TYPE (exp)))
4585 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4586 != SUBREG_PROMOTED_UNSIGNED_P (target))
4588 /* Some types, e.g. Fortran's logical*4, won't have a signed
4589 version, so use the mode instead. */
4591 = (signed_or_unsigned_type_for
4592 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)));
4594 ntype = lang_hooks.types.type_for_mode
4595 (TYPE_MODE (TREE_TYPE (exp)),
4596 SUBREG_PROMOTED_UNSIGNED_P (target));
4598 exp = fold_convert_loc (loc, ntype, exp);
4601 exp = fold_convert_loc (loc, lang_hooks.types.type_for_mode
4602 (GET_MODE (SUBREG_REG (target)),
4603 SUBREG_PROMOTED_UNSIGNED_P (target)),
4606 inner_target = SUBREG_REG (target);
4609 temp = expand_expr (exp, inner_target, VOIDmode,
4610 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4612 /* If TEMP is a VOIDmode constant, use convert_modes to make
4613 sure that we properly convert it. */
4614 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4616 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4617 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4618 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4619 GET_MODE (target), temp,
4620 SUBREG_PROMOTED_UNSIGNED_P (target));
4623 convert_move (SUBREG_REG (target), temp,
4624 SUBREG_PROMOTED_UNSIGNED_P (target));
4628 else if (TREE_CODE (exp) == STRING_CST
4629 && !nontemporal && !call_param_p
4630 && TREE_STRING_LENGTH (exp) > 0
4631 && TYPE_MODE (TREE_TYPE (exp)) == BLKmode)
4633 /* Optimize initialization of an array with a STRING_CST. */
4634 HOST_WIDE_INT exp_len, str_copy_len;
4637 exp_len = int_expr_size (exp);
4641 str_copy_len = strlen (TREE_STRING_POINTER (exp));
4642 if (str_copy_len < TREE_STRING_LENGTH (exp) - 1)
4645 str_copy_len = TREE_STRING_LENGTH (exp);
4646 if ((STORE_MAX_PIECES & (STORE_MAX_PIECES - 1)) == 0)
4648 str_copy_len += STORE_MAX_PIECES - 1;
4649 str_copy_len &= ~(STORE_MAX_PIECES - 1);
4651 str_copy_len = MIN (str_copy_len, exp_len);
4652 if (!can_store_by_pieces (str_copy_len, builtin_strncpy_read_str,
4653 CONST_CAST(char *, TREE_STRING_POINTER (exp)),
4654 MEM_ALIGN (target), false))
4659 dest_mem = store_by_pieces (dest_mem,
4660 str_copy_len, builtin_strncpy_read_str,
4661 CONST_CAST(char *, TREE_STRING_POINTER (exp)),
4662 MEM_ALIGN (target), false,
4663 exp_len > str_copy_len ? 1 : 0);
4664 if (exp_len > str_copy_len)
4665 clear_storage (adjust_address (dest_mem, BLKmode, 0),
4666 GEN_INT (exp_len - str_copy_len),
4675 /* If we want to use a nontemporal store, force the value to
4677 tmp_target = nontemporal ? NULL_RTX : target;
4678 temp = expand_expr_real (exp, tmp_target, GET_MODE (target),
4680 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4684 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4685 the same as that of TARGET, adjust the constant. This is needed, for
4686 example, in case it is a CONST_DOUBLE and we want only a word-sized
4688 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4689 && TREE_CODE (exp) != ERROR_MARK
4690 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4691 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4692 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4694 /* If value was not generated in the target, store it there.
4695 Convert the value to TARGET's type first if necessary and emit the
4696 pending incrementations that have been queued when expanding EXP.
4697 Note that we cannot emit the whole queue blindly because this will
4698 effectively disable the POST_INC optimization later.
4700 If TEMP and TARGET compare equal according to rtx_equal_p, but
4701 one or both of them are volatile memory refs, we have to distinguish
4703 - expand_expr has used TARGET. In this case, we must not generate
4704 another copy. This can be detected by TARGET being equal according
4706 - expand_expr has not used TARGET - that means that the source just
4707 happens to have the same RTX form. Since temp will have been created
4708 by expand_expr, it will compare unequal according to == .
4709 We must generate a copy in this case, to reach the correct number
4710 of volatile memory references. */
4712 if ((! rtx_equal_p (temp, target)
4713 || (temp != target && (side_effects_p (temp)
4714 || side_effects_p (target))))
4715 && TREE_CODE (exp) != ERROR_MARK
4716 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4717 but TARGET is not valid memory reference, TEMP will differ
4718 from TARGET although it is really the same location. */
4719 && !(alt_rtl && rtx_equal_p (alt_rtl, target))
4720 /* If there's nothing to copy, don't bother. Don't call
4721 expr_size unless necessary, because some front-ends (C++)
4722 expr_size-hook must not be given objects that are not
4723 supposed to be bit-copied or bit-initialized. */
4724 && expr_size (exp) != const0_rtx)
4726 if (GET_MODE (temp) != GET_MODE (target)
4727 && GET_MODE (temp) != VOIDmode)
4729 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4730 if (GET_MODE (target) == BLKmode
4731 || GET_MODE (temp) == BLKmode)
4732 emit_block_move (target, temp, expr_size (exp),
4734 ? BLOCK_OP_CALL_PARM
4735 : BLOCK_OP_NORMAL));
4737 convert_move (target, temp, unsignedp);
4740 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4742 /* Handle copying a string constant into an array. The string
4743 constant may be shorter than the array. So copy just the string's
4744 actual length, and clear the rest. First get the size of the data
4745 type of the string, which is actually the size of the target. */
4746 rtx size = expr_size (exp);
4748 if (CONST_INT_P (size)
4749 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4750 emit_block_move (target, temp, size,
4752 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4755 enum machine_mode pointer_mode
4756 = targetm.addr_space.pointer_mode (MEM_ADDR_SPACE (target));
4757 enum machine_mode address_mode
4758 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (target));
4760 /* Compute the size of the data to copy from the string. */
4762 = size_binop_loc (loc, MIN_EXPR,
4763 make_tree (sizetype, size),
4764 size_int (TREE_STRING_LENGTH (exp)));
4766 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4768 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4771 /* Copy that much. */
4772 copy_size_rtx = convert_to_mode (pointer_mode, copy_size_rtx,
4773 TYPE_UNSIGNED (sizetype));
4774 emit_block_move (target, temp, copy_size_rtx,
4776 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4778 /* Figure out how much is left in TARGET that we have to clear.
4779 Do all calculations in pointer_mode. */
4780 if (CONST_INT_P (copy_size_rtx))
4782 size = plus_constant (size, -INTVAL (copy_size_rtx));
4783 target = adjust_address (target, BLKmode,
4784 INTVAL (copy_size_rtx));
4788 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4789 copy_size_rtx, NULL_RTX, 0,
4792 if (GET_MODE (copy_size_rtx) != address_mode)
4793 copy_size_rtx = convert_to_mode (address_mode,
4795 TYPE_UNSIGNED (sizetype));
4797 target = offset_address (target, copy_size_rtx,
4798 highest_pow2_factor (copy_size));
4799 label = gen_label_rtx ();
4800 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4801 GET_MODE (size), 0, label);
4804 if (size != const0_rtx)
4805 clear_storage (target, size, BLOCK_OP_NORMAL);
4811 /* Handle calls that return values in multiple non-contiguous locations.
4812 The Irix 6 ABI has examples of this. */
4813 else if (GET_CODE (target) == PARALLEL)
4814 emit_group_load (target, temp, TREE_TYPE (exp),
4815 int_size_in_bytes (TREE_TYPE (exp)));
4816 else if (GET_MODE (temp) == BLKmode)
4817 emit_block_move (target, temp, expr_size (exp),
4819 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4820 else if (nontemporal
4821 && emit_storent_insn (target, temp))
4822 /* If we managed to emit a nontemporal store, there is nothing else to
4827 temp = force_operand (temp, target);
4829 emit_move_insn (target, temp);
4836 /* Helper for categorize_ctor_elements. Identical interface. */
4839 categorize_ctor_elements_1 (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4840 HOST_WIDE_INT *p_elt_count,
4843 unsigned HOST_WIDE_INT idx;
4844 HOST_WIDE_INT nz_elts, elt_count;
4845 tree value, purpose;
4847 /* Whether CTOR is a valid constant initializer, in accordance with what
4848 initializer_constant_valid_p does. If inferred from the constructor
4849 elements, true until proven otherwise. */
4850 bool const_from_elts_p = constructor_static_from_elts_p (ctor);
4851 bool const_p = const_from_elts_p ? true : TREE_STATIC (ctor);
4856 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor), idx, purpose, value)
4861 if (TREE_CODE (purpose) == RANGE_EXPR)
4863 tree lo_index = TREE_OPERAND (purpose, 0);
4864 tree hi_index = TREE_OPERAND (purpose, 1);
4866 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
4867 mult = (tree_low_cst (hi_index, 1)
4868 - tree_low_cst (lo_index, 1) + 1);
4871 switch (TREE_CODE (value))
4875 HOST_WIDE_INT nz = 0, ic = 0;
4878 = categorize_ctor_elements_1 (value, &nz, &ic, p_must_clear);
4880 nz_elts += mult * nz;
4881 elt_count += mult * ic;
4883 if (const_from_elts_p && const_p)
4884 const_p = const_elt_p;
4891 if (!initializer_zerop (value))
4897 nz_elts += mult * TREE_STRING_LENGTH (value);
4898 elt_count += mult * TREE_STRING_LENGTH (value);
4902 if (!initializer_zerop (TREE_REALPART (value)))
4904 if (!initializer_zerop (TREE_IMAGPART (value)))
4912 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
4914 if (!initializer_zerop (TREE_VALUE (v)))
4925 if (const_from_elts_p && const_p)
4926 const_p = initializer_constant_valid_p (value, TREE_TYPE (value))
4933 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4934 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
4937 bool clear_this = true;
4939 if (!VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (ctor)))
4941 /* We don't expect more than one element of the union to be
4942 initialized. Not sure what we should do otherwise... */
4943 gcc_assert (VEC_length (constructor_elt, CONSTRUCTOR_ELTS (ctor))
4946 init_sub_type = TREE_TYPE (VEC_index (constructor_elt,
4947 CONSTRUCTOR_ELTS (ctor),
4950 /* ??? We could look at each element of the union, and find the
4951 largest element. Which would avoid comparing the size of the
4952 initialized element against any tail padding in the union.
4953 Doesn't seem worth the effort... */
4954 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
4955 TYPE_SIZE (init_sub_type)) == 1)
4957 /* And now we have to find out if the element itself is fully
4958 constructed. E.g. for union { struct { int a, b; } s; } u
4959 = { .s = { .a = 1 } }. */
4960 if (elt_count == count_type_elements (init_sub_type, false))
4965 *p_must_clear = clear_this;
4968 *p_nz_elts += nz_elts;
4969 *p_elt_count += elt_count;
4974 /* Examine CTOR to discover:
4975 * how many scalar fields are set to nonzero values,
4976 and place it in *P_NZ_ELTS;
4977 * how many scalar fields in total are in CTOR,
4978 and place it in *P_ELT_COUNT.
4979 * if a type is a union, and the initializer from the constructor
4980 is not the largest element in the union, then set *p_must_clear.
4982 Return whether or not CTOR is a valid static constant initializer, the same
4983 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4986 categorize_ctor_elements (const_tree ctor, HOST_WIDE_INT *p_nz_elts,
4987 HOST_WIDE_INT *p_elt_count,
4992 *p_must_clear = false;
4995 categorize_ctor_elements_1 (ctor, p_nz_elts, p_elt_count, p_must_clear);
4998 /* Count the number of scalars in TYPE. Return -1 on overflow or
4999 variable-sized. If ALLOW_FLEXARR is true, don't count flexible
5000 array member at the end of the structure. */
5003 count_type_elements (const_tree type, bool allow_flexarr)
5005 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
5006 switch (TREE_CODE (type))
5010 tree telts = array_type_nelts (type);
5011 if (telts && host_integerp (telts, 1))
5013 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
5014 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type), false);
5017 else if (max / n > m)
5025 HOST_WIDE_INT n = 0, t;
5028 for (f = TYPE_FIELDS (type); f ; f = TREE_CHAIN (f))
5029 if (TREE_CODE (f) == FIELD_DECL)
5031 t = count_type_elements (TREE_TYPE (f), false);
5034 /* Check for structures with flexible array member. */
5035 tree tf = TREE_TYPE (f);
5037 && TREE_CHAIN (f) == NULL
5038 && TREE_CODE (tf) == ARRAY_TYPE
5040 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf))
5041 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf)))
5042 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf))
5043 && int_size_in_bytes (type) >= 0)
5055 case QUAL_UNION_TYPE:
5062 return TYPE_VECTOR_SUBPARTS (type);
5066 case FIXED_POINT_TYPE:
5071 case REFERENCE_TYPE:
5086 /* Return 1 if EXP contains mostly (3/4) zeros. */
5089 mostly_zeros_p (const_tree exp)
5091 if (TREE_CODE (exp) == CONSTRUCTOR)
5094 HOST_WIDE_INT nz_elts, count, elts;
5097 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5101 elts = count_type_elements (TREE_TYPE (exp), false);
5103 return nz_elts < elts / 4;
5106 return initializer_zerop (exp);
5109 /* Return 1 if EXP contains all zeros. */
5112 all_zeros_p (const_tree exp)
5114 if (TREE_CODE (exp) == CONSTRUCTOR)
5117 HOST_WIDE_INT nz_elts, count;
5120 categorize_ctor_elements (exp, &nz_elts, &count, &must_clear);
5121 return nz_elts == 0;
5124 return initializer_zerop (exp);
5127 /* Helper function for store_constructor.
5128 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5129 TYPE is the type of the CONSTRUCTOR, not the element type.
5130 CLEARED is as for store_constructor.
5131 ALIAS_SET is the alias set to use for any stores.
5133 This provides a recursive shortcut back to store_constructor when it isn't
5134 necessary to go through store_field. This is so that we can pass through
5135 the cleared field to let store_constructor know that we may not have to
5136 clear a substructure if the outer structure has already been cleared. */
5139 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
5140 HOST_WIDE_INT bitpos, enum machine_mode mode,
5141 tree exp, tree type, int cleared,
5142 alias_set_type alias_set)
5144 if (TREE_CODE (exp) == CONSTRUCTOR
5145 /* We can only call store_constructor recursively if the size and
5146 bit position are on a byte boundary. */
5147 && bitpos % BITS_PER_UNIT == 0
5148 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
5149 /* If we have a nonzero bitpos for a register target, then we just
5150 let store_field do the bitfield handling. This is unlikely to
5151 generate unnecessary clear instructions anyways. */
5152 && (bitpos == 0 || MEM_P (target)))
5156 = adjust_address (target,
5157 GET_MODE (target) == BLKmode
5159 % GET_MODE_ALIGNMENT (GET_MODE (target)))
5160 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
5163 /* Update the alias set, if required. */
5164 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
5165 && MEM_ALIAS_SET (target) != 0)
5167 target = copy_rtx (target);
5168 set_mem_alias_set (target, alias_set);
5171 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
5174 store_field (target, bitsize, bitpos, mode, exp, type, alias_set, false);
5177 /* Store the value of constructor EXP into the rtx TARGET.
5178 TARGET is either a REG or a MEM; we know it cannot conflict, since
5179 safe_from_p has been called.
5180 CLEARED is true if TARGET is known to have been zero'd.
5181 SIZE is the number of bytes of TARGET we are allowed to modify: this
5182 may not be the same as the size of EXP if we are assigning to a field
5183 which has been packed to exclude padding bits. */
5186 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
5188 tree type = TREE_TYPE (exp);
5189 #ifdef WORD_REGISTER_OPERATIONS
5190 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
5193 switch (TREE_CODE (type))
5197 case QUAL_UNION_TYPE:
5199 unsigned HOST_WIDE_INT idx;
5202 /* If size is zero or the target is already cleared, do nothing. */
5203 if (size == 0 || cleared)
5205 /* We either clear the aggregate or indicate the value is dead. */
5206 else if ((TREE_CODE (type) == UNION_TYPE
5207 || TREE_CODE (type) == QUAL_UNION_TYPE)
5208 && ! CONSTRUCTOR_ELTS (exp))
5209 /* If the constructor is empty, clear the union. */
5211 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
5215 /* If we are building a static constructor into a register,
5216 set the initial value as zero so we can fold the value into
5217 a constant. But if more than one register is involved,
5218 this probably loses. */
5219 else if (REG_P (target) && TREE_STATIC (exp)
5220 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
5222 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5226 /* If the constructor has fewer fields than the structure or
5227 if we are initializing the structure to mostly zeros, clear
5228 the whole structure first. Don't do this if TARGET is a
5229 register whose mode size isn't equal to SIZE since
5230 clear_storage can't handle this case. */
5232 && (((int)VEC_length (constructor_elt, CONSTRUCTOR_ELTS (exp))
5233 != fields_length (type))
5234 || mostly_zeros_p (exp))
5236 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
5239 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5243 if (REG_P (target) && !cleared)
5244 emit_clobber (target);
5246 /* Store each element of the constructor into the
5247 corresponding field of TARGET. */
5248 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, field, value)
5250 enum machine_mode mode;
5251 HOST_WIDE_INT bitsize;
5252 HOST_WIDE_INT bitpos = 0;
5254 rtx to_rtx = target;
5256 /* Just ignore missing fields. We cleared the whole
5257 structure, above, if any fields are missing. */
5261 if (cleared && initializer_zerop (value))
5264 if (host_integerp (DECL_SIZE (field), 1))
5265 bitsize = tree_low_cst (DECL_SIZE (field), 1);
5269 mode = DECL_MODE (field);
5270 if (DECL_BIT_FIELD (field))
5273 offset = DECL_FIELD_OFFSET (field);
5274 if (host_integerp (offset, 0)
5275 && host_integerp (bit_position (field), 0))
5277 bitpos = int_bit_position (field);
5281 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
5285 enum machine_mode address_mode;
5289 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
5290 make_tree (TREE_TYPE (exp),
5293 offset_rtx = expand_normal (offset);
5294 gcc_assert (MEM_P (to_rtx));
5297 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (to_rtx));
5298 if (GET_MODE (offset_rtx) != address_mode)
5299 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
5301 to_rtx = offset_address (to_rtx, offset_rtx,
5302 highest_pow2_factor (offset));
5305 #ifdef WORD_REGISTER_OPERATIONS
5306 /* If this initializes a field that is smaller than a
5307 word, at the start of a word, try to widen it to a full
5308 word. This special case allows us to output C++ member
5309 function initializations in a form that the optimizers
5312 && bitsize < BITS_PER_WORD
5313 && bitpos % BITS_PER_WORD == 0
5314 && GET_MODE_CLASS (mode) == MODE_INT
5315 && TREE_CODE (value) == INTEGER_CST
5317 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
5319 tree type = TREE_TYPE (value);
5321 if (TYPE_PRECISION (type) < BITS_PER_WORD)
5323 type = lang_hooks.types.type_for_size
5324 (BITS_PER_WORD, TYPE_UNSIGNED (type));
5325 value = fold_convert (type, value);
5328 if (BYTES_BIG_ENDIAN)
5330 = fold_build2 (LSHIFT_EXPR, type, value,
5331 build_int_cst (type,
5332 BITS_PER_WORD - bitsize));
5333 bitsize = BITS_PER_WORD;
5338 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
5339 && DECL_NONADDRESSABLE_P (field))
5341 to_rtx = copy_rtx (to_rtx);
5342 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
5345 store_constructor_field (to_rtx, bitsize, bitpos, mode,
5346 value, type, cleared,
5347 get_alias_set (TREE_TYPE (field)));
5354 unsigned HOST_WIDE_INT i;
5357 tree elttype = TREE_TYPE (type);
5359 HOST_WIDE_INT minelt = 0;
5360 HOST_WIDE_INT maxelt = 0;
5362 domain = TYPE_DOMAIN (type);
5363 const_bounds_p = (TYPE_MIN_VALUE (domain)
5364 && TYPE_MAX_VALUE (domain)
5365 && host_integerp (TYPE_MIN_VALUE (domain), 0)
5366 && host_integerp (TYPE_MAX_VALUE (domain), 0));
5368 /* If we have constant bounds for the range of the type, get them. */
5371 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
5372 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
5375 /* If the constructor has fewer elements than the array, clear
5376 the whole array first. Similarly if this is static
5377 constructor of a non-BLKmode object. */
5380 else if (REG_P (target) && TREE_STATIC (exp))
5384 unsigned HOST_WIDE_INT idx;
5386 HOST_WIDE_INT count = 0, zero_count = 0;
5387 need_to_clear = ! const_bounds_p;
5389 /* This loop is a more accurate version of the loop in
5390 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5391 is also needed to check for missing elements. */
5392 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, index, value)
5394 HOST_WIDE_INT this_node_count;
5399 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5401 tree lo_index = TREE_OPERAND (index, 0);
5402 tree hi_index = TREE_OPERAND (index, 1);
5404 if (! host_integerp (lo_index, 1)
5405 || ! host_integerp (hi_index, 1))
5411 this_node_count = (tree_low_cst (hi_index, 1)
5412 - tree_low_cst (lo_index, 1) + 1);
5415 this_node_count = 1;
5417 count += this_node_count;
5418 if (mostly_zeros_p (value))
5419 zero_count += this_node_count;
5422 /* Clear the entire array first if there are any missing
5423 elements, or if the incidence of zero elements is >=
5426 && (count < maxelt - minelt + 1
5427 || 4 * zero_count >= 3 * count))
5431 if (need_to_clear && size > 0)
5434 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5436 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5440 if (!cleared && REG_P (target))
5441 /* Inform later passes that the old value is dead. */
5442 emit_clobber (target);
5444 /* Store each element of the constructor into the
5445 corresponding element of TARGET, determined by counting the
5447 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), i, index, value)
5449 enum machine_mode mode;
5450 HOST_WIDE_INT bitsize;
5451 HOST_WIDE_INT bitpos;
5452 rtx xtarget = target;
5454 if (cleared && initializer_zerop (value))
5457 mode = TYPE_MODE (elttype);
5458 if (mode == BLKmode)
5459 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
5460 ? tree_low_cst (TYPE_SIZE (elttype), 1)
5463 bitsize = GET_MODE_BITSIZE (mode);
5465 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
5467 tree lo_index = TREE_OPERAND (index, 0);
5468 tree hi_index = TREE_OPERAND (index, 1);
5469 rtx index_r, pos_rtx;
5470 HOST_WIDE_INT lo, hi, count;
5473 /* If the range is constant and "small", unroll the loop. */
5475 && host_integerp (lo_index, 0)
5476 && host_integerp (hi_index, 0)
5477 && (lo = tree_low_cst (lo_index, 0),
5478 hi = tree_low_cst (hi_index, 0),
5479 count = hi - lo + 1,
5482 || (host_integerp (TYPE_SIZE (elttype), 1)
5483 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
5486 lo -= minelt; hi -= minelt;
5487 for (; lo <= hi; lo++)
5489 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
5492 && !MEM_KEEP_ALIAS_SET_P (target)
5493 && TREE_CODE (type) == ARRAY_TYPE
5494 && TYPE_NONALIASED_COMPONENT (type))
5496 target = copy_rtx (target);
5497 MEM_KEEP_ALIAS_SET_P (target) = 1;
5500 store_constructor_field
5501 (target, bitsize, bitpos, mode, value, type, cleared,
5502 get_alias_set (elttype));
5507 rtx loop_start = gen_label_rtx ();
5508 rtx loop_end = gen_label_rtx ();
5511 expand_normal (hi_index);
5513 index = build_decl (EXPR_LOCATION (exp),
5514 VAR_DECL, NULL_TREE, domain);
5515 index_r = gen_reg_rtx (promote_decl_mode (index, NULL));
5516 SET_DECL_RTL (index, index_r);
5517 store_expr (lo_index, index_r, 0, false);
5519 /* Build the head of the loop. */
5520 do_pending_stack_adjust ();
5521 emit_label (loop_start);
5523 /* Assign value to element index. */
5525 fold_convert (ssizetype,
5526 fold_build2 (MINUS_EXPR,
5529 TYPE_MIN_VALUE (domain)));
5532 size_binop (MULT_EXPR, position,
5533 fold_convert (ssizetype,
5534 TYPE_SIZE_UNIT (elttype)));
5536 pos_rtx = expand_normal (position);
5537 xtarget = offset_address (target, pos_rtx,
5538 highest_pow2_factor (position));
5539 xtarget = adjust_address (xtarget, mode, 0);
5540 if (TREE_CODE (value) == CONSTRUCTOR)
5541 store_constructor (value, xtarget, cleared,
5542 bitsize / BITS_PER_UNIT);
5544 store_expr (value, xtarget, 0, false);
5546 /* Generate a conditional jump to exit the loop. */
5547 exit_cond = build2 (LT_EXPR, integer_type_node,
5549 jumpif (exit_cond, loop_end);
5551 /* Update the loop counter, and jump to the head of
5553 expand_assignment (index,
5554 build2 (PLUS_EXPR, TREE_TYPE (index),
5555 index, integer_one_node),
5558 emit_jump (loop_start);
5560 /* Build the end of the loop. */
5561 emit_label (loop_end);
5564 else if ((index != 0 && ! host_integerp (index, 0))
5565 || ! host_integerp (TYPE_SIZE (elttype), 1))
5570 index = ssize_int (1);
5573 index = fold_convert (ssizetype,
5574 fold_build2 (MINUS_EXPR,
5577 TYPE_MIN_VALUE (domain)));
5580 size_binop (MULT_EXPR, index,
5581 fold_convert (ssizetype,
5582 TYPE_SIZE_UNIT (elttype)));
5583 xtarget = offset_address (target,
5584 expand_normal (position),
5585 highest_pow2_factor (position));
5586 xtarget = adjust_address (xtarget, mode, 0);
5587 store_expr (value, xtarget, 0, false);
5592 bitpos = ((tree_low_cst (index, 0) - minelt)
5593 * tree_low_cst (TYPE_SIZE (elttype), 1));
5595 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5597 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5598 && TREE_CODE (type) == ARRAY_TYPE
5599 && TYPE_NONALIASED_COMPONENT (type))
5601 target = copy_rtx (target);
5602 MEM_KEEP_ALIAS_SET_P (target) = 1;
5604 store_constructor_field (target, bitsize, bitpos, mode, value,
5605 type, cleared, get_alias_set (elttype));
5613 unsigned HOST_WIDE_INT idx;
5614 constructor_elt *ce;
5618 tree elttype = TREE_TYPE (type);
5619 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5620 enum machine_mode eltmode = TYPE_MODE (elttype);
5621 HOST_WIDE_INT bitsize;
5622 HOST_WIDE_INT bitpos;
5623 rtvec vector = NULL;
5625 alias_set_type alias;
5627 gcc_assert (eltmode != BLKmode);
5629 n_elts = TYPE_VECTOR_SUBPARTS (type);
5630 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5632 enum machine_mode mode = GET_MODE (target);
5634 icode = (int) optab_handler (vec_init_optab, mode)->insn_code;
5635 if (icode != CODE_FOR_nothing)
5639 vector = rtvec_alloc (n_elts);
5640 for (i = 0; i < n_elts; i++)
5641 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5645 /* If the constructor has fewer elements than the vector,
5646 clear the whole array first. Similarly if this is static
5647 constructor of a non-BLKmode object. */
5650 else if (REG_P (target) && TREE_STATIC (exp))
5654 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5657 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
5659 int n_elts_here = tree_low_cst
5660 (int_const_binop (TRUNC_DIV_EXPR,
5661 TYPE_SIZE (TREE_TYPE (value)),
5662 TYPE_SIZE (elttype), 0), 1);
5664 count += n_elts_here;
5665 if (mostly_zeros_p (value))
5666 zero_count += n_elts_here;
5669 /* Clear the entire vector first if there are any missing elements,
5670 or if the incidence of zero elements is >= 75%. */
5671 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5674 if (need_to_clear && size > 0 && !vector)
5677 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5679 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5683 /* Inform later passes that the old value is dead. */
5684 if (!cleared && !vector && REG_P (target))
5685 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5688 alias = MEM_ALIAS_SET (target);
5690 alias = get_alias_set (elttype);
5692 /* Store each element of the constructor into the corresponding
5693 element of TARGET, determined by counting the elements. */
5694 for (idx = 0, i = 0;
5695 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
5696 idx++, i += bitsize / elt_size)
5698 HOST_WIDE_INT eltpos;
5699 tree value = ce->value;
5701 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5702 if (cleared && initializer_zerop (value))
5706 eltpos = tree_low_cst (ce->index, 1);
5712 /* Vector CONSTRUCTORs should only be built from smaller
5713 vectors in the case of BLKmode vectors. */
5714 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5715 RTVEC_ELT (vector, eltpos)
5716 = expand_normal (value);
5720 enum machine_mode value_mode =
5721 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5722 ? TYPE_MODE (TREE_TYPE (value))
5724 bitpos = eltpos * elt_size;
5725 store_constructor_field (target, bitsize, bitpos,
5726 value_mode, value, type,
5732 emit_insn (GEN_FCN (icode)
5734 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5743 /* Store the value of EXP (an expression tree)
5744 into a subfield of TARGET which has mode MODE and occupies
5745 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5746 If MODE is VOIDmode, it means that we are storing into a bit-field.
5748 Always return const0_rtx unless we have something particular to
5751 TYPE is the type of the underlying object,
5753 ALIAS_SET is the alias set for the destination. This value will
5754 (in general) be different from that for TARGET, since TARGET is a
5755 reference to the containing structure.
5757 If NONTEMPORAL is true, try generating a nontemporal store. */
5760 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5761 enum machine_mode mode, tree exp, tree type,
5762 alias_set_type alias_set, bool nontemporal)
5764 if (TREE_CODE (exp) == ERROR_MARK)
5767 /* If we have nothing to store, do nothing unless the expression has
5770 return expand_expr (exp, const0_rtx, VOIDmode, EXPAND_NORMAL);
5772 /* If we are storing into an unaligned field of an aligned union that is
5773 in a register, we may have the mode of TARGET being an integer mode but
5774 MODE == BLKmode. In that case, get an aligned object whose size and
5775 alignment are the same as TARGET and store TARGET into it (we can avoid
5776 the store if the field being stored is the entire width of TARGET). Then
5777 call ourselves recursively to store the field into a BLKmode version of
5778 that object. Finally, load from the object into TARGET. This is not
5779 very efficient in general, but should only be slightly more expensive
5780 than the otherwise-required unaligned accesses. Perhaps this can be
5781 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5782 twice, once with emit_move_insn and once via store_field. */
5785 && (REG_P (target) || GET_CODE (target) == SUBREG))
5787 rtx object = assign_temp (type, 0, 1, 1);
5788 rtx blk_object = adjust_address (object, BLKmode, 0);
5790 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5791 emit_move_insn (object, target);
5793 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set,
5796 emit_move_insn (target, object);
5798 /* We want to return the BLKmode version of the data. */
5802 if (GET_CODE (target) == CONCAT)
5804 /* We're storing into a struct containing a single __complex. */
5806 gcc_assert (!bitpos);
5807 return store_expr (exp, target, 0, nontemporal);
5810 /* If the structure is in a register or if the component
5811 is a bit field, we cannot use addressing to access it.
5812 Use bit-field techniques or SUBREG to store in it. */
5814 if (mode == VOIDmode
5815 || (mode != BLKmode && ! direct_store[(int) mode]
5816 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5817 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5819 || GET_CODE (target) == SUBREG
5820 /* If the field isn't aligned enough to store as an ordinary memref,
5821 store it as a bit field. */
5823 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5824 || bitpos % GET_MODE_ALIGNMENT (mode))
5825 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5826 || (bitpos % BITS_PER_UNIT != 0)))
5827 /* If the RHS and field are a constant size and the size of the
5828 RHS isn't the same size as the bitfield, we must use bitfield
5831 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5832 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5837 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5838 implies a mask operation. If the precision is the same size as
5839 the field we're storing into, that mask is redundant. This is
5840 particularly common with bit field assignments generated by the
5842 nop_def = get_def_for_expr (exp, NOP_EXPR);
5845 tree type = TREE_TYPE (exp);
5846 if (INTEGRAL_TYPE_P (type)
5847 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
5848 && bitsize == TYPE_PRECISION (type))
5850 tree op = gimple_assign_rhs1 (nop_def);
5851 type = TREE_TYPE (op);
5852 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
5857 temp = expand_normal (exp);
5859 /* If BITSIZE is narrower than the size of the type of EXP
5860 we will be narrowing TEMP. Normally, what's wanted are the
5861 low-order bits. However, if EXP's type is a record and this is
5862 big-endian machine, we want the upper BITSIZE bits. */
5863 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5864 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5865 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5866 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5867 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5871 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5873 if (mode != VOIDmode && mode != BLKmode
5874 && mode != TYPE_MODE (TREE_TYPE (exp)))
5875 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5877 /* If the modes of TEMP and TARGET are both BLKmode, both
5878 must be in memory and BITPOS must be aligned on a byte
5879 boundary. If so, we simply do a block copy. Likewise
5880 for a BLKmode-like TARGET. */
5881 if (GET_MODE (temp) == BLKmode
5882 && (GET_MODE (target) == BLKmode
5884 && GET_MODE_CLASS (GET_MODE (target)) == MODE_INT
5885 && (bitpos % BITS_PER_UNIT) == 0
5886 && (bitsize % BITS_PER_UNIT) == 0)))
5888 gcc_assert (MEM_P (target) && MEM_P (temp)
5889 && (bitpos % BITS_PER_UNIT) == 0);
5891 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5892 emit_block_move (target, temp,
5893 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5900 /* Store the value in the bitfield. */
5901 store_bit_field (target, bitsize, bitpos, mode, temp);
5907 /* Now build a reference to just the desired component. */
5908 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5910 if (to_rtx == target)
5911 to_rtx = copy_rtx (to_rtx);
5913 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5914 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5915 set_mem_alias_set (to_rtx, alias_set);
5917 return store_expr (exp, to_rtx, 0, nontemporal);
5921 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5922 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5923 codes and find the ultimate containing object, which we return.
5925 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5926 bit position, and *PUNSIGNEDP to the signedness of the field.
5927 If the position of the field is variable, we store a tree
5928 giving the variable offset (in units) in *POFFSET.
5929 This offset is in addition to the bit position.
5930 If the position is not variable, we store 0 in *POFFSET.
5932 If any of the extraction expressions is volatile,
5933 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5935 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
5936 Otherwise, it is a mode that can be used to access the field.
5938 If the field describes a variable-sized object, *PMODE is set to
5939 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
5940 this case, but the address of the object can be found.
5942 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5943 look through nodes that serve as markers of a greater alignment than
5944 the one that can be deduced from the expression. These nodes make it
5945 possible for front-ends to prevent temporaries from being created by
5946 the middle-end on alignment considerations. For that purpose, the
5947 normal operating mode at high-level is to always pass FALSE so that
5948 the ultimate containing object is really returned; moreover, the
5949 associated predicate handled_component_p will always return TRUE
5950 on these nodes, thus indicating that they are essentially handled
5951 by get_inner_reference. TRUE should only be passed when the caller
5952 is scanning the expression in order to build another representation
5953 and specifically knows how to handle these nodes; as such, this is
5954 the normal operating mode in the RTL expanders. */
5957 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
5958 HOST_WIDE_INT *pbitpos, tree *poffset,
5959 enum machine_mode *pmode, int *punsignedp,
5960 int *pvolatilep, bool keep_aligning)
5963 enum machine_mode mode = VOIDmode;
5964 bool blkmode_bitfield = false;
5965 tree offset = size_zero_node;
5966 tree bit_offset = bitsize_zero_node;
5968 /* First get the mode, signedness, and size. We do this from just the
5969 outermost expression. */
5970 if (TREE_CODE (exp) == COMPONENT_REF)
5972 tree field = TREE_OPERAND (exp, 1);
5973 size_tree = DECL_SIZE (field);
5974 if (!DECL_BIT_FIELD (field))
5975 mode = DECL_MODE (field);
5976 else if (DECL_MODE (field) == BLKmode)
5977 blkmode_bitfield = true;
5979 *punsignedp = DECL_UNSIGNED (field);
5981 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5983 size_tree = TREE_OPERAND (exp, 1);
5984 *punsignedp = (! INTEGRAL_TYPE_P (TREE_TYPE (exp))
5985 || TYPE_UNSIGNED (TREE_TYPE (exp)));
5987 /* For vector types, with the correct size of access, use the mode of
5989 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == VECTOR_TYPE
5990 && TREE_TYPE (exp) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)))
5991 && tree_int_cst_equal (size_tree, TYPE_SIZE (TREE_TYPE (exp))))
5992 mode = TYPE_MODE (TREE_TYPE (exp));
5996 mode = TYPE_MODE (TREE_TYPE (exp));
5997 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
5999 if (mode == BLKmode)
6000 size_tree = TYPE_SIZE (TREE_TYPE (exp));
6002 *pbitsize = GET_MODE_BITSIZE (mode);
6007 if (! host_integerp (size_tree, 1))
6008 mode = BLKmode, *pbitsize = -1;
6010 *pbitsize = tree_low_cst (size_tree, 1);
6013 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6014 and find the ultimate containing object. */
6017 switch (TREE_CODE (exp))
6020 bit_offset = size_binop (PLUS_EXPR, bit_offset,
6021 TREE_OPERAND (exp, 2));
6026 tree field = TREE_OPERAND (exp, 1);
6027 tree this_offset = component_ref_field_offset (exp);
6029 /* If this field hasn't been filled in yet, don't go past it.
6030 This should only happen when folding expressions made during
6031 type construction. */
6032 if (this_offset == 0)
6035 offset = size_binop (PLUS_EXPR, offset, this_offset);
6036 bit_offset = size_binop (PLUS_EXPR, bit_offset,
6037 DECL_FIELD_BIT_OFFSET (field));
6039 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6044 case ARRAY_RANGE_REF:
6046 tree index = TREE_OPERAND (exp, 1);
6047 tree low_bound = array_ref_low_bound (exp);
6048 tree unit_size = array_ref_element_size (exp);
6050 /* We assume all arrays have sizes that are a multiple of a byte.
6051 First subtract the lower bound, if any, in the type of the
6052 index, then convert to sizetype and multiply by the size of
6053 the array element. */
6054 if (! integer_zerop (low_bound))
6055 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
6058 offset = size_binop (PLUS_EXPR, offset,
6059 size_binop (MULT_EXPR,
6060 fold_convert (sizetype, index),
6069 bit_offset = size_binop (PLUS_EXPR, bit_offset,
6070 bitsize_int (*pbitsize));
6073 case VIEW_CONVERT_EXPR:
6074 if (keep_aligning && STRICT_ALIGNMENT
6075 && (TYPE_ALIGN (TREE_TYPE (exp))
6076 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
6077 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
6078 < BIGGEST_ALIGNMENT)
6079 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
6080 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
6088 /* If any reference in the chain is volatile, the effect is volatile. */
6089 if (TREE_THIS_VOLATILE (exp))
6092 exp = TREE_OPERAND (exp, 0);
6096 /* If OFFSET is constant, see if we can return the whole thing as a
6097 constant bit position. Make sure to handle overflow during
6099 if (host_integerp (offset, 0))
6101 double_int tem = double_int_mul (tree_to_double_int (offset),
6102 uhwi_to_double_int (BITS_PER_UNIT));
6103 tem = double_int_add (tem, tree_to_double_int (bit_offset));
6104 if (double_int_fits_in_shwi_p (tem))
6106 *pbitpos = double_int_to_shwi (tem);
6107 *poffset = offset = NULL_TREE;
6111 /* Otherwise, split it up. */
6114 *pbitpos = tree_low_cst (bit_offset, 0);
6118 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6119 if (mode == VOIDmode
6121 && (*pbitpos % BITS_PER_UNIT) == 0
6122 && (*pbitsize % BITS_PER_UNIT) == 0)
6130 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
6131 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
6132 EXP is marked as PACKED. */
6135 contains_packed_reference (const_tree exp)
6137 bool packed_p = false;
6141 switch (TREE_CODE (exp))
6145 tree field = TREE_OPERAND (exp, 1);
6146 packed_p = DECL_PACKED (field)
6147 || TYPE_PACKED (TREE_TYPE (field))
6148 || TYPE_PACKED (TREE_TYPE (exp));
6156 case ARRAY_RANGE_REF:
6159 case VIEW_CONVERT_EXPR:
6165 exp = TREE_OPERAND (exp, 0);
6171 /* Return a tree of sizetype representing the size, in bytes, of the element
6172 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6175 array_ref_element_size (tree exp)
6177 tree aligned_size = TREE_OPERAND (exp, 3);
6178 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
6179 location_t loc = EXPR_LOCATION (exp);
6181 /* If a size was specified in the ARRAY_REF, it's the size measured
6182 in alignment units of the element type. So multiply by that value. */
6185 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6186 sizetype from another type of the same width and signedness. */
6187 if (TREE_TYPE (aligned_size) != sizetype)
6188 aligned_size = fold_convert_loc (loc, sizetype, aligned_size);
6189 return size_binop_loc (loc, MULT_EXPR, aligned_size,
6190 size_int (TYPE_ALIGN_UNIT (elmt_type)));
6193 /* Otherwise, take the size from that of the element type. Substitute
6194 any PLACEHOLDER_EXPR that we have. */
6196 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
6199 /* Return a tree representing the lower bound of the array mentioned in
6200 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6203 array_ref_low_bound (tree exp)
6205 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6207 /* If a lower bound is specified in EXP, use it. */
6208 if (TREE_OPERAND (exp, 2))
6209 return TREE_OPERAND (exp, 2);
6211 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6212 substituting for a PLACEHOLDER_EXPR as needed. */
6213 if (domain_type && TYPE_MIN_VALUE (domain_type))
6214 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
6216 /* Otherwise, return a zero of the appropriate type. */
6217 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
6220 /* Return a tree representing the upper bound of the array mentioned in
6221 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6224 array_ref_up_bound (tree exp)
6226 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
6228 /* If there is a domain type and it has an upper bound, use it, substituting
6229 for a PLACEHOLDER_EXPR as needed. */
6230 if (domain_type && TYPE_MAX_VALUE (domain_type))
6231 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
6233 /* Otherwise fail. */
6237 /* Return a tree representing the offset, in bytes, of the field referenced
6238 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6241 component_ref_field_offset (tree exp)
6243 tree aligned_offset = TREE_OPERAND (exp, 2);
6244 tree field = TREE_OPERAND (exp, 1);
6245 location_t loc = EXPR_LOCATION (exp);
6247 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6248 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6252 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6253 sizetype from another type of the same width and signedness. */
6254 if (TREE_TYPE (aligned_offset) != sizetype)
6255 aligned_offset = fold_convert_loc (loc, sizetype, aligned_offset);
6256 return size_binop_loc (loc, MULT_EXPR, aligned_offset,
6257 size_int (DECL_OFFSET_ALIGN (field)
6261 /* Otherwise, take the offset from that of the field. Substitute
6262 any PLACEHOLDER_EXPR that we have. */
6264 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
6267 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6269 static unsigned HOST_WIDE_INT
6270 target_align (const_tree target)
6272 /* We might have a chain of nested references with intermediate misaligning
6273 bitfields components, so need to recurse to find out. */
6275 unsigned HOST_WIDE_INT this_align, outer_align;
6277 switch (TREE_CODE (target))
6283 this_align = DECL_ALIGN (TREE_OPERAND (target, 1));
6284 outer_align = target_align (TREE_OPERAND (target, 0));
6285 return MIN (this_align, outer_align);
6288 case ARRAY_RANGE_REF:
6289 this_align = TYPE_ALIGN (TREE_TYPE (target));
6290 outer_align = target_align (TREE_OPERAND (target, 0));
6291 return MIN (this_align, outer_align);
6294 case NON_LVALUE_EXPR:
6295 case VIEW_CONVERT_EXPR:
6296 this_align = TYPE_ALIGN (TREE_TYPE (target));
6297 outer_align = target_align (TREE_OPERAND (target, 0));
6298 return MAX (this_align, outer_align);
6301 return TYPE_ALIGN (TREE_TYPE (target));
6306 /* Given an rtx VALUE that may contain additions and multiplications, return
6307 an equivalent value that just refers to a register, memory, or constant.
6308 This is done by generating instructions to perform the arithmetic and
6309 returning a pseudo-register containing the value.
6311 The returned value may be a REG, SUBREG, MEM or constant. */
6314 force_operand (rtx value, rtx target)
6317 /* Use subtarget as the target for operand 0 of a binary operation. */
6318 rtx subtarget = get_subtarget (target);
6319 enum rtx_code code = GET_CODE (value);
6321 /* Check for subreg applied to an expression produced by loop optimizer. */
6323 && !REG_P (SUBREG_REG (value))
6324 && !MEM_P (SUBREG_REG (value)))
6327 = simplify_gen_subreg (GET_MODE (value),
6328 force_reg (GET_MODE (SUBREG_REG (value)),
6329 force_operand (SUBREG_REG (value),
6331 GET_MODE (SUBREG_REG (value)),
6332 SUBREG_BYTE (value));
6333 code = GET_CODE (value);
6336 /* Check for a PIC address load. */
6337 if ((code == PLUS || code == MINUS)
6338 && XEXP (value, 0) == pic_offset_table_rtx
6339 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
6340 || GET_CODE (XEXP (value, 1)) == LABEL_REF
6341 || GET_CODE (XEXP (value, 1)) == CONST))
6344 subtarget = gen_reg_rtx (GET_MODE (value));
6345 emit_move_insn (subtarget, value);
6349 if (ARITHMETIC_P (value))
6351 op2 = XEXP (value, 1);
6352 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
6354 if (code == MINUS && CONST_INT_P (op2))
6357 op2 = negate_rtx (GET_MODE (value), op2);
6360 /* Check for an addition with OP2 a constant integer and our first
6361 operand a PLUS of a virtual register and something else. In that
6362 case, we want to emit the sum of the virtual register and the
6363 constant first and then add the other value. This allows virtual
6364 register instantiation to simply modify the constant rather than
6365 creating another one around this addition. */
6366 if (code == PLUS && CONST_INT_P (op2)
6367 && GET_CODE (XEXP (value, 0)) == PLUS
6368 && REG_P (XEXP (XEXP (value, 0), 0))
6369 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6370 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
6372 rtx temp = expand_simple_binop (GET_MODE (value), code,
6373 XEXP (XEXP (value, 0), 0), op2,
6374 subtarget, 0, OPTAB_LIB_WIDEN);
6375 return expand_simple_binop (GET_MODE (value), code, temp,
6376 force_operand (XEXP (XEXP (value,
6378 target, 0, OPTAB_LIB_WIDEN);
6381 op1 = force_operand (XEXP (value, 0), subtarget);
6382 op2 = force_operand (op2, NULL_RTX);
6386 return expand_mult (GET_MODE (value), op1, op2, target, 1);
6388 if (!INTEGRAL_MODE_P (GET_MODE (value)))
6389 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6390 target, 1, OPTAB_LIB_WIDEN);
6392 return expand_divmod (0,
6393 FLOAT_MODE_P (GET_MODE (value))
6394 ? RDIV_EXPR : TRUNC_DIV_EXPR,
6395 GET_MODE (value), op1, op2, target, 0);
6397 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6400 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
6403 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
6406 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6407 target, 0, OPTAB_LIB_WIDEN);
6409 return expand_simple_binop (GET_MODE (value), code, op1, op2,
6410 target, 1, OPTAB_LIB_WIDEN);
6413 if (UNARY_P (value))
6416 target = gen_reg_rtx (GET_MODE (value));
6417 op1 = force_operand (XEXP (value, 0), NULL_RTX);
6424 case FLOAT_TRUNCATE:
6425 convert_move (target, op1, code == ZERO_EXTEND);
6430 expand_fix (target, op1, code == UNSIGNED_FIX);
6434 case UNSIGNED_FLOAT:
6435 expand_float (target, op1, code == UNSIGNED_FLOAT);
6439 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
6443 #ifdef INSN_SCHEDULING
6444 /* On machines that have insn scheduling, we want all memory reference to be
6445 explicit, so we need to deal with such paradoxical SUBREGs. */
6446 if (GET_CODE (value) == SUBREG && MEM_P (SUBREG_REG (value))
6447 && (GET_MODE_SIZE (GET_MODE (value))
6448 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
6450 = simplify_gen_subreg (GET_MODE (value),
6451 force_reg (GET_MODE (SUBREG_REG (value)),
6452 force_operand (SUBREG_REG (value),
6454 GET_MODE (SUBREG_REG (value)),
6455 SUBREG_BYTE (value));
6461 /* Subroutine of expand_expr: return nonzero iff there is no way that
6462 EXP can reference X, which is being modified. TOP_P is nonzero if this
6463 call is going to be used to determine whether we need a temporary
6464 for EXP, as opposed to a recursive call to this function.
6466 It is always safe for this routine to return zero since it merely
6467 searches for optimization opportunities. */
6470 safe_from_p (const_rtx x, tree exp, int top_p)
6476 /* If EXP has varying size, we MUST use a target since we currently
6477 have no way of allocating temporaries of variable size
6478 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6479 So we assume here that something at a higher level has prevented a
6480 clash. This is somewhat bogus, but the best we can do. Only
6481 do this when X is BLKmode and when we are at the top level. */
6482 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
6483 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
6484 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
6485 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
6486 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
6488 && GET_MODE (x) == BLKmode)
6489 /* If X is in the outgoing argument area, it is always safe. */
6491 && (XEXP (x, 0) == virtual_outgoing_args_rtx
6492 || (GET_CODE (XEXP (x, 0)) == PLUS
6493 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
6496 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6497 find the underlying pseudo. */
6498 if (GET_CODE (x) == SUBREG)
6501 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6505 /* Now look at our tree code and possibly recurse. */
6506 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
6508 case tcc_declaration:
6509 exp_rtl = DECL_RTL_IF_SET (exp);
6515 case tcc_exceptional:
6516 if (TREE_CODE (exp) == TREE_LIST)
6520 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
6522 exp = TREE_CHAIN (exp);
6525 if (TREE_CODE (exp) != TREE_LIST)
6526 return safe_from_p (x, exp, 0);
6529 else if (TREE_CODE (exp) == CONSTRUCTOR)
6531 constructor_elt *ce;
6532 unsigned HOST_WIDE_INT idx;
6535 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), idx, ce);
6537 if ((ce->index != NULL_TREE && !safe_from_p (x, ce->index, 0))
6538 || !safe_from_p (x, ce->value, 0))
6542 else if (TREE_CODE (exp) == ERROR_MARK)
6543 return 1; /* An already-visited SAVE_EXPR? */
6548 /* The only case we look at here is the DECL_INITIAL inside a
6550 return (TREE_CODE (exp) != DECL_EXPR
6551 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
6552 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
6553 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
6556 case tcc_comparison:
6557 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
6562 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6564 case tcc_expression:
6567 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6568 the expression. If it is set, we conflict iff we are that rtx or
6569 both are in memory. Otherwise, we check all operands of the
6570 expression recursively. */
6572 switch (TREE_CODE (exp))
6575 /* If the operand is static or we are static, we can't conflict.
6576 Likewise if we don't conflict with the operand at all. */
6577 if (staticp (TREE_OPERAND (exp, 0))
6578 || TREE_STATIC (exp)
6579 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
6582 /* Otherwise, the only way this can conflict is if we are taking
6583 the address of a DECL a that address if part of X, which is
6585 exp = TREE_OPERAND (exp, 0);
6588 if (!DECL_RTL_SET_P (exp)
6589 || !MEM_P (DECL_RTL (exp)))
6592 exp_rtl = XEXP (DECL_RTL (exp), 0);
6596 case MISALIGNED_INDIRECT_REF:
6597 case ALIGN_INDIRECT_REF:
6600 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
6601 get_alias_set (exp)))
6606 /* Assume that the call will clobber all hard registers and
6608 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
6613 case WITH_CLEANUP_EXPR:
6614 case CLEANUP_POINT_EXPR:
6615 /* Lowered by gimplify.c. */
6619 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
6625 /* If we have an rtx, we do not need to scan our operands. */
6629 nops = TREE_OPERAND_LENGTH (exp);
6630 for (i = 0; i < nops; i++)
6631 if (TREE_OPERAND (exp, i) != 0
6632 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
6638 /* Should never get a type here. */
6642 /* If we have an rtl, find any enclosed object. Then see if we conflict
6646 if (GET_CODE (exp_rtl) == SUBREG)
6648 exp_rtl = SUBREG_REG (exp_rtl);
6650 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
6654 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6655 are memory and they conflict. */
6656 return ! (rtx_equal_p (x, exp_rtl)
6657 || (MEM_P (x) && MEM_P (exp_rtl)
6658 && true_dependence (exp_rtl, VOIDmode, x,
6659 rtx_addr_varies_p)));
6662 /* If we reach here, it is safe. */
6667 /* Return the highest power of two that EXP is known to be a multiple of.
6668 This is used in updating alignment of MEMs in array references. */
6670 unsigned HOST_WIDE_INT
6671 highest_pow2_factor (const_tree exp)
6673 unsigned HOST_WIDE_INT c0, c1;
6675 switch (TREE_CODE (exp))
6678 /* We can find the lowest bit that's a one. If the low
6679 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6680 We need to handle this case since we can find it in a COND_EXPR,
6681 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
6682 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6684 if (TREE_OVERFLOW (exp))
6685 return BIGGEST_ALIGNMENT;
6688 /* Note: tree_low_cst is intentionally not used here,
6689 we don't care about the upper bits. */
6690 c0 = TREE_INT_CST_LOW (exp);
6692 return c0 ? c0 : BIGGEST_ALIGNMENT;
6696 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6697 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6698 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6699 return MIN (c0, c1);
6702 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6703 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6706 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6708 if (integer_pow2p (TREE_OPERAND (exp, 1))
6709 && host_integerp (TREE_OPERAND (exp, 1), 1))
6711 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6712 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6713 return MAX (1, c0 / c1);
6718 /* The highest power of two of a bit-and expression is the maximum of
6719 that of its operands. We typically get here for a complex LHS and
6720 a constant negative power of two on the RHS to force an explicit
6721 alignment, so don't bother looking at the LHS. */
6722 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6726 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6729 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6732 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6733 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6734 return MIN (c0, c1);
6743 /* Similar, except that the alignment requirements of TARGET are
6744 taken into account. Assume it is at least as aligned as its
6745 type, unless it is a COMPONENT_REF in which case the layout of
6746 the structure gives the alignment. */
6748 static unsigned HOST_WIDE_INT
6749 highest_pow2_factor_for_target (const_tree target, const_tree exp)
6751 unsigned HOST_WIDE_INT talign = target_align (target) / BITS_PER_UNIT;
6752 unsigned HOST_WIDE_INT factor = highest_pow2_factor (exp);
6754 return MAX (factor, talign);
6757 /* Return &VAR expression for emulated thread local VAR. */
6760 emutls_var_address (tree var)
6762 tree emuvar = emutls_decl (var);
6763 tree fn = built_in_decls [BUILT_IN_EMUTLS_GET_ADDRESS];
6764 tree arg = build_fold_addr_expr_with_type (emuvar, ptr_type_node);
6765 tree arglist = build_tree_list (NULL_TREE, arg);
6766 tree call = build_function_call_expr (UNKNOWN_LOCATION, fn, arglist);
6767 return fold_convert (build_pointer_type (TREE_TYPE (var)), call);
6771 /* Subroutine of expand_expr. Expand the two operands of a binary
6772 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6773 The value may be stored in TARGET if TARGET is nonzero. The
6774 MODIFIER argument is as documented by expand_expr. */
6777 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6778 enum expand_modifier modifier)
6780 if (! safe_from_p (target, exp1, 1))
6782 if (operand_equal_p (exp0, exp1, 0))
6784 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6785 *op1 = copy_rtx (*op0);
6789 /* If we need to preserve evaluation order, copy exp0 into its own
6790 temporary variable so that it can't be clobbered by exp1. */
6791 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6792 exp0 = save_expr (exp0);
6793 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6794 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6799 /* Return a MEM that contains constant EXP. DEFER is as for
6800 output_constant_def and MODIFIER is as for expand_expr. */
6803 expand_expr_constant (tree exp, int defer, enum expand_modifier modifier)
6807 mem = output_constant_def (exp, defer);
6808 if (modifier != EXPAND_INITIALIZER)
6809 mem = use_anchored_address (mem);
6813 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6814 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6817 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
6818 enum expand_modifier modifier, addr_space_t as)
6820 rtx result, subtarget;
6822 HOST_WIDE_INT bitsize, bitpos;
6823 int volatilep, unsignedp;
6824 enum machine_mode mode1;
6826 /* If we are taking the address of a constant and are at the top level,
6827 we have to use output_constant_def since we can't call force_const_mem
6829 /* ??? This should be considered a front-end bug. We should not be
6830 generating ADDR_EXPR of something that isn't an LVALUE. The only
6831 exception here is STRING_CST. */
6832 if (CONSTANT_CLASS_P (exp))
6833 return XEXP (expand_expr_constant (exp, 0, modifier), 0);
6835 /* Everything must be something allowed by is_gimple_addressable. */
6836 switch (TREE_CODE (exp))
6839 /* This case will happen via recursion for &a->b. */
6840 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, modifier);
6843 /* Expand the initializer like constants above. */
6844 return XEXP (expand_expr_constant (DECL_INITIAL (exp), 0, modifier), 0);
6847 /* The real part of the complex number is always first, therefore
6848 the address is the same as the address of the parent object. */
6851 inner = TREE_OPERAND (exp, 0);
6855 /* The imaginary part of the complex number is always second.
6856 The expression is therefore always offset by the size of the
6859 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
6860 inner = TREE_OPERAND (exp, 0);
6864 /* TLS emulation hook - replace __thread VAR's &VAR with
6865 __emutls_get_address (&_emutls.VAR). */
6866 if (! targetm.have_tls
6867 && TREE_CODE (exp) == VAR_DECL
6868 && DECL_THREAD_LOCAL_P (exp))
6870 exp = emutls_var_address (exp);
6871 return expand_expr (exp, target, tmode, modifier);
6876 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6877 expand_expr, as that can have various side effects; LABEL_DECLs for
6878 example, may not have their DECL_RTL set yet. Expand the rtl of
6879 CONSTRUCTORs too, which should yield a memory reference for the
6880 constructor's contents. Assume language specific tree nodes can
6881 be expanded in some interesting way. */
6882 gcc_assert (TREE_CODE (exp) < LAST_AND_UNUSED_TREE_CODE);
6884 || TREE_CODE (exp) == CONSTRUCTOR
6885 || TREE_CODE (exp) == COMPOUND_LITERAL_EXPR)
6887 result = expand_expr (exp, target, tmode,
6888 modifier == EXPAND_INITIALIZER
6889 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
6891 /* If the DECL isn't in memory, then the DECL wasn't properly
6892 marked TREE_ADDRESSABLE, which will be either a front-end
6893 or a tree optimizer bug. */
6894 gcc_assert (MEM_P (result));
6895 result = XEXP (result, 0);
6897 /* ??? Is this needed anymore? */
6898 if (DECL_P (exp) && !TREE_USED (exp) == 0)
6900 assemble_external (exp);
6901 TREE_USED (exp) = 1;
6904 if (modifier != EXPAND_INITIALIZER
6905 && modifier != EXPAND_CONST_ADDRESS)
6906 result = force_operand (result, target);
6910 /* Pass FALSE as the last argument to get_inner_reference although
6911 we are expanding to RTL. The rationale is that we know how to
6912 handle "aligning nodes" here: we can just bypass them because
6913 they won't change the final object whose address will be returned
6914 (they actually exist only for that purpose). */
6915 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6916 &mode1, &unsignedp, &volatilep, false);
6920 /* We must have made progress. */
6921 gcc_assert (inner != exp);
6923 subtarget = offset || bitpos ? NULL_RTX : target;
6924 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
6925 inner alignment, force the inner to be sufficiently aligned. */
6926 if (CONSTANT_CLASS_P (inner)
6927 && TYPE_ALIGN (TREE_TYPE (inner)) < TYPE_ALIGN (TREE_TYPE (exp)))
6929 inner = copy_node (inner);
6930 TREE_TYPE (inner) = copy_node (TREE_TYPE (inner));
6931 TYPE_ALIGN (TREE_TYPE (inner)) = TYPE_ALIGN (TREE_TYPE (exp));
6932 TYPE_USER_ALIGN (TREE_TYPE (inner)) = 1;
6934 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier, as);
6940 if (modifier != EXPAND_NORMAL)
6941 result = force_operand (result, NULL);
6942 tmp = expand_expr (offset, NULL_RTX, tmode,
6943 modifier == EXPAND_INITIALIZER
6944 ? EXPAND_INITIALIZER : EXPAND_NORMAL);
6946 result = convert_memory_address_addr_space (tmode, result, as);
6947 tmp = convert_memory_address_addr_space (tmode, tmp, as);
6949 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
6950 result = gen_rtx_PLUS (tmode, result, tmp);
6953 subtarget = bitpos ? NULL_RTX : target;
6954 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
6955 1, OPTAB_LIB_WIDEN);
6961 /* Someone beforehand should have rejected taking the address
6962 of such an object. */
6963 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
6965 result = plus_constant (result, bitpos / BITS_PER_UNIT);
6966 if (modifier < EXPAND_SUM)
6967 result = force_operand (result, target);
6973 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
6974 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6977 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
6978 enum expand_modifier modifier)
6980 addr_space_t as = ADDR_SPACE_GENERIC;
6981 enum machine_mode address_mode = Pmode;
6982 enum machine_mode pointer_mode = ptr_mode;
6983 enum machine_mode rmode;
6986 /* Target mode of VOIDmode says "whatever's natural". */
6987 if (tmode == VOIDmode)
6988 tmode = TYPE_MODE (TREE_TYPE (exp));
6990 if (POINTER_TYPE_P (TREE_TYPE (exp)))
6992 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)));
6993 address_mode = targetm.addr_space.address_mode (as);
6994 pointer_mode = targetm.addr_space.pointer_mode (as);
6997 /* We can get called with some Weird Things if the user does silliness
6998 like "(short) &a". In that case, convert_memory_address won't do
6999 the right thing, so ignore the given target mode. */
7000 if (tmode != address_mode && tmode != pointer_mode)
7001 tmode = address_mode;
7003 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
7004 tmode, modifier, as);
7006 /* Despite expand_expr claims concerning ignoring TMODE when not
7007 strictly convenient, stuff breaks if we don't honor it. Note
7008 that combined with the above, we only do this for pointer modes. */
7009 rmode = GET_MODE (result);
7010 if (rmode == VOIDmode)
7013 result = convert_memory_address_addr_space (tmode, result, as);
7018 /* Generate code for computing CONSTRUCTOR EXP.
7019 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7020 is TRUE, instead of creating a temporary variable in memory
7021 NULL is returned and the caller needs to handle it differently. */
7024 expand_constructor (tree exp, rtx target, enum expand_modifier modifier,
7025 bool avoid_temp_mem)
7027 tree type = TREE_TYPE (exp);
7028 enum machine_mode mode = TYPE_MODE (type);
7030 /* Try to avoid creating a temporary at all. This is possible
7031 if all of the initializer is zero.
7032 FIXME: try to handle all [0..255] initializers we can handle
7034 if (TREE_STATIC (exp)
7035 && !TREE_ADDRESSABLE (exp)
7036 && target != 0 && mode == BLKmode
7037 && all_zeros_p (exp))
7039 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
7043 /* All elts simple constants => refer to a constant in memory. But
7044 if this is a non-BLKmode mode, let it store a field at a time
7045 since that should make a CONST_INT or CONST_DOUBLE when we
7046 fold. Likewise, if we have a target we can use, it is best to
7047 store directly into the target unless the type is large enough
7048 that memcpy will be used. If we are making an initializer and
7049 all operands are constant, put it in memory as well.
7051 FIXME: Avoid trying to fill vector constructors piece-meal.
7052 Output them with output_constant_def below unless we're sure
7053 they're zeros. This should go away when vector initializers
7054 are treated like VECTOR_CST instead of arrays. */
7055 if ((TREE_STATIC (exp)
7056 && ((mode == BLKmode
7057 && ! (target != 0 && safe_from_p (target, exp, 1)))
7058 || TREE_ADDRESSABLE (exp)
7059 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
7060 && (! MOVE_BY_PIECES_P
7061 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
7063 && ! mostly_zeros_p (exp))))
7064 || ((modifier == EXPAND_INITIALIZER || modifier == EXPAND_CONST_ADDRESS)
7065 && TREE_CONSTANT (exp)))
7072 constructor = expand_expr_constant (exp, 1, modifier);
7074 if (modifier != EXPAND_CONST_ADDRESS
7075 && modifier != EXPAND_INITIALIZER
7076 && modifier != EXPAND_SUM)
7077 constructor = validize_mem (constructor);
7082 /* Handle calls that pass values in multiple non-contiguous
7083 locations. The Irix 6 ABI has examples of this. */
7084 if (target == 0 || ! safe_from_p (target, exp, 1)
7085 || GET_CODE (target) == PARALLEL || modifier == EXPAND_STACK_PARM)
7091 = assign_temp (build_qualified_type (type, (TYPE_QUALS (type)
7092 | (TREE_READONLY (exp)
7093 * TYPE_QUAL_CONST))),
7094 0, TREE_ADDRESSABLE (exp), 1);
7097 store_constructor (exp, target, 0, int_expr_size (exp));
7102 /* expand_expr: generate code for computing expression EXP.
7103 An rtx for the computed value is returned. The value is never null.
7104 In the case of a void EXP, const0_rtx is returned.
7106 The value may be stored in TARGET if TARGET is nonzero.
7107 TARGET is just a suggestion; callers must assume that
7108 the rtx returned may not be the same as TARGET.
7110 If TARGET is CONST0_RTX, it means that the value will be ignored.
7112 If TMODE is not VOIDmode, it suggests generating the
7113 result in mode TMODE. But this is done only when convenient.
7114 Otherwise, TMODE is ignored and the value generated in its natural mode.
7115 TMODE is just a suggestion; callers must assume that
7116 the rtx returned may not have mode TMODE.
7118 Note that TARGET may have neither TMODE nor MODE. In that case, it
7119 probably will not be used.
7121 If MODIFIER is EXPAND_SUM then when EXP is an addition
7122 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7123 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7124 products as above, or REG or MEM, or constant.
7125 Ordinarily in such cases we would output mul or add instructions
7126 and then return a pseudo reg containing the sum.
7128 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7129 it also marks a label as absolutely required (it can't be dead).
7130 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7131 This is used for outputting expressions used in initializers.
7133 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7134 with a constant address even if that address is not normally legitimate.
7135 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7137 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7138 a call parameter. Such targets require special care as we haven't yet
7139 marked TARGET so that it's safe from being trashed by libcalls. We
7140 don't want to use TARGET for anything but the final result;
7141 Intermediate values must go elsewhere. Additionally, calls to
7142 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7144 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7145 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7146 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7147 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7151 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
7152 enum expand_modifier modifier, rtx *alt_rtl)
7156 /* Handle ERROR_MARK before anybody tries to access its type. */
7157 if (TREE_CODE (exp) == ERROR_MARK
7158 || (TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK))
7160 ret = CONST0_RTX (tmode);
7161 return ret ? ret : const0_rtx;
7164 /* If this is an expression of some kind and it has an associated line
7165 number, then emit the line number before expanding the expression.
7167 We need to save and restore the file and line information so that
7168 errors discovered during expansion are emitted with the right
7169 information. It would be better of the diagnostic routines
7170 used the file/line information embedded in the tree nodes rather
7172 if (cfun && EXPR_HAS_LOCATION (exp))
7174 location_t saved_location = input_location;
7175 input_location = EXPR_LOCATION (exp);
7176 set_curr_insn_source_location (input_location);
7178 /* Record where the insns produced belong. */
7179 set_curr_insn_block (TREE_BLOCK (exp));
7181 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7183 input_location = saved_location;
7187 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
7194 expand_expr_real_2 (sepops ops, rtx target, enum machine_mode tmode,
7195 enum expand_modifier modifier)
7197 rtx op0, op1, op2, temp;
7200 enum machine_mode mode;
7201 enum tree_code code = ops->code;
7203 rtx subtarget, original_target;
7205 tree subexp0, subexp1;
7206 bool reduce_bit_field;
7207 gimple subexp0_def, subexp1_def;
7209 location_t loc = ops->location;
7210 tree treeop0, treeop1;
7211 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
7212 ? reduce_to_bit_field_precision ((expr), \
7218 mode = TYPE_MODE (type);
7219 unsignedp = TYPE_UNSIGNED (type);
7224 /* We should be called only on simple (binary or unary) expressions,
7225 exactly those that are valid in gimple expressions that aren't
7226 GIMPLE_SINGLE_RHS (or invalid). */
7227 gcc_assert (get_gimple_rhs_class (code) == GIMPLE_UNARY_RHS
7228 || get_gimple_rhs_class (code) == GIMPLE_BINARY_RHS);
7230 ignore = (target == const0_rtx
7231 || ((CONVERT_EXPR_CODE_P (code)
7232 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
7233 && TREE_CODE (type) == VOID_TYPE));
7235 /* We should be called only if we need the result. */
7236 gcc_assert (!ignore);
7238 /* An operation in what may be a bit-field type needs the
7239 result to be reduced to the precision of the bit-field type,
7240 which is narrower than that of the type's mode. */
7241 reduce_bit_field = (TREE_CODE (type) == INTEGER_TYPE
7242 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
7244 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
7247 /* Use subtarget as the target for operand 0 of a binary operation. */
7248 subtarget = get_subtarget (target);
7249 original_target = target;
7253 case NON_LVALUE_EXPR:
7256 if (treeop0 == error_mark_node)
7259 if (TREE_CODE (type) == UNION_TYPE)
7261 tree valtype = TREE_TYPE (treeop0);
7263 /* If both input and output are BLKmode, this conversion isn't doing
7264 anything except possibly changing memory attribute. */
7265 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7267 rtx result = expand_expr (treeop0, target, tmode,
7270 result = copy_rtx (result);
7271 set_mem_attributes (result, type, 0);
7277 if (TYPE_MODE (type) != BLKmode)
7278 target = gen_reg_rtx (TYPE_MODE (type));
7280 target = assign_temp (type, 0, 1, 1);
7284 /* Store data into beginning of memory target. */
7285 store_expr (treeop0,
7286 adjust_address (target, TYPE_MODE (valtype), 0),
7287 modifier == EXPAND_STACK_PARM,
7292 gcc_assert (REG_P (target));
7294 /* Store this field into a union of the proper type. */
7295 store_field (target,
7296 MIN ((int_size_in_bytes (TREE_TYPE
7299 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7300 0, TYPE_MODE (valtype), treeop0,
7304 /* Return the entire union. */
7308 if (mode == TYPE_MODE (TREE_TYPE (treeop0)))
7310 op0 = expand_expr (treeop0, target, VOIDmode,
7313 /* If the signedness of the conversion differs and OP0 is
7314 a promoted SUBREG, clear that indication since we now
7315 have to do the proper extension. */
7316 if (TYPE_UNSIGNED (TREE_TYPE (treeop0)) != unsignedp
7317 && GET_CODE (op0) == SUBREG)
7318 SUBREG_PROMOTED_VAR_P (op0) = 0;
7320 return REDUCE_BIT_FIELD (op0);
7323 op0 = expand_expr (treeop0, NULL_RTX, mode,
7324 modifier == EXPAND_SUM ? EXPAND_NORMAL : modifier);
7325 if (GET_MODE (op0) == mode)
7328 /* If OP0 is a constant, just convert it into the proper mode. */
7329 else if (CONSTANT_P (op0))
7331 tree inner_type = TREE_TYPE (treeop0);
7332 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7334 if (modifier == EXPAND_INITIALIZER)
7335 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7336 subreg_lowpart_offset (mode,
7339 op0= convert_modes (mode, inner_mode, op0,
7340 TYPE_UNSIGNED (inner_type));
7343 else if (modifier == EXPAND_INITIALIZER)
7344 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7346 else if (target == 0)
7347 op0 = convert_to_mode (mode, op0,
7348 TYPE_UNSIGNED (TREE_TYPE
7352 convert_move (target, op0,
7353 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7357 return REDUCE_BIT_FIELD (op0);
7359 case ADDR_SPACE_CONVERT_EXPR:
7361 tree treeop0_type = TREE_TYPE (treeop0);
7363 addr_space_t as_from;
7365 gcc_assert (POINTER_TYPE_P (type));
7366 gcc_assert (POINTER_TYPE_P (treeop0_type));
7368 as_to = TYPE_ADDR_SPACE (TREE_TYPE (type));
7369 as_from = TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type));
7371 /* Conversions between pointers to the same address space should
7372 have been implemented via CONVERT_EXPR / NOP_EXPR. */
7373 gcc_assert (as_to != as_from);
7375 /* Ask target code to handle conversion between pointers
7376 to overlapping address spaces. */
7377 if (targetm.addr_space.subset_p (as_to, as_from)
7378 || targetm.addr_space.subset_p (as_from, as_to))
7380 op0 = expand_expr (treeop0, NULL_RTX, VOIDmode, modifier);
7381 op0 = targetm.addr_space.convert (op0, treeop0_type, type);
7386 /* For disjoint address spaces, converting anything but
7387 a null pointer invokes undefined behaviour. We simply
7388 always return a null pointer here. */
7389 return CONST0_RTX (mode);
7392 case POINTER_PLUS_EXPR:
7393 /* Even though the sizetype mode and the pointer's mode can be different
7394 expand is able to handle this correctly and get the correct result out
7395 of the PLUS_EXPR code. */
7396 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
7397 if sizetype precision is smaller than pointer precision. */
7398 if (TYPE_PRECISION (sizetype) < TYPE_PRECISION (type))
7399 treeop1 = fold_convert_loc (loc, type,
7400 fold_convert_loc (loc, ssizetype,
7404 /* Check if this is a case for multiplication and addition. */
7405 if ((TREE_CODE (type) == INTEGER_TYPE
7406 || TREE_CODE (type) == FIXED_POINT_TYPE)
7407 && (subexp0_def = get_def_for_expr (treeop0,
7410 tree subsubexp0, subsubexp1;
7411 gimple subsubexp0_def, subsubexp1_def;
7412 enum tree_code this_code;
7414 this_code = TREE_CODE (type) == INTEGER_TYPE ? NOP_EXPR
7415 : FIXED_CONVERT_EXPR;
7416 subsubexp0 = gimple_assign_rhs1 (subexp0_def);
7417 subsubexp0_def = get_def_for_expr (subsubexp0, this_code);
7418 subsubexp1 = gimple_assign_rhs2 (subexp0_def);
7419 subsubexp1_def = get_def_for_expr (subsubexp1, this_code);
7420 if (subsubexp0_def && subsubexp1_def
7421 && (top0 = gimple_assign_rhs1 (subsubexp0_def))
7422 && (top1 = gimple_assign_rhs1 (subsubexp1_def))
7423 && (TYPE_PRECISION (TREE_TYPE (top0))
7424 < TYPE_PRECISION (TREE_TYPE (subsubexp0)))
7425 && (TYPE_PRECISION (TREE_TYPE (top0))
7426 == TYPE_PRECISION (TREE_TYPE (top1)))
7427 && (TYPE_UNSIGNED (TREE_TYPE (top0))
7428 == TYPE_UNSIGNED (TREE_TYPE (top1))))
7430 tree op0type = TREE_TYPE (top0);
7431 enum machine_mode innermode = TYPE_MODE (op0type);
7432 bool zextend_p = TYPE_UNSIGNED (op0type);
7433 bool sat_p = TYPE_SATURATING (TREE_TYPE (subsubexp0));
7435 this_optab = zextend_p ? umadd_widen_optab : smadd_widen_optab;
7437 this_optab = zextend_p ? usmadd_widen_optab
7438 : ssmadd_widen_optab;
7439 if (mode == GET_MODE_2XWIDER_MODE (innermode)
7440 && (optab_handler (this_optab, mode)->insn_code
7441 != CODE_FOR_nothing))
7443 expand_operands (top0, top1, NULL_RTX, &op0, &op1,
7445 op2 = expand_expr (treeop1, subtarget,
7446 VOIDmode, EXPAND_NORMAL);
7447 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
7450 return REDUCE_BIT_FIELD (temp);
7455 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7456 something else, make sure we add the register to the constant and
7457 then to the other thing. This case can occur during strength
7458 reduction and doing it this way will produce better code if the
7459 frame pointer or argument pointer is eliminated.
7461 fold-const.c will ensure that the constant is always in the inner
7462 PLUS_EXPR, so the only case we need to do anything about is if
7463 sp, ap, or fp is our second argument, in which case we must swap
7464 the innermost first argument and our second argument. */
7466 if (TREE_CODE (treeop0) == PLUS_EXPR
7467 && TREE_CODE (TREE_OPERAND (treeop0, 1)) == INTEGER_CST
7468 && TREE_CODE (treeop1) == VAR_DECL
7469 && (DECL_RTL (treeop1) == frame_pointer_rtx
7470 || DECL_RTL (treeop1) == stack_pointer_rtx
7471 || DECL_RTL (treeop1) == arg_pointer_rtx))
7475 treeop1 = TREE_OPERAND (treeop0, 0);
7476 TREE_OPERAND (treeop0, 0) = t;
7479 /* If the result is to be ptr_mode and we are adding an integer to
7480 something, we might be forming a constant. So try to use
7481 plus_constant. If it produces a sum and we can't accept it,
7482 use force_operand. This allows P = &ARR[const] to generate
7483 efficient code on machines where a SYMBOL_REF is not a valid
7486 If this is an EXPAND_SUM call, always return the sum. */
7487 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7488 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7490 if (modifier == EXPAND_STACK_PARM)
7492 if (TREE_CODE (treeop0) == INTEGER_CST
7493 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7494 && TREE_CONSTANT (treeop1))
7498 op1 = expand_expr (treeop1, subtarget, VOIDmode,
7500 /* Use immed_double_const to ensure that the constant is
7501 truncated according to the mode of OP1, then sign extended
7502 to a HOST_WIDE_INT. Using the constant directly can result
7503 in non-canonical RTL in a 64x32 cross compile. */
7505 = immed_double_const (TREE_INT_CST_LOW (treeop0),
7507 TYPE_MODE (TREE_TYPE (treeop1)));
7508 op1 = plus_constant (op1, INTVAL (constant_part));
7509 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7510 op1 = force_operand (op1, target);
7511 return REDUCE_BIT_FIELD (op1);
7514 else if (TREE_CODE (treeop1) == INTEGER_CST
7515 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7516 && TREE_CONSTANT (treeop0))
7520 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7521 (modifier == EXPAND_INITIALIZER
7522 ? EXPAND_INITIALIZER : EXPAND_SUM));
7523 if (! CONSTANT_P (op0))
7525 op1 = expand_expr (treeop1, NULL_RTX,
7526 VOIDmode, modifier);
7527 /* Return a PLUS if modifier says it's OK. */
7528 if (modifier == EXPAND_SUM
7529 || modifier == EXPAND_INITIALIZER)
7530 return simplify_gen_binary (PLUS, mode, op0, op1);
7533 /* Use immed_double_const to ensure that the constant is
7534 truncated according to the mode of OP1, then sign extended
7535 to a HOST_WIDE_INT. Using the constant directly can result
7536 in non-canonical RTL in a 64x32 cross compile. */
7538 = immed_double_const (TREE_INT_CST_LOW (treeop1),
7540 TYPE_MODE (TREE_TYPE (treeop0)));
7541 op0 = plus_constant (op0, INTVAL (constant_part));
7542 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7543 op0 = force_operand (op0, target);
7544 return REDUCE_BIT_FIELD (op0);
7548 /* No sense saving up arithmetic to be done
7549 if it's all in the wrong mode to form part of an address.
7550 And force_operand won't know whether to sign-extend or
7552 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7553 || mode != ptr_mode)
7555 expand_operands (treeop0, treeop1,
7556 subtarget, &op0, &op1, EXPAND_NORMAL);
7557 if (op0 == const0_rtx)
7559 if (op1 == const0_rtx)
7564 expand_operands (treeop0, treeop1,
7565 subtarget, &op0, &op1, modifier);
7566 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7569 /* Check if this is a case for multiplication and subtraction. */
7570 if ((TREE_CODE (type) == INTEGER_TYPE
7571 || TREE_CODE (type) == FIXED_POINT_TYPE)
7572 && (subexp1_def = get_def_for_expr (treeop1,
7575 tree subsubexp0, subsubexp1;
7576 gimple subsubexp0_def, subsubexp1_def;
7577 enum tree_code this_code;
7579 this_code = TREE_CODE (type) == INTEGER_TYPE ? NOP_EXPR
7580 : FIXED_CONVERT_EXPR;
7581 subsubexp0 = gimple_assign_rhs1 (subexp1_def);
7582 subsubexp0_def = get_def_for_expr (subsubexp0, this_code);
7583 subsubexp1 = gimple_assign_rhs2 (subexp1_def);
7584 subsubexp1_def = get_def_for_expr (subsubexp1, this_code);
7585 if (subsubexp0_def && subsubexp1_def
7586 && (top0 = gimple_assign_rhs1 (subsubexp0_def))
7587 && (top1 = gimple_assign_rhs1 (subsubexp1_def))
7588 && (TYPE_PRECISION (TREE_TYPE (top0))
7589 < TYPE_PRECISION (TREE_TYPE (subsubexp0)))
7590 && (TYPE_PRECISION (TREE_TYPE (top0))
7591 == TYPE_PRECISION (TREE_TYPE (top1)))
7592 && (TYPE_UNSIGNED (TREE_TYPE (top0))
7593 == TYPE_UNSIGNED (TREE_TYPE (top1))))
7595 tree op0type = TREE_TYPE (top0);
7596 enum machine_mode innermode = TYPE_MODE (op0type);
7597 bool zextend_p = TYPE_UNSIGNED (op0type);
7598 bool sat_p = TYPE_SATURATING (TREE_TYPE (subsubexp0));
7600 this_optab = zextend_p ? umsub_widen_optab : smsub_widen_optab;
7602 this_optab = zextend_p ? usmsub_widen_optab
7603 : ssmsub_widen_optab;
7604 if (mode == GET_MODE_2XWIDER_MODE (innermode)
7605 && (optab_handler (this_optab, mode)->insn_code
7606 != CODE_FOR_nothing))
7608 expand_operands (top0, top1, NULL_RTX, &op0, &op1,
7610 op2 = expand_expr (treeop0, subtarget,
7611 VOIDmode, EXPAND_NORMAL);
7612 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
7615 return REDUCE_BIT_FIELD (temp);
7620 /* For initializers, we are allowed to return a MINUS of two
7621 symbolic constants. Here we handle all cases when both operands
7623 /* Handle difference of two symbolic constants,
7624 for the sake of an initializer. */
7625 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7626 && really_constant_p (treeop0)
7627 && really_constant_p (treeop1))
7629 expand_operands (treeop0, treeop1,
7630 NULL_RTX, &op0, &op1, modifier);
7632 /* If the last operand is a CONST_INT, use plus_constant of
7633 the negated constant. Else make the MINUS. */
7634 if (CONST_INT_P (op1))
7635 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7637 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7640 /* No sense saving up arithmetic to be done
7641 if it's all in the wrong mode to form part of an address.
7642 And force_operand won't know whether to sign-extend or
7644 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7645 || mode != ptr_mode)
7648 expand_operands (treeop0, treeop1,
7649 subtarget, &op0, &op1, modifier);
7651 /* Convert A - const to A + (-const). */
7652 if (CONST_INT_P (op1))
7654 op1 = negate_rtx (mode, op1);
7655 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7661 /* If this is a fixed-point operation, then we cannot use the code
7662 below because "expand_mult" doesn't support sat/no-sat fixed-point
7664 if (ALL_FIXED_POINT_MODE_P (mode))
7667 /* If first operand is constant, swap them.
7668 Thus the following special case checks need only
7669 check the second operand. */
7670 if (TREE_CODE (treeop0) == INTEGER_CST)
7677 /* Attempt to return something suitable for generating an
7678 indexed address, for machines that support that. */
7680 if (modifier == EXPAND_SUM && mode == ptr_mode
7681 && host_integerp (treeop1, 0))
7683 tree exp1 = treeop1;
7685 op0 = expand_expr (treeop0, subtarget, VOIDmode,
7689 op0 = force_operand (op0, NULL_RTX);
7691 op0 = copy_to_mode_reg (mode, op0);
7693 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7694 gen_int_mode (tree_low_cst (exp1, 0),
7695 TYPE_MODE (TREE_TYPE (exp1)))));
7698 if (modifier == EXPAND_STACK_PARM)
7701 /* Check for multiplying things that have been extended
7702 from a narrower type. If this machine supports multiplying
7703 in that narrower type with a result in the desired type,
7704 do it that way, and avoid the explicit type-conversion. */
7708 subexp0_def = get_def_for_expr (subexp0, NOP_EXPR);
7709 subexp1_def = get_def_for_expr (subexp1, NOP_EXPR);
7710 top0 = top1 = NULL_TREE;
7712 /* First, check if we have a multiplication of one signed and one
7713 unsigned operand. */
7715 && (top0 = gimple_assign_rhs1 (subexp0_def))
7717 && (top1 = gimple_assign_rhs1 (subexp1_def))
7718 && TREE_CODE (type) == INTEGER_TYPE
7719 && (TYPE_PRECISION (TREE_TYPE (top0))
7720 < TYPE_PRECISION (TREE_TYPE (subexp0)))
7721 && (TYPE_PRECISION (TREE_TYPE (top0))
7722 == TYPE_PRECISION (TREE_TYPE (top1)))
7723 && (TYPE_UNSIGNED (TREE_TYPE (top0))
7724 != TYPE_UNSIGNED (TREE_TYPE (top1))))
7726 enum machine_mode innermode
7727 = TYPE_MODE (TREE_TYPE (top0));
7728 this_optab = usmul_widen_optab;
7729 if (mode == GET_MODE_WIDER_MODE (innermode))
7731 if (optab_handler (this_optab, mode)->insn_code != CODE_FOR_nothing)
7733 if (TYPE_UNSIGNED (TREE_TYPE (top0)))
7734 expand_operands (top0, top1, NULL_RTX, &op0, &op1,
7737 expand_operands (top0, top1, NULL_RTX, &op1, &op0,
7744 /* Check for a multiplication with matching signedness. If
7745 valid, TOP0 and TOP1 were set in the previous if
7748 && TREE_CODE (type) == INTEGER_TYPE
7749 && (TYPE_PRECISION (TREE_TYPE (top0))
7750 < TYPE_PRECISION (TREE_TYPE (subexp0)))
7751 && ((TREE_CODE (subexp1) == INTEGER_CST
7752 && int_fits_type_p (subexp1, TREE_TYPE (top0))
7753 /* Don't use a widening multiply if a shift will do. */
7754 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (subexp1)))
7755 > HOST_BITS_PER_WIDE_INT)
7756 || exact_log2 (TREE_INT_CST_LOW (subexp1)) < 0))
7759 && (TYPE_PRECISION (TREE_TYPE (top1))
7760 == TYPE_PRECISION (TREE_TYPE (top0))
7761 /* If both operands are extended, they must either both
7762 be zero-extended or both be sign-extended. */
7763 && (TYPE_UNSIGNED (TREE_TYPE (top1))
7764 == TYPE_UNSIGNED (TREE_TYPE (top0)))))))
7766 tree op0type = TREE_TYPE (top0);
7767 enum machine_mode innermode = TYPE_MODE (op0type);
7768 bool zextend_p = TYPE_UNSIGNED (op0type);
7769 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7770 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7772 if (mode == GET_MODE_2XWIDER_MODE (innermode))
7774 if (optab_handler (this_optab, mode)->insn_code != CODE_FOR_nothing)
7776 if (TREE_CODE (subexp1) == INTEGER_CST)
7777 expand_operands (top0, subexp1, NULL_RTX, &op0, &op1,
7780 expand_operands (top0, top1, NULL_RTX, &op0, &op1,
7784 else if (optab_handler (other_optab, mode)->insn_code != CODE_FOR_nothing
7785 && innermode == word_mode)
7788 op0 = expand_normal (top0);
7789 if (TREE_CODE (subexp1) == INTEGER_CST)
7790 op1 = convert_modes (innermode, mode,
7791 expand_normal (subexp1), unsignedp);
7793 op1 = expand_normal (top1);
7794 temp = expand_binop (mode, other_optab, op0, op1, target,
7795 unsignedp, OPTAB_LIB_WIDEN);
7796 hipart = gen_highpart (innermode, temp);
7797 htem = expand_mult_highpart_adjust (innermode, hipart,
7801 emit_move_insn (hipart, htem);
7802 return REDUCE_BIT_FIELD (temp);
7806 expand_operands (subexp0, subexp1, subtarget, &op0, &op1, EXPAND_NORMAL);
7807 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7809 case TRUNC_DIV_EXPR:
7810 case FLOOR_DIV_EXPR:
7812 case ROUND_DIV_EXPR:
7813 case EXACT_DIV_EXPR:
7814 /* If this is a fixed-point operation, then we cannot use the code
7815 below because "expand_divmod" doesn't support sat/no-sat fixed-point
7817 if (ALL_FIXED_POINT_MODE_P (mode))
7820 if (modifier == EXPAND_STACK_PARM)
7822 /* Possible optimization: compute the dividend with EXPAND_SUM
7823 then if the divisor is constant can optimize the case
7824 where some terms of the dividend have coeffs divisible by it. */
7825 expand_operands (treeop0, treeop1,
7826 subtarget, &op0, &op1, EXPAND_NORMAL);
7827 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7832 case TRUNC_MOD_EXPR:
7833 case FLOOR_MOD_EXPR:
7835 case ROUND_MOD_EXPR:
7836 if (modifier == EXPAND_STACK_PARM)
7838 expand_operands (treeop0, treeop1,
7839 subtarget, &op0, &op1, EXPAND_NORMAL);
7840 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7842 case FIXED_CONVERT_EXPR:
7843 op0 = expand_normal (treeop0);
7844 if (target == 0 || modifier == EXPAND_STACK_PARM)
7845 target = gen_reg_rtx (mode);
7847 if ((TREE_CODE (TREE_TYPE (treeop0)) == INTEGER_TYPE
7848 && TYPE_UNSIGNED (TREE_TYPE (treeop0)))
7849 || (TREE_CODE (type) == INTEGER_TYPE && TYPE_UNSIGNED (type)))
7850 expand_fixed_convert (target, op0, 1, TYPE_SATURATING (type));
7852 expand_fixed_convert (target, op0, 0, TYPE_SATURATING (type));
7855 case FIX_TRUNC_EXPR:
7856 op0 = expand_normal (treeop0);
7857 if (target == 0 || modifier == EXPAND_STACK_PARM)
7858 target = gen_reg_rtx (mode);
7859 expand_fix (target, op0, unsignedp);
7863 op0 = expand_normal (treeop0);
7864 if (target == 0 || modifier == EXPAND_STACK_PARM)
7865 target = gen_reg_rtx (mode);
7866 /* expand_float can't figure out what to do if FROM has VOIDmode.
7867 So give it the correct mode. With -O, cse will optimize this. */
7868 if (GET_MODE (op0) == VOIDmode)
7869 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0)),
7871 expand_float (target, op0,
7872 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
7876 op0 = expand_expr (treeop0, subtarget,
7877 VOIDmode, EXPAND_NORMAL);
7878 if (modifier == EXPAND_STACK_PARM)
7880 temp = expand_unop (mode,
7881 optab_for_tree_code (NEGATE_EXPR, type,
7885 return REDUCE_BIT_FIELD (temp);
7888 op0 = expand_expr (treeop0, subtarget,
7889 VOIDmode, EXPAND_NORMAL);
7890 if (modifier == EXPAND_STACK_PARM)
7893 /* ABS_EXPR is not valid for complex arguments. */
7894 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7895 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
7897 /* Unsigned abs is simply the operand. Testing here means we don't
7898 risk generating incorrect code below. */
7899 if (TYPE_UNSIGNED (type))
7902 return expand_abs (mode, op0, target, unsignedp,
7903 safe_from_p (target, treeop0, 1));
7907 target = original_target;
7909 || modifier == EXPAND_STACK_PARM
7910 || (MEM_P (target) && MEM_VOLATILE_P (target))
7911 || GET_MODE (target) != mode
7913 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7914 target = gen_reg_rtx (mode);
7915 expand_operands (treeop0, treeop1,
7916 target, &op0, &op1, EXPAND_NORMAL);
7918 /* First try to do it with a special MIN or MAX instruction.
7919 If that does not win, use a conditional jump to select the proper
7921 this_optab = optab_for_tree_code (code, type, optab_default);
7922 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7927 /* At this point, a MEM target is no longer useful; we will get better
7930 if (! REG_P (target))
7931 target = gen_reg_rtx (mode);
7933 /* If op1 was placed in target, swap op0 and op1. */
7934 if (target != op0 && target == op1)
7941 /* We generate better code and avoid problems with op1 mentioning
7942 target by forcing op1 into a pseudo if it isn't a constant. */
7943 if (! CONSTANT_P (op1))
7944 op1 = force_reg (mode, op1);
7947 enum rtx_code comparison_code;
7950 if (code == MAX_EXPR)
7951 comparison_code = unsignedp ? GEU : GE;
7953 comparison_code = unsignedp ? LEU : LE;
7955 /* Canonicalize to comparisons against 0. */
7956 if (op1 == const1_rtx)
7958 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
7959 or (a != 0 ? a : 1) for unsigned.
7960 For MIN we are safe converting (a <= 1 ? a : 1)
7961 into (a <= 0 ? a : 1) */
7962 cmpop1 = const0_rtx;
7963 if (code == MAX_EXPR)
7964 comparison_code = unsignedp ? NE : GT;
7966 if (op1 == constm1_rtx && !unsignedp)
7968 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
7969 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
7970 cmpop1 = const0_rtx;
7971 if (code == MIN_EXPR)
7972 comparison_code = LT;
7974 #ifdef HAVE_conditional_move
7975 /* Use a conditional move if possible. */
7976 if (can_conditionally_move_p (mode))
7980 /* ??? Same problem as in expmed.c: emit_conditional_move
7981 forces a stack adjustment via compare_from_rtx, and we
7982 lose the stack adjustment if the sequence we are about
7983 to create is discarded. */
7984 do_pending_stack_adjust ();
7988 /* Try to emit the conditional move. */
7989 insn = emit_conditional_move (target, comparison_code,
7994 /* If we could do the conditional move, emit the sequence,
7998 rtx seq = get_insns ();
8004 /* Otherwise discard the sequence and fall back to code with
8010 emit_move_insn (target, op0);
8012 temp = gen_label_rtx ();
8013 do_compare_rtx_and_jump (target, cmpop1, comparison_code,
8014 unsignedp, mode, NULL_RTX, NULL_RTX, temp);
8016 emit_move_insn (target, op1);
8021 op0 = expand_expr (treeop0, subtarget,
8022 VOIDmode, EXPAND_NORMAL);
8023 if (modifier == EXPAND_STACK_PARM)
8025 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8029 /* ??? Can optimize bitwise operations with one arg constant.
8030 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8031 and (a bitwise1 b) bitwise2 b (etc)
8032 but that is probably not worth while. */
8034 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8035 boolean values when we want in all cases to compute both of them. In
8036 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8037 as actual zero-or-1 values and then bitwise anding. In cases where
8038 there cannot be any side effects, better code would be made by
8039 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8040 how to recognize those cases. */
8042 case TRUTH_AND_EXPR:
8043 code = BIT_AND_EXPR;
8048 code = BIT_IOR_EXPR;
8052 case TRUTH_XOR_EXPR:
8053 code = BIT_XOR_EXPR;
8059 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type))
8060 || (GET_MODE_PRECISION (TYPE_MODE (type))
8061 == TYPE_PRECISION (type)));
8066 /* If this is a fixed-point operation, then we cannot use the code
8067 below because "expand_shift" doesn't support sat/no-sat fixed-point
8069 if (ALL_FIXED_POINT_MODE_P (mode))
8072 if (! safe_from_p (subtarget, treeop1, 1))
8074 if (modifier == EXPAND_STACK_PARM)
8076 op0 = expand_expr (treeop0, subtarget,
8077 VOIDmode, EXPAND_NORMAL);
8078 temp = expand_shift (code, mode, op0, treeop1, target,
8080 if (code == LSHIFT_EXPR)
8081 temp = REDUCE_BIT_FIELD (temp);
8084 /* Could determine the answer when only additive constants differ. Also,
8085 the addition of one can be handled by changing the condition. */
8092 case UNORDERED_EXPR:
8100 temp = do_store_flag (ops,
8101 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8102 tmode != VOIDmode ? tmode : mode);
8106 /* Use a compare and a jump for BLKmode comparisons, or for function
8107 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8110 || modifier == EXPAND_STACK_PARM
8111 || ! safe_from_p (target, treeop0, 1)
8112 || ! safe_from_p (target, treeop1, 1)
8113 /* Make sure we don't have a hard reg (such as function's return
8114 value) live across basic blocks, if not optimizing. */
8115 || (!optimize && REG_P (target)
8116 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8117 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8119 emit_move_insn (target, const0_rtx);
8121 op1 = gen_label_rtx ();
8122 jumpifnot_1 (code, treeop0, treeop1, op1);
8124 emit_move_insn (target, const1_rtx);
8129 case TRUTH_NOT_EXPR:
8130 if (modifier == EXPAND_STACK_PARM)
8132 op0 = expand_expr (treeop0, target,
8133 VOIDmode, EXPAND_NORMAL);
8134 /* The parser is careful to generate TRUTH_NOT_EXPR
8135 only with operands that are always zero or one. */
8136 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8137 target, 1, OPTAB_LIB_WIDEN);
8142 /* Get the rtx code of the operands. */
8143 op0 = expand_normal (treeop0);
8144 op1 = expand_normal (treeop1);
8147 target = gen_reg_rtx (TYPE_MODE (type));
8149 /* Move the real (op0) and imaginary (op1) parts to their location. */
8150 write_complex_part (target, op0, false);
8151 write_complex_part (target, op1, true);
8155 case WIDEN_SUM_EXPR:
8157 tree oprnd0 = treeop0;
8158 tree oprnd1 = treeop1;
8160 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8161 target = expand_widen_pattern_expr (ops, op0, NULL_RTX, op1,
8166 case REDUC_MAX_EXPR:
8167 case REDUC_MIN_EXPR:
8168 case REDUC_PLUS_EXPR:
8170 op0 = expand_normal (treeop0);
8171 this_optab = optab_for_tree_code (code, type, optab_default);
8172 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8177 case VEC_EXTRACT_EVEN_EXPR:
8178 case VEC_EXTRACT_ODD_EXPR:
8180 expand_operands (treeop0, treeop1,
8181 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8182 this_optab = optab_for_tree_code (code, type, optab_default);
8183 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8189 case VEC_INTERLEAVE_HIGH_EXPR:
8190 case VEC_INTERLEAVE_LOW_EXPR:
8192 expand_operands (treeop0, treeop1,
8193 NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8194 this_optab = optab_for_tree_code (code, type, optab_default);
8195 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
8201 case VEC_LSHIFT_EXPR:
8202 case VEC_RSHIFT_EXPR:
8204 target = expand_vec_shift_expr (ops, target);
8208 case VEC_UNPACK_HI_EXPR:
8209 case VEC_UNPACK_LO_EXPR:
8211 op0 = expand_normal (treeop0);
8212 this_optab = optab_for_tree_code (code, type, optab_default);
8213 temp = expand_widen_pattern_expr (ops, op0, NULL_RTX, NULL_RTX,
8219 case VEC_UNPACK_FLOAT_HI_EXPR:
8220 case VEC_UNPACK_FLOAT_LO_EXPR:
8222 op0 = expand_normal (treeop0);
8223 /* The signedness is determined from input operand. */
8224 this_optab = optab_for_tree_code (code,
8225 TREE_TYPE (treeop0),
8227 temp = expand_widen_pattern_expr
8228 (ops, op0, NULL_RTX, NULL_RTX,
8229 target, TYPE_UNSIGNED (TREE_TYPE (treeop0)));
8235 case VEC_WIDEN_MULT_HI_EXPR:
8236 case VEC_WIDEN_MULT_LO_EXPR:
8238 tree oprnd0 = treeop0;
8239 tree oprnd1 = treeop1;
8241 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
8242 target = expand_widen_pattern_expr (ops, op0, op1, NULL_RTX,
8244 gcc_assert (target);
8248 case VEC_PACK_TRUNC_EXPR:
8249 case VEC_PACK_SAT_EXPR:
8250 case VEC_PACK_FIX_TRUNC_EXPR:
8251 mode = TYPE_MODE (TREE_TYPE (treeop0));
8258 /* Here to do an ordinary binary operator. */
8260 expand_operands (treeop0, treeop1,
8261 subtarget, &op0, &op1, EXPAND_NORMAL);
8263 this_optab = optab_for_tree_code (code, type, optab_default);
8265 if (modifier == EXPAND_STACK_PARM)
8267 temp = expand_binop (mode, this_optab, op0, op1, target,
8268 unsignedp, OPTAB_LIB_WIDEN);
8270 return REDUCE_BIT_FIELD (temp);
8272 #undef REDUCE_BIT_FIELD
8275 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
8276 enum expand_modifier modifier, rtx *alt_rtl)
8278 rtx op0, op1, temp, decl_rtl;
8281 enum machine_mode mode;
8282 enum tree_code code = TREE_CODE (exp);
8284 rtx subtarget, original_target;
8287 bool reduce_bit_field;
8288 location_t loc = EXPR_LOCATION (exp);
8289 struct separate_ops ops;
8290 tree treeop0, treeop1, treeop2;
8292 type = TREE_TYPE (exp);
8293 mode = TYPE_MODE (type);
8294 unsignedp = TYPE_UNSIGNED (type);
8296 treeop0 = treeop1 = treeop2 = NULL_TREE;
8297 if (!VL_EXP_CLASS_P (exp))
8298 switch (TREE_CODE_LENGTH (code))
8301 case 3: treeop2 = TREE_OPERAND (exp, 2);
8302 case 2: treeop1 = TREE_OPERAND (exp, 1);
8303 case 1: treeop0 = TREE_OPERAND (exp, 0);
8313 ignore = (target == const0_rtx
8314 || ((CONVERT_EXPR_CODE_P (code)
8315 || code == COND_EXPR || code == VIEW_CONVERT_EXPR)
8316 && TREE_CODE (type) == VOID_TYPE));
8318 /* An operation in what may be a bit-field type needs the
8319 result to be reduced to the precision of the bit-field type,
8320 which is narrower than that of the type's mode. */
8321 reduce_bit_field = (!ignore
8322 && TREE_CODE (type) == INTEGER_TYPE
8323 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type));
8325 /* If we are going to ignore this result, we need only do something
8326 if there is a side-effect somewhere in the expression. If there
8327 is, short-circuit the most common cases here. Note that we must
8328 not call expand_expr with anything but const0_rtx in case this
8329 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
8333 if (! TREE_SIDE_EFFECTS (exp))
8336 /* Ensure we reference a volatile object even if value is ignored, but
8337 don't do this if all we are doing is taking its address. */
8338 if (TREE_THIS_VOLATILE (exp)
8339 && TREE_CODE (exp) != FUNCTION_DECL
8340 && mode != VOIDmode && mode != BLKmode
8341 && modifier != EXPAND_CONST_ADDRESS)
8343 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
8345 temp = copy_to_reg (temp);
8349 if (TREE_CODE_CLASS (code) == tcc_unary
8350 || code == COMPONENT_REF || code == INDIRECT_REF)
8351 return expand_expr (treeop0, const0_rtx, VOIDmode,
8354 else if (TREE_CODE_CLASS (code) == tcc_binary
8355 || TREE_CODE_CLASS (code) == tcc_comparison
8356 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
8358 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8359 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8362 else if (code == BIT_FIELD_REF)
8364 expand_expr (treeop0, const0_rtx, VOIDmode, modifier);
8365 expand_expr (treeop1, const0_rtx, VOIDmode, modifier);
8366 expand_expr (treeop2, const0_rtx, VOIDmode, modifier);
8373 if (reduce_bit_field && modifier == EXPAND_STACK_PARM)
8376 /* Use subtarget as the target for operand 0 of a binary operation. */
8377 subtarget = get_subtarget (target);
8378 original_target = target;
8384 tree function = decl_function_context (exp);
8386 temp = label_rtx (exp);
8387 temp = gen_rtx_LABEL_REF (Pmode, temp);
8389 if (function != current_function_decl
8391 LABEL_REF_NONLOCAL_P (temp) = 1;
8393 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
8398 /* ??? ivopts calls expander, without any preparation from
8399 out-of-ssa. So fake instructions as if this was an access to the
8400 base variable. This unnecessarily allocates a pseudo, see how we can
8401 reuse it, if partition base vars have it set already. */
8402 if (!currently_expanding_to_rtl)
8403 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier, NULL);
8405 gimple g = get_gimple_for_ssa_name (exp);
8407 return expand_expr_real_1 (gimple_assign_rhs_to_tree (g), target,
8408 tmode, modifier, NULL);
8410 decl_rtl = get_rtx_for_ssa_name (exp);
8411 exp = SSA_NAME_VAR (exp);
8412 goto expand_decl_rtl;
8416 /* If a static var's type was incomplete when the decl was written,
8417 but the type is complete now, lay out the decl now. */
8418 if (DECL_SIZE (exp) == 0
8419 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
8420 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
8421 layout_decl (exp, 0);
8423 /* TLS emulation hook - replace __thread vars with
8424 *__emutls_get_address (&_emutls.var). */
8425 if (! targetm.have_tls
8426 && TREE_CODE (exp) == VAR_DECL
8427 && DECL_THREAD_LOCAL_P (exp))
8429 exp = build_fold_indirect_ref_loc (loc, emutls_var_address (exp));
8430 return expand_expr_real_1 (exp, target, tmode, modifier, NULL);
8433 /* ... fall through ... */
8437 decl_rtl = DECL_RTL (exp);
8439 gcc_assert (decl_rtl);
8440 decl_rtl = copy_rtx (decl_rtl);
8442 /* Ensure variable marked as used even if it doesn't go through
8443 a parser. If it hasn't be used yet, write out an external
8445 if (! TREE_USED (exp))
8447 assemble_external (exp);
8448 TREE_USED (exp) = 1;
8451 /* Show we haven't gotten RTL for this yet. */
8454 /* Variables inherited from containing functions should have
8455 been lowered by this point. */
8456 context = decl_function_context (exp);
8457 gcc_assert (!context
8458 || context == current_function_decl
8459 || TREE_STATIC (exp)
8460 /* ??? C++ creates functions that are not TREE_STATIC. */
8461 || TREE_CODE (exp) == FUNCTION_DECL);
8463 /* This is the case of an array whose size is to be determined
8464 from its initializer, while the initializer is still being parsed.
8467 if (MEM_P (decl_rtl) && REG_P (XEXP (decl_rtl, 0)))
8468 temp = validize_mem (decl_rtl);
8470 /* If DECL_RTL is memory, we are in the normal case and the
8471 address is not valid, get the address into a register. */
8473 else if (MEM_P (decl_rtl) && modifier != EXPAND_INITIALIZER)
8476 *alt_rtl = decl_rtl;
8477 decl_rtl = use_anchored_address (decl_rtl);
8478 if (modifier != EXPAND_CONST_ADDRESS
8479 && modifier != EXPAND_SUM
8480 && !memory_address_addr_space_p (DECL_MODE (exp),
8482 MEM_ADDR_SPACE (decl_rtl)))
8483 temp = replace_equiv_address (decl_rtl,
8484 copy_rtx (XEXP (decl_rtl, 0)));
8487 /* If we got something, return it. But first, set the alignment
8488 if the address is a register. */
8491 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
8492 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
8497 /* If the mode of DECL_RTL does not match that of the decl, it
8498 must be a promoted value. We return a SUBREG of the wanted mode,
8499 but mark it so that we know that it was already extended. */
8501 if (REG_P (decl_rtl)
8502 && GET_MODE (decl_rtl) != DECL_MODE (exp))
8504 enum machine_mode pmode;
8506 /* Get the signedness used for this variable. Ensure we get the
8507 same mode we got when the variable was declared. */
8508 pmode = promote_decl_mode (exp, &unsignedp);
8509 gcc_assert (GET_MODE (decl_rtl) == pmode);
8511 temp = gen_lowpart_SUBREG (mode, decl_rtl);
8512 SUBREG_PROMOTED_VAR_P (temp) = 1;
8513 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
8520 temp = immed_double_const (TREE_INT_CST_LOW (exp),
8521 TREE_INT_CST_HIGH (exp), mode);
8527 tree tmp = NULL_TREE;
8528 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
8529 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT
8530 || GET_MODE_CLASS (mode) == MODE_VECTOR_FRACT
8531 || GET_MODE_CLASS (mode) == MODE_VECTOR_UFRACT
8532 || GET_MODE_CLASS (mode) == MODE_VECTOR_ACCUM
8533 || GET_MODE_CLASS (mode) == MODE_VECTOR_UACCUM)
8534 return const_vector_from_tree (exp);
8535 if (GET_MODE_CLASS (mode) == MODE_INT)
8537 tree type_for_mode = lang_hooks.types.type_for_mode (mode, 1);
8539 tmp = fold_unary_loc (loc, VIEW_CONVERT_EXPR, type_for_mode, exp);
8542 tmp = build_constructor_from_list (type,
8543 TREE_VECTOR_CST_ELTS (exp));
8544 return expand_expr (tmp, ignore ? const0_rtx : target,
8549 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
8552 /* If optimized, generate immediate CONST_DOUBLE
8553 which will be turned into memory by reload if necessary.
8555 We used to force a register so that loop.c could see it. But
8556 this does not allow gen_* patterns to perform optimizations with
8557 the constants. It also produces two insns in cases like "x = 1.0;".
8558 On most machines, floating-point constants are not permitted in
8559 many insns, so we'd end up copying it to a register in any case.
8561 Now, we do the copying in expand_binop, if appropriate. */
8562 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
8563 TYPE_MODE (TREE_TYPE (exp)));
8566 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp),
8567 TYPE_MODE (TREE_TYPE (exp)));
8570 /* Handle evaluating a complex constant in a CONCAT target. */
8571 if (original_target && GET_CODE (original_target) == CONCAT)
8573 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
8576 rtarg = XEXP (original_target, 0);
8577 itarg = XEXP (original_target, 1);
8579 /* Move the real and imaginary parts separately. */
8580 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, EXPAND_NORMAL);
8581 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, EXPAND_NORMAL);
8584 emit_move_insn (rtarg, op0);
8586 emit_move_insn (itarg, op1);
8588 return original_target;
8591 /* ... fall through ... */
8594 temp = expand_expr_constant (exp, 1, modifier);
8596 /* temp contains a constant address.
8597 On RISC machines where a constant address isn't valid,
8598 make some insns to get that address into a register. */
8599 if (modifier != EXPAND_CONST_ADDRESS
8600 && modifier != EXPAND_INITIALIZER
8601 && modifier != EXPAND_SUM
8602 && ! memory_address_addr_space_p (mode, XEXP (temp, 0),
8603 MEM_ADDR_SPACE (temp)))
8604 return replace_equiv_address (temp,
8605 copy_rtx (XEXP (temp, 0)));
8611 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
8613 if (!SAVE_EXPR_RESOLVED_P (exp))
8615 /* We can indeed still hit this case, typically via builtin
8616 expanders calling save_expr immediately before expanding
8617 something. Assume this means that we only have to deal
8618 with non-BLKmode values. */
8619 gcc_assert (GET_MODE (ret) != BLKmode);
8621 val = build_decl (EXPR_LOCATION (exp),
8622 VAR_DECL, NULL, TREE_TYPE (exp));
8623 DECL_ARTIFICIAL (val) = 1;
8624 DECL_IGNORED_P (val) = 1;
8626 TREE_OPERAND (exp, 0) = treeop0;
8627 SAVE_EXPR_RESOLVED_P (exp) = 1;
8629 if (!CONSTANT_P (ret))
8630 ret = copy_to_reg (ret);
8631 SET_DECL_RTL (val, ret);
8639 /* If we don't need the result, just ensure we evaluate any
8643 unsigned HOST_WIDE_INT idx;
8646 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
8647 expand_expr (value, const0_rtx, VOIDmode, EXPAND_NORMAL);
8652 return expand_constructor (exp, target, modifier, false);
8654 case MISALIGNED_INDIRECT_REF:
8655 case ALIGN_INDIRECT_REF:
8658 tree exp1 = treeop0;
8659 addr_space_t as = ADDR_SPACE_GENERIC;
8660 enum machine_mode address_mode = Pmode;
8662 if (modifier != EXPAND_WRITE)
8666 t = fold_read_from_constant_string (exp);
8668 return expand_expr (t, target, tmode, modifier);
8671 if (POINTER_TYPE_P (TREE_TYPE (exp1)))
8673 as = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp1)));
8674 address_mode = targetm.addr_space.address_mode (as);
8677 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
8678 op0 = memory_address_addr_space (mode, op0, as);
8680 if (code == ALIGN_INDIRECT_REF)
8682 int align = TYPE_ALIGN_UNIT (type);
8683 op0 = gen_rtx_AND (address_mode, op0, GEN_INT (-align));
8684 op0 = memory_address_addr_space (mode, op0, as);
8687 temp = gen_rtx_MEM (mode, op0);
8689 set_mem_attributes (temp, exp, 0);
8690 set_mem_addr_space (temp, as);
8692 /* Resolve the misalignment now, so that we don't have to remember
8693 to resolve it later. Of course, this only works for reads. */
8694 if (code == MISALIGNED_INDIRECT_REF)
8699 gcc_assert (modifier == EXPAND_NORMAL
8700 || modifier == EXPAND_STACK_PARM);
8702 /* The vectorizer should have already checked the mode. */
8703 icode = optab_handler (movmisalign_optab, mode)->insn_code;
8704 gcc_assert (icode != CODE_FOR_nothing);
8706 /* We've already validated the memory, and we're creating a
8707 new pseudo destination. The predicates really can't fail. */
8708 reg = gen_reg_rtx (mode);
8710 /* Nor can the insn generator. */
8711 insn = GEN_FCN (icode) (reg, temp);
8720 case TARGET_MEM_REF:
8722 addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (exp));
8723 struct mem_address addr;
8725 get_address_description (exp, &addr);
8726 op0 = addr_for_mem_ref (&addr, as, true);
8727 op0 = memory_address_addr_space (mode, op0, as);
8728 temp = gen_rtx_MEM (mode, op0);
8729 set_mem_attributes (temp, TMR_ORIGINAL (exp), 0);
8730 set_mem_addr_space (temp, as);
8737 tree array = treeop0;
8738 tree index = treeop1;
8740 /* Fold an expression like: "foo"[2].
8741 This is not done in fold so it won't happen inside &.
8742 Don't fold if this is for wide characters since it's too
8743 difficult to do correctly and this is a very rare case. */
8745 if (modifier != EXPAND_CONST_ADDRESS
8746 && modifier != EXPAND_INITIALIZER
8747 && modifier != EXPAND_MEMORY)
8749 tree t = fold_read_from_constant_string (exp);
8752 return expand_expr (t, target, tmode, modifier);
8755 /* If this is a constant index into a constant array,
8756 just get the value from the array. Handle both the cases when
8757 we have an explicit constructor and when our operand is a variable
8758 that was declared const. */
8760 if (modifier != EXPAND_CONST_ADDRESS
8761 && modifier != EXPAND_INITIALIZER
8762 && modifier != EXPAND_MEMORY
8763 && TREE_CODE (array) == CONSTRUCTOR
8764 && ! TREE_SIDE_EFFECTS (array)
8765 && TREE_CODE (index) == INTEGER_CST)
8767 unsigned HOST_WIDE_INT ix;
8770 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array), ix,
8772 if (tree_int_cst_equal (field, index))
8774 if (!TREE_SIDE_EFFECTS (value))
8775 return expand_expr (fold (value), target, tmode, modifier);
8780 else if (optimize >= 1
8781 && modifier != EXPAND_CONST_ADDRESS
8782 && modifier != EXPAND_INITIALIZER
8783 && modifier != EXPAND_MEMORY
8784 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
8785 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
8786 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
8787 && targetm.binds_local_p (array))
8789 if (TREE_CODE (index) == INTEGER_CST)
8791 tree init = DECL_INITIAL (array);
8793 if (TREE_CODE (init) == CONSTRUCTOR)
8795 unsigned HOST_WIDE_INT ix;
8798 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), ix,
8800 if (tree_int_cst_equal (field, index))
8802 if (TREE_SIDE_EFFECTS (value))
8805 if (TREE_CODE (value) == CONSTRUCTOR)
8807 /* If VALUE is a CONSTRUCTOR, this
8808 optimization is only useful if
8809 this doesn't store the CONSTRUCTOR
8810 into memory. If it does, it is more
8811 efficient to just load the data from
8812 the array directly. */
8813 rtx ret = expand_constructor (value, target,
8815 if (ret == NULL_RTX)
8819 return expand_expr (fold (value), target, tmode,
8823 else if(TREE_CODE (init) == STRING_CST)
8825 tree index1 = index;
8826 tree low_bound = array_ref_low_bound (exp);
8827 index1 = fold_convert_loc (loc, sizetype,
8830 /* Optimize the special-case of a zero lower bound.
8832 We convert the low_bound to sizetype to avoid some problems
8833 with constant folding. (E.g. suppose the lower bound is 1,
8834 and its mode is QI. Without the conversion,l (ARRAY
8835 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
8836 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
8838 if (! integer_zerop (low_bound))
8839 index1 = size_diffop_loc (loc, index1,
8840 fold_convert_loc (loc, sizetype,
8843 if (0 > compare_tree_int (index1,
8844 TREE_STRING_LENGTH (init)))
8846 tree type = TREE_TYPE (TREE_TYPE (init));
8847 enum machine_mode mode = TYPE_MODE (type);
8849 if (GET_MODE_CLASS (mode) == MODE_INT
8850 && GET_MODE_SIZE (mode) == 1)
8851 return gen_int_mode (TREE_STRING_POINTER (init)
8852 [TREE_INT_CST_LOW (index1)],
8859 goto normal_inner_ref;
8862 /* If the operand is a CONSTRUCTOR, we can just extract the
8863 appropriate field if it is present. */
8864 if (TREE_CODE (treeop0) == CONSTRUCTOR)
8866 unsigned HOST_WIDE_INT idx;
8869 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0),
8871 if (field == treeop1
8872 /* We can normally use the value of the field in the
8873 CONSTRUCTOR. However, if this is a bitfield in
8874 an integral mode that we can fit in a HOST_WIDE_INT,
8875 we must mask only the number of bits in the bitfield,
8876 since this is done implicitly by the constructor. If
8877 the bitfield does not meet either of those conditions,
8878 we can't do this optimization. */
8879 && (! DECL_BIT_FIELD (field)
8880 || ((GET_MODE_CLASS (DECL_MODE (field)) == MODE_INT)
8881 && (GET_MODE_BITSIZE (DECL_MODE (field))
8882 <= HOST_BITS_PER_WIDE_INT))))
8884 if (DECL_BIT_FIELD (field)
8885 && modifier == EXPAND_STACK_PARM)
8887 op0 = expand_expr (value, target, tmode, modifier);
8888 if (DECL_BIT_FIELD (field))
8890 HOST_WIDE_INT bitsize = TREE_INT_CST_LOW (DECL_SIZE (field));
8891 enum machine_mode imode = TYPE_MODE (TREE_TYPE (field));
8893 if (TYPE_UNSIGNED (TREE_TYPE (field)))
8895 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
8896 op0 = expand_and (imode, op0, op1, target);
8901 = build_int_cst (NULL_TREE,
8902 GET_MODE_BITSIZE (imode) - bitsize);
8904 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
8906 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
8914 goto normal_inner_ref;
8917 case ARRAY_RANGE_REF:
8920 enum machine_mode mode1, mode2;
8921 HOST_WIDE_INT bitsize, bitpos;
8923 int volatilep = 0, must_force_mem;
8924 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
8925 &mode1, &unsignedp, &volatilep, true);
8926 rtx orig_op0, memloc;
8928 /* If we got back the original object, something is wrong. Perhaps
8929 we are evaluating an expression too early. In any event, don't
8930 infinitely recurse. */
8931 gcc_assert (tem != exp);
8933 /* If TEM's type is a union of variable size, pass TARGET to the inner
8934 computation, since it will need a temporary and TARGET is known
8935 to have to do. This occurs in unchecked conversion in Ada. */
8938 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
8939 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
8941 && modifier != EXPAND_STACK_PARM
8942 ? target : NULL_RTX),
8944 (modifier == EXPAND_INITIALIZER
8945 || modifier == EXPAND_CONST_ADDRESS
8946 || modifier == EXPAND_STACK_PARM)
8947 ? modifier : EXPAND_NORMAL);
8950 = CONSTANT_P (op0) ? TYPE_MODE (TREE_TYPE (tem)) : GET_MODE (op0);
8952 /* If we have either an offset, a BLKmode result, or a reference
8953 outside the underlying object, we must force it to memory.
8954 Such a case can occur in Ada if we have unchecked conversion
8955 of an expression from a scalar type to an aggregate type or
8956 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
8957 passed a partially uninitialized object or a view-conversion
8958 to a larger size. */
8959 must_force_mem = (offset
8961 || bitpos + bitsize > GET_MODE_BITSIZE (mode2));
8963 /* Handle CONCAT first. */
8964 if (GET_CODE (op0) == CONCAT && !must_force_mem)
8967 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)))
8970 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
8973 op0 = XEXP (op0, 0);
8974 mode2 = GET_MODE (op0);
8976 else if (bitpos == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
8977 && bitsize == GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 1)))
8981 op0 = XEXP (op0, 1);
8983 mode2 = GET_MODE (op0);
8986 /* Otherwise force into memory. */
8990 /* If this is a constant, put it in a register if it is a legitimate
8991 constant and we don't need a memory reference. */
8992 if (CONSTANT_P (op0)
8994 && LEGITIMATE_CONSTANT_P (op0)
8996 op0 = force_reg (mode2, op0);
8998 /* Otherwise, if this is a constant, try to force it to the constant
8999 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9000 is a legitimate constant. */
9001 else if (CONSTANT_P (op0) && (memloc = force_const_mem (mode2, op0)))
9002 op0 = validize_mem (memloc);
9004 /* Otherwise, if this is a constant or the object is not in memory
9005 and need be, put it there. */
9006 else if (CONSTANT_P (op0) || (!MEM_P (op0) && must_force_mem))
9008 tree nt = build_qualified_type (TREE_TYPE (tem),
9009 (TYPE_QUALS (TREE_TYPE (tem))
9010 | TYPE_QUAL_CONST));
9011 memloc = assign_temp (nt, 1, 1, 1);
9012 emit_move_insn (memloc, op0);
9018 enum machine_mode address_mode;
9019 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
9022 gcc_assert (MEM_P (op0));
9025 = targetm.addr_space.address_mode (MEM_ADDR_SPACE (op0));
9026 if (GET_MODE (offset_rtx) != address_mode)
9027 offset_rtx = convert_to_mode (address_mode, offset_rtx, 0);
9029 if (GET_MODE (op0) == BLKmode
9030 /* A constant address in OP0 can have VOIDmode, we must
9031 not try to call force_reg in that case. */
9032 && GET_MODE (XEXP (op0, 0)) != VOIDmode
9034 && (bitpos % bitsize) == 0
9035 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
9036 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
9038 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9042 op0 = offset_address (op0, offset_rtx,
9043 highest_pow2_factor (offset));
9046 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9047 record its alignment as BIGGEST_ALIGNMENT. */
9048 if (MEM_P (op0) && bitpos == 0 && offset != 0
9049 && is_aligning_offset (offset, tem))
9050 set_mem_align (op0, BIGGEST_ALIGNMENT);
9052 /* Don't forget about volatility even if this is a bitfield. */
9053 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
9055 if (op0 == orig_op0)
9056 op0 = copy_rtx (op0);
9058 MEM_VOLATILE_P (op0) = 1;
9061 /* In cases where an aligned union has an unaligned object
9062 as a field, we might be extracting a BLKmode value from
9063 an integer-mode (e.g., SImode) object. Handle this case
9064 by doing the extract into an object as wide as the field
9065 (which we know to be the width of a basic mode), then
9066 storing into memory, and changing the mode to BLKmode. */
9067 if (mode1 == VOIDmode
9068 || REG_P (op0) || GET_CODE (op0) == SUBREG
9069 || (mode1 != BLKmode && ! direct_load[(int) mode1]
9070 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
9071 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
9072 && modifier != EXPAND_CONST_ADDRESS
9073 && modifier != EXPAND_INITIALIZER)
9074 /* If the field isn't aligned enough to fetch as a memref,
9075 fetch it as a bit field. */
9076 || (mode1 != BLKmode
9077 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
9078 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
9080 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
9081 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
9082 && ((modifier == EXPAND_CONST_ADDRESS
9083 || modifier == EXPAND_INITIALIZER)
9085 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
9086 || (bitpos % BITS_PER_UNIT != 0)))
9087 /* If the type and the field are a constant size and the
9088 size of the type isn't the same size as the bitfield,
9089 we must use bitfield operations. */
9091 && TYPE_SIZE (TREE_TYPE (exp))
9092 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9093 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
9096 enum machine_mode ext_mode = mode;
9098 if (ext_mode == BLKmode
9099 && ! (target != 0 && MEM_P (op0)
9101 && bitpos % BITS_PER_UNIT == 0))
9102 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
9104 if (ext_mode == BLKmode)
9107 target = assign_temp (type, 0, 1, 1);
9112 /* In this case, BITPOS must start at a byte boundary and
9113 TARGET, if specified, must be a MEM. */
9114 gcc_assert (MEM_P (op0)
9115 && (!target || MEM_P (target))
9116 && !(bitpos % BITS_PER_UNIT));
9118 emit_block_move (target,
9119 adjust_address (op0, VOIDmode,
9120 bitpos / BITS_PER_UNIT),
9121 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
9123 (modifier == EXPAND_STACK_PARM
9124 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9129 op0 = validize_mem (op0);
9131 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
9132 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9134 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp,
9135 (modifier == EXPAND_STACK_PARM
9136 ? NULL_RTX : target),
9137 ext_mode, ext_mode);
9139 /* If the result is a record type and BITSIZE is narrower than
9140 the mode of OP0, an integral mode, and this is a big endian
9141 machine, we must put the field into the high-order bits. */
9142 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
9143 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
9144 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
9145 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
9146 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
9150 /* If the result type is BLKmode, store the data into a temporary
9151 of the appropriate type, but with the mode corresponding to the
9152 mode for the data we have (op0's mode). It's tempting to make
9153 this a constant type, since we know it's only being stored once,
9154 but that can cause problems if we are taking the address of this
9155 COMPONENT_REF because the MEM of any reference via that address
9156 will have flags corresponding to the type, which will not
9157 necessarily be constant. */
9158 if (mode == BLKmode)
9160 HOST_WIDE_INT size = GET_MODE_BITSIZE (ext_mode);
9163 /* If the reference doesn't use the alias set of its type,
9164 we cannot create the temporary using that type. */
9165 if (component_uses_parent_alias_set (exp))
9167 new_rtx = assign_stack_local (ext_mode, size, 0);
9168 set_mem_alias_set (new_rtx, get_alias_set (exp));
9171 new_rtx = assign_stack_temp_for_type (ext_mode, size, 0, type);
9173 emit_move_insn (new_rtx, op0);
9174 op0 = copy_rtx (new_rtx);
9175 PUT_MODE (op0, BLKmode);
9176 set_mem_attributes (op0, exp, 1);
9182 /* If the result is BLKmode, use that to access the object
9184 if (mode == BLKmode)
9187 /* Get a reference to just this component. */
9188 if (modifier == EXPAND_CONST_ADDRESS
9189 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
9190 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
9192 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
9194 if (op0 == orig_op0)
9195 op0 = copy_rtx (op0);
9197 set_mem_attributes (op0, exp, 0);
9198 if (REG_P (XEXP (op0, 0)))
9199 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9201 MEM_VOLATILE_P (op0) |= volatilep;
9202 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
9203 || modifier == EXPAND_CONST_ADDRESS
9204 || modifier == EXPAND_INITIALIZER)
9206 else if (target == 0)
9207 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9209 convert_move (target, op0, unsignedp);
9214 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
9217 /* All valid uses of __builtin_va_arg_pack () are removed during
9219 if (CALL_EXPR_VA_ARG_PACK (exp))
9220 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp);
9222 tree fndecl = get_callee_fndecl (exp), attr;
9225 && (attr = lookup_attribute ("error",
9226 DECL_ATTRIBUTES (fndecl))) != NULL)
9227 error ("%Kcall to %qs declared with attribute error: %s",
9228 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9229 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9231 && (attr = lookup_attribute ("warning",
9232 DECL_ATTRIBUTES (fndecl))) != NULL)
9233 warning_at (tree_nonartificial_location (exp),
9234 0, "%Kcall to %qs declared with attribute warning: %s",
9235 exp, identifier_to_locale (lang_hooks.decl_printable_name (fndecl, 1)),
9236 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr))));
9238 /* Check for a built-in function. */
9239 if (fndecl && DECL_BUILT_IN (fndecl))
9241 gcc_assert (DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_FRONTEND);
9242 return expand_builtin (exp, target, subtarget, tmode, ignore);
9245 return expand_call (exp, target, ignore);
9247 case VIEW_CONVERT_EXPR:
9250 /* If we are converting to BLKmode, try to avoid an intermediate
9251 temporary by fetching an inner memory reference. */
9253 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
9254 && TYPE_MODE (TREE_TYPE (treeop0)) != BLKmode
9255 && handled_component_p (treeop0))
9257 enum machine_mode mode1;
9258 HOST_WIDE_INT bitsize, bitpos;
9263 = get_inner_reference (treeop0, &bitsize, &bitpos,
9264 &offset, &mode1, &unsignedp, &volatilep,
9268 /* ??? We should work harder and deal with non-zero offsets. */
9270 && (bitpos % BITS_PER_UNIT) == 0
9272 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) == 0)
9274 /* See the normal_inner_ref case for the rationale. */
9277 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
9278 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
9280 && modifier != EXPAND_STACK_PARM
9281 ? target : NULL_RTX),
9283 (modifier == EXPAND_INITIALIZER
9284 || modifier == EXPAND_CONST_ADDRESS
9285 || modifier == EXPAND_STACK_PARM)
9286 ? modifier : EXPAND_NORMAL);
9288 if (MEM_P (orig_op0))
9292 /* Get a reference to just this component. */
9293 if (modifier == EXPAND_CONST_ADDRESS
9294 || modifier == EXPAND_SUM
9295 || modifier == EXPAND_INITIALIZER)
9296 op0 = adjust_address_nv (op0, mode, bitpos / BITS_PER_UNIT);
9298 op0 = adjust_address (op0, mode, bitpos / BITS_PER_UNIT);
9300 if (op0 == orig_op0)
9301 op0 = copy_rtx (op0);
9303 set_mem_attributes (op0, treeop0, 0);
9304 if (REG_P (XEXP (op0, 0)))
9305 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
9307 MEM_VOLATILE_P (op0) |= volatilep;
9313 op0 = expand_expr (treeop0,
9314 NULL_RTX, VOIDmode, modifier);
9316 /* If the input and output modes are both the same, we are done. */
9317 if (mode == GET_MODE (op0))
9319 /* If neither mode is BLKmode, and both modes are the same size
9320 then we can use gen_lowpart. */
9321 else if (mode != BLKmode && GET_MODE (op0) != BLKmode
9322 && GET_MODE_SIZE (mode) == GET_MODE_SIZE (GET_MODE (op0))
9323 && !COMPLEX_MODE_P (GET_MODE (op0)))
9325 if (GET_CODE (op0) == SUBREG)
9326 op0 = force_reg (GET_MODE (op0), op0);
9327 op0 = gen_lowpart (mode, op0);
9329 /* If both modes are integral, then we can convert from one to the
9331 else if (SCALAR_INT_MODE_P (GET_MODE (op0)) && SCALAR_INT_MODE_P (mode))
9332 op0 = convert_modes (mode, GET_MODE (op0), op0,
9333 TYPE_UNSIGNED (TREE_TYPE (treeop0)));
9334 /* As a last resort, spill op0 to memory, and reload it in a
9336 else if (!MEM_P (op0))
9338 /* If the operand is not a MEM, force it into memory. Since we
9339 are going to be changing the mode of the MEM, don't call
9340 force_const_mem for constants because we don't allow pool
9341 constants to change mode. */
9342 tree inner_type = TREE_TYPE (treeop0);
9344 gcc_assert (!TREE_ADDRESSABLE (exp));
9346 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
9348 = assign_stack_temp_for_type
9349 (TYPE_MODE (inner_type),
9350 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
9352 emit_move_insn (target, op0);
9356 /* At this point, OP0 is in the correct mode. If the output type is
9357 such that the operand is known to be aligned, indicate that it is.
9358 Otherwise, we need only be concerned about alignment for non-BLKmode
9362 op0 = copy_rtx (op0);
9364 if (TYPE_ALIGN_OK (type))
9365 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
9366 else if (STRICT_ALIGNMENT
9368 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode))
9370 tree inner_type = TREE_TYPE (treeop0);
9371 HOST_WIDE_INT temp_size
9372 = MAX (int_size_in_bytes (inner_type),
9373 (HOST_WIDE_INT) GET_MODE_SIZE (mode));
9375 = assign_stack_temp_for_type (mode, temp_size, 0, type);
9376 rtx new_with_op0_mode
9377 = adjust_address (new_rtx, GET_MODE (op0), 0);
9379 gcc_assert (!TREE_ADDRESSABLE (exp));
9381 if (GET_MODE (op0) == BLKmode)
9382 emit_block_move (new_with_op0_mode, op0,
9383 GEN_INT (GET_MODE_SIZE (mode)),
9384 (modifier == EXPAND_STACK_PARM
9385 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
9387 emit_move_insn (new_with_op0_mode, op0);
9392 op0 = adjust_address (op0, mode, 0);
9397 /* Use a compare and a jump for BLKmode comparisons, or for function
9398 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
9400 /* Although TRUTH_{AND,OR}IF_EXPR aren't present in GIMPLE, they
9401 are occassionally created by folding during expansion. */
9402 case TRUTH_ANDIF_EXPR:
9403 case TRUTH_ORIF_EXPR:
9406 || modifier == EXPAND_STACK_PARM
9407 || ! safe_from_p (target, treeop0, 1)
9408 || ! safe_from_p (target, treeop1, 1)
9409 /* Make sure we don't have a hard reg (such as function's return
9410 value) live across basic blocks, if not optimizing. */
9411 || (!optimize && REG_P (target)
9412 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
9413 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
9416 emit_move_insn (target, const0_rtx);
9418 op1 = gen_label_rtx ();
9419 jumpifnot_1 (code, treeop0, treeop1, op1);
9422 emit_move_insn (target, const1_rtx);
9425 return ignore ? const0_rtx : target;
9427 case STATEMENT_LIST:
9429 tree_stmt_iterator iter;
9431 gcc_assert (ignore);
9433 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
9434 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
9439 /* A COND_EXPR with its type being VOID_TYPE represents a
9440 conditional jump and is handled in
9441 expand_gimple_cond_expr. */
9442 gcc_assert (!VOID_TYPE_P (type));
9444 /* Note that COND_EXPRs whose type is a structure or union
9445 are required to be constructed to contain assignments of
9446 a temporary variable, so that we can evaluate them here
9447 for side effect only. If type is void, we must do likewise. */
9449 gcc_assert (!TREE_ADDRESSABLE (type)
9451 && TREE_TYPE (treeop1) != void_type_node
9452 && TREE_TYPE (treeop2) != void_type_node);
9454 /* If we are not to produce a result, we have no target. Otherwise,
9455 if a target was specified use it; it will not be used as an
9456 intermediate target unless it is safe. If no target, use a
9459 if (modifier != EXPAND_STACK_PARM
9461 && safe_from_p (original_target, treeop0, 1)
9462 && GET_MODE (original_target) == mode
9463 #ifdef HAVE_conditional_move
9464 && (! can_conditionally_move_p (mode)
9465 || REG_P (original_target))
9467 && !MEM_P (original_target))
9468 temp = original_target;
9470 temp = assign_temp (type, 0, 0, 1);
9472 do_pending_stack_adjust ();
9474 op0 = gen_label_rtx ();
9475 op1 = gen_label_rtx ();
9476 jumpifnot (treeop0, op0);
9477 store_expr (treeop1, temp,
9478 modifier == EXPAND_STACK_PARM,
9481 emit_jump_insn (gen_jump (op1));
9484 store_expr (treeop2, temp,
9485 modifier == EXPAND_STACK_PARM,
9493 target = expand_vec_cond_expr (type, treeop0, treeop1, treeop2, target);
9500 gcc_assert (ignore);
9502 /* Check for |= or &= of a bitfield of size one into another bitfield
9503 of size 1. In this case, (unless we need the result of the
9504 assignment) we can do this more efficiently with a
9505 test followed by an assignment, if necessary.
9507 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9508 things change so we do, this code should be enhanced to
9510 if (TREE_CODE (lhs) == COMPONENT_REF
9511 && (TREE_CODE (rhs) == BIT_IOR_EXPR
9512 || TREE_CODE (rhs) == BIT_AND_EXPR)
9513 && TREE_OPERAND (rhs, 0) == lhs
9514 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
9515 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
9516 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
9518 rtx label = gen_label_rtx ();
9519 int value = TREE_CODE (rhs) == BIT_IOR_EXPR;
9520 do_jump (TREE_OPERAND (rhs, 1),
9523 expand_assignment (lhs, build_int_cst (TREE_TYPE (rhs), value),
9524 MOVE_NONTEMPORAL (exp));
9525 do_pending_stack_adjust ();
9530 expand_assignment (lhs, rhs, MOVE_NONTEMPORAL (exp));
9535 return expand_expr_addr_expr (exp, target, tmode, modifier);
9538 op0 = expand_normal (treeop0);
9539 return read_complex_part (op0, false);
9542 op0 = expand_normal (treeop0);
9543 return read_complex_part (op0, true);
9550 /* Expanded in cfgexpand.c. */
9553 case TRY_CATCH_EXPR:
9555 case EH_FILTER_EXPR:
9556 case TRY_FINALLY_EXPR:
9557 /* Lowered by tree-eh.c. */
9560 case WITH_CLEANUP_EXPR:
9561 case CLEANUP_POINT_EXPR:
9563 case CASE_LABEL_EXPR:
9569 case PREINCREMENT_EXPR:
9570 case PREDECREMENT_EXPR:
9571 case POSTINCREMENT_EXPR:
9572 case POSTDECREMENT_EXPR:
9575 /* Lowered by gimplify.c. */
9579 /* Function descriptors are not valid except for as
9580 initialization constants, and should not be expanded. */
9583 case WITH_SIZE_EXPR:
9584 /* WITH_SIZE_EXPR expands to its first argument. The caller should
9585 have pulled out the size to use in whatever context it needed. */
9586 return expand_expr_real (treeop0, original_target, tmode,
9589 case REALIGN_LOAD_EXPR:
9591 tree oprnd0 = treeop0;
9592 tree oprnd1 = treeop1;
9593 tree oprnd2 = treeop2;
9596 this_optab = optab_for_tree_code (code, type, optab_default);
9597 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
9598 op2 = expand_normal (oprnd2);
9599 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
9607 tree oprnd0 = treeop0;
9608 tree oprnd1 = treeop1;
9609 tree oprnd2 = treeop2;
9612 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, EXPAND_NORMAL);
9613 op2 = expand_normal (oprnd2);
9614 target = expand_widen_pattern_expr (&ops, op0, op1, op2,
9619 case COMPOUND_LITERAL_EXPR:
9621 /* Initialize the anonymous variable declared in the compound
9622 literal, then return the variable. */
9623 tree decl = COMPOUND_LITERAL_EXPR_DECL (exp);
9625 /* Create RTL for this variable. */
9626 if (!DECL_RTL_SET_P (decl))
9628 if (DECL_HARD_REGISTER (decl))
9629 /* The user specified an assembler name for this variable.
9631 rest_of_decl_compilation (decl, 0, 0);
9636 return expand_expr_real (decl, original_target, tmode,
9641 return expand_expr_real_2 (&ops, target, tmode, modifier);
9645 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
9646 signedness of TYPE), possibly returning the result in TARGET. */
9648 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
9650 HOST_WIDE_INT prec = TYPE_PRECISION (type);
9651 if (target && GET_MODE (target) != GET_MODE (exp))
9653 /* For constant values, reduce using build_int_cst_type. */
9654 if (CONST_INT_P (exp))
9656 HOST_WIDE_INT value = INTVAL (exp);
9657 tree t = build_int_cst_type (type, value);
9658 return expand_expr (t, target, VOIDmode, EXPAND_NORMAL);
9660 else if (TYPE_UNSIGNED (type))
9663 if (prec < HOST_BITS_PER_WIDE_INT)
9664 mask = immed_double_const (((unsigned HOST_WIDE_INT) 1 << prec) - 1, 0,
9667 mask = immed_double_const ((unsigned HOST_WIDE_INT) -1,
9668 ((unsigned HOST_WIDE_INT) 1
9669 << (prec - HOST_BITS_PER_WIDE_INT)) - 1,
9671 return expand_and (GET_MODE (exp), exp, mask, target);
9675 tree count = build_int_cst (NULL_TREE,
9676 GET_MODE_BITSIZE (GET_MODE (exp)) - prec);
9677 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9678 return expand_shift (RSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
9682 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9683 when applied to the address of EXP produces an address known to be
9684 aligned more than BIGGEST_ALIGNMENT. */
9687 is_aligning_offset (const_tree offset, const_tree exp)
9689 /* Strip off any conversions. */
9690 while (CONVERT_EXPR_P (offset))
9691 offset = TREE_OPERAND (offset, 0);
9693 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9694 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9695 if (TREE_CODE (offset) != BIT_AND_EXPR
9696 || !host_integerp (TREE_OPERAND (offset, 1), 1)
9697 || compare_tree_int (TREE_OPERAND (offset, 1),
9698 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
9699 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
9702 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9703 It must be NEGATE_EXPR. Then strip any more conversions. */
9704 offset = TREE_OPERAND (offset, 0);
9705 while (CONVERT_EXPR_P (offset))
9706 offset = TREE_OPERAND (offset, 0);
9708 if (TREE_CODE (offset) != NEGATE_EXPR)
9711 offset = TREE_OPERAND (offset, 0);
9712 while (CONVERT_EXPR_P (offset))
9713 offset = TREE_OPERAND (offset, 0);
9715 /* This must now be the address of EXP. */
9716 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
9719 /* Return the tree node if an ARG corresponds to a string constant or zero
9720 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
9721 in bytes within the string that ARG is accessing. The type of the
9722 offset will be `sizetype'. */
9725 string_constant (tree arg, tree *ptr_offset)
9727 tree array, offset, lower_bound;
9730 if (TREE_CODE (arg) == ADDR_EXPR)
9732 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
9734 *ptr_offset = size_zero_node;
9735 return TREE_OPERAND (arg, 0);
9737 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
9739 array = TREE_OPERAND (arg, 0);
9740 offset = size_zero_node;
9742 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
9744 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
9745 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
9746 if (TREE_CODE (array) != STRING_CST
9747 && TREE_CODE (array) != VAR_DECL)
9750 /* Check if the array has a nonzero lower bound. */
9751 lower_bound = array_ref_low_bound (TREE_OPERAND (arg, 0));
9752 if (!integer_zerop (lower_bound))
9754 /* If the offset and base aren't both constants, return 0. */
9755 if (TREE_CODE (lower_bound) != INTEGER_CST)
9757 if (TREE_CODE (offset) != INTEGER_CST)
9759 /* Adjust offset by the lower bound. */
9760 offset = size_diffop (fold_convert (sizetype, offset),
9761 fold_convert (sizetype, lower_bound));
9767 else if (TREE_CODE (arg) == PLUS_EXPR || TREE_CODE (arg) == POINTER_PLUS_EXPR)
9769 tree arg0 = TREE_OPERAND (arg, 0);
9770 tree arg1 = TREE_OPERAND (arg, 1);
9775 if (TREE_CODE (arg0) == ADDR_EXPR
9776 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
9777 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
9779 array = TREE_OPERAND (arg0, 0);
9782 else if (TREE_CODE (arg1) == ADDR_EXPR
9783 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
9784 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
9786 array = TREE_OPERAND (arg1, 0);
9795 if (TREE_CODE (array) == STRING_CST)
9797 *ptr_offset = fold_convert (sizetype, offset);
9800 else if (TREE_CODE (array) == VAR_DECL)
9804 /* Variables initialized to string literals can be handled too. */
9805 if (DECL_INITIAL (array) == NULL_TREE
9806 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
9809 /* If they are read-only, non-volatile and bind locally. */
9810 if (! TREE_READONLY (array)
9811 || TREE_SIDE_EFFECTS (array)
9812 || ! targetm.binds_local_p (array))
9815 /* Avoid const char foo[4] = "abcde"; */
9816 if (DECL_SIZE_UNIT (array) == NULL_TREE
9817 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
9818 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
9819 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
9822 /* If variable is bigger than the string literal, OFFSET must be constant
9823 and inside of the bounds of the string literal. */
9824 offset = fold_convert (sizetype, offset);
9825 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
9826 && (! host_integerp (offset, 1)
9827 || compare_tree_int (offset, length) >= 0))
9830 *ptr_offset = offset;
9831 return DECL_INITIAL (array);
9837 /* Generate code to calculate OPS, and exploded expression
9838 using a store-flag instruction and return an rtx for the result.
9839 OPS reflects a comparison.
9841 If TARGET is nonzero, store the result there if convenient.
9843 Return zero if there is no suitable set-flag instruction
9844 available on this machine.
9846 Once expand_expr has been called on the arguments of the comparison,
9847 we are committed to doing the store flag, since it is not safe to
9848 re-evaluate the expression. We emit the store-flag insn by calling
9849 emit_store_flag, but only expand the arguments if we have a reason
9850 to believe that emit_store_flag will be successful. If we think that
9851 it will, but it isn't, we have to simulate the store-flag with a
9852 set/jump/set sequence. */
9855 do_store_flag (sepops ops, rtx target, enum machine_mode mode)
9858 tree arg0, arg1, type;
9860 enum machine_mode operand_mode;
9863 rtx subtarget = target;
9864 location_t loc = ops->location;
9869 /* Don't crash if the comparison was erroneous. */
9870 if (arg0 == error_mark_node || arg1 == error_mark_node)
9873 type = TREE_TYPE (arg0);
9874 operand_mode = TYPE_MODE (type);
9875 unsignedp = TYPE_UNSIGNED (type);
9877 /* We won't bother with BLKmode store-flag operations because it would mean
9878 passing a lot of information to emit_store_flag. */
9879 if (operand_mode == BLKmode)
9882 /* We won't bother with store-flag operations involving function pointers
9883 when function pointers must be canonicalized before comparisons. */
9884 #ifdef HAVE_canonicalize_funcptr_for_compare
9885 if (HAVE_canonicalize_funcptr_for_compare
9886 && ((TREE_CODE (TREE_TYPE (arg0)) == POINTER_TYPE
9887 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0)))
9889 || (TREE_CODE (TREE_TYPE (arg1)) == POINTER_TYPE
9890 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1)))
9891 == FUNCTION_TYPE))))
9898 /* Get the rtx comparison code to use. We know that EXP is a comparison
9899 operation of some type. Some comparisons against 1 and -1 can be
9900 converted to comparisons with zero. Do so here so that the tests
9901 below will be aware that we have a comparison with zero. These
9902 tests will not catch constants in the first operand, but constants
9903 are rarely passed as the first operand. */
9914 if (integer_onep (arg1))
9915 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
9917 code = unsignedp ? LTU : LT;
9920 if (! unsignedp && integer_all_onesp (arg1))
9921 arg1 = integer_zero_node, code = LT;
9923 code = unsignedp ? LEU : LE;
9926 if (! unsignedp && integer_all_onesp (arg1))
9927 arg1 = integer_zero_node, code = GE;
9929 code = unsignedp ? GTU : GT;
9932 if (integer_onep (arg1))
9933 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
9935 code = unsignedp ? GEU : GE;
9938 case UNORDERED_EXPR:
9967 /* Put a constant second. */
9968 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST
9969 || TREE_CODE (arg0) == FIXED_CST)
9971 tem = arg0; arg0 = arg1; arg1 = tem;
9972 code = swap_condition (code);
9975 /* If this is an equality or inequality test of a single bit, we can
9976 do this by shifting the bit being tested to the low-order bit and
9977 masking the result with the constant 1. If the condition was EQ,
9978 we xor it with 1. This does not require an scc insn and is faster
9979 than an scc insn even if we have it.
9981 The code to make this transformation was moved into fold_single_bit_test,
9982 so we just call into the folder and expand its result. */
9984 if ((code == NE || code == EQ)
9985 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
9986 && integer_pow2p (TREE_OPERAND (arg0, 1)))
9988 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
9989 return expand_expr (fold_single_bit_test (loc,
9990 code == NE ? NE_EXPR : EQ_EXPR,
9992 target, VOIDmode, EXPAND_NORMAL);
9995 if (! get_subtarget (target)
9996 || GET_MODE (subtarget) != operand_mode)
9999 expand_operands (arg0, arg1, subtarget, &op0, &op1, EXPAND_NORMAL);
10002 target = gen_reg_rtx (mode);
10004 /* Try a cstore if possible. */
10005 return emit_store_flag_force (target, code, op0, op1,
10006 operand_mode, unsignedp, 1);
10010 /* Stubs in case we haven't got a casesi insn. */
10011 #ifndef HAVE_casesi
10012 # define HAVE_casesi 0
10013 # define gen_casesi(a, b, c, d, e) (0)
10014 # define CODE_FOR_casesi CODE_FOR_nothing
10017 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10018 0 otherwise (i.e. if there is no casesi instruction). */
10020 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
10021 rtx table_label ATTRIBUTE_UNUSED, rtx default_label,
10022 rtx fallback_label ATTRIBUTE_UNUSED)
10024 enum machine_mode index_mode = SImode;
10025 int index_bits = GET_MODE_BITSIZE (index_mode);
10026 rtx op1, op2, index;
10027 enum machine_mode op_mode;
10032 /* Convert the index to SImode. */
10033 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
10035 enum machine_mode omode = TYPE_MODE (index_type);
10036 rtx rangertx = expand_normal (range);
10038 /* We must handle the endpoints in the original mode. */
10039 index_expr = build2 (MINUS_EXPR, index_type,
10040 index_expr, minval);
10041 minval = integer_zero_node;
10042 index = expand_normal (index_expr);
10044 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
10045 omode, 1, default_label);
10046 /* Now we can safely truncate. */
10047 index = convert_to_mode (index_mode, index, 0);
10051 if (TYPE_MODE (index_type) != index_mode)
10053 index_type = lang_hooks.types.type_for_size (index_bits, 0);
10054 index_expr = fold_convert (index_type, index_expr);
10057 index = expand_normal (index_expr);
10060 do_pending_stack_adjust ();
10062 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
10063 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
10065 index = copy_to_mode_reg (op_mode, index);
10067 op1 = expand_normal (minval);
10069 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
10070 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
10071 op1, TYPE_UNSIGNED (TREE_TYPE (minval)));
10072 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
10074 op1 = copy_to_mode_reg (op_mode, op1);
10076 op2 = expand_normal (range);
10078 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
10079 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
10080 op2, TYPE_UNSIGNED (TREE_TYPE (range)));
10081 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
10083 op2 = copy_to_mode_reg (op_mode, op2);
10085 emit_jump_insn (gen_casesi (index, op1, op2,
10086 table_label, !default_label
10087 ? fallback_label : default_label));
10091 /* Attempt to generate a tablejump instruction; same concept. */
10092 #ifndef HAVE_tablejump
10093 #define HAVE_tablejump 0
10094 #define gen_tablejump(x, y) (0)
10097 /* Subroutine of the next function.
10099 INDEX is the value being switched on, with the lowest value
10100 in the table already subtracted.
10101 MODE is its expected mode (needed if INDEX is constant).
10102 RANGE is the length of the jump table.
10103 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10105 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10106 index value is out of range. */
10109 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
10114 if (INTVAL (range) > cfun->cfg->max_jumptable_ents)
10115 cfun->cfg->max_jumptable_ents = INTVAL (range);
10117 /* Do an unsigned comparison (in the proper mode) between the index
10118 expression and the value which represents the length of the range.
10119 Since we just finished subtracting the lower bound of the range
10120 from the index expression, this comparison allows us to simultaneously
10121 check that the original index expression value is both greater than
10122 or equal to the minimum value of the range and less than or equal to
10123 the maximum value of the range. */
10126 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
10129 /* If index is in range, it must fit in Pmode.
10130 Convert to Pmode so we can index with it. */
10132 index = convert_to_mode (Pmode, index, 1);
10134 /* Don't let a MEM slip through, because then INDEX that comes
10135 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10136 and break_out_memory_refs will go to work on it and mess it up. */
10137 #ifdef PIC_CASE_VECTOR_ADDRESS
10138 if (flag_pic && !REG_P (index))
10139 index = copy_to_mode_reg (Pmode, index);
10142 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10143 GET_MODE_SIZE, because this indicates how large insns are. The other
10144 uses should all be Pmode, because they are addresses. This code
10145 could fail if addresses and insns are not the same size. */
10146 index = gen_rtx_PLUS (Pmode,
10147 gen_rtx_MULT (Pmode, index,
10148 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
10149 gen_rtx_LABEL_REF (Pmode, table_label));
10150 #ifdef PIC_CASE_VECTOR_ADDRESS
10152 index = PIC_CASE_VECTOR_ADDRESS (index);
10155 index = memory_address (CASE_VECTOR_MODE, index);
10156 temp = gen_reg_rtx (CASE_VECTOR_MODE);
10157 vector = gen_const_mem (CASE_VECTOR_MODE, index);
10158 convert_move (temp, vector, 0);
10160 emit_jump_insn (gen_tablejump (temp, table_label));
10162 /* If we are generating PIC code or if the table is PC-relative, the
10163 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10164 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
10169 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
10170 rtx table_label, rtx default_label)
10174 if (! HAVE_tablejump)
10177 index_expr = fold_build2 (MINUS_EXPR, index_type,
10178 fold_convert (index_type, index_expr),
10179 fold_convert (index_type, minval));
10180 index = expand_normal (index_expr);
10181 do_pending_stack_adjust ();
10183 do_tablejump (index, TYPE_MODE (index_type),
10184 convert_modes (TYPE_MODE (index_type),
10185 TYPE_MODE (TREE_TYPE (range)),
10186 expand_normal (range),
10187 TYPE_UNSIGNED (TREE_TYPE (range))),
10188 table_label, default_label);
10192 /* Nonzero if the mode is a valid vector mode for this architecture.
10193 This returns nonzero even if there is no hardware support for the
10194 vector mode, but we can emulate with narrower modes. */
10197 vector_mode_valid_p (enum machine_mode mode)
10199 enum mode_class mclass = GET_MODE_CLASS (mode);
10200 enum machine_mode innermode;
10202 /* Doh! What's going on? */
10203 if (mclass != MODE_VECTOR_INT
10204 && mclass != MODE_VECTOR_FLOAT
10205 && mclass != MODE_VECTOR_FRACT
10206 && mclass != MODE_VECTOR_UFRACT
10207 && mclass != MODE_VECTOR_ACCUM
10208 && mclass != MODE_VECTOR_UACCUM)
10211 /* Hardware support. Woo hoo! */
10212 if (targetm.vector_mode_supported_p (mode))
10215 innermode = GET_MODE_INNER (mode);
10217 /* We should probably return 1 if requesting V4DI and we have no DI,
10218 but we have V2DI, but this is probably very unlikely. */
10220 /* If we have support for the inner mode, we can safely emulate it.
10221 We may not have V2DI, but me can emulate with a pair of DIs. */
10222 return targetm.scalar_mode_supported_p (innermode);
10225 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10227 const_vector_from_tree (tree exp)
10232 enum machine_mode inner, mode;
10234 mode = TYPE_MODE (TREE_TYPE (exp));
10236 if (initializer_zerop (exp))
10237 return CONST0_RTX (mode);
10239 units = GET_MODE_NUNITS (mode);
10240 inner = GET_MODE_INNER (mode);
10242 v = rtvec_alloc (units);
10244 link = TREE_VECTOR_CST_ELTS (exp);
10245 for (i = 0; link; link = TREE_CHAIN (link), ++i)
10247 elt = TREE_VALUE (link);
10249 if (TREE_CODE (elt) == REAL_CST)
10250 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
10252 else if (TREE_CODE (elt) == FIXED_CST)
10253 RTVEC_ELT (v, i) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt),
10256 RTVEC_ELT (v, i) = immed_double_const (TREE_INT_CST_LOW (elt),
10257 TREE_INT_CST_HIGH (elt),
10261 /* Initialize remaining elements to 0. */
10262 for (; i < units; ++i)
10263 RTVEC_ELT (v, i) = CONST0_RTX (inner);
10265 return gen_rtx_CONST_VECTOR (mode, v);
10269 /* Build a decl for a EH personality function named NAME. */
10272 build_personality_function (const char *name)
10276 type = build_function_type_list (integer_type_node, integer_type_node,
10277 long_long_unsigned_type_node,
10278 ptr_type_node, ptr_type_node, NULL_TREE);
10279 decl = build_decl (UNKNOWN_LOCATION, FUNCTION_DECL,
10280 get_identifier (name), type);
10281 DECL_ARTIFICIAL (decl) = 1;
10282 DECL_EXTERNAL (decl) = 1;
10283 TREE_PUBLIC (decl) = 1;
10285 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
10286 are the flags assigned by targetm.encode_section_info. */
10287 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl), 0), NULL);
10292 /* Extracts the personality function of DECL and returns the corresponding
10296 get_personality_function (tree decl)
10298 tree personality = DECL_FUNCTION_PERSONALITY (decl);
10299 enum eh_personality_kind pk;
10301 pk = function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl));
10302 if (pk == eh_personality_none)
10306 && pk == eh_personality_any)
10307 personality = lang_hooks.eh_personality ();
10309 if (pk == eh_personality_lang)
10310 gcc_assert (personality != NULL_TREE);
10312 return XEXP (DECL_RTL (personality), 0);
10315 #include "gt-expr.h"