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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
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 /* Decide whether a function's arguments should be processed
57 from first to last or from last to first.
59 They should if the stack and args grow in opposite directions, but
60 only if we have push insns. */
64 #ifndef PUSH_ARGS_REVERSED
65 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
66 #define PUSH_ARGS_REVERSED /* If it's last to first. */
72 #ifndef STACK_PUSH_CODE
73 #ifdef STACK_GROWS_DOWNWARD
74 #define STACK_PUSH_CODE PRE_DEC
76 #define STACK_PUSH_CODE PRE_INC
81 /* If this is nonzero, we do not bother generating VOLATILE
82 around volatile memory references, and we are willing to
83 output indirect addresses. If cse is to follow, we reject
84 indirect addresses so a useful potential cse is generated;
85 if it is used only once, instruction combination will produce
86 the same indirect address eventually. */
89 /* This structure is used by move_by_pieces to describe the move to
100 int explicit_inc_from;
101 unsigned HOST_WIDE_INT len;
102 HOST_WIDE_INT offset;
106 /* This structure is used by store_by_pieces to describe the clear to
109 struct store_by_pieces
115 unsigned HOST_WIDE_INT len;
116 HOST_WIDE_INT offset;
117 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode);
122 static unsigned HOST_WIDE_INT move_by_pieces_ninsns (unsigned HOST_WIDE_INT,
125 static void move_by_pieces_1 (rtx (*) (rtx, ...), enum machine_mode,
126 struct move_by_pieces *);
127 static bool block_move_libcall_safe_for_call_parm (void);
128 static bool emit_block_move_via_movmem (rtx, rtx, rtx, unsigned);
129 static rtx emit_block_move_via_libcall (rtx, rtx, rtx, bool);
130 static tree emit_block_move_libcall_fn (int);
131 static void emit_block_move_via_loop (rtx, rtx, rtx, unsigned);
132 static rtx clear_by_pieces_1 (void *, HOST_WIDE_INT, enum machine_mode);
133 static void clear_by_pieces (rtx, unsigned HOST_WIDE_INT, unsigned int);
134 static void store_by_pieces_1 (struct store_by_pieces *, unsigned int);
135 static void store_by_pieces_2 (rtx (*) (rtx, ...), enum machine_mode,
136 struct store_by_pieces *);
137 static rtx clear_storage_via_libcall (rtx, rtx, bool);
138 static tree clear_storage_libcall_fn (int);
139 static rtx compress_float_constant (rtx, rtx);
140 static rtx get_subtarget (rtx);
141 static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
142 HOST_WIDE_INT, enum machine_mode,
143 tree, tree, int, int);
144 static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
145 static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT, enum machine_mode,
148 static unsigned HOST_WIDE_INT highest_pow2_factor (tree);
149 static unsigned HOST_WIDE_INT highest_pow2_factor_for_target (tree, tree);
151 static int is_aligning_offset (tree, 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 (tree, rtx, enum machine_mode, int);
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)
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)
190 /* This macro is used to determine whether store_by_pieces should be
191 called to "memset" storage with byte values other than zero, or
192 to "memcpy" storage when the source is a constant string. */
193 #ifndef STORE_BY_PIECES_P
194 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
195 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
196 < (unsigned int) MOVE_RATIO)
199 /* This array records the insn_code of insns to perform block moves. */
200 enum insn_code movmem_optab[NUM_MACHINE_MODES];
202 /* This array records the insn_code of insns to perform block sets. */
203 enum insn_code setmem_optab[NUM_MACHINE_MODES];
205 /* These arrays record the insn_code of two different kinds of insns
206 to perform block compares. */
207 enum insn_code cmpstr_optab[NUM_MACHINE_MODES];
208 enum insn_code cmpmem_optab[NUM_MACHINE_MODES];
210 /* Synchronization primitives. */
211 enum insn_code sync_add_optab[NUM_MACHINE_MODES];
212 enum insn_code sync_sub_optab[NUM_MACHINE_MODES];
213 enum insn_code sync_ior_optab[NUM_MACHINE_MODES];
214 enum insn_code sync_and_optab[NUM_MACHINE_MODES];
215 enum insn_code sync_xor_optab[NUM_MACHINE_MODES];
216 enum insn_code sync_nand_optab[NUM_MACHINE_MODES];
217 enum insn_code sync_old_add_optab[NUM_MACHINE_MODES];
218 enum insn_code sync_old_sub_optab[NUM_MACHINE_MODES];
219 enum insn_code sync_old_ior_optab[NUM_MACHINE_MODES];
220 enum insn_code sync_old_and_optab[NUM_MACHINE_MODES];
221 enum insn_code sync_old_xor_optab[NUM_MACHINE_MODES];
222 enum insn_code sync_old_nand_optab[NUM_MACHINE_MODES];
223 enum insn_code sync_new_add_optab[NUM_MACHINE_MODES];
224 enum insn_code sync_new_sub_optab[NUM_MACHINE_MODES];
225 enum insn_code sync_new_ior_optab[NUM_MACHINE_MODES];
226 enum insn_code sync_new_and_optab[NUM_MACHINE_MODES];
227 enum insn_code sync_new_xor_optab[NUM_MACHINE_MODES];
228 enum insn_code sync_new_nand_optab[NUM_MACHINE_MODES];
229 enum insn_code sync_compare_and_swap[NUM_MACHINE_MODES];
230 enum insn_code sync_compare_and_swap_cc[NUM_MACHINE_MODES];
231 enum insn_code sync_lock_test_and_set[NUM_MACHINE_MODES];
232 enum insn_code sync_lock_release[NUM_MACHINE_MODES];
234 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
236 #ifndef SLOW_UNALIGNED_ACCESS
237 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
240 /* This is run once per compilation to set up which modes can be used
241 directly in memory and to initialize the block move optab. */
244 init_expr_once (void)
247 enum machine_mode mode;
252 /* Try indexing by frame ptr and try by stack ptr.
253 It is known that on the Convex the stack ptr isn't a valid index.
254 With luck, one or the other is valid on any machine. */
255 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
256 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
258 /* A scratch register we can modify in-place below to avoid
259 useless RTL allocations. */
260 reg = gen_rtx_REG (VOIDmode, -1);
262 insn = rtx_alloc (INSN);
263 pat = gen_rtx_SET (0, NULL_RTX, NULL_RTX);
264 PATTERN (insn) = pat;
266 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
267 mode = (enum machine_mode) ((int) mode + 1))
271 direct_load[(int) mode] = direct_store[(int) mode] = 0;
272 PUT_MODE (mem, mode);
273 PUT_MODE (mem1, mode);
274 PUT_MODE (reg, mode);
276 /* See if there is some register that can be used in this mode and
277 directly loaded or stored from memory. */
279 if (mode != VOIDmode && mode != BLKmode)
280 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
281 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
284 if (! HARD_REGNO_MODE_OK (regno, mode))
290 SET_DEST (pat) = reg;
291 if (recog (pat, insn, &num_clobbers) >= 0)
292 direct_load[(int) mode] = 1;
294 SET_SRC (pat) = mem1;
295 SET_DEST (pat) = reg;
296 if (recog (pat, insn, &num_clobbers) >= 0)
297 direct_load[(int) mode] = 1;
300 SET_DEST (pat) = mem;
301 if (recog (pat, insn, &num_clobbers) >= 0)
302 direct_store[(int) mode] = 1;
305 SET_DEST (pat) = mem1;
306 if (recog (pat, insn, &num_clobbers) >= 0)
307 direct_store[(int) mode] = 1;
311 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
313 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
314 mode = GET_MODE_WIDER_MODE (mode))
316 enum machine_mode srcmode;
317 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
318 srcmode = GET_MODE_WIDER_MODE (srcmode))
322 ic = can_extend_p (mode, srcmode, 0);
323 if (ic == CODE_FOR_nothing)
326 PUT_MODE (mem, srcmode);
328 if ((*insn_data[ic].operand[1].predicate) (mem, srcmode))
329 float_extend_from_mem[mode][srcmode] = true;
334 /* This is run at the start of compiling a function. */
339 cfun->expr = ggc_alloc_cleared (sizeof (struct expr_status));
342 /* Copy data from FROM to TO, where the machine modes are not the same.
343 Both modes may be integer, or both may be floating.
344 UNSIGNEDP should be nonzero if FROM is an unsigned type.
345 This causes zero-extension instead of sign-extension. */
348 convert_move (rtx to, rtx from, int unsignedp)
350 enum machine_mode to_mode = GET_MODE (to);
351 enum machine_mode from_mode = GET_MODE (from);
352 int to_real = GET_MODE_CLASS (to_mode) == MODE_FLOAT;
353 int from_real = GET_MODE_CLASS (from_mode) == MODE_FLOAT;
357 /* rtx code for making an equivalent value. */
358 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
359 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
362 gcc_assert (to_real == from_real);
364 /* If the source and destination are already the same, then there's
369 /* If FROM is a SUBREG that indicates that we have already done at least
370 the required extension, strip it. We don't handle such SUBREGs as
373 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
374 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
375 >= GET_MODE_SIZE (to_mode))
376 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
377 from = gen_lowpart (to_mode, from), from_mode = to_mode;
379 gcc_assert (GET_CODE (to) != SUBREG || !SUBREG_PROMOTED_VAR_P (to));
381 if (to_mode == from_mode
382 || (from_mode == VOIDmode && CONSTANT_P (from)))
384 emit_move_insn (to, from);
388 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
390 gcc_assert (GET_MODE_BITSIZE (from_mode) == GET_MODE_BITSIZE (to_mode));
392 if (VECTOR_MODE_P (to_mode))
393 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
395 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
397 emit_move_insn (to, from);
401 if (GET_CODE (to) == CONCAT && GET_CODE (from) == CONCAT)
403 convert_move (XEXP (to, 0), XEXP (from, 0), unsignedp);
404 convert_move (XEXP (to, 1), XEXP (from, 1), unsignedp);
413 gcc_assert (GET_MODE_PRECISION (from_mode)
414 != GET_MODE_PRECISION (to_mode));
416 if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode))
421 /* Try converting directly if the insn is supported. */
423 code = tab->handlers[to_mode][from_mode].insn_code;
424 if (code != CODE_FOR_nothing)
426 emit_unop_insn (code, to, from,
427 tab == sext_optab ? FLOAT_EXTEND : FLOAT_TRUNCATE);
431 /* Otherwise use a libcall. */
432 libcall = tab->handlers[to_mode][from_mode].libfunc;
434 /* Is this conversion implemented yet? */
435 gcc_assert (libcall);
438 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
440 insns = get_insns ();
442 emit_libcall_block (insns, to, value,
443 tab == trunc_optab ? gen_rtx_FLOAT_TRUNCATE (to_mode,
445 : gen_rtx_FLOAT_EXTEND (to_mode, from));
449 /* Handle pointer conversion. */ /* SPEE 900220. */
450 /* Targets are expected to provide conversion insns between PxImode and
451 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
452 if (GET_MODE_CLASS (to_mode) == MODE_PARTIAL_INT)
454 enum machine_mode full_mode
455 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode), MODE_INT);
457 gcc_assert (trunc_optab->handlers[to_mode][full_mode].insn_code
458 != CODE_FOR_nothing);
460 if (full_mode != from_mode)
461 from = convert_to_mode (full_mode, from, unsignedp);
462 emit_unop_insn (trunc_optab->handlers[to_mode][full_mode].insn_code,
466 if (GET_MODE_CLASS (from_mode) == MODE_PARTIAL_INT)
469 enum machine_mode full_mode
470 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode), MODE_INT);
472 gcc_assert (sext_optab->handlers[full_mode][from_mode].insn_code
473 != CODE_FOR_nothing);
475 if (to_mode == full_mode)
477 emit_unop_insn (sext_optab->handlers[full_mode][from_mode].insn_code,
482 new_from = gen_reg_rtx (full_mode);
483 emit_unop_insn (sext_optab->handlers[full_mode][from_mode].insn_code,
484 new_from, from, UNKNOWN);
486 /* else proceed to integer conversions below. */
487 from_mode = full_mode;
491 /* Now both modes are integers. */
493 /* Handle expanding beyond a word. */
494 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
495 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
502 enum machine_mode lowpart_mode;
503 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
505 /* Try converting directly if the insn is supported. */
506 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
509 /* If FROM is a SUBREG, put it into a register. Do this
510 so that we always generate the same set of insns for
511 better cse'ing; if an intermediate assignment occurred,
512 we won't be doing the operation directly on the SUBREG. */
513 if (optimize > 0 && GET_CODE (from) == SUBREG)
514 from = force_reg (from_mode, from);
515 emit_unop_insn (code, to, from, equiv_code);
518 /* Next, try converting via full word. */
519 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
520 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
521 != CODE_FOR_nothing))
525 if (reg_overlap_mentioned_p (to, from))
526 from = force_reg (from_mode, from);
527 emit_insn (gen_rtx_CLOBBER (VOIDmode, to));
529 convert_move (gen_lowpart (word_mode, to), from, unsignedp);
530 emit_unop_insn (code, to,
531 gen_lowpart (word_mode, to), equiv_code);
535 /* No special multiword conversion insn; do it by hand. */
538 /* Since we will turn this into a no conflict block, we must ensure
539 that the source does not overlap the target. */
541 if (reg_overlap_mentioned_p (to, from))
542 from = force_reg (from_mode, from);
544 /* Get a copy of FROM widened to a word, if necessary. */
545 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
546 lowpart_mode = word_mode;
548 lowpart_mode = from_mode;
550 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
552 lowpart = gen_lowpart (lowpart_mode, to);
553 emit_move_insn (lowpart, lowfrom);
555 /* Compute the value to put in each remaining word. */
557 fill_value = const0_rtx;
562 && insn_data[(int) CODE_FOR_slt].operand[0].mode == word_mode
563 && STORE_FLAG_VALUE == -1)
565 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
567 fill_value = gen_reg_rtx (word_mode);
568 emit_insn (gen_slt (fill_value));
574 = expand_shift (RSHIFT_EXPR, lowpart_mode, lowfrom,
575 size_int (GET_MODE_BITSIZE (lowpart_mode) - 1),
577 fill_value = convert_to_mode (word_mode, fill_value, 1);
581 /* Fill the remaining words. */
582 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
584 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
585 rtx subword = operand_subword (to, index, 1, to_mode);
587 gcc_assert (subword);
589 if (fill_value != subword)
590 emit_move_insn (subword, fill_value);
593 insns = get_insns ();
596 emit_no_conflict_block (insns, to, from, NULL_RTX,
597 gen_rtx_fmt_e (equiv_code, to_mode, copy_rtx (from)));
601 /* Truncating multi-word to a word or less. */
602 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
603 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
606 && ! MEM_VOLATILE_P (from)
607 && direct_load[(int) to_mode]
608 && ! mode_dependent_address_p (XEXP (from, 0)))
610 || GET_CODE (from) == SUBREG))
611 from = force_reg (from_mode, from);
612 convert_move (to, gen_lowpart (word_mode, from), 0);
616 /* Now follow all the conversions between integers
617 no more than a word long. */
619 /* For truncation, usually we can just refer to FROM in a narrower mode. */
620 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
621 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
622 GET_MODE_BITSIZE (from_mode)))
625 && ! MEM_VOLATILE_P (from)
626 && direct_load[(int) to_mode]
627 && ! mode_dependent_address_p (XEXP (from, 0)))
629 || GET_CODE (from) == SUBREG))
630 from = force_reg (from_mode, from);
631 if (REG_P (from) && REGNO (from) < FIRST_PSEUDO_REGISTER
632 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
633 from = copy_to_reg (from);
634 emit_move_insn (to, gen_lowpart (to_mode, from));
638 /* Handle extension. */
639 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
641 /* Convert directly if that works. */
642 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
645 emit_unop_insn (code, to, from, equiv_code);
650 enum machine_mode intermediate;
654 /* Search for a mode to convert via. */
655 for (intermediate = from_mode; intermediate != VOIDmode;
656 intermediate = GET_MODE_WIDER_MODE (intermediate))
657 if (((can_extend_p (to_mode, intermediate, unsignedp)
659 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
660 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
661 GET_MODE_BITSIZE (intermediate))))
662 && (can_extend_p (intermediate, from_mode, unsignedp)
663 != CODE_FOR_nothing))
665 convert_move (to, convert_to_mode (intermediate, from,
666 unsignedp), unsignedp);
670 /* No suitable intermediate mode.
671 Generate what we need with shifts. */
672 shift_amount = build_int_cst (NULL_TREE,
673 GET_MODE_BITSIZE (to_mode)
674 - GET_MODE_BITSIZE (from_mode));
675 from = gen_lowpart (to_mode, force_reg (from_mode, from));
676 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
678 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
681 emit_move_insn (to, tmp);
686 /* Support special truncate insns for certain modes. */
687 if (trunc_optab->handlers[to_mode][from_mode].insn_code != CODE_FOR_nothing)
689 emit_unop_insn (trunc_optab->handlers[to_mode][from_mode].insn_code,
694 /* Handle truncation of volatile memrefs, and so on;
695 the things that couldn't be truncated directly,
696 and for which there was no special instruction.
698 ??? Code above formerly short-circuited this, for most integer
699 mode pairs, with a force_reg in from_mode followed by a recursive
700 call to this routine. Appears always to have been wrong. */
701 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
703 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
704 emit_move_insn (to, temp);
708 /* Mode combination is not recognized. */
712 /* Return an rtx for a value that would result
713 from converting X to mode MODE.
714 Both X and MODE may be floating, or both integer.
715 UNSIGNEDP is nonzero if X is an unsigned value.
716 This can be done by referring to a part of X in place
717 or by copying to a new temporary with conversion. */
720 convert_to_mode (enum machine_mode mode, rtx x, int unsignedp)
722 return convert_modes (mode, VOIDmode, x, unsignedp);
725 /* Return an rtx for a value that would result
726 from converting X from mode OLDMODE to mode MODE.
727 Both modes may be floating, or both integer.
728 UNSIGNEDP is nonzero if X is an unsigned value.
730 This can be done by referring to a part of X in place
731 or by copying to a new temporary with conversion.
733 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
736 convert_modes (enum machine_mode mode, enum machine_mode oldmode, rtx x, int unsignedp)
740 /* If FROM is a SUBREG that indicates that we have already done at least
741 the required extension, strip it. */
743 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
744 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
745 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
746 x = gen_lowpart (mode, x);
748 if (GET_MODE (x) != VOIDmode)
749 oldmode = GET_MODE (x);
754 /* There is one case that we must handle specially: If we are converting
755 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
756 we are to interpret the constant as unsigned, gen_lowpart will do
757 the wrong if the constant appears negative. What we want to do is
758 make the high-order word of the constant zero, not all ones. */
760 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
761 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
762 && GET_CODE (x) == CONST_INT && INTVAL (x) < 0)
764 HOST_WIDE_INT val = INTVAL (x);
766 if (oldmode != VOIDmode
767 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
769 int width = GET_MODE_BITSIZE (oldmode);
771 /* We need to zero extend VAL. */
772 val &= ((HOST_WIDE_INT) 1 << width) - 1;
775 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
778 /* We can do this with a gen_lowpart if both desired and current modes
779 are integer, and this is either a constant integer, a register, or a
780 non-volatile MEM. Except for the constant case where MODE is no
781 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
783 if ((GET_CODE (x) == CONST_INT
784 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
785 || (GET_MODE_CLASS (mode) == MODE_INT
786 && GET_MODE_CLASS (oldmode) == MODE_INT
787 && (GET_CODE (x) == CONST_DOUBLE
788 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
789 && ((MEM_P (x) && ! MEM_VOLATILE_P (x)
790 && direct_load[(int) mode])
792 && (! HARD_REGISTER_P (x)
793 || HARD_REGNO_MODE_OK (REGNO (x), mode))
794 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
795 GET_MODE_BITSIZE (GET_MODE (x)))))))))
797 /* ?? If we don't know OLDMODE, we have to assume here that
798 X does not need sign- or zero-extension. This may not be
799 the case, but it's the best we can do. */
800 if (GET_CODE (x) == CONST_INT && oldmode != VOIDmode
801 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
803 HOST_WIDE_INT val = INTVAL (x);
804 int width = GET_MODE_BITSIZE (oldmode);
806 /* We must sign or zero-extend in this case. Start by
807 zero-extending, then sign extend if we need to. */
808 val &= ((HOST_WIDE_INT) 1 << width) - 1;
810 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
811 val |= (HOST_WIDE_INT) (-1) << width;
813 return gen_int_mode (val, mode);
816 return gen_lowpart (mode, x);
819 /* Converting from integer constant into mode is always equivalent to an
821 if (VECTOR_MODE_P (mode) && GET_MODE (x) == VOIDmode)
823 gcc_assert (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (oldmode));
824 return simplify_gen_subreg (mode, x, oldmode, 0);
827 temp = gen_reg_rtx (mode);
828 convert_move (temp, x, unsignedp);
832 /* STORE_MAX_PIECES is the number of bytes at a time that we can
833 store efficiently. Due to internal GCC limitations, this is
834 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
835 for an immediate constant. */
837 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
839 /* Determine whether the LEN bytes can be moved by using several move
840 instructions. Return nonzero if a call to move_by_pieces should
844 can_move_by_pieces (unsigned HOST_WIDE_INT len,
845 unsigned int align ATTRIBUTE_UNUSED)
847 return MOVE_BY_PIECES_P (len, align);
850 /* Generate several move instructions to copy LEN bytes from block FROM to
851 block TO. (These are MEM rtx's with BLKmode).
853 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
854 used to push FROM to the stack.
856 ALIGN is maximum stack alignment we can assume.
858 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
859 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
863 move_by_pieces (rtx to, rtx from, unsigned HOST_WIDE_INT len,
864 unsigned int align, int endp)
866 struct move_by_pieces data;
867 rtx to_addr, from_addr = XEXP (from, 0);
868 unsigned int max_size = MOVE_MAX_PIECES + 1;
869 enum machine_mode mode = VOIDmode, tmode;
870 enum insn_code icode;
872 align = MIN (to ? MEM_ALIGN (to) : align, MEM_ALIGN (from));
875 data.from_addr = from_addr;
878 to_addr = XEXP (to, 0);
881 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
882 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
884 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
891 #ifdef STACK_GROWS_DOWNWARD
897 data.to_addr = to_addr;
900 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
901 || GET_CODE (from_addr) == POST_INC
902 || GET_CODE (from_addr) == POST_DEC);
904 data.explicit_inc_from = 0;
905 data.explicit_inc_to = 0;
906 if (data.reverse) data.offset = len;
909 /* If copying requires more than two move insns,
910 copy addresses to registers (to make displacements shorter)
911 and use post-increment if available. */
912 if (!(data.autinc_from && data.autinc_to)
913 && move_by_pieces_ninsns (len, align, max_size) > 2)
915 /* Find the mode of the largest move... */
916 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
917 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
918 if (GET_MODE_SIZE (tmode) < max_size)
921 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
923 data.from_addr = copy_addr_to_reg (plus_constant (from_addr, len));
924 data.autinc_from = 1;
925 data.explicit_inc_from = -1;
927 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
929 data.from_addr = copy_addr_to_reg (from_addr);
930 data.autinc_from = 1;
931 data.explicit_inc_from = 1;
933 if (!data.autinc_from && CONSTANT_P (from_addr))
934 data.from_addr = copy_addr_to_reg (from_addr);
935 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
937 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
939 data.explicit_inc_to = -1;
941 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
943 data.to_addr = copy_addr_to_reg (to_addr);
945 data.explicit_inc_to = 1;
947 if (!data.autinc_to && CONSTANT_P (to_addr))
948 data.to_addr = copy_addr_to_reg (to_addr);
951 tmode = mode_for_size (MOVE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
952 if (align >= GET_MODE_ALIGNMENT (tmode))
953 align = GET_MODE_ALIGNMENT (tmode);
956 enum machine_mode xmode;
958 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
960 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
961 if (GET_MODE_SIZE (tmode) > MOVE_MAX_PIECES
962 || SLOW_UNALIGNED_ACCESS (tmode, align))
965 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
968 /* First move what we can in the largest integer mode, then go to
969 successively smaller modes. */
973 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
974 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
975 if (GET_MODE_SIZE (tmode) < max_size)
978 if (mode == VOIDmode)
981 icode = mov_optab->handlers[(int) mode].insn_code;
982 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
983 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
985 max_size = GET_MODE_SIZE (mode);
988 /* The code above should have handled everything. */
989 gcc_assert (!data.len);
995 gcc_assert (!data.reverse);
1000 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
1001 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
1003 data.to_addr = copy_addr_to_reg (plus_constant (data.to_addr,
1006 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
1013 to1 = adjust_address (data.to, QImode, data.offset);
1021 /* Return number of insns required to move L bytes by pieces.
1022 ALIGN (in bits) is maximum alignment we can assume. */
1024 static unsigned HOST_WIDE_INT
1025 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l, unsigned int align,
1026 unsigned int max_size)
1028 unsigned HOST_WIDE_INT n_insns = 0;
1029 enum machine_mode tmode;
1031 tmode = mode_for_size (MOVE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
1032 if (align >= GET_MODE_ALIGNMENT (tmode))
1033 align = GET_MODE_ALIGNMENT (tmode);
1036 enum machine_mode tmode, xmode;
1038 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
1040 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
1041 if (GET_MODE_SIZE (tmode) > MOVE_MAX_PIECES
1042 || SLOW_UNALIGNED_ACCESS (tmode, align))
1045 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
1048 while (max_size > 1)
1050 enum machine_mode mode = VOIDmode;
1051 enum insn_code icode;
1053 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1054 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1055 if (GET_MODE_SIZE (tmode) < max_size)
1058 if (mode == VOIDmode)
1061 icode = mov_optab->handlers[(int) mode].insn_code;
1062 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1063 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1065 max_size = GET_MODE_SIZE (mode);
1072 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1073 with move instructions for mode MODE. GENFUN is the gen_... function
1074 to make a move insn for that mode. DATA has all the other info. */
1077 move_by_pieces_1 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
1078 struct move_by_pieces *data)
1080 unsigned int size = GET_MODE_SIZE (mode);
1081 rtx to1 = NULL_RTX, from1;
1083 while (data->len >= size)
1086 data->offset -= size;
1090 if (data->autinc_to)
1091 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1094 to1 = adjust_address (data->to, mode, data->offset);
1097 if (data->autinc_from)
1098 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1101 from1 = adjust_address (data->from, mode, data->offset);
1103 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1104 emit_insn (gen_add2_insn (data->to_addr,
1105 GEN_INT (-(HOST_WIDE_INT)size)));
1106 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1107 emit_insn (gen_add2_insn (data->from_addr,
1108 GEN_INT (-(HOST_WIDE_INT)size)));
1111 emit_insn ((*genfun) (to1, from1));
1114 #ifdef PUSH_ROUNDING
1115 emit_single_push_insn (mode, from1, NULL);
1121 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1122 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1123 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1124 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1126 if (! data->reverse)
1127 data->offset += size;
1133 /* Emit code to move a block Y to a block X. This may be done with
1134 string-move instructions, with multiple scalar move instructions,
1135 or with a library call.
1137 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1138 SIZE is an rtx that says how long they are.
1139 ALIGN is the maximum alignment we can assume they have.
1140 METHOD describes what kind of copy this is, and what mechanisms may be used.
1142 Return the address of the new block, if memcpy is called and returns it,
1146 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1154 case BLOCK_OP_NORMAL:
1155 case BLOCK_OP_TAILCALL:
1156 may_use_call = true;
1159 case BLOCK_OP_CALL_PARM:
1160 may_use_call = block_move_libcall_safe_for_call_parm ();
1162 /* Make inhibit_defer_pop nonzero around the library call
1163 to force it to pop the arguments right away. */
1167 case BLOCK_OP_NO_LIBCALL:
1168 may_use_call = false;
1175 align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1177 gcc_assert (MEM_P (x));
1178 gcc_assert (MEM_P (y));
1181 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1182 block copy is more efficient for other large modes, e.g. DCmode. */
1183 x = adjust_address (x, BLKmode, 0);
1184 y = adjust_address (y, BLKmode, 0);
1186 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1187 can be incorrect is coming from __builtin_memcpy. */
1188 if (GET_CODE (size) == CONST_INT)
1190 if (INTVAL (size) == 0)
1193 x = shallow_copy_rtx (x);
1194 y = shallow_copy_rtx (y);
1195 set_mem_size (x, size);
1196 set_mem_size (y, size);
1199 if (GET_CODE (size) == CONST_INT && MOVE_BY_PIECES_P (INTVAL (size), align))
1200 move_by_pieces (x, y, INTVAL (size), align, 0);
1201 else if (emit_block_move_via_movmem (x, y, size, align))
1203 else if (may_use_call)
1204 retval = emit_block_move_via_libcall (x, y, size,
1205 method == BLOCK_OP_TAILCALL);
1207 emit_block_move_via_loop (x, y, size, align);
1209 if (method == BLOCK_OP_CALL_PARM)
1215 /* A subroutine of emit_block_move. Returns true if calling the
1216 block move libcall will not clobber any parameters which may have
1217 already been placed on the stack. */
1220 block_move_libcall_safe_for_call_parm (void)
1222 /* If arguments are pushed on the stack, then they're safe. */
1226 /* If registers go on the stack anyway, any argument is sure to clobber
1227 an outgoing argument. */
1228 #if defined (REG_PARM_STACK_SPACE) && defined (OUTGOING_REG_PARM_STACK_SPACE)
1230 tree fn = emit_block_move_libcall_fn (false);
1232 if (REG_PARM_STACK_SPACE (fn) != 0)
1237 /* If any argument goes in memory, then it might clobber an outgoing
1240 CUMULATIVE_ARGS args_so_far;
1243 fn = emit_block_move_libcall_fn (false);
1244 INIT_CUMULATIVE_ARGS (args_so_far, TREE_TYPE (fn), NULL_RTX, 0, 3);
1246 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1247 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1249 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1250 rtx tmp = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
1251 if (!tmp || !REG_P (tmp))
1253 if (targetm.calls.arg_partial_bytes (&args_so_far, mode, NULL, 1))
1255 FUNCTION_ARG_ADVANCE (args_so_far, mode, NULL_TREE, 1);
1261 /* A subroutine of emit_block_move. Expand a movmem pattern;
1262 return true if successful. */
1265 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align)
1267 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1268 int save_volatile_ok = volatile_ok;
1269 enum machine_mode mode;
1271 /* Since this is a move insn, we don't care about volatility. */
1274 /* Try the most limited insn first, because there's no point
1275 including more than one in the machine description unless
1276 the more limited one has some advantage. */
1278 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1279 mode = GET_MODE_WIDER_MODE (mode))
1281 enum insn_code code = movmem_optab[(int) mode];
1282 insn_operand_predicate_fn pred;
1284 if (code != CODE_FOR_nothing
1285 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1286 here because if SIZE is less than the mode mask, as it is
1287 returned by the macro, it will definitely be less than the
1288 actual mode mask. */
1289 && ((GET_CODE (size) == CONST_INT
1290 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1291 <= (GET_MODE_MASK (mode) >> 1)))
1292 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1293 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1294 || (*pred) (x, BLKmode))
1295 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1296 || (*pred) (y, BLKmode))
1297 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1298 || (*pred) (opalign, VOIDmode)))
1301 rtx last = get_last_insn ();
1304 op2 = convert_to_mode (mode, size, 1);
1305 pred = insn_data[(int) code].operand[2].predicate;
1306 if (pred != 0 && ! (*pred) (op2, mode))
1307 op2 = copy_to_mode_reg (mode, op2);
1309 /* ??? When called via emit_block_move_for_call, it'd be
1310 nice if there were some way to inform the backend, so
1311 that it doesn't fail the expansion because it thinks
1312 emitting the libcall would be more efficient. */
1314 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1318 volatile_ok = save_volatile_ok;
1322 delete_insns_since (last);
1326 volatile_ok = save_volatile_ok;
1330 /* A subroutine of emit_block_move. Expand a call to memcpy.
1331 Return the return value from memcpy, 0 otherwise. */
1334 emit_block_move_via_libcall (rtx dst, rtx src, rtx size, bool tailcall)
1336 rtx dst_addr, src_addr;
1337 tree call_expr, arg_list, fn, src_tree, dst_tree, size_tree;
1338 enum machine_mode size_mode;
1341 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1342 pseudos. We can then place those new pseudos into a VAR_DECL and
1345 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1346 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1348 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1349 src_addr = convert_memory_address (ptr_mode, src_addr);
1351 dst_tree = make_tree (ptr_type_node, dst_addr);
1352 src_tree = make_tree (ptr_type_node, src_addr);
1354 size_mode = TYPE_MODE (sizetype);
1356 size = convert_to_mode (size_mode, size, 1);
1357 size = copy_to_mode_reg (size_mode, size);
1359 /* It is incorrect to use the libcall calling conventions to call
1360 memcpy in this context. This could be a user call to memcpy and
1361 the user may wish to examine the return value from memcpy. For
1362 targets where libcalls and normal calls have different conventions
1363 for returning pointers, we could end up generating incorrect code. */
1365 size_tree = make_tree (sizetype, size);
1367 fn = emit_block_move_libcall_fn (true);
1368 arg_list = tree_cons (NULL_TREE, size_tree, NULL_TREE);
1369 arg_list = tree_cons (NULL_TREE, src_tree, arg_list);
1370 arg_list = tree_cons (NULL_TREE, dst_tree, arg_list);
1372 /* Now we have to build up the CALL_EXPR itself. */
1373 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
1374 call_expr = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
1375 call_expr, arg_list, NULL_TREE);
1376 CALL_EXPR_TAILCALL (call_expr) = tailcall;
1378 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
1383 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1384 for the function we use for block copies. The first time FOR_CALL
1385 is true, we call assemble_external. */
1387 static GTY(()) tree block_move_fn;
1390 init_block_move_fn (const char *asmspec)
1396 fn = get_identifier ("memcpy");
1397 args = build_function_type_list (ptr_type_node, ptr_type_node,
1398 const_ptr_type_node, sizetype,
1401 fn = build_decl (FUNCTION_DECL, fn, args);
1402 DECL_EXTERNAL (fn) = 1;
1403 TREE_PUBLIC (fn) = 1;
1404 DECL_ARTIFICIAL (fn) = 1;
1405 TREE_NOTHROW (fn) = 1;
1411 set_user_assembler_name (block_move_fn, asmspec);
1415 emit_block_move_libcall_fn (int for_call)
1417 static bool emitted_extern;
1420 init_block_move_fn (NULL);
1422 if (for_call && !emitted_extern)
1424 emitted_extern = true;
1425 make_decl_rtl (block_move_fn);
1426 assemble_external (block_move_fn);
1429 return block_move_fn;
1432 /* A subroutine of emit_block_move. Copy the data via an explicit
1433 loop. This is used only when libcalls are forbidden. */
1434 /* ??? It'd be nice to copy in hunks larger than QImode. */
1437 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1438 unsigned int align ATTRIBUTE_UNUSED)
1440 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1441 enum machine_mode iter_mode;
1443 iter_mode = GET_MODE (size);
1444 if (iter_mode == VOIDmode)
1445 iter_mode = word_mode;
1447 top_label = gen_label_rtx ();
1448 cmp_label = gen_label_rtx ();
1449 iter = gen_reg_rtx (iter_mode);
1451 emit_move_insn (iter, const0_rtx);
1453 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1454 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1455 do_pending_stack_adjust ();
1457 emit_jump (cmp_label);
1458 emit_label (top_label);
1460 tmp = convert_modes (Pmode, iter_mode, iter, true);
1461 x_addr = gen_rtx_PLUS (Pmode, x_addr, tmp);
1462 y_addr = gen_rtx_PLUS (Pmode, y_addr, tmp);
1463 x = change_address (x, QImode, x_addr);
1464 y = change_address (y, QImode, y_addr);
1466 emit_move_insn (x, y);
1468 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1469 true, OPTAB_LIB_WIDEN);
1471 emit_move_insn (iter, tmp);
1473 emit_label (cmp_label);
1475 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1479 /* Copy all or part of a value X into registers starting at REGNO.
1480 The number of registers to be filled is NREGS. */
1483 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1486 #ifdef HAVE_load_multiple
1494 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1495 x = validize_mem (force_const_mem (mode, x));
1497 /* See if the machine can do this with a load multiple insn. */
1498 #ifdef HAVE_load_multiple
1499 if (HAVE_load_multiple)
1501 last = get_last_insn ();
1502 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1510 delete_insns_since (last);
1514 for (i = 0; i < nregs; i++)
1515 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1516 operand_subword_force (x, i, mode));
1519 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1520 The number of registers to be filled is NREGS. */
1523 move_block_from_reg (int regno, rtx x, int nregs)
1530 /* See if the machine can do this with a store multiple insn. */
1531 #ifdef HAVE_store_multiple
1532 if (HAVE_store_multiple)
1534 rtx last = get_last_insn ();
1535 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1543 delete_insns_since (last);
1547 for (i = 0; i < nregs; i++)
1549 rtx tem = operand_subword (x, i, 1, BLKmode);
1553 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1557 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1558 ORIG, where ORIG is a non-consecutive group of registers represented by
1559 a PARALLEL. The clone is identical to the original except in that the
1560 original set of registers is replaced by a new set of pseudo registers.
1561 The new set has the same modes as the original set. */
1564 gen_group_rtx (rtx orig)
1569 gcc_assert (GET_CODE (orig) == PARALLEL);
1571 length = XVECLEN (orig, 0);
1572 tmps = alloca (sizeof (rtx) * length);
1574 /* Skip a NULL entry in first slot. */
1575 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1580 for (; i < length; i++)
1582 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1583 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1585 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1588 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1591 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1592 except that values are placed in TMPS[i], and must later be moved
1593 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1596 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1600 enum machine_mode m = GET_MODE (orig_src);
1602 gcc_assert (GET_CODE (dst) == PARALLEL);
1605 && !SCALAR_INT_MODE_P (m)
1606 && !MEM_P (orig_src)
1607 && GET_CODE (orig_src) != CONCAT)
1609 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1610 if (imode == BLKmode)
1611 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1613 src = gen_reg_rtx (imode);
1614 if (imode != BLKmode)
1615 src = gen_lowpart (GET_MODE (orig_src), src);
1616 emit_move_insn (src, orig_src);
1617 /* ...and back again. */
1618 if (imode != BLKmode)
1619 src = gen_lowpart (imode, src);
1620 emit_group_load_1 (tmps, dst, src, type, ssize);
1624 /* Check for a NULL entry, used to indicate that the parameter goes
1625 both on the stack and in registers. */
1626 if (XEXP (XVECEXP (dst, 0, 0), 0))
1631 /* Process the pieces. */
1632 for (i = start; i < XVECLEN (dst, 0); i++)
1634 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1635 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1636 unsigned int bytelen = GET_MODE_SIZE (mode);
1639 /* Handle trailing fragments that run over the size of the struct. */
1640 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1642 /* Arrange to shift the fragment to where it belongs.
1643 extract_bit_field loads to the lsb of the reg. */
1645 #ifdef BLOCK_REG_PADDING
1646 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1647 == (BYTES_BIG_ENDIAN ? upward : downward)
1652 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1653 bytelen = ssize - bytepos;
1654 gcc_assert (bytelen > 0);
1657 /* If we won't be loading directly from memory, protect the real source
1658 from strange tricks we might play; but make sure that the source can
1659 be loaded directly into the destination. */
1661 if (!MEM_P (orig_src)
1662 && (!CONSTANT_P (orig_src)
1663 || (GET_MODE (orig_src) != mode
1664 && GET_MODE (orig_src) != VOIDmode)))
1666 if (GET_MODE (orig_src) == VOIDmode)
1667 src = gen_reg_rtx (mode);
1669 src = gen_reg_rtx (GET_MODE (orig_src));
1671 emit_move_insn (src, orig_src);
1674 /* Optimize the access just a bit. */
1676 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1677 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1678 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1679 && bytelen == GET_MODE_SIZE (mode))
1681 tmps[i] = gen_reg_rtx (mode);
1682 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1684 else if (COMPLEX_MODE_P (mode)
1685 && GET_MODE (src) == mode
1686 && bytelen == GET_MODE_SIZE (mode))
1687 /* Let emit_move_complex do the bulk of the work. */
1689 else if (GET_CODE (src) == CONCAT)
1691 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1692 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1694 if ((bytepos == 0 && bytelen == slen0)
1695 || (bytepos != 0 && bytepos + bytelen <= slen))
1697 /* The following assumes that the concatenated objects all
1698 have the same size. In this case, a simple calculation
1699 can be used to determine the object and the bit field
1701 tmps[i] = XEXP (src, bytepos / slen0);
1702 if (! CONSTANT_P (tmps[i])
1703 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1704 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1705 (bytepos % slen0) * BITS_PER_UNIT,
1706 1, NULL_RTX, mode, mode);
1712 gcc_assert (!bytepos);
1713 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1714 emit_move_insn (mem, src);
1715 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1716 0, 1, NULL_RTX, mode, mode);
1719 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1720 SIMD register, which is currently broken. While we get GCC
1721 to emit proper RTL for these cases, let's dump to memory. */
1722 else if (VECTOR_MODE_P (GET_MODE (dst))
1725 int slen = GET_MODE_SIZE (GET_MODE (src));
1728 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1729 emit_move_insn (mem, src);
1730 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1732 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1733 && XVECLEN (dst, 0) > 1)
1734 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1735 else if (CONSTANT_P (src)
1736 || (REG_P (src) && GET_MODE (src) == mode))
1739 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1740 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
1744 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1745 build_int_cst (NULL_TREE, shift), tmps[i], 0);
1749 /* Emit code to move a block SRC of type TYPE to a block DST,
1750 where DST is non-consecutive registers represented by a PARALLEL.
1751 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1755 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1760 tmps = alloca (sizeof (rtx) * XVECLEN (dst, 0));
1761 emit_group_load_1 (tmps, dst, src, type, ssize);
1763 /* Copy the extracted pieces into the proper (probable) hard regs. */
1764 for (i = 0; i < XVECLEN (dst, 0); i++)
1766 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1769 emit_move_insn (d, tmps[i]);
1773 /* Similar, but load SRC into new pseudos in a format that looks like
1774 PARALLEL. This can later be fed to emit_group_move to get things
1775 in the right place. */
1778 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1783 vec = rtvec_alloc (XVECLEN (parallel, 0));
1784 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1786 /* Convert the vector to look just like the original PARALLEL, except
1787 with the computed values. */
1788 for (i = 0; i < XVECLEN (parallel, 0); i++)
1790 rtx e = XVECEXP (parallel, 0, i);
1791 rtx d = XEXP (e, 0);
1795 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1796 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1798 RTVEC_ELT (vec, i) = e;
1801 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1804 /* Emit code to move a block SRC to block DST, where SRC and DST are
1805 non-consecutive groups of registers, each represented by a PARALLEL. */
1808 emit_group_move (rtx dst, rtx src)
1812 gcc_assert (GET_CODE (src) == PARALLEL
1813 && GET_CODE (dst) == PARALLEL
1814 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1816 /* Skip first entry if NULL. */
1817 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1818 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1819 XEXP (XVECEXP (src, 0, i), 0));
1822 /* Move a group of registers represented by a PARALLEL into pseudos. */
1825 emit_group_move_into_temps (rtx src)
1827 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1830 for (i = 0; i < XVECLEN (src, 0); i++)
1832 rtx e = XVECEXP (src, 0, i);
1833 rtx d = XEXP (e, 0);
1836 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1837 RTVEC_ELT (vec, i) = e;
1840 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1843 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1844 where SRC is non-consecutive registers represented by a PARALLEL.
1845 SSIZE represents the total size of block ORIG_DST, or -1 if not
1849 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1853 enum machine_mode m = GET_MODE (orig_dst);
1855 gcc_assert (GET_CODE (src) == PARALLEL);
1857 if (!SCALAR_INT_MODE_P (m)
1858 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1860 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1861 if (imode == BLKmode)
1862 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1864 dst = gen_reg_rtx (imode);
1865 emit_group_store (dst, src, type, ssize);
1866 if (imode != BLKmode)
1867 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1868 emit_move_insn (orig_dst, dst);
1872 /* Check for a NULL entry, used to indicate that the parameter goes
1873 both on the stack and in registers. */
1874 if (XEXP (XVECEXP (src, 0, 0), 0))
1879 tmps = alloca (sizeof (rtx) * XVECLEN (src, 0));
1881 /* Copy the (probable) hard regs into pseudos. */
1882 for (i = start; i < XVECLEN (src, 0); i++)
1884 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1885 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1886 emit_move_insn (tmps[i], reg);
1889 /* If we won't be storing directly into memory, protect the real destination
1890 from strange tricks we might play. */
1892 if (GET_CODE (dst) == PARALLEL)
1896 /* We can get a PARALLEL dst if there is a conditional expression in
1897 a return statement. In that case, the dst and src are the same,
1898 so no action is necessary. */
1899 if (rtx_equal_p (dst, src))
1902 /* It is unclear if we can ever reach here, but we may as well handle
1903 it. Allocate a temporary, and split this into a store/load to/from
1906 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1907 emit_group_store (temp, src, type, ssize);
1908 emit_group_load (dst, temp, type, ssize);
1911 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1913 dst = gen_reg_rtx (GET_MODE (orig_dst));
1914 /* Make life a bit easier for combine. */
1915 emit_move_insn (dst, CONST0_RTX (GET_MODE (orig_dst)));
1918 /* Process the pieces. */
1919 for (i = start; i < XVECLEN (src, 0); i++)
1921 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
1922 enum machine_mode mode = GET_MODE (tmps[i]);
1923 unsigned int bytelen = GET_MODE_SIZE (mode);
1926 /* Handle trailing fragments that run over the size of the struct. */
1927 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1929 /* store_bit_field always takes its value from the lsb.
1930 Move the fragment to the lsb if it's not already there. */
1932 #ifdef BLOCK_REG_PADDING
1933 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
1934 == (BYTES_BIG_ENDIAN ? upward : downward)
1940 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1941 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
1942 build_int_cst (NULL_TREE, shift),
1945 bytelen = ssize - bytepos;
1948 if (GET_CODE (dst) == CONCAT)
1950 if (bytepos + bytelen <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
1951 dest = XEXP (dst, 0);
1952 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
1954 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
1955 dest = XEXP (dst, 1);
1959 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
1960 dest = assign_stack_temp (GET_MODE (dest),
1961 GET_MODE_SIZE (GET_MODE (dest)), 0);
1962 emit_move_insn (adjust_address (dest, GET_MODE (tmps[i]), bytepos),
1969 /* Optimize the access just a bit. */
1971 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
1972 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
1973 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1974 && bytelen == GET_MODE_SIZE (mode))
1975 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
1977 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
1981 /* Copy from the pseudo into the (probable) hard reg. */
1982 if (orig_dst != dst)
1983 emit_move_insn (orig_dst, dst);
1986 /* Generate code to copy a BLKmode object of TYPE out of a
1987 set of registers starting with SRCREG into TGTBLK. If TGTBLK
1988 is null, a stack temporary is created. TGTBLK is returned.
1990 The purpose of this routine is to handle functions that return
1991 BLKmode structures in registers. Some machines (the PA for example)
1992 want to return all small structures in registers regardless of the
1993 structure's alignment. */
1996 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
1998 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
1999 rtx src = NULL, dst = NULL;
2000 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
2001 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
2005 tgtblk = assign_temp (build_qualified_type (type,
2007 | TYPE_QUAL_CONST)),
2009 preserve_temp_slots (tgtblk);
2012 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2013 into a new pseudo which is a full word. */
2015 if (GET_MODE (srcreg) != BLKmode
2016 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
2017 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
2019 /* If the structure doesn't take up a whole number of words, see whether
2020 SRCREG is padded on the left or on the right. If it's on the left,
2021 set PADDING_CORRECTION to the number of bits to skip.
2023 In most ABIs, the structure will be returned at the least end of
2024 the register, which translates to right padding on little-endian
2025 targets and left padding on big-endian targets. The opposite
2026 holds if the structure is returned at the most significant
2027 end of the register. */
2028 if (bytes % UNITS_PER_WORD != 0
2029 && (targetm.calls.return_in_msb (type)
2031 : BYTES_BIG_ENDIAN))
2033 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2035 /* Copy the structure BITSIZE bites at a time.
2037 We could probably emit more efficient code for machines which do not use
2038 strict alignment, but it doesn't seem worth the effort at the current
2040 for (bitpos = 0, xbitpos = padding_correction;
2041 bitpos < bytes * BITS_PER_UNIT;
2042 bitpos += bitsize, xbitpos += bitsize)
2044 /* We need a new source operand each time xbitpos is on a
2045 word boundary and when xbitpos == padding_correction
2046 (the first time through). */
2047 if (xbitpos % BITS_PER_WORD == 0
2048 || xbitpos == padding_correction)
2049 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2052 /* We need a new destination operand each time bitpos is on
2054 if (bitpos % BITS_PER_WORD == 0)
2055 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2057 /* Use xbitpos for the source extraction (right justified) and
2058 xbitpos for the destination store (left justified). */
2059 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2060 extract_bit_field (src, bitsize,
2061 xbitpos % BITS_PER_WORD, 1,
2062 NULL_RTX, word_mode, word_mode));
2068 /* Add a USE expression for REG to the (possibly empty) list pointed
2069 to by CALL_FUSAGE. REG must denote a hard register. */
2072 use_reg (rtx *call_fusage, rtx reg)
2074 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2077 = gen_rtx_EXPR_LIST (VOIDmode,
2078 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2081 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2082 starting at REGNO. All of these registers must be hard registers. */
2085 use_regs (rtx *call_fusage, int regno, int nregs)
2089 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2091 for (i = 0; i < nregs; i++)
2092 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2095 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2096 PARALLEL REGS. This is for calls that pass values in multiple
2097 non-contiguous locations. The Irix 6 ABI has examples of this. */
2100 use_group_regs (rtx *call_fusage, rtx regs)
2104 for (i = 0; i < XVECLEN (regs, 0); i++)
2106 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2108 /* A NULL entry means the parameter goes both on the stack and in
2109 registers. This can also be a MEM for targets that pass values
2110 partially on the stack and partially in registers. */
2111 if (reg != 0 && REG_P (reg))
2112 use_reg (call_fusage, reg);
2117 /* Determine whether the LEN bytes generated by CONSTFUN can be
2118 stored to memory using several move instructions. CONSTFUNDATA is
2119 a pointer which will be passed as argument in every CONSTFUN call.
2120 ALIGN is maximum alignment we can assume. Return nonzero if a
2121 call to store_by_pieces should succeed. */
2124 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2125 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2126 void *constfundata, unsigned int align)
2128 unsigned HOST_WIDE_INT l;
2129 unsigned int max_size;
2130 HOST_WIDE_INT offset = 0;
2131 enum machine_mode mode, tmode;
2132 enum insn_code icode;
2139 if (! STORE_BY_PIECES_P (len, align))
2142 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2143 if (align >= GET_MODE_ALIGNMENT (tmode))
2144 align = GET_MODE_ALIGNMENT (tmode);
2147 enum machine_mode xmode;
2149 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2151 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2152 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2153 || SLOW_UNALIGNED_ACCESS (tmode, align))
2156 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2159 /* We would first store what we can in the largest integer mode, then go to
2160 successively smaller modes. */
2163 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2168 max_size = STORE_MAX_PIECES + 1;
2169 while (max_size > 1)
2171 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2172 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2173 if (GET_MODE_SIZE (tmode) < max_size)
2176 if (mode == VOIDmode)
2179 icode = mov_optab->handlers[(int) mode].insn_code;
2180 if (icode != CODE_FOR_nothing
2181 && align >= GET_MODE_ALIGNMENT (mode))
2183 unsigned int size = GET_MODE_SIZE (mode);
2190 cst = (*constfun) (constfundata, offset, mode);
2191 if (!LEGITIMATE_CONSTANT_P (cst))
2201 max_size = GET_MODE_SIZE (mode);
2204 /* The code above should have handled everything. */
2211 /* Generate several move instructions to store LEN bytes generated by
2212 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2213 pointer which will be passed as argument in every CONSTFUN call.
2214 ALIGN is maximum alignment we can assume.
2215 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2216 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2220 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2221 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2222 void *constfundata, unsigned int align, int endp)
2224 struct store_by_pieces data;
2228 gcc_assert (endp != 2);
2232 gcc_assert (STORE_BY_PIECES_P (len, align));
2233 data.constfun = constfun;
2234 data.constfundata = constfundata;
2237 store_by_pieces_1 (&data, align);
2242 gcc_assert (!data.reverse);
2247 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2248 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2250 data.to_addr = copy_addr_to_reg (plus_constant (data.to_addr,
2253 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2260 to1 = adjust_address (data.to, QImode, data.offset);
2268 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2269 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2272 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2274 struct store_by_pieces data;
2279 data.constfun = clear_by_pieces_1;
2280 data.constfundata = NULL;
2283 store_by_pieces_1 (&data, align);
2286 /* Callback routine for clear_by_pieces.
2287 Return const0_rtx unconditionally. */
2290 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2291 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2292 enum machine_mode mode ATTRIBUTE_UNUSED)
2297 /* Subroutine of clear_by_pieces and store_by_pieces.
2298 Generate several move instructions to store LEN bytes of block TO. (A MEM
2299 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2302 store_by_pieces_1 (struct store_by_pieces *data ATTRIBUTE_UNUSED,
2303 unsigned int align ATTRIBUTE_UNUSED)
2305 rtx to_addr = XEXP (data->to, 0);
2306 unsigned int max_size = STORE_MAX_PIECES + 1;
2307 enum machine_mode mode = VOIDmode, tmode;
2308 enum insn_code icode;
2311 data->to_addr = to_addr;
2313 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2314 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2316 data->explicit_inc_to = 0;
2318 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2320 data->offset = data->len;
2322 /* If storing requires more than two move insns,
2323 copy addresses to registers (to make displacements shorter)
2324 and use post-increment if available. */
2325 if (!data->autinc_to
2326 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2328 /* Determine the main mode we'll be using. */
2329 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2330 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2331 if (GET_MODE_SIZE (tmode) < max_size)
2334 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2336 data->to_addr = copy_addr_to_reg (plus_constant (to_addr, data->len));
2337 data->autinc_to = 1;
2338 data->explicit_inc_to = -1;
2341 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2342 && ! data->autinc_to)
2344 data->to_addr = copy_addr_to_reg (to_addr);
2345 data->autinc_to = 1;
2346 data->explicit_inc_to = 1;
2349 if ( !data->autinc_to && CONSTANT_P (to_addr))
2350 data->to_addr = copy_addr_to_reg (to_addr);
2353 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2354 if (align >= GET_MODE_ALIGNMENT (tmode))
2355 align = GET_MODE_ALIGNMENT (tmode);
2358 enum machine_mode xmode;
2360 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2362 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2363 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2364 || SLOW_UNALIGNED_ACCESS (tmode, align))
2367 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2370 /* First store what we can in the largest integer mode, then go to
2371 successively smaller modes. */
2373 while (max_size > 1)
2375 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2376 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2377 if (GET_MODE_SIZE (tmode) < max_size)
2380 if (mode == VOIDmode)
2383 icode = mov_optab->handlers[(int) mode].insn_code;
2384 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2385 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2387 max_size = GET_MODE_SIZE (mode);
2390 /* The code above should have handled everything. */
2391 gcc_assert (!data->len);
2394 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2395 with move instructions for mode MODE. GENFUN is the gen_... function
2396 to make a move insn for that mode. DATA has all the other info. */
2399 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2400 struct store_by_pieces *data)
2402 unsigned int size = GET_MODE_SIZE (mode);
2405 while (data->len >= size)
2408 data->offset -= size;
2410 if (data->autinc_to)
2411 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2414 to1 = adjust_address (data->to, mode, data->offset);
2416 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2417 emit_insn (gen_add2_insn (data->to_addr,
2418 GEN_INT (-(HOST_WIDE_INT) size)));
2420 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2421 emit_insn ((*genfun) (to1, cst));
2423 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2424 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2426 if (! data->reverse)
2427 data->offset += size;
2433 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2434 its length in bytes. */
2437 clear_storage (rtx object, rtx size, enum block_op_methods method)
2439 enum machine_mode mode = GET_MODE (object);
2442 gcc_assert (method == BLOCK_OP_NORMAL || method == BLOCK_OP_TAILCALL);
2444 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2445 just move a zero. Otherwise, do this a piece at a time. */
2447 && GET_CODE (size) == CONST_INT
2448 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2450 rtx zero = CONST0_RTX (mode);
2453 emit_move_insn (object, zero);
2457 if (COMPLEX_MODE_P (mode))
2459 zero = CONST0_RTX (GET_MODE_INNER (mode));
2462 write_complex_part (object, zero, 0);
2463 write_complex_part (object, zero, 1);
2469 if (size == const0_rtx)
2472 align = MEM_ALIGN (object);
2474 if (GET_CODE (size) == CONST_INT
2475 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2476 clear_by_pieces (object, INTVAL (size), align);
2477 else if (set_storage_via_setmem (object, size, const0_rtx, align))
2480 return clear_storage_via_libcall (object, size,
2481 method == BLOCK_OP_TAILCALL);
2486 /* A subroutine of clear_storage. Expand a call to memset.
2487 Return the return value of memset, 0 otherwise. */
2490 clear_storage_via_libcall (rtx object, rtx size, bool tailcall)
2492 tree call_expr, arg_list, fn, object_tree, size_tree;
2493 enum machine_mode size_mode;
2496 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2497 place those into new pseudos into a VAR_DECL and use them later. */
2499 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2501 size_mode = TYPE_MODE (sizetype);
2502 size = convert_to_mode (size_mode, size, 1);
2503 size = copy_to_mode_reg (size_mode, size);
2505 /* It is incorrect to use the libcall calling conventions to call
2506 memset in this context. This could be a user call to memset and
2507 the user may wish to examine the return value from memset. For
2508 targets where libcalls and normal calls have different conventions
2509 for returning pointers, we could end up generating incorrect code. */
2511 object_tree = make_tree (ptr_type_node, object);
2512 size_tree = make_tree (sizetype, size);
2514 fn = clear_storage_libcall_fn (true);
2515 arg_list = tree_cons (NULL_TREE, size_tree, NULL_TREE);
2516 arg_list = tree_cons (NULL_TREE, integer_zero_node, arg_list);
2517 arg_list = tree_cons (NULL_TREE, object_tree, arg_list);
2519 /* Now we have to build up the CALL_EXPR itself. */
2520 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2521 call_expr = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
2522 call_expr, arg_list, NULL_TREE);
2523 CALL_EXPR_TAILCALL (call_expr) = tailcall;
2525 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
2530 /* A subroutine of clear_storage_via_libcall. Create the tree node
2531 for the function we use for block clears. The first time FOR_CALL
2532 is true, we call assemble_external. */
2534 static GTY(()) tree block_clear_fn;
2537 init_block_clear_fn (const char *asmspec)
2539 if (!block_clear_fn)
2543 fn = get_identifier ("memset");
2544 args = build_function_type_list (ptr_type_node, ptr_type_node,
2545 integer_type_node, sizetype,
2548 fn = build_decl (FUNCTION_DECL, fn, args);
2549 DECL_EXTERNAL (fn) = 1;
2550 TREE_PUBLIC (fn) = 1;
2551 DECL_ARTIFICIAL (fn) = 1;
2552 TREE_NOTHROW (fn) = 1;
2554 block_clear_fn = fn;
2558 set_user_assembler_name (block_clear_fn, asmspec);
2562 clear_storage_libcall_fn (int for_call)
2564 static bool emitted_extern;
2566 if (!block_clear_fn)
2567 init_block_clear_fn (NULL);
2569 if (for_call && !emitted_extern)
2571 emitted_extern = true;
2572 make_decl_rtl (block_clear_fn);
2573 assemble_external (block_clear_fn);
2576 return block_clear_fn;
2579 /* Expand a setmem pattern; return true if successful. */
2582 set_storage_via_setmem (rtx object, rtx size, rtx val, unsigned int align)
2584 /* Try the most limited insn first, because there's no point
2585 including more than one in the machine description unless
2586 the more limited one has some advantage. */
2588 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2589 enum machine_mode mode;
2591 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2592 mode = GET_MODE_WIDER_MODE (mode))
2594 enum insn_code code = setmem_optab[(int) mode];
2595 insn_operand_predicate_fn pred;
2597 if (code != CODE_FOR_nothing
2598 /* We don't need MODE to be narrower than
2599 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2600 the mode mask, as it is returned by the macro, it will
2601 definitely be less than the actual mode mask. */
2602 && ((GET_CODE (size) == CONST_INT
2603 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2604 <= (GET_MODE_MASK (mode) >> 1)))
2605 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2606 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2607 || (*pred) (object, BLKmode))
2608 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
2609 || (*pred) (opalign, VOIDmode)))
2612 rtx last = get_last_insn ();
2615 opsize = convert_to_mode (mode, size, 1);
2616 pred = insn_data[(int) code].operand[1].predicate;
2617 if (pred != 0 && ! (*pred) (opsize, mode))
2618 opsize = copy_to_mode_reg (mode, opsize);
2620 opchar = convert_to_mode (mode, val, 1);
2621 pred = insn_data[(int) code].operand[2].predicate;
2622 if (pred != 0 && ! (*pred) (opchar, mode))
2623 opchar = copy_to_mode_reg (mode, opchar);
2625 pat = GEN_FCN ((int) code) (object, opsize, opchar, opalign);
2632 delete_insns_since (last);
2640 /* Write to one of the components of the complex value CPLX. Write VAL to
2641 the real part if IMAG_P is false, and the imaginary part if its true. */
2644 write_complex_part (rtx cplx, rtx val, bool imag_p)
2646 enum machine_mode cmode;
2647 enum machine_mode imode;
2650 if (GET_CODE (cplx) == CONCAT)
2652 emit_move_insn (XEXP (cplx, imag_p), val);
2656 cmode = GET_MODE (cplx);
2657 imode = GET_MODE_INNER (cmode);
2658 ibitsize = GET_MODE_BITSIZE (imode);
2660 /* For MEMs simplify_gen_subreg may generate an invalid new address
2661 because, e.g., the original address is considered mode-dependent
2662 by the target, which restricts simplify_subreg from invoking
2663 adjust_address_nv. Instead of preparing fallback support for an
2664 invalid address, we call adjust_address_nv directly. */
2666 emit_move_insn (adjust_address_nv (cplx, imode,
2667 imag_p ? GET_MODE_SIZE (imode) : 0),
2670 /* If the sub-object is at least word sized, then we know that subregging
2671 will work. This special case is important, since store_bit_field
2672 wants to operate on integer modes, and there's rarely an OImode to
2673 correspond to TCmode. */
2674 if (ibitsize >= BITS_PER_WORD
2675 /* For hard regs we have exact predicates. Assume we can split
2676 the original object if it spans an even number of hard regs.
2677 This special case is important for SCmode on 64-bit platforms
2678 where the natural size of floating-point regs is 32-bit. */
2680 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2681 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2683 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2684 imag_p ? GET_MODE_SIZE (imode) : 0);
2687 emit_move_insn (part, val);
2691 /* simplify_gen_subreg may fail for sub-word MEMs. */
2692 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2695 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2698 /* Extract one of the components of the complex value CPLX. Extract the
2699 real part if IMAG_P is false, and the imaginary part if it's true. */
2702 read_complex_part (rtx cplx, bool imag_p)
2704 enum machine_mode cmode, imode;
2707 if (GET_CODE (cplx) == CONCAT)
2708 return XEXP (cplx, imag_p);
2710 cmode = GET_MODE (cplx);
2711 imode = GET_MODE_INNER (cmode);
2712 ibitsize = GET_MODE_BITSIZE (imode);
2714 /* Special case reads from complex constants that got spilled to memory. */
2715 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2717 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2718 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2720 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2721 if (CONSTANT_CLASS_P (part))
2722 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2726 /* For MEMs simplify_gen_subreg may generate an invalid new address
2727 because, e.g., the original address is considered mode-dependent
2728 by the target, which restricts simplify_subreg from invoking
2729 adjust_address_nv. Instead of preparing fallback support for an
2730 invalid address, we call adjust_address_nv directly. */
2732 return adjust_address_nv (cplx, imode,
2733 imag_p ? GET_MODE_SIZE (imode) : 0);
2735 /* If the sub-object is at least word sized, then we know that subregging
2736 will work. This special case is important, since extract_bit_field
2737 wants to operate on integer modes, and there's rarely an OImode to
2738 correspond to TCmode. */
2739 if (ibitsize >= BITS_PER_WORD
2740 /* For hard regs we have exact predicates. Assume we can split
2741 the original object if it spans an even number of hard regs.
2742 This special case is important for SCmode on 64-bit platforms
2743 where the natural size of floating-point regs is 32-bit. */
2745 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2746 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0))
2748 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2749 imag_p ? GET_MODE_SIZE (imode) : 0);
2753 /* simplify_gen_subreg may fail for sub-word MEMs. */
2754 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2757 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2758 true, NULL_RTX, imode, imode);
2761 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2762 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2763 represented in NEW_MODE. If FORCE is true, this will never happen, as
2764 we'll force-create a SUBREG if needed. */
2767 emit_move_change_mode (enum machine_mode new_mode,
2768 enum machine_mode old_mode, rtx x, bool force)
2772 if (reload_in_progress && MEM_P (x))
2774 /* We can't use gen_lowpart here because it may call change_address
2775 which is not appropriate if we were called when a reload was in
2776 progress. We don't have to worry about changing the address since
2777 the size in bytes is supposed to be the same. Copy the MEM to
2778 change the mode and move any substitutions from the old MEM to
2781 ret = adjust_address_nv (x, new_mode, 0);
2782 copy_replacements (x, ret);
2786 /* Note that we do want simplify_subreg's behavior of validating
2787 that the new mode is ok for a hard register. If we were to use
2788 simplify_gen_subreg, we would create the subreg, but would
2789 probably run into the target not being able to implement it. */
2790 /* Except, of course, when FORCE is true, when this is exactly what
2791 we want. Which is needed for CCmodes on some targets. */
2793 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
2795 ret = simplify_subreg (new_mode, x, old_mode, 0);
2801 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
2802 an integer mode of the same size as MODE. Returns the instruction
2803 emitted, or NULL if such a move could not be generated. */
2806 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y)
2808 enum machine_mode imode;
2809 enum insn_code code;
2811 /* There must exist a mode of the exact size we require. */
2812 imode = int_mode_for_mode (mode);
2813 if (imode == BLKmode)
2816 /* The target must support moves in this mode. */
2817 code = mov_optab->handlers[imode].insn_code;
2818 if (code == CODE_FOR_nothing)
2821 x = emit_move_change_mode (imode, mode, x, false);
2824 y = emit_move_change_mode (imode, mode, y, false);
2827 return emit_insn (GEN_FCN (code) (x, y));
2830 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
2831 Return an equivalent MEM that does not use an auto-increment. */
2834 emit_move_resolve_push (enum machine_mode mode, rtx x)
2836 enum rtx_code code = GET_CODE (XEXP (x, 0));
2837 HOST_WIDE_INT adjust;
2840 adjust = GET_MODE_SIZE (mode);
2841 #ifdef PUSH_ROUNDING
2842 adjust = PUSH_ROUNDING (adjust);
2844 if (code == PRE_DEC || code == POST_DEC)
2847 /* Do not use anti_adjust_stack, since we don't want to update
2848 stack_pointer_delta. */
2849 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
2850 GEN_INT (adjust), stack_pointer_rtx,
2851 0, OPTAB_LIB_WIDEN);
2852 if (temp != stack_pointer_rtx)
2853 emit_move_insn (stack_pointer_rtx, temp);
2859 temp = stack_pointer_rtx;
2862 temp = plus_constant (stack_pointer_rtx, -GET_MODE_SIZE (mode));
2865 temp = plus_constant (stack_pointer_rtx, GET_MODE_SIZE (mode));
2871 return replace_equiv_address (x, temp);
2874 /* A subroutine of emit_move_complex. Generate a move from Y into X.
2875 X is known to satisfy push_operand, and MODE is known to be complex.
2876 Returns the last instruction emitted. */
2879 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
2881 enum machine_mode submode = GET_MODE_INNER (mode);
2884 #ifdef PUSH_ROUNDING
2885 unsigned int submodesize = GET_MODE_SIZE (submode);
2887 /* In case we output to the stack, but the size is smaller than the
2888 machine can push exactly, we need to use move instructions. */
2889 if (PUSH_ROUNDING (submodesize) != submodesize)
2891 x = emit_move_resolve_push (mode, x);
2892 return emit_move_insn (x, y);
2896 /* Note that the real part always precedes the imag part in memory
2897 regardless of machine's endianness. */
2898 switch (GET_CODE (XEXP (x, 0)))
2912 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
2913 read_complex_part (y, imag_first));
2914 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
2915 read_complex_part (y, !imag_first));
2918 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
2919 MODE is known to be complex. Returns the last instruction emitted. */
2922 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
2926 /* Need to take special care for pushes, to maintain proper ordering
2927 of the data, and possibly extra padding. */
2928 if (push_operand (x, mode))
2929 return emit_move_complex_push (mode, x, y);
2931 /* See if we can coerce the target into moving both values at once. */
2933 /* Move floating point as parts. */
2934 if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT
2935 && mov_optab->handlers[GET_MODE_INNER (mode)].insn_code != CODE_FOR_nothing)
2937 /* Not possible if the values are inherently not adjacent. */
2938 else if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
2940 /* Is possible if both are registers (or subregs of registers). */
2941 else if (register_operand (x, mode) && register_operand (y, mode))
2943 /* If one of the operands is a memory, and alignment constraints
2944 are friendly enough, we may be able to do combined memory operations.
2945 We do not attempt this if Y is a constant because that combination is
2946 usually better with the by-parts thing below. */
2947 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
2948 && (!STRICT_ALIGNMENT
2949 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
2958 /* For memory to memory moves, optimal behavior can be had with the
2959 existing block move logic. */
2960 if (MEM_P (x) && MEM_P (y))
2962 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
2963 BLOCK_OP_NO_LIBCALL);
2964 return get_last_insn ();
2967 ret = emit_move_via_integer (mode, x, y);
2972 /* Show the output dies here. This is necessary for SUBREGs
2973 of pseudos since we cannot track their lifetimes correctly;
2974 hard regs shouldn't appear here except as return values. */
2975 if (!reload_completed && !reload_in_progress
2976 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
2977 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
2979 write_complex_part (x, read_complex_part (y, false), false);
2980 write_complex_part (x, read_complex_part (y, true), true);
2981 return get_last_insn ();
2984 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
2985 MODE is known to be MODE_CC. Returns the last instruction emitted. */
2988 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
2992 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
2995 enum insn_code code = mov_optab->handlers[CCmode].insn_code;
2996 if (code != CODE_FOR_nothing)
2998 x = emit_move_change_mode (CCmode, mode, x, true);
2999 y = emit_move_change_mode (CCmode, mode, y, true);
3000 return emit_insn (GEN_FCN (code) (x, y));
3004 /* Otherwise, find the MODE_INT mode of the same width. */
3005 ret = emit_move_via_integer (mode, x, y);
3006 gcc_assert (ret != NULL);
3010 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3011 MODE is any multi-word or full-word mode that lacks a move_insn
3012 pattern. Note that you will get better code if you define such
3013 patterns, even if they must turn into multiple assembler instructions. */
3016 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
3023 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
3025 /* If X is a push on the stack, do the push now and replace
3026 X with a reference to the stack pointer. */
3027 if (push_operand (x, mode))
3028 x = emit_move_resolve_push (mode, x);
3030 /* If we are in reload, see if either operand is a MEM whose address
3031 is scheduled for replacement. */
3032 if (reload_in_progress && MEM_P (x)
3033 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
3034 x = replace_equiv_address_nv (x, inner);
3035 if (reload_in_progress && MEM_P (y)
3036 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
3037 y = replace_equiv_address_nv (y, inner);
3041 need_clobber = false;
3043 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
3046 rtx xpart = operand_subword (x, i, 1, mode);
3047 rtx ypart = operand_subword (y, i, 1, mode);
3049 /* If we can't get a part of Y, put Y into memory if it is a
3050 constant. Otherwise, force it into a register. Then we must
3051 be able to get a part of Y. */
3052 if (ypart == 0 && CONSTANT_P (y))
3054 y = force_const_mem (mode, y);
3055 ypart = operand_subword (y, i, 1, mode);
3057 else if (ypart == 0)
3058 ypart = operand_subword_force (y, i, mode);
3060 gcc_assert (xpart && ypart);
3062 need_clobber |= (GET_CODE (xpart) == SUBREG);
3064 last_insn = emit_move_insn (xpart, ypart);
3070 /* Show the output dies here. This is necessary for SUBREGs
3071 of pseudos since we cannot track their lifetimes correctly;
3072 hard regs shouldn't appear here except as return values.
3073 We never want to emit such a clobber after reload. */
3075 && ! (reload_in_progress || reload_completed)
3076 && need_clobber != 0)
3077 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3084 /* Low level part of emit_move_insn.
3085 Called just like emit_move_insn, but assumes X and Y
3086 are basically valid. */
3089 emit_move_insn_1 (rtx x, rtx y)
3091 enum machine_mode mode = GET_MODE (x);
3092 enum insn_code code;
3094 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3096 code = mov_optab->handlers[mode].insn_code;
3097 if (code != CODE_FOR_nothing)
3098 return emit_insn (GEN_FCN (code) (x, y));
3100 /* Expand complex moves by moving real part and imag part. */
3101 if (COMPLEX_MODE_P (mode))
3102 return emit_move_complex (mode, x, y);
3104 if (GET_MODE_CLASS (mode) == MODE_CC)
3105 return emit_move_ccmode (mode, x, y);
3107 /* Try using a move pattern for the corresponding integer mode. This is
3108 only safe when simplify_subreg can convert MODE constants into integer
3109 constants. At present, it can only do this reliably if the value
3110 fits within a HOST_WIDE_INT. */
3111 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3113 rtx ret = emit_move_via_integer (mode, x, y);
3118 return emit_move_multi_word (mode, x, y);
3121 /* Generate code to copy Y into X.
3122 Both Y and X must have the same mode, except that
3123 Y can be a constant with VOIDmode.
3124 This mode cannot be BLKmode; use emit_block_move for that.
3126 Return the last instruction emitted. */
3129 emit_move_insn (rtx x, rtx y)
3131 enum machine_mode mode = GET_MODE (x);
3132 rtx y_cst = NULL_RTX;
3135 gcc_assert (mode != BLKmode
3136 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3141 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3142 && (last_insn = compress_float_constant (x, y)))
3147 if (!LEGITIMATE_CONSTANT_P (y))
3149 y = force_const_mem (mode, y);
3151 /* If the target's cannot_force_const_mem prevented the spill,
3152 assume that the target's move expanders will also take care
3153 of the non-legitimate constant. */
3159 /* If X or Y are memory references, verify that their addresses are valid
3162 && ((! memory_address_p (GET_MODE (x), XEXP (x, 0))
3163 && ! push_operand (x, GET_MODE (x)))
3165 && CONSTANT_ADDRESS_P (XEXP (x, 0)))))
3166 x = validize_mem (x);
3169 && (! memory_address_p (GET_MODE (y), XEXP (y, 0))
3171 && CONSTANT_ADDRESS_P (XEXP (y, 0)))))
3172 y = validize_mem (y);
3174 gcc_assert (mode != BLKmode);
3176 last_insn = emit_move_insn_1 (x, y);
3178 if (y_cst && REG_P (x)
3179 && (set = single_set (last_insn)) != NULL_RTX
3180 && SET_DEST (set) == x
3181 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3182 set_unique_reg_note (last_insn, REG_EQUAL, y_cst);
3187 /* If Y is representable exactly in a narrower mode, and the target can
3188 perform the extension directly from constant or memory, then emit the
3189 move as an extension. */
3192 compress_float_constant (rtx x, rtx y)
3194 enum machine_mode dstmode = GET_MODE (x);
3195 enum machine_mode orig_srcmode = GET_MODE (y);
3196 enum machine_mode srcmode;
3199 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3201 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3202 srcmode != orig_srcmode;
3203 srcmode = GET_MODE_WIDER_MODE (srcmode))
3206 rtx trunc_y, last_insn;
3208 /* Skip if the target can't extend this way. */
3209 ic = can_extend_p (dstmode, srcmode, 0);
3210 if (ic == CODE_FOR_nothing)
3213 /* Skip if the narrowed value isn't exact. */
3214 if (! exact_real_truncate (srcmode, &r))
3217 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3219 if (LEGITIMATE_CONSTANT_P (trunc_y))
3221 /* Skip if the target needs extra instructions to perform
3223 if (! (*insn_data[ic].operand[1].predicate) (trunc_y, srcmode))
3226 else if (float_extend_from_mem[dstmode][srcmode])
3227 trunc_y = validize_mem (force_const_mem (srcmode, trunc_y));
3231 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3232 last_insn = get_last_insn ();
3235 set_unique_reg_note (last_insn, REG_EQUAL, y);
3243 /* Pushing data onto the stack. */
3245 /* Push a block of length SIZE (perhaps variable)
3246 and return an rtx to address the beginning of the block.
3247 The value may be virtual_outgoing_args_rtx.
3249 EXTRA is the number of bytes of padding to push in addition to SIZE.
3250 BELOW nonzero means this padding comes at low addresses;
3251 otherwise, the padding comes at high addresses. */
3254 push_block (rtx size, int extra, int below)
3258 size = convert_modes (Pmode, ptr_mode, size, 1);
3259 if (CONSTANT_P (size))
3260 anti_adjust_stack (plus_constant (size, extra));
3261 else if (REG_P (size) && extra == 0)
3262 anti_adjust_stack (size);
3265 temp = copy_to_mode_reg (Pmode, size);
3267 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3268 temp, 0, OPTAB_LIB_WIDEN);
3269 anti_adjust_stack (temp);
3272 #ifndef STACK_GROWS_DOWNWARD
3278 temp = virtual_outgoing_args_rtx;
3279 if (extra != 0 && below)
3280 temp = plus_constant (temp, extra);
3284 if (GET_CODE (size) == CONST_INT)
3285 temp = plus_constant (virtual_outgoing_args_rtx,
3286 -INTVAL (size) - (below ? 0 : extra));
3287 else if (extra != 0 && !below)
3288 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3289 negate_rtx (Pmode, plus_constant (size, extra)));
3291 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3292 negate_rtx (Pmode, size));
3295 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3298 #ifdef PUSH_ROUNDING
3300 /* Emit single push insn. */
3303 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3306 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3308 enum insn_code icode;
3309 insn_operand_predicate_fn pred;
3311 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3312 /* If there is push pattern, use it. Otherwise try old way of throwing
3313 MEM representing push operation to move expander. */
3314 icode = push_optab->handlers[(int) mode].insn_code;
3315 if (icode != CODE_FOR_nothing)
3317 if (((pred = insn_data[(int) icode].operand[0].predicate)
3318 && !((*pred) (x, mode))))
3319 x = force_reg (mode, x);
3320 emit_insn (GEN_FCN (icode) (x));
3323 if (GET_MODE_SIZE (mode) == rounded_size)
3324 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3325 /* If we are to pad downward, adjust the stack pointer first and
3326 then store X into the stack location using an offset. This is
3327 because emit_move_insn does not know how to pad; it does not have
3329 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3331 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3332 HOST_WIDE_INT offset;
3334 emit_move_insn (stack_pointer_rtx,
3335 expand_binop (Pmode,
3336 #ifdef STACK_GROWS_DOWNWARD
3342 GEN_INT (rounded_size),
3343 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3345 offset = (HOST_WIDE_INT) padding_size;
3346 #ifdef STACK_GROWS_DOWNWARD
3347 if (STACK_PUSH_CODE == POST_DEC)
3348 /* We have already decremented the stack pointer, so get the
3350 offset += (HOST_WIDE_INT) rounded_size;
3352 if (STACK_PUSH_CODE == POST_INC)
3353 /* We have already incremented the stack pointer, so get the
3355 offset -= (HOST_WIDE_INT) rounded_size;
3357 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3361 #ifdef STACK_GROWS_DOWNWARD
3362 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3363 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3364 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3366 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3367 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3368 GEN_INT (rounded_size));
3370 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3373 dest = gen_rtx_MEM (mode, dest_addr);
3377 set_mem_attributes (dest, type, 1);
3379 if (flag_optimize_sibling_calls)
3380 /* Function incoming arguments may overlap with sibling call
3381 outgoing arguments and we cannot allow reordering of reads
3382 from function arguments with stores to outgoing arguments
3383 of sibling calls. */
3384 set_mem_alias_set (dest, 0);
3386 emit_move_insn (dest, x);
3390 /* Generate code to push X onto the stack, assuming it has mode MODE and
3392 MODE is redundant except when X is a CONST_INT (since they don't
3394 SIZE is an rtx for the size of data to be copied (in bytes),
3395 needed only if X is BLKmode.
3397 ALIGN (in bits) is maximum alignment we can assume.
3399 If PARTIAL and REG are both nonzero, then copy that many of the first
3400 bytes of X into registers starting with REG, and push the rest of X.
3401 The amount of space pushed is decreased by PARTIAL bytes.
3402 REG must be a hard register in this case.
3403 If REG is zero but PARTIAL is not, take any all others actions for an
3404 argument partially in registers, but do not actually load any
3407 EXTRA is the amount in bytes of extra space to leave next to this arg.
3408 This is ignored if an argument block has already been allocated.
3410 On a machine that lacks real push insns, ARGS_ADDR is the address of
3411 the bottom of the argument block for this call. We use indexing off there
3412 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3413 argument block has not been preallocated.
3415 ARGS_SO_FAR is the size of args previously pushed for this call.
3417 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3418 for arguments passed in registers. If nonzero, it will be the number
3419 of bytes required. */
3422 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3423 unsigned int align, int partial, rtx reg, int extra,
3424 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3428 enum direction stack_direction
3429 #ifdef STACK_GROWS_DOWNWARD
3435 /* Decide where to pad the argument: `downward' for below,
3436 `upward' for above, or `none' for don't pad it.
3437 Default is below for small data on big-endian machines; else above. */
3438 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3440 /* Invert direction if stack is post-decrement.
3442 if (STACK_PUSH_CODE == POST_DEC)
3443 if (where_pad != none)
3444 where_pad = (where_pad == downward ? upward : downward);
3448 if (mode == BLKmode)
3450 /* Copy a block into the stack, entirely or partially. */
3457 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3458 used = partial - offset;
3462 /* USED is now the # of bytes we need not copy to the stack
3463 because registers will take care of them. */
3466 xinner = adjust_address (xinner, BLKmode, used);
3468 /* If the partial register-part of the arg counts in its stack size,
3469 skip the part of stack space corresponding to the registers.
3470 Otherwise, start copying to the beginning of the stack space,
3471 by setting SKIP to 0. */
3472 skip = (reg_parm_stack_space == 0) ? 0 : used;
3474 #ifdef PUSH_ROUNDING
3475 /* Do it with several push insns if that doesn't take lots of insns
3476 and if there is no difficulty with push insns that skip bytes
3477 on the stack for alignment purposes. */
3480 && GET_CODE (size) == CONST_INT
3482 && MEM_ALIGN (xinner) >= align
3483 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3484 /* Here we avoid the case of a structure whose weak alignment
3485 forces many pushes of a small amount of data,
3486 and such small pushes do rounding that causes trouble. */
3487 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3488 || align >= BIGGEST_ALIGNMENT
3489 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3490 == (align / BITS_PER_UNIT)))
3491 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3493 /* Push padding now if padding above and stack grows down,
3494 or if padding below and stack grows up.
3495 But if space already allocated, this has already been done. */
3496 if (extra && args_addr == 0
3497 && where_pad != none && where_pad != stack_direction)
3498 anti_adjust_stack (GEN_INT (extra));
3500 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3503 #endif /* PUSH_ROUNDING */
3507 /* Otherwise make space on the stack and copy the data
3508 to the address of that space. */
3510 /* Deduct words put into registers from the size we must copy. */
3513 if (GET_CODE (size) == CONST_INT)
3514 size = GEN_INT (INTVAL (size) - used);
3516 size = expand_binop (GET_MODE (size), sub_optab, size,
3517 GEN_INT (used), NULL_RTX, 0,
3521 /* Get the address of the stack space.
3522 In this case, we do not deal with EXTRA separately.
3523 A single stack adjust will do. */
3526 temp = push_block (size, extra, where_pad == downward);
3529 else if (GET_CODE (args_so_far) == CONST_INT)
3530 temp = memory_address (BLKmode,
3531 plus_constant (args_addr,
3532 skip + INTVAL (args_so_far)));
3534 temp = memory_address (BLKmode,
3535 plus_constant (gen_rtx_PLUS (Pmode,
3540 if (!ACCUMULATE_OUTGOING_ARGS)
3542 /* If the source is referenced relative to the stack pointer,
3543 copy it to another register to stabilize it. We do not need
3544 to do this if we know that we won't be changing sp. */
3546 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3547 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3548 temp = copy_to_reg (temp);
3551 target = gen_rtx_MEM (BLKmode, temp);
3553 /* We do *not* set_mem_attributes here, because incoming arguments
3554 may overlap with sibling call outgoing arguments and we cannot
3555 allow reordering of reads from function arguments with stores
3556 to outgoing arguments of sibling calls. We do, however, want
3557 to record the alignment of the stack slot. */
3558 /* ALIGN may well be better aligned than TYPE, e.g. due to
3559 PARM_BOUNDARY. Assume the caller isn't lying. */
3560 set_mem_align (target, align);
3562 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3565 else if (partial > 0)
3567 /* Scalar partly in registers. */
3569 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3572 /* # bytes of start of argument
3573 that we must make space for but need not store. */
3574 int offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3575 int args_offset = INTVAL (args_so_far);
3578 /* Push padding now if padding above and stack grows down,
3579 or if padding below and stack grows up.
3580 But if space already allocated, this has already been done. */
3581 if (extra && args_addr == 0
3582 && where_pad != none && where_pad != stack_direction)
3583 anti_adjust_stack (GEN_INT (extra));
3585 /* If we make space by pushing it, we might as well push
3586 the real data. Otherwise, we can leave OFFSET nonzero
3587 and leave the space uninitialized. */
3591 /* Now NOT_STACK gets the number of words that we don't need to
3592 allocate on the stack. Convert OFFSET to words too. */
3593 not_stack = (partial - offset) / UNITS_PER_WORD;
3594 offset /= UNITS_PER_WORD;
3596 /* If the partial register-part of the arg counts in its stack size,
3597 skip the part of stack space corresponding to the registers.
3598 Otherwise, start copying to the beginning of the stack space,
3599 by setting SKIP to 0. */
3600 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3602 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3603 x = validize_mem (force_const_mem (mode, x));
3605 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3606 SUBREGs of such registers are not allowed. */
3607 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3608 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3609 x = copy_to_reg (x);
3611 /* Loop over all the words allocated on the stack for this arg. */
3612 /* We can do it by words, because any scalar bigger than a word
3613 has a size a multiple of a word. */
3614 #ifndef PUSH_ARGS_REVERSED
3615 for (i = not_stack; i < size; i++)
3617 for (i = size - 1; i >= not_stack; i--)
3619 if (i >= not_stack + offset)
3620 emit_push_insn (operand_subword_force (x, i, mode),
3621 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3623 GEN_INT (args_offset + ((i - not_stack + skip)
3625 reg_parm_stack_space, alignment_pad);
3632 /* Push padding now if padding above and stack grows down,
3633 or if padding below and stack grows up.
3634 But if space already allocated, this has already been done. */
3635 if (extra && args_addr == 0
3636 && where_pad != none && where_pad != stack_direction)
3637 anti_adjust_stack (GEN_INT (extra));
3639 #ifdef PUSH_ROUNDING
3640 if (args_addr == 0 && PUSH_ARGS)
3641 emit_single_push_insn (mode, x, type);
3645 if (GET_CODE (args_so_far) == CONST_INT)
3647 = memory_address (mode,
3648 plus_constant (args_addr,
3649 INTVAL (args_so_far)));
3651 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3653 dest = gen_rtx_MEM (mode, addr);
3655 /* We do *not* set_mem_attributes here, because incoming arguments
3656 may overlap with sibling call outgoing arguments and we cannot
3657 allow reordering of reads from function arguments with stores
3658 to outgoing arguments of sibling calls. We do, however, want
3659 to record the alignment of the stack slot. */
3660 /* ALIGN may well be better aligned than TYPE, e.g. due to
3661 PARM_BOUNDARY. Assume the caller isn't lying. */
3662 set_mem_align (dest, align);
3664 emit_move_insn (dest, x);
3668 /* If part should go in registers, copy that part
3669 into the appropriate registers. Do this now, at the end,
3670 since mem-to-mem copies above may do function calls. */
3671 if (partial > 0 && reg != 0)
3673 /* Handle calls that pass values in multiple non-contiguous locations.
3674 The Irix 6 ABI has examples of this. */
3675 if (GET_CODE (reg) == PARALLEL)
3676 emit_group_load (reg, x, type, -1);
3679 gcc_assert (partial % UNITS_PER_WORD == 0);
3680 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
3684 if (extra && args_addr == 0 && where_pad == stack_direction)
3685 anti_adjust_stack (GEN_INT (extra));
3687 if (alignment_pad && args_addr == 0)
3688 anti_adjust_stack (alignment_pad);
3691 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3695 get_subtarget (rtx x)
3699 /* Only registers can be subtargets. */
3701 /* Don't use hard regs to avoid extending their life. */
3702 || REGNO (x) < FIRST_PSEUDO_REGISTER
3706 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
3707 FIELD is a bitfield. Returns true if the optimization was successful,
3708 and there's nothing else to do. */
3711 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
3712 unsigned HOST_WIDE_INT bitpos,
3713 enum machine_mode mode1, rtx str_rtx,
3716 enum machine_mode str_mode = GET_MODE (str_rtx);
3717 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
3722 if (mode1 != VOIDmode
3723 || bitsize >= BITS_PER_WORD
3724 || str_bitsize > BITS_PER_WORD
3725 || TREE_SIDE_EFFECTS (to)
3726 || TREE_THIS_VOLATILE (to))
3730 if (!BINARY_CLASS_P (src)
3731 || TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
3734 op0 = TREE_OPERAND (src, 0);
3735 op1 = TREE_OPERAND (src, 1);
3738 if (!operand_equal_p (to, op0, 0))
3741 if (MEM_P (str_rtx))
3743 unsigned HOST_WIDE_INT offset1;
3745 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
3746 str_mode = word_mode;
3747 str_mode = get_best_mode (bitsize, bitpos,
3748 MEM_ALIGN (str_rtx), str_mode, 0);
3749 if (str_mode == VOIDmode)
3751 str_bitsize = GET_MODE_BITSIZE (str_mode);
3754 bitpos %= str_bitsize;
3755 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
3756 str_rtx = adjust_address (str_rtx, str_mode, offset1);
3758 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
3761 /* If the bit field covers the whole REG/MEM, store_field
3762 will likely generate better code. */
3763 if (bitsize >= str_bitsize)
3766 /* We can't handle fields split across multiple entities. */
3767 if (bitpos + bitsize > str_bitsize)
3770 if (BYTES_BIG_ENDIAN)
3771 bitpos = str_bitsize - bitpos - bitsize;
3773 switch (TREE_CODE (src))
3777 /* For now, just optimize the case of the topmost bitfield
3778 where we don't need to do any masking and also
3779 1 bit bitfields where xor can be used.
3780 We might win by one instruction for the other bitfields
3781 too if insv/extv instructions aren't used, so that
3782 can be added later. */
3783 if (bitpos + bitsize != str_bitsize
3784 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
3787 value = expand_expr (op1, NULL_RTX, str_mode, 0);
3788 value = convert_modes (str_mode,
3789 TYPE_MODE (TREE_TYPE (op1)), value,
3790 TYPE_UNSIGNED (TREE_TYPE (op1)));
3792 /* We may be accessing data outside the field, which means
3793 we can alias adjacent data. */
3794 if (MEM_P (str_rtx))
3796 str_rtx = shallow_copy_rtx (str_rtx);
3797 set_mem_alias_set (str_rtx, 0);
3798 set_mem_expr (str_rtx, 0);
3801 binop = TREE_CODE (src) == PLUS_EXPR ? add_optab : sub_optab;
3802 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
3804 value = expand_and (str_mode, value, const1_rtx, NULL);
3807 value = expand_shift (LSHIFT_EXPR, str_mode, value,
3808 build_int_cst (NULL_TREE, bitpos),
3810 result = expand_binop (str_mode, binop, str_rtx,
3811 value, str_rtx, 1, OPTAB_WIDEN);
3812 if (result != str_rtx)
3813 emit_move_insn (str_rtx, result);
3818 if (TREE_CODE (op1) != INTEGER_CST)
3820 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), 0);
3821 value = convert_modes (GET_MODE (str_rtx),
3822 TYPE_MODE (TREE_TYPE (op1)), value,
3823 TYPE_UNSIGNED (TREE_TYPE (op1)));
3825 /* We may be accessing data outside the field, which means
3826 we can alias adjacent data. */
3827 if (MEM_P (str_rtx))
3829 str_rtx = shallow_copy_rtx (str_rtx);
3830 set_mem_alias_set (str_rtx, 0);
3831 set_mem_expr (str_rtx, 0);
3834 binop = TREE_CODE (src) == BIT_IOR_EXPR ? ior_optab : xor_optab;
3835 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
3837 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
3839 value = expand_and (GET_MODE (str_rtx), value, mask,
3842 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
3843 build_int_cst (NULL_TREE, bitpos),
3845 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
3846 value, str_rtx, 1, OPTAB_WIDEN);
3847 if (result != str_rtx)
3848 emit_move_insn (str_rtx, result);
3859 /* Expand an assignment that stores the value of FROM into TO. */
3862 expand_assignment (tree to, tree from)
3867 /* Don't crash if the lhs of the assignment was erroneous. */
3869 if (TREE_CODE (to) == ERROR_MARK)
3871 result = expand_expr (from, NULL_RTX, VOIDmode, 0);
3875 /* Assignment of a structure component needs special treatment
3876 if the structure component's rtx is not simply a MEM.
3877 Assignment of an array element at a constant index, and assignment of
3878 an array element in an unaligned packed structure field, has the same
3880 if (handled_component_p (to)
3881 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
3883 enum machine_mode mode1;
3884 HOST_WIDE_INT bitsize, bitpos;
3891 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
3892 &unsignedp, &volatilep, true);
3894 /* If we are going to use store_bit_field and extract_bit_field,
3895 make sure to_rtx will be safe for multiple use. */
3897 to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, 0);
3901 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
3903 gcc_assert (MEM_P (to_rtx));
3905 #ifdef POINTERS_EXTEND_UNSIGNED
3906 if (GET_MODE (offset_rtx) != Pmode)
3907 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
3909 if (GET_MODE (offset_rtx) != ptr_mode)
3910 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
3913 /* A constant address in TO_RTX can have VOIDmode, we must not try
3914 to call force_reg for that case. Avoid that case. */
3916 && GET_MODE (to_rtx) == BLKmode
3917 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
3919 && (bitpos % bitsize) == 0
3920 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
3921 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
3923 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
3927 to_rtx = offset_address (to_rtx, offset_rtx,
3928 highest_pow2_factor_for_target (to,
3932 /* Handle expand_expr of a complex value returning a CONCAT. */
3933 if (GET_CODE (to_rtx) == CONCAT)
3935 if (TREE_CODE (TREE_TYPE (from)) == COMPLEX_TYPE)
3937 gcc_assert (bitpos == 0);
3938 result = store_expr (from, to_rtx, false);
3942 gcc_assert (bitpos == 0 || bitpos == GET_MODE_BITSIZE (mode1));
3943 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false);
3950 /* If the field is at offset zero, we could have been given the
3951 DECL_RTX of the parent struct. Don't munge it. */
3952 to_rtx = shallow_copy_rtx (to_rtx);
3954 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
3956 /* Deal with volatile and readonly fields. The former is only
3957 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
3959 MEM_VOLATILE_P (to_rtx) = 1;
3960 if (component_uses_parent_alias_set (to))
3961 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
3964 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
3968 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
3969 TREE_TYPE (tem), get_alias_set (to));
3973 preserve_temp_slots (result);
3979 /* If the rhs is a function call and its value is not an aggregate,
3980 call the function before we start to compute the lhs.
3981 This is needed for correct code for cases such as
3982 val = setjmp (buf) on machines where reference to val
3983 requires loading up part of an address in a separate insn.
3985 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
3986 since it might be a promoted variable where the zero- or sign- extension
3987 needs to be done. Handling this in the normal way is safe because no
3988 computation is done before the call. */
3989 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
3990 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
3991 && ! ((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
3992 && REG_P (DECL_RTL (to))))
3997 value = expand_expr (from, NULL_RTX, VOIDmode, 0);
3999 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4001 /* Handle calls that return values in multiple non-contiguous locations.
4002 The Irix 6 ABI has examples of this. */
4003 if (GET_CODE (to_rtx) == PARALLEL)
4004 emit_group_load (to_rtx, value, TREE_TYPE (from),
4005 int_size_in_bytes (TREE_TYPE (from)));
4006 else if (GET_MODE (to_rtx) == BLKmode)
4007 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
4010 if (POINTER_TYPE_P (TREE_TYPE (to)))
4011 value = convert_memory_address (GET_MODE (to_rtx), value);
4012 emit_move_insn (to_rtx, value);
4014 preserve_temp_slots (to_rtx);
4020 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4021 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4024 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
4026 /* Don't move directly into a return register. */
4027 if (TREE_CODE (to) == RESULT_DECL
4028 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
4033 temp = expand_expr (from, 0, GET_MODE (to_rtx), 0);
4035 if (GET_CODE (to_rtx) == PARALLEL)
4036 emit_group_load (to_rtx, temp, TREE_TYPE (from),
4037 int_size_in_bytes (TREE_TYPE (from)));
4039 emit_move_insn (to_rtx, temp);
4041 preserve_temp_slots (to_rtx);
4047 /* In case we are returning the contents of an object which overlaps
4048 the place the value is being stored, use a safe function when copying
4049 a value through a pointer into a structure value return block. */
4050 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
4051 && current_function_returns_struct
4052 && !current_function_returns_pcc_struct)
4057 size = expr_size (from);
4058 from_rtx = expand_expr (from, NULL_RTX, VOIDmode, 0);
4060 emit_library_call (memmove_libfunc, LCT_NORMAL,
4061 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4062 XEXP (from_rtx, 0), Pmode,
4063 convert_to_mode (TYPE_MODE (sizetype),
4064 size, TYPE_UNSIGNED (sizetype)),
4065 TYPE_MODE (sizetype));
4067 preserve_temp_slots (to_rtx);
4073 /* Compute FROM and store the value in the rtx we got. */
4076 result = store_expr (from, to_rtx, 0);
4077 preserve_temp_slots (result);
4083 /* Generate code for computing expression EXP,
4084 and storing the value into TARGET.
4086 If the mode is BLKmode then we may return TARGET itself.
4087 It turns out that in BLKmode it doesn't cause a problem.
4088 because C has no operators that could combine two different
4089 assignments into the same BLKmode object with different values
4090 with no sequence point. Will other languages need this to
4093 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4094 stack, and block moves may need to be treated specially. */
4097 store_expr (tree exp, rtx target, int call_param_p)
4100 rtx alt_rtl = NULL_RTX;
4101 int dont_return_target = 0;
4103 if (VOID_TYPE_P (TREE_TYPE (exp)))
4105 /* C++ can generate ?: expressions with a throw expression in one
4106 branch and an rvalue in the other. Here, we resolve attempts to
4107 store the throw expression's nonexistent result. */
4108 gcc_assert (!call_param_p);
4109 expand_expr (exp, const0_rtx, VOIDmode, 0);
4112 if (TREE_CODE (exp) == COMPOUND_EXPR)
4114 /* Perform first part of compound expression, then assign from second
4116 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4117 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4118 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p);
4120 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4122 /* For conditional expression, get safe form of the target. Then
4123 test the condition, doing the appropriate assignment on either
4124 side. This avoids the creation of unnecessary temporaries.
4125 For non-BLKmode, it is more efficient not to do this. */
4127 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4129 do_pending_stack_adjust ();
4131 jumpifnot (TREE_OPERAND (exp, 0), lab1);
4132 store_expr (TREE_OPERAND (exp, 1), target, call_param_p);
4133 emit_jump_insn (gen_jump (lab2));
4136 store_expr (TREE_OPERAND (exp, 2), target, call_param_p);
4142 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4143 /* If this is a scalar in a register that is stored in a wider mode
4144 than the declared mode, compute the result into its declared mode
4145 and then convert to the wider mode. Our value is the computed
4148 rtx inner_target = 0;
4150 /* We can do the conversion inside EXP, which will often result
4151 in some optimizations. Do the conversion in two steps: first
4152 change the signedness, if needed, then the extend. But don't
4153 do this if the type of EXP is a subtype of something else
4154 since then the conversion might involve more than just
4155 converting modes. */
4156 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4157 && TREE_TYPE (TREE_TYPE (exp)) == 0
4158 && (!lang_hooks.reduce_bit_field_operations
4159 || (GET_MODE_PRECISION (GET_MODE (target))
4160 == TYPE_PRECISION (TREE_TYPE (exp)))))
4162 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4163 != SUBREG_PROMOTED_UNSIGNED_P (target))
4165 (lang_hooks.types.signed_or_unsigned_type
4166 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)), exp);
4168 exp = convert (lang_hooks.types.type_for_mode
4169 (GET_MODE (SUBREG_REG (target)),
4170 SUBREG_PROMOTED_UNSIGNED_P (target)),
4173 inner_target = SUBREG_REG (target);
4176 temp = expand_expr (exp, inner_target, VOIDmode,
4177 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4179 /* If TEMP is a VOIDmode constant, use convert_modes to make
4180 sure that we properly convert it. */
4181 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4183 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4184 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4185 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4186 GET_MODE (target), temp,
4187 SUBREG_PROMOTED_UNSIGNED_P (target));
4190 convert_move (SUBREG_REG (target), temp,
4191 SUBREG_PROMOTED_UNSIGNED_P (target));
4197 temp = expand_expr_real (exp, target, GET_MODE (target),
4199 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4201 /* Return TARGET if it's a specified hardware register.
4202 If TARGET is a volatile mem ref, either return TARGET
4203 or return a reg copied *from* TARGET; ANSI requires this.
4205 Otherwise, if TEMP is not TARGET, return TEMP
4206 if it is constant (for efficiency),
4207 or if we really want the correct value. */
4208 if (!(target && REG_P (target)
4209 && REGNO (target) < FIRST_PSEUDO_REGISTER)
4210 && !(MEM_P (target) && MEM_VOLATILE_P (target))
4211 && ! rtx_equal_p (temp, target)
4212 && CONSTANT_P (temp))
4213 dont_return_target = 1;
4216 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4217 the same as that of TARGET, adjust the constant. This is needed, for
4218 example, in case it is a CONST_DOUBLE and we want only a word-sized
4220 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4221 && TREE_CODE (exp) != ERROR_MARK
4222 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4223 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4224 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4226 /* If value was not generated in the target, store it there.
4227 Convert the value to TARGET's type first if necessary and emit the
4228 pending incrementations that have been queued when expanding EXP.
4229 Note that we cannot emit the whole queue blindly because this will
4230 effectively disable the POST_INC optimization later.
4232 If TEMP and TARGET compare equal according to rtx_equal_p, but
4233 one or both of them are volatile memory refs, we have to distinguish
4235 - expand_expr has used TARGET. In this case, we must not generate
4236 another copy. This can be detected by TARGET being equal according
4238 - expand_expr has not used TARGET - that means that the source just
4239 happens to have the same RTX form. Since temp will have been created
4240 by expand_expr, it will compare unequal according to == .
4241 We must generate a copy in this case, to reach the correct number
4242 of volatile memory references. */
4244 if ((! rtx_equal_p (temp, target)
4245 || (temp != target && (side_effects_p (temp)
4246 || side_effects_p (target))))
4247 && TREE_CODE (exp) != ERROR_MARK
4248 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4249 but TARGET is not valid memory reference, TEMP will differ
4250 from TARGET although it is really the same location. */
4251 && !(alt_rtl && rtx_equal_p (alt_rtl, target))
4252 /* If there's nothing to copy, don't bother. Don't call
4253 expr_size unless necessary, because some front-ends (C++)
4254 expr_size-hook must not be given objects that are not
4255 supposed to be bit-copied or bit-initialized. */
4256 && expr_size (exp) != const0_rtx)
4258 if (GET_MODE (temp) != GET_MODE (target)
4259 && GET_MODE (temp) != VOIDmode)
4261 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4262 if (dont_return_target)
4264 /* In this case, we will return TEMP,
4265 so make sure it has the proper mode.
4266 But don't forget to store the value into TARGET. */
4267 temp = convert_to_mode (GET_MODE (target), temp, unsignedp);
4268 emit_move_insn (target, temp);
4271 convert_move (target, temp, unsignedp);
4274 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4276 /* Handle copying a string constant into an array. The string
4277 constant may be shorter than the array. So copy just the string's
4278 actual length, and clear the rest. First get the size of the data
4279 type of the string, which is actually the size of the target. */
4280 rtx size = expr_size (exp);
4282 if (GET_CODE (size) == CONST_INT
4283 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4284 emit_block_move (target, temp, size,
4286 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4289 /* Compute the size of the data to copy from the string. */
4291 = size_binop (MIN_EXPR,
4292 make_tree (sizetype, size),
4293 size_int (TREE_STRING_LENGTH (exp)));
4295 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4297 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4300 /* Copy that much. */
4301 copy_size_rtx = convert_to_mode (ptr_mode, copy_size_rtx,
4302 TYPE_UNSIGNED (sizetype));
4303 emit_block_move (target, temp, copy_size_rtx,
4305 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4307 /* Figure out how much is left in TARGET that we have to clear.
4308 Do all calculations in ptr_mode. */
4309 if (GET_CODE (copy_size_rtx) == CONST_INT)
4311 size = plus_constant (size, -INTVAL (copy_size_rtx));
4312 target = adjust_address (target, BLKmode,
4313 INTVAL (copy_size_rtx));
4317 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4318 copy_size_rtx, NULL_RTX, 0,
4321 #ifdef POINTERS_EXTEND_UNSIGNED
4322 if (GET_MODE (copy_size_rtx) != Pmode)
4323 copy_size_rtx = convert_to_mode (Pmode, copy_size_rtx,
4324 TYPE_UNSIGNED (sizetype));
4327 target = offset_address (target, copy_size_rtx,
4328 highest_pow2_factor (copy_size));
4329 label = gen_label_rtx ();
4330 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4331 GET_MODE (size), 0, label);
4334 if (size != const0_rtx)
4335 clear_storage (target, size, BLOCK_OP_NORMAL);
4341 /* Handle calls that return values in multiple non-contiguous locations.
4342 The Irix 6 ABI has examples of this. */
4343 else if (GET_CODE (target) == PARALLEL)
4344 emit_group_load (target, temp, TREE_TYPE (exp),
4345 int_size_in_bytes (TREE_TYPE (exp)));
4346 else if (GET_MODE (temp) == BLKmode)
4347 emit_block_move (target, temp, expr_size (exp),
4349 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4352 temp = force_operand (temp, target);
4354 emit_move_insn (target, temp);
4361 /* Examine CTOR to discover:
4362 * how many scalar fields are set to nonzero values,
4363 and place it in *P_NZ_ELTS;
4364 * how many scalar fields are set to non-constant values,
4365 and place it in *P_NC_ELTS; and
4366 * how many scalar fields in total are in CTOR,
4367 and place it in *P_ELT_COUNT.
4368 * if a type is a union, and the initializer from the constructor
4369 is not the largest element in the union, then set *p_must_clear. */
4372 categorize_ctor_elements_1 (tree ctor, HOST_WIDE_INT *p_nz_elts,
4373 HOST_WIDE_INT *p_nc_elts,
4374 HOST_WIDE_INT *p_elt_count,
4377 HOST_WIDE_INT nz_elts, nc_elts, elt_count;
4384 for (list = CONSTRUCTOR_ELTS (ctor); list; list = TREE_CHAIN (list))
4386 tree value = TREE_VALUE (list);
4387 tree purpose = TREE_PURPOSE (list);
4391 if (TREE_CODE (purpose) == RANGE_EXPR)
4393 tree lo_index = TREE_OPERAND (purpose, 0);
4394 tree hi_index = TREE_OPERAND (purpose, 1);
4396 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
4397 mult = (tree_low_cst (hi_index, 1)
4398 - tree_low_cst (lo_index, 1) + 1);
4401 switch (TREE_CODE (value))
4405 HOST_WIDE_INT nz = 0, nc = 0, ic = 0;
4406 categorize_ctor_elements_1 (value, &nz, &nc, &ic, p_must_clear);
4407 nz_elts += mult * nz;
4408 nc_elts += mult * nc;
4409 elt_count += mult * ic;
4415 if (!initializer_zerop (value))
4421 nz_elts += mult * TREE_STRING_LENGTH (value);
4422 elt_count += mult * TREE_STRING_LENGTH (value);
4426 if (!initializer_zerop (TREE_REALPART (value)))
4428 if (!initializer_zerop (TREE_IMAGPART (value)))
4436 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
4438 if (!initializer_zerop (TREE_VALUE (v)))
4448 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
4455 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4456 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
4459 bool clear_this = true;
4461 list = CONSTRUCTOR_ELTS (ctor);
4464 /* We don't expect more than one element of the union to be
4465 initialized. Not sure what we should do otherwise... */
4466 gcc_assert (TREE_CHAIN (list) == NULL);
4468 init_sub_type = TREE_TYPE (TREE_VALUE (list));
4470 /* ??? We could look at each element of the union, and find the
4471 largest element. Which would avoid comparing the size of the
4472 initialized element against any tail padding in the union.
4473 Doesn't seem worth the effort... */
4474 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
4475 TYPE_SIZE (init_sub_type)) == 1)
4477 /* And now we have to find out if the element itself is fully
4478 constructed. E.g. for union { struct { int a, b; } s; } u
4479 = { .s = { .a = 1 } }. */
4480 if (elt_count == count_type_elements (init_sub_type))
4485 *p_must_clear = clear_this;
4488 *p_nz_elts += nz_elts;
4489 *p_nc_elts += nc_elts;
4490 *p_elt_count += elt_count;
4494 categorize_ctor_elements (tree ctor, HOST_WIDE_INT *p_nz_elts,
4495 HOST_WIDE_INT *p_nc_elts,
4496 HOST_WIDE_INT *p_elt_count,
4502 *p_must_clear = false;
4503 categorize_ctor_elements_1 (ctor, p_nz_elts, p_nc_elts, p_elt_count,
4507 /* Count the number of scalars in TYPE. Return -1 on overflow or
4511 count_type_elements (tree type)
4513 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
4514 switch (TREE_CODE (type))
4518 tree telts = array_type_nelts (type);
4519 if (telts && host_integerp (telts, 1))
4521 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
4522 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type));
4525 else if (max / n > m)
4533 HOST_WIDE_INT n = 0, t;
4536 for (f = TYPE_FIELDS (type); f ; f = TREE_CHAIN (f))
4537 if (TREE_CODE (f) == FIELD_DECL)
4539 t = count_type_elements (TREE_TYPE (f));
4549 case QUAL_UNION_TYPE:
4551 /* Ho hum. How in the world do we guess here? Clearly it isn't
4552 right to count the fields. Guess based on the number of words. */
4553 HOST_WIDE_INT n = int_size_in_bytes (type);
4556 return n / UNITS_PER_WORD;
4563 return TYPE_VECTOR_SUBPARTS (type);
4572 case REFERENCE_TYPE:
4584 /* Return 1 if EXP contains mostly (3/4) zeros. */
4587 mostly_zeros_p (tree exp)
4589 if (TREE_CODE (exp) == CONSTRUCTOR)
4592 HOST_WIDE_INT nz_elts, nc_elts, count, elts;
4595 categorize_ctor_elements (exp, &nz_elts, &nc_elts, &count, &must_clear);
4599 elts = count_type_elements (TREE_TYPE (exp));
4601 return nz_elts < elts / 4;
4604 return initializer_zerop (exp);
4607 /* Helper function for store_constructor.
4608 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4609 TYPE is the type of the CONSTRUCTOR, not the element type.
4610 CLEARED is as for store_constructor.
4611 ALIAS_SET is the alias set to use for any stores.
4613 This provides a recursive shortcut back to store_constructor when it isn't
4614 necessary to go through store_field. This is so that we can pass through
4615 the cleared field to let store_constructor know that we may not have to
4616 clear a substructure if the outer structure has already been cleared. */
4619 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
4620 HOST_WIDE_INT bitpos, enum machine_mode mode,
4621 tree exp, tree type, int cleared, int alias_set)
4623 if (TREE_CODE (exp) == CONSTRUCTOR
4624 /* We can only call store_constructor recursively if the size and
4625 bit position are on a byte boundary. */
4626 && bitpos % BITS_PER_UNIT == 0
4627 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
4628 /* If we have a nonzero bitpos for a register target, then we just
4629 let store_field do the bitfield handling. This is unlikely to
4630 generate unnecessary clear instructions anyways. */
4631 && (bitpos == 0 || MEM_P (target)))
4635 = adjust_address (target,
4636 GET_MODE (target) == BLKmode
4638 % GET_MODE_ALIGNMENT (GET_MODE (target)))
4639 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
4642 /* Update the alias set, if required. */
4643 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
4644 && MEM_ALIAS_SET (target) != 0)
4646 target = copy_rtx (target);
4647 set_mem_alias_set (target, alias_set);
4650 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
4653 store_field (target, bitsize, bitpos, mode, exp, type, alias_set);
4656 /* Store the value of constructor EXP into the rtx TARGET.
4657 TARGET is either a REG or a MEM; we know it cannot conflict, since
4658 safe_from_p has been called.
4659 CLEARED is true if TARGET is known to have been zero'd.
4660 SIZE is the number of bytes of TARGET we are allowed to modify: this
4661 may not be the same as the size of EXP if we are assigning to a field
4662 which has been packed to exclude padding bits. */
4665 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
4667 tree type = TREE_TYPE (exp);
4668 #ifdef WORD_REGISTER_OPERATIONS
4669 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
4672 switch (TREE_CODE (type))
4676 case QUAL_UNION_TYPE:
4680 /* If size is zero or the target is already cleared, do nothing. */
4681 if (size == 0 || cleared)
4683 /* We either clear the aggregate or indicate the value is dead. */
4684 else if ((TREE_CODE (type) == UNION_TYPE
4685 || TREE_CODE (type) == QUAL_UNION_TYPE)
4686 && ! CONSTRUCTOR_ELTS (exp))
4687 /* If the constructor is empty, clear the union. */
4689 clear_storage (target, expr_size (exp), BLOCK_OP_NORMAL);
4693 /* If we are building a static constructor into a register,
4694 set the initial value as zero so we can fold the value into
4695 a constant. But if more than one register is involved,
4696 this probably loses. */
4697 else if (REG_P (target) && TREE_STATIC (exp)
4698 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
4700 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4704 /* If the constructor has fewer fields than the structure or
4705 if we are initializing the structure to mostly zeros, clear
4706 the whole structure first. Don't do this if TARGET is a
4707 register whose mode size isn't equal to SIZE since
4708 clear_storage can't handle this case. */
4710 && ((list_length (CONSTRUCTOR_ELTS (exp))
4711 != fields_length (type))
4712 || mostly_zeros_p (exp))
4714 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
4717 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
4722 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4724 /* Store each element of the constructor into the
4725 corresponding field of TARGET. */
4727 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4729 tree field = TREE_PURPOSE (elt);
4730 tree value = TREE_VALUE (elt);
4731 enum machine_mode mode;
4732 HOST_WIDE_INT bitsize;
4733 HOST_WIDE_INT bitpos = 0;
4735 rtx to_rtx = target;
4737 /* Just ignore missing fields. We cleared the whole
4738 structure, above, if any fields are missing. */
4742 if (cleared && initializer_zerop (value))
4745 if (host_integerp (DECL_SIZE (field), 1))
4746 bitsize = tree_low_cst (DECL_SIZE (field), 1);
4750 mode = DECL_MODE (field);
4751 if (DECL_BIT_FIELD (field))
4754 offset = DECL_FIELD_OFFSET (field);
4755 if (host_integerp (offset, 0)
4756 && host_integerp (bit_position (field), 0))
4758 bitpos = int_bit_position (field);
4762 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
4769 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
4770 make_tree (TREE_TYPE (exp),
4773 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
4774 gcc_assert (MEM_P (to_rtx));
4776 #ifdef POINTERS_EXTEND_UNSIGNED
4777 if (GET_MODE (offset_rtx) != Pmode)
4778 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
4780 if (GET_MODE (offset_rtx) != ptr_mode)
4781 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
4784 to_rtx = offset_address (to_rtx, offset_rtx,
4785 highest_pow2_factor (offset));
4788 #ifdef WORD_REGISTER_OPERATIONS
4789 /* If this initializes a field that is smaller than a
4790 word, at the start of a word, try to widen it to a full
4791 word. This special case allows us to output C++ member
4792 function initializations in a form that the optimizers
4795 && bitsize < BITS_PER_WORD
4796 && bitpos % BITS_PER_WORD == 0
4797 && GET_MODE_CLASS (mode) == MODE_INT
4798 && TREE_CODE (value) == INTEGER_CST
4800 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
4802 tree type = TREE_TYPE (value);
4804 if (TYPE_PRECISION (type) < BITS_PER_WORD)
4806 type = lang_hooks.types.type_for_size
4807 (BITS_PER_WORD, TYPE_UNSIGNED (type));
4808 value = convert (type, value);
4811 if (BYTES_BIG_ENDIAN)
4813 = fold_build2 (LSHIFT_EXPR, type, value,
4814 build_int_cst (NULL_TREE,
4815 BITS_PER_WORD - bitsize));
4816 bitsize = BITS_PER_WORD;
4821 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
4822 && DECL_NONADDRESSABLE_P (field))
4824 to_rtx = copy_rtx (to_rtx);
4825 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4828 store_constructor_field (to_rtx, bitsize, bitpos, mode,
4829 value, type, cleared,
4830 get_alias_set (TREE_TYPE (field)));
4840 tree elttype = TREE_TYPE (type);
4842 HOST_WIDE_INT minelt = 0;
4843 HOST_WIDE_INT maxelt = 0;
4845 domain = TYPE_DOMAIN (type);
4846 const_bounds_p = (TYPE_MIN_VALUE (domain)
4847 && TYPE_MAX_VALUE (domain)
4848 && host_integerp (TYPE_MIN_VALUE (domain), 0)
4849 && host_integerp (TYPE_MAX_VALUE (domain), 0));
4851 /* If we have constant bounds for the range of the type, get them. */
4854 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
4855 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
4858 /* If the constructor has fewer elements than the array, clear
4859 the whole array first. Similarly if this is static
4860 constructor of a non-BLKmode object. */
4863 else if (REG_P (target) && TREE_STATIC (exp))
4867 HOST_WIDE_INT count = 0, zero_count = 0;
4868 need_to_clear = ! const_bounds_p;
4870 /* This loop is a more accurate version of the loop in
4871 mostly_zeros_p (it handles RANGE_EXPR in an index). It
4872 is also needed to check for missing elements. */
4873 for (elt = CONSTRUCTOR_ELTS (exp);
4874 elt != NULL_TREE && ! need_to_clear;
4875 elt = TREE_CHAIN (elt))
4877 tree index = TREE_PURPOSE (elt);
4878 HOST_WIDE_INT this_node_count;
4880 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4882 tree lo_index = TREE_OPERAND (index, 0);
4883 tree hi_index = TREE_OPERAND (index, 1);
4885 if (! host_integerp (lo_index, 1)
4886 || ! host_integerp (hi_index, 1))
4892 this_node_count = (tree_low_cst (hi_index, 1)
4893 - tree_low_cst (lo_index, 1) + 1);
4896 this_node_count = 1;
4898 count += this_node_count;
4899 if (mostly_zeros_p (TREE_VALUE (elt)))
4900 zero_count += this_node_count;
4903 /* Clear the entire array first if there are any missing
4904 elements, or if the incidence of zero elements is >=
4907 && (count < maxelt - minelt + 1
4908 || 4 * zero_count >= 3 * count))
4912 if (need_to_clear && size > 0)
4915 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4917 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
4921 if (!cleared && REG_P (target))
4922 /* Inform later passes that the old value is dead. */
4923 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4925 /* Store each element of the constructor into the
4926 corresponding element of TARGET, determined by counting the
4928 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
4930 elt = TREE_CHAIN (elt), i++)
4932 enum machine_mode mode;
4933 HOST_WIDE_INT bitsize;
4934 HOST_WIDE_INT bitpos;
4936 tree value = TREE_VALUE (elt);
4937 tree index = TREE_PURPOSE (elt);
4938 rtx xtarget = target;
4940 if (cleared && initializer_zerop (value))
4943 unsignedp = TYPE_UNSIGNED (elttype);
4944 mode = TYPE_MODE (elttype);
4945 if (mode == BLKmode)
4946 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
4947 ? tree_low_cst (TYPE_SIZE (elttype), 1)
4950 bitsize = GET_MODE_BITSIZE (mode);
4952 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4954 tree lo_index = TREE_OPERAND (index, 0);
4955 tree hi_index = TREE_OPERAND (index, 1);
4956 rtx index_r, pos_rtx;
4957 HOST_WIDE_INT lo, hi, count;
4960 /* If the range is constant and "small", unroll the loop. */
4962 && host_integerp (lo_index, 0)
4963 && host_integerp (hi_index, 0)
4964 && (lo = tree_low_cst (lo_index, 0),
4965 hi = tree_low_cst (hi_index, 0),
4966 count = hi - lo + 1,
4969 || (host_integerp (TYPE_SIZE (elttype), 1)
4970 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
4973 lo -= minelt; hi -= minelt;
4974 for (; lo <= hi; lo++)
4976 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
4979 && !MEM_KEEP_ALIAS_SET_P (target)
4980 && TREE_CODE (type) == ARRAY_TYPE
4981 && TYPE_NONALIASED_COMPONENT (type))
4983 target = copy_rtx (target);
4984 MEM_KEEP_ALIAS_SET_P (target) = 1;
4987 store_constructor_field
4988 (target, bitsize, bitpos, mode, value, type, cleared,
4989 get_alias_set (elttype));
4994 rtx loop_start = gen_label_rtx ();
4995 rtx loop_end = gen_label_rtx ();
4998 expand_expr (hi_index, NULL_RTX, VOIDmode, 0);
4999 unsignedp = TYPE_UNSIGNED (domain);
5001 index = build_decl (VAR_DECL, NULL_TREE, domain);
5004 = gen_reg_rtx (promote_mode (domain, DECL_MODE (index),
5006 SET_DECL_RTL (index, index_r);
5007 store_expr (lo_index, index_r, 0);
5009 /* Build the head of the loop. */
5010 do_pending_stack_adjust ();
5011 emit_label (loop_start);
5013 /* Assign value to element index. */
5015 = convert (ssizetype,
5016 fold_build2 (MINUS_EXPR, TREE_TYPE (index),
5017 index, TYPE_MIN_VALUE (domain)));
5018 position = size_binop (MULT_EXPR, position,
5020 TYPE_SIZE_UNIT (elttype)));
5022 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
5023 xtarget = offset_address (target, pos_rtx,
5024 highest_pow2_factor (position));
5025 xtarget = adjust_address (xtarget, mode, 0);
5026 if (TREE_CODE (value) == CONSTRUCTOR)
5027 store_constructor (value, xtarget, cleared,
5028 bitsize / BITS_PER_UNIT);
5030 store_expr (value, xtarget, 0);
5032 /* Generate a conditional jump to exit the loop. */
5033 exit_cond = build2 (LT_EXPR, integer_type_node,
5035 jumpif (exit_cond, loop_end);
5037 /* Update the loop counter, and jump to the head of
5039 expand_assignment (index,
5040 build2 (PLUS_EXPR, TREE_TYPE (index),
5041 index, integer_one_node));
5043 emit_jump (loop_start);
5045 /* Build the end of the loop. */
5046 emit_label (loop_end);
5049 else if ((index != 0 && ! host_integerp (index, 0))
5050 || ! host_integerp (TYPE_SIZE (elttype), 1))
5055 index = ssize_int (1);
5058 index = fold_convert (ssizetype,
5059 fold_build2 (MINUS_EXPR,
5062 TYPE_MIN_VALUE (domain)));
5064 position = size_binop (MULT_EXPR, index,
5066 TYPE_SIZE_UNIT (elttype)));
5067 xtarget = offset_address (target,
5068 expand_expr (position, 0, VOIDmode, 0),
5069 highest_pow2_factor (position));
5070 xtarget = adjust_address (xtarget, mode, 0);
5071 store_expr (value, xtarget, 0);
5076 bitpos = ((tree_low_cst (index, 0) - minelt)
5077 * tree_low_cst (TYPE_SIZE (elttype), 1));
5079 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5081 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5082 && TREE_CODE (type) == ARRAY_TYPE
5083 && TYPE_NONALIASED_COMPONENT (type))
5085 target = copy_rtx (target);
5086 MEM_KEEP_ALIAS_SET_P (target) = 1;
5088 store_constructor_field (target, bitsize, bitpos, mode, value,
5089 type, cleared, get_alias_set (elttype));
5101 tree elttype = TREE_TYPE (type);
5102 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5103 enum machine_mode eltmode = TYPE_MODE (elttype);
5104 HOST_WIDE_INT bitsize;
5105 HOST_WIDE_INT bitpos;
5106 rtvec vector = NULL;
5109 gcc_assert (eltmode != BLKmode);
5111 n_elts = TYPE_VECTOR_SUBPARTS (type);
5112 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5114 enum machine_mode mode = GET_MODE (target);
5116 icode = (int) vec_init_optab->handlers[mode].insn_code;
5117 if (icode != CODE_FOR_nothing)
5121 vector = rtvec_alloc (n_elts);
5122 for (i = 0; i < n_elts; i++)
5123 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5127 /* If the constructor has fewer elements than the vector,
5128 clear the whole array first. Similarly if this is static
5129 constructor of a non-BLKmode object. */
5132 else if (REG_P (target) && TREE_STATIC (exp))
5136 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5138 for (elt = CONSTRUCTOR_ELTS (exp);
5140 elt = TREE_CHAIN (elt))
5142 int n_elts_here = tree_low_cst
5143 (int_const_binop (TRUNC_DIV_EXPR,
5144 TYPE_SIZE (TREE_TYPE (TREE_VALUE (elt))),
5145 TYPE_SIZE (elttype), 0), 1);
5147 count += n_elts_here;
5148 if (mostly_zeros_p (TREE_VALUE (elt)))
5149 zero_count += n_elts_here;
5152 /* Clear the entire vector first if there are any missing elements,
5153 or if the incidence of zero elements is >= 75%. */
5154 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5157 if (need_to_clear && size > 0 && !vector)
5160 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5162 clear_storage (target, GEN_INT (size), BLOCK_OP_NORMAL);
5166 /* Inform later passes that the old value is dead. */
5167 if (!cleared && REG_P (target))
5168 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5170 /* Store each element of the constructor into the corresponding
5171 element of TARGET, determined by counting the elements. */
5172 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
5174 elt = TREE_CHAIN (elt), i += bitsize / elt_size)
5176 tree value = TREE_VALUE (elt);
5177 tree index = TREE_PURPOSE (elt);
5178 HOST_WIDE_INT eltpos;
5180 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5181 if (cleared && initializer_zerop (value))
5185 eltpos = tree_low_cst (index, 1);
5191 /* Vector CONSTRUCTORs should only be built from smaller
5192 vectors in the case of BLKmode vectors. */
5193 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5194 RTVEC_ELT (vector, eltpos)
5195 = expand_expr (value, NULL_RTX, VOIDmode, 0);
5199 enum machine_mode value_mode =
5200 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5201 ? TYPE_MODE (TREE_TYPE (value))
5203 bitpos = eltpos * elt_size;
5204 store_constructor_field (target, bitsize, bitpos,
5205 value_mode, value, type,
5206 cleared, get_alias_set (elttype));
5211 emit_insn (GEN_FCN (icode)
5213 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5222 /* Store the value of EXP (an expression tree)
5223 into a subfield of TARGET which has mode MODE and occupies
5224 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5225 If MODE is VOIDmode, it means that we are storing into a bit-field.
5227 Always return const0_rtx unless we have something particular to
5230 TYPE is the type of the underlying object,
5232 ALIAS_SET is the alias set for the destination. This value will
5233 (in general) be different from that for TARGET, since TARGET is a
5234 reference to the containing structure. */
5237 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5238 enum machine_mode mode, tree exp, tree type, int alias_set)
5240 HOST_WIDE_INT width_mask = 0;
5242 if (TREE_CODE (exp) == ERROR_MARK)
5245 /* If we have nothing to store, do nothing unless the expression has
5248 return expand_expr (exp, const0_rtx, VOIDmode, 0);
5249 else if (bitsize >= 0 && bitsize < HOST_BITS_PER_WIDE_INT)
5250 width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
5252 /* If we are storing into an unaligned field of an aligned union that is
5253 in a register, we may have the mode of TARGET being an integer mode but
5254 MODE == BLKmode. In that case, get an aligned object whose size and
5255 alignment are the same as TARGET and store TARGET into it (we can avoid
5256 the store if the field being stored is the entire width of TARGET). Then
5257 call ourselves recursively to store the field into a BLKmode version of
5258 that object. Finally, load from the object into TARGET. This is not
5259 very efficient in general, but should only be slightly more expensive
5260 than the otherwise-required unaligned accesses. Perhaps this can be
5261 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5262 twice, once with emit_move_insn and once via store_field. */
5265 && (REG_P (target) || GET_CODE (target) == SUBREG))
5267 rtx object = assign_temp (type, 0, 1, 1);
5268 rtx blk_object = adjust_address (object, BLKmode, 0);
5270 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5271 emit_move_insn (object, target);
5273 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set);
5275 emit_move_insn (target, object);
5277 /* We want to return the BLKmode version of the data. */
5281 if (GET_CODE (target) == CONCAT)
5283 /* We're storing into a struct containing a single __complex. */
5285 gcc_assert (!bitpos);
5286 return store_expr (exp, target, 0);
5289 /* If the structure is in a register or if the component
5290 is a bit field, we cannot use addressing to access it.
5291 Use bit-field techniques or SUBREG to store in it. */
5293 if (mode == VOIDmode
5294 || (mode != BLKmode && ! direct_store[(int) mode]
5295 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5296 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5298 || GET_CODE (target) == SUBREG
5299 /* If the field isn't aligned enough to store as an ordinary memref,
5300 store it as a bit field. */
5302 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5303 || bitpos % GET_MODE_ALIGNMENT (mode))
5304 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5305 || (bitpos % BITS_PER_UNIT != 0)))
5306 /* If the RHS and field are a constant size and the size of the
5307 RHS isn't the same size as the bitfield, we must use bitfield
5310 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5311 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5315 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5316 implies a mask operation. If the precision is the same size as
5317 the field we're storing into, that mask is redundant. This is
5318 particularly common with bit field assignments generated by the
5320 if (TREE_CODE (exp) == NOP_EXPR)
5322 tree type = TREE_TYPE (exp);
5323 if (INTEGRAL_TYPE_P (type)
5324 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
5325 && bitsize == TYPE_PRECISION (type))
5327 type = TREE_TYPE (TREE_OPERAND (exp, 0));
5328 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
5329 exp = TREE_OPERAND (exp, 0);
5333 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
5335 /* If BITSIZE is narrower than the size of the type of EXP
5336 we will be narrowing TEMP. Normally, what's wanted are the
5337 low-order bits. However, if EXP's type is a record and this is
5338 big-endian machine, we want the upper BITSIZE bits. */
5339 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5340 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5341 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5342 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5343 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5347 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5349 if (mode != VOIDmode && mode != BLKmode
5350 && mode != TYPE_MODE (TREE_TYPE (exp)))
5351 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5353 /* If the modes of TARGET and TEMP are both BLKmode, both
5354 must be in memory and BITPOS must be aligned on a byte
5355 boundary. If so, we simply do a block copy. */
5356 if (GET_MODE (target) == BLKmode && GET_MODE (temp) == BLKmode)
5358 gcc_assert (MEM_P (target) && MEM_P (temp)
5359 && !(bitpos % BITS_PER_UNIT));
5361 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5362 emit_block_move (target, temp,
5363 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5370 /* Store the value in the bitfield. */
5371 store_bit_field (target, bitsize, bitpos, mode, temp);
5377 /* Now build a reference to just the desired component. */
5378 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5380 if (to_rtx == target)
5381 to_rtx = copy_rtx (to_rtx);
5383 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5384 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5385 set_mem_alias_set (to_rtx, alias_set);
5387 return store_expr (exp, to_rtx, 0);
5391 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5392 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5393 codes and find the ultimate containing object, which we return.
5395 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5396 bit position, and *PUNSIGNEDP to the signedness of the field.
5397 If the position of the field is variable, we store a tree
5398 giving the variable offset (in units) in *POFFSET.
5399 This offset is in addition to the bit position.
5400 If the position is not variable, we store 0 in *POFFSET.
5402 If any of the extraction expressions is volatile,
5403 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5405 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5406 is a mode that can be used to access the field. In that case, *PBITSIZE
5409 If the field describes a variable-sized object, *PMODE is set to
5410 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5411 this case, but the address of the object can be found.
5413 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5414 look through nodes that serve as markers of a greater alignment than
5415 the one that can be deduced from the expression. These nodes make it
5416 possible for front-ends to prevent temporaries from being created by
5417 the middle-end on alignment considerations. For that purpose, the
5418 normal operating mode at high-level is to always pass FALSE so that
5419 the ultimate containing object is really returned; moreover, the
5420 associated predicate handled_component_p will always return TRUE
5421 on these nodes, thus indicating that they are essentially handled
5422 by get_inner_reference. TRUE should only be passed when the caller
5423 is scanning the expression in order to build another representation
5424 and specifically knows how to handle these nodes; as such, this is
5425 the normal operating mode in the RTL expanders. */
5428 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
5429 HOST_WIDE_INT *pbitpos, tree *poffset,
5430 enum machine_mode *pmode, int *punsignedp,
5431 int *pvolatilep, bool keep_aligning)
5434 enum machine_mode mode = VOIDmode;
5435 tree offset = size_zero_node;
5436 tree bit_offset = bitsize_zero_node;
5439 /* First get the mode, signedness, and size. We do this from just the
5440 outermost expression. */
5441 if (TREE_CODE (exp) == COMPONENT_REF)
5443 size_tree = DECL_SIZE (TREE_OPERAND (exp, 1));
5444 if (! DECL_BIT_FIELD (TREE_OPERAND (exp, 1)))
5445 mode = DECL_MODE (TREE_OPERAND (exp, 1));
5447 *punsignedp = DECL_UNSIGNED (TREE_OPERAND (exp, 1));
5449 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5451 size_tree = TREE_OPERAND (exp, 1);
5452 *punsignedp = BIT_FIELD_REF_UNSIGNED (exp);
5456 mode = TYPE_MODE (TREE_TYPE (exp));
5457 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
5459 if (mode == BLKmode)
5460 size_tree = TYPE_SIZE (TREE_TYPE (exp));
5462 *pbitsize = GET_MODE_BITSIZE (mode);
5467 if (! host_integerp (size_tree, 1))
5468 mode = BLKmode, *pbitsize = -1;
5470 *pbitsize = tree_low_cst (size_tree, 1);
5473 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5474 and find the ultimate containing object. */
5477 switch (TREE_CODE (exp))
5480 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5481 TREE_OPERAND (exp, 2));
5486 tree field = TREE_OPERAND (exp, 1);
5487 tree this_offset = component_ref_field_offset (exp);
5489 /* If this field hasn't been filled in yet, don't go past it.
5490 This should only happen when folding expressions made during
5491 type construction. */
5492 if (this_offset == 0)
5495 offset = size_binop (PLUS_EXPR, offset, this_offset);
5496 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5497 DECL_FIELD_BIT_OFFSET (field));
5499 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
5504 case ARRAY_RANGE_REF:
5506 tree index = TREE_OPERAND (exp, 1);
5507 tree low_bound = array_ref_low_bound (exp);
5508 tree unit_size = array_ref_element_size (exp);
5510 /* We assume all arrays have sizes that are a multiple of a byte.
5511 First subtract the lower bound, if any, in the type of the
5512 index, then convert to sizetype and multiply by the size of
5513 the array element. */
5514 if (! integer_zerop (low_bound))
5515 index = fold_build2 (MINUS_EXPR, TREE_TYPE (index),
5518 offset = size_binop (PLUS_EXPR, offset,
5519 size_binop (MULT_EXPR,
5520 convert (sizetype, index),
5529 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5530 bitsize_int (*pbitsize));
5533 case VIEW_CONVERT_EXPR:
5534 if (keep_aligning && STRICT_ALIGNMENT
5535 && (TYPE_ALIGN (TREE_TYPE (exp))
5536 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
5537 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
5538 < BIGGEST_ALIGNMENT)
5539 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
5540 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
5548 /* If any reference in the chain is volatile, the effect is volatile. */
5549 if (TREE_THIS_VOLATILE (exp))
5552 exp = TREE_OPERAND (exp, 0);
5556 /* If OFFSET is constant, see if we can return the whole thing as a
5557 constant bit position. Otherwise, split it up. */
5558 if (host_integerp (offset, 0)
5559 && 0 != (tem = size_binop (MULT_EXPR, convert (bitsizetype, offset),
5561 && 0 != (tem = size_binop (PLUS_EXPR, tem, bit_offset))
5562 && host_integerp (tem, 0))
5563 *pbitpos = tree_low_cst (tem, 0), *poffset = 0;
5565 *pbitpos = tree_low_cst (bit_offset, 0), *poffset = offset;
5571 /* Return a tree of sizetype representing the size, in bytes, of the element
5572 of EXP, an ARRAY_REF. */
5575 array_ref_element_size (tree exp)
5577 tree aligned_size = TREE_OPERAND (exp, 3);
5578 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5580 /* If a size was specified in the ARRAY_REF, it's the size measured
5581 in alignment units of the element type. So multiply by that value. */
5584 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
5585 sizetype from another type of the same width and signedness. */
5586 if (TREE_TYPE (aligned_size) != sizetype)
5587 aligned_size = fold_convert (sizetype, aligned_size);
5588 return size_binop (MULT_EXPR, aligned_size,
5589 size_int (TYPE_ALIGN_UNIT (elmt_type)));
5592 /* Otherwise, take the size from that of the element type. Substitute
5593 any PLACEHOLDER_EXPR that we have. */
5595 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
5598 /* Return a tree representing the lower bound of the array mentioned in
5599 EXP, an ARRAY_REF. */
5602 array_ref_low_bound (tree exp)
5604 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
5606 /* If a lower bound is specified in EXP, use it. */
5607 if (TREE_OPERAND (exp, 2))
5608 return TREE_OPERAND (exp, 2);
5610 /* Otherwise, if there is a domain type and it has a lower bound, use it,
5611 substituting for a PLACEHOLDER_EXPR as needed. */
5612 if (domain_type && TYPE_MIN_VALUE (domain_type))
5613 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
5615 /* Otherwise, return a zero of the appropriate type. */
5616 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
5619 /* Return a tree representing the upper bound of the array mentioned in
5620 EXP, an ARRAY_REF. */
5623 array_ref_up_bound (tree exp)
5625 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
5627 /* If there is a domain type and it has an upper bound, use it, substituting
5628 for a PLACEHOLDER_EXPR as needed. */
5629 if (domain_type && TYPE_MAX_VALUE (domain_type))
5630 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
5632 /* Otherwise fail. */
5636 /* Return a tree representing the offset, in bytes, of the field referenced
5637 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5640 component_ref_field_offset (tree exp)
5642 tree aligned_offset = TREE_OPERAND (exp, 2);
5643 tree field = TREE_OPERAND (exp, 1);
5645 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
5646 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
5650 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
5651 sizetype from another type of the same width and signedness. */
5652 if (TREE_TYPE (aligned_offset) != sizetype)
5653 aligned_offset = fold_convert (sizetype, aligned_offset);
5654 return size_binop (MULT_EXPR, aligned_offset,
5655 size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT));
5658 /* Otherwise, take the offset from that of the field. Substitute
5659 any PLACEHOLDER_EXPR that we have. */
5661 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
5664 /* Return 1 if T is an expression that get_inner_reference handles. */
5667 handled_component_p (tree t)
5669 switch (TREE_CODE (t))
5674 case ARRAY_RANGE_REF:
5675 case VIEW_CONVERT_EXPR:
5685 /* Given an rtx VALUE that may contain additions and multiplications, return
5686 an equivalent value that just refers to a register, memory, or constant.
5687 This is done by generating instructions to perform the arithmetic and
5688 returning a pseudo-register containing the value.
5690 The returned value may be a REG, SUBREG, MEM or constant. */
5693 force_operand (rtx value, rtx target)
5696 /* Use subtarget as the target for operand 0 of a binary operation. */
5697 rtx subtarget = get_subtarget (target);
5698 enum rtx_code code = GET_CODE (value);
5700 /* Check for subreg applied to an expression produced by loop optimizer. */
5702 && !REG_P (SUBREG_REG (value))
5703 && !MEM_P (SUBREG_REG (value)))
5705 value = simplify_gen_subreg (GET_MODE (value),
5706 force_reg (GET_MODE (SUBREG_REG (value)),
5707 force_operand (SUBREG_REG (value),
5709 GET_MODE (SUBREG_REG (value)),
5710 SUBREG_BYTE (value));
5711 code = GET_CODE (value);
5714 /* Check for a PIC address load. */
5715 if ((code == PLUS || code == MINUS)
5716 && XEXP (value, 0) == pic_offset_table_rtx
5717 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
5718 || GET_CODE (XEXP (value, 1)) == LABEL_REF
5719 || GET_CODE (XEXP (value, 1)) == CONST))
5722 subtarget = gen_reg_rtx (GET_MODE (value));
5723 emit_move_insn (subtarget, value);
5727 if (code == ZERO_EXTEND || code == SIGN_EXTEND)
5730 target = gen_reg_rtx (GET_MODE (value));
5731 convert_move (target, force_operand (XEXP (value, 0), NULL),
5732 code == ZERO_EXTEND);
5736 if (ARITHMETIC_P (value))
5738 op2 = XEXP (value, 1);
5739 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
5741 if (code == MINUS && GET_CODE (op2) == CONST_INT)
5744 op2 = negate_rtx (GET_MODE (value), op2);
5747 /* Check for an addition with OP2 a constant integer and our first
5748 operand a PLUS of a virtual register and something else. In that
5749 case, we want to emit the sum of the virtual register and the
5750 constant first and then add the other value. This allows virtual
5751 register instantiation to simply modify the constant rather than
5752 creating another one around this addition. */
5753 if (code == PLUS && GET_CODE (op2) == CONST_INT
5754 && GET_CODE (XEXP (value, 0)) == PLUS
5755 && REG_P (XEXP (XEXP (value, 0), 0))
5756 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5757 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
5759 rtx temp = expand_simple_binop (GET_MODE (value), code,
5760 XEXP (XEXP (value, 0), 0), op2,
5761 subtarget, 0, OPTAB_LIB_WIDEN);
5762 return expand_simple_binop (GET_MODE (value), code, temp,
5763 force_operand (XEXP (XEXP (value,
5765 target, 0, OPTAB_LIB_WIDEN);
5768 op1 = force_operand (XEXP (value, 0), subtarget);
5769 op2 = force_operand (op2, NULL_RTX);
5773 return expand_mult (GET_MODE (value), op1, op2, target, 1);
5775 if (!INTEGRAL_MODE_P (GET_MODE (value)))
5776 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5777 target, 1, OPTAB_LIB_WIDEN);
5779 return expand_divmod (0,
5780 FLOAT_MODE_P (GET_MODE (value))
5781 ? RDIV_EXPR : TRUNC_DIV_EXPR,
5782 GET_MODE (value), op1, op2, target, 0);
5785 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
5789 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
5793 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
5797 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5798 target, 0, OPTAB_LIB_WIDEN);
5801 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5802 target, 1, OPTAB_LIB_WIDEN);
5805 if (UNARY_P (value))
5807 op1 = force_operand (XEXP (value, 0), NULL_RTX);
5808 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
5811 #ifdef INSN_SCHEDULING
5812 /* On machines that have insn scheduling, we want all memory reference to be
5813 explicit, so we need to deal with such paradoxical SUBREGs. */
5814 if (GET_CODE (value) == SUBREG && MEM_P (SUBREG_REG (value))
5815 && (GET_MODE_SIZE (GET_MODE (value))
5816 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
5818 = simplify_gen_subreg (GET_MODE (value),
5819 force_reg (GET_MODE (SUBREG_REG (value)),
5820 force_operand (SUBREG_REG (value),
5822 GET_MODE (SUBREG_REG (value)),
5823 SUBREG_BYTE (value));
5829 /* Subroutine of expand_expr: return nonzero iff there is no way that
5830 EXP can reference X, which is being modified. TOP_P is nonzero if this
5831 call is going to be used to determine whether we need a temporary
5832 for EXP, as opposed to a recursive call to this function.
5834 It is always safe for this routine to return zero since it merely
5835 searches for optimization opportunities. */
5838 safe_from_p (rtx x, tree exp, int top_p)
5844 /* If EXP has varying size, we MUST use a target since we currently
5845 have no way of allocating temporaries of variable size
5846 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
5847 So we assume here that something at a higher level has prevented a
5848 clash. This is somewhat bogus, but the best we can do. Only
5849 do this when X is BLKmode and when we are at the top level. */
5850 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
5851 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
5852 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
5853 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
5854 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
5856 && GET_MODE (x) == BLKmode)
5857 /* If X is in the outgoing argument area, it is always safe. */
5859 && (XEXP (x, 0) == virtual_outgoing_args_rtx
5860 || (GET_CODE (XEXP (x, 0)) == PLUS
5861 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
5864 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
5865 find the underlying pseudo. */
5866 if (GET_CODE (x) == SUBREG)
5869 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
5873 /* Now look at our tree code and possibly recurse. */
5874 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
5876 case tcc_declaration:
5877 exp_rtl = DECL_RTL_IF_SET (exp);
5883 case tcc_exceptional:
5884 if (TREE_CODE (exp) == TREE_LIST)
5888 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
5890 exp = TREE_CHAIN (exp);
5893 if (TREE_CODE (exp) != TREE_LIST)
5894 return safe_from_p (x, exp, 0);
5897 else if (TREE_CODE (exp) == ERROR_MARK)
5898 return 1; /* An already-visited SAVE_EXPR? */
5903 /* The only case we look at here is the DECL_INITIAL inside a
5905 return (TREE_CODE (exp) != DECL_EXPR
5906 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
5907 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
5908 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
5911 case tcc_comparison:
5912 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
5917 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5919 case tcc_expression:
5921 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
5922 the expression. If it is set, we conflict iff we are that rtx or
5923 both are in memory. Otherwise, we check all operands of the
5924 expression recursively. */
5926 switch (TREE_CODE (exp))
5929 /* If the operand is static or we are static, we can't conflict.
5930 Likewise if we don't conflict with the operand at all. */
5931 if (staticp (TREE_OPERAND (exp, 0))
5932 || TREE_STATIC (exp)
5933 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
5936 /* Otherwise, the only way this can conflict is if we are taking
5937 the address of a DECL a that address if part of X, which is
5939 exp = TREE_OPERAND (exp, 0);
5942 if (!DECL_RTL_SET_P (exp)
5943 || !MEM_P (DECL_RTL (exp)))
5946 exp_rtl = XEXP (DECL_RTL (exp), 0);
5950 case MISALIGNED_INDIRECT_REF:
5951 case ALIGN_INDIRECT_REF:
5954 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
5955 get_alias_set (exp)))
5960 /* Assume that the call will clobber all hard registers and
5962 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
5967 case WITH_CLEANUP_EXPR:
5968 case CLEANUP_POINT_EXPR:
5969 /* Lowered by gimplify.c. */
5973 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5979 /* If we have an rtx, we do not need to scan our operands. */
5983 nops = TREE_CODE_LENGTH (TREE_CODE (exp));
5984 for (i = 0; i < nops; i++)
5985 if (TREE_OPERAND (exp, i) != 0
5986 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
5989 /* If this is a language-specific tree code, it may require
5990 special handling. */
5991 if ((unsigned int) TREE_CODE (exp)
5992 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
5993 && !lang_hooks.safe_from_p (x, exp))
5998 /* Should never get a type here. */
6002 /* If we have an rtl, find any enclosed object. Then see if we conflict
6006 if (GET_CODE (exp_rtl) == SUBREG)
6008 exp_rtl = SUBREG_REG (exp_rtl);
6010 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
6014 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6015 are memory and they conflict. */
6016 return ! (rtx_equal_p (x, exp_rtl)
6017 || (MEM_P (x) && MEM_P (exp_rtl)
6018 && true_dependence (exp_rtl, VOIDmode, x,
6019 rtx_addr_varies_p)));
6022 /* If we reach here, it is safe. */
6027 /* Return the highest power of two that EXP is known to be a multiple of.
6028 This is used in updating alignment of MEMs in array references. */
6030 static unsigned HOST_WIDE_INT
6031 highest_pow2_factor (tree exp)
6033 unsigned HOST_WIDE_INT c0, c1;
6035 switch (TREE_CODE (exp))
6038 /* We can find the lowest bit that's a one. If the low
6039 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6040 We need to handle this case since we can find it in a COND_EXPR,
6041 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
6042 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6044 if (TREE_CONSTANT_OVERFLOW (exp))
6045 return BIGGEST_ALIGNMENT;
6048 /* Note: tree_low_cst is intentionally not used here,
6049 we don't care about the upper bits. */
6050 c0 = TREE_INT_CST_LOW (exp);
6052 return c0 ? c0 : BIGGEST_ALIGNMENT;
6056 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6057 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6058 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6059 return MIN (c0, c1);
6062 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6063 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6066 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6068 if (integer_pow2p (TREE_OPERAND (exp, 1))
6069 && host_integerp (TREE_OPERAND (exp, 1), 1))
6071 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6072 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6073 return MAX (1, c0 / c1);
6077 case NON_LVALUE_EXPR: case NOP_EXPR: case CONVERT_EXPR:
6079 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6082 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6085 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6086 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6087 return MIN (c0, c1);
6096 /* Similar, except that the alignment requirements of TARGET are
6097 taken into account. Assume it is at least as aligned as its
6098 type, unless it is a COMPONENT_REF in which case the layout of
6099 the structure gives the alignment. */
6101 static unsigned HOST_WIDE_INT
6102 highest_pow2_factor_for_target (tree target, tree exp)
6104 unsigned HOST_WIDE_INT target_align, factor;
6106 factor = highest_pow2_factor (exp);
6107 if (TREE_CODE (target) == COMPONENT_REF)
6108 target_align = DECL_ALIGN_UNIT (TREE_OPERAND (target, 1));
6110 target_align = TYPE_ALIGN_UNIT (TREE_TYPE (target));
6111 return MAX (factor, target_align);
6114 /* Expands variable VAR. */
6117 expand_var (tree var)
6119 if (DECL_EXTERNAL (var))
6122 if (TREE_STATIC (var))
6123 /* If this is an inlined copy of a static local variable,
6124 look up the original decl. */
6125 var = DECL_ORIGIN (var);
6127 if (TREE_STATIC (var)
6128 ? !TREE_ASM_WRITTEN (var)
6129 : !DECL_RTL_SET_P (var))
6131 if (TREE_CODE (var) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (var))
6132 /* Should be ignored. */;
6133 else if (lang_hooks.expand_decl (var))
6135 else if (TREE_CODE (var) == VAR_DECL && !TREE_STATIC (var))
6137 else if (TREE_CODE (var) == VAR_DECL && TREE_STATIC (var))
6138 rest_of_decl_compilation (var, 0, 0);
6140 /* No expansion needed. */
6141 gcc_assert (TREE_CODE (var) == TYPE_DECL
6142 || TREE_CODE (var) == CONST_DECL
6143 || TREE_CODE (var) == FUNCTION_DECL
6144 || TREE_CODE (var) == LABEL_DECL);
6148 /* Subroutine of expand_expr. Expand the two operands of a binary
6149 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6150 The value may be stored in TARGET if TARGET is nonzero. The
6151 MODIFIER argument is as documented by expand_expr. */
6154 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6155 enum expand_modifier modifier)
6157 if (! safe_from_p (target, exp1, 1))
6159 if (operand_equal_p (exp0, exp1, 0))
6161 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6162 *op1 = copy_rtx (*op0);
6166 /* If we need to preserve evaluation order, copy exp0 into its own
6167 temporary variable so that it can't be clobbered by exp1. */
6168 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6169 exp0 = save_expr (exp0);
6170 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6171 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6176 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6177 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6180 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
6181 enum expand_modifier modifier)
6183 rtx result, subtarget;
6185 HOST_WIDE_INT bitsize, bitpos;
6186 int volatilep, unsignedp;
6187 enum machine_mode mode1;
6189 /* If we are taking the address of a constant and are at the top level,
6190 we have to use output_constant_def since we can't call force_const_mem
6192 /* ??? This should be considered a front-end bug. We should not be
6193 generating ADDR_EXPR of something that isn't an LVALUE. The only
6194 exception here is STRING_CST. */
6195 if (TREE_CODE (exp) == CONSTRUCTOR
6196 || CONSTANT_CLASS_P (exp))
6197 return XEXP (output_constant_def (exp, 0), 0);
6199 /* Everything must be something allowed by is_gimple_addressable. */
6200 switch (TREE_CODE (exp))
6203 /* This case will happen via recursion for &a->b. */
6204 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, EXPAND_NORMAL);
6207 /* Recurse and make the output_constant_def clause above handle this. */
6208 return expand_expr_addr_expr_1 (DECL_INITIAL (exp), target,
6212 /* The real part of the complex number is always first, therefore
6213 the address is the same as the address of the parent object. */
6216 inner = TREE_OPERAND (exp, 0);
6220 /* The imaginary part of the complex number is always second.
6221 The expression is therefore always offset by the size of the
6224 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
6225 inner = TREE_OPERAND (exp, 0);
6229 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6230 expand_expr, as that can have various side effects; LABEL_DECLs for
6231 example, may not have their DECL_RTL set yet. Assume language
6232 specific tree nodes can be expanded in some interesting way. */
6234 || TREE_CODE (exp) >= LAST_AND_UNUSED_TREE_CODE)
6236 result = expand_expr (exp, target, tmode,
6237 modifier == EXPAND_INITIALIZER
6238 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
6240 /* If the DECL isn't in memory, then the DECL wasn't properly
6241 marked TREE_ADDRESSABLE, which will be either a front-end
6242 or a tree optimizer bug. */
6243 gcc_assert (MEM_P (result));
6244 result = XEXP (result, 0);
6246 /* ??? Is this needed anymore? */
6247 if (DECL_P (exp) && !TREE_USED (exp) == 0)
6249 assemble_external (exp);
6250 TREE_USED (exp) = 1;
6253 if (modifier != EXPAND_INITIALIZER
6254 && modifier != EXPAND_CONST_ADDRESS)
6255 result = force_operand (result, target);
6259 /* Pass FALSE as the last argument to get_inner_reference although
6260 we are expanding to RTL. The rationale is that we know how to
6261 handle "aligning nodes" here: we can just bypass them because
6262 they won't change the final object whose address will be returned
6263 (they actually exist only for that purpose). */
6264 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6265 &mode1, &unsignedp, &volatilep, false);
6269 /* We must have made progress. */
6270 gcc_assert (inner != exp);
6272 subtarget = offset || bitpos ? NULL_RTX : target;
6273 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier);
6279 if (modifier != EXPAND_NORMAL)
6280 result = force_operand (result, NULL);
6281 tmp = expand_expr (offset, NULL, tmode, EXPAND_NORMAL);
6283 result = convert_memory_address (tmode, result);
6284 tmp = convert_memory_address (tmode, tmp);
6286 if (modifier == EXPAND_SUM)
6287 result = gen_rtx_PLUS (tmode, result, tmp);
6290 subtarget = bitpos ? NULL_RTX : target;
6291 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
6292 1, OPTAB_LIB_WIDEN);
6298 /* Someone beforehand should have rejected taking the address
6299 of such an object. */
6300 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
6302 result = plus_constant (result, bitpos / BITS_PER_UNIT);
6303 if (modifier < EXPAND_SUM)
6304 result = force_operand (result, target);
6310 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
6311 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6314 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
6315 enum expand_modifier modifier)
6317 enum machine_mode rmode;
6320 /* Target mode of VOIDmode says "whatever's natural". */
6321 if (tmode == VOIDmode)
6322 tmode = TYPE_MODE (TREE_TYPE (exp));
6324 /* We can get called with some Weird Things if the user does silliness
6325 like "(short) &a". In that case, convert_memory_address won't do
6326 the right thing, so ignore the given target mode. */
6327 if (tmode != Pmode && tmode != ptr_mode)
6330 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
6333 /* Despite expand_expr claims concerning ignoring TMODE when not
6334 strictly convenient, stuff breaks if we don't honor it. Note
6335 that combined with the above, we only do this for pointer modes. */
6336 rmode = GET_MODE (result);
6337 if (rmode == VOIDmode)
6340 result = convert_memory_address (tmode, result);
6346 /* expand_expr: generate code for computing expression EXP.
6347 An rtx for the computed value is returned. The value is never null.
6348 In the case of a void EXP, const0_rtx is returned.
6350 The value may be stored in TARGET if TARGET is nonzero.
6351 TARGET is just a suggestion; callers must assume that
6352 the rtx returned may not be the same as TARGET.
6354 If TARGET is CONST0_RTX, it means that the value will be ignored.
6356 If TMODE is not VOIDmode, it suggests generating the
6357 result in mode TMODE. But this is done only when convenient.
6358 Otherwise, TMODE is ignored and the value generated in its natural mode.
6359 TMODE is just a suggestion; callers must assume that
6360 the rtx returned may not have mode TMODE.
6362 Note that TARGET may have neither TMODE nor MODE. In that case, it
6363 probably will not be used.
6365 If MODIFIER is EXPAND_SUM then when EXP is an addition
6366 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
6367 or a nest of (PLUS ...) and (MINUS ...) where the terms are
6368 products as above, or REG or MEM, or constant.
6369 Ordinarily in such cases we would output mul or add instructions
6370 and then return a pseudo reg containing the sum.
6372 EXPAND_INITIALIZER is much like EXPAND_SUM except that
6373 it also marks a label as absolutely required (it can't be dead).
6374 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
6375 This is used for outputting expressions used in initializers.
6377 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
6378 with a constant address even if that address is not normally legitimate.
6379 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
6381 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
6382 a call parameter. Such targets require special care as we haven't yet
6383 marked TARGET so that it's safe from being trashed by libcalls. We
6384 don't want to use TARGET for anything but the final result;
6385 Intermediate values must go elsewhere. Additionally, calls to
6386 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
6388 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
6389 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
6390 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
6391 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
6394 static rtx expand_expr_real_1 (tree, rtx, enum machine_mode,
6395 enum expand_modifier, rtx *);
6398 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
6399 enum expand_modifier modifier, rtx *alt_rtl)
6402 rtx ret, last = NULL;
6404 /* Handle ERROR_MARK before anybody tries to access its type. */
6405 if (TREE_CODE (exp) == ERROR_MARK
6406 || TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK)
6408 ret = CONST0_RTX (tmode);
6409 return ret ? ret : const0_rtx;
6412 if (flag_non_call_exceptions)
6414 rn = lookup_stmt_eh_region (exp);
6415 /* If rn < 0, then either (1) tree-ssa not used or (2) doesn't throw. */
6417 last = get_last_insn ();
6420 /* If this is an expression of some kind and it has an associated line
6421 number, then emit the line number before expanding the expression.
6423 We need to save and restore the file and line information so that
6424 errors discovered during expansion are emitted with the right
6425 information. It would be better of the diagnostic routines
6426 used the file/line information embedded in the tree nodes rather
6428 if (cfun && EXPR_HAS_LOCATION (exp))
6430 location_t saved_location = input_location;
6431 input_location = EXPR_LOCATION (exp);
6432 emit_line_note (input_location);
6434 /* Record where the insns produced belong. */
6435 record_block_change (TREE_BLOCK (exp));
6437 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
6439 input_location = saved_location;
6443 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
6446 /* If using non-call exceptions, mark all insns that may trap.
6447 expand_call() will mark CALL_INSNs before we get to this code,
6448 but it doesn't handle libcalls, and these may trap. */
6452 for (insn = next_real_insn (last); insn;
6453 insn = next_real_insn (insn))
6455 if (! find_reg_note (insn, REG_EH_REGION, NULL_RTX)
6456 /* If we want exceptions for non-call insns, any
6457 may_trap_p instruction may throw. */
6458 && GET_CODE (PATTERN (insn)) != CLOBBER
6459 && GET_CODE (PATTERN (insn)) != USE
6460 && (CALL_P (insn) || may_trap_p (PATTERN (insn))))
6462 REG_NOTES (insn) = alloc_EXPR_LIST (REG_EH_REGION, GEN_INT (rn),
6472 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
6473 enum expand_modifier modifier, rtx *alt_rtl)
6476 tree type = TREE_TYPE (exp);
6478 enum machine_mode mode;
6479 enum tree_code code = TREE_CODE (exp);
6481 rtx subtarget, original_target;
6484 bool reduce_bit_field = false;
6485 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field && !ignore \
6486 ? reduce_to_bit_field_precision ((expr), \
6491 mode = TYPE_MODE (type);
6492 unsignedp = TYPE_UNSIGNED (type);
6493 if (lang_hooks.reduce_bit_field_operations
6494 && TREE_CODE (type) == INTEGER_TYPE
6495 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type))
6497 /* An operation in what may be a bit-field type needs the
6498 result to be reduced to the precision of the bit-field type,
6499 which is narrower than that of the type's mode. */
6500 reduce_bit_field = true;
6501 if (modifier == EXPAND_STACK_PARM)
6505 /* Use subtarget as the target for operand 0 of a binary operation. */
6506 subtarget = get_subtarget (target);
6507 original_target = target;
6508 ignore = (target == const0_rtx
6509 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
6510 || code == CONVERT_EXPR || code == COND_EXPR
6511 || code == VIEW_CONVERT_EXPR)
6512 && TREE_CODE (type) == VOID_TYPE));
6514 /* If we are going to ignore this result, we need only do something
6515 if there is a side-effect somewhere in the expression. If there
6516 is, short-circuit the most common cases here. Note that we must
6517 not call expand_expr with anything but const0_rtx in case this
6518 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
6522 if (! TREE_SIDE_EFFECTS (exp))
6525 /* Ensure we reference a volatile object even if value is ignored, but
6526 don't do this if all we are doing is taking its address. */
6527 if (TREE_THIS_VOLATILE (exp)
6528 && TREE_CODE (exp) != FUNCTION_DECL
6529 && mode != VOIDmode && mode != BLKmode
6530 && modifier != EXPAND_CONST_ADDRESS)
6532 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
6534 temp = copy_to_reg (temp);
6538 if (TREE_CODE_CLASS (code) == tcc_unary
6539 || code == COMPONENT_REF || code == INDIRECT_REF)
6540 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6543 else if (TREE_CODE_CLASS (code) == tcc_binary
6544 || TREE_CODE_CLASS (code) == tcc_comparison
6545 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
6547 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6548 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6551 else if (code == BIT_FIELD_REF)
6553 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6554 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6555 expand_expr (TREE_OPERAND (exp, 2), const0_rtx, VOIDmode, modifier);
6562 /* If will do cse, generate all results into pseudo registers
6563 since 1) that allows cse to find more things
6564 and 2) otherwise cse could produce an insn the machine
6565 cannot support. An exception is a CONSTRUCTOR into a multi-word
6566 MEM: that's much more likely to be most efficient into the MEM.
6567 Another is a CALL_EXPR which must return in memory. */
6569 if (! cse_not_expected && mode != BLKmode && target
6570 && (!REG_P (target) || REGNO (target) < FIRST_PSEUDO_REGISTER)
6571 && ! (code == CONSTRUCTOR && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
6572 && ! (code == CALL_EXPR && aggregate_value_p (exp, exp)))
6579 tree function = decl_function_context (exp);
6581 temp = label_rtx (exp);
6582 temp = gen_rtx_LABEL_REF (Pmode, temp);
6584 if (function != current_function_decl
6586 LABEL_REF_NONLOCAL_P (temp) = 1;
6588 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
6593 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier,
6598 /* If a static var's type was incomplete when the decl was written,
6599 but the type is complete now, lay out the decl now. */
6600 if (DECL_SIZE (exp) == 0
6601 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
6602 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
6603 layout_decl (exp, 0);
6605 /* ... fall through ... */
6609 gcc_assert (DECL_RTL (exp));
6611 /* Ensure variable marked as used even if it doesn't go through
6612 a parser. If it hasn't be used yet, write out an external
6614 if (! TREE_USED (exp))
6616 assemble_external (exp);
6617 TREE_USED (exp) = 1;
6620 /* Show we haven't gotten RTL for this yet. */
6623 /* Variables inherited from containing functions should have
6624 been lowered by this point. */
6625 context = decl_function_context (exp);
6626 gcc_assert (!context
6627 || context == current_function_decl
6628 || TREE_STATIC (exp)
6629 /* ??? C++ creates functions that are not TREE_STATIC. */
6630 || TREE_CODE (exp) == FUNCTION_DECL);
6632 /* This is the case of an array whose size is to be determined
6633 from its initializer, while the initializer is still being parsed.
6636 if (MEM_P (DECL_RTL (exp))
6637 && REG_P (XEXP (DECL_RTL (exp), 0)))
6638 temp = validize_mem (DECL_RTL (exp));
6640 /* If DECL_RTL is memory, we are in the normal case and either
6641 the address is not valid or it is not a register and -fforce-addr
6642 is specified, get the address into a register. */
6644 else if (MEM_P (DECL_RTL (exp))
6645 && modifier != EXPAND_CONST_ADDRESS
6646 && modifier != EXPAND_SUM
6647 && modifier != EXPAND_INITIALIZER
6648 && (! memory_address_p (DECL_MODE (exp),
6649 XEXP (DECL_RTL (exp), 0))
6651 && !REG_P (XEXP (DECL_RTL (exp), 0)))))
6654 *alt_rtl = DECL_RTL (exp);
6655 temp = replace_equiv_address (DECL_RTL (exp),
6656 copy_rtx (XEXP (DECL_RTL (exp), 0)));
6659 /* If we got something, return it. But first, set the alignment
6660 if the address is a register. */
6663 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
6664 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
6669 /* If the mode of DECL_RTL does not match that of the decl, it
6670 must be a promoted value. We return a SUBREG of the wanted mode,
6671 but mark it so that we know that it was already extended. */
6673 if (REG_P (DECL_RTL (exp))
6674 && GET_MODE (DECL_RTL (exp)) != DECL_MODE (exp))
6676 enum machine_mode pmode;
6678 /* Get the signedness used for this variable. Ensure we get the
6679 same mode we got when the variable was declared. */
6680 pmode = promote_mode (type, DECL_MODE (exp), &unsignedp,
6681 (TREE_CODE (exp) == RESULT_DECL ? 1 : 0));
6682 gcc_assert (GET_MODE (DECL_RTL (exp)) == pmode);
6684 temp = gen_lowpart_SUBREG (mode, DECL_RTL (exp));
6685 SUBREG_PROMOTED_VAR_P (temp) = 1;
6686 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
6690 return DECL_RTL (exp);
6693 temp = immed_double_const (TREE_INT_CST_LOW (exp),
6694 TREE_INT_CST_HIGH (exp), mode);
6696 /* ??? If overflow is set, fold will have done an incomplete job,
6697 which can result in (plus xx (const_int 0)), which can get
6698 simplified by validate_replace_rtx during virtual register
6699 instantiation, which can result in unrecognizable insns.
6700 Avoid this by forcing all overflows into registers. */
6701 if (TREE_CONSTANT_OVERFLOW (exp)
6702 && modifier != EXPAND_INITIALIZER)
6703 temp = force_reg (mode, temp);
6708 if (GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (exp))) == MODE_VECTOR_INT
6709 || GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (exp))) == MODE_VECTOR_FLOAT)
6710 return const_vector_from_tree (exp);
6712 return expand_expr (build1 (CONSTRUCTOR, TREE_TYPE (exp),
6713 TREE_VECTOR_CST_ELTS (exp)),
6714 ignore ? const0_rtx : target, tmode, modifier);
6717 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
6720 /* If optimized, generate immediate CONST_DOUBLE
6721 which will be turned into memory by reload if necessary.
6723 We used to force a register so that loop.c could see it. But
6724 this does not allow gen_* patterns to perform optimizations with
6725 the constants. It also produces two insns in cases like "x = 1.0;".
6726 On most machines, floating-point constants are not permitted in
6727 many insns, so we'd end up copying it to a register in any case.
6729 Now, we do the copying in expand_binop, if appropriate. */
6730 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
6731 TYPE_MODE (TREE_TYPE (exp)));
6734 /* Handle evaluating a complex constant in a CONCAT target. */
6735 if (original_target && GET_CODE (original_target) == CONCAT)
6737 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
6740 rtarg = XEXP (original_target, 0);
6741 itarg = XEXP (original_target, 1);
6743 /* Move the real and imaginary parts separately. */
6744 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, 0);
6745 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, 0);
6748 emit_move_insn (rtarg, op0);
6750 emit_move_insn (itarg, op1);
6752 return original_target;
6755 /* ... fall through ... */
6758 temp = output_constant_def (exp, 1);
6760 /* temp contains a constant address.
6761 On RISC machines where a constant address isn't valid,
6762 make some insns to get that address into a register. */
6763 if (modifier != EXPAND_CONST_ADDRESS
6764 && modifier != EXPAND_INITIALIZER
6765 && modifier != EXPAND_SUM
6766 && (! memory_address_p (mode, XEXP (temp, 0))
6767 || flag_force_addr))
6768 return replace_equiv_address (temp,
6769 copy_rtx (XEXP (temp, 0)));
6774 tree val = TREE_OPERAND (exp, 0);
6775 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
6777 if (!SAVE_EXPR_RESOLVED_P (exp))
6779 /* We can indeed still hit this case, typically via builtin
6780 expanders calling save_expr immediately before expanding
6781 something. Assume this means that we only have to deal
6782 with non-BLKmode values. */
6783 gcc_assert (GET_MODE (ret) != BLKmode);
6785 val = build_decl (VAR_DECL, NULL, TREE_TYPE (exp));
6786 DECL_ARTIFICIAL (val) = 1;
6787 DECL_IGNORED_P (val) = 1;
6788 TREE_OPERAND (exp, 0) = val;
6789 SAVE_EXPR_RESOLVED_P (exp) = 1;
6791 if (!CONSTANT_P (ret))
6792 ret = copy_to_reg (ret);
6793 SET_DECL_RTL (val, ret);
6800 if (TREE_CODE (TREE_OPERAND (exp, 0)) == LABEL_DECL)
6801 expand_goto (TREE_OPERAND (exp, 0));
6803 expand_computed_goto (TREE_OPERAND (exp, 0));
6807 /* If we don't need the result, just ensure we evaluate any
6813 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
6814 expand_expr (TREE_VALUE (elt), const0_rtx, VOIDmode, 0);
6819 /* All elts simple constants => refer to a constant in memory. But
6820 if this is a non-BLKmode mode, let it store a field at a time
6821 since that should make a CONST_INT or CONST_DOUBLE when we
6822 fold. Likewise, if we have a target we can use, it is best to
6823 store directly into the target unless the type is large enough
6824 that memcpy will be used. If we are making an initializer and
6825 all operands are constant, put it in memory as well.
6827 FIXME: Avoid trying to fill vector constructors piece-meal.
6828 Output them with output_constant_def below unless we're sure
6829 they're zeros. This should go away when vector initializers
6830 are treated like VECTOR_CST instead of arrays.
6832 else if ((TREE_STATIC (exp)
6833 && ((mode == BLKmode
6834 && ! (target != 0 && safe_from_p (target, exp, 1)))
6835 || TREE_ADDRESSABLE (exp)
6836 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
6837 && (! MOVE_BY_PIECES_P
6838 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
6840 && ! mostly_zeros_p (exp))))
6841 || ((modifier == EXPAND_INITIALIZER
6842 || modifier == EXPAND_CONST_ADDRESS)
6843 && TREE_CONSTANT (exp)))
6845 rtx constructor = output_constant_def (exp, 1);
6847 if (modifier != EXPAND_CONST_ADDRESS
6848 && modifier != EXPAND_INITIALIZER
6849 && modifier != EXPAND_SUM)
6850 constructor = validize_mem (constructor);
6856 /* Handle calls that pass values in multiple non-contiguous
6857 locations. The Irix 6 ABI has examples of this. */
6858 if (target == 0 || ! safe_from_p (target, exp, 1)
6859 || GET_CODE (target) == PARALLEL
6860 || modifier == EXPAND_STACK_PARM)
6862 = assign_temp (build_qualified_type (type,
6864 | (TREE_READONLY (exp)
6865 * TYPE_QUAL_CONST))),
6866 0, TREE_ADDRESSABLE (exp), 1);
6868 store_constructor (exp, target, 0, int_expr_size (exp));
6872 case MISALIGNED_INDIRECT_REF:
6873 case ALIGN_INDIRECT_REF:
6876 tree exp1 = TREE_OPERAND (exp, 0);
6878 if (modifier != EXPAND_WRITE)
6882 t = fold_read_from_constant_string (exp);
6884 return expand_expr (t, target, tmode, modifier);
6887 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
6888 op0 = memory_address (mode, op0);
6890 if (code == ALIGN_INDIRECT_REF)
6892 int align = TYPE_ALIGN_UNIT (type);
6893 op0 = gen_rtx_AND (Pmode, op0, GEN_INT (-align));
6894 op0 = memory_address (mode, op0);
6897 temp = gen_rtx_MEM (mode, op0);
6899 set_mem_attributes (temp, exp, 0);
6901 /* Resolve the misalignment now, so that we don't have to remember
6902 to resolve it later. Of course, this only works for reads. */
6903 /* ??? When we get around to supporting writes, we'll have to handle
6904 this in store_expr directly. The vectorizer isn't generating
6905 those yet, however. */
6906 if (code == MISALIGNED_INDIRECT_REF)
6911 gcc_assert (modifier == EXPAND_NORMAL);
6913 /* The vectorizer should have already checked the mode. */
6914 icode = movmisalign_optab->handlers[mode].insn_code;
6915 gcc_assert (icode != CODE_FOR_nothing);
6917 /* We've already validated the memory, and we're creating a
6918 new pseudo destination. The predicates really can't fail. */
6919 reg = gen_reg_rtx (mode);
6921 /* Nor can the insn generator. */
6922 insn = GEN_FCN (icode) (reg, temp);
6931 case TARGET_MEM_REF:
6933 struct mem_address addr;
6935 get_address_description (exp, &addr);
6936 op0 = addr_for_mem_ref (&addr, true);
6937 op0 = memory_address (mode, op0);
6938 temp = gen_rtx_MEM (mode, op0);
6939 set_mem_attributes (temp, TMR_ORIGINAL (exp), 0);
6946 tree array = TREE_OPERAND (exp, 0);
6947 tree index = TREE_OPERAND (exp, 1);
6949 /* Fold an expression like: "foo"[2].
6950 This is not done in fold so it won't happen inside &.
6951 Don't fold if this is for wide characters since it's too
6952 difficult to do correctly and this is a very rare case. */
6954 if (modifier != EXPAND_CONST_ADDRESS
6955 && modifier != EXPAND_INITIALIZER
6956 && modifier != EXPAND_MEMORY)
6958 tree t = fold_read_from_constant_string (exp);
6961 return expand_expr (t, target, tmode, modifier);
6964 /* If this is a constant index into a constant array,
6965 just get the value from the array. Handle both the cases when
6966 we have an explicit constructor and when our operand is a variable
6967 that was declared const. */
6969 if (modifier != EXPAND_CONST_ADDRESS
6970 && modifier != EXPAND_INITIALIZER
6971 && modifier != EXPAND_MEMORY
6972 && TREE_CODE (array) == CONSTRUCTOR
6973 && ! TREE_SIDE_EFFECTS (array)
6974 && TREE_CODE (index) == INTEGER_CST)
6978 for (elem = CONSTRUCTOR_ELTS (array);
6979 (elem && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
6980 elem = TREE_CHAIN (elem))
6983 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
6984 return expand_expr (fold (TREE_VALUE (elem)), target, tmode,
6988 else if (optimize >= 1
6989 && modifier != EXPAND_CONST_ADDRESS
6990 && modifier != EXPAND_INITIALIZER
6991 && modifier != EXPAND_MEMORY
6992 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
6993 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
6994 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
6995 && targetm.binds_local_p (array))
6997 if (TREE_CODE (index) == INTEGER_CST)
6999 tree init = DECL_INITIAL (array);
7001 if (TREE_CODE (init) == CONSTRUCTOR)
7005 for (elem = CONSTRUCTOR_ELTS (init);
7007 && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
7008 elem = TREE_CHAIN (elem))
7011 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
7012 return expand_expr (fold (TREE_VALUE (elem)), target,
7015 else if (TREE_CODE (init) == STRING_CST
7016 && 0 > compare_tree_int (index,
7017 TREE_STRING_LENGTH (init)))
7019 tree type = TREE_TYPE (TREE_TYPE (init));
7020 enum machine_mode mode = TYPE_MODE (type);
7022 if (GET_MODE_CLASS (mode) == MODE_INT
7023 && GET_MODE_SIZE (mode) == 1)
7024 return gen_int_mode (TREE_STRING_POINTER (init)
7025 [TREE_INT_CST_LOW (index)], mode);
7030 goto normal_inner_ref;
7033 /* If the operand is a CONSTRUCTOR, we can just extract the
7034 appropriate field if it is present. */
7035 if (TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR)
7039 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
7040 elt = TREE_CHAIN (elt))
7041 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1)
7042 /* We can normally use the value of the field in the
7043 CONSTRUCTOR. However, if this is a bitfield in
7044 an integral mode that we can fit in a HOST_WIDE_INT,
7045 we must mask only the number of bits in the bitfield,
7046 since this is done implicitly by the constructor. If
7047 the bitfield does not meet either of those conditions,
7048 we can't do this optimization. */
7049 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt))
7050 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt)))
7052 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt)))
7053 <= HOST_BITS_PER_WIDE_INT))))
7055 if (DECL_BIT_FIELD (TREE_PURPOSE (elt))
7056 && modifier == EXPAND_STACK_PARM)
7058 op0 = expand_expr (TREE_VALUE (elt), target, tmode, modifier);
7059 if (DECL_BIT_FIELD (TREE_PURPOSE (elt)))
7061 HOST_WIDE_INT bitsize
7062 = TREE_INT_CST_LOW (DECL_SIZE (TREE_PURPOSE (elt)));
7063 enum machine_mode imode
7064 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt)));
7066 if (TYPE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt))))
7068 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
7069 op0 = expand_and (imode, op0, op1, target);
7074 = build_int_cst (NULL_TREE,
7075 GET_MODE_BITSIZE (imode) - bitsize);
7077 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
7079 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
7087 goto normal_inner_ref;
7090 case ARRAY_RANGE_REF:
7093 enum machine_mode mode1;
7094 HOST_WIDE_INT bitsize, bitpos;
7097 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
7098 &mode1, &unsignedp, &volatilep, true);
7101 /* If we got back the original object, something is wrong. Perhaps
7102 we are evaluating an expression too early. In any event, don't
7103 infinitely recurse. */
7104 gcc_assert (tem != exp);
7106 /* If TEM's type is a union of variable size, pass TARGET to the inner
7107 computation, since it will need a temporary and TARGET is known
7108 to have to do. This occurs in unchecked conversion in Ada. */
7112 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
7113 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
7115 && modifier != EXPAND_STACK_PARM
7116 ? target : NULL_RTX),
7118 (modifier == EXPAND_INITIALIZER
7119 || modifier == EXPAND_CONST_ADDRESS
7120 || modifier == EXPAND_STACK_PARM)
7121 ? modifier : EXPAND_NORMAL);
7123 /* If this is a constant, put it into a register if it is a
7124 legitimate constant and OFFSET is 0 and memory if it isn't. */
7125 if (CONSTANT_P (op0))
7127 enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
7128 if (mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
7130 op0 = force_reg (mode, op0);
7132 op0 = validize_mem (force_const_mem (mode, op0));
7135 /* Otherwise, if this object not in memory and we either have an
7136 offset or a BLKmode result, put it there. This case can't occur in
7137 C, but can in Ada if we have unchecked conversion of an expression
7138 from a scalar type to an array or record type or for an
7139 ARRAY_RANGE_REF whose type is BLKmode. */
7140 else if (!MEM_P (op0)
7142 || (code == ARRAY_RANGE_REF && mode == BLKmode)))
7144 tree nt = build_qualified_type (TREE_TYPE (tem),
7145 (TYPE_QUALS (TREE_TYPE (tem))
7146 | TYPE_QUAL_CONST));
7147 rtx memloc = assign_temp (nt, 1, 1, 1);
7149 emit_move_insn (memloc, op0);
7155 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
7158 gcc_assert (MEM_P (op0));
7160 #ifdef POINTERS_EXTEND_UNSIGNED
7161 if (GET_MODE (offset_rtx) != Pmode)
7162 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
7164 if (GET_MODE (offset_rtx) != ptr_mode)
7165 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
7168 if (GET_MODE (op0) == BLKmode
7169 /* A constant address in OP0 can have VOIDmode, we must
7170 not try to call force_reg in that case. */
7171 && GET_MODE (XEXP (op0, 0)) != VOIDmode
7173 && (bitpos % bitsize) == 0
7174 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
7175 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
7177 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7181 op0 = offset_address (op0, offset_rtx,
7182 highest_pow2_factor (offset));
7185 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
7186 record its alignment as BIGGEST_ALIGNMENT. */
7187 if (MEM_P (op0) && bitpos == 0 && offset != 0
7188 && is_aligning_offset (offset, tem))
7189 set_mem_align (op0, BIGGEST_ALIGNMENT);
7191 /* Don't forget about volatility even if this is a bitfield. */
7192 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
7194 if (op0 == orig_op0)
7195 op0 = copy_rtx (op0);
7197 MEM_VOLATILE_P (op0) = 1;
7200 /* The following code doesn't handle CONCAT.
7201 Assume only bitpos == 0 can be used for CONCAT, due to
7202 one element arrays having the same mode as its element. */
7203 if (GET_CODE (op0) == CONCAT)
7205 gcc_assert (bitpos == 0
7206 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)));
7210 /* In cases where an aligned union has an unaligned object
7211 as a field, we might be extracting a BLKmode value from
7212 an integer-mode (e.g., SImode) object. Handle this case
7213 by doing the extract into an object as wide as the field
7214 (which we know to be the width of a basic mode), then
7215 storing into memory, and changing the mode to BLKmode. */
7216 if (mode1 == VOIDmode
7217 || REG_P (op0) || GET_CODE (op0) == SUBREG
7218 || (mode1 != BLKmode && ! direct_load[(int) mode1]
7219 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7220 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
7221 && modifier != EXPAND_CONST_ADDRESS
7222 && modifier != EXPAND_INITIALIZER)
7223 /* If the field isn't aligned enough to fetch as a memref,
7224 fetch it as a bit field. */
7225 || (mode1 != BLKmode
7226 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
7227 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
7229 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
7230 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
7231 && ((modifier == EXPAND_CONST_ADDRESS
7232 || modifier == EXPAND_INITIALIZER)
7234 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
7235 || (bitpos % BITS_PER_UNIT != 0)))
7236 /* If the type and the field are a constant size and the
7237 size of the type isn't the same size as the bitfield,
7238 we must use bitfield operations. */
7240 && TYPE_SIZE (TREE_TYPE (exp))
7241 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
7242 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
7245 enum machine_mode ext_mode = mode;
7247 if (ext_mode == BLKmode
7248 && ! (target != 0 && MEM_P (op0)
7250 && bitpos % BITS_PER_UNIT == 0))
7251 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
7253 if (ext_mode == BLKmode)
7256 target = assign_temp (type, 0, 1, 1);
7261 /* In this case, BITPOS must start at a byte boundary and
7262 TARGET, if specified, must be a MEM. */
7263 gcc_assert (MEM_P (op0)
7264 && (!target || MEM_P (target))
7265 && !(bitpos % BITS_PER_UNIT));
7267 emit_block_move (target,
7268 adjust_address (op0, VOIDmode,
7269 bitpos / BITS_PER_UNIT),
7270 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
7272 (modifier == EXPAND_STACK_PARM
7273 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
7278 op0 = validize_mem (op0);
7280 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
7281 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7283 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp,
7284 (modifier == EXPAND_STACK_PARM
7285 ? NULL_RTX : target),
7286 ext_mode, ext_mode);
7288 /* If the result is a record type and BITSIZE is narrower than
7289 the mode of OP0, an integral mode, and this is a big endian
7290 machine, we must put the field into the high-order bits. */
7291 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
7292 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7293 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
7294 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
7295 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
7299 /* If the result type is BLKmode, store the data into a temporary
7300 of the appropriate type, but with the mode corresponding to the
7301 mode for the data we have (op0's mode). It's tempting to make
7302 this a constant type, since we know it's only being stored once,
7303 but that can cause problems if we are taking the address of this
7304 COMPONENT_REF because the MEM of any reference via that address
7305 will have flags corresponding to the type, which will not
7306 necessarily be constant. */
7307 if (mode == BLKmode)
7310 = assign_stack_temp_for_type
7311 (ext_mode, GET_MODE_BITSIZE (ext_mode), 0, type);
7313 emit_move_insn (new, op0);
7314 op0 = copy_rtx (new);
7315 PUT_MODE (op0, BLKmode);
7316 set_mem_attributes (op0, exp, 1);
7322 /* If the result is BLKmode, use that to access the object
7324 if (mode == BLKmode)
7327 /* Get a reference to just this component. */
7328 if (modifier == EXPAND_CONST_ADDRESS
7329 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7330 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
7332 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7334 if (op0 == orig_op0)
7335 op0 = copy_rtx (op0);
7337 set_mem_attributes (op0, exp, 0);
7338 if (REG_P (XEXP (op0, 0)))
7339 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7341 MEM_VOLATILE_P (op0) |= volatilep;
7342 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
7343 || modifier == EXPAND_CONST_ADDRESS
7344 || modifier == EXPAND_INITIALIZER)
7346 else if (target == 0)
7347 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7349 convert_move (target, op0, unsignedp);
7354 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
7357 /* Check for a built-in function. */
7358 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
7359 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7361 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7363 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7364 == BUILT_IN_FRONTEND)
7365 return lang_hooks.expand_expr (exp, original_target,
7369 return expand_builtin (exp, target, subtarget, tmode, ignore);
7372 return expand_call (exp, target, ignore);
7374 case NON_LVALUE_EXPR:
7377 if (TREE_OPERAND (exp, 0) == error_mark_node)
7380 if (TREE_CODE (type) == UNION_TYPE)
7382 tree valtype = TREE_TYPE (TREE_OPERAND (exp, 0));
7384 /* If both input and output are BLKmode, this conversion isn't doing
7385 anything except possibly changing memory attribute. */
7386 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7388 rtx result = expand_expr (TREE_OPERAND (exp, 0), target, tmode,
7391 result = copy_rtx (result);
7392 set_mem_attributes (result, exp, 0);
7398 if (TYPE_MODE (type) != BLKmode)
7399 target = gen_reg_rtx (TYPE_MODE (type));
7401 target = assign_temp (type, 0, 1, 1);
7405 /* Store data into beginning of memory target. */
7406 store_expr (TREE_OPERAND (exp, 0),
7407 adjust_address (target, TYPE_MODE (valtype), 0),
7408 modifier == EXPAND_STACK_PARM);
7412 gcc_assert (REG_P (target));
7414 /* Store this field into a union of the proper type. */
7415 store_field (target,
7416 MIN ((int_size_in_bytes (TREE_TYPE
7417 (TREE_OPERAND (exp, 0)))
7419 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7420 0, TYPE_MODE (valtype), TREE_OPERAND (exp, 0),
7424 /* Return the entire union. */
7428 if (mode == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))
7430 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode,
7433 /* If the signedness of the conversion differs and OP0 is
7434 a promoted SUBREG, clear that indication since we now
7435 have to do the proper extension. */
7436 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) != unsignedp
7437 && GET_CODE (op0) == SUBREG)
7438 SUBREG_PROMOTED_VAR_P (op0) = 0;
7440 return REDUCE_BIT_FIELD (op0);
7443 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7444 if (GET_MODE (op0) == mode)
7447 /* If OP0 is a constant, just convert it into the proper mode. */
7448 else if (CONSTANT_P (op0))
7450 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7451 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7453 if (modifier == EXPAND_INITIALIZER)
7454 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7455 subreg_lowpart_offset (mode,
7458 op0= convert_modes (mode, inner_mode, op0,
7459 TYPE_UNSIGNED (inner_type));
7462 else if (modifier == EXPAND_INITIALIZER)
7463 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7465 else if (target == 0)
7466 op0 = convert_to_mode (mode, op0,
7467 TYPE_UNSIGNED (TREE_TYPE
7468 (TREE_OPERAND (exp, 0))));
7471 convert_move (target, op0,
7472 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7476 return REDUCE_BIT_FIELD (op0);
7478 case VIEW_CONVERT_EXPR:
7479 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7481 /* If the input and output modes are both the same, we are done.
7482 Otherwise, if neither mode is BLKmode and both are integral and within
7483 a word, we can use gen_lowpart. If neither is true, make sure the
7484 operand is in memory and convert the MEM to the new mode. */
7485 if (TYPE_MODE (type) == GET_MODE (op0))
7487 else if (TYPE_MODE (type) != BLKmode && GET_MODE (op0) != BLKmode
7488 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7489 && GET_MODE_CLASS (TYPE_MODE (type)) == MODE_INT
7490 && GET_MODE_SIZE (TYPE_MODE (type)) <= UNITS_PER_WORD
7491 && GET_MODE_SIZE (GET_MODE (op0)) <= UNITS_PER_WORD)
7492 op0 = gen_lowpart (TYPE_MODE (type), op0);
7493 else if (!MEM_P (op0))
7495 /* If the operand is not a MEM, force it into memory. Since we
7496 are going to be be changing the mode of the MEM, don't call
7497 force_const_mem for constants because we don't allow pool
7498 constants to change mode. */
7499 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7501 gcc_assert (!TREE_ADDRESSABLE (exp));
7503 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
7505 = assign_stack_temp_for_type
7506 (TYPE_MODE (inner_type),
7507 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
7509 emit_move_insn (target, op0);
7513 /* At this point, OP0 is in the correct mode. If the output type is such
7514 that the operand is known to be aligned, indicate that it is.
7515 Otherwise, we need only be concerned about alignment for non-BLKmode
7519 op0 = copy_rtx (op0);
7521 if (TYPE_ALIGN_OK (type))
7522 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
7523 else if (TYPE_MODE (type) != BLKmode && STRICT_ALIGNMENT
7524 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (TYPE_MODE (type)))
7526 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7527 HOST_WIDE_INT temp_size
7528 = MAX (int_size_in_bytes (inner_type),
7529 (HOST_WIDE_INT) GET_MODE_SIZE (TYPE_MODE (type)));
7530 rtx new = assign_stack_temp_for_type (TYPE_MODE (type),
7531 temp_size, 0, type);
7532 rtx new_with_op0_mode = adjust_address (new, GET_MODE (op0), 0);
7534 gcc_assert (!TREE_ADDRESSABLE (exp));
7536 if (GET_MODE (op0) == BLKmode)
7537 emit_block_move (new_with_op0_mode, op0,
7538 GEN_INT (GET_MODE_SIZE (TYPE_MODE (type))),
7539 (modifier == EXPAND_STACK_PARM
7540 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
7542 emit_move_insn (new_with_op0_mode, op0);
7547 op0 = adjust_address (op0, TYPE_MODE (type), 0);
7553 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7554 something else, make sure we add the register to the constant and
7555 then to the other thing. This case can occur during strength
7556 reduction and doing it this way will produce better code if the
7557 frame pointer or argument pointer is eliminated.
7559 fold-const.c will ensure that the constant is always in the inner
7560 PLUS_EXPR, so the only case we need to do anything about is if
7561 sp, ap, or fp is our second argument, in which case we must swap
7562 the innermost first argument and our second argument. */
7564 if (TREE_CODE (TREE_OPERAND (exp, 0)) == PLUS_EXPR
7565 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 1)) == INTEGER_CST
7566 && TREE_CODE (TREE_OPERAND (exp, 1)) == VAR_DECL
7567 && (DECL_RTL (TREE_OPERAND (exp, 1)) == frame_pointer_rtx
7568 || DECL_RTL (TREE_OPERAND (exp, 1)) == stack_pointer_rtx
7569 || DECL_RTL (TREE_OPERAND (exp, 1)) == arg_pointer_rtx))
7571 tree t = TREE_OPERAND (exp, 1);
7573 TREE_OPERAND (exp, 1) = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
7574 TREE_OPERAND (TREE_OPERAND (exp, 0), 0) = t;
7577 /* If the result is to be ptr_mode and we are adding an integer to
7578 something, we might be forming a constant. So try to use
7579 plus_constant. If it produces a sum and we can't accept it,
7580 use force_operand. This allows P = &ARR[const] to generate
7581 efficient code on machines where a SYMBOL_REF is not a valid
7584 If this is an EXPAND_SUM call, always return the sum. */
7585 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7586 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7588 if (modifier == EXPAND_STACK_PARM)
7590 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
7591 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7592 && TREE_CONSTANT (TREE_OPERAND (exp, 1)))
7596 op1 = expand_expr (TREE_OPERAND (exp, 1), subtarget, VOIDmode,
7598 /* Use immed_double_const to ensure that the constant is
7599 truncated according to the mode of OP1, then sign extended
7600 to a HOST_WIDE_INT. Using the constant directly can result
7601 in non-canonical RTL in a 64x32 cross compile. */
7603 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 0)),
7605 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))));
7606 op1 = plus_constant (op1, INTVAL (constant_part));
7607 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7608 op1 = force_operand (op1, target);
7609 return REDUCE_BIT_FIELD (op1);
7612 else if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7613 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_INT
7614 && TREE_CONSTANT (TREE_OPERAND (exp, 0)))
7618 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7619 (modifier == EXPAND_INITIALIZER
7620 ? EXPAND_INITIALIZER : EXPAND_SUM));
7621 if (! CONSTANT_P (op0))
7623 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7624 VOIDmode, modifier);
7625 /* Return a PLUS if modifier says it's OK. */
7626 if (modifier == EXPAND_SUM
7627 || modifier == EXPAND_INITIALIZER)
7628 return simplify_gen_binary (PLUS, mode, op0, op1);
7631 /* Use immed_double_const to ensure that the constant is
7632 truncated according to the mode of OP1, then sign extended
7633 to a HOST_WIDE_INT. Using the constant directly can result
7634 in non-canonical RTL in a 64x32 cross compile. */
7636 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)),
7638 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))));
7639 op0 = plus_constant (op0, INTVAL (constant_part));
7640 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7641 op0 = force_operand (op0, target);
7642 return REDUCE_BIT_FIELD (op0);
7646 /* No sense saving up arithmetic to be done
7647 if it's all in the wrong mode to form part of an address.
7648 And force_operand won't know whether to sign-extend or
7650 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7651 || mode != ptr_mode)
7653 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7654 subtarget, &op0, &op1, 0);
7655 if (op0 == const0_rtx)
7657 if (op1 == const0_rtx)
7662 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7663 subtarget, &op0, &op1, modifier);
7664 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7667 /* For initializers, we are allowed to return a MINUS of two
7668 symbolic constants. Here we handle all cases when both operands
7670 /* Handle difference of two symbolic constants,
7671 for the sake of an initializer. */
7672 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7673 && really_constant_p (TREE_OPERAND (exp, 0))
7674 && really_constant_p (TREE_OPERAND (exp, 1)))
7676 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7677 NULL_RTX, &op0, &op1, modifier);
7679 /* If the last operand is a CONST_INT, use plus_constant of
7680 the negated constant. Else make the MINUS. */
7681 if (GET_CODE (op1) == CONST_INT)
7682 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7684 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7687 /* No sense saving up arithmetic to be done
7688 if it's all in the wrong mode to form part of an address.
7689 And force_operand won't know whether to sign-extend or
7691 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7692 || mode != ptr_mode)
7695 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7696 subtarget, &op0, &op1, modifier);
7698 /* Convert A - const to A + (-const). */
7699 if (GET_CODE (op1) == CONST_INT)
7701 op1 = negate_rtx (mode, op1);
7702 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7708 /* If first operand is constant, swap them.
7709 Thus the following special case checks need only
7710 check the second operand. */
7711 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
7713 tree t1 = TREE_OPERAND (exp, 0);
7714 TREE_OPERAND (exp, 0) = TREE_OPERAND (exp, 1);
7715 TREE_OPERAND (exp, 1) = t1;
7718 /* Attempt to return something suitable for generating an
7719 indexed address, for machines that support that. */
7721 if (modifier == EXPAND_SUM && mode == ptr_mode
7722 && host_integerp (TREE_OPERAND (exp, 1), 0))
7724 tree exp1 = TREE_OPERAND (exp, 1);
7726 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7730 op0 = force_operand (op0, NULL_RTX);
7732 op0 = copy_to_mode_reg (mode, op0);
7734 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7735 gen_int_mode (tree_low_cst (exp1, 0),
7736 TYPE_MODE (TREE_TYPE (exp1)))));
7739 if (modifier == EXPAND_STACK_PARM)
7742 /* Check for multiplying things that have been extended
7743 from a narrower type. If this machine supports multiplying
7744 in that narrower type with a result in the desired type,
7745 do it that way, and avoid the explicit type-conversion. */
7746 if (TREE_CODE (TREE_OPERAND (exp, 0)) == NOP_EXPR
7747 && TREE_CODE (type) == INTEGER_TYPE
7748 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7749 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))
7750 && ((TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7751 && int_fits_type_p (TREE_OPERAND (exp, 1),
7752 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7753 /* Don't use a widening multiply if a shift will do. */
7754 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))))
7755 > HOST_BITS_PER_WIDE_INT)
7756 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))) < 0))
7758 (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7759 && (TYPE_PRECISION (TREE_TYPE
7760 (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7761 == TYPE_PRECISION (TREE_TYPE
7763 (TREE_OPERAND (exp, 0), 0))))
7764 /* If both operands are extended, they must either both
7765 be zero-extended or both be sign-extended. */
7766 && (TYPE_UNSIGNED (TREE_TYPE
7767 (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7768 == TYPE_UNSIGNED (TREE_TYPE
7770 (TREE_OPERAND (exp, 0), 0)))))))
7772 tree op0type = TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0));
7773 enum machine_mode innermode = TYPE_MODE (op0type);
7774 bool zextend_p = TYPE_UNSIGNED (op0type);
7775 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7776 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7778 if (mode == GET_MODE_2XWIDER_MODE (innermode))
7780 if (this_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
7782 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7783 expand_operands (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7784 TREE_OPERAND (exp, 1),
7785 NULL_RTX, &op0, &op1, 0);
7787 expand_operands (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7788 TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7789 NULL_RTX, &op0, &op1, 0);
7792 else if (other_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
7793 && innermode == word_mode)
7796 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7797 NULL_RTX, VOIDmode, 0);
7798 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7799 op1 = convert_modes (innermode, mode,
7800 expand_expr (TREE_OPERAND (exp, 1),
7801 NULL_RTX, VOIDmode, 0),
7804 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7805 NULL_RTX, VOIDmode, 0);
7806 temp = expand_binop (mode, other_optab, op0, op1, target,
7807 unsignedp, OPTAB_LIB_WIDEN);
7808 hipart = gen_highpart (innermode, temp);
7809 htem = expand_mult_highpart_adjust (innermode, hipart,
7813 emit_move_insn (hipart, htem);
7814 return REDUCE_BIT_FIELD (temp);
7818 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7819 subtarget, &op0, &op1, 0);
7820 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7822 case TRUNC_DIV_EXPR:
7823 case FLOOR_DIV_EXPR:
7825 case ROUND_DIV_EXPR:
7826 case EXACT_DIV_EXPR:
7827 if (modifier == EXPAND_STACK_PARM)
7829 /* Possible optimization: compute the dividend with EXPAND_SUM
7830 then if the divisor is constant can optimize the case
7831 where some terms of the dividend have coeffs divisible by it. */
7832 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7833 subtarget, &op0, &op1, 0);
7834 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7839 case TRUNC_MOD_EXPR:
7840 case FLOOR_MOD_EXPR:
7842 case ROUND_MOD_EXPR:
7843 if (modifier == EXPAND_STACK_PARM)
7845 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7846 subtarget, &op0, &op1, 0);
7847 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7849 case FIX_ROUND_EXPR:
7850 case FIX_FLOOR_EXPR:
7852 gcc_unreachable (); /* Not used for C. */
7854 case FIX_TRUNC_EXPR:
7855 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7856 if (target == 0 || modifier == EXPAND_STACK_PARM)
7857 target = gen_reg_rtx (mode);
7858 expand_fix (target, op0, unsignedp);
7862 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7863 if (target == 0 || modifier == EXPAND_STACK_PARM)
7864 target = gen_reg_rtx (mode);
7865 /* expand_float can't figure out what to do if FROM has VOIDmode.
7866 So give it the correct mode. With -O, cse will optimize this. */
7867 if (GET_MODE (op0) == VOIDmode)
7868 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7870 expand_float (target, op0,
7871 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7875 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7876 if (modifier == EXPAND_STACK_PARM)
7878 temp = expand_unop (mode,
7879 optab_for_tree_code (NEGATE_EXPR, type),
7882 return REDUCE_BIT_FIELD (temp);
7885 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7886 if (modifier == EXPAND_STACK_PARM)
7889 /* ABS_EXPR is not valid for complex arguments. */
7890 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7891 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
7893 /* Unsigned abs is simply the operand. Testing here means we don't
7894 risk generating incorrect code below. */
7895 if (TYPE_UNSIGNED (type))
7898 return expand_abs (mode, op0, target, unsignedp,
7899 safe_from_p (target, TREE_OPERAND (exp, 0), 1));
7903 target = original_target;
7905 || modifier == EXPAND_STACK_PARM
7906 || (MEM_P (target) && MEM_VOLATILE_P (target))
7907 || GET_MODE (target) != mode
7909 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7910 target = gen_reg_rtx (mode);
7911 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7912 target, &op0, &op1, 0);
7914 /* First try to do it with a special MIN or MAX instruction.
7915 If that does not win, use a conditional jump to select the proper
7917 this_optab = optab_for_tree_code (code, type);
7918 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7923 /* At this point, a MEM target is no longer useful; we will get better
7926 if (! REG_P (target))
7927 target = gen_reg_rtx (mode);
7929 /* If op1 was placed in target, swap op0 and op1. */
7930 if (target != op0 && target == op1)
7937 /* We generate better code and avoid problems with op1 mentioning
7938 target by forcing op1 into a pseudo if it isn't a constant. */
7939 if (! CONSTANT_P (op1))
7940 op1 = force_reg (mode, op1);
7942 #ifdef HAVE_conditional_move
7943 /* Use a conditional move if possible. */
7944 if (can_conditionally_move_p (mode))
7946 enum rtx_code comparison_code;
7949 if (code == MAX_EXPR)
7950 comparison_code = unsignedp ? GEU : GE;
7952 comparison_code = unsignedp ? LEU : LE;
7954 /* ??? Same problem as in expmed.c: emit_conditional_move
7955 forces a stack adjustment via compare_from_rtx, and we
7956 lose the stack adjustment if the sequence we are about
7957 to create is discarded. */
7958 do_pending_stack_adjust ();
7962 /* Try to emit the conditional move. */
7963 insn = emit_conditional_move (target, comparison_code,
7968 /* If we could do the conditional move, emit the sequence,
7972 rtx seq = get_insns ();
7978 /* Otherwise discard the sequence and fall back to code with
7984 emit_move_insn (target, op0);
7986 temp = gen_label_rtx ();
7988 /* If this mode is an integer too wide to compare properly,
7989 compare word by word. Rely on cse to optimize constant cases. */
7990 if (GET_MODE_CLASS (mode) == MODE_INT
7991 && ! can_compare_p (GE, mode, ccp_jump))
7993 if (code == MAX_EXPR)
7994 do_jump_by_parts_greater_rtx (mode, unsignedp, target, op1,
7997 do_jump_by_parts_greater_rtx (mode, unsignedp, op1, target,
8002 do_compare_rtx_and_jump (target, op1, code == MAX_EXPR ? GE : LE,
8003 unsignedp, mode, NULL_RTX, NULL_RTX, temp);
8005 emit_move_insn (target, op1);
8010 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8011 if (modifier == EXPAND_STACK_PARM)
8013 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
8017 /* ??? Can optimize bitwise operations with one arg constant.
8018 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8019 and (a bitwise1 b) bitwise2 b (etc)
8020 but that is probably not worth while. */
8022 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8023 boolean values when we want in all cases to compute both of them. In
8024 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8025 as actual zero-or-1 values and then bitwise anding. In cases where
8026 there cannot be any side effects, better code would be made by
8027 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8028 how to recognize those cases. */
8030 case TRUTH_AND_EXPR:
8031 code = BIT_AND_EXPR;
8036 code = BIT_IOR_EXPR;
8040 case TRUTH_XOR_EXPR:
8041 code = BIT_XOR_EXPR;
8049 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
8051 if (modifier == EXPAND_STACK_PARM)
8053 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8054 return expand_shift (code, mode, op0, TREE_OPERAND (exp, 1), target,
8057 /* Could determine the answer when only additive constants differ. Also,
8058 the addition of one can be handled by changing the condition. */
8065 case UNORDERED_EXPR:
8073 temp = do_store_flag (exp,
8074 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8075 tmode != VOIDmode ? tmode : mode, 0);
8079 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
8080 if (code == NE_EXPR && integer_zerop (TREE_OPERAND (exp, 1))
8082 && REG_P (original_target)
8083 && (GET_MODE (original_target)
8084 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))))
8086 temp = expand_expr (TREE_OPERAND (exp, 0), original_target,
8089 /* If temp is constant, we can just compute the result. */
8090 if (GET_CODE (temp) == CONST_INT)
8092 if (INTVAL (temp) != 0)
8093 emit_move_insn (target, const1_rtx);
8095 emit_move_insn (target, const0_rtx);
8100 if (temp != original_target)
8102 enum machine_mode mode1 = GET_MODE (temp);
8103 if (mode1 == VOIDmode)
8104 mode1 = tmode != VOIDmode ? tmode : mode;
8106 temp = copy_to_mode_reg (mode1, temp);
8109 op1 = gen_label_rtx ();
8110 emit_cmp_and_jump_insns (temp, const0_rtx, EQ, NULL_RTX,
8111 GET_MODE (temp), unsignedp, op1);
8112 emit_move_insn (temp, const1_rtx);
8117 /* If no set-flag instruction, must generate a conditional store
8118 into a temporary variable. Drop through and handle this
8123 || modifier == EXPAND_STACK_PARM
8124 || ! safe_from_p (target, exp, 1)
8125 /* Make sure we don't have a hard reg (such as function's return
8126 value) live across basic blocks, if not optimizing. */
8127 || (!optimize && REG_P (target)
8128 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8129 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8132 emit_move_insn (target, const0_rtx);
8134 op1 = gen_label_rtx ();
8135 jumpifnot (exp, op1);
8138 emit_move_insn (target, const1_rtx);
8141 return ignore ? const0_rtx : target;
8143 case TRUTH_NOT_EXPR:
8144 if (modifier == EXPAND_STACK_PARM)
8146 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
8147 /* The parser is careful to generate TRUTH_NOT_EXPR
8148 only with operands that are always zero or one. */
8149 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8150 target, 1, OPTAB_LIB_WIDEN);
8154 case STATEMENT_LIST:
8156 tree_stmt_iterator iter;
8158 gcc_assert (ignore);
8160 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
8161 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
8166 /* A COND_EXPR with its type being VOID_TYPE represents a
8167 conditional jump and is handled in
8168 expand_gimple_cond_expr. */
8169 gcc_assert (!VOID_TYPE_P (TREE_TYPE (exp)));
8171 /* Note that COND_EXPRs whose type is a structure or union
8172 are required to be constructed to contain assignments of
8173 a temporary variable, so that we can evaluate them here
8174 for side effect only. If type is void, we must do likewise. */
8176 gcc_assert (!TREE_ADDRESSABLE (type)
8178 && TREE_TYPE (TREE_OPERAND (exp, 1)) != void_type_node
8179 && TREE_TYPE (TREE_OPERAND (exp, 2)) != void_type_node);
8181 /* If we are not to produce a result, we have no target. Otherwise,
8182 if a target was specified use it; it will not be used as an
8183 intermediate target unless it is safe. If no target, use a
8186 if (modifier != EXPAND_STACK_PARM
8188 && safe_from_p (original_target, TREE_OPERAND (exp, 0), 1)
8189 && GET_MODE (original_target) == mode
8190 #ifdef HAVE_conditional_move
8191 && (! can_conditionally_move_p (mode)
8192 || REG_P (original_target))
8194 && !MEM_P (original_target))
8195 temp = original_target;
8197 temp = assign_temp (type, 0, 0, 1);
8199 do_pending_stack_adjust ();
8201 op0 = gen_label_rtx ();
8202 op1 = gen_label_rtx ();
8203 jumpifnot (TREE_OPERAND (exp, 0), op0);
8204 store_expr (TREE_OPERAND (exp, 1), temp,
8205 modifier == EXPAND_STACK_PARM);
8207 emit_jump_insn (gen_jump (op1));
8210 store_expr (TREE_OPERAND (exp, 2), temp,
8211 modifier == EXPAND_STACK_PARM);
8218 target = expand_vec_cond_expr (exp, target);
8223 tree lhs = TREE_OPERAND (exp, 0);
8224 tree rhs = TREE_OPERAND (exp, 1);
8226 gcc_assert (ignore);
8228 /* Check for |= or &= of a bitfield of size one into another bitfield
8229 of size 1. In this case, (unless we need the result of the
8230 assignment) we can do this more efficiently with a
8231 test followed by an assignment, if necessary.
8233 ??? At this point, we can't get a BIT_FIELD_REF here. But if
8234 things change so we do, this code should be enhanced to
8236 if (TREE_CODE (lhs) == COMPONENT_REF
8237 && (TREE_CODE (rhs) == BIT_IOR_EXPR
8238 || TREE_CODE (rhs) == BIT_AND_EXPR)
8239 && TREE_OPERAND (rhs, 0) == lhs
8240 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
8241 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
8242 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
8244 rtx label = gen_label_rtx ();
8246 do_jump (TREE_OPERAND (rhs, 1),
8247 TREE_CODE (rhs) == BIT_IOR_EXPR ? label : 0,
8248 TREE_CODE (rhs) == BIT_AND_EXPR ? label : 0);
8249 expand_assignment (lhs, convert (TREE_TYPE (rhs),
8250 (TREE_CODE (rhs) == BIT_IOR_EXPR
8252 : integer_zero_node)));
8253 do_pending_stack_adjust ();
8258 expand_assignment (lhs, rhs);
8264 if (!TREE_OPERAND (exp, 0))
8265 expand_null_return ();
8267 expand_return (TREE_OPERAND (exp, 0));
8271 return expand_expr_addr_expr (exp, target, tmode, modifier);
8274 /* Get the rtx code of the operands. */
8275 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8276 op1 = expand_expr (TREE_OPERAND (exp, 1), 0, VOIDmode, 0);
8279 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
8281 /* Move the real (op0) and imaginary (op1) parts to their location. */
8282 write_complex_part (target, op0, false);
8283 write_complex_part (target, op1, true);
8288 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8289 return read_complex_part (op0, false);
8292 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8293 return read_complex_part (op0, true);
8296 expand_resx_expr (exp);
8299 case TRY_CATCH_EXPR:
8301 case EH_FILTER_EXPR:
8302 case TRY_FINALLY_EXPR:
8303 /* Lowered by tree-eh.c. */
8306 case WITH_CLEANUP_EXPR:
8307 case CLEANUP_POINT_EXPR:
8309 case CASE_LABEL_EXPR:
8315 case PREINCREMENT_EXPR:
8316 case PREDECREMENT_EXPR:
8317 case POSTINCREMENT_EXPR:
8318 case POSTDECREMENT_EXPR:
8321 case TRUTH_ANDIF_EXPR:
8322 case TRUTH_ORIF_EXPR:
8323 /* Lowered by gimplify.c. */
8327 return get_exception_pointer (cfun);
8330 return get_exception_filter (cfun);
8333 /* Function descriptors are not valid except for as
8334 initialization constants, and should not be expanded. */
8342 expand_label (TREE_OPERAND (exp, 0));
8346 expand_asm_expr (exp);
8349 case WITH_SIZE_EXPR:
8350 /* WITH_SIZE_EXPR expands to its first argument. The caller should
8351 have pulled out the size to use in whatever context it needed. */
8352 return expand_expr_real (TREE_OPERAND (exp, 0), original_target, tmode,
8355 case REALIGN_LOAD_EXPR:
8357 tree oprnd0 = TREE_OPERAND (exp, 0);
8358 tree oprnd1 = TREE_OPERAND (exp, 1);
8359 tree oprnd2 = TREE_OPERAND (exp, 2);
8362 this_optab = optab_for_tree_code (code, type);
8363 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, 0);
8364 op2 = expand_expr (oprnd2, NULL_RTX, VOIDmode, 0);
8365 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
8371 case REDUC_MAX_EXPR:
8372 case REDUC_MIN_EXPR:
8373 case REDUC_PLUS_EXPR:
8375 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
8376 this_optab = optab_for_tree_code (code, type);
8377 temp = expand_unop (mode, this_optab, op0, target, unsignedp);
8382 case VEC_LSHIFT_EXPR:
8383 case VEC_RSHIFT_EXPR:
8385 target = expand_vec_shift_expr (exp, target);
8390 return lang_hooks.expand_expr (exp, original_target, tmode,
8394 /* Here to do an ordinary binary operator. */
8396 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
8397 subtarget, &op0, &op1, 0);
8399 this_optab = optab_for_tree_code (code, type);
8401 if (modifier == EXPAND_STACK_PARM)
8403 temp = expand_binop (mode, this_optab, op0, op1, target,
8404 unsignedp, OPTAB_LIB_WIDEN);
8406 return REDUCE_BIT_FIELD (temp);
8408 #undef REDUCE_BIT_FIELD
8410 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
8411 signedness of TYPE), possibly returning the result in TARGET. */
8413 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
8415 HOST_WIDE_INT prec = TYPE_PRECISION (type);
8416 if (target && GET_MODE (target) != GET_MODE (exp))
8418 if (TYPE_UNSIGNED (type))
8421 if (prec < HOST_BITS_PER_WIDE_INT)
8422 mask = immed_double_const (((unsigned HOST_WIDE_INT) 1 << prec) - 1, 0,
8425 mask = immed_double_const ((unsigned HOST_WIDE_INT) -1,
8426 ((unsigned HOST_WIDE_INT) 1
8427 << (prec - HOST_BITS_PER_WIDE_INT)) - 1,
8429 return expand_and (GET_MODE (exp), exp, mask, target);
8433 tree count = build_int_cst (NULL_TREE,
8434 GET_MODE_BITSIZE (GET_MODE (exp)) - prec);
8435 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
8436 return expand_shift (RSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
8440 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
8441 when applied to the address of EXP produces an address known to be
8442 aligned more than BIGGEST_ALIGNMENT. */
8445 is_aligning_offset (tree offset, tree exp)
8447 /* Strip off any conversions. */
8448 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8449 || TREE_CODE (offset) == NOP_EXPR
8450 || TREE_CODE (offset) == CONVERT_EXPR)
8451 offset = TREE_OPERAND (offset, 0);
8453 /* We must now have a BIT_AND_EXPR with a constant that is one less than
8454 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
8455 if (TREE_CODE (offset) != BIT_AND_EXPR
8456 || !host_integerp (TREE_OPERAND (offset, 1), 1)
8457 || compare_tree_int (TREE_OPERAND (offset, 1),
8458 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
8459 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
8462 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
8463 It must be NEGATE_EXPR. Then strip any more conversions. */
8464 offset = TREE_OPERAND (offset, 0);
8465 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8466 || TREE_CODE (offset) == NOP_EXPR
8467 || TREE_CODE (offset) == CONVERT_EXPR)
8468 offset = TREE_OPERAND (offset, 0);
8470 if (TREE_CODE (offset) != NEGATE_EXPR)
8473 offset = TREE_OPERAND (offset, 0);
8474 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8475 || TREE_CODE (offset) == NOP_EXPR
8476 || TREE_CODE (offset) == CONVERT_EXPR)
8477 offset = TREE_OPERAND (offset, 0);
8479 /* This must now be the address of EXP. */
8480 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
8483 /* Return the tree node if an ARG corresponds to a string constant or zero
8484 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
8485 in bytes within the string that ARG is accessing. The type of the
8486 offset will be `sizetype'. */
8489 string_constant (tree arg, tree *ptr_offset)
8494 if (TREE_CODE (arg) == ADDR_EXPR)
8496 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
8498 *ptr_offset = size_zero_node;
8499 return TREE_OPERAND (arg, 0);
8501 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
8503 array = TREE_OPERAND (arg, 0);
8504 offset = size_zero_node;
8506 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
8508 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
8509 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
8510 if (TREE_CODE (array) != STRING_CST
8511 && TREE_CODE (array) != VAR_DECL)
8517 else if (TREE_CODE (arg) == PLUS_EXPR)
8519 tree arg0 = TREE_OPERAND (arg, 0);
8520 tree arg1 = TREE_OPERAND (arg, 1);
8525 if (TREE_CODE (arg0) == ADDR_EXPR
8526 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
8527 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
8529 array = TREE_OPERAND (arg0, 0);
8532 else if (TREE_CODE (arg1) == ADDR_EXPR
8533 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
8534 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
8536 array = TREE_OPERAND (arg1, 0);
8545 if (TREE_CODE (array) == STRING_CST)
8547 *ptr_offset = convert (sizetype, offset);
8550 else if (TREE_CODE (array) == VAR_DECL)
8554 /* Variables initialized to string literals can be handled too. */
8555 if (DECL_INITIAL (array) == NULL_TREE
8556 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
8559 /* If they are read-only, non-volatile and bind locally. */
8560 if (! TREE_READONLY (array)
8561 || TREE_SIDE_EFFECTS (array)
8562 || ! targetm.binds_local_p (array))
8565 /* Avoid const char foo[4] = "abcde"; */
8566 if (DECL_SIZE_UNIT (array) == NULL_TREE
8567 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
8568 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
8569 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
8572 /* If variable is bigger than the string literal, OFFSET must be constant
8573 and inside of the bounds of the string literal. */
8574 offset = convert (sizetype, offset);
8575 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
8576 && (! host_integerp (offset, 1)
8577 || compare_tree_int (offset, length) >= 0))
8580 *ptr_offset = offset;
8581 return DECL_INITIAL (array);
8587 /* Generate code to calculate EXP using a store-flag instruction
8588 and return an rtx for the result. EXP is either a comparison
8589 or a TRUTH_NOT_EXPR whose operand is a comparison.
8591 If TARGET is nonzero, store the result there if convenient.
8593 If ONLY_CHEAP is nonzero, only do this if it is likely to be very
8596 Return zero if there is no suitable set-flag instruction
8597 available on this machine.
8599 Once expand_expr has been called on the arguments of the comparison,
8600 we are committed to doing the store flag, since it is not safe to
8601 re-evaluate the expression. We emit the store-flag insn by calling
8602 emit_store_flag, but only expand the arguments if we have a reason
8603 to believe that emit_store_flag will be successful. If we think that
8604 it will, but it isn't, we have to simulate the store-flag with a
8605 set/jump/set sequence. */
8608 do_store_flag (tree exp, rtx target, enum machine_mode mode, int only_cheap)
8611 tree arg0, arg1, type;
8613 enum machine_mode operand_mode;
8617 enum insn_code icode;
8618 rtx subtarget = target;
8621 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
8622 result at the end. We can't simply invert the test since it would
8623 have already been inverted if it were valid. This case occurs for
8624 some floating-point comparisons. */
8626 if (TREE_CODE (exp) == TRUTH_NOT_EXPR)
8627 invert = 1, exp = TREE_OPERAND (exp, 0);
8629 arg0 = TREE_OPERAND (exp, 0);
8630 arg1 = TREE_OPERAND (exp, 1);
8632 /* Don't crash if the comparison was erroneous. */
8633 if (arg0 == error_mark_node || arg1 == error_mark_node)
8636 type = TREE_TYPE (arg0);
8637 operand_mode = TYPE_MODE (type);
8638 unsignedp = TYPE_UNSIGNED (type);
8640 /* We won't bother with BLKmode store-flag operations because it would mean
8641 passing a lot of information to emit_store_flag. */
8642 if (operand_mode == BLKmode)
8645 /* We won't bother with store-flag operations involving function pointers
8646 when function pointers must be canonicalized before comparisons. */
8647 #ifdef HAVE_canonicalize_funcptr_for_compare
8648 if (HAVE_canonicalize_funcptr_for_compare
8649 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
8650 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
8652 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
8653 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
8654 == FUNCTION_TYPE))))
8661 /* Get the rtx comparison code to use. We know that EXP is a comparison
8662 operation of some type. Some comparisons against 1 and -1 can be
8663 converted to comparisons with zero. Do so here so that the tests
8664 below will be aware that we have a comparison with zero. These
8665 tests will not catch constants in the first operand, but constants
8666 are rarely passed as the first operand. */
8668 switch (TREE_CODE (exp))
8677 if (integer_onep (arg1))
8678 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
8680 code = unsignedp ? LTU : LT;
8683 if (! unsignedp && integer_all_onesp (arg1))
8684 arg1 = integer_zero_node, code = LT;
8686 code = unsignedp ? LEU : LE;
8689 if (! unsignedp && integer_all_onesp (arg1))
8690 arg1 = integer_zero_node, code = GE;
8692 code = unsignedp ? GTU : GT;
8695 if (integer_onep (arg1))
8696 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
8698 code = unsignedp ? GEU : GE;
8701 case UNORDERED_EXPR:
8730 /* Put a constant second. */
8731 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST)
8733 tem = arg0; arg0 = arg1; arg1 = tem;
8734 code = swap_condition (code);
8737 /* If this is an equality or inequality test of a single bit, we can
8738 do this by shifting the bit being tested to the low-order bit and
8739 masking the result with the constant 1. If the condition was EQ,
8740 we xor it with 1. This does not require an scc insn and is faster
8741 than an scc insn even if we have it.
8743 The code to make this transformation was moved into fold_single_bit_test,
8744 so we just call into the folder and expand its result. */
8746 if ((code == NE || code == EQ)
8747 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
8748 && integer_pow2p (TREE_OPERAND (arg0, 1)))
8750 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
8751 return expand_expr (fold_single_bit_test (code == NE ? NE_EXPR : EQ_EXPR,
8753 target, VOIDmode, EXPAND_NORMAL);
8756 /* Now see if we are likely to be able to do this. Return if not. */
8757 if (! can_compare_p (code, operand_mode, ccp_store_flag))
8760 icode = setcc_gen_code[(int) code];
8761 if (icode == CODE_FOR_nothing
8762 || (only_cheap && insn_data[(int) icode].operand[0].mode != mode))
8764 /* We can only do this if it is one of the special cases that
8765 can be handled without an scc insn. */
8766 if ((code == LT && integer_zerop (arg1))
8767 || (! only_cheap && code == GE && integer_zerop (arg1)))
8769 else if (! only_cheap && (code == NE || code == EQ)
8770 && TREE_CODE (type) != REAL_TYPE
8771 && ((abs_optab->handlers[(int) operand_mode].insn_code
8772 != CODE_FOR_nothing)
8773 || (ffs_optab->handlers[(int) operand_mode].insn_code
8774 != CODE_FOR_nothing)))
8780 if (! get_subtarget (target)
8781 || GET_MODE (subtarget) != operand_mode)
8784 expand_operands (arg0, arg1, subtarget, &op0, &op1, 0);
8787 target = gen_reg_rtx (mode);
8789 result = emit_store_flag (target, code, op0, op1,
8790 operand_mode, unsignedp, 1);
8795 result = expand_binop (mode, xor_optab, result, const1_rtx,
8796 result, 0, OPTAB_LIB_WIDEN);
8800 /* If this failed, we have to do this with set/compare/jump/set code. */
8802 || reg_mentioned_p (target, op0) || reg_mentioned_p (target, op1))
8803 target = gen_reg_rtx (GET_MODE (target));
8805 emit_move_insn (target, invert ? const0_rtx : const1_rtx);
8806 result = compare_from_rtx (op0, op1, code, unsignedp,
8807 operand_mode, NULL_RTX);
8808 if (GET_CODE (result) == CONST_INT)
8809 return (((result == const0_rtx && ! invert)
8810 || (result != const0_rtx && invert))
8811 ? const0_rtx : const1_rtx);
8813 /* The code of RESULT may not match CODE if compare_from_rtx
8814 decided to swap its operands and reverse the original code.
8816 We know that compare_from_rtx returns either a CONST_INT or
8817 a new comparison code, so it is safe to just extract the
8818 code from RESULT. */
8819 code = GET_CODE (result);
8821 label = gen_label_rtx ();
8822 gcc_assert (bcc_gen_fctn[(int) code]);
8824 emit_jump_insn ((*bcc_gen_fctn[(int) code]) (label));
8825 emit_move_insn (target, invert ? const1_rtx : const0_rtx);
8832 /* Stubs in case we haven't got a casesi insn. */
8834 # define HAVE_casesi 0
8835 # define gen_casesi(a, b, c, d, e) (0)
8836 # define CODE_FOR_casesi CODE_FOR_nothing
8839 /* If the machine does not have a case insn that compares the bounds,
8840 this means extra overhead for dispatch tables, which raises the
8841 threshold for using them. */
8842 #ifndef CASE_VALUES_THRESHOLD
8843 #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5)
8844 #endif /* CASE_VALUES_THRESHOLD */
8847 case_values_threshold (void)
8849 return CASE_VALUES_THRESHOLD;
8852 /* Attempt to generate a casesi instruction. Returns 1 if successful,
8853 0 otherwise (i.e. if there is no casesi instruction). */
8855 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
8856 rtx table_label ATTRIBUTE_UNUSED, rtx default_label)
8858 enum machine_mode index_mode = SImode;
8859 int index_bits = GET_MODE_BITSIZE (index_mode);
8860 rtx op1, op2, index;
8861 enum machine_mode op_mode;
8866 /* Convert the index to SImode. */
8867 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
8869 enum machine_mode omode = TYPE_MODE (index_type);
8870 rtx rangertx = expand_expr (range, NULL_RTX, VOIDmode, 0);
8872 /* We must handle the endpoints in the original mode. */
8873 index_expr = build2 (MINUS_EXPR, index_type,
8874 index_expr, minval);
8875 minval = integer_zero_node;
8876 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
8877 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
8878 omode, 1, default_label);
8879 /* Now we can safely truncate. */
8880 index = convert_to_mode (index_mode, index, 0);
8884 if (TYPE_MODE (index_type) != index_mode)
8886 index_expr = convert (lang_hooks.types.type_for_size
8887 (index_bits, 0), index_expr);
8888 index_type = TREE_TYPE (index_expr);
8891 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
8894 do_pending_stack_adjust ();
8896 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
8897 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
8899 index = copy_to_mode_reg (op_mode, index);
8901 op1 = expand_expr (minval, NULL_RTX, VOIDmode, 0);
8903 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
8904 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
8905 op1, TYPE_UNSIGNED (TREE_TYPE (minval)));
8906 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
8908 op1 = copy_to_mode_reg (op_mode, op1);
8910 op2 = expand_expr (range, NULL_RTX, VOIDmode, 0);
8912 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
8913 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
8914 op2, TYPE_UNSIGNED (TREE_TYPE (range)));
8915 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
8917 op2 = copy_to_mode_reg (op_mode, op2);
8919 emit_jump_insn (gen_casesi (index, op1, op2,
8920 table_label, default_label));
8924 /* Attempt to generate a tablejump instruction; same concept. */
8925 #ifndef HAVE_tablejump
8926 #define HAVE_tablejump 0
8927 #define gen_tablejump(x, y) (0)
8930 /* Subroutine of the next function.
8932 INDEX is the value being switched on, with the lowest value
8933 in the table already subtracted.
8934 MODE is its expected mode (needed if INDEX is constant).
8935 RANGE is the length of the jump table.
8936 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
8938 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
8939 index value is out of range. */
8942 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
8947 if (INTVAL (range) > cfun->max_jumptable_ents)
8948 cfun->max_jumptable_ents = INTVAL (range);
8950 /* Do an unsigned comparison (in the proper mode) between the index
8951 expression and the value which represents the length of the range.
8952 Since we just finished subtracting the lower bound of the range
8953 from the index expression, this comparison allows us to simultaneously
8954 check that the original index expression value is both greater than
8955 or equal to the minimum value of the range and less than or equal to
8956 the maximum value of the range. */
8958 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
8961 /* If index is in range, it must fit in Pmode.
8962 Convert to Pmode so we can index with it. */
8964 index = convert_to_mode (Pmode, index, 1);
8966 /* Don't let a MEM slip through, because then INDEX that comes
8967 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
8968 and break_out_memory_refs will go to work on it and mess it up. */
8969 #ifdef PIC_CASE_VECTOR_ADDRESS
8970 if (flag_pic && !REG_P (index))
8971 index = copy_to_mode_reg (Pmode, index);
8974 /* If flag_force_addr were to affect this address
8975 it could interfere with the tricky assumptions made
8976 about addresses that contain label-refs,
8977 which may be valid only very near the tablejump itself. */
8978 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
8979 GET_MODE_SIZE, because this indicates how large insns are. The other
8980 uses should all be Pmode, because they are addresses. This code
8981 could fail if addresses and insns are not the same size. */
8982 index = gen_rtx_PLUS (Pmode,
8983 gen_rtx_MULT (Pmode, index,
8984 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
8985 gen_rtx_LABEL_REF (Pmode, table_label));
8986 #ifdef PIC_CASE_VECTOR_ADDRESS
8988 index = PIC_CASE_VECTOR_ADDRESS (index);
8991 index = memory_address_noforce (CASE_VECTOR_MODE, index);
8992 temp = gen_reg_rtx (CASE_VECTOR_MODE);
8993 vector = gen_const_mem (CASE_VECTOR_MODE, index);
8994 convert_move (temp, vector, 0);
8996 emit_jump_insn (gen_tablejump (temp, table_label));
8998 /* If we are generating PIC code or if the table is PC-relative, the
8999 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
9000 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
9005 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
9006 rtx table_label, rtx default_label)
9010 if (! HAVE_tablejump)
9013 index_expr = fold_build2 (MINUS_EXPR, index_type,
9014 convert (index_type, index_expr),
9015 convert (index_type, minval));
9016 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
9017 do_pending_stack_adjust ();
9019 do_tablejump (index, TYPE_MODE (index_type),
9020 convert_modes (TYPE_MODE (index_type),
9021 TYPE_MODE (TREE_TYPE (range)),
9022 expand_expr (range, NULL_RTX,
9024 TYPE_UNSIGNED (TREE_TYPE (range))),
9025 table_label, default_label);
9029 /* Nonzero if the mode is a valid vector mode for this architecture.
9030 This returns nonzero even if there is no hardware support for the
9031 vector mode, but we can emulate with narrower modes. */
9034 vector_mode_valid_p (enum machine_mode mode)
9036 enum mode_class class = GET_MODE_CLASS (mode);
9037 enum machine_mode innermode;
9039 /* Doh! What's going on? */
9040 if (class != MODE_VECTOR_INT
9041 && class != MODE_VECTOR_FLOAT)
9044 /* Hardware support. Woo hoo! */
9045 if (targetm.vector_mode_supported_p (mode))
9048 innermode = GET_MODE_INNER (mode);
9050 /* We should probably return 1 if requesting V4DI and we have no DI,
9051 but we have V2DI, but this is probably very unlikely. */
9053 /* If we have support for the inner mode, we can safely emulate it.
9054 We may not have V2DI, but me can emulate with a pair of DIs. */
9055 return targetm.scalar_mode_supported_p (innermode);
9058 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
9060 const_vector_from_tree (tree exp)
9065 enum machine_mode inner, mode;
9067 mode = TYPE_MODE (TREE_TYPE (exp));
9069 if (initializer_zerop (exp))
9070 return CONST0_RTX (mode);
9072 units = GET_MODE_NUNITS (mode);
9073 inner = GET_MODE_INNER (mode);
9075 v = rtvec_alloc (units);
9077 link = TREE_VECTOR_CST_ELTS (exp);
9078 for (i = 0; link; link = TREE_CHAIN (link), ++i)
9080 elt = TREE_VALUE (link);
9082 if (TREE_CODE (elt) == REAL_CST)
9083 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
9086 RTVEC_ELT (v, i) = immed_double_const (TREE_INT_CST_LOW (elt),
9087 TREE_INT_CST_HIGH (elt),
9091 /* Initialize remaining elements to 0. */
9092 for (; i < units; ++i)
9093 RTVEC_ELT (v, i) = CONST0_RTX (inner);
9095 return gen_rtx_CONST_VECTOR (mode, v);
9097 #include "gt-expr.h"