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, 59 Temple Place - Suite 330, 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);
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 bool clear_storage_via_clrmem (rtx, rtx, unsigned);
138 static rtx clear_storage_via_libcall (rtx, rtx);
139 static tree clear_storage_libcall_fn (int);
140 static rtx compress_float_constant (rtx, rtx);
141 static rtx get_subtarget (rtx);
142 static void store_constructor_field (rtx, unsigned HOST_WIDE_INT,
143 HOST_WIDE_INT, enum machine_mode,
144 tree, tree, int, int);
145 static void store_constructor (tree, rtx, int, HOST_WIDE_INT);
146 static rtx store_field (rtx, HOST_WIDE_INT, HOST_WIDE_INT, enum machine_mode,
149 static unsigned HOST_WIDE_INT highest_pow2_factor (tree);
150 static unsigned HOST_WIDE_INT highest_pow2_factor_for_target (tree, tree);
152 static int is_aligning_offset (tree, tree);
153 static void expand_operands (tree, tree, rtx, rtx*, rtx*,
154 enum expand_modifier);
155 static rtx reduce_to_bit_field_precision (rtx, rtx, tree);
156 static rtx do_store_flag (tree, rtx, enum machine_mode, int);
158 static void emit_single_push_insn (enum machine_mode, rtx, tree);
160 static void do_tablejump (rtx, enum machine_mode, rtx, rtx, rtx);
161 static rtx const_vector_from_tree (tree);
162 static void write_complex_part (rtx, rtx, bool);
164 /* Record for each mode whether we can move a register directly to or
165 from an object of that mode in memory. If we can't, we won't try
166 to use that mode directly when accessing a field of that mode. */
168 static char direct_load[NUM_MACHINE_MODES];
169 static char direct_store[NUM_MACHINE_MODES];
171 /* Record for each mode whether we can float-extend from memory. */
173 static bool float_extend_from_mem[NUM_MACHINE_MODES][NUM_MACHINE_MODES];
175 /* This macro is used to determine whether move_by_pieces should be called
176 to perform a structure copy. */
177 #ifndef MOVE_BY_PIECES_P
178 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
179 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
180 < (unsigned int) MOVE_RATIO)
183 /* This macro is used to determine whether clear_by_pieces should be
184 called to clear storage. */
185 #ifndef CLEAR_BY_PIECES_P
186 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
187 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
188 < (unsigned int) CLEAR_RATIO)
191 /* This macro is used to determine whether store_by_pieces should be
192 called to "memset" storage with byte values other than zero, or
193 to "memcpy" storage when the source is a constant string. */
194 #ifndef STORE_BY_PIECES_P
195 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
196 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
197 < (unsigned int) MOVE_RATIO)
200 /* This array records the insn_code of insns to perform block moves. */
201 enum insn_code movmem_optab[NUM_MACHINE_MODES];
203 /* This array records the insn_code of insns to perform block clears. */
204 enum insn_code clrmem_optab[NUM_MACHINE_MODES];
206 /* These arrays record the insn_code of two different kinds of insns
207 to perform block compares. */
208 enum insn_code cmpstr_optab[NUM_MACHINE_MODES];
209 enum insn_code cmpmem_optab[NUM_MACHINE_MODES];
211 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
213 #ifndef SLOW_UNALIGNED_ACCESS
214 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
217 /* This is run once per compilation to set up which modes can be used
218 directly in memory and to initialize the block move optab. */
221 init_expr_once (void)
224 enum machine_mode mode;
229 /* Try indexing by frame ptr and try by stack ptr.
230 It is known that on the Convex the stack ptr isn't a valid index.
231 With luck, one or the other is valid on any machine. */
232 mem = gen_rtx_MEM (VOIDmode, stack_pointer_rtx);
233 mem1 = gen_rtx_MEM (VOIDmode, frame_pointer_rtx);
235 /* A scratch register we can modify in-place below to avoid
236 useless RTL allocations. */
237 reg = gen_rtx_REG (VOIDmode, -1);
239 insn = rtx_alloc (INSN);
240 pat = gen_rtx_SET (0, NULL_RTX, NULL_RTX);
241 PATTERN (insn) = pat;
243 for (mode = VOIDmode; (int) mode < NUM_MACHINE_MODES;
244 mode = (enum machine_mode) ((int) mode + 1))
248 direct_load[(int) mode] = direct_store[(int) mode] = 0;
249 PUT_MODE (mem, mode);
250 PUT_MODE (mem1, mode);
251 PUT_MODE (reg, mode);
253 /* See if there is some register that can be used in this mode and
254 directly loaded or stored from memory. */
256 if (mode != VOIDmode && mode != BLKmode)
257 for (regno = 0; regno < FIRST_PSEUDO_REGISTER
258 && (direct_load[(int) mode] == 0 || direct_store[(int) mode] == 0);
261 if (! HARD_REGNO_MODE_OK (regno, mode))
267 SET_DEST (pat) = reg;
268 if (recog (pat, insn, &num_clobbers) >= 0)
269 direct_load[(int) mode] = 1;
271 SET_SRC (pat) = mem1;
272 SET_DEST (pat) = reg;
273 if (recog (pat, insn, &num_clobbers) >= 0)
274 direct_load[(int) mode] = 1;
277 SET_DEST (pat) = mem;
278 if (recog (pat, insn, &num_clobbers) >= 0)
279 direct_store[(int) mode] = 1;
282 SET_DEST (pat) = mem1;
283 if (recog (pat, insn, &num_clobbers) >= 0)
284 direct_store[(int) mode] = 1;
288 mem = gen_rtx_MEM (VOIDmode, gen_rtx_raw_REG (Pmode, 10000));
290 for (mode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); mode != VOIDmode;
291 mode = GET_MODE_WIDER_MODE (mode))
293 enum machine_mode srcmode;
294 for (srcmode = GET_CLASS_NARROWEST_MODE (MODE_FLOAT); srcmode != mode;
295 srcmode = GET_MODE_WIDER_MODE (srcmode))
299 ic = can_extend_p (mode, srcmode, 0);
300 if (ic == CODE_FOR_nothing)
303 PUT_MODE (mem, srcmode);
305 if ((*insn_data[ic].operand[1].predicate) (mem, srcmode))
306 float_extend_from_mem[mode][srcmode] = true;
311 /* This is run at the start of compiling a function. */
316 cfun->expr = ggc_alloc_cleared (sizeof (struct expr_status));
319 /* Copy data from FROM to TO, where the machine modes are not the same.
320 Both modes may be integer, or both may be floating.
321 UNSIGNEDP should be nonzero if FROM is an unsigned type.
322 This causes zero-extension instead of sign-extension. */
325 convert_move (rtx to, rtx from, int unsignedp)
327 enum machine_mode to_mode = GET_MODE (to);
328 enum machine_mode from_mode = GET_MODE (from);
329 int to_real = GET_MODE_CLASS (to_mode) == MODE_FLOAT;
330 int from_real = GET_MODE_CLASS (from_mode) == MODE_FLOAT;
334 /* rtx code for making an equivalent value. */
335 enum rtx_code equiv_code = (unsignedp < 0 ? UNKNOWN
336 : (unsignedp ? ZERO_EXTEND : SIGN_EXTEND));
339 gcc_assert (to_real == from_real);
341 /* If the source and destination are already the same, then there's
346 /* If FROM is a SUBREG that indicates that we have already done at least
347 the required extension, strip it. We don't handle such SUBREGs as
350 if (GET_CODE (from) == SUBREG && SUBREG_PROMOTED_VAR_P (from)
351 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from)))
352 >= GET_MODE_SIZE (to_mode))
353 && SUBREG_PROMOTED_UNSIGNED_P (from) == unsignedp)
354 from = gen_lowpart (to_mode, from), from_mode = to_mode;
356 gcc_assert (GET_CODE (to) != SUBREG || !SUBREG_PROMOTED_VAR_P (to));
358 if (to_mode == from_mode
359 || (from_mode == VOIDmode && CONSTANT_P (from)))
361 emit_move_insn (to, from);
365 if (VECTOR_MODE_P (to_mode) || VECTOR_MODE_P (from_mode))
367 gcc_assert (GET_MODE_BITSIZE (from_mode) == GET_MODE_BITSIZE (to_mode));
369 if (VECTOR_MODE_P (to_mode))
370 from = simplify_gen_subreg (to_mode, from, GET_MODE (from), 0);
372 to = simplify_gen_subreg (from_mode, to, GET_MODE (to), 0);
374 emit_move_insn (to, from);
378 if (GET_CODE (to) == CONCAT && GET_CODE (from) == CONCAT)
380 convert_move (XEXP (to, 0), XEXP (from, 0), unsignedp);
381 convert_move (XEXP (to, 1), XEXP (from, 1), unsignedp);
390 gcc_assert (GET_MODE_PRECISION (from_mode)
391 != GET_MODE_PRECISION (to_mode));
393 if (GET_MODE_PRECISION (from_mode) < GET_MODE_PRECISION (to_mode))
398 /* Try converting directly if the insn is supported. */
400 code = tab->handlers[to_mode][from_mode].insn_code;
401 if (code != CODE_FOR_nothing)
403 emit_unop_insn (code, to, from,
404 tab == sext_optab ? FLOAT_EXTEND : FLOAT_TRUNCATE);
408 /* Otherwise use a libcall. */
409 libcall = tab->handlers[to_mode][from_mode].libfunc;
411 /* Is this conversion implemented yet? */
412 gcc_assert (libcall);
415 value = emit_library_call_value (libcall, NULL_RTX, LCT_CONST, to_mode,
417 insns = get_insns ();
419 emit_libcall_block (insns, to, value,
420 tab == trunc_optab ? gen_rtx_FLOAT_TRUNCATE (to_mode,
422 : gen_rtx_FLOAT_EXTEND (to_mode, from));
426 /* Handle pointer conversion. */ /* SPEE 900220. */
427 /* Targets are expected to provide conversion insns between PxImode and
428 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
429 if (GET_MODE_CLASS (to_mode) == MODE_PARTIAL_INT)
431 enum machine_mode full_mode
432 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode), MODE_INT);
434 gcc_assert (trunc_optab->handlers[to_mode][full_mode].insn_code
435 != CODE_FOR_nothing);
437 if (full_mode != from_mode)
438 from = convert_to_mode (full_mode, from, unsignedp);
439 emit_unop_insn (trunc_optab->handlers[to_mode][full_mode].insn_code,
443 if (GET_MODE_CLASS (from_mode) == MODE_PARTIAL_INT)
445 enum machine_mode full_mode
446 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode), MODE_INT);
448 gcc_assert (sext_optab->handlers[full_mode][from_mode].insn_code
449 != CODE_FOR_nothing);
451 emit_unop_insn (sext_optab->handlers[full_mode][from_mode].insn_code,
453 if (to_mode == full_mode)
456 /* else proceed to integer conversions below. */
457 from_mode = full_mode;
460 /* Now both modes are integers. */
462 /* Handle expanding beyond a word. */
463 if (GET_MODE_BITSIZE (from_mode) < GET_MODE_BITSIZE (to_mode)
464 && GET_MODE_BITSIZE (to_mode) > BITS_PER_WORD)
471 enum machine_mode lowpart_mode;
472 int nwords = CEIL (GET_MODE_SIZE (to_mode), UNITS_PER_WORD);
474 /* Try converting directly if the insn is supported. */
475 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
478 /* If FROM is a SUBREG, put it into a register. Do this
479 so that we always generate the same set of insns for
480 better cse'ing; if an intermediate assignment occurred,
481 we won't be doing the operation directly on the SUBREG. */
482 if (optimize > 0 && GET_CODE (from) == SUBREG)
483 from = force_reg (from_mode, from);
484 emit_unop_insn (code, to, from, equiv_code);
487 /* Next, try converting via full word. */
488 else if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD
489 && ((code = can_extend_p (to_mode, word_mode, unsignedp))
490 != CODE_FOR_nothing))
494 if (reg_overlap_mentioned_p (to, from))
495 from = force_reg (from_mode, from);
496 emit_insn (gen_rtx_CLOBBER (VOIDmode, to));
498 convert_move (gen_lowpart (word_mode, to), from, unsignedp);
499 emit_unop_insn (code, to,
500 gen_lowpart (word_mode, to), equiv_code);
504 /* No special multiword conversion insn; do it by hand. */
507 /* Since we will turn this into a no conflict block, we must ensure
508 that the source does not overlap the target. */
510 if (reg_overlap_mentioned_p (to, from))
511 from = force_reg (from_mode, from);
513 /* Get a copy of FROM widened to a word, if necessary. */
514 if (GET_MODE_BITSIZE (from_mode) < BITS_PER_WORD)
515 lowpart_mode = word_mode;
517 lowpart_mode = from_mode;
519 lowfrom = convert_to_mode (lowpart_mode, from, unsignedp);
521 lowpart = gen_lowpart (lowpart_mode, to);
522 emit_move_insn (lowpart, lowfrom);
524 /* Compute the value to put in each remaining word. */
526 fill_value = const0_rtx;
531 && insn_data[(int) CODE_FOR_slt].operand[0].mode == word_mode
532 && STORE_FLAG_VALUE == -1)
534 emit_cmp_insn (lowfrom, const0_rtx, NE, NULL_RTX,
536 fill_value = gen_reg_rtx (word_mode);
537 emit_insn (gen_slt (fill_value));
543 = expand_shift (RSHIFT_EXPR, lowpart_mode, lowfrom,
544 size_int (GET_MODE_BITSIZE (lowpart_mode) - 1),
546 fill_value = convert_to_mode (word_mode, fill_value, 1);
550 /* Fill the remaining words. */
551 for (i = GET_MODE_SIZE (lowpart_mode) / UNITS_PER_WORD; i < nwords; i++)
553 int index = (WORDS_BIG_ENDIAN ? nwords - i - 1 : i);
554 rtx subword = operand_subword (to, index, 1, to_mode);
556 gcc_assert (subword);
558 if (fill_value != subword)
559 emit_move_insn (subword, fill_value);
562 insns = get_insns ();
565 emit_no_conflict_block (insns, to, from, NULL_RTX,
566 gen_rtx_fmt_e (equiv_code, to_mode, copy_rtx (from)));
570 /* Truncating multi-word to a word or less. */
571 if (GET_MODE_BITSIZE (from_mode) > BITS_PER_WORD
572 && GET_MODE_BITSIZE (to_mode) <= BITS_PER_WORD)
575 && ! MEM_VOLATILE_P (from)
576 && direct_load[(int) to_mode]
577 && ! mode_dependent_address_p (XEXP (from, 0)))
579 || GET_CODE (from) == SUBREG))
580 from = force_reg (from_mode, from);
581 convert_move (to, gen_lowpart (word_mode, from), 0);
585 /* Now follow all the conversions between integers
586 no more than a word long. */
588 /* For truncation, usually we can just refer to FROM in a narrower mode. */
589 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode)
590 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
591 GET_MODE_BITSIZE (from_mode)))
594 && ! MEM_VOLATILE_P (from)
595 && direct_load[(int) to_mode]
596 && ! mode_dependent_address_p (XEXP (from, 0)))
598 || GET_CODE (from) == SUBREG))
599 from = force_reg (from_mode, from);
600 if (REG_P (from) && REGNO (from) < FIRST_PSEUDO_REGISTER
601 && ! HARD_REGNO_MODE_OK (REGNO (from), to_mode))
602 from = copy_to_reg (from);
603 emit_move_insn (to, gen_lowpart (to_mode, from));
607 /* Handle extension. */
608 if (GET_MODE_BITSIZE (to_mode) > GET_MODE_BITSIZE (from_mode))
610 /* Convert directly if that works. */
611 if ((code = can_extend_p (to_mode, from_mode, unsignedp))
615 from = force_not_mem (from);
617 emit_unop_insn (code, to, from, equiv_code);
622 enum machine_mode intermediate;
626 /* Search for a mode to convert via. */
627 for (intermediate = from_mode; intermediate != VOIDmode;
628 intermediate = GET_MODE_WIDER_MODE (intermediate))
629 if (((can_extend_p (to_mode, intermediate, unsignedp)
631 || (GET_MODE_SIZE (to_mode) < GET_MODE_SIZE (intermediate)
632 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode),
633 GET_MODE_BITSIZE (intermediate))))
634 && (can_extend_p (intermediate, from_mode, unsignedp)
635 != CODE_FOR_nothing))
637 convert_move (to, convert_to_mode (intermediate, from,
638 unsignedp), unsignedp);
642 /* No suitable intermediate mode.
643 Generate what we need with shifts. */
644 shift_amount = build_int_cst (NULL_TREE,
645 GET_MODE_BITSIZE (to_mode)
646 - GET_MODE_BITSIZE (from_mode));
647 from = gen_lowpart (to_mode, force_reg (from_mode, from));
648 tmp = expand_shift (LSHIFT_EXPR, to_mode, from, shift_amount,
650 tmp = expand_shift (RSHIFT_EXPR, to_mode, tmp, shift_amount,
653 emit_move_insn (to, tmp);
658 /* Support special truncate insns for certain modes. */
659 if (trunc_optab->handlers[to_mode][from_mode].insn_code != CODE_FOR_nothing)
661 emit_unop_insn (trunc_optab->handlers[to_mode][from_mode].insn_code,
666 /* Handle truncation of volatile memrefs, and so on;
667 the things that couldn't be truncated directly,
668 and for which there was no special instruction.
670 ??? Code above formerly short-circuited this, for most integer
671 mode pairs, with a force_reg in from_mode followed by a recursive
672 call to this routine. Appears always to have been wrong. */
673 if (GET_MODE_BITSIZE (to_mode) < GET_MODE_BITSIZE (from_mode))
675 rtx temp = force_reg (to_mode, gen_lowpart (to_mode, from));
676 emit_move_insn (to, temp);
680 /* Mode combination is not recognized. */
684 /* Return an rtx for a value that would result
685 from converting X to mode MODE.
686 Both X and MODE may be floating, or both integer.
687 UNSIGNEDP is nonzero if X is an unsigned value.
688 This can be done by referring to a part of X in place
689 or by copying to a new temporary with conversion. */
692 convert_to_mode (enum machine_mode mode, rtx x, int unsignedp)
694 return convert_modes (mode, VOIDmode, x, unsignedp);
697 /* Return an rtx for a value that would result
698 from converting X from mode OLDMODE to mode MODE.
699 Both modes may be floating, or both integer.
700 UNSIGNEDP is nonzero if X is an unsigned value.
702 This can be done by referring to a part of X in place
703 or by copying to a new temporary with conversion.
705 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
708 convert_modes (enum machine_mode mode, enum machine_mode oldmode, rtx x, int unsignedp)
712 /* If FROM is a SUBREG that indicates that we have already done at least
713 the required extension, strip it. */
715 if (GET_CODE (x) == SUBREG && SUBREG_PROMOTED_VAR_P (x)
716 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))) >= GET_MODE_SIZE (mode)
717 && SUBREG_PROMOTED_UNSIGNED_P (x) == unsignedp)
718 x = gen_lowpart (mode, x);
720 if (GET_MODE (x) != VOIDmode)
721 oldmode = GET_MODE (x);
726 /* There is one case that we must handle specially: If we are converting
727 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
728 we are to interpret the constant as unsigned, gen_lowpart will do
729 the wrong if the constant appears negative. What we want to do is
730 make the high-order word of the constant zero, not all ones. */
732 if (unsignedp && GET_MODE_CLASS (mode) == MODE_INT
733 && GET_MODE_BITSIZE (mode) == 2 * HOST_BITS_PER_WIDE_INT
734 && GET_CODE (x) == CONST_INT && INTVAL (x) < 0)
736 HOST_WIDE_INT val = INTVAL (x);
738 if (oldmode != VOIDmode
739 && HOST_BITS_PER_WIDE_INT > GET_MODE_BITSIZE (oldmode))
741 int width = GET_MODE_BITSIZE (oldmode);
743 /* We need to zero extend VAL. */
744 val &= ((HOST_WIDE_INT) 1 << width) - 1;
747 return immed_double_const (val, (HOST_WIDE_INT) 0, mode);
750 /* We can do this with a gen_lowpart if both desired and current modes
751 are integer, and this is either a constant integer, a register, or a
752 non-volatile MEM. Except for the constant case where MODE is no
753 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
755 if ((GET_CODE (x) == CONST_INT
756 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
757 || (GET_MODE_CLASS (mode) == MODE_INT
758 && GET_MODE_CLASS (oldmode) == MODE_INT
759 && (GET_CODE (x) == CONST_DOUBLE
760 || (GET_MODE_SIZE (mode) <= GET_MODE_SIZE (oldmode)
761 && ((MEM_P (x) && ! MEM_VOLATILE_P (x)
762 && direct_load[(int) mode])
764 && (! HARD_REGISTER_P (x)
765 || HARD_REGNO_MODE_OK (REGNO (x), mode))
766 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode),
767 GET_MODE_BITSIZE (GET_MODE (x)))))))))
769 /* ?? If we don't know OLDMODE, we have to assume here that
770 X does not need sign- or zero-extension. This may not be
771 the case, but it's the best we can do. */
772 if (GET_CODE (x) == CONST_INT && oldmode != VOIDmode
773 && GET_MODE_SIZE (mode) > GET_MODE_SIZE (oldmode))
775 HOST_WIDE_INT val = INTVAL (x);
776 int width = GET_MODE_BITSIZE (oldmode);
778 /* We must sign or zero-extend in this case. Start by
779 zero-extending, then sign extend if we need to. */
780 val &= ((HOST_WIDE_INT) 1 << width) - 1;
782 && (val & ((HOST_WIDE_INT) 1 << (width - 1))))
783 val |= (HOST_WIDE_INT) (-1) << width;
785 return gen_int_mode (val, mode);
788 return gen_lowpart (mode, x);
791 /* Converting from integer constant into mode is always equivalent to an
793 if (VECTOR_MODE_P (mode) && GET_MODE (x) == VOIDmode)
795 gcc_assert (GET_MODE_BITSIZE (mode) == GET_MODE_BITSIZE (oldmode));
796 return simplify_gen_subreg (mode, x, oldmode, 0);
799 temp = gen_reg_rtx (mode);
800 convert_move (temp, x, unsignedp);
804 /* STORE_MAX_PIECES is the number of bytes at a time that we can
805 store efficiently. Due to internal GCC limitations, this is
806 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
807 for an immediate constant. */
809 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
811 /* Determine whether the LEN bytes can be moved by using several move
812 instructions. Return nonzero if a call to move_by_pieces should
816 can_move_by_pieces (unsigned HOST_WIDE_INT len,
817 unsigned int align ATTRIBUTE_UNUSED)
819 return MOVE_BY_PIECES_P (len, align);
822 /* Generate several move instructions to copy LEN bytes from block FROM to
823 block TO. (These are MEM rtx's with BLKmode).
825 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
826 used to push FROM to the stack.
828 ALIGN is maximum stack alignment we can assume.
830 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
831 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
835 move_by_pieces (rtx to, rtx from, unsigned HOST_WIDE_INT len,
836 unsigned int align, int endp)
838 struct move_by_pieces data;
839 rtx to_addr, from_addr = XEXP (from, 0);
840 unsigned int max_size = MOVE_MAX_PIECES + 1;
841 enum machine_mode mode = VOIDmode, tmode;
842 enum insn_code icode;
844 align = MIN (to ? MEM_ALIGN (to) : align, MEM_ALIGN (from));
847 data.from_addr = from_addr;
850 to_addr = XEXP (to, 0);
853 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
854 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
856 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
863 #ifdef STACK_GROWS_DOWNWARD
869 data.to_addr = to_addr;
872 = (GET_CODE (from_addr) == PRE_INC || GET_CODE (from_addr) == PRE_DEC
873 || GET_CODE (from_addr) == POST_INC
874 || GET_CODE (from_addr) == POST_DEC);
876 data.explicit_inc_from = 0;
877 data.explicit_inc_to = 0;
878 if (data.reverse) data.offset = len;
881 /* If copying requires more than two move insns,
882 copy addresses to registers (to make displacements shorter)
883 and use post-increment if available. */
884 if (!(data.autinc_from && data.autinc_to)
885 && move_by_pieces_ninsns (len, align, max_size) > 2)
887 /* Find the mode of the largest move... */
888 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
889 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
890 if (GET_MODE_SIZE (tmode) < max_size)
893 if (USE_LOAD_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_from)
895 data.from_addr = copy_addr_to_reg (plus_constant (from_addr, len));
896 data.autinc_from = 1;
897 data.explicit_inc_from = -1;
899 if (USE_LOAD_POST_INCREMENT (mode) && ! data.autinc_from)
901 data.from_addr = copy_addr_to_reg (from_addr);
902 data.autinc_from = 1;
903 data.explicit_inc_from = 1;
905 if (!data.autinc_from && CONSTANT_P (from_addr))
906 data.from_addr = copy_addr_to_reg (from_addr);
907 if (USE_STORE_PRE_DECREMENT (mode) && data.reverse && ! data.autinc_to)
909 data.to_addr = copy_addr_to_reg (plus_constant (to_addr, len));
911 data.explicit_inc_to = -1;
913 if (USE_STORE_POST_INCREMENT (mode) && ! data.reverse && ! data.autinc_to)
915 data.to_addr = copy_addr_to_reg (to_addr);
917 data.explicit_inc_to = 1;
919 if (!data.autinc_to && CONSTANT_P (to_addr))
920 data.to_addr = copy_addr_to_reg (to_addr);
923 tmode = mode_for_size (MOVE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
924 if (align >= GET_MODE_ALIGNMENT (tmode))
925 align = GET_MODE_ALIGNMENT (tmode);
928 enum machine_mode xmode;
930 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
932 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
933 if (GET_MODE_SIZE (tmode) > MOVE_MAX_PIECES
934 || SLOW_UNALIGNED_ACCESS (tmode, align))
937 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
940 /* First move what we can in the largest integer mode, then go to
941 successively smaller modes. */
945 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
946 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
947 if (GET_MODE_SIZE (tmode) < max_size)
950 if (mode == VOIDmode)
953 icode = mov_optab->handlers[(int) mode].insn_code;
954 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
955 move_by_pieces_1 (GEN_FCN (icode), mode, &data);
957 max_size = GET_MODE_SIZE (mode);
960 /* The code above should have handled everything. */
961 gcc_assert (!data.len);
967 gcc_assert (!data.reverse);
972 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
973 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
975 data.to_addr = copy_addr_to_reg (plus_constant (data.to_addr,
978 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
985 to1 = adjust_address (data.to, QImode, data.offset);
993 /* Return number of insns required to move L bytes by pieces.
994 ALIGN (in bits) is maximum alignment we can assume. */
996 static unsigned HOST_WIDE_INT
997 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l, unsigned int align,
998 unsigned int max_size)
1000 unsigned HOST_WIDE_INT n_insns = 0;
1001 enum machine_mode tmode;
1003 tmode = mode_for_size (MOVE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
1004 if (align >= GET_MODE_ALIGNMENT (tmode))
1005 align = GET_MODE_ALIGNMENT (tmode);
1008 enum machine_mode tmode, xmode;
1010 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
1012 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
1013 if (GET_MODE_SIZE (tmode) > MOVE_MAX_PIECES
1014 || SLOW_UNALIGNED_ACCESS (tmode, align))
1017 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
1020 while (max_size > 1)
1022 enum machine_mode mode = VOIDmode;
1023 enum insn_code icode;
1025 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
1026 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
1027 if (GET_MODE_SIZE (tmode) < max_size)
1030 if (mode == VOIDmode)
1033 icode = mov_optab->handlers[(int) mode].insn_code;
1034 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
1035 n_insns += l / GET_MODE_SIZE (mode), l %= GET_MODE_SIZE (mode);
1037 max_size = GET_MODE_SIZE (mode);
1044 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1045 with move instructions for mode MODE. GENFUN is the gen_... function
1046 to make a move insn for that mode. DATA has all the other info. */
1049 move_by_pieces_1 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
1050 struct move_by_pieces *data)
1052 unsigned int size = GET_MODE_SIZE (mode);
1053 rtx to1 = NULL_RTX, from1;
1055 while (data->len >= size)
1058 data->offset -= size;
1062 if (data->autinc_to)
1063 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
1066 to1 = adjust_address (data->to, mode, data->offset);
1069 if (data->autinc_from)
1070 from1 = adjust_automodify_address (data->from, mode, data->from_addr,
1073 from1 = adjust_address (data->from, mode, data->offset);
1075 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
1076 emit_insn (gen_add2_insn (data->to_addr,
1077 GEN_INT (-(HOST_WIDE_INT)size)));
1078 if (HAVE_PRE_DECREMENT && data->explicit_inc_from < 0)
1079 emit_insn (gen_add2_insn (data->from_addr,
1080 GEN_INT (-(HOST_WIDE_INT)size)));
1083 emit_insn ((*genfun) (to1, from1));
1086 #ifdef PUSH_ROUNDING
1087 emit_single_push_insn (mode, from1, NULL);
1093 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
1094 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
1095 if (HAVE_POST_INCREMENT && data->explicit_inc_from > 0)
1096 emit_insn (gen_add2_insn (data->from_addr, GEN_INT (size)));
1098 if (! data->reverse)
1099 data->offset += size;
1105 /* Emit code to move a block Y to a block X. This may be done with
1106 string-move instructions, with multiple scalar move instructions,
1107 or with a library call.
1109 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1110 SIZE is an rtx that says how long they are.
1111 ALIGN is the maximum alignment we can assume they have.
1112 METHOD describes what kind of copy this is, and what mechanisms may be used.
1114 Return the address of the new block, if memcpy is called and returns it,
1118 emit_block_move (rtx x, rtx y, rtx size, enum block_op_methods method)
1126 case BLOCK_OP_NORMAL:
1127 may_use_call = true;
1130 case BLOCK_OP_CALL_PARM:
1131 may_use_call = block_move_libcall_safe_for_call_parm ();
1133 /* Make inhibit_defer_pop nonzero around the library call
1134 to force it to pop the arguments right away. */
1138 case BLOCK_OP_NO_LIBCALL:
1139 may_use_call = false;
1146 align = MIN (MEM_ALIGN (x), MEM_ALIGN (y));
1148 gcc_assert (MEM_P (x));
1149 gcc_assert (MEM_P (y));
1152 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1153 block copy is more efficient for other large modes, e.g. DCmode. */
1154 x = adjust_address (x, BLKmode, 0);
1155 y = adjust_address (y, BLKmode, 0);
1157 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1158 can be incorrect is coming from __builtin_memcpy. */
1159 if (GET_CODE (size) == CONST_INT)
1161 if (INTVAL (size) == 0)
1164 x = shallow_copy_rtx (x);
1165 y = shallow_copy_rtx (y);
1166 set_mem_size (x, size);
1167 set_mem_size (y, size);
1170 if (GET_CODE (size) == CONST_INT && MOVE_BY_PIECES_P (INTVAL (size), align))
1171 move_by_pieces (x, y, INTVAL (size), align, 0);
1172 else if (emit_block_move_via_movmem (x, y, size, align))
1174 else if (may_use_call)
1175 retval = emit_block_move_via_libcall (x, y, size);
1177 emit_block_move_via_loop (x, y, size, align);
1179 if (method == BLOCK_OP_CALL_PARM)
1185 /* A subroutine of emit_block_move. Returns true if calling the
1186 block move libcall will not clobber any parameters which may have
1187 already been placed on the stack. */
1190 block_move_libcall_safe_for_call_parm (void)
1192 /* If arguments are pushed on the stack, then they're safe. */
1196 /* If registers go on the stack anyway, any argument is sure to clobber
1197 an outgoing argument. */
1198 #if defined (REG_PARM_STACK_SPACE) && defined (OUTGOING_REG_PARM_STACK_SPACE)
1200 tree fn = emit_block_move_libcall_fn (false);
1202 if (REG_PARM_STACK_SPACE (fn) != 0)
1207 /* If any argument goes in memory, then it might clobber an outgoing
1210 CUMULATIVE_ARGS args_so_far;
1213 fn = emit_block_move_libcall_fn (false);
1214 INIT_CUMULATIVE_ARGS (args_so_far, TREE_TYPE (fn), NULL_RTX, 0, 3);
1216 arg = TYPE_ARG_TYPES (TREE_TYPE (fn));
1217 for ( ; arg != void_list_node ; arg = TREE_CHAIN (arg))
1219 enum machine_mode mode = TYPE_MODE (TREE_VALUE (arg));
1220 rtx tmp = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
1221 if (!tmp || !REG_P (tmp))
1223 if (targetm.calls.arg_partial_bytes (&args_so_far, mode, NULL, 1))
1225 FUNCTION_ARG_ADVANCE (args_so_far, mode, NULL_TREE, 1);
1231 /* A subroutine of emit_block_move. Expand a movmem pattern;
1232 return true if successful. */
1235 emit_block_move_via_movmem (rtx x, rtx y, rtx size, unsigned int align)
1237 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
1238 int save_volatile_ok = volatile_ok;
1239 enum machine_mode mode;
1241 /* Since this is a move insn, we don't care about volatility. */
1244 /* Try the most limited insn first, because there's no point
1245 including more than one in the machine description unless
1246 the more limited one has some advantage. */
1248 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1249 mode = GET_MODE_WIDER_MODE (mode))
1251 enum insn_code code = movmem_optab[(int) mode];
1252 insn_operand_predicate_fn pred;
1254 if (code != CODE_FOR_nothing
1255 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1256 here because if SIZE is less than the mode mask, as it is
1257 returned by the macro, it will definitely be less than the
1258 actual mode mask. */
1259 && ((GET_CODE (size) == CONST_INT
1260 && ((unsigned HOST_WIDE_INT) INTVAL (size)
1261 <= (GET_MODE_MASK (mode) >> 1)))
1262 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
1263 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
1264 || (*pred) (x, BLKmode))
1265 && ((pred = insn_data[(int) code].operand[1].predicate) == 0
1266 || (*pred) (y, BLKmode))
1267 && ((pred = insn_data[(int) code].operand[3].predicate) == 0
1268 || (*pred) (opalign, VOIDmode)))
1271 rtx last = get_last_insn ();
1274 op2 = convert_to_mode (mode, size, 1);
1275 pred = insn_data[(int) code].operand[2].predicate;
1276 if (pred != 0 && ! (*pred) (op2, mode))
1277 op2 = copy_to_mode_reg (mode, op2);
1279 /* ??? When called via emit_block_move_for_call, it'd be
1280 nice if there were some way to inform the backend, so
1281 that it doesn't fail the expansion because it thinks
1282 emitting the libcall would be more efficient. */
1284 pat = GEN_FCN ((int) code) (x, y, op2, opalign);
1288 volatile_ok = save_volatile_ok;
1292 delete_insns_since (last);
1296 volatile_ok = save_volatile_ok;
1300 /* A subroutine of emit_block_move. Expand a call to memcpy.
1301 Return the return value from memcpy, 0 otherwise. */
1304 emit_block_move_via_libcall (rtx dst, rtx src, rtx size)
1306 rtx dst_addr, src_addr;
1307 tree call_expr, arg_list, fn, src_tree, dst_tree, size_tree;
1308 enum machine_mode size_mode;
1311 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1312 pseudos. We can then place those new pseudos into a VAR_DECL and
1315 dst_addr = copy_to_mode_reg (Pmode, XEXP (dst, 0));
1316 src_addr = copy_to_mode_reg (Pmode, XEXP (src, 0));
1318 dst_addr = convert_memory_address (ptr_mode, dst_addr);
1319 src_addr = convert_memory_address (ptr_mode, src_addr);
1321 dst_tree = make_tree (ptr_type_node, dst_addr);
1322 src_tree = make_tree (ptr_type_node, src_addr);
1324 size_mode = TYPE_MODE (sizetype);
1326 size = convert_to_mode (size_mode, size, 1);
1327 size = copy_to_mode_reg (size_mode, size);
1329 /* It is incorrect to use the libcall calling conventions to call
1330 memcpy in this context. This could be a user call to memcpy and
1331 the user may wish to examine the return value from memcpy. For
1332 targets where libcalls and normal calls have different conventions
1333 for returning pointers, we could end up generating incorrect code. */
1335 size_tree = make_tree (sizetype, size);
1337 fn = emit_block_move_libcall_fn (true);
1338 arg_list = tree_cons (NULL_TREE, size_tree, NULL_TREE);
1339 arg_list = tree_cons (NULL_TREE, src_tree, arg_list);
1340 arg_list = tree_cons (NULL_TREE, dst_tree, arg_list);
1342 /* Now we have to build up the CALL_EXPR itself. */
1343 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
1344 call_expr = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
1345 call_expr, arg_list, NULL_TREE);
1347 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
1352 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1353 for the function we use for block copies. The first time FOR_CALL
1354 is true, we call assemble_external. */
1356 static GTY(()) tree block_move_fn;
1359 init_block_move_fn (const char *asmspec)
1365 fn = get_identifier ("memcpy");
1366 args = build_function_type_list (ptr_type_node, ptr_type_node,
1367 const_ptr_type_node, sizetype,
1370 fn = build_decl (FUNCTION_DECL, fn, args);
1371 DECL_EXTERNAL (fn) = 1;
1372 TREE_PUBLIC (fn) = 1;
1373 DECL_ARTIFICIAL (fn) = 1;
1374 TREE_NOTHROW (fn) = 1;
1380 set_user_assembler_name (block_move_fn, asmspec);
1384 emit_block_move_libcall_fn (int for_call)
1386 static bool emitted_extern;
1389 init_block_move_fn (NULL);
1391 if (for_call && !emitted_extern)
1393 emitted_extern = true;
1394 make_decl_rtl (block_move_fn);
1395 assemble_external (block_move_fn);
1398 return block_move_fn;
1401 /* A subroutine of emit_block_move. Copy the data via an explicit
1402 loop. This is used only when libcalls are forbidden. */
1403 /* ??? It'd be nice to copy in hunks larger than QImode. */
1406 emit_block_move_via_loop (rtx x, rtx y, rtx size,
1407 unsigned int align ATTRIBUTE_UNUSED)
1409 rtx cmp_label, top_label, iter, x_addr, y_addr, tmp;
1410 enum machine_mode iter_mode;
1412 iter_mode = GET_MODE (size);
1413 if (iter_mode == VOIDmode)
1414 iter_mode = word_mode;
1416 top_label = gen_label_rtx ();
1417 cmp_label = gen_label_rtx ();
1418 iter = gen_reg_rtx (iter_mode);
1420 emit_move_insn (iter, const0_rtx);
1422 x_addr = force_operand (XEXP (x, 0), NULL_RTX);
1423 y_addr = force_operand (XEXP (y, 0), NULL_RTX);
1424 do_pending_stack_adjust ();
1426 emit_jump (cmp_label);
1427 emit_label (top_label);
1429 tmp = convert_modes (Pmode, iter_mode, iter, true);
1430 x_addr = gen_rtx_PLUS (Pmode, x_addr, tmp);
1431 y_addr = gen_rtx_PLUS (Pmode, y_addr, tmp);
1432 x = change_address (x, QImode, x_addr);
1433 y = change_address (y, QImode, y_addr);
1435 emit_move_insn (x, y);
1437 tmp = expand_simple_binop (iter_mode, PLUS, iter, const1_rtx, iter,
1438 true, OPTAB_LIB_WIDEN);
1440 emit_move_insn (iter, tmp);
1442 emit_label (cmp_label);
1444 emit_cmp_and_jump_insns (iter, size, LT, NULL_RTX, iter_mode,
1448 /* Copy all or part of a value X into registers starting at REGNO.
1449 The number of registers to be filled is NREGS. */
1452 move_block_to_reg (int regno, rtx x, int nregs, enum machine_mode mode)
1455 #ifdef HAVE_load_multiple
1463 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
1464 x = validize_mem (force_const_mem (mode, x));
1466 /* See if the machine can do this with a load multiple insn. */
1467 #ifdef HAVE_load_multiple
1468 if (HAVE_load_multiple)
1470 last = get_last_insn ();
1471 pat = gen_load_multiple (gen_rtx_REG (word_mode, regno), x,
1479 delete_insns_since (last);
1483 for (i = 0; i < nregs; i++)
1484 emit_move_insn (gen_rtx_REG (word_mode, regno + i),
1485 operand_subword_force (x, i, mode));
1488 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1489 The number of registers to be filled is NREGS. */
1492 move_block_from_reg (int regno, rtx x, int nregs)
1499 /* See if the machine can do this with a store multiple insn. */
1500 #ifdef HAVE_store_multiple
1501 if (HAVE_store_multiple)
1503 rtx last = get_last_insn ();
1504 rtx pat = gen_store_multiple (x, gen_rtx_REG (word_mode, regno),
1512 delete_insns_since (last);
1516 for (i = 0; i < nregs; i++)
1518 rtx tem = operand_subword (x, i, 1, BLKmode);
1522 emit_move_insn (tem, gen_rtx_REG (word_mode, regno + i));
1526 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1527 ORIG, where ORIG is a non-consecutive group of registers represented by
1528 a PARALLEL. The clone is identical to the original except in that the
1529 original set of registers is replaced by a new set of pseudo registers.
1530 The new set has the same modes as the original set. */
1533 gen_group_rtx (rtx orig)
1538 gcc_assert (GET_CODE (orig) == PARALLEL);
1540 length = XVECLEN (orig, 0);
1541 tmps = alloca (sizeof (rtx) * length);
1543 /* Skip a NULL entry in first slot. */
1544 i = XEXP (XVECEXP (orig, 0, 0), 0) ? 0 : 1;
1549 for (; i < length; i++)
1551 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (orig, 0, i), 0));
1552 rtx offset = XEXP (XVECEXP (orig, 0, i), 1);
1554 tmps[i] = gen_rtx_EXPR_LIST (VOIDmode, gen_reg_rtx (mode), offset);
1557 return gen_rtx_PARALLEL (GET_MODE (orig), gen_rtvec_v (length, tmps));
1560 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1561 except that values are placed in TMPS[i], and must later be moved
1562 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1565 emit_group_load_1 (rtx *tmps, rtx dst, rtx orig_src, tree type, int ssize)
1569 enum machine_mode m = GET_MODE (orig_src);
1571 gcc_assert (GET_CODE (dst) == PARALLEL);
1574 && !SCALAR_INT_MODE_P (m)
1575 && !MEM_P (orig_src)
1576 && GET_CODE (orig_src) != CONCAT)
1578 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_src));
1579 if (imode == BLKmode)
1580 src = assign_stack_temp (GET_MODE (orig_src), ssize, 0);
1582 src = gen_reg_rtx (imode);
1583 if (imode != BLKmode)
1584 src = gen_lowpart (GET_MODE (orig_src), src);
1585 emit_move_insn (src, orig_src);
1586 /* ...and back again. */
1587 if (imode != BLKmode)
1588 src = gen_lowpart (imode, src);
1589 emit_group_load_1 (tmps, dst, src, type, ssize);
1593 /* Check for a NULL entry, used to indicate that the parameter goes
1594 both on the stack and in registers. */
1595 if (XEXP (XVECEXP (dst, 0, 0), 0))
1600 /* Process the pieces. */
1601 for (i = start; i < XVECLEN (dst, 0); i++)
1603 enum machine_mode mode = GET_MODE (XEXP (XVECEXP (dst, 0, i), 0));
1604 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (dst, 0, i), 1));
1605 unsigned int bytelen = GET_MODE_SIZE (mode);
1608 /* Handle trailing fragments that run over the size of the struct. */
1609 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1611 /* Arrange to shift the fragment to where it belongs.
1612 extract_bit_field loads to the lsb of the reg. */
1614 #ifdef BLOCK_REG_PADDING
1615 BLOCK_REG_PADDING (GET_MODE (orig_src), type, i == start)
1616 == (BYTES_BIG_ENDIAN ? upward : downward)
1621 shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1622 bytelen = ssize - bytepos;
1623 gcc_assert (bytelen > 0);
1626 /* If we won't be loading directly from memory, protect the real source
1627 from strange tricks we might play; but make sure that the source can
1628 be loaded directly into the destination. */
1630 if (!MEM_P (orig_src)
1631 && (!CONSTANT_P (orig_src)
1632 || (GET_MODE (orig_src) != mode
1633 && GET_MODE (orig_src) != VOIDmode)))
1635 if (GET_MODE (orig_src) == VOIDmode)
1636 src = gen_reg_rtx (mode);
1638 src = gen_reg_rtx (GET_MODE (orig_src));
1640 emit_move_insn (src, orig_src);
1643 /* Optimize the access just a bit. */
1645 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (src))
1646 || MEM_ALIGN (src) >= GET_MODE_ALIGNMENT (mode))
1647 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1648 && bytelen == GET_MODE_SIZE (mode))
1650 tmps[i] = gen_reg_rtx (mode);
1651 emit_move_insn (tmps[i], adjust_address (src, mode, bytepos));
1653 else if (COMPLEX_MODE_P (mode)
1654 && GET_MODE (src) == mode
1655 && bytelen == GET_MODE_SIZE (mode))
1656 /* Let emit_move_complex do the bulk of the work. */
1658 else if (GET_CODE (src) == CONCAT)
1660 unsigned int slen = GET_MODE_SIZE (GET_MODE (src));
1661 unsigned int slen0 = GET_MODE_SIZE (GET_MODE (XEXP (src, 0)));
1663 if ((bytepos == 0 && bytelen == slen0)
1664 || (bytepos != 0 && bytepos + bytelen <= slen))
1666 /* The following assumes that the concatenated objects all
1667 have the same size. In this case, a simple calculation
1668 can be used to determine the object and the bit field
1670 tmps[i] = XEXP (src, bytepos / slen0);
1671 if (! CONSTANT_P (tmps[i])
1672 && (!REG_P (tmps[i]) || GET_MODE (tmps[i]) != mode))
1673 tmps[i] = extract_bit_field (tmps[i], bytelen * BITS_PER_UNIT,
1674 (bytepos % slen0) * BITS_PER_UNIT,
1675 1, NULL_RTX, mode, mode);
1681 gcc_assert (!bytepos);
1682 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1683 emit_move_insn (mem, src);
1684 tmps[i] = extract_bit_field (mem, bytelen * BITS_PER_UNIT,
1685 0, 1, NULL_RTX, mode, mode);
1688 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1689 SIMD register, which is currently broken. While we get GCC
1690 to emit proper RTL for these cases, let's dump to memory. */
1691 else if (VECTOR_MODE_P (GET_MODE (dst))
1694 int slen = GET_MODE_SIZE (GET_MODE (src));
1697 mem = assign_stack_temp (GET_MODE (src), slen, 0);
1698 emit_move_insn (mem, src);
1699 tmps[i] = adjust_address (mem, mode, (int) bytepos);
1701 else if (CONSTANT_P (src) && GET_MODE (dst) != BLKmode
1702 && XVECLEN (dst, 0) > 1)
1703 tmps[i] = simplify_gen_subreg (mode, src, GET_MODE(dst), bytepos);
1704 else if (CONSTANT_P (src)
1705 || (REG_P (src) && GET_MODE (src) == mode))
1708 tmps[i] = extract_bit_field (src, bytelen * BITS_PER_UNIT,
1709 bytepos * BITS_PER_UNIT, 1, NULL_RTX,
1713 tmps[i] = expand_shift (LSHIFT_EXPR, mode, tmps[i],
1714 build_int_cst (NULL_TREE, shift), tmps[i], 0);
1718 /* Emit code to move a block SRC of type TYPE to a block DST,
1719 where DST is non-consecutive registers represented by a PARALLEL.
1720 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1724 emit_group_load (rtx dst, rtx src, tree type, int ssize)
1729 tmps = alloca (sizeof (rtx) * XVECLEN (dst, 0));
1730 emit_group_load_1 (tmps, dst, src, type, ssize);
1732 /* Copy the extracted pieces into the proper (probable) hard regs. */
1733 for (i = 0; i < XVECLEN (dst, 0); i++)
1735 rtx d = XEXP (XVECEXP (dst, 0, i), 0);
1738 emit_move_insn (d, tmps[i]);
1742 /* Similar, but load SRC into new pseudos in a format that looks like
1743 PARALLEL. This can later be fed to emit_group_move to get things
1744 in the right place. */
1747 emit_group_load_into_temps (rtx parallel, rtx src, tree type, int ssize)
1752 vec = rtvec_alloc (XVECLEN (parallel, 0));
1753 emit_group_load_1 (&RTVEC_ELT (vec, 0), parallel, src, type, ssize);
1755 /* Convert the vector to look just like the original PARALLEL, except
1756 with the computed values. */
1757 for (i = 0; i < XVECLEN (parallel, 0); i++)
1759 rtx e = XVECEXP (parallel, 0, i);
1760 rtx d = XEXP (e, 0);
1764 d = force_reg (GET_MODE (d), RTVEC_ELT (vec, i));
1765 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), d, XEXP (e, 1));
1767 RTVEC_ELT (vec, i) = e;
1770 return gen_rtx_PARALLEL (GET_MODE (parallel), vec);
1773 /* Emit code to move a block SRC to block DST, where SRC and DST are
1774 non-consecutive groups of registers, each represented by a PARALLEL. */
1777 emit_group_move (rtx dst, rtx src)
1781 gcc_assert (GET_CODE (src) == PARALLEL
1782 && GET_CODE (dst) == PARALLEL
1783 && XVECLEN (src, 0) == XVECLEN (dst, 0));
1785 /* Skip first entry if NULL. */
1786 for (i = XEXP (XVECEXP (src, 0, 0), 0) ? 0 : 1; i < XVECLEN (src, 0); i++)
1787 emit_move_insn (XEXP (XVECEXP (dst, 0, i), 0),
1788 XEXP (XVECEXP (src, 0, i), 0));
1791 /* Move a group of registers represented by a PARALLEL into pseudos. */
1794 emit_group_move_into_temps (rtx src)
1796 rtvec vec = rtvec_alloc (XVECLEN (src, 0));
1799 for (i = 0; i < XVECLEN (src, 0); i++)
1801 rtx e = XVECEXP (src, 0, i);
1802 rtx d = XEXP (e, 0);
1805 e = alloc_EXPR_LIST (REG_NOTE_KIND (e), copy_to_reg (d), XEXP (e, 1));
1806 RTVEC_ELT (vec, i) = e;
1809 return gen_rtx_PARALLEL (GET_MODE (src), vec);
1812 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1813 where SRC is non-consecutive registers represented by a PARALLEL.
1814 SSIZE represents the total size of block ORIG_DST, or -1 if not
1818 emit_group_store (rtx orig_dst, rtx src, tree type ATTRIBUTE_UNUSED, int ssize)
1822 enum machine_mode m = GET_MODE (orig_dst);
1824 gcc_assert (GET_CODE (src) == PARALLEL);
1826 if (!SCALAR_INT_MODE_P (m)
1827 && !MEM_P (orig_dst) && GET_CODE (orig_dst) != CONCAT)
1829 enum machine_mode imode = int_mode_for_mode (GET_MODE (orig_dst));
1830 if (imode == BLKmode)
1831 dst = assign_stack_temp (GET_MODE (orig_dst), ssize, 0);
1833 dst = gen_reg_rtx (imode);
1834 emit_group_store (dst, src, type, ssize);
1835 if (imode != BLKmode)
1836 dst = gen_lowpart (GET_MODE (orig_dst), dst);
1837 emit_move_insn (orig_dst, dst);
1841 /* Check for a NULL entry, used to indicate that the parameter goes
1842 both on the stack and in registers. */
1843 if (XEXP (XVECEXP (src, 0, 0), 0))
1848 tmps = alloca (sizeof (rtx) * XVECLEN (src, 0));
1850 /* Copy the (probable) hard regs into pseudos. */
1851 for (i = start; i < XVECLEN (src, 0); i++)
1853 rtx reg = XEXP (XVECEXP (src, 0, i), 0);
1854 tmps[i] = gen_reg_rtx (GET_MODE (reg));
1855 emit_move_insn (tmps[i], reg);
1858 /* If we won't be storing directly into memory, protect the real destination
1859 from strange tricks we might play. */
1861 if (GET_CODE (dst) == PARALLEL)
1865 /* We can get a PARALLEL dst if there is a conditional expression in
1866 a return statement. In that case, the dst and src are the same,
1867 so no action is necessary. */
1868 if (rtx_equal_p (dst, src))
1871 /* It is unclear if we can ever reach here, but we may as well handle
1872 it. Allocate a temporary, and split this into a store/load to/from
1875 temp = assign_stack_temp (GET_MODE (dst), ssize, 0);
1876 emit_group_store (temp, src, type, ssize);
1877 emit_group_load (dst, temp, type, ssize);
1880 else if (!MEM_P (dst) && GET_CODE (dst) != CONCAT)
1882 dst = gen_reg_rtx (GET_MODE (orig_dst));
1883 /* Make life a bit easier for combine. */
1884 emit_move_insn (dst, CONST0_RTX (GET_MODE (orig_dst)));
1887 /* Process the pieces. */
1888 for (i = start; i < XVECLEN (src, 0); i++)
1890 HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));
1891 enum machine_mode mode = GET_MODE (tmps[i]);
1892 unsigned int bytelen = GET_MODE_SIZE (mode);
1895 /* Handle trailing fragments that run over the size of the struct. */
1896 if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)
1898 /* store_bit_field always takes its value from the lsb.
1899 Move the fragment to the lsb if it's not already there. */
1901 #ifdef BLOCK_REG_PADDING
1902 BLOCK_REG_PADDING (GET_MODE (orig_dst), type, i == start)
1903 == (BYTES_BIG_ENDIAN ? upward : downward)
1909 int shift = (bytelen - (ssize - bytepos)) * BITS_PER_UNIT;
1910 tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],
1911 build_int_cst (NULL_TREE, shift),
1914 bytelen = ssize - bytepos;
1917 if (GET_CODE (dst) == CONCAT)
1919 if (bytepos + bytelen <= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
1920 dest = XEXP (dst, 0);
1921 else if (bytepos >= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0))))
1923 bytepos -= GET_MODE_SIZE (GET_MODE (XEXP (dst, 0)));
1924 dest = XEXP (dst, 1);
1928 gcc_assert (bytepos == 0 && XVECLEN (src, 0));
1929 dest = assign_stack_temp (GET_MODE (dest),
1930 GET_MODE_SIZE (GET_MODE (dest)), 0);
1931 emit_move_insn (adjust_address (dest, GET_MODE (tmps[i]), bytepos),
1938 /* Optimize the access just a bit. */
1940 && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))
1941 || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))
1942 && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0
1943 && bytelen == GET_MODE_SIZE (mode))
1944 emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);
1946 store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,
1950 /* Copy from the pseudo into the (probable) hard reg. */
1951 if (orig_dst != dst)
1952 emit_move_insn (orig_dst, dst);
1955 /* Generate code to copy a BLKmode object of TYPE out of a
1956 set of registers starting with SRCREG into TGTBLK. If TGTBLK
1957 is null, a stack temporary is created. TGTBLK is returned.
1959 The purpose of this routine is to handle functions that return
1960 BLKmode structures in registers. Some machines (the PA for example)
1961 want to return all small structures in registers regardless of the
1962 structure's alignment. */
1965 copy_blkmode_from_reg (rtx tgtblk, rtx srcreg, tree type)
1967 unsigned HOST_WIDE_INT bytes = int_size_in_bytes (type);
1968 rtx src = NULL, dst = NULL;
1969 unsigned HOST_WIDE_INT bitsize = MIN (TYPE_ALIGN (type), BITS_PER_WORD);
1970 unsigned HOST_WIDE_INT bitpos, xbitpos, padding_correction = 0;
1974 tgtblk = assign_temp (build_qualified_type (type,
1976 | TYPE_QUAL_CONST)),
1978 preserve_temp_slots (tgtblk);
1981 /* This code assumes srcreg is at least a full word. If it isn't, copy it
1982 into a new pseudo which is a full word. */
1984 if (GET_MODE (srcreg) != BLKmode
1985 && GET_MODE_SIZE (GET_MODE (srcreg)) < UNITS_PER_WORD)
1986 srcreg = convert_to_mode (word_mode, srcreg, TYPE_UNSIGNED (type));
1988 /* If the structure doesn't take up a whole number of words, see whether
1989 SRCREG is padded on the left or on the right. If it's on the left,
1990 set PADDING_CORRECTION to the number of bits to skip.
1992 In most ABIs, the structure will be returned at the least end of
1993 the register, which translates to right padding on little-endian
1994 targets and left padding on big-endian targets. The opposite
1995 holds if the structure is returned at the most significant
1996 end of the register. */
1997 if (bytes % UNITS_PER_WORD != 0
1998 && (targetm.calls.return_in_msb (type)
2000 : BYTES_BIG_ENDIAN))
2002 = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD) * BITS_PER_UNIT));
2004 /* Copy the structure BITSIZE bites at a time.
2006 We could probably emit more efficient code for machines which do not use
2007 strict alignment, but it doesn't seem worth the effort at the current
2009 for (bitpos = 0, xbitpos = padding_correction;
2010 bitpos < bytes * BITS_PER_UNIT;
2011 bitpos += bitsize, xbitpos += bitsize)
2013 /* We need a new source operand each time xbitpos is on a
2014 word boundary and when xbitpos == padding_correction
2015 (the first time through). */
2016 if (xbitpos % BITS_PER_WORD == 0
2017 || xbitpos == padding_correction)
2018 src = operand_subword_force (srcreg, xbitpos / BITS_PER_WORD,
2021 /* We need a new destination operand each time bitpos is on
2023 if (bitpos % BITS_PER_WORD == 0)
2024 dst = operand_subword (tgtblk, bitpos / BITS_PER_WORD, 1, BLKmode);
2026 /* Use xbitpos for the source extraction (right justified) and
2027 xbitpos for the destination store (left justified). */
2028 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2029 extract_bit_field (src, bitsize,
2030 xbitpos % BITS_PER_WORD, 1,
2031 NULL_RTX, word_mode, word_mode));
2037 /* Add a USE expression for REG to the (possibly empty) list pointed
2038 to by CALL_FUSAGE. REG must denote a hard register. */
2041 use_reg (rtx *call_fusage, rtx reg)
2043 gcc_assert (REG_P (reg) && REGNO (reg) < FIRST_PSEUDO_REGISTER);
2046 = gen_rtx_EXPR_LIST (VOIDmode,
2047 gen_rtx_USE (VOIDmode, reg), *call_fusage);
2050 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2051 starting at REGNO. All of these registers must be hard registers. */
2054 use_regs (rtx *call_fusage, int regno, int nregs)
2058 gcc_assert (regno + nregs <= FIRST_PSEUDO_REGISTER);
2060 for (i = 0; i < nregs; i++)
2061 use_reg (call_fusage, regno_reg_rtx[regno + i]);
2064 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2065 PARALLEL REGS. This is for calls that pass values in multiple
2066 non-contiguous locations. The Irix 6 ABI has examples of this. */
2069 use_group_regs (rtx *call_fusage, rtx regs)
2073 for (i = 0; i < XVECLEN (regs, 0); i++)
2075 rtx reg = XEXP (XVECEXP (regs, 0, i), 0);
2077 /* A NULL entry means the parameter goes both on the stack and in
2078 registers. This can also be a MEM for targets that pass values
2079 partially on the stack and partially in registers. */
2080 if (reg != 0 && REG_P (reg))
2081 use_reg (call_fusage, reg);
2086 /* Determine whether the LEN bytes generated by CONSTFUN can be
2087 stored to memory using several move instructions. CONSTFUNDATA is
2088 a pointer which will be passed as argument in every CONSTFUN call.
2089 ALIGN is maximum alignment we can assume. Return nonzero if a
2090 call to store_by_pieces should succeed. */
2093 can_store_by_pieces (unsigned HOST_WIDE_INT len,
2094 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2095 void *constfundata, unsigned int align)
2097 unsigned HOST_WIDE_INT l;
2098 unsigned int max_size;
2099 HOST_WIDE_INT offset = 0;
2100 enum machine_mode mode, tmode;
2101 enum insn_code icode;
2108 if (! STORE_BY_PIECES_P (len, align))
2111 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2112 if (align >= GET_MODE_ALIGNMENT (tmode))
2113 align = GET_MODE_ALIGNMENT (tmode);
2116 enum machine_mode xmode;
2118 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2120 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2121 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2122 || SLOW_UNALIGNED_ACCESS (tmode, align))
2125 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2128 /* We would first store what we can in the largest integer mode, then go to
2129 successively smaller modes. */
2132 reverse <= (HAVE_PRE_DECREMENT || HAVE_POST_DECREMENT);
2137 max_size = STORE_MAX_PIECES + 1;
2138 while (max_size > 1)
2140 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2141 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2142 if (GET_MODE_SIZE (tmode) < max_size)
2145 if (mode == VOIDmode)
2148 icode = mov_optab->handlers[(int) mode].insn_code;
2149 if (icode != CODE_FOR_nothing
2150 && align >= GET_MODE_ALIGNMENT (mode))
2152 unsigned int size = GET_MODE_SIZE (mode);
2159 cst = (*constfun) (constfundata, offset, mode);
2160 if (!LEGITIMATE_CONSTANT_P (cst))
2170 max_size = GET_MODE_SIZE (mode);
2173 /* The code above should have handled everything. */
2180 /* Generate several move instructions to store LEN bytes generated by
2181 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2182 pointer which will be passed as argument in every CONSTFUN call.
2183 ALIGN is maximum alignment we can assume.
2184 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2185 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2189 store_by_pieces (rtx to, unsigned HOST_WIDE_INT len,
2190 rtx (*constfun) (void *, HOST_WIDE_INT, enum machine_mode),
2191 void *constfundata, unsigned int align, int endp)
2193 struct store_by_pieces data;
2197 gcc_assert (endp != 2);
2201 gcc_assert (STORE_BY_PIECES_P (len, align));
2202 data.constfun = constfun;
2203 data.constfundata = constfundata;
2206 store_by_pieces_1 (&data, align);
2211 gcc_assert (!data.reverse);
2216 if (HAVE_POST_INCREMENT && data.explicit_inc_to > 0)
2217 emit_insn (gen_add2_insn (data.to_addr, constm1_rtx));
2219 data.to_addr = copy_addr_to_reg (plus_constant (data.to_addr,
2222 to1 = adjust_automodify_address (data.to, QImode, data.to_addr,
2229 to1 = adjust_address (data.to, QImode, data.offset);
2237 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2238 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2241 clear_by_pieces (rtx to, unsigned HOST_WIDE_INT len, unsigned int align)
2243 struct store_by_pieces data;
2248 data.constfun = clear_by_pieces_1;
2249 data.constfundata = NULL;
2252 store_by_pieces_1 (&data, align);
2255 /* Callback routine for clear_by_pieces.
2256 Return const0_rtx unconditionally. */
2259 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED,
2260 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
2261 enum machine_mode mode ATTRIBUTE_UNUSED)
2266 /* Subroutine of clear_by_pieces and store_by_pieces.
2267 Generate several move instructions to store LEN bytes of block TO. (A MEM
2268 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2271 store_by_pieces_1 (struct store_by_pieces *data ATTRIBUTE_UNUSED,
2272 unsigned int align ATTRIBUTE_UNUSED)
2274 rtx to_addr = XEXP (data->to, 0);
2275 unsigned int max_size = STORE_MAX_PIECES + 1;
2276 enum machine_mode mode = VOIDmode, tmode;
2277 enum insn_code icode;
2280 data->to_addr = to_addr;
2282 = (GET_CODE (to_addr) == PRE_INC || GET_CODE (to_addr) == PRE_DEC
2283 || GET_CODE (to_addr) == POST_INC || GET_CODE (to_addr) == POST_DEC);
2285 data->explicit_inc_to = 0;
2287 = (GET_CODE (to_addr) == PRE_DEC || GET_CODE (to_addr) == POST_DEC);
2289 data->offset = data->len;
2291 /* If storing requires more than two move insns,
2292 copy addresses to registers (to make displacements shorter)
2293 and use post-increment if available. */
2294 if (!data->autinc_to
2295 && move_by_pieces_ninsns (data->len, align, max_size) > 2)
2297 /* Determine the main mode we'll be using. */
2298 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2299 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2300 if (GET_MODE_SIZE (tmode) < max_size)
2303 if (USE_STORE_PRE_DECREMENT (mode) && data->reverse && ! data->autinc_to)
2305 data->to_addr = copy_addr_to_reg (plus_constant (to_addr, data->len));
2306 data->autinc_to = 1;
2307 data->explicit_inc_to = -1;
2310 if (USE_STORE_POST_INCREMENT (mode) && ! data->reverse
2311 && ! data->autinc_to)
2313 data->to_addr = copy_addr_to_reg (to_addr);
2314 data->autinc_to = 1;
2315 data->explicit_inc_to = 1;
2318 if ( !data->autinc_to && CONSTANT_P (to_addr))
2319 data->to_addr = copy_addr_to_reg (to_addr);
2322 tmode = mode_for_size (STORE_MAX_PIECES * BITS_PER_UNIT, MODE_INT, 1);
2323 if (align >= GET_MODE_ALIGNMENT (tmode))
2324 align = GET_MODE_ALIGNMENT (tmode);
2327 enum machine_mode xmode;
2329 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT), xmode = tmode;
2331 xmode = tmode, tmode = GET_MODE_WIDER_MODE (tmode))
2332 if (GET_MODE_SIZE (tmode) > STORE_MAX_PIECES
2333 || SLOW_UNALIGNED_ACCESS (tmode, align))
2336 align = MAX (align, GET_MODE_ALIGNMENT (xmode));
2339 /* First store what we can in the largest integer mode, then go to
2340 successively smaller modes. */
2342 while (max_size > 1)
2344 for (tmode = GET_CLASS_NARROWEST_MODE (MODE_INT);
2345 tmode != VOIDmode; tmode = GET_MODE_WIDER_MODE (tmode))
2346 if (GET_MODE_SIZE (tmode) < max_size)
2349 if (mode == VOIDmode)
2352 icode = mov_optab->handlers[(int) mode].insn_code;
2353 if (icode != CODE_FOR_nothing && align >= GET_MODE_ALIGNMENT (mode))
2354 store_by_pieces_2 (GEN_FCN (icode), mode, data);
2356 max_size = GET_MODE_SIZE (mode);
2359 /* The code above should have handled everything. */
2360 gcc_assert (!data->len);
2363 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2364 with move instructions for mode MODE. GENFUN is the gen_... function
2365 to make a move insn for that mode. DATA has all the other info. */
2368 store_by_pieces_2 (rtx (*genfun) (rtx, ...), enum machine_mode mode,
2369 struct store_by_pieces *data)
2371 unsigned int size = GET_MODE_SIZE (mode);
2374 while (data->len >= size)
2377 data->offset -= size;
2379 if (data->autinc_to)
2380 to1 = adjust_automodify_address (data->to, mode, data->to_addr,
2383 to1 = adjust_address (data->to, mode, data->offset);
2385 if (HAVE_PRE_DECREMENT && data->explicit_inc_to < 0)
2386 emit_insn (gen_add2_insn (data->to_addr,
2387 GEN_INT (-(HOST_WIDE_INT) size)));
2389 cst = (*data->constfun) (data->constfundata, data->offset, mode);
2390 emit_insn ((*genfun) (to1, cst));
2392 if (HAVE_POST_INCREMENT && data->explicit_inc_to > 0)
2393 emit_insn (gen_add2_insn (data->to_addr, GEN_INT (size)));
2395 if (! data->reverse)
2396 data->offset += size;
2402 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2403 its length in bytes. */
2406 clear_storage (rtx object, rtx size)
2408 enum machine_mode mode = GET_MODE (object);
2411 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2412 just move a zero. Otherwise, do this a piece at a time. */
2414 && GET_CODE (size) == CONST_INT
2415 && INTVAL (size) == (HOST_WIDE_INT) GET_MODE_SIZE (mode))
2417 rtx zero = CONST0_RTX (mode);
2420 emit_move_insn (object, zero);
2424 if (COMPLEX_MODE_P (mode))
2426 zero = CONST0_RTX (GET_MODE_INNER (mode));
2429 write_complex_part (object, zero, 0);
2430 write_complex_part (object, zero, 1);
2436 if (size == const0_rtx)
2439 align = MEM_ALIGN (object);
2441 if (GET_CODE (size) == CONST_INT
2442 && CLEAR_BY_PIECES_P (INTVAL (size), align))
2443 clear_by_pieces (object, INTVAL (size), align);
2444 else if (clear_storage_via_clrmem (object, size, align))
2447 return clear_storage_via_libcall (object, size);
2452 /* A subroutine of clear_storage. Expand a clrmem pattern;
2453 return true if successful. */
2456 clear_storage_via_clrmem (rtx object, rtx size, unsigned int align)
2458 /* Try the most limited insn first, because there's no point
2459 including more than one in the machine description unless
2460 the more limited one has some advantage. */
2462 rtx opalign = GEN_INT (align / BITS_PER_UNIT);
2463 enum machine_mode mode;
2465 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
2466 mode = GET_MODE_WIDER_MODE (mode))
2468 enum insn_code code = clrmem_optab[(int) mode];
2469 insn_operand_predicate_fn pred;
2471 if (code != CODE_FOR_nothing
2472 /* We don't need MODE to be narrower than
2473 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2474 the mode mask, as it is returned by the macro, it will
2475 definitely be less than the actual mode mask. */
2476 && ((GET_CODE (size) == CONST_INT
2477 && ((unsigned HOST_WIDE_INT) INTVAL (size)
2478 <= (GET_MODE_MASK (mode) >> 1)))
2479 || GET_MODE_BITSIZE (mode) >= BITS_PER_WORD)
2480 && ((pred = insn_data[(int) code].operand[0].predicate) == 0
2481 || (*pred) (object, BLKmode))
2482 && ((pred = insn_data[(int) code].operand[2].predicate) == 0
2483 || (*pred) (opalign, VOIDmode)))
2486 rtx last = get_last_insn ();
2489 op1 = convert_to_mode (mode, size, 1);
2490 pred = insn_data[(int) code].operand[1].predicate;
2491 if (pred != 0 && ! (*pred) (op1, mode))
2492 op1 = copy_to_mode_reg (mode, op1);
2494 pat = GEN_FCN ((int) code) (object, op1, opalign);
2501 delete_insns_since (last);
2508 /* A subroutine of clear_storage. Expand a call to memset.
2509 Return the return value of memset, 0 otherwise. */
2512 clear_storage_via_libcall (rtx object, rtx size)
2514 tree call_expr, arg_list, fn, object_tree, size_tree;
2515 enum machine_mode size_mode;
2518 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2519 place those into new pseudos into a VAR_DECL and use them later. */
2521 object = copy_to_mode_reg (Pmode, XEXP (object, 0));
2523 size_mode = TYPE_MODE (sizetype);
2524 size = convert_to_mode (size_mode, size, 1);
2525 size = copy_to_mode_reg (size_mode, size);
2527 /* It is incorrect to use the libcall calling conventions to call
2528 memset in this context. This could be a user call to memset and
2529 the user may wish to examine the return value from memset. For
2530 targets where libcalls and normal calls have different conventions
2531 for returning pointers, we could end up generating incorrect code. */
2533 object_tree = make_tree (ptr_type_node, object);
2534 size_tree = make_tree (sizetype, size);
2536 fn = clear_storage_libcall_fn (true);
2537 arg_list = tree_cons (NULL_TREE, size_tree, NULL_TREE);
2538 arg_list = tree_cons (NULL_TREE, integer_zero_node, arg_list);
2539 arg_list = tree_cons (NULL_TREE, object_tree, arg_list);
2541 /* Now we have to build up the CALL_EXPR itself. */
2542 call_expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2543 call_expr = build3 (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)),
2544 call_expr, arg_list, NULL_TREE);
2546 retval = expand_expr (call_expr, NULL_RTX, VOIDmode, 0);
2551 /* A subroutine of clear_storage_via_libcall. Create the tree node
2552 for the function we use for block clears. The first time FOR_CALL
2553 is true, we call assemble_external. */
2555 static GTY(()) tree block_clear_fn;
2558 init_block_clear_fn (const char *asmspec)
2560 if (!block_clear_fn)
2564 fn = get_identifier ("memset");
2565 args = build_function_type_list (ptr_type_node, ptr_type_node,
2566 integer_type_node, sizetype,
2569 fn = build_decl (FUNCTION_DECL, fn, args);
2570 DECL_EXTERNAL (fn) = 1;
2571 TREE_PUBLIC (fn) = 1;
2572 DECL_ARTIFICIAL (fn) = 1;
2573 TREE_NOTHROW (fn) = 1;
2575 block_clear_fn = fn;
2579 set_user_assembler_name (block_clear_fn, asmspec);
2583 clear_storage_libcall_fn (int for_call)
2585 static bool emitted_extern;
2587 if (!block_clear_fn)
2588 init_block_clear_fn (NULL);
2590 if (for_call && !emitted_extern)
2592 emitted_extern = true;
2593 make_decl_rtl (block_clear_fn);
2594 assemble_external (block_clear_fn);
2597 return block_clear_fn;
2600 /* Write to one of the components of the complex value CPLX. Write VAL to
2601 the real part if IMAG_P is false, and the imaginary part if its true. */
2604 write_complex_part (rtx cplx, rtx val, bool imag_p)
2606 enum machine_mode cmode;
2607 enum machine_mode imode;
2610 if (GET_CODE (cplx) == CONCAT)
2612 emit_move_insn (XEXP (cplx, imag_p), val);
2616 cmode = GET_MODE (cplx);
2617 imode = GET_MODE_INNER (cmode);
2618 ibitsize = GET_MODE_BITSIZE (imode);
2620 /* If the sub-object is at least word sized, then we know that subregging
2621 will work. This special case is important, since store_bit_field
2622 wants to operate on integer modes, and there's rarely an OImode to
2623 correspond to TCmode. */
2624 if (ibitsize >= BITS_PER_WORD
2625 /* For hard regs we have exact predicates. Assume we can split
2626 the original object if it spans an even number of hard regs.
2627 This special case is important for SCmode on 64-bit platforms
2628 where the natural size of floating-point regs is 32-bit. */
2629 || (GET_CODE (cplx) == REG
2630 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2631 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0)
2632 /* For MEMs we always try to make a "subreg", that is to adjust
2633 the MEM, because store_bit_field may generate overly
2634 convoluted RTL for sub-word fields. */
2637 rtx part = simplify_gen_subreg (imode, cplx, cmode,
2638 imag_p ? GET_MODE_SIZE (imode) : 0);
2641 emit_move_insn (part, val);
2645 /* simplify_gen_subreg may fail for sub-word MEMs. */
2646 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2649 store_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0, imode, val);
2652 /* Extract one of the components of the complex value CPLX. Extract the
2653 real part if IMAG_P is false, and the imaginary part if it's true. */
2656 read_complex_part (rtx cplx, bool imag_p)
2658 enum machine_mode cmode, imode;
2661 if (GET_CODE (cplx) == CONCAT)
2662 return XEXP (cplx, imag_p);
2664 cmode = GET_MODE (cplx);
2665 imode = GET_MODE_INNER (cmode);
2666 ibitsize = GET_MODE_BITSIZE (imode);
2668 /* Special case reads from complex constants that got spilled to memory. */
2669 if (MEM_P (cplx) && GET_CODE (XEXP (cplx, 0)) == SYMBOL_REF)
2671 tree decl = SYMBOL_REF_DECL (XEXP (cplx, 0));
2672 if (decl && TREE_CODE (decl) == COMPLEX_CST)
2674 tree part = imag_p ? TREE_IMAGPART (decl) : TREE_REALPART (decl);
2675 if (CONSTANT_CLASS_P (part))
2676 return expand_expr (part, NULL_RTX, imode, EXPAND_NORMAL);
2680 /* If the sub-object is at least word sized, then we know that subregging
2681 will work. This special case is important, since extract_bit_field
2682 wants to operate on integer modes, and there's rarely an OImode to
2683 correspond to TCmode. */
2684 if (ibitsize >= BITS_PER_WORD
2685 /* For hard regs we have exact predicates. Assume we can split
2686 the original object if it spans an even number of hard regs.
2687 This special case is important for SCmode on 64-bit platforms
2688 where the natural size of floating-point regs is 32-bit. */
2689 || (GET_CODE (cplx) == REG
2690 && REGNO (cplx) < FIRST_PSEUDO_REGISTER
2691 && hard_regno_nregs[REGNO (cplx)][cmode] % 2 == 0)
2692 /* For MEMs we always try to make a "subreg", that is to adjust
2693 the MEM, because extract_bit_field may generate overly
2694 convoluted RTL for sub-word fields. */
2697 rtx ret = simplify_gen_subreg (imode, cplx, cmode,
2698 imag_p ? GET_MODE_SIZE (imode) : 0);
2702 /* simplify_gen_subreg may fail for sub-word MEMs. */
2703 gcc_assert (MEM_P (cplx) && ibitsize < BITS_PER_WORD);
2706 return extract_bit_field (cplx, ibitsize, imag_p ? ibitsize : 0,
2707 true, NULL_RTX, imode, imode);
2710 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2711 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2712 represented in NEW_MODE. If FORCE is true, this will never happen, as
2713 we'll force-create a SUBREG if needed. */
2716 emit_move_change_mode (enum machine_mode new_mode,
2717 enum machine_mode old_mode, rtx x, bool force)
2721 if (reload_in_progress && MEM_P (x))
2723 /* We can't use gen_lowpart here because it may call change_address
2724 which is not appropriate if we were called when a reload was in
2725 progress. We don't have to worry about changing the address since
2726 the size in bytes is supposed to be the same. Copy the MEM to
2727 change the mode and move any substitutions from the old MEM to
2730 ret = adjust_address_nv (x, new_mode, 0);
2731 copy_replacements (x, ret);
2735 /* Note that we do want simplify_subreg's behavior of validating
2736 that the new mode is ok for a hard register. If we were to use
2737 simplify_gen_subreg, we would create the subreg, but would
2738 probably run into the target not being able to implement it. */
2739 /* Except, of course, when FORCE is true, when this is exactly what
2740 we want. Which is needed for CCmodes on some targets. */
2742 ret = simplify_gen_subreg (new_mode, x, old_mode, 0);
2744 ret = simplify_subreg (new_mode, x, old_mode, 0);
2750 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
2751 an integer mode of the same size as MODE. Returns the instruction
2752 emitted, or NULL if such a move could not be generated. */
2755 emit_move_via_integer (enum machine_mode mode, rtx x, rtx y)
2757 enum machine_mode imode;
2758 enum insn_code code;
2760 /* There must exist a mode of the exact size we require. */
2761 imode = int_mode_for_mode (mode);
2762 if (imode == BLKmode)
2765 /* The target must support moves in this mode. */
2766 code = mov_optab->handlers[imode].insn_code;
2767 if (code == CODE_FOR_nothing)
2770 x = emit_move_change_mode (imode, mode, x, false);
2773 y = emit_move_change_mode (imode, mode, y, false);
2776 return emit_insn (GEN_FCN (code) (x, y));
2779 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
2780 Return an equivalent MEM that does not use an auto-increment. */
2783 emit_move_resolve_push (enum machine_mode mode, rtx x)
2785 enum rtx_code code = GET_CODE (XEXP (x, 0));
2786 HOST_WIDE_INT adjust;
2789 adjust = GET_MODE_SIZE (mode);
2790 #ifdef PUSH_ROUNDING
2791 adjust = PUSH_ROUNDING (adjust);
2793 if (code == PRE_DEC || code == POST_DEC)
2796 /* Do not use anti_adjust_stack, since we don't want to update
2797 stack_pointer_delta. */
2798 temp = expand_simple_binop (Pmode, PLUS, stack_pointer_rtx,
2799 GEN_INT (adjust), stack_pointer_rtx,
2800 0, OPTAB_LIB_WIDEN);
2801 if (temp != stack_pointer_rtx)
2802 emit_move_insn (stack_pointer_rtx, temp);
2808 temp = stack_pointer_rtx;
2811 temp = plus_constant (stack_pointer_rtx, -GET_MODE_SIZE (mode));
2814 temp = plus_constant (stack_pointer_rtx, GET_MODE_SIZE (mode));
2820 return replace_equiv_address (x, temp);
2823 /* A subroutine of emit_move_complex. Generate a move from Y into X.
2824 X is known to satisfy push_operand, and MODE is known to be complex.
2825 Returns the last instruction emitted. */
2828 emit_move_complex_push (enum machine_mode mode, rtx x, rtx y)
2830 enum machine_mode submode = GET_MODE_INNER (mode);
2833 #ifdef PUSH_ROUNDING
2834 unsigned int submodesize = GET_MODE_SIZE (submode);
2836 /* In case we output to the stack, but the size is smaller than the
2837 machine can push exactly, we need to use move instructions. */
2838 if (PUSH_ROUNDING (submodesize) != submodesize)
2840 x = emit_move_resolve_push (mode, x);
2841 return emit_move_insn (x, y);
2845 /* Note that the real part always precedes the imag part in memory
2846 regardless of machine's endianness. */
2847 switch (GET_CODE (XEXP (x, 0)))
2861 emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
2862 read_complex_part (y, imag_first));
2863 return emit_move_insn (gen_rtx_MEM (submode, XEXP (x, 0)),
2864 read_complex_part (y, !imag_first));
2867 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
2868 MODE is known to be complex. Returns the last instruction emitted. */
2871 emit_move_complex (enum machine_mode mode, rtx x, rtx y)
2875 /* Need to take special care for pushes, to maintain proper ordering
2876 of the data, and possibly extra padding. */
2877 if (push_operand (x, mode))
2878 return emit_move_complex_push (mode, x, y);
2880 /* For memory to memory moves, optimal behavior can be had with the
2881 existing block move logic. */
2882 if (MEM_P (x) && MEM_P (y))
2884 emit_block_move (x, y, GEN_INT (GET_MODE_SIZE (mode)),
2885 BLOCK_OP_NO_LIBCALL);
2886 return get_last_insn ();
2889 /* See if we can coerce the target into moving both values at once. */
2891 /* Not possible if the values are inherently not adjacent. */
2892 if (GET_CODE (x) == CONCAT || GET_CODE (y) == CONCAT)
2894 /* Is possible if both are registers (or subregs of registers). */
2895 else if (register_operand (x, mode) && register_operand (y, mode))
2897 /* If one of the operands is a memory, and alignment constraints
2898 are friendly enough, we may be able to do combined memory operations.
2899 We do not attempt this if Y is a constant because that combination is
2900 usually better with the by-parts thing below. */
2901 else if ((MEM_P (x) ? !CONSTANT_P (y) : MEM_P (y))
2902 && (!STRICT_ALIGNMENT
2903 || get_mode_alignment (mode) == BIGGEST_ALIGNMENT))
2910 rtx ret = emit_move_via_integer (mode, x, y);
2915 /* Show the output dies here. This is necessary for SUBREGs
2916 of pseudos since we cannot track their lifetimes correctly;
2917 hard regs shouldn't appear here except as return values. */
2918 if (!reload_completed && !reload_in_progress
2919 && REG_P (x) && !reg_overlap_mentioned_p (x, y))
2920 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
2922 write_complex_part (x, read_complex_part (y, false), false);
2923 write_complex_part (x, read_complex_part (y, true), true);
2924 return get_last_insn ();
2927 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
2928 MODE is known to be MODE_CC. Returns the last instruction emitted. */
2931 emit_move_ccmode (enum machine_mode mode, rtx x, rtx y)
2935 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
2938 enum insn_code code = mov_optab->handlers[CCmode].insn_code;
2939 if (code != CODE_FOR_nothing)
2941 x = emit_move_change_mode (CCmode, mode, x, true);
2942 y = emit_move_change_mode (CCmode, mode, y, true);
2943 return emit_insn (GEN_FCN (code) (x, y));
2947 /* Otherwise, find the MODE_INT mode of the same width. */
2948 ret = emit_move_via_integer (mode, x, y);
2949 gcc_assert (ret != NULL);
2953 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
2954 MODE is any multi-word or full-word mode that lacks a move_insn
2955 pattern. Note that you will get better code if you define such
2956 patterns, even if they must turn into multiple assembler instructions. */
2959 emit_move_multi_word (enum machine_mode mode, rtx x, rtx y)
2966 gcc_assert (GET_MODE_SIZE (mode) >= UNITS_PER_WORD);
2968 /* If X is a push on the stack, do the push now and replace
2969 X with a reference to the stack pointer. */
2970 if (push_operand (x, mode))
2971 x = emit_move_resolve_push (mode, x);
2973 /* If we are in reload, see if either operand is a MEM whose address
2974 is scheduled for replacement. */
2975 if (reload_in_progress && MEM_P (x)
2976 && (inner = find_replacement (&XEXP (x, 0))) != XEXP (x, 0))
2977 x = replace_equiv_address_nv (x, inner);
2978 if (reload_in_progress && MEM_P (y)
2979 && (inner = find_replacement (&XEXP (y, 0))) != XEXP (y, 0))
2980 y = replace_equiv_address_nv (y, inner);
2984 need_clobber = false;
2986 i < (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
2989 rtx xpart = operand_subword (x, i, 1, mode);
2990 rtx ypart = operand_subword (y, i, 1, mode);
2992 /* If we can't get a part of Y, put Y into memory if it is a
2993 constant. Otherwise, force it into a register. If we still
2994 can't get a part of Y, abort. */
2995 if (ypart == 0 && CONSTANT_P (y))
2997 y = force_const_mem (mode, y);
2998 ypart = operand_subword (y, i, 1, mode);
3000 else if (ypart == 0)
3001 ypart = operand_subword_force (y, i, mode);
3003 gcc_assert (xpart && ypart);
3005 need_clobber |= (GET_CODE (xpart) == SUBREG);
3007 last_insn = emit_move_insn (xpart, ypart);
3013 /* Show the output dies here. This is necessary for SUBREGs
3014 of pseudos since we cannot track their lifetimes correctly;
3015 hard regs shouldn't appear here except as return values.
3016 We never want to emit such a clobber after reload. */
3018 && ! (reload_in_progress || reload_completed)
3019 && need_clobber != 0)
3020 emit_insn (gen_rtx_CLOBBER (VOIDmode, x));
3027 /* Low level part of emit_move_insn.
3028 Called just like emit_move_insn, but assumes X and Y
3029 are basically valid. */
3032 emit_move_insn_1 (rtx x, rtx y)
3034 enum machine_mode mode = GET_MODE (x);
3035 enum insn_code code;
3037 gcc_assert ((unsigned int) mode < (unsigned int) MAX_MACHINE_MODE);
3039 code = mov_optab->handlers[mode].insn_code;
3040 if (code != CODE_FOR_nothing)
3041 return emit_insn (GEN_FCN (code) (x, y));
3043 /* Expand complex moves by moving real part and imag part. */
3044 if (COMPLEX_MODE_P (mode))
3045 return emit_move_complex (mode, x, y);
3047 if (GET_MODE_CLASS (mode) == MODE_CC)
3048 return emit_move_ccmode (mode, x, y);
3050 /* Try using a move pattern for the corresponding integer mode. This is
3051 only safe when simplify_subreg can convert MODE constants into integer
3052 constants. At present, it can only do this reliably if the value
3053 fits within a HOST_WIDE_INT. */
3054 if (!CONSTANT_P (y) || GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3056 rtx ret = emit_move_via_integer (mode, x, y);
3061 return emit_move_multi_word (mode, x, y);
3064 /* Generate code to copy Y into X.
3065 Both Y and X must have the same mode, except that
3066 Y can be a constant with VOIDmode.
3067 This mode cannot be BLKmode; use emit_block_move for that.
3069 Return the last instruction emitted. */
3072 emit_move_insn (rtx x, rtx y)
3074 enum machine_mode mode = GET_MODE (x);
3075 rtx y_cst = NULL_RTX;
3078 gcc_assert (mode != BLKmode
3079 && (GET_MODE (y) == mode || GET_MODE (y) == VOIDmode));
3084 && SCALAR_FLOAT_MODE_P (GET_MODE (x))
3085 && (last_insn = compress_float_constant (x, y)))
3090 if (!LEGITIMATE_CONSTANT_P (y))
3092 y = force_const_mem (mode, y);
3094 /* If the target's cannot_force_const_mem prevented the spill,
3095 assume that the target's move expanders will also take care
3096 of the non-legitimate constant. */
3102 /* If X or Y are memory references, verify that their addresses are valid
3105 && ((! memory_address_p (GET_MODE (x), XEXP (x, 0))
3106 && ! push_operand (x, GET_MODE (x)))
3108 && CONSTANT_ADDRESS_P (XEXP (x, 0)))))
3109 x = validize_mem (x);
3112 && (! memory_address_p (GET_MODE (y), XEXP (y, 0))
3114 && CONSTANT_ADDRESS_P (XEXP (y, 0)))))
3115 y = validize_mem (y);
3117 gcc_assert (mode != BLKmode);
3119 last_insn = emit_move_insn_1 (x, y);
3121 if (y_cst && REG_P (x)
3122 && (set = single_set (last_insn)) != NULL_RTX
3123 && SET_DEST (set) == x
3124 && ! rtx_equal_p (y_cst, SET_SRC (set)))
3125 set_unique_reg_note (last_insn, REG_EQUAL, y_cst);
3130 /* If Y is representable exactly in a narrower mode, and the target can
3131 perform the extension directly from constant or memory, then emit the
3132 move as an extension. */
3135 compress_float_constant (rtx x, rtx y)
3137 enum machine_mode dstmode = GET_MODE (x);
3138 enum machine_mode orig_srcmode = GET_MODE (y);
3139 enum machine_mode srcmode;
3142 REAL_VALUE_FROM_CONST_DOUBLE (r, y);
3144 for (srcmode = GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode));
3145 srcmode != orig_srcmode;
3146 srcmode = GET_MODE_WIDER_MODE (srcmode))
3149 rtx trunc_y, last_insn;
3151 /* Skip if the target can't extend this way. */
3152 ic = can_extend_p (dstmode, srcmode, 0);
3153 if (ic == CODE_FOR_nothing)
3156 /* Skip if the narrowed value isn't exact. */
3157 if (! exact_real_truncate (srcmode, &r))
3160 trunc_y = CONST_DOUBLE_FROM_REAL_VALUE (r, srcmode);
3162 if (LEGITIMATE_CONSTANT_P (trunc_y))
3164 /* Skip if the target needs extra instructions to perform
3166 if (! (*insn_data[ic].operand[1].predicate) (trunc_y, srcmode))
3169 else if (float_extend_from_mem[dstmode][srcmode])
3170 trunc_y = validize_mem (force_const_mem (srcmode, trunc_y));
3174 emit_unop_insn (ic, x, trunc_y, UNKNOWN);
3175 last_insn = get_last_insn ();
3178 set_unique_reg_note (last_insn, REG_EQUAL, y);
3186 /* Pushing data onto the stack. */
3188 /* Push a block of length SIZE (perhaps variable)
3189 and return an rtx to address the beginning of the block.
3190 The value may be virtual_outgoing_args_rtx.
3192 EXTRA is the number of bytes of padding to push in addition to SIZE.
3193 BELOW nonzero means this padding comes at low addresses;
3194 otherwise, the padding comes at high addresses. */
3197 push_block (rtx size, int extra, int below)
3201 size = convert_modes (Pmode, ptr_mode, size, 1);
3202 if (CONSTANT_P (size))
3203 anti_adjust_stack (plus_constant (size, extra));
3204 else if (REG_P (size) && extra == 0)
3205 anti_adjust_stack (size);
3208 temp = copy_to_mode_reg (Pmode, size);
3210 temp = expand_binop (Pmode, add_optab, temp, GEN_INT (extra),
3211 temp, 0, OPTAB_LIB_WIDEN);
3212 anti_adjust_stack (temp);
3215 #ifndef STACK_GROWS_DOWNWARD
3221 temp = virtual_outgoing_args_rtx;
3222 if (extra != 0 && below)
3223 temp = plus_constant (temp, extra);
3227 if (GET_CODE (size) == CONST_INT)
3228 temp = plus_constant (virtual_outgoing_args_rtx,
3229 -INTVAL (size) - (below ? 0 : extra));
3230 else if (extra != 0 && !below)
3231 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3232 negate_rtx (Pmode, plus_constant (size, extra)));
3234 temp = gen_rtx_PLUS (Pmode, virtual_outgoing_args_rtx,
3235 negate_rtx (Pmode, size));
3238 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT), temp);
3241 #ifdef PUSH_ROUNDING
3243 /* Emit single push insn. */
3246 emit_single_push_insn (enum machine_mode mode, rtx x, tree type)
3249 unsigned rounded_size = PUSH_ROUNDING (GET_MODE_SIZE (mode));
3251 enum insn_code icode;
3252 insn_operand_predicate_fn pred;
3254 stack_pointer_delta += PUSH_ROUNDING (GET_MODE_SIZE (mode));
3255 /* If there is push pattern, use it. Otherwise try old way of throwing
3256 MEM representing push operation to move expander. */
3257 icode = push_optab->handlers[(int) mode].insn_code;
3258 if (icode != CODE_FOR_nothing)
3260 if (((pred = insn_data[(int) icode].operand[0].predicate)
3261 && !((*pred) (x, mode))))
3262 x = force_reg (mode, x);
3263 emit_insn (GEN_FCN (icode) (x));
3266 if (GET_MODE_SIZE (mode) == rounded_size)
3267 dest_addr = gen_rtx_fmt_e (STACK_PUSH_CODE, Pmode, stack_pointer_rtx);
3268 /* If we are to pad downward, adjust the stack pointer first and
3269 then store X into the stack location using an offset. This is
3270 because emit_move_insn does not know how to pad; it does not have
3272 else if (FUNCTION_ARG_PADDING (mode, type) == downward)
3274 unsigned padding_size = rounded_size - GET_MODE_SIZE (mode);
3275 HOST_WIDE_INT offset;
3277 emit_move_insn (stack_pointer_rtx,
3278 expand_binop (Pmode,
3279 #ifdef STACK_GROWS_DOWNWARD
3285 GEN_INT (rounded_size),
3286 NULL_RTX, 0, OPTAB_LIB_WIDEN));
3288 offset = (HOST_WIDE_INT) padding_size;
3289 #ifdef STACK_GROWS_DOWNWARD
3290 if (STACK_PUSH_CODE == POST_DEC)
3291 /* We have already decremented the stack pointer, so get the
3293 offset += (HOST_WIDE_INT) rounded_size;
3295 if (STACK_PUSH_CODE == POST_INC)
3296 /* We have already incremented the stack pointer, so get the
3298 offset -= (HOST_WIDE_INT) rounded_size;
3300 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx, GEN_INT (offset));
3304 #ifdef STACK_GROWS_DOWNWARD
3305 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3306 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3307 GEN_INT (-(HOST_WIDE_INT) rounded_size));
3309 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3310 dest_addr = gen_rtx_PLUS (Pmode, stack_pointer_rtx,
3311 GEN_INT (rounded_size));
3313 dest_addr = gen_rtx_PRE_MODIFY (Pmode, stack_pointer_rtx, dest_addr);
3316 dest = gen_rtx_MEM (mode, dest_addr);
3320 set_mem_attributes (dest, type, 1);
3322 if (flag_optimize_sibling_calls)
3323 /* Function incoming arguments may overlap with sibling call
3324 outgoing arguments and we cannot allow reordering of reads
3325 from function arguments with stores to outgoing arguments
3326 of sibling calls. */
3327 set_mem_alias_set (dest, 0);
3329 emit_move_insn (dest, x);
3333 /* Generate code to push X onto the stack, assuming it has mode MODE and
3335 MODE is redundant except when X is a CONST_INT (since they don't
3337 SIZE is an rtx for the size of data to be copied (in bytes),
3338 needed only if X is BLKmode.
3340 ALIGN (in bits) is maximum alignment we can assume.
3342 If PARTIAL and REG are both nonzero, then copy that many of the first
3343 bytes of X into registers starting with REG, and push the rest of X.
3344 The amount of space pushed is decreased by PARTIAL bytes.
3345 REG must be a hard register in this case.
3346 If REG is zero but PARTIAL is not, take any all others actions for an
3347 argument partially in registers, but do not actually load any
3350 EXTRA is the amount in bytes of extra space to leave next to this arg.
3351 This is ignored if an argument block has already been allocated.
3353 On a machine that lacks real push insns, ARGS_ADDR is the address of
3354 the bottom of the argument block for this call. We use indexing off there
3355 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3356 argument block has not been preallocated.
3358 ARGS_SO_FAR is the size of args previously pushed for this call.
3360 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3361 for arguments passed in registers. If nonzero, it will be the number
3362 of bytes required. */
3365 emit_push_insn (rtx x, enum machine_mode mode, tree type, rtx size,
3366 unsigned int align, int partial, rtx reg, int extra,
3367 rtx args_addr, rtx args_so_far, int reg_parm_stack_space,
3371 enum direction stack_direction
3372 #ifdef STACK_GROWS_DOWNWARD
3378 /* Decide where to pad the argument: `downward' for below,
3379 `upward' for above, or `none' for don't pad it.
3380 Default is below for small data on big-endian machines; else above. */
3381 enum direction where_pad = FUNCTION_ARG_PADDING (mode, type);
3383 /* Invert direction if stack is post-decrement.
3385 if (STACK_PUSH_CODE == POST_DEC)
3386 if (where_pad != none)
3387 where_pad = (where_pad == downward ? upward : downward);
3391 if (mode == BLKmode)
3393 /* Copy a block into the stack, entirely or partially. */
3400 offset = partial % (PARM_BOUNDARY / BITS_PER_UNIT);
3401 used = partial - offset;
3405 /* USED is now the # of bytes we need not copy to the stack
3406 because registers will take care of them. */
3409 xinner = adjust_address (xinner, BLKmode, used);
3411 /* If the partial register-part of the arg counts in its stack size,
3412 skip the part of stack space corresponding to the registers.
3413 Otherwise, start copying to the beginning of the stack space,
3414 by setting SKIP to 0. */
3415 skip = (reg_parm_stack_space == 0) ? 0 : used;
3417 #ifdef PUSH_ROUNDING
3418 /* Do it with several push insns if that doesn't take lots of insns
3419 and if there is no difficulty with push insns that skip bytes
3420 on the stack for alignment purposes. */
3423 && GET_CODE (size) == CONST_INT
3425 && MEM_ALIGN (xinner) >= align
3426 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size) - used, align))
3427 /* Here we avoid the case of a structure whose weak alignment
3428 forces many pushes of a small amount of data,
3429 and such small pushes do rounding that causes trouble. */
3430 && ((! SLOW_UNALIGNED_ACCESS (word_mode, align))
3431 || align >= BIGGEST_ALIGNMENT
3432 || (PUSH_ROUNDING (align / BITS_PER_UNIT)
3433 == (align / BITS_PER_UNIT)))
3434 && PUSH_ROUNDING (INTVAL (size)) == INTVAL (size))
3436 /* Push padding now if padding above and stack grows down,
3437 or if padding below and stack grows up.
3438 But if space already allocated, this has already been done. */
3439 if (extra && args_addr == 0
3440 && where_pad != none && where_pad != stack_direction)
3441 anti_adjust_stack (GEN_INT (extra));
3443 move_by_pieces (NULL, xinner, INTVAL (size) - used, align, 0);
3446 #endif /* PUSH_ROUNDING */
3450 /* Otherwise make space on the stack and copy the data
3451 to the address of that space. */
3453 /* Deduct words put into registers from the size we must copy. */
3456 if (GET_CODE (size) == CONST_INT)
3457 size = GEN_INT (INTVAL (size) - used);
3459 size = expand_binop (GET_MODE (size), sub_optab, size,
3460 GEN_INT (used), NULL_RTX, 0,
3464 /* Get the address of the stack space.
3465 In this case, we do not deal with EXTRA separately.
3466 A single stack adjust will do. */
3469 temp = push_block (size, extra, where_pad == downward);
3472 else if (GET_CODE (args_so_far) == CONST_INT)
3473 temp = memory_address (BLKmode,
3474 plus_constant (args_addr,
3475 skip + INTVAL (args_so_far)));
3477 temp = memory_address (BLKmode,
3478 plus_constant (gen_rtx_PLUS (Pmode,
3483 if (!ACCUMULATE_OUTGOING_ARGS)
3485 /* If the source is referenced relative to the stack pointer,
3486 copy it to another register to stabilize it. We do not need
3487 to do this if we know that we won't be changing sp. */
3489 if (reg_mentioned_p (virtual_stack_dynamic_rtx, temp)
3490 || reg_mentioned_p (virtual_outgoing_args_rtx, temp))
3491 temp = copy_to_reg (temp);
3494 target = gen_rtx_MEM (BLKmode, temp);
3496 /* We do *not* set_mem_attributes here, because incoming arguments
3497 may overlap with sibling call outgoing arguments and we cannot
3498 allow reordering of reads from function arguments with stores
3499 to outgoing arguments of sibling calls. We do, however, want
3500 to record the alignment of the stack slot. */
3501 /* ALIGN may well be better aligned than TYPE, e.g. due to
3502 PARM_BOUNDARY. Assume the caller isn't lying. */
3503 set_mem_align (target, align);
3505 emit_block_move (target, xinner, size, BLOCK_OP_CALL_PARM);
3508 else if (partial > 0)
3510 /* Scalar partly in registers. */
3512 int size = GET_MODE_SIZE (mode) / UNITS_PER_WORD;
3515 /* # bytes of start of argument
3516 that we must make space for but need not store. */
3517 int offset = partial % (PARM_BOUNDARY / BITS_PER_WORD);
3518 int args_offset = INTVAL (args_so_far);
3521 /* Push padding now if padding above and stack grows down,
3522 or if padding below and stack grows up.
3523 But if space already allocated, this has already been done. */
3524 if (extra && args_addr == 0
3525 && where_pad != none && where_pad != stack_direction)
3526 anti_adjust_stack (GEN_INT (extra));
3528 /* If we make space by pushing it, we might as well push
3529 the real data. Otherwise, we can leave OFFSET nonzero
3530 and leave the space uninitialized. */
3534 /* Now NOT_STACK gets the number of words that we don't need to
3535 allocate on the stack. */
3536 not_stack = (partial - offset) / UNITS_PER_WORD;
3538 /* If the partial register-part of the arg counts in its stack size,
3539 skip the part of stack space corresponding to the registers.
3540 Otherwise, start copying to the beginning of the stack space,
3541 by setting SKIP to 0. */
3542 skip = (reg_parm_stack_space == 0) ? 0 : not_stack;
3544 if (CONSTANT_P (x) && ! LEGITIMATE_CONSTANT_P (x))
3545 x = validize_mem (force_const_mem (mode, x));
3547 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3548 SUBREGs of such registers are not allowed. */
3549 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER
3550 && GET_MODE_CLASS (GET_MODE (x)) != MODE_INT))
3551 x = copy_to_reg (x);
3553 /* Loop over all the words allocated on the stack for this arg. */
3554 /* We can do it by words, because any scalar bigger than a word
3555 has a size a multiple of a word. */
3556 #ifndef PUSH_ARGS_REVERSED
3557 for (i = not_stack; i < size; i++)
3559 for (i = size - 1; i >= not_stack; i--)
3561 if (i >= not_stack + offset)
3562 emit_push_insn (operand_subword_force (x, i, mode),
3563 word_mode, NULL_TREE, NULL_RTX, align, 0, NULL_RTX,
3565 GEN_INT (args_offset + ((i - not_stack + skip)
3567 reg_parm_stack_space, alignment_pad);
3574 /* Push padding now if padding above and stack grows down,
3575 or if padding below and stack grows up.
3576 But if space already allocated, this has already been done. */
3577 if (extra && args_addr == 0
3578 && where_pad != none && where_pad != stack_direction)
3579 anti_adjust_stack (GEN_INT (extra));
3581 #ifdef PUSH_ROUNDING
3582 if (args_addr == 0 && PUSH_ARGS)
3583 emit_single_push_insn (mode, x, type);
3587 if (GET_CODE (args_so_far) == CONST_INT)
3589 = memory_address (mode,
3590 plus_constant (args_addr,
3591 INTVAL (args_so_far)));
3593 addr = memory_address (mode, gen_rtx_PLUS (Pmode, args_addr,
3595 dest = gen_rtx_MEM (mode, addr);
3597 /* We do *not* set_mem_attributes here, because incoming arguments
3598 may overlap with sibling call outgoing arguments and we cannot
3599 allow reordering of reads from function arguments with stores
3600 to outgoing arguments of sibling calls. We do, however, want
3601 to record the alignment of the stack slot. */
3602 /* ALIGN may well be better aligned than TYPE, e.g. due to
3603 PARM_BOUNDARY. Assume the caller isn't lying. */
3604 set_mem_align (dest, align);
3606 emit_move_insn (dest, x);
3610 /* If part should go in registers, copy that part
3611 into the appropriate registers. Do this now, at the end,
3612 since mem-to-mem copies above may do function calls. */
3613 if (partial > 0 && reg != 0)
3615 /* Handle calls that pass values in multiple non-contiguous locations.
3616 The Irix 6 ABI has examples of this. */
3617 if (GET_CODE (reg) == PARALLEL)
3618 emit_group_load (reg, x, type, -1);
3621 gcc_assert (partial % UNITS_PER_WORD == 0);
3622 move_block_to_reg (REGNO (reg), x, partial / UNITS_PER_WORD, mode);
3626 if (extra && args_addr == 0 && where_pad == stack_direction)
3627 anti_adjust_stack (GEN_INT (extra));
3629 if (alignment_pad && args_addr == 0)
3630 anti_adjust_stack (alignment_pad);
3633 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3637 get_subtarget (rtx x)
3641 /* Only registers can be subtargets. */
3643 /* Don't use hard regs to avoid extending their life. */
3644 || REGNO (x) < FIRST_PSEUDO_REGISTER
3648 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
3649 FIELD is a bitfield. Returns true if the optimization was successful,
3650 and there's nothing else to do. */
3653 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize,
3654 unsigned HOST_WIDE_INT bitpos,
3655 enum machine_mode mode1, rtx str_rtx,
3658 enum machine_mode str_mode = GET_MODE (str_rtx);
3659 unsigned int str_bitsize = GET_MODE_BITSIZE (str_mode);
3664 if (mode1 != VOIDmode
3665 || bitsize >= BITS_PER_WORD
3666 || str_bitsize > BITS_PER_WORD
3667 || TREE_SIDE_EFFECTS (to)
3668 || TREE_THIS_VOLATILE (to))
3672 if (!BINARY_CLASS_P (src)
3673 || TREE_CODE (TREE_TYPE (src)) != INTEGER_TYPE)
3676 op0 = TREE_OPERAND (src, 0);
3677 op1 = TREE_OPERAND (src, 1);
3680 if (!operand_equal_p (to, op0, 0))
3683 if (MEM_P (str_rtx))
3685 unsigned HOST_WIDE_INT offset1;
3687 if (str_bitsize == 0 || str_bitsize > BITS_PER_WORD)
3688 str_mode = word_mode;
3689 str_mode = get_best_mode (bitsize, bitpos,
3690 MEM_ALIGN (str_rtx), str_mode, 0);
3691 if (str_mode == VOIDmode)
3693 str_bitsize = GET_MODE_BITSIZE (str_mode);
3696 bitpos %= str_bitsize;
3697 offset1 = (offset1 - bitpos) / BITS_PER_UNIT;
3698 str_rtx = adjust_address (str_rtx, str_mode, offset1);
3700 else if (!REG_P (str_rtx) && GET_CODE (str_rtx) != SUBREG)
3703 /* If the bit field covers the whole REG/MEM, store_field
3704 will likely generate better code. */
3705 if (bitsize >= str_bitsize)
3708 /* We can't handle fields split across multiple entities. */
3709 if (bitpos + bitsize > str_bitsize)
3712 if (BYTES_BIG_ENDIAN)
3713 bitpos = str_bitsize - bitpos - bitsize;
3715 switch (TREE_CODE (src))
3719 /* For now, just optimize the case of the topmost bitfield
3720 where we don't need to do any masking and also
3721 1 bit bitfields where xor can be used.
3722 We might win by one instruction for the other bitfields
3723 too if insv/extv instructions aren't used, so that
3724 can be added later. */
3725 if (bitpos + bitsize != str_bitsize
3726 && (bitsize != 1 || TREE_CODE (op1) != INTEGER_CST))
3729 value = expand_expr (op1, NULL_RTX, str_mode, 0);
3730 value = convert_modes (str_mode,
3731 TYPE_MODE (TREE_TYPE (op1)), value,
3732 TYPE_UNSIGNED (TREE_TYPE (op1)));
3734 /* We may be accessing data outside the field, which means
3735 we can alias adjacent data. */
3736 if (MEM_P (str_rtx))
3738 str_rtx = shallow_copy_rtx (str_rtx);
3739 set_mem_alias_set (str_rtx, 0);
3740 set_mem_expr (str_rtx, 0);
3743 binop = TREE_CODE (src) == PLUS_EXPR ? add_optab : sub_optab;
3744 if (bitsize == 1 && bitpos + bitsize != str_bitsize)
3746 value = expand_and (str_mode, value, const1_rtx, NULL);
3749 value = expand_shift (LSHIFT_EXPR, str_mode, value,
3750 build_int_cst (NULL_TREE, bitpos),
3752 result = expand_binop (str_mode, binop, str_rtx,
3753 value, str_rtx, 1, OPTAB_WIDEN);
3754 if (result != str_rtx)
3755 emit_move_insn (str_rtx, result);
3760 if (TREE_CODE (op1) != INTEGER_CST)
3762 value = expand_expr (op1, NULL_RTX, GET_MODE (str_rtx), 0);
3763 value = convert_modes (GET_MODE (str_rtx),
3764 TYPE_MODE (TREE_TYPE (op1)), value,
3765 TYPE_UNSIGNED (TREE_TYPE (op1)));
3767 /* We may be accessing data outside the field, which means
3768 we can alias adjacent data. */
3769 if (MEM_P (str_rtx))
3771 str_rtx = shallow_copy_rtx (str_rtx);
3772 set_mem_alias_set (str_rtx, 0);
3773 set_mem_expr (str_rtx, 0);
3776 binop = TREE_CODE (src) == BIT_IOR_EXPR ? ior_optab : xor_optab;
3777 if (bitpos + bitsize != GET_MODE_BITSIZE (GET_MODE (str_rtx)))
3779 rtx mask = GEN_INT (((unsigned HOST_WIDE_INT) 1 << bitsize)
3781 value = expand_and (GET_MODE (str_rtx), value, mask,
3784 value = expand_shift (LSHIFT_EXPR, GET_MODE (str_rtx), value,
3785 build_int_cst (NULL_TREE, bitpos),
3787 result = expand_binop (GET_MODE (str_rtx), binop, str_rtx,
3788 value, str_rtx, 1, OPTAB_WIDEN);
3789 if (result != str_rtx)
3790 emit_move_insn (str_rtx, result);
3801 /* Expand an assignment that stores the value of FROM into TO. */
3804 expand_assignment (tree to, tree from)
3809 /* Don't crash if the lhs of the assignment was erroneous. */
3811 if (TREE_CODE (to) == ERROR_MARK)
3813 result = expand_expr (from, NULL_RTX, VOIDmode, 0);
3817 /* Assignment of a structure component needs special treatment
3818 if the structure component's rtx is not simply a MEM.
3819 Assignment of an array element at a constant index, and assignment of
3820 an array element in an unaligned packed structure field, has the same
3822 if (handled_component_p (to)
3823 || TREE_CODE (TREE_TYPE (to)) == ARRAY_TYPE)
3825 enum machine_mode mode1;
3826 HOST_WIDE_INT bitsize, bitpos;
3833 tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,
3834 &unsignedp, &volatilep, true);
3836 /* If we are going to use store_bit_field and extract_bit_field,
3837 make sure to_rtx will be safe for multiple use. */
3839 to_rtx = expand_expr (tem, NULL_RTX, VOIDmode, 0);
3843 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, EXPAND_SUM);
3845 gcc_assert (MEM_P (to_rtx));
3847 #ifdef POINTERS_EXTEND_UNSIGNED
3848 if (GET_MODE (offset_rtx) != Pmode)
3849 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
3851 if (GET_MODE (offset_rtx) != ptr_mode)
3852 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
3855 /* A constant address in TO_RTX can have VOIDmode, we must not try
3856 to call force_reg for that case. Avoid that case. */
3858 && GET_MODE (to_rtx) == BLKmode
3859 && GET_MODE (XEXP (to_rtx, 0)) != VOIDmode
3861 && (bitpos % bitsize) == 0
3862 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
3863 && MEM_ALIGN (to_rtx) == GET_MODE_ALIGNMENT (mode1))
3865 to_rtx = adjust_address (to_rtx, mode1, bitpos / BITS_PER_UNIT);
3869 to_rtx = offset_address (to_rtx, offset_rtx,
3870 highest_pow2_factor_for_target (to,
3874 /* Handle expand_expr of a complex value returning a CONCAT. */
3875 if (GET_CODE (to_rtx) == CONCAT)
3877 if (TREE_CODE (TREE_TYPE (from)) == COMPLEX_TYPE)
3879 gcc_assert (bitpos == 0);
3880 result = store_expr (from, to_rtx, false);
3884 gcc_assert (bitpos == 0 || bitpos == GET_MODE_BITSIZE (mode1));
3885 result = store_expr (from, XEXP (to_rtx, bitpos != 0), false);
3892 /* If the field is at offset zero, we could have been given the
3893 DECL_RTX of the parent struct. Don't munge it. */
3894 to_rtx = shallow_copy_rtx (to_rtx);
3896 set_mem_attributes_minus_bitpos (to_rtx, to, 0, bitpos);
3898 /* Deal with volatile and readonly fields. The former is only
3899 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
3901 MEM_VOLATILE_P (to_rtx) = 1;
3902 if (component_uses_parent_alias_set (to))
3903 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
3906 if (optimize_bitfield_assignment_op (bitsize, bitpos, mode1,
3910 result = store_field (to_rtx, bitsize, bitpos, mode1, from,
3911 TREE_TYPE (tem), get_alias_set (to));
3915 preserve_temp_slots (result);
3921 /* If the rhs is a function call and its value is not an aggregate,
3922 call the function before we start to compute the lhs.
3923 This is needed for correct code for cases such as
3924 val = setjmp (buf) on machines where reference to val
3925 requires loading up part of an address in a separate insn.
3927 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
3928 since it might be a promoted variable where the zero- or sign- extension
3929 needs to be done. Handling this in the normal way is safe because no
3930 computation is done before the call. */
3931 if (TREE_CODE (from) == CALL_EXPR && ! aggregate_value_p (from, from)
3932 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from))) == INTEGER_CST
3933 && ! ((TREE_CODE (to) == VAR_DECL || TREE_CODE (to) == PARM_DECL)
3934 && REG_P (DECL_RTL (to))))
3939 value = expand_expr (from, NULL_RTX, VOIDmode, 0);
3941 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
3943 /* Handle calls that return values in multiple non-contiguous locations.
3944 The Irix 6 ABI has examples of this. */
3945 if (GET_CODE (to_rtx) == PARALLEL)
3946 emit_group_load (to_rtx, value, TREE_TYPE (from),
3947 int_size_in_bytes (TREE_TYPE (from)));
3948 else if (GET_MODE (to_rtx) == BLKmode)
3949 emit_block_move (to_rtx, value, expr_size (from), BLOCK_OP_NORMAL);
3952 if (POINTER_TYPE_P (TREE_TYPE (to)))
3953 value = convert_memory_address (GET_MODE (to_rtx), value);
3954 emit_move_insn (to_rtx, value);
3956 preserve_temp_slots (to_rtx);
3962 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
3963 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
3966 to_rtx = expand_expr (to, NULL_RTX, VOIDmode, EXPAND_WRITE);
3968 /* Don't move directly into a return register. */
3969 if (TREE_CODE (to) == RESULT_DECL
3970 && (REG_P (to_rtx) || GET_CODE (to_rtx) == PARALLEL))
3975 temp = expand_expr (from, 0, GET_MODE (to_rtx), 0);
3977 if (GET_CODE (to_rtx) == PARALLEL)
3978 emit_group_load (to_rtx, temp, TREE_TYPE (from),
3979 int_size_in_bytes (TREE_TYPE (from)));
3981 emit_move_insn (to_rtx, temp);
3983 preserve_temp_slots (to_rtx);
3989 /* In case we are returning the contents of an object which overlaps
3990 the place the value is being stored, use a safe function when copying
3991 a value through a pointer into a structure value return block. */
3992 if (TREE_CODE (to) == RESULT_DECL && TREE_CODE (from) == INDIRECT_REF
3993 && current_function_returns_struct
3994 && !current_function_returns_pcc_struct)
3999 size = expr_size (from);
4000 from_rtx = expand_expr (from, NULL_RTX, VOIDmode, 0);
4002 emit_library_call (memmove_libfunc, LCT_NORMAL,
4003 VOIDmode, 3, XEXP (to_rtx, 0), Pmode,
4004 XEXP (from_rtx, 0), Pmode,
4005 convert_to_mode (TYPE_MODE (sizetype),
4006 size, TYPE_UNSIGNED (sizetype)),
4007 TYPE_MODE (sizetype));
4009 preserve_temp_slots (to_rtx);
4015 /* Compute FROM and store the value in the rtx we got. */
4018 result = store_expr (from, to_rtx, 0);
4019 preserve_temp_slots (result);
4025 /* Generate code for computing expression EXP,
4026 and storing the value into TARGET.
4028 If the mode is BLKmode then we may return TARGET itself.
4029 It turns out that in BLKmode it doesn't cause a problem.
4030 because C has no operators that could combine two different
4031 assignments into the same BLKmode object with different values
4032 with no sequence point. Will other languages need this to
4035 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4036 stack, and block moves may need to be treated specially. */
4039 store_expr (tree exp, rtx target, int call_param_p)
4042 rtx alt_rtl = NULL_RTX;
4043 int dont_return_target = 0;
4045 if (VOID_TYPE_P (TREE_TYPE (exp)))
4047 /* C++ can generate ?: expressions with a throw expression in one
4048 branch and an rvalue in the other. Here, we resolve attempts to
4049 store the throw expression's nonexistent result. */
4050 gcc_assert (!call_param_p);
4051 expand_expr (exp, const0_rtx, VOIDmode, 0);
4054 if (TREE_CODE (exp) == COMPOUND_EXPR)
4056 /* Perform first part of compound expression, then assign from second
4058 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
4059 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4060 return store_expr (TREE_OPERAND (exp, 1), target, call_param_p);
4062 else if (TREE_CODE (exp) == COND_EXPR && GET_MODE (target) == BLKmode)
4064 /* For conditional expression, get safe form of the target. Then
4065 test the condition, doing the appropriate assignment on either
4066 side. This avoids the creation of unnecessary temporaries.
4067 For non-BLKmode, it is more efficient not to do this. */
4069 rtx lab1 = gen_label_rtx (), lab2 = gen_label_rtx ();
4071 do_pending_stack_adjust ();
4073 jumpifnot (TREE_OPERAND (exp, 0), lab1);
4074 store_expr (TREE_OPERAND (exp, 1), target, call_param_p);
4075 emit_jump_insn (gen_jump (lab2));
4078 store_expr (TREE_OPERAND (exp, 2), target, call_param_p);
4084 else if (GET_CODE (target) == SUBREG && SUBREG_PROMOTED_VAR_P (target))
4085 /* If this is a scalar in a register that is stored in a wider mode
4086 than the declared mode, compute the result into its declared mode
4087 and then convert to the wider mode. Our value is the computed
4090 rtx inner_target = 0;
4092 /* We can do the conversion inside EXP, which will often result
4093 in some optimizations. Do the conversion in two steps: first
4094 change the signedness, if needed, then the extend. But don't
4095 do this if the type of EXP is a subtype of something else
4096 since then the conversion might involve more than just
4097 converting modes. */
4098 if (INTEGRAL_TYPE_P (TREE_TYPE (exp))
4099 && TREE_TYPE (TREE_TYPE (exp)) == 0
4100 && (!lang_hooks.reduce_bit_field_operations
4101 || (GET_MODE_PRECISION (GET_MODE (target))
4102 == TYPE_PRECISION (TREE_TYPE (exp)))))
4104 if (TYPE_UNSIGNED (TREE_TYPE (exp))
4105 != SUBREG_PROMOTED_UNSIGNED_P (target))
4107 (lang_hooks.types.signed_or_unsigned_type
4108 (SUBREG_PROMOTED_UNSIGNED_P (target), TREE_TYPE (exp)), exp);
4110 exp = convert (lang_hooks.types.type_for_mode
4111 (GET_MODE (SUBREG_REG (target)),
4112 SUBREG_PROMOTED_UNSIGNED_P (target)),
4115 inner_target = SUBREG_REG (target);
4118 temp = expand_expr (exp, inner_target, VOIDmode,
4119 call_param_p ? EXPAND_STACK_PARM : EXPAND_NORMAL);
4121 /* If TEMP is a VOIDmode constant, use convert_modes to make
4122 sure that we properly convert it. */
4123 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode)
4125 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4126 temp, SUBREG_PROMOTED_UNSIGNED_P (target));
4127 temp = convert_modes (GET_MODE (SUBREG_REG (target)),
4128 GET_MODE (target), temp,
4129 SUBREG_PROMOTED_UNSIGNED_P (target));
4132 convert_move (SUBREG_REG (target), temp,
4133 SUBREG_PROMOTED_UNSIGNED_P (target));
4139 temp = expand_expr_real (exp, target, GET_MODE (target),
4141 ? EXPAND_STACK_PARM : EXPAND_NORMAL),
4143 /* Return TARGET if it's a specified hardware register.
4144 If TARGET is a volatile mem ref, either return TARGET
4145 or return a reg copied *from* TARGET; ANSI requires this.
4147 Otherwise, if TEMP is not TARGET, return TEMP
4148 if it is constant (for efficiency),
4149 or if we really want the correct value. */
4150 if (!(target && REG_P (target)
4151 && REGNO (target) < FIRST_PSEUDO_REGISTER)
4152 && !(MEM_P (target) && MEM_VOLATILE_P (target))
4153 && ! rtx_equal_p (temp, target)
4154 && CONSTANT_P (temp))
4155 dont_return_target = 1;
4158 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4159 the same as that of TARGET, adjust the constant. This is needed, for
4160 example, in case it is a CONST_DOUBLE and we want only a word-sized
4162 if (CONSTANT_P (temp) && GET_MODE (temp) == VOIDmode
4163 && TREE_CODE (exp) != ERROR_MARK
4164 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
4165 temp = convert_modes (GET_MODE (target), TYPE_MODE (TREE_TYPE (exp)),
4166 temp, TYPE_UNSIGNED (TREE_TYPE (exp)));
4168 /* If value was not generated in the target, store it there.
4169 Convert the value to TARGET's type first if necessary and emit the
4170 pending incrementations that have been queued when expanding EXP.
4171 Note that we cannot emit the whole queue blindly because this will
4172 effectively disable the POST_INC optimization later.
4174 If TEMP and TARGET compare equal according to rtx_equal_p, but
4175 one or both of them are volatile memory refs, we have to distinguish
4177 - expand_expr has used TARGET. In this case, we must not generate
4178 another copy. This can be detected by TARGET being equal according
4180 - expand_expr has not used TARGET - that means that the source just
4181 happens to have the same RTX form. Since temp will have been created
4182 by expand_expr, it will compare unequal according to == .
4183 We must generate a copy in this case, to reach the correct number
4184 of volatile memory references. */
4186 if ((! rtx_equal_p (temp, target)
4187 || (temp != target && (side_effects_p (temp)
4188 || side_effects_p (target))))
4189 && TREE_CODE (exp) != ERROR_MARK
4190 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4191 but TARGET is not valid memory reference, TEMP will differ
4192 from TARGET although it is really the same location. */
4193 && !(alt_rtl && rtx_equal_p (alt_rtl, target))
4194 /* If there's nothing to copy, don't bother. Don't call expr_size
4195 unless necessary, because some front-ends (C++) expr_size-hook
4196 aborts on objects that are not supposed to be bit-copied or
4198 && expr_size (exp) != const0_rtx)
4200 if (GET_MODE (temp) != GET_MODE (target)
4201 && GET_MODE (temp) != VOIDmode)
4203 int unsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
4204 if (dont_return_target)
4206 /* In this case, we will return TEMP,
4207 so make sure it has the proper mode.
4208 But don't forget to store the value into TARGET. */
4209 temp = convert_to_mode (GET_MODE (target), temp, unsignedp);
4210 emit_move_insn (target, temp);
4213 convert_move (target, temp, unsignedp);
4216 else if (GET_MODE (temp) == BLKmode && TREE_CODE (exp) == STRING_CST)
4218 /* Handle copying a string constant into an array. The string
4219 constant may be shorter than the array. So copy just the string's
4220 actual length, and clear the rest. First get the size of the data
4221 type of the string, which is actually the size of the target. */
4222 rtx size = expr_size (exp);
4224 if (GET_CODE (size) == CONST_INT
4225 && INTVAL (size) < TREE_STRING_LENGTH (exp))
4226 emit_block_move (target, temp, size,
4228 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4231 /* Compute the size of the data to copy from the string. */
4233 = size_binop (MIN_EXPR,
4234 make_tree (sizetype, size),
4235 size_int (TREE_STRING_LENGTH (exp)));
4237 = expand_expr (copy_size, NULL_RTX, VOIDmode,
4239 ? EXPAND_STACK_PARM : EXPAND_NORMAL));
4242 /* Copy that much. */
4243 copy_size_rtx = convert_to_mode (ptr_mode, copy_size_rtx,
4244 TYPE_UNSIGNED (sizetype));
4245 emit_block_move (target, temp, copy_size_rtx,
4247 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4249 /* Figure out how much is left in TARGET that we have to clear.
4250 Do all calculations in ptr_mode. */
4251 if (GET_CODE (copy_size_rtx) == CONST_INT)
4253 size = plus_constant (size, -INTVAL (copy_size_rtx));
4254 target = adjust_address (target, BLKmode,
4255 INTVAL (copy_size_rtx));
4259 size = expand_binop (TYPE_MODE (sizetype), sub_optab, size,
4260 copy_size_rtx, NULL_RTX, 0,
4263 #ifdef POINTERS_EXTEND_UNSIGNED
4264 if (GET_MODE (copy_size_rtx) != Pmode)
4265 copy_size_rtx = convert_to_mode (Pmode, copy_size_rtx,
4266 TYPE_UNSIGNED (sizetype));
4269 target = offset_address (target, copy_size_rtx,
4270 highest_pow2_factor (copy_size));
4271 label = gen_label_rtx ();
4272 emit_cmp_and_jump_insns (size, const0_rtx, LT, NULL_RTX,
4273 GET_MODE (size), 0, label);
4276 if (size != const0_rtx)
4277 clear_storage (target, size);
4283 /* Handle calls that return values in multiple non-contiguous locations.
4284 The Irix 6 ABI has examples of this. */
4285 else if (GET_CODE (target) == PARALLEL)
4286 emit_group_load (target, temp, TREE_TYPE (exp),
4287 int_size_in_bytes (TREE_TYPE (exp)));
4288 else if (GET_MODE (temp) == BLKmode)
4289 emit_block_move (target, temp, expr_size (exp),
4291 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
4294 temp = force_operand (temp, target);
4296 emit_move_insn (target, temp);
4303 /* Examine CTOR to discover:
4304 * how many scalar fields are set to nonzero values,
4305 and place it in *P_NZ_ELTS;
4306 * how many scalar fields are set to non-constant values,
4307 and place it in *P_NC_ELTS; and
4308 * how many scalar fields in total are in CTOR,
4309 and place it in *P_ELT_COUNT.
4310 * if a type is a union, and the initializer from the constructor
4311 is not the largest element in the union, then set *p_must_clear. */
4314 categorize_ctor_elements_1 (tree ctor, HOST_WIDE_INT *p_nz_elts,
4315 HOST_WIDE_INT *p_nc_elts,
4316 HOST_WIDE_INT *p_elt_count,
4319 HOST_WIDE_INT nz_elts, nc_elts, elt_count;
4326 for (list = CONSTRUCTOR_ELTS (ctor); list; list = TREE_CHAIN (list))
4328 tree value = TREE_VALUE (list);
4329 tree purpose = TREE_PURPOSE (list);
4333 if (TREE_CODE (purpose) == RANGE_EXPR)
4335 tree lo_index = TREE_OPERAND (purpose, 0);
4336 tree hi_index = TREE_OPERAND (purpose, 1);
4338 if (host_integerp (lo_index, 1) && host_integerp (hi_index, 1))
4339 mult = (tree_low_cst (hi_index, 1)
4340 - tree_low_cst (lo_index, 1) + 1);
4343 switch (TREE_CODE (value))
4347 HOST_WIDE_INT nz = 0, nc = 0, ic = 0;
4348 categorize_ctor_elements_1 (value, &nz, &nc, &ic, p_must_clear);
4349 nz_elts += mult * nz;
4350 nc_elts += mult * nc;
4351 elt_count += mult * ic;
4357 if (!initializer_zerop (value))
4363 nz_elts += mult * TREE_STRING_LENGTH (value);
4364 elt_count += mult * TREE_STRING_LENGTH (value);
4368 if (!initializer_zerop (TREE_REALPART (value)))
4370 if (!initializer_zerop (TREE_IMAGPART (value)))
4378 for (v = TREE_VECTOR_CST_ELTS (value); v; v = TREE_CHAIN (v))
4380 if (!initializer_zerop (TREE_VALUE (v)))
4390 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
4397 && (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
4398 || TREE_CODE (TREE_TYPE (ctor)) == QUAL_UNION_TYPE))
4401 bool clear_this = true;
4403 list = CONSTRUCTOR_ELTS (ctor);
4406 /* We don't expect more than one element of the union to be
4407 initialized. Not sure what we should do otherwise... */
4408 gcc_assert (TREE_CHAIN (list) == NULL);
4410 init_sub_type = TREE_TYPE (TREE_VALUE (list));
4412 /* ??? We could look at each element of the union, and find the
4413 largest element. Which would avoid comparing the size of the
4414 initialized element against any tail padding in the union.
4415 Doesn't seem worth the effort... */
4416 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor)),
4417 TYPE_SIZE (init_sub_type)) == 1)
4419 /* And now we have to find out if the element itself is fully
4420 constructed. E.g. for union { struct { int a, b; } s; } u
4421 = { .s = { .a = 1 } }. */
4422 if (elt_count == count_type_elements (init_sub_type))
4427 *p_must_clear = clear_this;
4430 *p_nz_elts += nz_elts;
4431 *p_nc_elts += nc_elts;
4432 *p_elt_count += elt_count;
4436 categorize_ctor_elements (tree ctor, HOST_WIDE_INT *p_nz_elts,
4437 HOST_WIDE_INT *p_nc_elts,
4438 HOST_WIDE_INT *p_elt_count,
4444 *p_must_clear = false;
4445 categorize_ctor_elements_1 (ctor, p_nz_elts, p_nc_elts, p_elt_count,
4449 /* Count the number of scalars in TYPE. Return -1 on overflow or
4453 count_type_elements (tree type)
4455 const HOST_WIDE_INT max = ~((HOST_WIDE_INT)1 << (HOST_BITS_PER_WIDE_INT-1));
4456 switch (TREE_CODE (type))
4460 tree telts = array_type_nelts (type);
4461 if (telts && host_integerp (telts, 1))
4463 HOST_WIDE_INT n = tree_low_cst (telts, 1) + 1;
4464 HOST_WIDE_INT m = count_type_elements (TREE_TYPE (type));
4467 else if (max / n > m)
4475 HOST_WIDE_INT n = 0, t;
4478 for (f = TYPE_FIELDS (type); f ; f = TREE_CHAIN (f))
4479 if (TREE_CODE (f) == FIELD_DECL)
4481 t = count_type_elements (TREE_TYPE (f));
4491 case QUAL_UNION_TYPE:
4493 /* Ho hum. How in the world do we guess here? Clearly it isn't
4494 right to count the fields. Guess based on the number of words. */
4495 HOST_WIDE_INT n = int_size_in_bytes (type);
4498 return n / UNITS_PER_WORD;
4505 return TYPE_VECTOR_SUBPARTS (type);
4514 case REFERENCE_TYPE:
4527 /* Return 1 if EXP contains mostly (3/4) zeros. */
4530 mostly_zeros_p (tree exp)
4532 if (TREE_CODE (exp) == CONSTRUCTOR)
4535 HOST_WIDE_INT nz_elts, nc_elts, count, elts;
4538 categorize_ctor_elements (exp, &nz_elts, &nc_elts, &count, &must_clear);
4542 elts = count_type_elements (TREE_TYPE (exp));
4544 return nz_elts < elts / 4;
4547 return initializer_zerop (exp);
4550 /* Helper function for store_constructor.
4551 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
4552 TYPE is the type of the CONSTRUCTOR, not the element type.
4553 CLEARED is as for store_constructor.
4554 ALIAS_SET is the alias set to use for any stores.
4556 This provides a recursive shortcut back to store_constructor when it isn't
4557 necessary to go through store_field. This is so that we can pass through
4558 the cleared field to let store_constructor know that we may not have to
4559 clear a substructure if the outer structure has already been cleared. */
4562 store_constructor_field (rtx target, unsigned HOST_WIDE_INT bitsize,
4563 HOST_WIDE_INT bitpos, enum machine_mode mode,
4564 tree exp, tree type, int cleared, int alias_set)
4566 if (TREE_CODE (exp) == CONSTRUCTOR
4567 /* We can only call store_constructor recursively if the size and
4568 bit position are on a byte boundary. */
4569 && bitpos % BITS_PER_UNIT == 0
4570 && (bitsize > 0 && bitsize % BITS_PER_UNIT == 0)
4571 /* If we have a nonzero bitpos for a register target, then we just
4572 let store_field do the bitfield handling. This is unlikely to
4573 generate unnecessary clear instructions anyways. */
4574 && (bitpos == 0 || MEM_P (target)))
4578 = adjust_address (target,
4579 GET_MODE (target) == BLKmode
4581 % GET_MODE_ALIGNMENT (GET_MODE (target)))
4582 ? BLKmode : VOIDmode, bitpos / BITS_PER_UNIT);
4585 /* Update the alias set, if required. */
4586 if (MEM_P (target) && ! MEM_KEEP_ALIAS_SET_P (target)
4587 && MEM_ALIAS_SET (target) != 0)
4589 target = copy_rtx (target);
4590 set_mem_alias_set (target, alias_set);
4593 store_constructor (exp, target, cleared, bitsize / BITS_PER_UNIT);
4596 store_field (target, bitsize, bitpos, mode, exp, type, alias_set);
4599 /* Store the value of constructor EXP into the rtx TARGET.
4600 TARGET is either a REG or a MEM; we know it cannot conflict, since
4601 safe_from_p has been called.
4602 CLEARED is true if TARGET is known to have been zero'd.
4603 SIZE is the number of bytes of TARGET we are allowed to modify: this
4604 may not be the same as the size of EXP if we are assigning to a field
4605 which has been packed to exclude padding bits. */
4608 store_constructor (tree exp, rtx target, int cleared, HOST_WIDE_INT size)
4610 tree type = TREE_TYPE (exp);
4611 #ifdef WORD_REGISTER_OPERATIONS
4612 HOST_WIDE_INT exp_size = int_size_in_bytes (type);
4615 switch (TREE_CODE (type))
4619 case QUAL_UNION_TYPE:
4623 /* If size is zero or the target is already cleared, do nothing. */
4624 if (size == 0 || cleared)
4626 /* We either clear the aggregate or indicate the value is dead. */
4627 else if ((TREE_CODE (type) == UNION_TYPE
4628 || TREE_CODE (type) == QUAL_UNION_TYPE)
4629 && ! CONSTRUCTOR_ELTS (exp))
4630 /* If the constructor is empty, clear the union. */
4632 clear_storage (target, expr_size (exp));
4636 /* If we are building a static constructor into a register,
4637 set the initial value as zero so we can fold the value into
4638 a constant. But if more than one register is involved,
4639 this probably loses. */
4640 else if (REG_P (target) && TREE_STATIC (exp)
4641 && GET_MODE_SIZE (GET_MODE (target)) <= UNITS_PER_WORD)
4643 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4647 /* If the constructor has fewer fields than the structure or
4648 if we are initializing the structure to mostly zeros, clear
4649 the whole structure first. Don't do this if TARGET is a
4650 register whose mode size isn't equal to SIZE since
4651 clear_storage can't handle this case. */
4653 && ((list_length (CONSTRUCTOR_ELTS (exp))
4654 != fields_length (type))
4655 || mostly_zeros_p (exp))
4657 || ((HOST_WIDE_INT) GET_MODE_SIZE (GET_MODE (target))
4660 clear_storage (target, GEN_INT (size));
4665 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4667 /* Store each element of the constructor into the
4668 corresponding field of TARGET. */
4670 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
4672 tree field = TREE_PURPOSE (elt);
4673 tree value = TREE_VALUE (elt);
4674 enum machine_mode mode;
4675 HOST_WIDE_INT bitsize;
4676 HOST_WIDE_INT bitpos = 0;
4678 rtx to_rtx = target;
4680 /* Just ignore missing fields. We cleared the whole
4681 structure, above, if any fields are missing. */
4685 if (cleared && initializer_zerop (value))
4688 if (host_integerp (DECL_SIZE (field), 1))
4689 bitsize = tree_low_cst (DECL_SIZE (field), 1);
4693 mode = DECL_MODE (field);
4694 if (DECL_BIT_FIELD (field))
4697 offset = DECL_FIELD_OFFSET (field);
4698 if (host_integerp (offset, 0)
4699 && host_integerp (bit_position (field), 0))
4701 bitpos = int_bit_position (field);
4705 bitpos = tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 0);
4712 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset,
4713 make_tree (TREE_TYPE (exp),
4716 offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode, 0);
4717 gcc_assert (MEM_P (to_rtx));
4719 #ifdef POINTERS_EXTEND_UNSIGNED
4720 if (GET_MODE (offset_rtx) != Pmode)
4721 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
4723 if (GET_MODE (offset_rtx) != ptr_mode)
4724 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
4727 to_rtx = offset_address (to_rtx, offset_rtx,
4728 highest_pow2_factor (offset));
4731 #ifdef WORD_REGISTER_OPERATIONS
4732 /* If this initializes a field that is smaller than a
4733 word, at the start of a word, try to widen it to a full
4734 word. This special case allows us to output C++ member
4735 function initializations in a form that the optimizers
4738 && bitsize < BITS_PER_WORD
4739 && bitpos % BITS_PER_WORD == 0
4740 && GET_MODE_CLASS (mode) == MODE_INT
4741 && TREE_CODE (value) == INTEGER_CST
4743 && bitpos + BITS_PER_WORD <= exp_size * BITS_PER_UNIT)
4745 tree type = TREE_TYPE (value);
4747 if (TYPE_PRECISION (type) < BITS_PER_WORD)
4749 type = lang_hooks.types.type_for_size
4750 (BITS_PER_WORD, TYPE_UNSIGNED (type));
4751 value = convert (type, value);
4754 if (BYTES_BIG_ENDIAN)
4756 = fold (build2 (LSHIFT_EXPR, type, value,
4757 build_int_cst (NULL_TREE,
4758 BITS_PER_WORD - bitsize)));
4759 bitsize = BITS_PER_WORD;
4764 if (MEM_P (to_rtx) && !MEM_KEEP_ALIAS_SET_P (to_rtx)
4765 && DECL_NONADDRESSABLE_P (field))
4767 to_rtx = copy_rtx (to_rtx);
4768 MEM_KEEP_ALIAS_SET_P (to_rtx) = 1;
4771 store_constructor_field (to_rtx, bitsize, bitpos, mode,
4772 value, type, cleared,
4773 get_alias_set (TREE_TYPE (field)));
4783 tree elttype = TREE_TYPE (type);
4785 HOST_WIDE_INT minelt = 0;
4786 HOST_WIDE_INT maxelt = 0;
4788 domain = TYPE_DOMAIN (type);
4789 const_bounds_p = (TYPE_MIN_VALUE (domain)
4790 && TYPE_MAX_VALUE (domain)
4791 && host_integerp (TYPE_MIN_VALUE (domain), 0)
4792 && host_integerp (TYPE_MAX_VALUE (domain), 0));
4794 /* If we have constant bounds for the range of the type, get them. */
4797 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0);
4798 maxelt = tree_low_cst (TYPE_MAX_VALUE (domain), 0);
4801 /* If the constructor has fewer elements than the array, clear
4802 the whole array first. Similarly if this is static
4803 constructor of a non-BLKmode object. */
4806 else if (REG_P (target) && TREE_STATIC (exp))
4810 HOST_WIDE_INT count = 0, zero_count = 0;
4811 need_to_clear = ! const_bounds_p;
4813 /* This loop is a more accurate version of the loop in
4814 mostly_zeros_p (it handles RANGE_EXPR in an index). It
4815 is also needed to check for missing elements. */
4816 for (elt = CONSTRUCTOR_ELTS (exp);
4817 elt != NULL_TREE && ! need_to_clear;
4818 elt = TREE_CHAIN (elt))
4820 tree index = TREE_PURPOSE (elt);
4821 HOST_WIDE_INT this_node_count;
4823 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4825 tree lo_index = TREE_OPERAND (index, 0);
4826 tree hi_index = TREE_OPERAND (index, 1);
4828 if (! host_integerp (lo_index, 1)
4829 || ! host_integerp (hi_index, 1))
4835 this_node_count = (tree_low_cst (hi_index, 1)
4836 - tree_low_cst (lo_index, 1) + 1);
4839 this_node_count = 1;
4841 count += this_node_count;
4842 if (mostly_zeros_p (TREE_VALUE (elt)))
4843 zero_count += this_node_count;
4846 /* Clear the entire array first if there are any missing
4847 elements, or if the incidence of zero elements is >=
4850 && (count < maxelt - minelt + 1
4851 || 4 * zero_count >= 3 * count))
4855 if (need_to_clear && size > 0)
4858 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
4860 clear_storage (target, GEN_INT (size));
4864 if (!cleared && REG_P (target))
4865 /* Inform later passes that the old value is dead. */
4866 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
4868 /* Store each element of the constructor into the
4869 corresponding element of TARGET, determined by counting the
4871 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
4873 elt = TREE_CHAIN (elt), i++)
4875 enum machine_mode mode;
4876 HOST_WIDE_INT bitsize;
4877 HOST_WIDE_INT bitpos;
4879 tree value = TREE_VALUE (elt);
4880 tree index = TREE_PURPOSE (elt);
4881 rtx xtarget = target;
4883 if (cleared && initializer_zerop (value))
4886 unsignedp = TYPE_UNSIGNED (elttype);
4887 mode = TYPE_MODE (elttype);
4888 if (mode == BLKmode)
4889 bitsize = (host_integerp (TYPE_SIZE (elttype), 1)
4890 ? tree_low_cst (TYPE_SIZE (elttype), 1)
4893 bitsize = GET_MODE_BITSIZE (mode);
4895 if (index != NULL_TREE && TREE_CODE (index) == RANGE_EXPR)
4897 tree lo_index = TREE_OPERAND (index, 0);
4898 tree hi_index = TREE_OPERAND (index, 1);
4899 rtx index_r, pos_rtx;
4900 HOST_WIDE_INT lo, hi, count;
4903 /* If the range is constant and "small", unroll the loop. */
4905 && host_integerp (lo_index, 0)
4906 && host_integerp (hi_index, 0)
4907 && (lo = tree_low_cst (lo_index, 0),
4908 hi = tree_low_cst (hi_index, 0),
4909 count = hi - lo + 1,
4912 || (host_integerp (TYPE_SIZE (elttype), 1)
4913 && (tree_low_cst (TYPE_SIZE (elttype), 1) * count
4916 lo -= minelt; hi -= minelt;
4917 for (; lo <= hi; lo++)
4919 bitpos = lo * tree_low_cst (TYPE_SIZE (elttype), 0);
4922 && !MEM_KEEP_ALIAS_SET_P (target)
4923 && TREE_CODE (type) == ARRAY_TYPE
4924 && TYPE_NONALIASED_COMPONENT (type))
4926 target = copy_rtx (target);
4927 MEM_KEEP_ALIAS_SET_P (target) = 1;
4930 store_constructor_field
4931 (target, bitsize, bitpos, mode, value, type, cleared,
4932 get_alias_set (elttype));
4937 rtx loop_start = gen_label_rtx ();
4938 rtx loop_end = gen_label_rtx ();
4941 expand_expr (hi_index, NULL_RTX, VOIDmode, 0);
4942 unsignedp = TYPE_UNSIGNED (domain);
4944 index = build_decl (VAR_DECL, NULL_TREE, domain);
4947 = gen_reg_rtx (promote_mode (domain, DECL_MODE (index),
4949 SET_DECL_RTL (index, index_r);
4950 store_expr (lo_index, index_r, 0);
4952 /* Build the head of the loop. */
4953 do_pending_stack_adjust ();
4954 emit_label (loop_start);
4956 /* Assign value to element index. */
4958 = convert (ssizetype,
4959 fold (build2 (MINUS_EXPR, TREE_TYPE (index),
4960 index, TYPE_MIN_VALUE (domain))));
4961 position = size_binop (MULT_EXPR, position,
4963 TYPE_SIZE_UNIT (elttype)));
4965 pos_rtx = expand_expr (position, 0, VOIDmode, 0);
4966 xtarget = offset_address (target, pos_rtx,
4967 highest_pow2_factor (position));
4968 xtarget = adjust_address (xtarget, mode, 0);
4969 if (TREE_CODE (value) == CONSTRUCTOR)
4970 store_constructor (value, xtarget, cleared,
4971 bitsize / BITS_PER_UNIT);
4973 store_expr (value, xtarget, 0);
4975 /* Generate a conditional jump to exit the loop. */
4976 exit_cond = build2 (LT_EXPR, integer_type_node,
4978 jumpif (exit_cond, loop_end);
4980 /* Update the loop counter, and jump to the head of
4982 expand_assignment (index,
4983 build2 (PLUS_EXPR, TREE_TYPE (index),
4984 index, integer_one_node));
4986 emit_jump (loop_start);
4988 /* Build the end of the loop. */
4989 emit_label (loop_end);
4992 else if ((index != 0 && ! host_integerp (index, 0))
4993 || ! host_integerp (TYPE_SIZE (elttype), 1))
4998 index = ssize_int (1);
5001 index = fold_convert (ssizetype,
5002 fold (build2 (MINUS_EXPR,
5005 TYPE_MIN_VALUE (domain))));
5007 position = size_binop (MULT_EXPR, index,
5009 TYPE_SIZE_UNIT (elttype)));
5010 xtarget = offset_address (target,
5011 expand_expr (position, 0, VOIDmode, 0),
5012 highest_pow2_factor (position));
5013 xtarget = adjust_address (xtarget, mode, 0);
5014 store_expr (value, xtarget, 0);
5019 bitpos = ((tree_low_cst (index, 0) - minelt)
5020 * tree_low_cst (TYPE_SIZE (elttype), 1));
5022 bitpos = (i * tree_low_cst (TYPE_SIZE (elttype), 1));
5024 if (MEM_P (target) && !MEM_KEEP_ALIAS_SET_P (target)
5025 && TREE_CODE (type) == ARRAY_TYPE
5026 && TYPE_NONALIASED_COMPONENT (type))
5028 target = copy_rtx (target);
5029 MEM_KEEP_ALIAS_SET_P (target) = 1;
5031 store_constructor_field (target, bitsize, bitpos, mode, value,
5032 type, cleared, get_alias_set (elttype));
5044 tree elttype = TREE_TYPE (type);
5045 int elt_size = tree_low_cst (TYPE_SIZE (elttype), 1);
5046 enum machine_mode eltmode = TYPE_MODE (elttype);
5047 HOST_WIDE_INT bitsize;
5048 HOST_WIDE_INT bitpos;
5049 rtvec vector = NULL;
5052 gcc_assert (eltmode != BLKmode);
5054 n_elts = TYPE_VECTOR_SUBPARTS (type);
5055 if (REG_P (target) && VECTOR_MODE_P (GET_MODE (target)))
5057 enum machine_mode mode = GET_MODE (target);
5059 icode = (int) vec_init_optab->handlers[mode].insn_code;
5060 if (icode != CODE_FOR_nothing)
5064 vector = rtvec_alloc (n_elts);
5065 for (i = 0; i < n_elts; i++)
5066 RTVEC_ELT (vector, i) = CONST0_RTX (GET_MODE_INNER (mode));
5070 /* If the constructor has fewer elements than the vector,
5071 clear the whole array first. Similarly if this is static
5072 constructor of a non-BLKmode object. */
5075 else if (REG_P (target) && TREE_STATIC (exp))
5079 unsigned HOST_WIDE_INT count = 0, zero_count = 0;
5081 for (elt = CONSTRUCTOR_ELTS (exp);
5083 elt = TREE_CHAIN (elt))
5085 int n_elts_here = tree_low_cst
5086 (int_const_binop (TRUNC_DIV_EXPR,
5087 TYPE_SIZE (TREE_TYPE (TREE_VALUE (elt))),
5088 TYPE_SIZE (elttype), 0), 1);
5090 count += n_elts_here;
5091 if (mostly_zeros_p (TREE_VALUE (elt)))
5092 zero_count += n_elts_here;
5095 /* Clear the entire vector first if there are any missing elements,
5096 or if the incidence of zero elements is >= 75%. */
5097 need_to_clear = (count < n_elts || 4 * zero_count >= 3 * count);
5100 if (need_to_clear && size > 0 && !vector)
5103 emit_move_insn (target, CONST0_RTX (GET_MODE (target)));
5105 clear_storage (target, GEN_INT (size));
5109 if (!cleared && REG_P (target))
5110 /* Inform later passes that the old value is dead. */
5111 emit_insn (gen_rtx_CLOBBER (VOIDmode, target));
5113 /* Store each element of the constructor into the corresponding
5114 element of TARGET, determined by counting the elements. */
5115 for (elt = CONSTRUCTOR_ELTS (exp), i = 0;
5117 elt = TREE_CHAIN (elt), i += bitsize / elt_size)
5119 tree value = TREE_VALUE (elt);
5120 tree index = TREE_PURPOSE (elt);
5121 HOST_WIDE_INT eltpos;
5123 bitsize = tree_low_cst (TYPE_SIZE (TREE_TYPE (value)), 1);
5124 if (cleared && initializer_zerop (value))
5128 eltpos = tree_low_cst (index, 1);
5134 /* Vector CONSTRUCTORs should only be built from smaller
5135 vectors in the case of BLKmode vectors. */
5136 gcc_assert (TREE_CODE (TREE_TYPE (value)) != VECTOR_TYPE);
5137 RTVEC_ELT (vector, eltpos)
5138 = expand_expr (value, NULL_RTX, VOIDmode, 0);
5142 enum machine_mode value_mode =
5143 TREE_CODE (TREE_TYPE (value)) == VECTOR_TYPE
5144 ? TYPE_MODE (TREE_TYPE (value))
5146 bitpos = eltpos * elt_size;
5147 store_constructor_field (target, bitsize, bitpos,
5148 value_mode, value, type,
5149 cleared, get_alias_set (elttype));
5154 emit_insn (GEN_FCN (icode)
5156 gen_rtx_PARALLEL (GET_MODE (target), vector)));
5165 /* Store the value of EXP (an expression tree)
5166 into a subfield of TARGET which has mode MODE and occupies
5167 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5168 If MODE is VOIDmode, it means that we are storing into a bit-field.
5170 Always return const0_rtx unless we have something particular to
5173 TYPE is the type of the underlying object,
5175 ALIAS_SET is the alias set for the destination. This value will
5176 (in general) be different from that for TARGET, since TARGET is a
5177 reference to the containing structure. */
5180 store_field (rtx target, HOST_WIDE_INT bitsize, HOST_WIDE_INT bitpos,
5181 enum machine_mode mode, tree exp, tree type, int alias_set)
5183 HOST_WIDE_INT width_mask = 0;
5185 if (TREE_CODE (exp) == ERROR_MARK)
5188 /* If we have nothing to store, do nothing unless the expression has
5191 return expand_expr (exp, const0_rtx, VOIDmode, 0);
5192 else if (bitsize >= 0 && bitsize < HOST_BITS_PER_WIDE_INT)
5193 width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
5195 /* If we are storing into an unaligned field of an aligned union that is
5196 in a register, we may have the mode of TARGET being an integer mode but
5197 MODE == BLKmode. In that case, get an aligned object whose size and
5198 alignment are the same as TARGET and store TARGET into it (we can avoid
5199 the store if the field being stored is the entire width of TARGET). Then
5200 call ourselves recursively to store the field into a BLKmode version of
5201 that object. Finally, load from the object into TARGET. This is not
5202 very efficient in general, but should only be slightly more expensive
5203 than the otherwise-required unaligned accesses. Perhaps this can be
5204 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5205 twice, once with emit_move_insn and once via store_field. */
5208 && (REG_P (target) || GET_CODE (target) == SUBREG))
5210 rtx object = assign_temp (type, 0, 1, 1);
5211 rtx blk_object = adjust_address (object, BLKmode, 0);
5213 if (bitsize != (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (target)))
5214 emit_move_insn (object, target);
5216 store_field (blk_object, bitsize, bitpos, mode, exp, type, alias_set);
5218 emit_move_insn (target, object);
5220 /* We want to return the BLKmode version of the data. */
5224 if (GET_CODE (target) == CONCAT)
5226 /* We're storing into a struct containing a single __complex. */
5228 gcc_assert (!bitpos);
5229 return store_expr (exp, target, 0);
5232 /* If the structure is in a register or if the component
5233 is a bit field, we cannot use addressing to access it.
5234 Use bit-field techniques or SUBREG to store in it. */
5236 if (mode == VOIDmode
5237 || (mode != BLKmode && ! direct_store[(int) mode]
5238 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
5239 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT)
5241 || GET_CODE (target) == SUBREG
5242 /* If the field isn't aligned enough to store as an ordinary memref,
5243 store it as a bit field. */
5245 && ((((MEM_ALIGN (target) < GET_MODE_ALIGNMENT (mode))
5246 || bitpos % GET_MODE_ALIGNMENT (mode))
5247 && SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (target)))
5248 || (bitpos % BITS_PER_UNIT != 0)))
5249 /* If the RHS and field are a constant size and the size of the
5250 RHS isn't the same size as the bitfield, we must use bitfield
5253 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
5254 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)), bitsize) != 0))
5258 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5259 implies a mask operation. If the precision is the same size as
5260 the field we're storing into, that mask is redundant. This is
5261 particularly common with bit field assignments generated by the
5263 if (TREE_CODE (exp) == NOP_EXPR)
5265 tree type = TREE_TYPE (exp);
5266 if (INTEGRAL_TYPE_P (type)
5267 && TYPE_PRECISION (type) < GET_MODE_BITSIZE (TYPE_MODE (type))
5268 && bitsize == TYPE_PRECISION (type))
5270 type = TREE_TYPE (TREE_OPERAND (exp, 0));
5271 if (INTEGRAL_TYPE_P (type) && TYPE_PRECISION (type) >= bitsize)
5272 exp = TREE_OPERAND (exp, 0);
5276 temp = expand_expr (exp, NULL_RTX, VOIDmode, 0);
5278 /* If BITSIZE is narrower than the size of the type of EXP
5279 we will be narrowing TEMP. Normally, what's wanted are the
5280 low-order bits. However, if EXP's type is a record and this is
5281 big-endian machine, we want the upper BITSIZE bits. */
5282 if (BYTES_BIG_ENDIAN && GET_MODE_CLASS (GET_MODE (temp)) == MODE_INT
5283 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (temp))
5284 && TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
5285 temp = expand_shift (RSHIFT_EXPR, GET_MODE (temp), temp,
5286 size_int (GET_MODE_BITSIZE (GET_MODE (temp))
5290 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5292 if (mode != VOIDmode && mode != BLKmode
5293 && mode != TYPE_MODE (TREE_TYPE (exp)))
5294 temp = convert_modes (mode, TYPE_MODE (TREE_TYPE (exp)), temp, 1);
5296 /* If the modes of TARGET and TEMP are both BLKmode, both
5297 must be in memory and BITPOS must be aligned on a byte
5298 boundary. If so, we simply do a block copy. */
5299 if (GET_MODE (target) == BLKmode && GET_MODE (temp) == BLKmode)
5301 gcc_assert (MEM_P (target) && MEM_P (temp)
5302 && !(bitpos % BITS_PER_UNIT));
5304 target = adjust_address (target, VOIDmode, bitpos / BITS_PER_UNIT);
5305 emit_block_move (target, temp,
5306 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
5313 /* Store the value in the bitfield. */
5314 store_bit_field (target, bitsize, bitpos, mode, temp);
5320 /* Now build a reference to just the desired component. */
5321 rtx to_rtx = adjust_address (target, mode, bitpos / BITS_PER_UNIT);
5323 if (to_rtx == target)
5324 to_rtx = copy_rtx (to_rtx);
5326 MEM_SET_IN_STRUCT_P (to_rtx, 1);
5327 if (!MEM_KEEP_ALIAS_SET_P (to_rtx) && MEM_ALIAS_SET (to_rtx) != 0)
5328 set_mem_alias_set (to_rtx, alias_set);
5330 return store_expr (exp, to_rtx, 0);
5334 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5335 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5336 codes and find the ultimate containing object, which we return.
5338 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5339 bit position, and *PUNSIGNEDP to the signedness of the field.
5340 If the position of the field is variable, we store a tree
5341 giving the variable offset (in units) in *POFFSET.
5342 This offset is in addition to the bit position.
5343 If the position is not variable, we store 0 in *POFFSET.
5345 If any of the extraction expressions is volatile,
5346 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5348 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5349 is a mode that can be used to access the field. In that case, *PBITSIZE
5352 If the field describes a variable-sized object, *PMODE is set to
5353 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5354 this case, but the address of the object can be found.
5356 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5357 look through nodes that serve as markers of a greater alignment than
5358 the one that can be deduced from the expression. These nodes make it
5359 possible for front-ends to prevent temporaries from being created by
5360 the middle-end on alignment considerations. For that purpose, the
5361 normal operating mode at high-level is to always pass FALSE so that
5362 the ultimate containing object is really returned; moreover, the
5363 associated predicate handled_component_p will always return TRUE
5364 on these nodes, thus indicating that they are essentially handled
5365 by get_inner_reference. TRUE should only be passed when the caller
5366 is scanning the expression in order to build another representation
5367 and specifically knows how to handle these nodes; as such, this is
5368 the normal operating mode in the RTL expanders. */
5371 get_inner_reference (tree exp, HOST_WIDE_INT *pbitsize,
5372 HOST_WIDE_INT *pbitpos, tree *poffset,
5373 enum machine_mode *pmode, int *punsignedp,
5374 int *pvolatilep, bool keep_aligning)
5377 enum machine_mode mode = VOIDmode;
5378 tree offset = size_zero_node;
5379 tree bit_offset = bitsize_zero_node;
5382 /* First get the mode, signedness, and size. We do this from just the
5383 outermost expression. */
5384 if (TREE_CODE (exp) == COMPONENT_REF)
5386 size_tree = DECL_SIZE (TREE_OPERAND (exp, 1));
5387 if (! DECL_BIT_FIELD (TREE_OPERAND (exp, 1)))
5388 mode = DECL_MODE (TREE_OPERAND (exp, 1));
5390 *punsignedp = DECL_UNSIGNED (TREE_OPERAND (exp, 1));
5392 else if (TREE_CODE (exp) == BIT_FIELD_REF)
5394 size_tree = TREE_OPERAND (exp, 1);
5395 *punsignedp = BIT_FIELD_REF_UNSIGNED (exp);
5399 mode = TYPE_MODE (TREE_TYPE (exp));
5400 *punsignedp = TYPE_UNSIGNED (TREE_TYPE (exp));
5402 if (mode == BLKmode)
5403 size_tree = TYPE_SIZE (TREE_TYPE (exp));
5405 *pbitsize = GET_MODE_BITSIZE (mode);
5410 if (! host_integerp (size_tree, 1))
5411 mode = BLKmode, *pbitsize = -1;
5413 *pbitsize = tree_low_cst (size_tree, 1);
5416 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5417 and find the ultimate containing object. */
5420 switch (TREE_CODE (exp))
5423 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5424 TREE_OPERAND (exp, 2));
5429 tree field = TREE_OPERAND (exp, 1);
5430 tree this_offset = component_ref_field_offset (exp);
5432 /* If this field hasn't been filled in yet, don't go past it.
5433 This should only happen when folding expressions made during
5434 type construction. */
5435 if (this_offset == 0)
5438 offset = size_binop (PLUS_EXPR, offset, this_offset);
5439 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5440 DECL_FIELD_BIT_OFFSET (field));
5442 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
5447 case ARRAY_RANGE_REF:
5449 tree index = TREE_OPERAND (exp, 1);
5450 tree low_bound = array_ref_low_bound (exp);
5451 tree unit_size = array_ref_element_size (exp);
5453 /* We assume all arrays have sizes that are a multiple of a byte.
5454 First subtract the lower bound, if any, in the type of the
5455 index, then convert to sizetype and multiply by the size of
5456 the array element. */
5457 if (! integer_zerop (low_bound))
5458 index = fold (build2 (MINUS_EXPR, TREE_TYPE (index),
5461 offset = size_binop (PLUS_EXPR, offset,
5462 size_binop (MULT_EXPR,
5463 convert (sizetype, index),
5472 bit_offset = size_binop (PLUS_EXPR, bit_offset,
5473 bitsize_int (*pbitsize));
5476 case VIEW_CONVERT_EXPR:
5477 if (keep_aligning && STRICT_ALIGNMENT
5478 && (TYPE_ALIGN (TREE_TYPE (exp))
5479 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0))))
5480 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp, 0)))
5481 < BIGGEST_ALIGNMENT)
5482 && (TYPE_ALIGN_OK (TREE_TYPE (exp))
5483 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp, 0)))))
5491 /* If any reference in the chain is volatile, the effect is volatile. */
5492 if (TREE_THIS_VOLATILE (exp))
5495 exp = TREE_OPERAND (exp, 0);
5499 /* If OFFSET is constant, see if we can return the whole thing as a
5500 constant bit position. Otherwise, split it up. */
5501 if (host_integerp (offset, 0)
5502 && 0 != (tem = size_binop (MULT_EXPR, convert (bitsizetype, offset),
5504 && 0 != (tem = size_binop (PLUS_EXPR, tem, bit_offset))
5505 && host_integerp (tem, 0))
5506 *pbitpos = tree_low_cst (tem, 0), *poffset = 0;
5508 *pbitpos = tree_low_cst (bit_offset, 0), *poffset = offset;
5514 /* Return a tree of sizetype representing the size, in bytes, of the element
5515 of EXP, an ARRAY_REF. */
5518 array_ref_element_size (tree exp)
5520 tree aligned_size = TREE_OPERAND (exp, 3);
5521 tree elmt_type = TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0)));
5523 /* If a size was specified in the ARRAY_REF, it's the size measured
5524 in alignment units of the element type. So multiply by that value. */
5527 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
5528 sizetype from another type of the same width and signedness. */
5529 if (TREE_TYPE (aligned_size) != sizetype)
5530 aligned_size = fold_convert (sizetype, aligned_size);
5531 return size_binop (MULT_EXPR, aligned_size,
5532 size_int (TYPE_ALIGN_UNIT (elmt_type)));
5535 /* Otherwise, take the size from that of the element type. Substitute
5536 any PLACEHOLDER_EXPR that we have. */
5538 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type), exp);
5541 /* Return a tree representing the lower bound of the array mentioned in
5542 EXP, an ARRAY_REF. */
5545 array_ref_low_bound (tree exp)
5547 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
5549 /* If a lower bound is specified in EXP, use it. */
5550 if (TREE_OPERAND (exp, 2))
5551 return TREE_OPERAND (exp, 2);
5553 /* Otherwise, if there is a domain type and it has a lower bound, use it,
5554 substituting for a PLACEHOLDER_EXPR as needed. */
5555 if (domain_type && TYPE_MIN_VALUE (domain_type))
5556 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp);
5558 /* Otherwise, return a zero of the appropriate type. */
5559 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp, 1)), 0);
5562 /* Return a tree representing the upper bound of the array mentioned in
5563 EXP, an ARRAY_REF. */
5566 array_ref_up_bound (tree exp)
5568 tree domain_type = TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp, 0)));
5570 /* If there is a domain type and it has an upper bound, use it, substituting
5571 for a PLACEHOLDER_EXPR as needed. */
5572 if (domain_type && TYPE_MAX_VALUE (domain_type))
5573 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type), exp);
5575 /* Otherwise fail. */
5579 /* Return a tree representing the offset, in bytes, of the field referenced
5580 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
5583 component_ref_field_offset (tree exp)
5585 tree aligned_offset = TREE_OPERAND (exp, 2);
5586 tree field = TREE_OPERAND (exp, 1);
5588 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
5589 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
5593 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
5594 sizetype from another type of the same width and signedness. */
5595 if (TREE_TYPE (aligned_offset) != sizetype)
5596 aligned_offset = fold_convert (sizetype, aligned_offset);
5597 return size_binop (MULT_EXPR, aligned_offset,
5598 size_int (DECL_OFFSET_ALIGN (field) / BITS_PER_UNIT));
5601 /* Otherwise, take the offset from that of the field. Substitute
5602 any PLACEHOLDER_EXPR that we have. */
5604 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field), exp);
5607 /* Return 1 if T is an expression that get_inner_reference handles. */
5610 handled_component_p (tree t)
5612 switch (TREE_CODE (t))
5617 case ARRAY_RANGE_REF:
5618 case VIEW_CONVERT_EXPR:
5628 /* Given an rtx VALUE that may contain additions and multiplications, return
5629 an equivalent value that just refers to a register, memory, or constant.
5630 This is done by generating instructions to perform the arithmetic and
5631 returning a pseudo-register containing the value.
5633 The returned value may be a REG, SUBREG, MEM or constant. */
5636 force_operand (rtx value, rtx target)
5639 /* Use subtarget as the target for operand 0 of a binary operation. */
5640 rtx subtarget = get_subtarget (target);
5641 enum rtx_code code = GET_CODE (value);
5643 /* Check for subreg applied to an expression produced by loop optimizer. */
5645 && !REG_P (SUBREG_REG (value))
5646 && !MEM_P (SUBREG_REG (value)))
5648 value = simplify_gen_subreg (GET_MODE (value),
5649 force_reg (GET_MODE (SUBREG_REG (value)),
5650 force_operand (SUBREG_REG (value),
5652 GET_MODE (SUBREG_REG (value)),
5653 SUBREG_BYTE (value));
5654 code = GET_CODE (value);
5657 /* Check for a PIC address load. */
5658 if ((code == PLUS || code == MINUS)
5659 && XEXP (value, 0) == pic_offset_table_rtx
5660 && (GET_CODE (XEXP (value, 1)) == SYMBOL_REF
5661 || GET_CODE (XEXP (value, 1)) == LABEL_REF
5662 || GET_CODE (XEXP (value, 1)) == CONST))
5665 subtarget = gen_reg_rtx (GET_MODE (value));
5666 emit_move_insn (subtarget, value);
5670 if (code == ZERO_EXTEND || code == SIGN_EXTEND)
5673 target = gen_reg_rtx (GET_MODE (value));
5674 convert_move (target, force_operand (XEXP (value, 0), NULL),
5675 code == ZERO_EXTEND);
5679 if (ARITHMETIC_P (value))
5681 op2 = XEXP (value, 1);
5682 if (!CONSTANT_P (op2) && !(REG_P (op2) && op2 != subtarget))
5684 if (code == MINUS && GET_CODE (op2) == CONST_INT)
5687 op2 = negate_rtx (GET_MODE (value), op2);
5690 /* Check for an addition with OP2 a constant integer and our first
5691 operand a PLUS of a virtual register and something else. In that
5692 case, we want to emit the sum of the virtual register and the
5693 constant first and then add the other value. This allows virtual
5694 register instantiation to simply modify the constant rather than
5695 creating another one around this addition. */
5696 if (code == PLUS && GET_CODE (op2) == CONST_INT
5697 && GET_CODE (XEXP (value, 0)) == PLUS
5698 && REG_P (XEXP (XEXP (value, 0), 0))
5699 && REGNO (XEXP (XEXP (value, 0), 0)) >= FIRST_VIRTUAL_REGISTER
5700 && REGNO (XEXP (XEXP (value, 0), 0)) <= LAST_VIRTUAL_REGISTER)
5702 rtx temp = expand_simple_binop (GET_MODE (value), code,
5703 XEXP (XEXP (value, 0), 0), op2,
5704 subtarget, 0, OPTAB_LIB_WIDEN);
5705 return expand_simple_binop (GET_MODE (value), code, temp,
5706 force_operand (XEXP (XEXP (value,
5708 target, 0, OPTAB_LIB_WIDEN);
5711 op1 = force_operand (XEXP (value, 0), subtarget);
5712 op2 = force_operand (op2, NULL_RTX);
5716 return expand_mult (GET_MODE (value), op1, op2, target, 1);
5718 if (!INTEGRAL_MODE_P (GET_MODE (value)))
5719 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5720 target, 1, OPTAB_LIB_WIDEN);
5722 return expand_divmod (0,
5723 FLOAT_MODE_P (GET_MODE (value))
5724 ? RDIV_EXPR : TRUNC_DIV_EXPR,
5725 GET_MODE (value), op1, op2, target, 0);
5728 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
5732 return expand_divmod (0, TRUNC_DIV_EXPR, GET_MODE (value), op1, op2,
5736 return expand_divmod (1, TRUNC_MOD_EXPR, GET_MODE (value), op1, op2,
5740 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5741 target, 0, OPTAB_LIB_WIDEN);
5744 return expand_simple_binop (GET_MODE (value), code, op1, op2,
5745 target, 1, OPTAB_LIB_WIDEN);
5748 if (UNARY_P (value))
5750 op1 = force_operand (XEXP (value, 0), NULL_RTX);
5751 return expand_simple_unop (GET_MODE (value), code, op1, target, 0);
5754 #ifdef INSN_SCHEDULING
5755 /* On machines that have insn scheduling, we want all memory reference to be
5756 explicit, so we need to deal with such paradoxical SUBREGs. */
5757 if (GET_CODE (value) == SUBREG && MEM_P (SUBREG_REG (value))
5758 && (GET_MODE_SIZE (GET_MODE (value))
5759 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value)))))
5761 = simplify_gen_subreg (GET_MODE (value),
5762 force_reg (GET_MODE (SUBREG_REG (value)),
5763 force_operand (SUBREG_REG (value),
5765 GET_MODE (SUBREG_REG (value)),
5766 SUBREG_BYTE (value));
5772 /* Subroutine of expand_expr: return nonzero iff there is no way that
5773 EXP can reference X, which is being modified. TOP_P is nonzero if this
5774 call is going to be used to determine whether we need a temporary
5775 for EXP, as opposed to a recursive call to this function.
5777 It is always safe for this routine to return zero since it merely
5778 searches for optimization opportunities. */
5781 safe_from_p (rtx x, tree exp, int top_p)
5787 /* If EXP has varying size, we MUST use a target since we currently
5788 have no way of allocating temporaries of variable size
5789 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
5790 So we assume here that something at a higher level has prevented a
5791 clash. This is somewhat bogus, but the best we can do. Only
5792 do this when X is BLKmode and when we are at the top level. */
5793 || (top_p && TREE_TYPE (exp) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp))
5794 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) != INTEGER_CST
5795 && (TREE_CODE (TREE_TYPE (exp)) != ARRAY_TYPE
5796 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)) == NULL_TREE
5797 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp)))
5799 && GET_MODE (x) == BLKmode)
5800 /* If X is in the outgoing argument area, it is always safe. */
5802 && (XEXP (x, 0) == virtual_outgoing_args_rtx
5803 || (GET_CODE (XEXP (x, 0)) == PLUS
5804 && XEXP (XEXP (x, 0), 0) == virtual_outgoing_args_rtx))))
5807 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
5808 find the underlying pseudo. */
5809 if (GET_CODE (x) == SUBREG)
5812 if (REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
5816 /* Now look at our tree code and possibly recurse. */
5817 switch (TREE_CODE_CLASS (TREE_CODE (exp)))
5819 case tcc_declaration:
5820 exp_rtl = DECL_RTL_IF_SET (exp);
5826 case tcc_exceptional:
5827 if (TREE_CODE (exp) == TREE_LIST)
5831 if (TREE_VALUE (exp) && !safe_from_p (x, TREE_VALUE (exp), 0))
5833 exp = TREE_CHAIN (exp);
5836 if (TREE_CODE (exp) != TREE_LIST)
5837 return safe_from_p (x, exp, 0);
5840 else if (TREE_CODE (exp) == ERROR_MARK)
5841 return 1; /* An already-visited SAVE_EXPR? */
5846 /* The only case we look at here is the DECL_INITIAL inside a
5848 return (TREE_CODE (exp) != DECL_EXPR
5849 || TREE_CODE (DECL_EXPR_DECL (exp)) != VAR_DECL
5850 || !DECL_INITIAL (DECL_EXPR_DECL (exp))
5851 || safe_from_p (x, DECL_INITIAL (DECL_EXPR_DECL (exp)), 0));
5854 case tcc_comparison:
5855 if (!safe_from_p (x, TREE_OPERAND (exp, 1), 0))
5860 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5862 case tcc_expression:
5864 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
5865 the expression. If it is set, we conflict iff we are that rtx or
5866 both are in memory. Otherwise, we check all operands of the
5867 expression recursively. */
5869 switch (TREE_CODE (exp))
5872 /* If the operand is static or we are static, we can't conflict.
5873 Likewise if we don't conflict with the operand at all. */
5874 if (staticp (TREE_OPERAND (exp, 0))
5875 || TREE_STATIC (exp)
5876 || safe_from_p (x, TREE_OPERAND (exp, 0), 0))
5879 /* Otherwise, the only way this can conflict is if we are taking
5880 the address of a DECL a that address if part of X, which is
5882 exp = TREE_OPERAND (exp, 0);
5885 if (!DECL_RTL_SET_P (exp)
5886 || !MEM_P (DECL_RTL (exp)))
5889 exp_rtl = XEXP (DECL_RTL (exp), 0);
5893 case MISALIGNED_INDIRECT_REF:
5894 case ALIGN_INDIRECT_REF:
5897 && alias_sets_conflict_p (MEM_ALIAS_SET (x),
5898 get_alias_set (exp)))
5903 /* Assume that the call will clobber all hard registers and
5905 if ((REG_P (x) && REGNO (x) < FIRST_PSEUDO_REGISTER)
5910 case WITH_CLEANUP_EXPR:
5911 case CLEANUP_POINT_EXPR:
5912 /* Lowered by gimplify.c. */
5916 return safe_from_p (x, TREE_OPERAND (exp, 0), 0);
5922 /* If we have an rtx, we do not need to scan our operands. */
5926 nops = TREE_CODE_LENGTH (TREE_CODE (exp));
5927 for (i = 0; i < nops; i++)
5928 if (TREE_OPERAND (exp, i) != 0
5929 && ! safe_from_p (x, TREE_OPERAND (exp, i), 0))
5932 /* If this is a language-specific tree code, it may require
5933 special handling. */
5934 if ((unsigned int) TREE_CODE (exp)
5935 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
5936 && !lang_hooks.safe_from_p (x, exp))
5941 /* Should never get a type here. */
5945 /* If we have an rtl, find any enclosed object. Then see if we conflict
5949 if (GET_CODE (exp_rtl) == SUBREG)
5951 exp_rtl = SUBREG_REG (exp_rtl);
5953 && REGNO (exp_rtl) < FIRST_PSEUDO_REGISTER)
5957 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
5958 are memory and they conflict. */
5959 return ! (rtx_equal_p (x, exp_rtl)
5960 || (MEM_P (x) && MEM_P (exp_rtl)
5961 && true_dependence (exp_rtl, VOIDmode, x,
5962 rtx_addr_varies_p)));
5965 /* If we reach here, it is safe. */
5970 /* Return the highest power of two that EXP is known to be a multiple of.
5971 This is used in updating alignment of MEMs in array references. */
5973 static unsigned HOST_WIDE_INT
5974 highest_pow2_factor (tree exp)
5976 unsigned HOST_WIDE_INT c0, c1;
5978 switch (TREE_CODE (exp))
5981 /* We can find the lowest bit that's a one. If the low
5982 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
5983 We need to handle this case since we can find it in a COND_EXPR,
5984 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
5985 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
5987 if (TREE_CONSTANT_OVERFLOW (exp))
5988 return BIGGEST_ALIGNMENT;
5991 /* Note: tree_low_cst is intentionally not used here,
5992 we don't care about the upper bits. */
5993 c0 = TREE_INT_CST_LOW (exp);
5995 return c0 ? c0 : BIGGEST_ALIGNMENT;
5999 case PLUS_EXPR: case MINUS_EXPR: case MIN_EXPR: case MAX_EXPR:
6000 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6001 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6002 return MIN (c0, c1);
6005 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6006 c1 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6009 case ROUND_DIV_EXPR: case TRUNC_DIV_EXPR: case FLOOR_DIV_EXPR:
6011 if (integer_pow2p (TREE_OPERAND (exp, 1))
6012 && host_integerp (TREE_OPERAND (exp, 1), 1))
6014 c0 = highest_pow2_factor (TREE_OPERAND (exp, 0));
6015 c1 = tree_low_cst (TREE_OPERAND (exp, 1), 1);
6016 return MAX (1, c0 / c1);
6020 case NON_LVALUE_EXPR: case NOP_EXPR: case CONVERT_EXPR:
6022 return highest_pow2_factor (TREE_OPERAND (exp, 0));
6025 return highest_pow2_factor (TREE_OPERAND (exp, 1));
6028 c0 = highest_pow2_factor (TREE_OPERAND (exp, 1));
6029 c1 = highest_pow2_factor (TREE_OPERAND (exp, 2));
6030 return MIN (c0, c1);
6039 /* Similar, except that the alignment requirements of TARGET are
6040 taken into account. Assume it is at least as aligned as its
6041 type, unless it is a COMPONENT_REF in which case the layout of
6042 the structure gives the alignment. */
6044 static unsigned HOST_WIDE_INT
6045 highest_pow2_factor_for_target (tree target, tree exp)
6047 unsigned HOST_WIDE_INT target_align, factor;
6049 factor = highest_pow2_factor (exp);
6050 if (TREE_CODE (target) == COMPONENT_REF)
6051 target_align = DECL_ALIGN_UNIT (TREE_OPERAND (target, 1));
6053 target_align = TYPE_ALIGN_UNIT (TREE_TYPE (target));
6054 return MAX (factor, target_align);
6057 /* Expands variable VAR. */
6060 expand_var (tree var)
6062 if (DECL_EXTERNAL (var))
6065 if (TREE_STATIC (var))
6066 /* If this is an inlined copy of a static local variable,
6067 look up the original decl. */
6068 var = DECL_ORIGIN (var);
6070 if (TREE_STATIC (var)
6071 ? !TREE_ASM_WRITTEN (var)
6072 : !DECL_RTL_SET_P (var))
6074 if (TREE_CODE (var) == VAR_DECL && DECL_VALUE_EXPR (var))
6075 /* Should be ignored. */;
6076 else if (lang_hooks.expand_decl (var))
6078 else if (TREE_CODE (var) == VAR_DECL && !TREE_STATIC (var))
6080 else if (TREE_CODE (var) == VAR_DECL && TREE_STATIC (var))
6081 rest_of_decl_compilation (var, 0, 0);
6083 /* No expansion needed. */
6084 gcc_assert (TREE_CODE (var) == TYPE_DECL
6085 || TREE_CODE (var) == CONST_DECL
6086 || TREE_CODE (var) == FUNCTION_DECL
6087 || TREE_CODE (var) == LABEL_DECL);
6091 /* Subroutine of expand_expr. Expand the two operands of a binary
6092 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6093 The value may be stored in TARGET if TARGET is nonzero. The
6094 MODIFIER argument is as documented by expand_expr. */
6097 expand_operands (tree exp0, tree exp1, rtx target, rtx *op0, rtx *op1,
6098 enum expand_modifier modifier)
6100 if (! safe_from_p (target, exp1, 1))
6102 if (operand_equal_p (exp0, exp1, 0))
6104 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6105 *op1 = copy_rtx (*op0);
6109 /* If we need to preserve evaluation order, copy exp0 into its own
6110 temporary variable so that it can't be clobbered by exp1. */
6111 if (flag_evaluation_order && TREE_SIDE_EFFECTS (exp1))
6112 exp0 = save_expr (exp0);
6113 *op0 = expand_expr (exp0, target, VOIDmode, modifier);
6114 *op1 = expand_expr (exp1, NULL_RTX, VOIDmode, modifier);
6119 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6120 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6123 expand_expr_addr_expr_1 (tree exp, rtx target, enum machine_mode tmode,
6124 enum expand_modifier modifier)
6126 rtx result, subtarget;
6128 HOST_WIDE_INT bitsize, bitpos;
6129 int volatilep, unsignedp;
6130 enum machine_mode mode1;
6132 /* If we are taking the address of a constant and are at the top level,
6133 we have to use output_constant_def since we can't call force_const_mem
6135 /* ??? This should be considered a front-end bug. We should not be
6136 generating ADDR_EXPR of something that isn't an LVALUE. The only
6137 exception here is STRING_CST. */
6138 if (TREE_CODE (exp) == CONSTRUCTOR
6139 || CONSTANT_CLASS_P (exp))
6140 return XEXP (output_constant_def (exp, 0), 0);
6142 /* Everything must be something allowed by is_gimple_addressable. */
6143 switch (TREE_CODE (exp))
6146 /* This case will happen via recursion for &a->b. */
6147 return expand_expr (TREE_OPERAND (exp, 0), target, tmode, EXPAND_NORMAL);
6150 /* Recurse and make the output_constant_def clause above handle this. */
6151 return expand_expr_addr_expr_1 (DECL_INITIAL (exp), target,
6155 /* The real part of the complex number is always first, therefore
6156 the address is the same as the address of the parent object. */
6159 inner = TREE_OPERAND (exp, 0);
6163 /* The imaginary part of the complex number is always second.
6164 The expression is therefore always offset by the size of the
6167 bitpos = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp)));
6168 inner = TREE_OPERAND (exp, 0);
6172 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6173 expand_expr, as that can have various side effects; LABEL_DECLs for
6174 example, may not have their DECL_RTL set yet. Assume language
6175 specific tree nodes can be expanded in some interesting way. */
6177 || TREE_CODE (exp) >= LAST_AND_UNUSED_TREE_CODE)
6179 result = expand_expr (exp, target, tmode,
6180 modifier == EXPAND_INITIALIZER
6181 ? EXPAND_INITIALIZER : EXPAND_CONST_ADDRESS);
6183 /* If the DECL isn't in memory, then the DECL wasn't properly
6184 marked TREE_ADDRESSABLE, which will be either a front-end
6185 or a tree optimizer bug. */
6186 gcc_assert (GET_CODE (result) == MEM);
6187 result = XEXP (result, 0);
6189 /* ??? Is this needed anymore? */
6190 if (DECL_P (exp) && !TREE_USED (exp) == 0)
6192 assemble_external (exp);
6193 TREE_USED (exp) = 1;
6196 if (modifier != EXPAND_INITIALIZER
6197 && modifier != EXPAND_CONST_ADDRESS)
6198 result = force_operand (result, target);
6202 /* Pass FALSE as the last argument to get_inner_reference although
6203 we are expanding to RTL. The rationale is that we know how to
6204 handle "aligning nodes" here: we can just bypass them because
6205 they won't change the final object whose address will be returned
6206 (they actually exist only for that purpose). */
6207 inner = get_inner_reference (exp, &bitsize, &bitpos, &offset,
6208 &mode1, &unsignedp, &volatilep, false);
6212 /* We must have made progress. */
6213 gcc_assert (inner != exp);
6215 subtarget = offset || bitpos ? NULL_RTX : target;
6216 result = expand_expr_addr_expr_1 (inner, subtarget, tmode, modifier);
6222 if (modifier != EXPAND_NORMAL)
6223 result = force_operand (result, NULL);
6224 tmp = expand_expr (offset, NULL, tmode, EXPAND_NORMAL);
6226 result = convert_memory_address (tmode, result);
6227 tmp = convert_memory_address (tmode, tmp);
6229 if (modifier == EXPAND_SUM)
6230 result = gen_rtx_PLUS (tmode, result, tmp);
6233 subtarget = bitpos ? NULL_RTX : target;
6234 result = expand_simple_binop (tmode, PLUS, result, tmp, subtarget,
6235 1, OPTAB_LIB_WIDEN);
6241 /* Someone beforehand should have rejected taking the address
6242 of such an object. */
6243 gcc_assert ((bitpos % BITS_PER_UNIT) == 0);
6245 result = plus_constant (result, bitpos / BITS_PER_UNIT);
6246 if (modifier < EXPAND_SUM)
6247 result = force_operand (result, target);
6253 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
6254 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6257 expand_expr_addr_expr (tree exp, rtx target, enum machine_mode tmode,
6258 enum expand_modifier modifier)
6260 enum machine_mode rmode;
6263 /* Target mode of VOIDmode says "whatever's natural". */
6264 if (tmode == VOIDmode)
6265 tmode = TYPE_MODE (TREE_TYPE (exp));
6267 /* We can get called with some Weird Things if the user does silliness
6268 like "(short) &a". In that case, convert_memory_address won't do
6269 the right thing, so ignore the given target mode. */
6270 if (tmode != Pmode && tmode != ptr_mode)
6273 result = expand_expr_addr_expr_1 (TREE_OPERAND (exp, 0), target,
6276 /* Despite expand_expr claims concerning ignoring TMODE when not
6277 strictly convenient, stuff breaks if we don't honor it. Note
6278 that combined with the above, we only do this for pointer modes. */
6279 rmode = GET_MODE (result);
6280 if (rmode == VOIDmode)
6283 result = convert_memory_address (tmode, result);
6289 /* expand_expr: generate code for computing expression EXP.
6290 An rtx for the computed value is returned. The value is never null.
6291 In the case of a void EXP, const0_rtx is returned.
6293 The value may be stored in TARGET if TARGET is nonzero.
6294 TARGET is just a suggestion; callers must assume that
6295 the rtx returned may not be the same as TARGET.
6297 If TARGET is CONST0_RTX, it means that the value will be ignored.
6299 If TMODE is not VOIDmode, it suggests generating the
6300 result in mode TMODE. But this is done only when convenient.
6301 Otherwise, TMODE is ignored and the value generated in its natural mode.
6302 TMODE is just a suggestion; callers must assume that
6303 the rtx returned may not have mode TMODE.
6305 Note that TARGET may have neither TMODE nor MODE. In that case, it
6306 probably will not be used.
6308 If MODIFIER is EXPAND_SUM then when EXP is an addition
6309 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
6310 or a nest of (PLUS ...) and (MINUS ...) where the terms are
6311 products as above, or REG or MEM, or constant.
6312 Ordinarily in such cases we would output mul or add instructions
6313 and then return a pseudo reg containing the sum.
6315 EXPAND_INITIALIZER is much like EXPAND_SUM except that
6316 it also marks a label as absolutely required (it can't be dead).
6317 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
6318 This is used for outputting expressions used in initializers.
6320 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
6321 with a constant address even if that address is not normally legitimate.
6322 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
6324 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
6325 a call parameter. Such targets require special care as we haven't yet
6326 marked TARGET so that it's safe from being trashed by libcalls. We
6327 don't want to use TARGET for anything but the final result;
6328 Intermediate values must go elsewhere. Additionally, calls to
6329 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
6331 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
6332 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
6333 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
6334 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
6337 static rtx expand_expr_real_1 (tree, rtx, enum machine_mode,
6338 enum expand_modifier, rtx *);
6341 expand_expr_real (tree exp, rtx target, enum machine_mode tmode,
6342 enum expand_modifier modifier, rtx *alt_rtl)
6345 rtx ret, last = NULL;
6347 /* Handle ERROR_MARK before anybody tries to access its type. */
6348 if (TREE_CODE (exp) == ERROR_MARK
6349 || TREE_CODE (TREE_TYPE (exp)) == ERROR_MARK)
6351 ret = CONST0_RTX (tmode);
6352 return ret ? ret : const0_rtx;
6355 if (flag_non_call_exceptions)
6357 rn = lookup_stmt_eh_region (exp);
6358 /* If rn < 0, then either (1) tree-ssa not used or (2) doesn't throw. */
6360 last = get_last_insn ();
6363 /* If this is an expression of some kind and it has an associated line
6364 number, then emit the line number before expanding the expression.
6366 We need to save and restore the file and line information so that
6367 errors discovered during expansion are emitted with the right
6368 information. It would be better of the diagnostic routines
6369 used the file/line information embedded in the tree nodes rather
6371 if (cfun && EXPR_HAS_LOCATION (exp))
6373 location_t saved_location = input_location;
6374 input_location = EXPR_LOCATION (exp);
6375 emit_line_note (input_location);
6377 /* Record where the insns produced belong. */
6378 record_block_change (TREE_BLOCK (exp));
6380 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
6382 input_location = saved_location;
6386 ret = expand_expr_real_1 (exp, target, tmode, modifier, alt_rtl);
6389 /* If using non-call exceptions, mark all insns that may trap.
6390 expand_call() will mark CALL_INSNs before we get to this code,
6391 but it doesn't handle libcalls, and these may trap. */
6395 for (insn = next_real_insn (last); insn;
6396 insn = next_real_insn (insn))
6398 if (! find_reg_note (insn, REG_EH_REGION, NULL_RTX)
6399 /* If we want exceptions for non-call insns, any
6400 may_trap_p instruction may throw. */
6401 && GET_CODE (PATTERN (insn)) != CLOBBER
6402 && GET_CODE (PATTERN (insn)) != USE
6403 && (CALL_P (insn) || may_trap_p (PATTERN (insn))))
6405 REG_NOTES (insn) = alloc_EXPR_LIST (REG_EH_REGION, GEN_INT (rn),
6415 expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
6416 enum expand_modifier modifier, rtx *alt_rtl)
6419 tree type = TREE_TYPE (exp);
6421 enum machine_mode mode;
6422 enum tree_code code = TREE_CODE (exp);
6424 rtx subtarget, original_target;
6427 bool reduce_bit_field = false;
6428 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field && !ignore \
6429 ? reduce_to_bit_field_precision ((expr), \
6434 mode = TYPE_MODE (type);
6435 unsignedp = TYPE_UNSIGNED (type);
6436 if (lang_hooks.reduce_bit_field_operations
6437 && TREE_CODE (type) == INTEGER_TYPE
6438 && GET_MODE_PRECISION (mode) > TYPE_PRECISION (type))
6440 /* An operation in what may be a bit-field type needs the
6441 result to be reduced to the precision of the bit-field type,
6442 which is narrower than that of the type's mode. */
6443 reduce_bit_field = true;
6444 if (modifier == EXPAND_STACK_PARM)
6448 /* Use subtarget as the target for operand 0 of a binary operation. */
6449 subtarget = get_subtarget (target);
6450 original_target = target;
6451 ignore = (target == const0_rtx
6452 || ((code == NON_LVALUE_EXPR || code == NOP_EXPR
6453 || code == CONVERT_EXPR || code == COND_EXPR
6454 || code == VIEW_CONVERT_EXPR)
6455 && TREE_CODE (type) == VOID_TYPE));
6457 /* If we are going to ignore this result, we need only do something
6458 if there is a side-effect somewhere in the expression. If there
6459 is, short-circuit the most common cases here. Note that we must
6460 not call expand_expr with anything but const0_rtx in case this
6461 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
6465 if (! TREE_SIDE_EFFECTS (exp))
6468 /* Ensure we reference a volatile object even if value is ignored, but
6469 don't do this if all we are doing is taking its address. */
6470 if (TREE_THIS_VOLATILE (exp)
6471 && TREE_CODE (exp) != FUNCTION_DECL
6472 && mode != VOIDmode && mode != BLKmode
6473 && modifier != EXPAND_CONST_ADDRESS)
6475 temp = expand_expr (exp, NULL_RTX, VOIDmode, modifier);
6477 temp = copy_to_reg (temp);
6481 if (TREE_CODE_CLASS (code) == tcc_unary
6482 || code == COMPONENT_REF || code == INDIRECT_REF)
6483 return expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode,
6486 else if (TREE_CODE_CLASS (code) == tcc_binary
6487 || TREE_CODE_CLASS (code) == tcc_comparison
6488 || code == ARRAY_REF || code == ARRAY_RANGE_REF)
6490 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6491 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6494 else if (code == BIT_FIELD_REF)
6496 expand_expr (TREE_OPERAND (exp, 0), const0_rtx, VOIDmode, modifier);
6497 expand_expr (TREE_OPERAND (exp, 1), const0_rtx, VOIDmode, modifier);
6498 expand_expr (TREE_OPERAND (exp, 2), const0_rtx, VOIDmode, modifier);
6505 /* If will do cse, generate all results into pseudo registers
6506 since 1) that allows cse to find more things
6507 and 2) otherwise cse could produce an insn the machine
6508 cannot support. An exception is a CONSTRUCTOR into a multi-word
6509 MEM: that's much more likely to be most efficient into the MEM.
6510 Another is a CALL_EXPR which must return in memory. */
6512 if (! cse_not_expected && mode != BLKmode && target
6513 && (!REG_P (target) || REGNO (target) < FIRST_PSEUDO_REGISTER)
6514 && ! (code == CONSTRUCTOR && GET_MODE_SIZE (mode) > UNITS_PER_WORD)
6515 && ! (code == CALL_EXPR && aggregate_value_p (exp, exp)))
6522 tree function = decl_function_context (exp);
6524 temp = label_rtx (exp);
6525 temp = gen_rtx_LABEL_REF (Pmode, temp);
6527 if (function != current_function_decl
6529 LABEL_REF_NONLOCAL_P (temp) = 1;
6531 temp = gen_rtx_MEM (FUNCTION_MODE, temp);
6536 return expand_expr_real_1 (SSA_NAME_VAR (exp), target, tmode, modifier,
6541 /* If a static var's type was incomplete when the decl was written,
6542 but the type is complete now, lay out the decl now. */
6543 if (DECL_SIZE (exp) == 0
6544 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp))
6545 && (TREE_STATIC (exp) || DECL_EXTERNAL (exp)))
6546 layout_decl (exp, 0);
6548 /* ... fall through ... */
6552 gcc_assert (DECL_RTL (exp));
6554 /* Ensure variable marked as used even if it doesn't go through
6555 a parser. If it hasn't be used yet, write out an external
6557 if (! TREE_USED (exp))
6559 assemble_external (exp);
6560 TREE_USED (exp) = 1;
6563 /* Show we haven't gotten RTL for this yet. */
6566 /* Variables inherited from containing functions should have
6567 been lowered by this point. */
6568 context = decl_function_context (exp);
6569 gcc_assert (!context
6570 || context == current_function_decl
6571 || TREE_STATIC (exp)
6572 /* ??? C++ creates functions that are not TREE_STATIC. */
6573 || TREE_CODE (exp) == FUNCTION_DECL);
6575 /* This is the case of an array whose size is to be determined
6576 from its initializer, while the initializer is still being parsed.
6579 if (MEM_P (DECL_RTL (exp))
6580 && REG_P (XEXP (DECL_RTL (exp), 0)))
6581 temp = validize_mem (DECL_RTL (exp));
6583 /* If DECL_RTL is memory, we are in the normal case and either
6584 the address is not valid or it is not a register and -fforce-addr
6585 is specified, get the address into a register. */
6587 else if (MEM_P (DECL_RTL (exp))
6588 && modifier != EXPAND_CONST_ADDRESS
6589 && modifier != EXPAND_SUM
6590 && modifier != EXPAND_INITIALIZER
6591 && (! memory_address_p (DECL_MODE (exp),
6592 XEXP (DECL_RTL (exp), 0))
6594 && !REG_P (XEXP (DECL_RTL (exp), 0)))))
6597 *alt_rtl = DECL_RTL (exp);
6598 temp = replace_equiv_address (DECL_RTL (exp),
6599 copy_rtx (XEXP (DECL_RTL (exp), 0)));
6602 /* If we got something, return it. But first, set the alignment
6603 if the address is a register. */
6606 if (MEM_P (temp) && REG_P (XEXP (temp, 0)))
6607 mark_reg_pointer (XEXP (temp, 0), DECL_ALIGN (exp));
6612 /* If the mode of DECL_RTL does not match that of the decl, it
6613 must be a promoted value. We return a SUBREG of the wanted mode,
6614 but mark it so that we know that it was already extended. */
6616 if (REG_P (DECL_RTL (exp))
6617 && GET_MODE (DECL_RTL (exp)) != DECL_MODE (exp))
6619 enum machine_mode pmode;
6621 /* Get the signedness used for this variable. Ensure we get the
6622 same mode we got when the variable was declared. */
6623 pmode = promote_mode (type, DECL_MODE (exp), &unsignedp,
6624 (TREE_CODE (exp) == RESULT_DECL ? 1 : 0));
6625 gcc_assert (GET_MODE (DECL_RTL (exp)) == pmode);
6627 temp = gen_lowpart_SUBREG (mode, DECL_RTL (exp));
6628 SUBREG_PROMOTED_VAR_P (temp) = 1;
6629 SUBREG_PROMOTED_UNSIGNED_SET (temp, unsignedp);
6633 return DECL_RTL (exp);
6636 temp = immed_double_const (TREE_INT_CST_LOW (exp),
6637 TREE_INT_CST_HIGH (exp), mode);
6639 /* ??? If overflow is set, fold will have done an incomplete job,
6640 which can result in (plus xx (const_int 0)), which can get
6641 simplified by validate_replace_rtx during virtual register
6642 instantiation, which can result in unrecognizable insns.
6643 Avoid this by forcing all overflows into registers. */
6644 if (TREE_CONSTANT_OVERFLOW (exp)
6645 && modifier != EXPAND_INITIALIZER)
6646 temp = force_reg (mode, temp);
6651 if (GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (exp))) == MODE_VECTOR_INT
6652 || GET_MODE_CLASS (TYPE_MODE (TREE_TYPE (exp))) == MODE_VECTOR_FLOAT)
6653 return const_vector_from_tree (exp);
6655 return expand_expr (build1 (CONSTRUCTOR, TREE_TYPE (exp),
6656 TREE_VECTOR_CST_ELTS (exp)),
6657 ignore ? const0_rtx : target, tmode, modifier);
6660 return expand_expr (DECL_INITIAL (exp), target, VOIDmode, modifier);
6663 /* If optimized, generate immediate CONST_DOUBLE
6664 which will be turned into memory by reload if necessary.
6666 We used to force a register so that loop.c could see it. But
6667 this does not allow gen_* patterns to perform optimizations with
6668 the constants. It also produces two insns in cases like "x = 1.0;".
6669 On most machines, floating-point constants are not permitted in
6670 many insns, so we'd end up copying it to a register in any case.
6672 Now, we do the copying in expand_binop, if appropriate. */
6673 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp),
6674 TYPE_MODE (TREE_TYPE (exp)));
6677 /* Handle evaluating a complex constant in a CONCAT target. */
6678 if (original_target && GET_CODE (original_target) == CONCAT)
6680 enum machine_mode mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
6683 rtarg = XEXP (original_target, 0);
6684 itarg = XEXP (original_target, 1);
6686 /* Move the real and imaginary parts separately. */
6687 op0 = expand_expr (TREE_REALPART (exp), rtarg, mode, 0);
6688 op1 = expand_expr (TREE_IMAGPART (exp), itarg, mode, 0);
6691 emit_move_insn (rtarg, op0);
6693 emit_move_insn (itarg, op1);
6695 return original_target;
6698 /* ... fall through ... */
6701 temp = output_constant_def (exp, 1);
6703 /* temp contains a constant address.
6704 On RISC machines where a constant address isn't valid,
6705 make some insns to get that address into a register. */
6706 if (modifier != EXPAND_CONST_ADDRESS
6707 && modifier != EXPAND_INITIALIZER
6708 && modifier != EXPAND_SUM
6709 && (! memory_address_p (mode, XEXP (temp, 0))
6710 || flag_force_addr))
6711 return replace_equiv_address (temp,
6712 copy_rtx (XEXP (temp, 0)));
6717 tree val = TREE_OPERAND (exp, 0);
6718 rtx ret = expand_expr_real_1 (val, target, tmode, modifier, alt_rtl);
6720 if (!SAVE_EXPR_RESOLVED_P (exp))
6722 /* We can indeed still hit this case, typically via builtin
6723 expanders calling save_expr immediately before expanding
6724 something. Assume this means that we only have to deal
6725 with non-BLKmode values. */
6726 gcc_assert (GET_MODE (ret) != BLKmode);
6728 val = build_decl (VAR_DECL, NULL, TREE_TYPE (exp));
6729 DECL_ARTIFICIAL (val) = 1;
6730 DECL_IGNORED_P (val) = 1;
6731 TREE_OPERAND (exp, 0) = val;
6732 SAVE_EXPR_RESOLVED_P (exp) = 1;
6734 if (!CONSTANT_P (ret))
6735 ret = copy_to_reg (ret);
6736 SET_DECL_RTL (val, ret);
6743 if (TREE_CODE (TREE_OPERAND (exp, 0)) == LABEL_DECL)
6744 expand_goto (TREE_OPERAND (exp, 0));
6746 expand_computed_goto (TREE_OPERAND (exp, 0));
6750 /* If we don't need the result, just ensure we evaluate any
6756 for (elt = CONSTRUCTOR_ELTS (exp); elt; elt = TREE_CHAIN (elt))
6757 expand_expr (TREE_VALUE (elt), const0_rtx, VOIDmode, 0);
6762 /* All elts simple constants => refer to a constant in memory. But
6763 if this is a non-BLKmode mode, let it store a field at a time
6764 since that should make a CONST_INT or CONST_DOUBLE when we
6765 fold. Likewise, if we have a target we can use, it is best to
6766 store directly into the target unless the type is large enough
6767 that memcpy will be used. If we are making an initializer and
6768 all operands are constant, put it in memory as well.
6770 FIXME: Avoid trying to fill vector constructors piece-meal.
6771 Output them with output_constant_def below unless we're sure
6772 they're zeros. This should go away when vector initializers
6773 are treated like VECTOR_CST instead of arrays.
6775 else if ((TREE_STATIC (exp)
6776 && ((mode == BLKmode
6777 && ! (target != 0 && safe_from_p (target, exp, 1)))
6778 || TREE_ADDRESSABLE (exp)
6779 || (host_integerp (TYPE_SIZE_UNIT (type), 1)
6780 && (! MOVE_BY_PIECES_P
6781 (tree_low_cst (TYPE_SIZE_UNIT (type), 1),
6783 && ! mostly_zeros_p (exp))))
6784 || ((modifier == EXPAND_INITIALIZER
6785 || modifier == EXPAND_CONST_ADDRESS)
6786 && TREE_CONSTANT (exp)))
6788 rtx constructor = output_constant_def (exp, 1);
6790 if (modifier != EXPAND_CONST_ADDRESS
6791 && modifier != EXPAND_INITIALIZER
6792 && modifier != EXPAND_SUM)
6793 constructor = validize_mem (constructor);
6799 /* Handle calls that pass values in multiple non-contiguous
6800 locations. The Irix 6 ABI has examples of this. */
6801 if (target == 0 || ! safe_from_p (target, exp, 1)
6802 || GET_CODE (target) == PARALLEL
6803 || modifier == EXPAND_STACK_PARM)
6805 = assign_temp (build_qualified_type (type,
6807 | (TREE_READONLY (exp)
6808 * TYPE_QUAL_CONST))),
6809 0, TREE_ADDRESSABLE (exp), 1);
6811 store_constructor (exp, target, 0, int_expr_size (exp));
6815 case MISALIGNED_INDIRECT_REF:
6816 case ALIGN_INDIRECT_REF:
6819 tree exp1 = TREE_OPERAND (exp, 0);
6822 if (modifier != EXPAND_WRITE)
6826 t = fold_read_from_constant_string (exp);
6828 return expand_expr (t, target, tmode, modifier);
6831 op0 = expand_expr (exp1, NULL_RTX, VOIDmode, EXPAND_SUM);
6832 op0 = memory_address (mode, op0);
6834 if (code == ALIGN_INDIRECT_REF)
6836 int align = TYPE_ALIGN_UNIT (type);
6837 op0 = gen_rtx_AND (Pmode, op0, GEN_INT (-align));
6838 op0 = memory_address (mode, op0);
6841 temp = gen_rtx_MEM (mode, op0);
6843 orig = REF_ORIGINAL (exp);
6846 set_mem_attributes (temp, orig, 0);
6848 /* Resolve the misalignment now, so that we don't have to remember
6849 to resolve it later. Of course, this only works for reads. */
6850 /* ??? When we get around to supporting writes, we'll have to handle
6851 this in store_expr directly. The vectorizer isn't generating
6852 those yet, however. */
6853 if (code == MISALIGNED_INDIRECT_REF)
6858 gcc_assert (modifier == EXPAND_NORMAL);
6860 /* The vectorizer should have already checked the mode. */
6861 icode = movmisalign_optab->handlers[mode].insn_code;
6862 gcc_assert (icode != CODE_FOR_nothing);
6864 /* We've already validated the memory, and we're creating a
6865 new pseudo destination. The predicates really can't fail. */
6866 reg = gen_reg_rtx (mode);
6868 /* Nor can the insn generator. */
6869 insn = GEN_FCN (icode) (reg, temp);
6881 tree array = TREE_OPERAND (exp, 0);
6882 tree index = TREE_OPERAND (exp, 1);
6884 /* Fold an expression like: "foo"[2].
6885 This is not done in fold so it won't happen inside &.
6886 Don't fold if this is for wide characters since it's too
6887 difficult to do correctly and this is a very rare case. */
6889 if (modifier != EXPAND_CONST_ADDRESS
6890 && modifier != EXPAND_INITIALIZER
6891 && modifier != EXPAND_MEMORY)
6893 tree t = fold_read_from_constant_string (exp);
6896 return expand_expr (t, target, tmode, modifier);
6899 /* If this is a constant index into a constant array,
6900 just get the value from the array. Handle both the cases when
6901 we have an explicit constructor and when our operand is a variable
6902 that was declared const. */
6904 if (modifier != EXPAND_CONST_ADDRESS
6905 && modifier != EXPAND_INITIALIZER
6906 && modifier != EXPAND_MEMORY
6907 && TREE_CODE (array) == CONSTRUCTOR
6908 && ! TREE_SIDE_EFFECTS (array)
6909 && TREE_CODE (index) == INTEGER_CST)
6913 for (elem = CONSTRUCTOR_ELTS (array);
6914 (elem && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
6915 elem = TREE_CHAIN (elem))
6918 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
6919 return expand_expr (fold (TREE_VALUE (elem)), target, tmode,
6923 else if (optimize >= 1
6924 && modifier != EXPAND_CONST_ADDRESS
6925 && modifier != EXPAND_INITIALIZER
6926 && modifier != EXPAND_MEMORY
6927 && TREE_READONLY (array) && ! TREE_SIDE_EFFECTS (array)
6928 && TREE_CODE (array) == VAR_DECL && DECL_INITIAL (array)
6929 && TREE_CODE (DECL_INITIAL (array)) != ERROR_MARK
6930 && targetm.binds_local_p (array))
6932 if (TREE_CODE (index) == INTEGER_CST)
6934 tree init = DECL_INITIAL (array);
6936 if (TREE_CODE (init) == CONSTRUCTOR)
6940 for (elem = CONSTRUCTOR_ELTS (init);
6942 && !tree_int_cst_equal (TREE_PURPOSE (elem), index));
6943 elem = TREE_CHAIN (elem))
6946 if (elem && !TREE_SIDE_EFFECTS (TREE_VALUE (elem)))
6947 return expand_expr (fold (TREE_VALUE (elem)), target,
6950 else if (TREE_CODE (init) == STRING_CST
6951 && 0 > compare_tree_int (index,
6952 TREE_STRING_LENGTH (init)))
6954 tree type = TREE_TYPE (TREE_TYPE (init));
6955 enum machine_mode mode = TYPE_MODE (type);
6957 if (GET_MODE_CLASS (mode) == MODE_INT
6958 && GET_MODE_SIZE (mode) == 1)
6959 return gen_int_mode (TREE_STRING_POINTER (init)
6960 [TREE_INT_CST_LOW (index)], mode);
6965 goto normal_inner_ref;
6968 /* If the operand is a CONSTRUCTOR, we can just extract the
6969 appropriate field if it is present. */
6970 if (TREE_CODE (TREE_OPERAND (exp, 0)) == CONSTRUCTOR)
6974 for (elt = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0)); elt;
6975 elt = TREE_CHAIN (elt))
6976 if (TREE_PURPOSE (elt) == TREE_OPERAND (exp, 1)
6977 /* We can normally use the value of the field in the
6978 CONSTRUCTOR. However, if this is a bitfield in
6979 an integral mode that we can fit in a HOST_WIDE_INT,
6980 we must mask only the number of bits in the bitfield,
6981 since this is done implicitly by the constructor. If
6982 the bitfield does not meet either of those conditions,
6983 we can't do this optimization. */
6984 && (! DECL_BIT_FIELD (TREE_PURPOSE (elt))
6985 || ((GET_MODE_CLASS (DECL_MODE (TREE_PURPOSE (elt)))
6987 && (GET_MODE_BITSIZE (DECL_MODE (TREE_PURPOSE (elt)))
6988 <= HOST_BITS_PER_WIDE_INT))))
6990 if (DECL_BIT_FIELD (TREE_PURPOSE (elt))
6991 && modifier == EXPAND_STACK_PARM)
6993 op0 = expand_expr (TREE_VALUE (elt), target, tmode, modifier);
6994 if (DECL_BIT_FIELD (TREE_PURPOSE (elt)))
6996 HOST_WIDE_INT bitsize
6997 = TREE_INT_CST_LOW (DECL_SIZE (TREE_PURPOSE (elt)));
6998 enum machine_mode imode
6999 = TYPE_MODE (TREE_TYPE (TREE_PURPOSE (elt)));
7001 if (TYPE_UNSIGNED (TREE_TYPE (TREE_PURPOSE (elt))))
7003 op1 = GEN_INT (((HOST_WIDE_INT) 1 << bitsize) - 1);
7004 op0 = expand_and (imode, op0, op1, target);
7009 = build_int_cst (NULL_TREE,
7010 GET_MODE_BITSIZE (imode) - bitsize);
7012 op0 = expand_shift (LSHIFT_EXPR, imode, op0, count,
7014 op0 = expand_shift (RSHIFT_EXPR, imode, op0, count,
7022 goto normal_inner_ref;
7025 case ARRAY_RANGE_REF:
7028 enum machine_mode mode1;
7029 HOST_WIDE_INT bitsize, bitpos;
7032 tree tem = get_inner_reference (exp, &bitsize, &bitpos, &offset,
7033 &mode1, &unsignedp, &volatilep, true);
7036 /* If we got back the original object, something is wrong. Perhaps
7037 we are evaluating an expression too early. In any event, don't
7038 infinitely recurse. */
7039 gcc_assert (tem != exp);
7041 /* If TEM's type is a union of variable size, pass TARGET to the inner
7042 computation, since it will need a temporary and TARGET is known
7043 to have to do. This occurs in unchecked conversion in Ada. */
7047 (TREE_CODE (TREE_TYPE (tem)) == UNION_TYPE
7048 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem)))
7050 && modifier != EXPAND_STACK_PARM
7051 ? target : NULL_RTX),
7053 (modifier == EXPAND_INITIALIZER
7054 || modifier == EXPAND_CONST_ADDRESS
7055 || modifier == EXPAND_STACK_PARM)
7056 ? modifier : EXPAND_NORMAL);
7058 /* If this is a constant, put it into a register if it is a
7059 legitimate constant and OFFSET is 0 and memory if it isn't. */
7060 if (CONSTANT_P (op0))
7062 enum machine_mode mode = TYPE_MODE (TREE_TYPE (tem));
7063 if (mode != BLKmode && LEGITIMATE_CONSTANT_P (op0)
7065 op0 = force_reg (mode, op0);
7067 op0 = validize_mem (force_const_mem (mode, op0));
7070 /* Otherwise, if this object not in memory and we either have an
7071 offset or a BLKmode result, put it there. This case can't occur in
7072 C, but can in Ada if we have unchecked conversion of an expression
7073 from a scalar type to an array or record type or for an
7074 ARRAY_RANGE_REF whose type is BLKmode. */
7075 else if (!MEM_P (op0)
7077 || (code == ARRAY_RANGE_REF && mode == BLKmode)))
7079 tree nt = build_qualified_type (TREE_TYPE (tem),
7080 (TYPE_QUALS (TREE_TYPE (tem))
7081 | TYPE_QUAL_CONST));
7082 rtx memloc = assign_temp (nt, 1, 1, 1);
7084 emit_move_insn (memloc, op0);
7090 rtx offset_rtx = expand_expr (offset, NULL_RTX, VOIDmode,
7093 gcc_assert (MEM_P (op0));
7095 #ifdef POINTERS_EXTEND_UNSIGNED
7096 if (GET_MODE (offset_rtx) != Pmode)
7097 offset_rtx = convert_to_mode (Pmode, offset_rtx, 0);
7099 if (GET_MODE (offset_rtx) != ptr_mode)
7100 offset_rtx = convert_to_mode (ptr_mode, offset_rtx, 0);
7103 if (GET_MODE (op0) == BLKmode
7104 /* A constant address in OP0 can have VOIDmode, we must
7105 not try to call force_reg in that case. */
7106 && GET_MODE (XEXP (op0, 0)) != VOIDmode
7108 && (bitpos % bitsize) == 0
7109 && (bitsize % GET_MODE_ALIGNMENT (mode1)) == 0
7110 && MEM_ALIGN (op0) == GET_MODE_ALIGNMENT (mode1))
7112 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7116 op0 = offset_address (op0, offset_rtx,
7117 highest_pow2_factor (offset));
7120 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
7121 record its alignment as BIGGEST_ALIGNMENT. */
7122 if (MEM_P (op0) && bitpos == 0 && offset != 0
7123 && is_aligning_offset (offset, tem))
7124 set_mem_align (op0, BIGGEST_ALIGNMENT);
7126 /* Don't forget about volatility even if this is a bitfield. */
7127 if (MEM_P (op0) && volatilep && ! MEM_VOLATILE_P (op0))
7129 if (op0 == orig_op0)
7130 op0 = copy_rtx (op0);
7132 MEM_VOLATILE_P (op0) = 1;
7135 /* The following code doesn't handle CONCAT.
7136 Assume only bitpos == 0 can be used for CONCAT, due to
7137 one element arrays having the same mode as its element. */
7138 if (GET_CODE (op0) == CONCAT)
7140 gcc_assert (bitpos == 0
7141 && bitsize == GET_MODE_BITSIZE (GET_MODE (op0)));
7145 /* In cases where an aligned union has an unaligned object
7146 as a field, we might be extracting a BLKmode value from
7147 an integer-mode (e.g., SImode) object. Handle this case
7148 by doing the extract into an object as wide as the field
7149 (which we know to be the width of a basic mode), then
7150 storing into memory, and changing the mode to BLKmode. */
7151 if (mode1 == VOIDmode
7152 || REG_P (op0) || GET_CODE (op0) == SUBREG
7153 || (mode1 != BLKmode && ! direct_load[(int) mode1]
7154 && GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7155 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT
7156 && modifier != EXPAND_CONST_ADDRESS
7157 && modifier != EXPAND_INITIALIZER)
7158 /* If the field isn't aligned enough to fetch as a memref,
7159 fetch it as a bit field. */
7160 || (mode1 != BLKmode
7161 && (((TYPE_ALIGN (TREE_TYPE (tem)) < GET_MODE_ALIGNMENT (mode)
7162 || (bitpos % GET_MODE_ALIGNMENT (mode) != 0)
7164 && (MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (mode1)
7165 || (bitpos % GET_MODE_ALIGNMENT (mode1) != 0))))
7166 && ((modifier == EXPAND_CONST_ADDRESS
7167 || modifier == EXPAND_INITIALIZER)
7169 : SLOW_UNALIGNED_ACCESS (mode1, MEM_ALIGN (op0))))
7170 || (bitpos % BITS_PER_UNIT != 0)))
7171 /* If the type and the field are a constant size and the
7172 size of the type isn't the same size as the bitfield,
7173 we must use bitfield operations. */
7175 && TYPE_SIZE (TREE_TYPE (exp))
7176 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp))) == INTEGER_CST
7177 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp)),
7180 enum machine_mode ext_mode = mode;
7182 if (ext_mode == BLKmode
7183 && ! (target != 0 && MEM_P (op0)
7185 && bitpos % BITS_PER_UNIT == 0))
7186 ext_mode = mode_for_size (bitsize, MODE_INT, 1);
7188 if (ext_mode == BLKmode)
7191 target = assign_temp (type, 0, 1, 1);
7196 /* In this case, BITPOS must start at a byte boundary and
7197 TARGET, if specified, must be a MEM. */
7198 gcc_assert (MEM_P (op0)
7199 && (!target || MEM_P (target))
7200 && !(bitpos % BITS_PER_UNIT));
7202 emit_block_move (target,
7203 adjust_address (op0, VOIDmode,
7204 bitpos / BITS_PER_UNIT),
7205 GEN_INT ((bitsize + BITS_PER_UNIT - 1)
7207 (modifier == EXPAND_STACK_PARM
7208 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
7213 op0 = validize_mem (op0);
7215 if (MEM_P (op0) && REG_P (XEXP (op0, 0)))
7216 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7218 op0 = extract_bit_field (op0, bitsize, bitpos, unsignedp,
7219 (modifier == EXPAND_STACK_PARM
7220 ? NULL_RTX : target),
7221 ext_mode, ext_mode);
7223 /* If the result is a record type and BITSIZE is narrower than
7224 the mode of OP0, an integral mode, and this is a big endian
7225 machine, we must put the field into the high-order bits. */
7226 if (TREE_CODE (type) == RECORD_TYPE && BYTES_BIG_ENDIAN
7227 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7228 && bitsize < (HOST_WIDE_INT) GET_MODE_BITSIZE (GET_MODE (op0)))
7229 op0 = expand_shift (LSHIFT_EXPR, GET_MODE (op0), op0,
7230 size_int (GET_MODE_BITSIZE (GET_MODE (op0))
7234 /* If the result type is BLKmode, store the data into a temporary
7235 of the appropriate type, but with the mode corresponding to the
7236 mode for the data we have (op0's mode). It's tempting to make
7237 this a constant type, since we know it's only being stored once,
7238 but that can cause problems if we are taking the address of this
7239 COMPONENT_REF because the MEM of any reference via that address
7240 will have flags corresponding to the type, which will not
7241 necessarily be constant. */
7242 if (mode == BLKmode)
7245 = assign_stack_temp_for_type
7246 (ext_mode, GET_MODE_BITSIZE (ext_mode), 0, type);
7248 emit_move_insn (new, op0);
7249 op0 = copy_rtx (new);
7250 PUT_MODE (op0, BLKmode);
7251 set_mem_attributes (op0, exp, 1);
7257 /* If the result is BLKmode, use that to access the object
7259 if (mode == BLKmode)
7262 /* Get a reference to just this component. */
7263 if (modifier == EXPAND_CONST_ADDRESS
7264 || modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7265 op0 = adjust_address_nv (op0, mode1, bitpos / BITS_PER_UNIT);
7267 op0 = adjust_address (op0, mode1, bitpos / BITS_PER_UNIT);
7269 if (op0 == orig_op0)
7270 op0 = copy_rtx (op0);
7272 set_mem_attributes (op0, exp, 0);
7273 if (REG_P (XEXP (op0, 0)))
7274 mark_reg_pointer (XEXP (op0, 0), MEM_ALIGN (op0));
7276 MEM_VOLATILE_P (op0) |= volatilep;
7277 if (mode == mode1 || mode1 == BLKmode || mode1 == tmode
7278 || modifier == EXPAND_CONST_ADDRESS
7279 || modifier == EXPAND_INITIALIZER)
7281 else if (target == 0)
7282 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
7284 convert_move (target, op0, unsignedp);
7289 return expand_expr (OBJ_TYPE_REF_EXPR (exp), target, tmode, modifier);
7292 /* Check for a built-in function. */
7293 if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
7294 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7296 && DECL_BUILT_IN (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7298 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
7299 == BUILT_IN_FRONTEND)
7300 return lang_hooks.expand_expr (exp, original_target,
7304 return expand_builtin (exp, target, subtarget, tmode, ignore);
7307 return expand_call (exp, target, ignore);
7309 case NON_LVALUE_EXPR:
7312 if (TREE_OPERAND (exp, 0) == error_mark_node)
7315 if (TREE_CODE (type) == UNION_TYPE)
7317 tree valtype = TREE_TYPE (TREE_OPERAND (exp, 0));
7319 /* If both input and output are BLKmode, this conversion isn't doing
7320 anything except possibly changing memory attribute. */
7321 if (mode == BLKmode && TYPE_MODE (valtype) == BLKmode)
7323 rtx result = expand_expr (TREE_OPERAND (exp, 0), target, tmode,
7326 result = copy_rtx (result);
7327 set_mem_attributes (result, exp, 0);
7333 if (TYPE_MODE (type) != BLKmode)
7334 target = gen_reg_rtx (TYPE_MODE (type));
7336 target = assign_temp (type, 0, 1, 1);
7340 /* Store data into beginning of memory target. */
7341 store_expr (TREE_OPERAND (exp, 0),
7342 adjust_address (target, TYPE_MODE (valtype), 0),
7343 modifier == EXPAND_STACK_PARM);
7347 gcc_assert (REG_P (target));
7349 /* Store this field into a union of the proper type. */
7350 store_field (target,
7351 MIN ((int_size_in_bytes (TREE_TYPE
7352 (TREE_OPERAND (exp, 0)))
7354 (HOST_WIDE_INT) GET_MODE_BITSIZE (mode)),
7355 0, TYPE_MODE (valtype), TREE_OPERAND (exp, 0),
7359 /* Return the entire union. */
7363 if (mode == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))))
7365 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode,
7368 /* If the signedness of the conversion differs and OP0 is
7369 a promoted SUBREG, clear that indication since we now
7370 have to do the proper extension. */
7371 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))) != unsignedp
7372 && GET_CODE (op0) == SUBREG)
7373 SUBREG_PROMOTED_VAR_P (op0) = 0;
7375 return REDUCE_BIT_FIELD (op0);
7378 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7379 if (GET_MODE (op0) == mode)
7382 /* If OP0 is a constant, just convert it into the proper mode. */
7383 else if (CONSTANT_P (op0))
7385 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7386 enum machine_mode inner_mode = TYPE_MODE (inner_type);
7388 if (modifier == EXPAND_INITIALIZER)
7389 op0 = simplify_gen_subreg (mode, op0, inner_mode,
7390 subreg_lowpart_offset (mode,
7393 op0= convert_modes (mode, inner_mode, op0,
7394 TYPE_UNSIGNED (inner_type));
7397 else if (modifier == EXPAND_INITIALIZER)
7398 op0 = gen_rtx_fmt_e (unsignedp ? ZERO_EXTEND : SIGN_EXTEND, mode, op0);
7400 else if (target == 0)
7401 op0 = convert_to_mode (mode, op0,
7402 TYPE_UNSIGNED (TREE_TYPE
7403 (TREE_OPERAND (exp, 0))));
7406 convert_move (target, op0,
7407 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7411 return REDUCE_BIT_FIELD (op0);
7413 case VIEW_CONVERT_EXPR:
7414 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, mode, modifier);
7416 /* If the input and output modes are both the same, we are done.
7417 Otherwise, if neither mode is BLKmode and both are integral and within
7418 a word, we can use gen_lowpart. If neither is true, make sure the
7419 operand is in memory and convert the MEM to the new mode. */
7420 if (TYPE_MODE (type) == GET_MODE (op0))
7422 else if (TYPE_MODE (type) != BLKmode && GET_MODE (op0) != BLKmode
7423 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
7424 && GET_MODE_CLASS (TYPE_MODE (type)) == MODE_INT
7425 && GET_MODE_SIZE (TYPE_MODE (type)) <= UNITS_PER_WORD
7426 && GET_MODE_SIZE (GET_MODE (op0)) <= UNITS_PER_WORD)
7427 op0 = gen_lowpart (TYPE_MODE (type), op0);
7428 else if (!MEM_P (op0))
7430 /* If the operand is not a MEM, force it into memory. Since we
7431 are going to be be changing the mode of the MEM, don't call
7432 force_const_mem for constants because we don't allow pool
7433 constants to change mode. */
7434 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7436 gcc_assert (!TREE_ADDRESSABLE (exp));
7438 if (target == 0 || GET_MODE (target) != TYPE_MODE (inner_type))
7440 = assign_stack_temp_for_type
7441 (TYPE_MODE (inner_type),
7442 GET_MODE_SIZE (TYPE_MODE (inner_type)), 0, inner_type);
7444 emit_move_insn (target, op0);
7448 /* At this point, OP0 is in the correct mode. If the output type is such
7449 that the operand is known to be aligned, indicate that it is.
7450 Otherwise, we need only be concerned about alignment for non-BLKmode
7454 op0 = copy_rtx (op0);
7456 if (TYPE_ALIGN_OK (type))
7457 set_mem_align (op0, MAX (MEM_ALIGN (op0), TYPE_ALIGN (type)));
7458 else if (TYPE_MODE (type) != BLKmode && STRICT_ALIGNMENT
7459 && MEM_ALIGN (op0) < GET_MODE_ALIGNMENT (TYPE_MODE (type)))
7461 tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
7462 HOST_WIDE_INT temp_size
7463 = MAX (int_size_in_bytes (inner_type),
7464 (HOST_WIDE_INT) GET_MODE_SIZE (TYPE_MODE (type)));
7465 rtx new = assign_stack_temp_for_type (TYPE_MODE (type),
7466 temp_size, 0, type);
7467 rtx new_with_op0_mode = adjust_address (new, GET_MODE (op0), 0);
7469 gcc_assert (!TREE_ADDRESSABLE (exp));
7471 if (GET_MODE (op0) == BLKmode)
7472 emit_block_move (new_with_op0_mode, op0,
7473 GEN_INT (GET_MODE_SIZE (TYPE_MODE (type))),
7474 (modifier == EXPAND_STACK_PARM
7475 ? BLOCK_OP_CALL_PARM : BLOCK_OP_NORMAL));
7477 emit_move_insn (new_with_op0_mode, op0);
7482 op0 = adjust_address (op0, TYPE_MODE (type), 0);
7488 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
7489 something else, make sure we add the register to the constant and
7490 then to the other thing. This case can occur during strength
7491 reduction and doing it this way will produce better code if the
7492 frame pointer or argument pointer is eliminated.
7494 fold-const.c will ensure that the constant is always in the inner
7495 PLUS_EXPR, so the only case we need to do anything about is if
7496 sp, ap, or fp is our second argument, in which case we must swap
7497 the innermost first argument and our second argument. */
7499 if (TREE_CODE (TREE_OPERAND (exp, 0)) == PLUS_EXPR
7500 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 1)) == INTEGER_CST
7501 && TREE_CODE (TREE_OPERAND (exp, 1)) == VAR_DECL
7502 && (DECL_RTL (TREE_OPERAND (exp, 1)) == frame_pointer_rtx
7503 || DECL_RTL (TREE_OPERAND (exp, 1)) == stack_pointer_rtx
7504 || DECL_RTL (TREE_OPERAND (exp, 1)) == arg_pointer_rtx))
7506 tree t = TREE_OPERAND (exp, 1);
7508 TREE_OPERAND (exp, 1) = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
7509 TREE_OPERAND (TREE_OPERAND (exp, 0), 0) = t;
7512 /* If the result is to be ptr_mode and we are adding an integer to
7513 something, we might be forming a constant. So try to use
7514 plus_constant. If it produces a sum and we can't accept it,
7515 use force_operand. This allows P = &ARR[const] to generate
7516 efficient code on machines where a SYMBOL_REF is not a valid
7519 If this is an EXPAND_SUM call, always return the sum. */
7520 if (modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER
7521 || (mode == ptr_mode && (unsignedp || ! flag_trapv)))
7523 if (modifier == EXPAND_STACK_PARM)
7525 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST
7526 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
7527 && TREE_CONSTANT (TREE_OPERAND (exp, 1)))
7531 op1 = expand_expr (TREE_OPERAND (exp, 1), subtarget, VOIDmode,
7533 /* Use immed_double_const to ensure that the constant is
7534 truncated according to the mode of OP1, then sign extended
7535 to a HOST_WIDE_INT. Using the constant directly can result
7536 in non-canonical RTL in a 64x32 cross compile. */
7538 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 0)),
7540 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))));
7541 op1 = plus_constant (op1, INTVAL (constant_part));
7542 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7543 op1 = force_operand (op1, target);
7544 return REDUCE_BIT_FIELD (op1);
7547 else if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7548 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_INT
7549 && TREE_CONSTANT (TREE_OPERAND (exp, 0)))
7553 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7554 (modifier == EXPAND_INITIALIZER
7555 ? EXPAND_INITIALIZER : EXPAND_SUM));
7556 if (! CONSTANT_P (op0))
7558 op1 = expand_expr (TREE_OPERAND (exp, 1), NULL_RTX,
7559 VOIDmode, modifier);
7560 /* Return a PLUS if modifier says it's OK. */
7561 if (modifier == EXPAND_SUM
7562 || modifier == EXPAND_INITIALIZER)
7563 return simplify_gen_binary (PLUS, mode, op0, op1);
7566 /* Use immed_double_const to ensure that the constant is
7567 truncated according to the mode of OP1, then sign extended
7568 to a HOST_WIDE_INT. Using the constant directly can result
7569 in non-canonical RTL in a 64x32 cross compile. */
7571 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)),
7573 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))));
7574 op0 = plus_constant (op0, INTVAL (constant_part));
7575 if (modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7576 op0 = force_operand (op0, target);
7577 return REDUCE_BIT_FIELD (op0);
7581 /* No sense saving up arithmetic to be done
7582 if it's all in the wrong mode to form part of an address.
7583 And force_operand won't know whether to sign-extend or
7585 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7586 || mode != ptr_mode)
7588 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7589 subtarget, &op0, &op1, 0);
7590 if (op0 == const0_rtx)
7592 if (op1 == const0_rtx)
7597 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7598 subtarget, &op0, &op1, modifier);
7599 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7602 /* For initializers, we are allowed to return a MINUS of two
7603 symbolic constants. Here we handle all cases when both operands
7605 /* Handle difference of two symbolic constants,
7606 for the sake of an initializer. */
7607 if ((modifier == EXPAND_SUM || modifier == EXPAND_INITIALIZER)
7608 && really_constant_p (TREE_OPERAND (exp, 0))
7609 && really_constant_p (TREE_OPERAND (exp, 1)))
7611 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7612 NULL_RTX, &op0, &op1, modifier);
7614 /* If the last operand is a CONST_INT, use plus_constant of
7615 the negated constant. Else make the MINUS. */
7616 if (GET_CODE (op1) == CONST_INT)
7617 return REDUCE_BIT_FIELD (plus_constant (op0, - INTVAL (op1)));
7619 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode, op0, op1));
7622 /* No sense saving up arithmetic to be done
7623 if it's all in the wrong mode to form part of an address.
7624 And force_operand won't know whether to sign-extend or
7626 if ((modifier != EXPAND_SUM && modifier != EXPAND_INITIALIZER)
7627 || mode != ptr_mode)
7630 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7631 subtarget, &op0, &op1, modifier);
7633 /* Convert A - const to A + (-const). */
7634 if (GET_CODE (op1) == CONST_INT)
7636 op1 = negate_rtx (mode, op1);
7637 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS, mode, op0, op1));
7643 /* If first operand is constant, swap them.
7644 Thus the following special case checks need only
7645 check the second operand. */
7646 if (TREE_CODE (TREE_OPERAND (exp, 0)) == INTEGER_CST)
7648 tree t1 = TREE_OPERAND (exp, 0);
7649 TREE_OPERAND (exp, 0) = TREE_OPERAND (exp, 1);
7650 TREE_OPERAND (exp, 1) = t1;
7653 /* Attempt to return something suitable for generating an
7654 indexed address, for machines that support that. */
7656 if (modifier == EXPAND_SUM && mode == ptr_mode
7657 && host_integerp (TREE_OPERAND (exp, 1), 0))
7659 tree exp1 = TREE_OPERAND (exp, 1);
7661 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode,
7665 op0 = force_operand (op0, NULL_RTX);
7667 op0 = copy_to_mode_reg (mode, op0);
7669 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode, op0,
7670 gen_int_mode (tree_low_cst (exp1, 0),
7671 TYPE_MODE (TREE_TYPE (exp1)))));
7674 if (modifier == EXPAND_STACK_PARM)
7677 /* Check for multiplying things that have been extended
7678 from a narrower type. If this machine supports multiplying
7679 in that narrower type with a result in the desired type,
7680 do it that way, and avoid the explicit type-conversion. */
7681 if (TREE_CODE (TREE_OPERAND (exp, 0)) == NOP_EXPR
7682 && TREE_CODE (type) == INTEGER_TYPE
7683 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7684 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp, 0))))
7685 && ((TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST
7686 && int_fits_type_p (TREE_OPERAND (exp, 1),
7687 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0)))
7688 /* Don't use a widening multiply if a shift will do. */
7689 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 1))))
7690 > HOST_BITS_PER_WIDE_INT)
7691 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp, 1))) < 0))
7693 (TREE_CODE (TREE_OPERAND (exp, 1)) == NOP_EXPR
7694 && (TYPE_PRECISION (TREE_TYPE
7695 (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7696 == TYPE_PRECISION (TREE_TYPE
7698 (TREE_OPERAND (exp, 0), 0))))
7699 /* If both operands are extended, they must either both
7700 be zero-extended or both be sign-extended. */
7701 && (TYPE_UNSIGNED (TREE_TYPE
7702 (TREE_OPERAND (TREE_OPERAND (exp, 1), 0)))
7703 == TYPE_UNSIGNED (TREE_TYPE
7705 (TREE_OPERAND (exp, 0), 0)))))))
7707 tree op0type = TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0));
7708 enum machine_mode innermode = TYPE_MODE (op0type);
7709 bool zextend_p = TYPE_UNSIGNED (op0type);
7710 optab other_optab = zextend_p ? smul_widen_optab : umul_widen_optab;
7711 this_optab = zextend_p ? umul_widen_optab : smul_widen_optab;
7713 if (mode == GET_MODE_WIDER_MODE (innermode))
7715 if (this_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing)
7717 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7718 expand_operands (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7719 TREE_OPERAND (exp, 1),
7720 NULL_RTX, &op0, &op1, 0);
7722 expand_operands (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7723 TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7724 NULL_RTX, &op0, &op1, 0);
7727 else if (other_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
7728 && innermode == word_mode)
7731 op0 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 0), 0),
7732 NULL_RTX, VOIDmode, 0);
7733 if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
7734 op1 = convert_modes (innermode, mode,
7735 expand_expr (TREE_OPERAND (exp, 1),
7736 NULL_RTX, VOIDmode, 0),
7739 op1 = expand_expr (TREE_OPERAND (TREE_OPERAND (exp, 1), 0),
7740 NULL_RTX, VOIDmode, 0);
7741 temp = expand_binop (mode, other_optab, op0, op1, target,
7742 unsignedp, OPTAB_LIB_WIDEN);
7743 hipart = gen_highpart (innermode, temp);
7744 htem = expand_mult_highpart_adjust (innermode, hipart,
7748 emit_move_insn (hipart, htem);
7749 return REDUCE_BIT_FIELD (temp);
7753 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7754 subtarget, &op0, &op1, 0);
7755 return REDUCE_BIT_FIELD (expand_mult (mode, op0, op1, target, unsignedp));
7757 case TRUNC_DIV_EXPR:
7758 case FLOOR_DIV_EXPR:
7760 case ROUND_DIV_EXPR:
7761 case EXACT_DIV_EXPR:
7762 if (modifier == EXPAND_STACK_PARM)
7764 /* Possible optimization: compute the dividend with EXPAND_SUM
7765 then if the divisor is constant can optimize the case
7766 where some terms of the dividend have coeffs divisible by it. */
7767 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7768 subtarget, &op0, &op1, 0);
7769 return expand_divmod (0, code, mode, op0, op1, target, unsignedp);
7772 /* Emit a/b as a*(1/b). Later we may manage CSE the reciprocal saving
7773 expensive divide. If not, combine will rebuild the original
7775 if (flag_unsafe_math_optimizations && optimize && !optimize_size
7776 && TREE_CODE (type) == REAL_TYPE
7777 && !real_onep (TREE_OPERAND (exp, 0)))
7778 return expand_expr (build2 (MULT_EXPR, type, TREE_OPERAND (exp, 0),
7779 build2 (RDIV_EXPR, type,
7780 build_real (type, dconst1),
7781 TREE_OPERAND (exp, 1))),
7782 target, tmode, modifier);
7786 case TRUNC_MOD_EXPR:
7787 case FLOOR_MOD_EXPR:
7789 case ROUND_MOD_EXPR:
7790 if (modifier == EXPAND_STACK_PARM)
7792 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7793 subtarget, &op0, &op1, 0);
7794 return expand_divmod (1, code, mode, op0, op1, target, unsignedp);
7796 case FIX_ROUND_EXPR:
7797 case FIX_FLOOR_EXPR:
7799 gcc_unreachable (); /* Not used for C. */
7801 case FIX_TRUNC_EXPR:
7802 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7803 if (target == 0 || modifier == EXPAND_STACK_PARM)
7804 target = gen_reg_rtx (mode);
7805 expand_fix (target, op0, unsignedp);
7809 op0 = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
7810 if (target == 0 || modifier == EXPAND_STACK_PARM)
7811 target = gen_reg_rtx (mode);
7812 /* expand_float can't figure out what to do if FROM has VOIDmode.
7813 So give it the correct mode. With -O, cse will optimize this. */
7814 if (GET_MODE (op0) == VOIDmode)
7815 op0 = copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0))),
7817 expand_float (target, op0,
7818 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp, 0))));
7822 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7823 if (modifier == EXPAND_STACK_PARM)
7825 temp = expand_unop (mode,
7826 optab_for_tree_code (NEGATE_EXPR, type),
7829 return REDUCE_BIT_FIELD (temp);
7832 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7833 if (modifier == EXPAND_STACK_PARM)
7836 /* ABS_EXPR is not valid for complex arguments. */
7837 gcc_assert (GET_MODE_CLASS (mode) != MODE_COMPLEX_INT
7838 && GET_MODE_CLASS (mode) != MODE_COMPLEX_FLOAT);
7840 /* Unsigned abs is simply the operand. Testing here means we don't
7841 risk generating incorrect code below. */
7842 if (TYPE_UNSIGNED (type))
7845 return expand_abs (mode, op0, target, unsignedp,
7846 safe_from_p (target, TREE_OPERAND (exp, 0), 1));
7850 target = original_target;
7852 || modifier == EXPAND_STACK_PARM
7853 || (MEM_P (target) && MEM_VOLATILE_P (target))
7854 || GET_MODE (target) != mode
7856 && REGNO (target) < FIRST_PSEUDO_REGISTER))
7857 target = gen_reg_rtx (mode);
7858 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
7859 target, &op0, &op1, 0);
7861 /* First try to do it with a special MIN or MAX instruction.
7862 If that does not win, use a conditional jump to select the proper
7864 this_optab = optab_for_tree_code (code, type);
7865 temp = expand_binop (mode, this_optab, op0, op1, target, unsignedp,
7870 /* At this point, a MEM target is no longer useful; we will get better
7873 if (! REG_P (target))
7874 target = gen_reg_rtx (mode);
7876 /* If op1 was placed in target, swap op0 and op1. */
7877 if (target != op0 && target == op1)
7884 /* We generate better code and avoid problems with op1 mentioning
7885 target by forcing op1 into a pseudo if it isn't a constant. */
7886 if (! CONSTANT_P (op1))
7887 op1 = force_reg (mode, op1);
7889 #ifdef HAVE_conditional_move
7890 /* Use a conditional move if possible. */
7891 if (can_conditionally_move_p (mode))
7893 enum rtx_code comparison_code;
7896 if (code == MAX_EXPR)
7897 comparison_code = unsignedp ? GEU : GE;
7899 comparison_code = unsignedp ? LEU : LE;
7901 /* ??? Same problem as in expmed.c: emit_conditional_move
7902 forces a stack adjustment via compare_from_rtx, and we
7903 lose the stack adjustment if the sequence we are about
7904 to create is discarded. */
7905 do_pending_stack_adjust ();
7909 /* Try to emit the conditional move. */
7910 insn = emit_conditional_move (target, comparison_code,
7915 /* If we could do the conditional move, emit the sequence,
7919 rtx seq = get_insns ();
7925 /* Otherwise discard the sequence and fall back to code with
7931 emit_move_insn (target, op0);
7933 temp = gen_label_rtx ();
7935 /* If this mode is an integer too wide to compare properly,
7936 compare word by word. Rely on cse to optimize constant cases. */
7937 if (GET_MODE_CLASS (mode) == MODE_INT
7938 && ! can_compare_p (GE, mode, ccp_jump))
7940 if (code == MAX_EXPR)
7941 do_jump_by_parts_greater_rtx (mode, unsignedp, target, op1,
7944 do_jump_by_parts_greater_rtx (mode, unsignedp, op1, target,
7949 do_compare_rtx_and_jump (target, op1, code == MAX_EXPR ? GE : LE,
7950 unsignedp, mode, NULL_RTX, NULL_RTX, temp);
7952 emit_move_insn (target, op1);
7957 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
7958 if (modifier == EXPAND_STACK_PARM)
7960 temp = expand_unop (mode, one_cmpl_optab, op0, target, 1);
7964 /* ??? Can optimize bitwise operations with one arg constant.
7965 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
7966 and (a bitwise1 b) bitwise2 b (etc)
7967 but that is probably not worth while. */
7969 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
7970 boolean values when we want in all cases to compute both of them. In
7971 general it is fastest to do TRUTH_AND_EXPR by computing both operands
7972 as actual zero-or-1 values and then bitwise anding. In cases where
7973 there cannot be any side effects, better code would be made by
7974 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
7975 how to recognize those cases. */
7977 case TRUTH_AND_EXPR:
7978 code = BIT_AND_EXPR;
7983 code = BIT_IOR_EXPR;
7987 case TRUTH_XOR_EXPR:
7988 code = BIT_XOR_EXPR;
7996 if (! safe_from_p (subtarget, TREE_OPERAND (exp, 1), 1))
7998 if (modifier == EXPAND_STACK_PARM)
8000 op0 = expand_expr (TREE_OPERAND (exp, 0), subtarget, VOIDmode, 0);
8001 return expand_shift (code, mode, op0, TREE_OPERAND (exp, 1), target,
8004 /* Could determine the answer when only additive constants differ. Also,
8005 the addition of one can be handled by changing the condition. */
8012 case UNORDERED_EXPR:
8020 temp = do_store_flag (exp,
8021 modifier != EXPAND_STACK_PARM ? target : NULL_RTX,
8022 tmode != VOIDmode ? tmode : mode, 0);
8026 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
8027 if (code == NE_EXPR && integer_zerop (TREE_OPERAND (exp, 1))
8029 && REG_P (original_target)
8030 && (GET_MODE (original_target)
8031 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp, 0)))))
8033 temp = expand_expr (TREE_OPERAND (exp, 0), original_target,
8036 /* If temp is constant, we can just compute the result. */
8037 if (GET_CODE (temp) == CONST_INT)
8039 if (INTVAL (temp) != 0)
8040 emit_move_insn (target, const1_rtx);
8042 emit_move_insn (target, const0_rtx);
8047 if (temp != original_target)
8049 enum machine_mode mode1 = GET_MODE (temp);
8050 if (mode1 == VOIDmode)
8051 mode1 = tmode != VOIDmode ? tmode : mode;
8053 temp = copy_to_mode_reg (mode1, temp);
8056 op1 = gen_label_rtx ();
8057 emit_cmp_and_jump_insns (temp, const0_rtx, EQ, NULL_RTX,
8058 GET_MODE (temp), unsignedp, op1);
8059 emit_move_insn (temp, const1_rtx);
8064 /* If no set-flag instruction, must generate a conditional store
8065 into a temporary variable. Drop through and handle this
8070 || modifier == EXPAND_STACK_PARM
8071 || ! safe_from_p (target, exp, 1)
8072 /* Make sure we don't have a hard reg (such as function's return
8073 value) live across basic blocks, if not optimizing. */
8074 || (!optimize && REG_P (target)
8075 && REGNO (target) < FIRST_PSEUDO_REGISTER)))
8076 target = gen_reg_rtx (tmode != VOIDmode ? tmode : mode);
8079 emit_move_insn (target, const0_rtx);
8081 op1 = gen_label_rtx ();
8082 jumpifnot (exp, op1);
8085 emit_move_insn (target, const1_rtx);
8088 return ignore ? const0_rtx : target;
8090 case TRUTH_NOT_EXPR:
8091 if (modifier == EXPAND_STACK_PARM)
8093 op0 = expand_expr (TREE_OPERAND (exp, 0), target, VOIDmode, 0);
8094 /* The parser is careful to generate TRUTH_NOT_EXPR
8095 only with operands that are always zero or one. */
8096 temp = expand_binop (mode, xor_optab, op0, const1_rtx,
8097 target, 1, OPTAB_LIB_WIDEN);
8101 case STATEMENT_LIST:
8103 tree_stmt_iterator iter;
8105 gcc_assert (ignore);
8107 for (iter = tsi_start (exp); !tsi_end_p (iter); tsi_next (&iter))
8108 expand_expr (tsi_stmt (iter), const0_rtx, VOIDmode, modifier);
8113 /* A COND_EXPR with its type being VOID_TYPE represents a
8114 conditional jump and is handled in
8115 expand_gimple_cond_expr. */
8116 gcc_assert (!VOID_TYPE_P (TREE_TYPE (exp)));
8118 /* Note that COND_EXPRs whose type is a structure or union
8119 are required to be constructed to contain assignments of
8120 a temporary variable, so that we can evaluate them here
8121 for side effect only. If type is void, we must do likewise. */
8123 gcc_assert (!TREE_ADDRESSABLE (type)
8125 && TREE_TYPE (TREE_OPERAND (exp, 1)) != void_type_node
8126 && TREE_TYPE (TREE_OPERAND (exp, 2)) != void_type_node);
8128 /* If we are not to produce a result, we have no target. Otherwise,
8129 if a target was specified use it; it will not be used as an
8130 intermediate target unless it is safe. If no target, use a
8133 if (modifier != EXPAND_STACK_PARM
8135 && safe_from_p (original_target, TREE_OPERAND (exp, 0), 1)
8136 && GET_MODE (original_target) == mode
8137 #ifdef HAVE_conditional_move
8138 && (! can_conditionally_move_p (mode)
8139 || REG_P (original_target))
8141 && !MEM_P (original_target))
8142 temp = original_target;
8144 temp = assign_temp (type, 0, 0, 1);
8146 do_pending_stack_adjust ();
8148 op0 = gen_label_rtx ();
8149 op1 = gen_label_rtx ();
8150 jumpifnot (TREE_OPERAND (exp, 0), op0);
8151 store_expr (TREE_OPERAND (exp, 1), temp,
8152 modifier == EXPAND_STACK_PARM);
8154 emit_jump_insn (gen_jump (op1));
8157 store_expr (TREE_OPERAND (exp, 2), temp,
8158 modifier == EXPAND_STACK_PARM);
8165 target = expand_vec_cond_expr (exp, target);
8170 tree lhs = TREE_OPERAND (exp, 0);
8171 tree rhs = TREE_OPERAND (exp, 1);
8173 gcc_assert (ignore);
8175 /* Check for |= or &= of a bitfield of size one into another bitfield
8176 of size 1. In this case, (unless we need the result of the
8177 assignment) we can do this more efficiently with a
8178 test followed by an assignment, if necessary.
8180 ??? At this point, we can't get a BIT_FIELD_REF here. But if
8181 things change so we do, this code should be enhanced to
8183 if (TREE_CODE (lhs) == COMPONENT_REF
8184 && (TREE_CODE (rhs) == BIT_IOR_EXPR
8185 || TREE_CODE (rhs) == BIT_AND_EXPR)
8186 && TREE_OPERAND (rhs, 0) == lhs
8187 && TREE_CODE (TREE_OPERAND (rhs, 1)) == COMPONENT_REF
8188 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs, 1)))
8189 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs, 1), 1))))
8191 rtx label = gen_label_rtx ();
8193 do_jump (TREE_OPERAND (rhs, 1),
8194 TREE_CODE (rhs) == BIT_IOR_EXPR ? label : 0,
8195 TREE_CODE (rhs) == BIT_AND_EXPR ? label : 0);
8196 expand_assignment (lhs, convert (TREE_TYPE (rhs),
8197 (TREE_CODE (rhs) == BIT_IOR_EXPR
8199 : integer_zero_node)));
8200 do_pending_stack_adjust ();
8205 expand_assignment (lhs, rhs);
8211 if (!TREE_OPERAND (exp, 0))
8212 expand_null_return ();
8214 expand_return (TREE_OPERAND (exp, 0));
8218 return expand_expr_addr_expr (exp, target, tmode, modifier);
8221 /* Get the rtx code of the operands. */
8222 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8223 op1 = expand_expr (TREE_OPERAND (exp, 1), 0, VOIDmode, 0);
8226 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
8228 /* Move the real (op0) and imaginary (op1) parts to their location. */
8229 write_complex_part (target, op0, false);
8230 write_complex_part (target, op1, true);
8235 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8236 return read_complex_part (op0, false);
8239 op0 = expand_expr (TREE_OPERAND (exp, 0), 0, VOIDmode, 0);
8240 return read_complex_part (op0, true);
8243 expand_resx_expr (exp);
8246 case TRY_CATCH_EXPR:
8248 case EH_FILTER_EXPR:
8249 case TRY_FINALLY_EXPR:
8250 /* Lowered by tree-eh.c. */
8253 case WITH_CLEANUP_EXPR:
8254 case CLEANUP_POINT_EXPR:
8256 case CASE_LABEL_EXPR:
8262 case PREINCREMENT_EXPR:
8263 case PREDECREMENT_EXPR:
8264 case POSTINCREMENT_EXPR:
8265 case POSTDECREMENT_EXPR:
8268 case TRUTH_ANDIF_EXPR:
8269 case TRUTH_ORIF_EXPR:
8270 /* Lowered by gimplify.c. */
8274 return get_exception_pointer (cfun);
8277 return get_exception_filter (cfun);
8280 /* Function descriptors are not valid except for as
8281 initialization constants, and should not be expanded. */
8289 expand_label (TREE_OPERAND (exp, 0));
8293 expand_asm_expr (exp);
8296 case WITH_SIZE_EXPR:
8297 /* WITH_SIZE_EXPR expands to its first argument. The caller should
8298 have pulled out the size to use in whatever context it needed. */
8299 return expand_expr_real (TREE_OPERAND (exp, 0), original_target, tmode,
8302 case REALIGN_LOAD_EXPR:
8304 tree oprnd0 = TREE_OPERAND (exp, 0);
8305 tree oprnd1 = TREE_OPERAND (exp, 1);
8306 tree oprnd2 = TREE_OPERAND (exp, 2);
8309 this_optab = optab_for_tree_code (code, type);
8310 expand_operands (oprnd0, oprnd1, NULL_RTX, &op0, &op1, 0);
8311 op2 = expand_expr (oprnd2, NULL_RTX, VOIDmode, 0);
8312 temp = expand_ternary_op (mode, this_optab, op0, op1, op2,
8321 return lang_hooks.expand_expr (exp, original_target, tmode,
8325 /* Here to do an ordinary binary operator. */
8327 expand_operands (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
8328 subtarget, &op0, &op1, 0);
8330 this_optab = optab_for_tree_code (code, type);
8332 if (modifier == EXPAND_STACK_PARM)
8334 temp = expand_binop (mode, this_optab, op0, op1, target,
8335 unsignedp, OPTAB_LIB_WIDEN);
8337 return REDUCE_BIT_FIELD (temp);
8339 #undef REDUCE_BIT_FIELD
8341 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
8342 signedness of TYPE), possibly returning the result in TARGET. */
8344 reduce_to_bit_field_precision (rtx exp, rtx target, tree type)
8346 HOST_WIDE_INT prec = TYPE_PRECISION (type);
8347 if (target && GET_MODE (target) != GET_MODE (exp))
8349 if (TYPE_UNSIGNED (type))
8352 if (prec < HOST_BITS_PER_WIDE_INT)
8353 mask = immed_double_const (((unsigned HOST_WIDE_INT) 1 << prec) - 1, 0,
8356 mask = immed_double_const ((unsigned HOST_WIDE_INT) -1,
8357 ((unsigned HOST_WIDE_INT) 1
8358 << (prec - HOST_BITS_PER_WIDE_INT)) - 1,
8360 return expand_and (GET_MODE (exp), exp, mask, target);
8364 tree count = build_int_cst (NULL_TREE,
8365 GET_MODE_BITSIZE (GET_MODE (exp)) - prec);
8366 exp = expand_shift (LSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
8367 return expand_shift (RSHIFT_EXPR, GET_MODE (exp), exp, count, target, 0);
8371 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
8372 when applied to the address of EXP produces an address known to be
8373 aligned more than BIGGEST_ALIGNMENT. */
8376 is_aligning_offset (tree offset, tree exp)
8378 /* Strip off any conversions. */
8379 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8380 || TREE_CODE (offset) == NOP_EXPR
8381 || TREE_CODE (offset) == CONVERT_EXPR)
8382 offset = TREE_OPERAND (offset, 0);
8384 /* We must now have a BIT_AND_EXPR with a constant that is one less than
8385 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
8386 if (TREE_CODE (offset) != BIT_AND_EXPR
8387 || !host_integerp (TREE_OPERAND (offset, 1), 1)
8388 || compare_tree_int (TREE_OPERAND (offset, 1),
8389 BIGGEST_ALIGNMENT / BITS_PER_UNIT) <= 0
8390 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset, 1), 1) + 1) < 0)
8393 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
8394 It must be NEGATE_EXPR. Then strip any more conversions. */
8395 offset = TREE_OPERAND (offset, 0);
8396 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8397 || TREE_CODE (offset) == NOP_EXPR
8398 || TREE_CODE (offset) == CONVERT_EXPR)
8399 offset = TREE_OPERAND (offset, 0);
8401 if (TREE_CODE (offset) != NEGATE_EXPR)
8404 offset = TREE_OPERAND (offset, 0);
8405 while (TREE_CODE (offset) == NON_LVALUE_EXPR
8406 || TREE_CODE (offset) == NOP_EXPR
8407 || TREE_CODE (offset) == CONVERT_EXPR)
8408 offset = TREE_OPERAND (offset, 0);
8410 /* This must now be the address of EXP. */
8411 return TREE_CODE (offset) == ADDR_EXPR && TREE_OPERAND (offset, 0) == exp;
8414 /* Return the tree node if an ARG corresponds to a string constant or zero
8415 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
8416 in bytes within the string that ARG is accessing. The type of the
8417 offset will be `sizetype'. */
8420 string_constant (tree arg, tree *ptr_offset)
8425 if (TREE_CODE (arg) == ADDR_EXPR)
8427 if (TREE_CODE (TREE_OPERAND (arg, 0)) == STRING_CST)
8429 *ptr_offset = size_zero_node;
8430 return TREE_OPERAND (arg, 0);
8432 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL)
8434 array = TREE_OPERAND (arg, 0);
8435 offset = size_zero_node;
8437 else if (TREE_CODE (TREE_OPERAND (arg, 0)) == ARRAY_REF)
8439 array = TREE_OPERAND (TREE_OPERAND (arg, 0), 0);
8440 offset = TREE_OPERAND (TREE_OPERAND (arg, 0), 1);
8441 if (TREE_CODE (array) != STRING_CST
8442 && TREE_CODE (array) != VAR_DECL)
8448 else if (TREE_CODE (arg) == PLUS_EXPR)
8450 tree arg0 = TREE_OPERAND (arg, 0);
8451 tree arg1 = TREE_OPERAND (arg, 1);
8456 if (TREE_CODE (arg0) == ADDR_EXPR
8457 && (TREE_CODE (TREE_OPERAND (arg0, 0)) == STRING_CST
8458 || TREE_CODE (TREE_OPERAND (arg0, 0)) == VAR_DECL))
8460 array = TREE_OPERAND (arg0, 0);
8463 else if (TREE_CODE (arg1) == ADDR_EXPR
8464 && (TREE_CODE (TREE_OPERAND (arg1, 0)) == STRING_CST
8465 || TREE_CODE (TREE_OPERAND (arg1, 0)) == VAR_DECL))
8467 array = TREE_OPERAND (arg1, 0);
8476 if (TREE_CODE (array) == STRING_CST)
8478 *ptr_offset = convert (sizetype, offset);
8481 else if (TREE_CODE (array) == VAR_DECL)
8485 /* Variables initialized to string literals can be handled too. */
8486 if (DECL_INITIAL (array) == NULL_TREE
8487 || TREE_CODE (DECL_INITIAL (array)) != STRING_CST)
8490 /* If they are read-only, non-volatile and bind locally. */
8491 if (! TREE_READONLY (array)
8492 || TREE_SIDE_EFFECTS (array)
8493 || ! targetm.binds_local_p (array))
8496 /* Avoid const char foo[4] = "abcde"; */
8497 if (DECL_SIZE_UNIT (array) == NULL_TREE
8498 || TREE_CODE (DECL_SIZE_UNIT (array)) != INTEGER_CST
8499 || (length = TREE_STRING_LENGTH (DECL_INITIAL (array))) <= 0
8500 || compare_tree_int (DECL_SIZE_UNIT (array), length) < 0)
8503 /* If variable is bigger than the string literal, OFFSET must be constant
8504 and inside of the bounds of the string literal. */
8505 offset = convert (sizetype, offset);
8506 if (compare_tree_int (DECL_SIZE_UNIT (array), length) > 0
8507 && (! host_integerp (offset, 1)
8508 || compare_tree_int (offset, length) >= 0))
8511 *ptr_offset = offset;
8512 return DECL_INITIAL (array);
8518 /* Generate code to calculate EXP using a store-flag instruction
8519 and return an rtx for the result. EXP is either a comparison
8520 or a TRUTH_NOT_EXPR whose operand is a comparison.
8522 If TARGET is nonzero, store the result there if convenient.
8524 If ONLY_CHEAP is nonzero, only do this if it is likely to be very
8527 Return zero if there is no suitable set-flag instruction
8528 available on this machine.
8530 Once expand_expr has been called on the arguments of the comparison,
8531 we are committed to doing the store flag, since it is not safe to
8532 re-evaluate the expression. We emit the store-flag insn by calling
8533 emit_store_flag, but only expand the arguments if we have a reason
8534 to believe that emit_store_flag will be successful. If we think that
8535 it will, but it isn't, we have to simulate the store-flag with a
8536 set/jump/set sequence. */
8539 do_store_flag (tree exp, rtx target, enum machine_mode mode, int only_cheap)
8542 tree arg0, arg1, type;
8544 enum machine_mode operand_mode;
8548 enum insn_code icode;
8549 rtx subtarget = target;
8552 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
8553 result at the end. We can't simply invert the test since it would
8554 have already been inverted if it were valid. This case occurs for
8555 some floating-point comparisons. */
8557 if (TREE_CODE (exp) == TRUTH_NOT_EXPR)
8558 invert = 1, exp = TREE_OPERAND (exp, 0);
8560 arg0 = TREE_OPERAND (exp, 0);
8561 arg1 = TREE_OPERAND (exp, 1);
8563 /* Don't crash if the comparison was erroneous. */
8564 if (arg0 == error_mark_node || arg1 == error_mark_node)
8567 type = TREE_TYPE (arg0);
8568 operand_mode = TYPE_MODE (type);
8569 unsignedp = TYPE_UNSIGNED (type);
8571 /* We won't bother with BLKmode store-flag operations because it would mean
8572 passing a lot of information to emit_store_flag. */
8573 if (operand_mode == BLKmode)
8576 /* We won't bother with store-flag operations involving function pointers
8577 when function pointers must be canonicalized before comparisons. */
8578 #ifdef HAVE_canonicalize_funcptr_for_compare
8579 if (HAVE_canonicalize_funcptr_for_compare
8580 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 0))) == POINTER_TYPE
8581 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 0))))
8583 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp, 1))) == POINTER_TYPE
8584 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp, 1))))
8585 == FUNCTION_TYPE))))
8592 /* Get the rtx comparison code to use. We know that EXP is a comparison
8593 operation of some type. Some comparisons against 1 and -1 can be
8594 converted to comparisons with zero. Do so here so that the tests
8595 below will be aware that we have a comparison with zero. These
8596 tests will not catch constants in the first operand, but constants
8597 are rarely passed as the first operand. */
8599 switch (TREE_CODE (exp))
8608 if (integer_onep (arg1))
8609 arg1 = integer_zero_node, code = unsignedp ? LEU : LE;
8611 code = unsignedp ? LTU : LT;
8614 if (! unsignedp && integer_all_onesp (arg1))
8615 arg1 = integer_zero_node, code = LT;
8617 code = unsignedp ? LEU : LE;
8620 if (! unsignedp && integer_all_onesp (arg1))
8621 arg1 = integer_zero_node, code = GE;
8623 code = unsignedp ? GTU : GT;
8626 if (integer_onep (arg1))
8627 arg1 = integer_zero_node, code = unsignedp ? GTU : GT;
8629 code = unsignedp ? GEU : GE;
8632 case UNORDERED_EXPR:
8661 /* Put a constant second. */
8662 if (TREE_CODE (arg0) == REAL_CST || TREE_CODE (arg0) == INTEGER_CST)
8664 tem = arg0; arg0 = arg1; arg1 = tem;
8665 code = swap_condition (code);
8668 /* If this is an equality or inequality test of a single bit, we can
8669 do this by shifting the bit being tested to the low-order bit and
8670 masking the result with the constant 1. If the condition was EQ,
8671 we xor it with 1. This does not require an scc insn and is faster
8672 than an scc insn even if we have it.
8674 The code to make this transformation was moved into fold_single_bit_test,
8675 so we just call into the folder and expand its result. */
8677 if ((code == NE || code == EQ)
8678 && TREE_CODE (arg0) == BIT_AND_EXPR && integer_zerop (arg1)
8679 && integer_pow2p (TREE_OPERAND (arg0, 1)))
8681 tree type = lang_hooks.types.type_for_mode (mode, unsignedp);
8682 return expand_expr (fold_single_bit_test (code == NE ? NE_EXPR : EQ_EXPR,
8684 target, VOIDmode, EXPAND_NORMAL);
8687 /* Now see if we are likely to be able to do this. Return if not. */
8688 if (! can_compare_p (code, operand_mode, ccp_store_flag))
8691 icode = setcc_gen_code[(int) code];
8692 if (icode == CODE_FOR_nothing
8693 || (only_cheap && insn_data[(int) icode].operand[0].mode != mode))
8695 /* We can only do this if it is one of the special cases that
8696 can be handled without an scc insn. */
8697 if ((code == LT && integer_zerop (arg1))
8698 || (! only_cheap && code == GE && integer_zerop (arg1)))
8700 else if (BRANCH_COST >= 0
8701 && ! only_cheap && (code == NE || code == EQ)
8702 && TREE_CODE (type) != REAL_TYPE
8703 && ((abs_optab->handlers[(int) operand_mode].insn_code
8704 != CODE_FOR_nothing)
8705 || (ffs_optab->handlers[(int) operand_mode].insn_code
8706 != CODE_FOR_nothing)))
8712 if (! get_subtarget (target)
8713 || GET_MODE (subtarget) != operand_mode)
8716 expand_operands (arg0, arg1, subtarget, &op0, &op1, 0);
8719 target = gen_reg_rtx (mode);
8721 result = emit_store_flag (target, code, op0, op1,
8722 operand_mode, unsignedp, 1);
8727 result = expand_binop (mode, xor_optab, result, const1_rtx,
8728 result, 0, OPTAB_LIB_WIDEN);
8732 /* If this failed, we have to do this with set/compare/jump/set code. */
8734 || reg_mentioned_p (target, op0) || reg_mentioned_p (target, op1))
8735 target = gen_reg_rtx (GET_MODE (target));
8737 emit_move_insn (target, invert ? const0_rtx : const1_rtx);
8738 result = compare_from_rtx (op0, op1, code, unsignedp,
8739 operand_mode, NULL_RTX);
8740 if (GET_CODE (result) == CONST_INT)
8741 return (((result == const0_rtx && ! invert)
8742 || (result != const0_rtx && invert))
8743 ? const0_rtx : const1_rtx);
8745 /* The code of RESULT may not match CODE if compare_from_rtx
8746 decided to swap its operands and reverse the original code.
8748 We know that compare_from_rtx returns either a CONST_INT or
8749 a new comparison code, so it is safe to just extract the
8750 code from RESULT. */
8751 code = GET_CODE (result);
8753 label = gen_label_rtx ();
8754 gcc_assert (bcc_gen_fctn[(int) code]);
8756 emit_jump_insn ((*bcc_gen_fctn[(int) code]) (label));
8757 emit_move_insn (target, invert ? const1_rtx : const0_rtx);
8764 /* Stubs in case we haven't got a casesi insn. */
8766 # define HAVE_casesi 0
8767 # define gen_casesi(a, b, c, d, e) (0)
8768 # define CODE_FOR_casesi CODE_FOR_nothing
8771 /* If the machine does not have a case insn that compares the bounds,
8772 this means extra overhead for dispatch tables, which raises the
8773 threshold for using them. */
8774 #ifndef CASE_VALUES_THRESHOLD
8775 #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5)
8776 #endif /* CASE_VALUES_THRESHOLD */
8779 case_values_threshold (void)
8781 return CASE_VALUES_THRESHOLD;
8784 /* Attempt to generate a casesi instruction. Returns 1 if successful,
8785 0 otherwise (i.e. if there is no casesi instruction). */
8787 try_casesi (tree index_type, tree index_expr, tree minval, tree range,
8788 rtx table_label ATTRIBUTE_UNUSED, rtx default_label)
8790 enum machine_mode index_mode = SImode;
8791 int index_bits = GET_MODE_BITSIZE (index_mode);
8792 rtx op1, op2, index;
8793 enum machine_mode op_mode;
8798 /* Convert the index to SImode. */
8799 if (GET_MODE_BITSIZE (TYPE_MODE (index_type)) > GET_MODE_BITSIZE (index_mode))
8801 enum machine_mode omode = TYPE_MODE (index_type);
8802 rtx rangertx = expand_expr (range, NULL_RTX, VOIDmode, 0);
8804 /* We must handle the endpoints in the original mode. */
8805 index_expr = build2 (MINUS_EXPR, index_type,
8806 index_expr, minval);
8807 minval = integer_zero_node;
8808 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
8809 emit_cmp_and_jump_insns (rangertx, index, LTU, NULL_RTX,
8810 omode, 1, default_label);
8811 /* Now we can safely truncate. */
8812 index = convert_to_mode (index_mode, index, 0);
8816 if (TYPE_MODE (index_type) != index_mode)
8818 index_expr = convert (lang_hooks.types.type_for_size
8819 (index_bits, 0), index_expr);
8820 index_type = TREE_TYPE (index_expr);
8823 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
8826 do_pending_stack_adjust ();
8828 op_mode = insn_data[(int) CODE_FOR_casesi].operand[0].mode;
8829 if (! (*insn_data[(int) CODE_FOR_casesi].operand[0].predicate)
8831 index = copy_to_mode_reg (op_mode, index);
8833 op1 = expand_expr (minval, NULL_RTX, VOIDmode, 0);
8835 op_mode = insn_data[(int) CODE_FOR_casesi].operand[1].mode;
8836 op1 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (minval)),
8837 op1, TYPE_UNSIGNED (TREE_TYPE (minval)));
8838 if (! (*insn_data[(int) CODE_FOR_casesi].operand[1].predicate)
8840 op1 = copy_to_mode_reg (op_mode, op1);
8842 op2 = expand_expr (range, NULL_RTX, VOIDmode, 0);
8844 op_mode = insn_data[(int) CODE_FOR_casesi].operand[2].mode;
8845 op2 = convert_modes (op_mode, TYPE_MODE (TREE_TYPE (range)),
8846 op2, TYPE_UNSIGNED (TREE_TYPE (range)));
8847 if (! (*insn_data[(int) CODE_FOR_casesi].operand[2].predicate)
8849 op2 = copy_to_mode_reg (op_mode, op2);
8851 emit_jump_insn (gen_casesi (index, op1, op2,
8852 table_label, default_label));
8856 /* Attempt to generate a tablejump instruction; same concept. */
8857 #ifndef HAVE_tablejump
8858 #define HAVE_tablejump 0
8859 #define gen_tablejump(x, y) (0)
8862 /* Subroutine of the next function.
8864 INDEX is the value being switched on, with the lowest value
8865 in the table already subtracted.
8866 MODE is its expected mode (needed if INDEX is constant).
8867 RANGE is the length of the jump table.
8868 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
8870 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
8871 index value is out of range. */
8874 do_tablejump (rtx index, enum machine_mode mode, rtx range, rtx table_label,
8879 if (INTVAL (range) > cfun->max_jumptable_ents)
8880 cfun->max_jumptable_ents = INTVAL (range);
8882 /* Do an unsigned comparison (in the proper mode) between the index
8883 expression and the value which represents the length of the range.
8884 Since we just finished subtracting the lower bound of the range
8885 from the index expression, this comparison allows us to simultaneously
8886 check that the original index expression value is both greater than
8887 or equal to the minimum value of the range and less than or equal to
8888 the maximum value of the range. */
8890 emit_cmp_and_jump_insns (index, range, GTU, NULL_RTX, mode, 1,
8893 /* If index is in range, it must fit in Pmode.
8894 Convert to Pmode so we can index with it. */
8896 index = convert_to_mode (Pmode, index, 1);
8898 /* Don't let a MEM slip through, because then INDEX that comes
8899 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
8900 and break_out_memory_refs will go to work on it and mess it up. */
8901 #ifdef PIC_CASE_VECTOR_ADDRESS
8902 if (flag_pic && !REG_P (index))
8903 index = copy_to_mode_reg (Pmode, index);
8906 /* If flag_force_addr were to affect this address
8907 it could interfere with the tricky assumptions made
8908 about addresses that contain label-refs,
8909 which may be valid only very near the tablejump itself. */
8910 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
8911 GET_MODE_SIZE, because this indicates how large insns are. The other
8912 uses should all be Pmode, because they are addresses. This code
8913 could fail if addresses and insns are not the same size. */
8914 index = gen_rtx_PLUS (Pmode,
8915 gen_rtx_MULT (Pmode, index,
8916 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE))),
8917 gen_rtx_LABEL_REF (Pmode, table_label));
8918 #ifdef PIC_CASE_VECTOR_ADDRESS
8920 index = PIC_CASE_VECTOR_ADDRESS (index);
8923 index = memory_address_noforce (CASE_VECTOR_MODE, index);
8924 temp = gen_reg_rtx (CASE_VECTOR_MODE);
8925 vector = gen_const_mem (CASE_VECTOR_MODE, index);
8926 convert_move (temp, vector, 0);
8928 emit_jump_insn (gen_tablejump (temp, table_label));
8930 /* If we are generating PIC code or if the table is PC-relative, the
8931 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
8932 if (! CASE_VECTOR_PC_RELATIVE && ! flag_pic)
8937 try_tablejump (tree index_type, tree index_expr, tree minval, tree range,
8938 rtx table_label, rtx default_label)
8942 if (! HAVE_tablejump)
8945 index_expr = fold (build2 (MINUS_EXPR, index_type,
8946 convert (index_type, index_expr),
8947 convert (index_type, minval)));
8948 index = expand_expr (index_expr, NULL_RTX, VOIDmode, 0);
8949 do_pending_stack_adjust ();
8951 do_tablejump (index, TYPE_MODE (index_type),
8952 convert_modes (TYPE_MODE (index_type),
8953 TYPE_MODE (TREE_TYPE (range)),
8954 expand_expr (range, NULL_RTX,
8956 TYPE_UNSIGNED (TREE_TYPE (range))),
8957 table_label, default_label);
8961 /* Nonzero if the mode is a valid vector mode for this architecture.
8962 This returns nonzero even if there is no hardware support for the
8963 vector mode, but we can emulate with narrower modes. */
8966 vector_mode_valid_p (enum machine_mode mode)
8968 enum mode_class class = GET_MODE_CLASS (mode);
8969 enum machine_mode innermode;
8971 /* Doh! What's going on? */
8972 if (class != MODE_VECTOR_INT
8973 && class != MODE_VECTOR_FLOAT)
8976 /* Hardware support. Woo hoo! */
8977 if (targetm.vector_mode_supported_p (mode))
8980 innermode = GET_MODE_INNER (mode);
8982 /* We should probably return 1 if requesting V4DI and we have no DI,
8983 but we have V2DI, but this is probably very unlikely. */
8985 /* If we have support for the inner mode, we can safely emulate it.
8986 We may not have V2DI, but me can emulate with a pair of DIs. */
8987 return targetm.scalar_mode_supported_p (innermode);
8990 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
8992 const_vector_from_tree (tree exp)
8997 enum machine_mode inner, mode;
8999 mode = TYPE_MODE (TREE_TYPE (exp));
9001 if (initializer_zerop (exp))
9002 return CONST0_RTX (mode);
9004 units = GET_MODE_NUNITS (mode);
9005 inner = GET_MODE_INNER (mode);
9007 v = rtvec_alloc (units);
9009 link = TREE_VECTOR_CST_ELTS (exp);
9010 for (i = 0; link; link = TREE_CHAIN (link), ++i)
9012 elt = TREE_VALUE (link);
9014 if (TREE_CODE (elt) == REAL_CST)
9015 RTVEC_ELT (v, i) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt),
9018 RTVEC_ELT (v, i) = immed_double_const (TREE_INT_CST_LOW (elt),
9019 TREE_INT_CST_HIGH (elt),
9023 /* Initialize remaining elements to 0. */
9024 for (; i < units; ++i)
9025 RTVEC_ELT (v, i) = CONST0_RTX (inner);
9027 return gen_rtx_CONST_VECTOR (mode, v);
9029 #include "gt-expr.h"