1 /* Convert tree expression to rtl instructions, for GNU compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011,
4 2012 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
31 #include "hard-reg-set.h"
34 #include "insn-config.h"
35 #include "insn-attr.h"
36 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
43 #include "typeclass.h"
45 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "tree-pass.h"
50 #include "tree-flow.h"
52 #include "common/common-target.h"
55 #include "diagnostic.h"
56 #include "ssaexpand.h"
57 #include "target-globals.h"
60 /* Decide whether a function's arguments should be processed
61 from first to last or from last to first.
63 They should if the stack and args grow in opposite directions, but
64 only if we have push insns. */
68 #ifndef PUSH_ARGS_REVERSED
69 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
70 #define PUSH_ARGS_REVERSED /* If it's last to first. */
76 #ifndef STACK_PUSH_CODE
77 #ifdef STACK_GROWS_DOWNWARD
78 #define STACK_PUSH_CODE PRE_DEC
80 #define STACK_PUSH_CODE PRE_INC
85 /* If this is nonzero, we do not bother generating VOLATILE
86 around volatile memory references, and we are willing to
87 output indirect addresses. If cse is to follow, we reject
88 indirect addresses so a useful potential cse is generated;
89 if it is used only once, instruction combination will produce
90 the same indirect address eventually. */
93 /* This structure is used by move_by_pieces to describe the move to
95 struct move_by_pieces_d
104 int explicit_inc_from
;
105 unsigned HOST_WIDE_INT len
;
106 HOST_WIDE_INT offset
;
110 /* This structure is used by store_by_pieces to describe the clear to
113 struct store_by_pieces_d
119 unsigned HOST_WIDE_INT len
;
120 HOST_WIDE_INT offset
;
121 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
);
126 static void move_by_pieces_1 (rtx (*) (rtx
, ...), enum machine_mode
,
127 struct move_by_pieces_d
*);
128 static bool block_move_libcall_safe_for_call_parm (void);
129 static bool emit_block_move_via_movmem (rtx
, rtx
, rtx
, unsigned, unsigned, HOST_WIDE_INT
);
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_d
*, unsigned int);
135 static void store_by_pieces_2 (rtx (*) (rtx
, ...), enum machine_mode
,
136 struct store_by_pieces_d
*);
137 static tree
clear_storage_libcall_fn (int);
138 static rtx
compress_float_constant (rtx
, rtx
);
139 static rtx
get_subtarget (rtx
);
140 static void store_constructor_field (rtx
, unsigned HOST_WIDE_INT
,
141 HOST_WIDE_INT
, enum machine_mode
,
142 tree
, tree
, int, alias_set_type
);
143 static void store_constructor (tree
, rtx
, int, HOST_WIDE_INT
);
144 static rtx
store_field (rtx
, HOST_WIDE_INT
, HOST_WIDE_INT
,
145 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
,
147 tree
, tree
, alias_set_type
, bool);
149 static unsigned HOST_WIDE_INT
highest_pow2_factor_for_target (const_tree
, const_tree
);
151 static int is_aligning_offset (const_tree
, const_tree
);
152 static void expand_operands (tree
, tree
, rtx
, rtx
*, rtx
*,
153 enum expand_modifier
);
154 static rtx
reduce_to_bit_field_precision (rtx
, rtx
, tree
);
155 static rtx
do_store_flag (sepops
, rtx
, enum machine_mode
);
157 static void emit_single_push_insn (enum machine_mode
, rtx
, tree
);
159 static void do_tablejump (rtx
, enum machine_mode
, rtx
, rtx
, rtx
);
160 static rtx
const_vector_from_tree (tree
);
161 static void write_complex_part (rtx
, rtx
, bool);
163 /* This macro is used to determine whether move_by_pieces should be called
164 to perform a structure copy. */
165 #ifndef MOVE_BY_PIECES_P
166 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
167 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
168 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
171 /* This macro is used to determine whether clear_by_pieces should be
172 called to clear storage. */
173 #ifndef CLEAR_BY_PIECES_P
174 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
175 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
176 < (unsigned int) CLEAR_RATIO (optimize_insn_for_speed_p ()))
179 /* This macro is used to determine whether store_by_pieces should be
180 called to "memset" storage with byte values other than zero. */
181 #ifndef SET_BY_PIECES_P
182 #define SET_BY_PIECES_P(SIZE, ALIGN) \
183 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
184 < (unsigned int) SET_RATIO (optimize_insn_for_speed_p ()))
187 /* This macro is used to determine whether store_by_pieces should be
188 called to "memcpy" storage when the source is a constant string. */
189 #ifndef STORE_BY_PIECES_P
190 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
191 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
192 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
195 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
197 #ifndef SLOW_UNALIGNED_ACCESS
198 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
201 /* This is run to set up which modes can be used
202 directly in memory and to initialize the block move optab. It is run
203 at the beginning of compilation and when the target is reinitialized. */
206 init_expr_target (void)
209 enum machine_mode mode
;
214 /* Try indexing by frame ptr and try by stack ptr.
215 It is known that on the Convex the stack ptr isn't a valid index.
216 With luck, one or the other is valid on any machine. */
217 mem
= gen_rtx_MEM (VOIDmode
, stack_pointer_rtx
);
218 mem1
= gen_rtx_MEM (VOIDmode
, frame_pointer_rtx
);
220 /* A scratch register we can modify in-place below to avoid
221 useless RTL allocations. */
222 reg
= gen_rtx_REG (VOIDmode
, -1);
224 insn
= rtx_alloc (INSN
);
225 pat
= gen_rtx_SET (VOIDmode
, NULL_RTX
, NULL_RTX
);
226 PATTERN (insn
) = pat
;
228 for (mode
= VOIDmode
; (int) mode
< NUM_MACHINE_MODES
;
229 mode
= (enum machine_mode
) ((int) mode
+ 1))
233 direct_load
[(int) mode
] = direct_store
[(int) mode
] = 0;
234 PUT_MODE (mem
, mode
);
235 PUT_MODE (mem1
, mode
);
236 PUT_MODE (reg
, mode
);
238 /* See if there is some register that can be used in this mode and
239 directly loaded or stored from memory. */
241 if (mode
!= VOIDmode
&& mode
!= BLKmode
)
242 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
243 && (direct_load
[(int) mode
] == 0 || direct_store
[(int) mode
] == 0);
246 if (! HARD_REGNO_MODE_OK (regno
, mode
))
249 SET_REGNO (reg
, regno
);
252 SET_DEST (pat
) = reg
;
253 if (recog (pat
, insn
, &num_clobbers
) >= 0)
254 direct_load
[(int) mode
] = 1;
256 SET_SRC (pat
) = mem1
;
257 SET_DEST (pat
) = reg
;
258 if (recog (pat
, insn
, &num_clobbers
) >= 0)
259 direct_load
[(int) mode
] = 1;
262 SET_DEST (pat
) = mem
;
263 if (recog (pat
, insn
, &num_clobbers
) >= 0)
264 direct_store
[(int) mode
] = 1;
267 SET_DEST (pat
) = mem1
;
268 if (recog (pat
, insn
, &num_clobbers
) >= 0)
269 direct_store
[(int) mode
] = 1;
273 mem
= gen_rtx_MEM (VOIDmode
, gen_rtx_raw_REG (Pmode
, 10000));
275 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
276 mode
= GET_MODE_WIDER_MODE (mode
))
278 enum machine_mode srcmode
;
279 for (srcmode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); srcmode
!= mode
;
280 srcmode
= GET_MODE_WIDER_MODE (srcmode
))
284 ic
= can_extend_p (mode
, srcmode
, 0);
285 if (ic
== CODE_FOR_nothing
)
288 PUT_MODE (mem
, srcmode
);
290 if (insn_operand_matches (ic
, 1, mem
))
291 float_extend_from_mem
[mode
][srcmode
] = true;
296 /* This is run at the start of compiling a function. */
301 memset (&crtl
->expr
, 0, sizeof (crtl
->expr
));
304 /* Copy data from FROM to TO, where the machine modes are not the same.
305 Both modes may be integer, or both may be floating, or both may be
307 UNSIGNEDP should be nonzero if FROM is an unsigned type.
308 This causes zero-extension instead of sign-extension. */
311 convert_move (rtx to
, rtx from
, int unsignedp
)
313 enum machine_mode to_mode
= GET_MODE (to
);
314 enum machine_mode from_mode
= GET_MODE (from
);
315 int to_real
= SCALAR_FLOAT_MODE_P (to_mode
);
316 int from_real
= SCALAR_FLOAT_MODE_P (from_mode
);
320 /* rtx code for making an equivalent value. */
321 enum rtx_code equiv_code
= (unsignedp
< 0 ? UNKNOWN
322 : (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
));
325 gcc_assert (to_real
== from_real
);
326 gcc_assert (to_mode
!= BLKmode
);
327 gcc_assert (from_mode
!= BLKmode
);
329 /* If the source and destination are already the same, then there's
334 /* If FROM is a SUBREG that indicates that we have already done at least
335 the required extension, strip it. We don't handle such SUBREGs as
338 if (GET_CODE (from
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (from
)
339 && (GET_MODE_PRECISION (GET_MODE (SUBREG_REG (from
)))
340 >= GET_MODE_PRECISION (to_mode
))
341 && SUBREG_PROMOTED_UNSIGNED_P (from
) == unsignedp
)
342 from
= gen_lowpart (to_mode
, from
), from_mode
= to_mode
;
344 gcc_assert (GET_CODE (to
) != SUBREG
|| !SUBREG_PROMOTED_VAR_P (to
));
346 if (to_mode
== from_mode
347 || (from_mode
== VOIDmode
&& CONSTANT_P (from
)))
349 emit_move_insn (to
, from
);
353 if (VECTOR_MODE_P (to_mode
) || VECTOR_MODE_P (from_mode
))
355 gcc_assert (GET_MODE_BITSIZE (from_mode
) == GET_MODE_BITSIZE (to_mode
));
357 if (VECTOR_MODE_P (to_mode
))
358 from
= simplify_gen_subreg (to_mode
, from
, GET_MODE (from
), 0);
360 to
= simplify_gen_subreg (from_mode
, to
, GET_MODE (to
), 0);
362 emit_move_insn (to
, from
);
366 if (GET_CODE (to
) == CONCAT
&& GET_CODE (from
) == CONCAT
)
368 convert_move (XEXP (to
, 0), XEXP (from
, 0), unsignedp
);
369 convert_move (XEXP (to
, 1), XEXP (from
, 1), unsignedp
);
378 gcc_assert ((GET_MODE_PRECISION (from_mode
)
379 != GET_MODE_PRECISION (to_mode
))
380 || (DECIMAL_FLOAT_MODE_P (from_mode
)
381 != DECIMAL_FLOAT_MODE_P (to_mode
)));
383 if (GET_MODE_PRECISION (from_mode
) == GET_MODE_PRECISION (to_mode
))
384 /* Conversion between decimal float and binary float, same size. */
385 tab
= DECIMAL_FLOAT_MODE_P (from_mode
) ? trunc_optab
: sext_optab
;
386 else if (GET_MODE_PRECISION (from_mode
) < GET_MODE_PRECISION (to_mode
))
391 /* Try converting directly if the insn is supported. */
393 code
= convert_optab_handler (tab
, to_mode
, from_mode
);
394 if (code
!= CODE_FOR_nothing
)
396 emit_unop_insn (code
, to
, from
,
397 tab
== sext_optab
? FLOAT_EXTEND
: FLOAT_TRUNCATE
);
401 /* Otherwise use a libcall. */
402 libcall
= convert_optab_libfunc (tab
, to_mode
, from_mode
);
404 /* Is this conversion implemented yet? */
405 gcc_assert (libcall
);
408 value
= emit_library_call_value (libcall
, NULL_RTX
, LCT_CONST
, to_mode
,
410 insns
= get_insns ();
412 emit_libcall_block (insns
, to
, value
,
413 tab
== trunc_optab
? gen_rtx_FLOAT_TRUNCATE (to_mode
,
415 : gen_rtx_FLOAT_EXTEND (to_mode
, from
));
419 /* Handle pointer conversion. */ /* SPEE 900220. */
420 /* Targets are expected to provide conversion insns between PxImode and
421 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
422 if (GET_MODE_CLASS (to_mode
) == MODE_PARTIAL_INT
)
424 enum machine_mode full_mode
425 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode
), MODE_INT
);
427 gcc_assert (convert_optab_handler (trunc_optab
, to_mode
, full_mode
)
428 != CODE_FOR_nothing
);
430 if (full_mode
!= from_mode
)
431 from
= convert_to_mode (full_mode
, from
, unsignedp
);
432 emit_unop_insn (convert_optab_handler (trunc_optab
, to_mode
, full_mode
),
436 if (GET_MODE_CLASS (from_mode
) == MODE_PARTIAL_INT
)
439 enum machine_mode full_mode
440 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode
), MODE_INT
);
442 gcc_assert (convert_optab_handler (sext_optab
, full_mode
, from_mode
)
443 != CODE_FOR_nothing
);
445 if (to_mode
== full_mode
)
447 emit_unop_insn (convert_optab_handler (sext_optab
, full_mode
,
453 new_from
= gen_reg_rtx (full_mode
);
454 emit_unop_insn (convert_optab_handler (sext_optab
, full_mode
, from_mode
),
455 new_from
, from
, UNKNOWN
);
457 /* else proceed to integer conversions below. */
458 from_mode
= full_mode
;
462 /* Make sure both are fixed-point modes or both are not. */
463 gcc_assert (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode
) ==
464 ALL_SCALAR_FIXED_POINT_MODE_P (to_mode
));
465 if (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode
))
467 /* If we widen from_mode to to_mode and they are in the same class,
468 we won't saturate the result.
469 Otherwise, always saturate the result to play safe. */
470 if (GET_MODE_CLASS (from_mode
) == GET_MODE_CLASS (to_mode
)
471 && GET_MODE_SIZE (from_mode
) < GET_MODE_SIZE (to_mode
))
472 expand_fixed_convert (to
, from
, 0, 0);
474 expand_fixed_convert (to
, from
, 0, 1);
478 /* Now both modes are integers. */
480 /* Handle expanding beyond a word. */
481 if (GET_MODE_PRECISION (from_mode
) < GET_MODE_PRECISION (to_mode
)
482 && GET_MODE_PRECISION (to_mode
) > BITS_PER_WORD
)
489 enum machine_mode lowpart_mode
;
490 int nwords
= CEIL (GET_MODE_SIZE (to_mode
), UNITS_PER_WORD
);
492 /* Try converting directly if the insn is supported. */
493 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
496 /* If FROM is a SUBREG, put it into a register. Do this
497 so that we always generate the same set of insns for
498 better cse'ing; if an intermediate assignment occurred,
499 we won't be doing the operation directly on the SUBREG. */
500 if (optimize
> 0 && GET_CODE (from
) == SUBREG
)
501 from
= force_reg (from_mode
, from
);
502 emit_unop_insn (code
, to
, from
, equiv_code
);
505 /* Next, try converting via full word. */
506 else if (GET_MODE_PRECISION (from_mode
) < BITS_PER_WORD
507 && ((code
= can_extend_p (to_mode
, word_mode
, unsignedp
))
508 != CODE_FOR_nothing
))
510 rtx word_to
= gen_reg_rtx (word_mode
);
513 if (reg_overlap_mentioned_p (to
, from
))
514 from
= force_reg (from_mode
, from
);
517 convert_move (word_to
, from
, unsignedp
);
518 emit_unop_insn (code
, to
, word_to
, equiv_code
);
522 /* No special multiword conversion insn; do it by hand. */
525 /* Since we will turn this into a no conflict block, we must ensure
526 that the source does not overlap the target. */
528 if (reg_overlap_mentioned_p (to
, from
))
529 from
= force_reg (from_mode
, from
);
531 /* Get a copy of FROM widened to a word, if necessary. */
532 if (GET_MODE_PRECISION (from_mode
) < BITS_PER_WORD
)
533 lowpart_mode
= word_mode
;
535 lowpart_mode
= from_mode
;
537 lowfrom
= convert_to_mode (lowpart_mode
, from
, unsignedp
);
539 lowpart
= gen_lowpart (lowpart_mode
, to
);
540 emit_move_insn (lowpart
, lowfrom
);
542 /* Compute the value to put in each remaining word. */
544 fill_value
= const0_rtx
;
546 fill_value
= emit_store_flag (gen_reg_rtx (word_mode
),
547 LT
, lowfrom
, const0_rtx
,
550 /* Fill the remaining words. */
551 for (i
= GET_MODE_SIZE (lowpart_mode
) / UNITS_PER_WORD
; i
< nwords
; i
++)
553 int index
= (WORDS_BIG_ENDIAN
? nwords
- i
- 1 : i
);
554 rtx subword
= operand_subword (to
, index
, 1, to_mode
);
556 gcc_assert (subword
);
558 if (fill_value
!= subword
)
559 emit_move_insn (subword
, fill_value
);
562 insns
= get_insns ();
569 /* Truncating multi-word to a word or less. */
570 if (GET_MODE_PRECISION (from_mode
) > BITS_PER_WORD
571 && GET_MODE_PRECISION (to_mode
) <= BITS_PER_WORD
)
574 && ! MEM_VOLATILE_P (from
)
575 && direct_load
[(int) to_mode
]
576 && ! mode_dependent_address_p (XEXP (from
, 0)))
578 || GET_CODE (from
) == SUBREG
))
579 from
= force_reg (from_mode
, from
);
580 convert_move (to
, gen_lowpart (word_mode
, from
), 0);
584 /* Now follow all the conversions between integers
585 no more than a word long. */
587 /* For truncation, usually we can just refer to FROM in a narrower mode. */
588 if (GET_MODE_BITSIZE (to_mode
) < GET_MODE_BITSIZE (from_mode
)
589 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode
, from_mode
))
592 && ! MEM_VOLATILE_P (from
)
593 && direct_load
[(int) to_mode
]
594 && ! mode_dependent_address_p (XEXP (from
, 0)))
596 || GET_CODE (from
) == SUBREG
))
597 from
= force_reg (from_mode
, from
);
598 if (REG_P (from
) && REGNO (from
) < FIRST_PSEUDO_REGISTER
599 && ! HARD_REGNO_MODE_OK (REGNO (from
), to_mode
))
600 from
= copy_to_reg (from
);
601 emit_move_insn (to
, gen_lowpart (to_mode
, from
));
605 /* Handle extension. */
606 if (GET_MODE_PRECISION (to_mode
) > GET_MODE_PRECISION (from_mode
))
608 /* Convert directly if that works. */
609 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
612 emit_unop_insn (code
, to
, from
, equiv_code
);
617 enum machine_mode intermediate
;
621 /* Search for a mode to convert via. */
622 for (intermediate
= from_mode
; intermediate
!= VOIDmode
;
623 intermediate
= GET_MODE_WIDER_MODE (intermediate
))
624 if (((can_extend_p (to_mode
, intermediate
, unsignedp
)
626 || (GET_MODE_SIZE (to_mode
) < GET_MODE_SIZE (intermediate
)
627 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode
, intermediate
)))
628 && (can_extend_p (intermediate
, from_mode
, unsignedp
)
629 != CODE_FOR_nothing
))
631 convert_move (to
, convert_to_mode (intermediate
, from
,
632 unsignedp
), unsignedp
);
636 /* No suitable intermediate mode.
637 Generate what we need with shifts. */
638 shift_amount
= (GET_MODE_PRECISION (to_mode
)
639 - GET_MODE_PRECISION (from_mode
));
640 from
= gen_lowpart (to_mode
, force_reg (from_mode
, from
));
641 tmp
= expand_shift (LSHIFT_EXPR
, to_mode
, from
, shift_amount
,
643 tmp
= expand_shift (RSHIFT_EXPR
, to_mode
, tmp
, shift_amount
,
646 emit_move_insn (to
, tmp
);
651 /* Support special truncate insns for certain modes. */
652 if (convert_optab_handler (trunc_optab
, to_mode
,
653 from_mode
) != CODE_FOR_nothing
)
655 emit_unop_insn (convert_optab_handler (trunc_optab
, to_mode
, from_mode
),
660 /* Handle truncation of volatile memrefs, and so on;
661 the things that couldn't be truncated directly,
662 and for which there was no special instruction.
664 ??? Code above formerly short-circuited this, for most integer
665 mode pairs, with a force_reg in from_mode followed by a recursive
666 call to this routine. Appears always to have been wrong. */
667 if (GET_MODE_PRECISION (to_mode
) < GET_MODE_PRECISION (from_mode
))
669 rtx temp
= force_reg (to_mode
, gen_lowpart (to_mode
, from
));
670 emit_move_insn (to
, temp
);
674 /* Mode combination is not recognized. */
678 /* Return an rtx for a value that would result
679 from converting X to mode MODE.
680 Both X and MODE may be floating, or both integer.
681 UNSIGNEDP is nonzero if X is an unsigned value.
682 This can be done by referring to a part of X in place
683 or by copying to a new temporary with conversion. */
686 convert_to_mode (enum machine_mode mode
, rtx x
, int unsignedp
)
688 return convert_modes (mode
, VOIDmode
, x
, unsignedp
);
691 /* Return an rtx for a value that would result
692 from converting X from mode OLDMODE to mode MODE.
693 Both modes may be floating, or both integer.
694 UNSIGNEDP is nonzero if X is an unsigned value.
696 This can be done by referring to a part of X in place
697 or by copying to a new temporary with conversion.
699 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
702 convert_modes (enum machine_mode mode
, enum machine_mode oldmode
, rtx x
, int unsignedp
)
706 /* If FROM is a SUBREG that indicates that we have already done at least
707 the required extension, strip it. */
709 if (GET_CODE (x
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (x
)
710 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
))) >= GET_MODE_SIZE (mode
)
711 && SUBREG_PROMOTED_UNSIGNED_P (x
) == unsignedp
)
712 x
= gen_lowpart (mode
, x
);
714 if (GET_MODE (x
) != VOIDmode
)
715 oldmode
= GET_MODE (x
);
720 /* There is one case that we must handle specially: If we are converting
721 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
722 we are to interpret the constant as unsigned, gen_lowpart will do
723 the wrong if the constant appears negative. What we want to do is
724 make the high-order word of the constant zero, not all ones. */
726 if (unsignedp
&& GET_MODE_CLASS (mode
) == MODE_INT
727 && GET_MODE_BITSIZE (mode
) == 2 * HOST_BITS_PER_WIDE_INT
728 && CONST_INT_P (x
) && INTVAL (x
) < 0)
730 double_int val
= uhwi_to_double_int (INTVAL (x
));
732 /* We need to zero extend VAL. */
733 if (oldmode
!= VOIDmode
)
734 val
= double_int_zext (val
, GET_MODE_BITSIZE (oldmode
));
736 return immed_double_int_const (val
, mode
);
739 /* We can do this with a gen_lowpart if both desired and current modes
740 are integer, and this is either a constant integer, a register, or a
741 non-volatile MEM. Except for the constant case where MODE is no
742 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
745 && GET_MODE_PRECISION (mode
) <= HOST_BITS_PER_WIDE_INT
)
746 || (GET_MODE_CLASS (mode
) == MODE_INT
747 && GET_MODE_CLASS (oldmode
) == MODE_INT
748 && (GET_CODE (x
) == CONST_DOUBLE
749 || (GET_MODE_PRECISION (mode
) <= GET_MODE_PRECISION (oldmode
)
750 && ((MEM_P (x
) && ! MEM_VOLATILE_P (x
)
751 && direct_load
[(int) mode
])
753 && (! HARD_REGISTER_P (x
)
754 || HARD_REGNO_MODE_OK (REGNO (x
), mode
))
755 && TRULY_NOOP_TRUNCATION_MODES_P (mode
,
758 /* ?? If we don't know OLDMODE, we have to assume here that
759 X does not need sign- or zero-extension. This may not be
760 the case, but it's the best we can do. */
761 if (CONST_INT_P (x
) && oldmode
!= VOIDmode
762 && GET_MODE_PRECISION (mode
) > GET_MODE_PRECISION (oldmode
))
764 HOST_WIDE_INT val
= INTVAL (x
);
766 /* We must sign or zero-extend in this case. Start by
767 zero-extending, then sign extend if we need to. */
768 val
&= GET_MODE_MASK (oldmode
);
770 && val_signbit_known_set_p (oldmode
, val
))
771 val
|= ~GET_MODE_MASK (oldmode
);
773 return gen_int_mode (val
, mode
);
776 return gen_lowpart (mode
, x
);
779 /* Converting from integer constant into mode is always equivalent to an
781 if (VECTOR_MODE_P (mode
) && GET_MODE (x
) == VOIDmode
)
783 gcc_assert (GET_MODE_BITSIZE (mode
) == GET_MODE_BITSIZE (oldmode
));
784 return simplify_gen_subreg (mode
, x
, oldmode
, 0);
787 temp
= gen_reg_rtx (mode
);
788 convert_move (temp
, x
, unsignedp
);
792 /* Return the largest alignment we can use for doing a move (or store)
793 of MAX_PIECES. ALIGN is the largest alignment we could use. */
796 alignment_for_piecewise_move (unsigned int max_pieces
, unsigned int align
)
798 enum machine_mode tmode
;
800 tmode
= mode_for_size (max_pieces
* BITS_PER_UNIT
, MODE_INT
, 1);
801 if (align
>= GET_MODE_ALIGNMENT (tmode
))
802 align
= GET_MODE_ALIGNMENT (tmode
);
805 enum machine_mode tmode
, xmode
;
807 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
), xmode
= tmode
;
809 xmode
= tmode
, tmode
= GET_MODE_WIDER_MODE (tmode
))
810 if (GET_MODE_SIZE (tmode
) > max_pieces
811 || SLOW_UNALIGNED_ACCESS (tmode
, align
))
814 align
= MAX (align
, GET_MODE_ALIGNMENT (xmode
));
820 /* Return the widest integer mode no wider than SIZE. If no such mode
821 can be found, return VOIDmode. */
823 static enum machine_mode
824 widest_int_mode_for_size (unsigned int size
)
826 enum machine_mode tmode
, mode
= VOIDmode
;
828 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
829 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
830 if (GET_MODE_SIZE (tmode
) < size
)
836 /* STORE_MAX_PIECES is the number of bytes at a time that we can
837 store efficiently. Due to internal GCC limitations, this is
838 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
839 for an immediate constant. */
841 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
843 /* Determine whether the LEN bytes can be moved by using several move
844 instructions. Return nonzero if a call to move_by_pieces should
848 can_move_by_pieces (unsigned HOST_WIDE_INT len
,
849 unsigned int align ATTRIBUTE_UNUSED
)
851 return MOVE_BY_PIECES_P (len
, align
);
854 /* Generate several move instructions to copy LEN bytes from block FROM to
855 block TO. (These are MEM rtx's with BLKmode).
857 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
858 used to push FROM to the stack.
860 ALIGN is maximum stack alignment we can assume.
862 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
863 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
867 move_by_pieces (rtx to
, rtx from
, unsigned HOST_WIDE_INT len
,
868 unsigned int align
, int endp
)
870 struct move_by_pieces_d data
;
871 enum machine_mode to_addr_mode
, from_addr_mode
872 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (from
));
873 rtx to_addr
, from_addr
= XEXP (from
, 0);
874 unsigned int max_size
= MOVE_MAX_PIECES
+ 1;
875 enum insn_code icode
;
877 align
= MIN (to
? MEM_ALIGN (to
) : align
, MEM_ALIGN (from
));
880 data
.from_addr
= from_addr
;
883 to_addr_mode
= targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (to
));
884 to_addr
= XEXP (to
, 0);
887 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
888 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
890 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
894 to_addr_mode
= VOIDmode
;
898 #ifdef STACK_GROWS_DOWNWARD
904 data
.to_addr
= to_addr
;
907 = (GET_CODE (from_addr
) == PRE_INC
|| GET_CODE (from_addr
) == PRE_DEC
908 || GET_CODE (from_addr
) == POST_INC
909 || GET_CODE (from_addr
) == POST_DEC
);
911 data
.explicit_inc_from
= 0;
912 data
.explicit_inc_to
= 0;
913 if (data
.reverse
) data
.offset
= len
;
916 /* If copying requires more than two move insns,
917 copy addresses to registers (to make displacements shorter)
918 and use post-increment if available. */
919 if (!(data
.autinc_from
&& data
.autinc_to
)
920 && move_by_pieces_ninsns (len
, align
, max_size
) > 2)
922 /* Find the mode of the largest move...
923 MODE might not be used depending on the definitions of the
924 USE_* macros below. */
925 enum machine_mode mode ATTRIBUTE_UNUSED
926 = widest_int_mode_for_size (max_size
);
928 if (USE_LOAD_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_from
)
930 data
.from_addr
= copy_to_mode_reg (from_addr_mode
,
931 plus_constant (from_addr
, len
));
932 data
.autinc_from
= 1;
933 data
.explicit_inc_from
= -1;
935 if (USE_LOAD_POST_INCREMENT (mode
) && ! data
.autinc_from
)
937 data
.from_addr
= copy_to_mode_reg (from_addr_mode
, from_addr
);
938 data
.autinc_from
= 1;
939 data
.explicit_inc_from
= 1;
941 if (!data
.autinc_from
&& CONSTANT_P (from_addr
))
942 data
.from_addr
= copy_to_mode_reg (from_addr_mode
, from_addr
);
943 if (USE_STORE_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_to
)
945 data
.to_addr
= copy_to_mode_reg (to_addr_mode
,
946 plus_constant (to_addr
, len
));
948 data
.explicit_inc_to
= -1;
950 if (USE_STORE_POST_INCREMENT (mode
) && ! data
.reverse
&& ! data
.autinc_to
)
952 data
.to_addr
= copy_to_mode_reg (to_addr_mode
, to_addr
);
954 data
.explicit_inc_to
= 1;
956 if (!data
.autinc_to
&& CONSTANT_P (to_addr
))
957 data
.to_addr
= copy_to_mode_reg (to_addr_mode
, to_addr
);
960 align
= alignment_for_piecewise_move (MOVE_MAX_PIECES
, align
);
962 /* First move what we can in the largest integer mode, then go to
963 successively smaller modes. */
967 enum machine_mode mode
= widest_int_mode_for_size (max_size
);
969 if (mode
== VOIDmode
)
972 icode
= optab_handler (mov_optab
, mode
);
973 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
974 move_by_pieces_1 (GEN_FCN (icode
), mode
, &data
);
976 max_size
= GET_MODE_SIZE (mode
);
979 /* The code above should have handled everything. */
980 gcc_assert (!data
.len
);
986 gcc_assert (!data
.reverse
);
991 if (HAVE_POST_INCREMENT
&& data
.explicit_inc_to
> 0)
992 emit_insn (gen_add2_insn (data
.to_addr
, constm1_rtx
));
994 data
.to_addr
= copy_to_mode_reg (to_addr_mode
,
995 plus_constant (data
.to_addr
,
998 to1
= adjust_automodify_address (data
.to
, QImode
, data
.to_addr
,
1005 to1
= adjust_address (data
.to
, QImode
, data
.offset
);
1013 /* Return number of insns required to move L bytes by pieces.
1014 ALIGN (in bits) is maximum alignment we can assume. */
1016 unsigned HOST_WIDE_INT
1017 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l
, unsigned int align
,
1018 unsigned int max_size
)
1020 unsigned HOST_WIDE_INT n_insns
= 0;
1022 align
= alignment_for_piecewise_move (MOVE_MAX_PIECES
, align
);
1024 while (max_size
> 1)
1026 enum machine_mode mode
;
1027 enum insn_code icode
;
1029 mode
= widest_int_mode_for_size (max_size
);
1031 if (mode
== VOIDmode
)
1034 icode
= optab_handler (mov_optab
, mode
);
1035 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
1036 n_insns
+= l
/ GET_MODE_SIZE (mode
), l
%= GET_MODE_SIZE (mode
);
1038 max_size
= GET_MODE_SIZE (mode
);
1045 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1046 with move instructions for mode MODE. GENFUN is the gen_... function
1047 to make a move insn for that mode. DATA has all the other info. */
1050 move_by_pieces_1 (rtx (*genfun
) (rtx
, ...), enum machine_mode mode
,
1051 struct move_by_pieces_d
*data
)
1053 unsigned int size
= GET_MODE_SIZE (mode
);
1054 rtx to1
= NULL_RTX
, from1
;
1056 while (data
->len
>= size
)
1059 data
->offset
-= size
;
1063 if (data
->autinc_to
)
1064 to1
= adjust_automodify_address (data
->to
, mode
, data
->to_addr
,
1067 to1
= adjust_address (data
->to
, mode
, data
->offset
);
1070 if (data
->autinc_from
)
1071 from1
= adjust_automodify_address (data
->from
, mode
, data
->from_addr
,
1074 from1
= adjust_address (data
->from
, mode
, data
->offset
);
1076 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
1077 emit_insn (gen_add2_insn (data
->to_addr
,
1078 GEN_INT (-(HOST_WIDE_INT
)size
)));
1079 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_from
< 0)
1080 emit_insn (gen_add2_insn (data
->from_addr
,
1081 GEN_INT (-(HOST_WIDE_INT
)size
)));
1084 emit_insn ((*genfun
) (to1
, from1
));
1087 #ifdef PUSH_ROUNDING
1088 emit_single_push_insn (mode
, from1
, NULL
);
1094 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
1095 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (size
)));
1096 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_from
> 0)
1097 emit_insn (gen_add2_insn (data
->from_addr
, GEN_INT (size
)));
1099 if (! data
->reverse
)
1100 data
->offset
+= size
;
1106 /* Emit code to move a block Y to a block X. This may be done with
1107 string-move instructions, with multiple scalar move instructions,
1108 or with a library call.
1110 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1111 SIZE is an rtx that says how long they are.
1112 ALIGN is the maximum alignment we can assume they have.
1113 METHOD describes what kind of copy this is, and what mechanisms may be used.
1115 Return the address of the new block, if memcpy is called and returns it,
1119 emit_block_move_hints (rtx x
, rtx y
, rtx size
, enum block_op_methods method
,
1120 unsigned int expected_align
, HOST_WIDE_INT expected_size
)
1127 if (CONST_INT_P (size
)
1128 && INTVAL (size
) == 0)
1133 case BLOCK_OP_NORMAL
:
1134 case BLOCK_OP_TAILCALL
:
1135 may_use_call
= true;
1138 case BLOCK_OP_CALL_PARM
:
1139 may_use_call
= block_move_libcall_safe_for_call_parm ();
1141 /* Make inhibit_defer_pop nonzero around the library call
1142 to force it to pop the arguments right away. */
1146 case BLOCK_OP_NO_LIBCALL
:
1147 may_use_call
= false;
1154 gcc_assert (MEM_P (x
) && MEM_P (y
));
1155 align
= MIN (MEM_ALIGN (x
), MEM_ALIGN (y
));
1156 gcc_assert (align
>= BITS_PER_UNIT
);
1158 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1159 block copy is more efficient for other large modes, e.g. DCmode. */
1160 x
= adjust_address (x
, BLKmode
, 0);
1161 y
= adjust_address (y
, BLKmode
, 0);
1163 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1164 can be incorrect is coming from __builtin_memcpy. */
1165 if (CONST_INT_P (size
))
1167 x
= shallow_copy_rtx (x
);
1168 y
= shallow_copy_rtx (y
);
1169 set_mem_size (x
, INTVAL (size
));
1170 set_mem_size (y
, INTVAL (size
));
1173 if (CONST_INT_P (size
) && MOVE_BY_PIECES_P (INTVAL (size
), align
))
1174 move_by_pieces (x
, y
, INTVAL (size
), align
, 0);
1175 else if (emit_block_move_via_movmem (x
, y
, size
, align
,
1176 expected_align
, expected_size
))
1178 else if (may_use_call
1179 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (x
))
1180 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (y
)))
1182 /* Since x and y are passed to a libcall, mark the corresponding
1183 tree EXPR as addressable. */
1184 tree y_expr
= MEM_EXPR (y
);
1185 tree x_expr
= MEM_EXPR (x
);
1187 mark_addressable (y_expr
);
1189 mark_addressable (x_expr
);
1190 retval
= emit_block_move_via_libcall (x
, y
, size
,
1191 method
== BLOCK_OP_TAILCALL
);
1195 emit_block_move_via_loop (x
, y
, size
, align
);
1197 if (method
== BLOCK_OP_CALL_PARM
)
1204 emit_block_move (rtx x
, rtx y
, rtx size
, enum block_op_methods method
)
1206 return emit_block_move_hints (x
, y
, size
, method
, 0, -1);
1209 /* A subroutine of emit_block_move. Returns true if calling the
1210 block move libcall will not clobber any parameters which may have
1211 already been placed on the stack. */
1214 block_move_libcall_safe_for_call_parm (void)
1216 #if defined (REG_PARM_STACK_SPACE)
1220 /* If arguments are pushed on the stack, then they're safe. */
1224 /* If registers go on the stack anyway, any argument is sure to clobber
1225 an outgoing argument. */
1226 #if defined (REG_PARM_STACK_SPACE)
1227 fn
= emit_block_move_libcall_fn (false);
1228 /* Avoid set but not used warning if *REG_PARM_STACK_SPACE doesn't
1229 depend on its argument. */
1231 if (OUTGOING_REG_PARM_STACK_SPACE ((!fn
? NULL_TREE
: TREE_TYPE (fn
)))
1232 && REG_PARM_STACK_SPACE (fn
) != 0)
1236 /* If any argument goes in memory, then it might clobber an outgoing
1239 CUMULATIVE_ARGS args_so_far_v
;
1240 cumulative_args_t args_so_far
;
1243 fn
= emit_block_move_libcall_fn (false);
1244 INIT_CUMULATIVE_ARGS (args_so_far_v
, TREE_TYPE (fn
), NULL_RTX
, 0, 3);
1245 args_so_far
= pack_cumulative_args (&args_so_far_v
);
1247 arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1248 for ( ; arg
!= void_list_node
; arg
= TREE_CHAIN (arg
))
1250 enum machine_mode mode
= TYPE_MODE (TREE_VALUE (arg
));
1251 rtx tmp
= targetm
.calls
.function_arg (args_so_far
, mode
,
1253 if (!tmp
|| !REG_P (tmp
))
1255 if (targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, NULL
, 1))
1257 targetm
.calls
.function_arg_advance (args_so_far
, mode
,
1264 /* A subroutine of emit_block_move. Expand a movmem pattern;
1265 return true if successful. */
1268 emit_block_move_via_movmem (rtx x
, rtx y
, rtx size
, unsigned int align
,
1269 unsigned int expected_align
, HOST_WIDE_INT expected_size
)
1271 int save_volatile_ok
= volatile_ok
;
1272 enum machine_mode mode
;
1274 if (expected_align
< align
)
1275 expected_align
= align
;
1277 /* Since this is a move insn, we don't care about volatility. */
1280 /* Try the most limited insn first, because there's no point
1281 including more than one in the machine description unless
1282 the more limited one has some advantage. */
1284 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
1285 mode
= GET_MODE_WIDER_MODE (mode
))
1287 enum insn_code code
= direct_optab_handler (movmem_optab
, mode
);
1289 if (code
!= CODE_FOR_nothing
1290 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1291 here because if SIZE is less than the mode mask, as it is
1292 returned by the macro, it will definitely be less than the
1293 actual mode mask. */
1294 && ((CONST_INT_P (size
)
1295 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
1296 <= (GET_MODE_MASK (mode
) >> 1)))
1297 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
))
1299 struct expand_operand ops
[6];
1302 /* ??? When called via emit_block_move_for_call, it'd be
1303 nice if there were some way to inform the backend, so
1304 that it doesn't fail the expansion because it thinks
1305 emitting the libcall would be more efficient. */
1306 nops
= insn_data
[(int) code
].n_generator_args
;
1307 gcc_assert (nops
== 4 || nops
== 6);
1309 create_fixed_operand (&ops
[0], x
);
1310 create_fixed_operand (&ops
[1], y
);
1311 /* The check above guarantees that this size conversion is valid. */
1312 create_convert_operand_to (&ops
[2], size
, mode
, true);
1313 create_integer_operand (&ops
[3], align
/ BITS_PER_UNIT
);
1316 create_integer_operand (&ops
[4], expected_align
/ BITS_PER_UNIT
);
1317 create_integer_operand (&ops
[5], expected_size
);
1319 if (maybe_expand_insn (code
, nops
, ops
))
1321 volatile_ok
= save_volatile_ok
;
1327 volatile_ok
= save_volatile_ok
;
1331 /* A subroutine of emit_block_move. Expand a call to memcpy.
1332 Return the return value from memcpy, 0 otherwise. */
1335 emit_block_move_via_libcall (rtx dst
, rtx src
, rtx size
, bool tailcall
)
1337 rtx dst_addr
, src_addr
;
1338 tree call_expr
, fn
, src_tree
, dst_tree
, size_tree
;
1339 enum machine_mode size_mode
;
1342 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1343 pseudos. We can then place those new pseudos into a VAR_DECL and
1346 dst_addr
= copy_addr_to_reg (XEXP (dst
, 0));
1347 src_addr
= copy_addr_to_reg (XEXP (src
, 0));
1349 dst_addr
= convert_memory_address (ptr_mode
, dst_addr
);
1350 src_addr
= convert_memory_address (ptr_mode
, src_addr
);
1352 dst_tree
= make_tree (ptr_type_node
, dst_addr
);
1353 src_tree
= make_tree (ptr_type_node
, src_addr
);
1355 size_mode
= TYPE_MODE (sizetype
);
1357 size
= convert_to_mode (size_mode
, size
, 1);
1358 size
= copy_to_mode_reg (size_mode
, size
);
1360 /* It is incorrect to use the libcall calling conventions to call
1361 memcpy in this context. This could be a user call to memcpy and
1362 the user may wish to examine the return value from memcpy. For
1363 targets where libcalls and normal calls have different conventions
1364 for returning pointers, we could end up generating incorrect code. */
1366 size_tree
= make_tree (sizetype
, size
);
1368 fn
= emit_block_move_libcall_fn (true);
1369 call_expr
= build_call_expr (fn
, 3, dst_tree
, src_tree
, size_tree
);
1370 CALL_EXPR_TAILCALL (call_expr
) = tailcall
;
1372 retval
= expand_normal (call_expr
);
1377 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1378 for the function we use for block copies. */
1380 static GTY(()) tree block_move_fn
;
1383 init_block_move_fn (const char *asmspec
)
1389 fn
= get_identifier ("memcpy");
1390 args
= build_function_type_list (ptr_type_node
, ptr_type_node
,
1391 const_ptr_type_node
, sizetype
,
1394 fn
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, fn
, args
);
1395 DECL_EXTERNAL (fn
) = 1;
1396 TREE_PUBLIC (fn
) = 1;
1397 DECL_ARTIFICIAL (fn
) = 1;
1398 TREE_NOTHROW (fn
) = 1;
1399 DECL_VISIBILITY (fn
) = VISIBILITY_DEFAULT
;
1400 DECL_VISIBILITY_SPECIFIED (fn
) = 1;
1406 set_user_assembler_name (block_move_fn
, asmspec
);
1410 emit_block_move_libcall_fn (int for_call
)
1412 static bool emitted_extern
;
1415 init_block_move_fn (NULL
);
1417 if (for_call
&& !emitted_extern
)
1419 emitted_extern
= true;
1420 make_decl_rtl (block_move_fn
);
1423 return block_move_fn
;
1426 /* A subroutine of emit_block_move. Copy the data via an explicit
1427 loop. This is used only when libcalls are forbidden. */
1428 /* ??? It'd be nice to copy in hunks larger than QImode. */
1431 emit_block_move_via_loop (rtx x
, rtx y
, rtx size
,
1432 unsigned int align ATTRIBUTE_UNUSED
)
1434 rtx cmp_label
, top_label
, iter
, x_addr
, y_addr
, tmp
;
1435 enum machine_mode x_addr_mode
1436 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (x
));
1437 enum machine_mode y_addr_mode
1438 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (y
));
1439 enum machine_mode iter_mode
;
1441 iter_mode
= GET_MODE (size
);
1442 if (iter_mode
== VOIDmode
)
1443 iter_mode
= word_mode
;
1445 top_label
= gen_label_rtx ();
1446 cmp_label
= gen_label_rtx ();
1447 iter
= gen_reg_rtx (iter_mode
);
1449 emit_move_insn (iter
, const0_rtx
);
1451 x_addr
= force_operand (XEXP (x
, 0), NULL_RTX
);
1452 y_addr
= force_operand (XEXP (y
, 0), NULL_RTX
);
1453 do_pending_stack_adjust ();
1455 emit_jump (cmp_label
);
1456 emit_label (top_label
);
1458 tmp
= convert_modes (x_addr_mode
, iter_mode
, iter
, true);
1459 x_addr
= gen_rtx_PLUS (x_addr_mode
, x_addr
, tmp
);
1461 if (x_addr_mode
!= y_addr_mode
)
1462 tmp
= convert_modes (y_addr_mode
, iter_mode
, iter
, true);
1463 y_addr
= gen_rtx_PLUS (y_addr_mode
, y_addr
, tmp
);
1465 x
= change_address (x
, QImode
, x_addr
);
1466 y
= change_address (y
, QImode
, y_addr
);
1468 emit_move_insn (x
, y
);
1470 tmp
= expand_simple_binop (iter_mode
, PLUS
, iter
, const1_rtx
, iter
,
1471 true, OPTAB_LIB_WIDEN
);
1473 emit_move_insn (iter
, tmp
);
1475 emit_label (cmp_label
);
1477 emit_cmp_and_jump_insns (iter
, size
, LT
, NULL_RTX
, iter_mode
,
1481 /* Copy all or part of a value X into registers starting at REGNO.
1482 The number of registers to be filled is NREGS. */
1485 move_block_to_reg (int regno
, rtx x
, int nregs
, enum machine_mode mode
)
1488 #ifdef HAVE_load_multiple
1496 if (CONSTANT_P (x
) && !targetm
.legitimate_constant_p (mode
, x
))
1497 x
= validize_mem (force_const_mem (mode
, x
));
1499 /* See if the machine can do this with a load multiple insn. */
1500 #ifdef HAVE_load_multiple
1501 if (HAVE_load_multiple
)
1503 last
= get_last_insn ();
1504 pat
= gen_load_multiple (gen_rtx_REG (word_mode
, regno
), x
,
1512 delete_insns_since (last
);
1516 for (i
= 0; i
< nregs
; i
++)
1517 emit_move_insn (gen_rtx_REG (word_mode
, regno
+ i
),
1518 operand_subword_force (x
, i
, mode
));
1521 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1522 The number of registers to be filled is NREGS. */
1525 move_block_from_reg (int regno
, rtx x
, int nregs
)
1532 /* See if the machine can do this with a store multiple insn. */
1533 #ifdef HAVE_store_multiple
1534 if (HAVE_store_multiple
)
1536 rtx last
= get_last_insn ();
1537 rtx pat
= gen_store_multiple (x
, gen_rtx_REG (word_mode
, regno
),
1545 delete_insns_since (last
);
1549 for (i
= 0; i
< nregs
; i
++)
1551 rtx tem
= operand_subword (x
, i
, 1, BLKmode
);
1555 emit_move_insn (tem
, gen_rtx_REG (word_mode
, regno
+ i
));
1559 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1560 ORIG, where ORIG is a non-consecutive group of registers represented by
1561 a PARALLEL. The clone is identical to the original except in that the
1562 original set of registers is replaced by a new set of pseudo registers.
1563 The new set has the same modes as the original set. */
1566 gen_group_rtx (rtx orig
)
1571 gcc_assert (GET_CODE (orig
) == PARALLEL
);
1573 length
= XVECLEN (orig
, 0);
1574 tmps
= XALLOCAVEC (rtx
, length
);
1576 /* Skip a NULL entry in first slot. */
1577 i
= XEXP (XVECEXP (orig
, 0, 0), 0) ? 0 : 1;
1582 for (; i
< length
; i
++)
1584 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (orig
, 0, i
), 0));
1585 rtx offset
= XEXP (XVECEXP (orig
, 0, i
), 1);
1587 tmps
[i
] = gen_rtx_EXPR_LIST (VOIDmode
, gen_reg_rtx (mode
), offset
);
1590 return gen_rtx_PARALLEL (GET_MODE (orig
), gen_rtvec_v (length
, tmps
));
1593 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1594 except that values are placed in TMPS[i], and must later be moved
1595 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1598 emit_group_load_1 (rtx
*tmps
, rtx dst
, rtx orig_src
, tree type
, int ssize
)
1602 enum machine_mode m
= GET_MODE (orig_src
);
1604 gcc_assert (GET_CODE (dst
) == PARALLEL
);
1607 && !SCALAR_INT_MODE_P (m
)
1608 && !MEM_P (orig_src
)
1609 && GET_CODE (orig_src
) != CONCAT
)
1611 enum machine_mode imode
= int_mode_for_mode (GET_MODE (orig_src
));
1612 if (imode
== BLKmode
)
1613 src
= assign_stack_temp (GET_MODE (orig_src
), ssize
, 0);
1615 src
= gen_reg_rtx (imode
);
1616 if (imode
!= BLKmode
)
1617 src
= gen_lowpart (GET_MODE (orig_src
), src
);
1618 emit_move_insn (src
, orig_src
);
1619 /* ...and back again. */
1620 if (imode
!= BLKmode
)
1621 src
= gen_lowpart (imode
, src
);
1622 emit_group_load_1 (tmps
, dst
, src
, type
, ssize
);
1626 /* Check for a NULL entry, used to indicate that the parameter goes
1627 both on the stack and in registers. */
1628 if (XEXP (XVECEXP (dst
, 0, 0), 0))
1633 /* Process the pieces. */
1634 for (i
= start
; i
< XVECLEN (dst
, 0); i
++)
1636 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (dst
, 0, i
), 0));
1637 HOST_WIDE_INT bytepos
= INTVAL (XEXP (XVECEXP (dst
, 0, i
), 1));
1638 unsigned int bytelen
= GET_MODE_SIZE (mode
);
1641 /* Handle trailing fragments that run over the size of the struct. */
1642 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
1644 /* Arrange to shift the fragment to where it belongs.
1645 extract_bit_field loads to the lsb of the reg. */
1647 #ifdef BLOCK_REG_PADDING
1648 BLOCK_REG_PADDING (GET_MODE (orig_src
), type
, i
== start
)
1649 == (BYTES_BIG_ENDIAN
? upward
: downward
)
1654 shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
1655 bytelen
= ssize
- bytepos
;
1656 gcc_assert (bytelen
> 0);
1659 /* If we won't be loading directly from memory, protect the real source
1660 from strange tricks we might play; but make sure that the source can
1661 be loaded directly into the destination. */
1663 if (!MEM_P (orig_src
)
1664 && (!CONSTANT_P (orig_src
)
1665 || (GET_MODE (orig_src
) != mode
1666 && GET_MODE (orig_src
) != VOIDmode
)))
1668 if (GET_MODE (orig_src
) == VOIDmode
)
1669 src
= gen_reg_rtx (mode
);
1671 src
= gen_reg_rtx (GET_MODE (orig_src
));
1673 emit_move_insn (src
, orig_src
);
1676 /* Optimize the access just a bit. */
1678 && (! SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (src
))
1679 || MEM_ALIGN (src
) >= GET_MODE_ALIGNMENT (mode
))
1680 && bytepos
* BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
1681 && bytelen
== GET_MODE_SIZE (mode
))
1683 tmps
[i
] = gen_reg_rtx (mode
);
1684 emit_move_insn (tmps
[i
], adjust_address (src
, mode
, bytepos
));
1686 else if (COMPLEX_MODE_P (mode
)
1687 && GET_MODE (src
) == mode
1688 && bytelen
== GET_MODE_SIZE (mode
))
1689 /* Let emit_move_complex do the bulk of the work. */
1691 else if (GET_CODE (src
) == CONCAT
)
1693 unsigned int slen
= GET_MODE_SIZE (GET_MODE (src
));
1694 unsigned int slen0
= GET_MODE_SIZE (GET_MODE (XEXP (src
, 0)));
1696 if ((bytepos
== 0 && bytelen
== slen0
)
1697 || (bytepos
!= 0 && bytepos
+ bytelen
<= slen
))
1699 /* The following assumes that the concatenated objects all
1700 have the same size. In this case, a simple calculation
1701 can be used to determine the object and the bit field
1703 tmps
[i
] = XEXP (src
, bytepos
/ slen0
);
1704 if (! CONSTANT_P (tmps
[i
])
1705 && (!REG_P (tmps
[i
]) || GET_MODE (tmps
[i
]) != mode
))
1706 tmps
[i
] = extract_bit_field (tmps
[i
], bytelen
* BITS_PER_UNIT
,
1707 (bytepos
% slen0
) * BITS_PER_UNIT
,
1708 1, false, NULL_RTX
, mode
, mode
);
1714 gcc_assert (!bytepos
);
1715 mem
= assign_stack_temp (GET_MODE (src
), slen
, 0);
1716 emit_move_insn (mem
, src
);
1717 tmps
[i
] = extract_bit_field (mem
, bytelen
* BITS_PER_UNIT
,
1718 0, 1, false, NULL_RTX
, mode
, mode
);
1721 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1722 SIMD register, which is currently broken. While we get GCC
1723 to emit proper RTL for these cases, let's dump to memory. */
1724 else if (VECTOR_MODE_P (GET_MODE (dst
))
1727 int slen
= GET_MODE_SIZE (GET_MODE (src
));
1730 mem
= assign_stack_temp (GET_MODE (src
), slen
, 0);
1731 emit_move_insn (mem
, src
);
1732 tmps
[i
] = adjust_address (mem
, mode
, (int) bytepos
);
1734 else if (CONSTANT_P (src
) && GET_MODE (dst
) != BLKmode
1735 && XVECLEN (dst
, 0) > 1)
1736 tmps
[i
] = simplify_gen_subreg (mode
, src
, GET_MODE(dst
), bytepos
);
1737 else if (CONSTANT_P (src
))
1739 HOST_WIDE_INT len
= (HOST_WIDE_INT
) bytelen
;
1747 gcc_assert (2 * len
== ssize
);
1748 split_double (src
, &first
, &second
);
1755 else if (REG_P (src
) && GET_MODE (src
) == mode
)
1758 tmps
[i
] = extract_bit_field (src
, bytelen
* BITS_PER_UNIT
,
1759 bytepos
* BITS_PER_UNIT
, 1, false, NULL_RTX
,
1763 tmps
[i
] = expand_shift (LSHIFT_EXPR
, mode
, tmps
[i
],
1768 /* Emit code to move a block SRC of type TYPE to a block DST,
1769 where DST is non-consecutive registers represented by a PARALLEL.
1770 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1774 emit_group_load (rtx dst
, rtx src
, tree type
, int ssize
)
1779 tmps
= XALLOCAVEC (rtx
, XVECLEN (dst
, 0));
1780 emit_group_load_1 (tmps
, dst
, src
, type
, ssize
);
1782 /* Copy the extracted pieces into the proper (probable) hard regs. */
1783 for (i
= 0; i
< XVECLEN (dst
, 0); i
++)
1785 rtx d
= XEXP (XVECEXP (dst
, 0, i
), 0);
1788 emit_move_insn (d
, tmps
[i
]);
1792 /* Similar, but load SRC into new pseudos in a format that looks like
1793 PARALLEL. This can later be fed to emit_group_move to get things
1794 in the right place. */
1797 emit_group_load_into_temps (rtx parallel
, rtx src
, tree type
, int ssize
)
1802 vec
= rtvec_alloc (XVECLEN (parallel
, 0));
1803 emit_group_load_1 (&RTVEC_ELT (vec
, 0), parallel
, src
, type
, ssize
);
1805 /* Convert the vector to look just like the original PARALLEL, except
1806 with the computed values. */
1807 for (i
= 0; i
< XVECLEN (parallel
, 0); i
++)
1809 rtx e
= XVECEXP (parallel
, 0, i
);
1810 rtx d
= XEXP (e
, 0);
1814 d
= force_reg (GET_MODE (d
), RTVEC_ELT (vec
, i
));
1815 e
= alloc_EXPR_LIST (REG_NOTE_KIND (e
), d
, XEXP (e
, 1));
1817 RTVEC_ELT (vec
, i
) = e
;
1820 return gen_rtx_PARALLEL (GET_MODE (parallel
), vec
);
1823 /* Emit code to move a block SRC to block DST, where SRC and DST are
1824 non-consecutive groups of registers, each represented by a PARALLEL. */
1827 emit_group_move (rtx dst
, rtx src
)
1831 gcc_assert (GET_CODE (src
) == PARALLEL
1832 && GET_CODE (dst
) == PARALLEL
1833 && XVECLEN (src
, 0) == XVECLEN (dst
, 0));
1835 /* Skip first entry if NULL. */
1836 for (i
= XEXP (XVECEXP (src
, 0, 0), 0) ? 0 : 1; i
< XVECLEN (src
, 0); i
++)
1837 emit_move_insn (XEXP (XVECEXP (dst
, 0, i
), 0),
1838 XEXP (XVECEXP (src
, 0, i
), 0));
1841 /* Move a group of registers represented by a PARALLEL into pseudos. */
1844 emit_group_move_into_temps (rtx src
)
1846 rtvec vec
= rtvec_alloc (XVECLEN (src
, 0));
1849 for (i
= 0; i
< XVECLEN (src
, 0); i
++)
1851 rtx e
= XVECEXP (src
, 0, i
);
1852 rtx d
= XEXP (e
, 0);
1855 e
= alloc_EXPR_LIST (REG_NOTE_KIND (e
), copy_to_reg (d
), XEXP (e
, 1));
1856 RTVEC_ELT (vec
, i
) = e
;
1859 return gen_rtx_PARALLEL (GET_MODE (src
), vec
);
1862 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1863 where SRC is non-consecutive registers represented by a PARALLEL.
1864 SSIZE represents the total size of block ORIG_DST, or -1 if not
1868 emit_group_store (rtx orig_dst
, rtx src
, tree type ATTRIBUTE_UNUSED
, int ssize
)
1871 int start
, finish
, i
;
1872 enum machine_mode m
= GET_MODE (orig_dst
);
1874 gcc_assert (GET_CODE (src
) == PARALLEL
);
1876 if (!SCALAR_INT_MODE_P (m
)
1877 && !MEM_P (orig_dst
) && GET_CODE (orig_dst
) != CONCAT
)
1879 enum machine_mode imode
= int_mode_for_mode (GET_MODE (orig_dst
));
1880 if (imode
== BLKmode
)
1881 dst
= assign_stack_temp (GET_MODE (orig_dst
), ssize
, 0);
1883 dst
= gen_reg_rtx (imode
);
1884 emit_group_store (dst
, src
, type
, ssize
);
1885 if (imode
!= BLKmode
)
1886 dst
= gen_lowpart (GET_MODE (orig_dst
), dst
);
1887 emit_move_insn (orig_dst
, dst
);
1891 /* Check for a NULL entry, used to indicate that the parameter goes
1892 both on the stack and in registers. */
1893 if (XEXP (XVECEXP (src
, 0, 0), 0))
1897 finish
= XVECLEN (src
, 0);
1899 tmps
= XALLOCAVEC (rtx
, finish
);
1901 /* Copy the (probable) hard regs into pseudos. */
1902 for (i
= start
; i
< finish
; i
++)
1904 rtx reg
= XEXP (XVECEXP (src
, 0, i
), 0);
1905 if (!REG_P (reg
) || REGNO (reg
) < FIRST_PSEUDO_REGISTER
)
1907 tmps
[i
] = gen_reg_rtx (GET_MODE (reg
));
1908 emit_move_insn (tmps
[i
], reg
);
1914 /* If we won't be storing directly into memory, protect the real destination
1915 from strange tricks we might play. */
1917 if (GET_CODE (dst
) == PARALLEL
)
1921 /* We can get a PARALLEL dst if there is a conditional expression in
1922 a return statement. In that case, the dst and src are the same,
1923 so no action is necessary. */
1924 if (rtx_equal_p (dst
, src
))
1927 /* It is unclear if we can ever reach here, but we may as well handle
1928 it. Allocate a temporary, and split this into a store/load to/from
1931 temp
= assign_stack_temp (GET_MODE (dst
), ssize
, 0);
1932 emit_group_store (temp
, src
, type
, ssize
);
1933 emit_group_load (dst
, temp
, type
, ssize
);
1936 else if (!MEM_P (dst
) && GET_CODE (dst
) != CONCAT
)
1938 enum machine_mode outer
= GET_MODE (dst
);
1939 enum machine_mode inner
;
1940 HOST_WIDE_INT bytepos
;
1944 if (!REG_P (dst
) || REGNO (dst
) < FIRST_PSEUDO_REGISTER
)
1945 dst
= gen_reg_rtx (outer
);
1947 /* Make life a bit easier for combine. */
1948 /* If the first element of the vector is the low part
1949 of the destination mode, use a paradoxical subreg to
1950 initialize the destination. */
1953 inner
= GET_MODE (tmps
[start
]);
1954 bytepos
= subreg_lowpart_offset (inner
, outer
);
1955 if (INTVAL (XEXP (XVECEXP (src
, 0, start
), 1)) == bytepos
)
1957 temp
= simplify_gen_subreg (outer
, tmps
[start
],
1961 emit_move_insn (dst
, temp
);
1968 /* If the first element wasn't the low part, try the last. */
1970 && start
< finish
- 1)
1972 inner
= GET_MODE (tmps
[finish
- 1]);
1973 bytepos
= subreg_lowpart_offset (inner
, outer
);
1974 if (INTVAL (XEXP (XVECEXP (src
, 0, finish
- 1), 1)) == bytepos
)
1976 temp
= simplify_gen_subreg (outer
, tmps
[finish
- 1],
1980 emit_move_insn (dst
, temp
);
1987 /* Otherwise, simply initialize the result to zero. */
1989 emit_move_insn (dst
, CONST0_RTX (outer
));
1992 /* Process the pieces. */
1993 for (i
= start
; i
< finish
; i
++)
1995 HOST_WIDE_INT bytepos
= INTVAL (XEXP (XVECEXP (src
, 0, i
), 1));
1996 enum machine_mode mode
= GET_MODE (tmps
[i
]);
1997 unsigned int bytelen
= GET_MODE_SIZE (mode
);
1998 unsigned int adj_bytelen
= bytelen
;
2001 /* Handle trailing fragments that run over the size of the struct. */
2002 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
2003 adj_bytelen
= ssize
- bytepos
;
2005 if (GET_CODE (dst
) == CONCAT
)
2007 if (bytepos
+ adj_bytelen
2008 <= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0))))
2009 dest
= XEXP (dst
, 0);
2010 else if (bytepos
>= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0))))
2012 bytepos
-= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0)));
2013 dest
= XEXP (dst
, 1);
2017 enum machine_mode dest_mode
= GET_MODE (dest
);
2018 enum machine_mode tmp_mode
= GET_MODE (tmps
[i
]);
2020 gcc_assert (bytepos
== 0 && XVECLEN (src
, 0));
2022 if (GET_MODE_ALIGNMENT (dest_mode
)
2023 >= GET_MODE_ALIGNMENT (tmp_mode
))
2025 dest
= assign_stack_temp (dest_mode
,
2026 GET_MODE_SIZE (dest_mode
),
2028 emit_move_insn (adjust_address (dest
,
2036 dest
= assign_stack_temp (tmp_mode
,
2037 GET_MODE_SIZE (tmp_mode
),
2039 emit_move_insn (dest
, tmps
[i
]);
2040 dst
= adjust_address (dest
, dest_mode
, bytepos
);
2046 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
2048 /* store_bit_field always takes its value from the lsb.
2049 Move the fragment to the lsb if it's not already there. */
2051 #ifdef BLOCK_REG_PADDING
2052 BLOCK_REG_PADDING (GET_MODE (orig_dst
), type
, i
== start
)
2053 == (BYTES_BIG_ENDIAN
? upward
: downward
)
2059 int shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
2060 tmps
[i
] = expand_shift (RSHIFT_EXPR
, mode
, tmps
[i
],
2063 bytelen
= adj_bytelen
;
2066 /* Optimize the access just a bit. */
2068 && (! SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (dest
))
2069 || MEM_ALIGN (dest
) >= GET_MODE_ALIGNMENT (mode
))
2070 && bytepos
* BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
2071 && bytelen
== GET_MODE_SIZE (mode
))
2072 emit_move_insn (adjust_address (dest
, mode
, bytepos
), tmps
[i
]);
2074 store_bit_field (dest
, bytelen
* BITS_PER_UNIT
, bytepos
* BITS_PER_UNIT
,
2075 0, 0, mode
, tmps
[i
]);
2078 /* Copy from the pseudo into the (probable) hard reg. */
2079 if (orig_dst
!= dst
)
2080 emit_move_insn (orig_dst
, dst
);
2083 /* Generate code to copy a BLKmode object of TYPE out of a
2084 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2085 is null, a stack temporary is created. TGTBLK is returned.
2087 The purpose of this routine is to handle functions that return
2088 BLKmode structures in registers. Some machines (the PA for example)
2089 want to return all small structures in registers regardless of the
2090 structure's alignment. */
2093 copy_blkmode_from_reg (rtx tgtblk
, rtx srcreg
, tree type
)
2095 unsigned HOST_WIDE_INT bytes
= int_size_in_bytes (type
);
2096 rtx src
= NULL
, dst
= NULL
;
2097 unsigned HOST_WIDE_INT bitsize
= MIN (TYPE_ALIGN (type
), BITS_PER_WORD
);
2098 unsigned HOST_WIDE_INT bitpos
, xbitpos
, padding_correction
= 0;
2099 enum machine_mode copy_mode
;
2103 tgtblk
= assign_temp (build_qualified_type (type
,
2105 | TYPE_QUAL_CONST
)),
2107 preserve_temp_slots (tgtblk
);
2110 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2111 into a new pseudo which is a full word. */
2113 if (GET_MODE (srcreg
) != BLKmode
2114 && GET_MODE_SIZE (GET_MODE (srcreg
)) < UNITS_PER_WORD
)
2115 srcreg
= convert_to_mode (word_mode
, srcreg
, TYPE_UNSIGNED (type
));
2117 /* If the structure doesn't take up a whole number of words, see whether
2118 SRCREG is padded on the left or on the right. If it's on the left,
2119 set PADDING_CORRECTION to the number of bits to skip.
2121 In most ABIs, the structure will be returned at the least end of
2122 the register, which translates to right padding on little-endian
2123 targets and left padding on big-endian targets. The opposite
2124 holds if the structure is returned at the most significant
2125 end of the register. */
2126 if (bytes
% UNITS_PER_WORD
!= 0
2127 && (targetm
.calls
.return_in_msb (type
)
2129 : BYTES_BIG_ENDIAN
))
2131 = (BITS_PER_WORD
- ((bytes
% UNITS_PER_WORD
) * BITS_PER_UNIT
));
2133 /* Copy the structure BITSIZE bits at a time. If the target lives in
2134 memory, take care of not reading/writing past its end by selecting
2135 a copy mode suited to BITSIZE. This should always be possible given
2138 We could probably emit more efficient code for machines which do not use
2139 strict alignment, but it doesn't seem worth the effort at the current
2142 copy_mode
= word_mode
;
2145 enum machine_mode mem_mode
= mode_for_size (bitsize
, MODE_INT
, 1);
2146 if (mem_mode
!= BLKmode
)
2147 copy_mode
= mem_mode
;
2150 for (bitpos
= 0, xbitpos
= padding_correction
;
2151 bitpos
< bytes
* BITS_PER_UNIT
;
2152 bitpos
+= bitsize
, xbitpos
+= bitsize
)
2154 /* We need a new source operand each time xbitpos is on a
2155 word boundary and when xbitpos == padding_correction
2156 (the first time through). */
2157 if (xbitpos
% BITS_PER_WORD
== 0
2158 || xbitpos
== padding_correction
)
2159 src
= operand_subword_force (srcreg
, xbitpos
/ BITS_PER_WORD
,
2162 /* We need a new destination operand each time bitpos is on
2164 if (bitpos
% BITS_PER_WORD
== 0)
2165 dst
= operand_subword (tgtblk
, bitpos
/ BITS_PER_WORD
, 1, BLKmode
);
2167 /* Use xbitpos for the source extraction (right justified) and
2168 bitpos for the destination store (left justified). */
2169 store_bit_field (dst
, bitsize
, bitpos
% BITS_PER_WORD
, 0, 0, copy_mode
,
2170 extract_bit_field (src
, bitsize
,
2171 xbitpos
% BITS_PER_WORD
, 1, false,
2172 NULL_RTX
, copy_mode
, copy_mode
));
2178 /* Copy BLKmode value SRC into a register of mode MODE. Return the
2179 register if it contains any data, otherwise return null.
2181 This is used on targets that return BLKmode values in registers. */
2184 copy_blkmode_to_reg (enum machine_mode mode
, tree src
)
2187 unsigned HOST_WIDE_INT bitpos
, xbitpos
, padding_correction
= 0, bytes
;
2188 unsigned int bitsize
;
2189 rtx
*dst_words
, dst
, x
, src_word
= NULL_RTX
, dst_word
= NULL_RTX
;
2190 enum machine_mode dst_mode
;
2192 gcc_assert (TYPE_MODE (TREE_TYPE (src
)) == BLKmode
);
2194 x
= expand_normal (src
);
2196 bytes
= int_size_in_bytes (TREE_TYPE (src
));
2200 /* If the structure doesn't take up a whole number of words, see
2201 whether the register value should be padded on the left or on
2202 the right. Set PADDING_CORRECTION to the number of padding
2203 bits needed on the left side.
2205 In most ABIs, the structure will be returned at the least end of
2206 the register, which translates to right padding on little-endian
2207 targets and left padding on big-endian targets. The opposite
2208 holds if the structure is returned at the most significant
2209 end of the register. */
2210 if (bytes
% UNITS_PER_WORD
!= 0
2211 && (targetm
.calls
.return_in_msb (TREE_TYPE (src
))
2213 : BYTES_BIG_ENDIAN
))
2214 padding_correction
= (BITS_PER_WORD
- ((bytes
% UNITS_PER_WORD
)
2217 n_regs
= (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
2218 dst_words
= XALLOCAVEC (rtx
, n_regs
);
2219 bitsize
= MIN (TYPE_ALIGN (TREE_TYPE (src
)), BITS_PER_WORD
);
2221 /* Copy the structure BITSIZE bits at a time. */
2222 for (bitpos
= 0, xbitpos
= padding_correction
;
2223 bitpos
< bytes
* BITS_PER_UNIT
;
2224 bitpos
+= bitsize
, xbitpos
+= bitsize
)
2226 /* We need a new destination pseudo each time xbitpos is
2227 on a word boundary and when xbitpos == padding_correction
2228 (the first time through). */
2229 if (xbitpos
% BITS_PER_WORD
== 0
2230 || xbitpos
== padding_correction
)
2232 /* Generate an appropriate register. */
2233 dst_word
= gen_reg_rtx (word_mode
);
2234 dst_words
[xbitpos
/ BITS_PER_WORD
] = dst_word
;
2236 /* Clear the destination before we move anything into it. */
2237 emit_move_insn (dst_word
, CONST0_RTX (word_mode
));
2240 /* We need a new source operand each time bitpos is on a word
2242 if (bitpos
% BITS_PER_WORD
== 0)
2243 src_word
= operand_subword_force (x
, bitpos
/ BITS_PER_WORD
, BLKmode
);
2245 /* Use bitpos for the source extraction (left justified) and
2246 xbitpos for the destination store (right justified). */
2247 store_bit_field (dst_word
, bitsize
, xbitpos
% BITS_PER_WORD
,
2249 extract_bit_field (src_word
, bitsize
,
2250 bitpos
% BITS_PER_WORD
, 1, false,
2251 NULL_RTX
, word_mode
, word_mode
));
2254 if (mode
== BLKmode
)
2256 /* Find the smallest integer mode large enough to hold the
2257 entire structure. */
2258 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2260 mode
= GET_MODE_WIDER_MODE (mode
))
2261 /* Have we found a large enough mode? */
2262 if (GET_MODE_SIZE (mode
) >= bytes
)
2265 /* A suitable mode should have been found. */
2266 gcc_assert (mode
!= VOIDmode
);
2269 if (GET_MODE_SIZE (mode
) < GET_MODE_SIZE (word_mode
))
2270 dst_mode
= word_mode
;
2273 dst
= gen_reg_rtx (dst_mode
);
2275 for (i
= 0; i
< n_regs
; i
++)
2276 emit_move_insn (operand_subword (dst
, i
, 0, dst_mode
), dst_words
[i
]);
2278 if (mode
!= dst_mode
)
2279 dst
= gen_lowpart (mode
, dst
);
2284 /* Add a USE expression for REG to the (possibly empty) list pointed
2285 to by CALL_FUSAGE. REG must denote a hard register. */
2288 use_reg_mode (rtx
*call_fusage
, rtx reg
, enum machine_mode mode
)
2290 gcc_assert (REG_P (reg
) && REGNO (reg
) < FIRST_PSEUDO_REGISTER
);
2293 = gen_rtx_EXPR_LIST (mode
, gen_rtx_USE (VOIDmode
, reg
), *call_fusage
);
2296 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2297 starting at REGNO. All of these registers must be hard registers. */
2300 use_regs (rtx
*call_fusage
, int regno
, int nregs
)
2304 gcc_assert (regno
+ nregs
<= FIRST_PSEUDO_REGISTER
);
2306 for (i
= 0; i
< nregs
; i
++)
2307 use_reg (call_fusage
, regno_reg_rtx
[regno
+ i
]);
2310 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2311 PARALLEL REGS. This is for calls that pass values in multiple
2312 non-contiguous locations. The Irix 6 ABI has examples of this. */
2315 use_group_regs (rtx
*call_fusage
, rtx regs
)
2319 for (i
= 0; i
< XVECLEN (regs
, 0); i
++)
2321 rtx reg
= XEXP (XVECEXP (regs
, 0, i
), 0);
2323 /* A NULL entry means the parameter goes both on the stack and in
2324 registers. This can also be a MEM for targets that pass values
2325 partially on the stack and partially in registers. */
2326 if (reg
!= 0 && REG_P (reg
))
2327 use_reg (call_fusage
, reg
);
2331 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2332 assigment and the code of the expresion on the RHS is CODE. Return
2336 get_def_for_expr (tree name
, enum tree_code code
)
2340 if (TREE_CODE (name
) != SSA_NAME
)
2343 def_stmt
= get_gimple_for_ssa_name (name
);
2345 || gimple_assign_rhs_code (def_stmt
) != code
)
2352 /* Determine whether the LEN bytes generated by CONSTFUN can be
2353 stored to memory using several move instructions. CONSTFUNDATA is
2354 a pointer which will be passed as argument in every CONSTFUN call.
2355 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2356 a memset operation and false if it's a copy of a constant string.
2357 Return nonzero if a call to store_by_pieces should succeed. */
2360 can_store_by_pieces (unsigned HOST_WIDE_INT len
,
2361 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
),
2362 void *constfundata
, unsigned int align
, bool memsetp
)
2364 unsigned HOST_WIDE_INT l
;
2365 unsigned int max_size
;
2366 HOST_WIDE_INT offset
= 0;
2367 enum machine_mode mode
;
2368 enum insn_code icode
;
2370 /* cst is set but not used if LEGITIMATE_CONSTANT doesn't use it. */
2371 rtx cst ATTRIBUTE_UNUSED
;
2377 ? SET_BY_PIECES_P (len
, align
)
2378 : STORE_BY_PIECES_P (len
, align
)))
2381 align
= alignment_for_piecewise_move (STORE_MAX_PIECES
, align
);
2383 /* We would first store what we can in the largest integer mode, then go to
2384 successively smaller modes. */
2387 reverse
<= (HAVE_PRE_DECREMENT
|| HAVE_POST_DECREMENT
);
2391 max_size
= STORE_MAX_PIECES
+ 1;
2392 while (max_size
> 1)
2394 mode
= widest_int_mode_for_size (max_size
);
2396 if (mode
== VOIDmode
)
2399 icode
= optab_handler (mov_optab
, mode
);
2400 if (icode
!= CODE_FOR_nothing
2401 && align
>= GET_MODE_ALIGNMENT (mode
))
2403 unsigned int size
= GET_MODE_SIZE (mode
);
2410 cst
= (*constfun
) (constfundata
, offset
, mode
);
2411 if (!targetm
.legitimate_constant_p (mode
, cst
))
2421 max_size
= GET_MODE_SIZE (mode
);
2424 /* The code above should have handled everything. */
2431 /* Generate several move instructions to store LEN bytes generated by
2432 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2433 pointer which will be passed as argument in every CONSTFUN call.
2434 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2435 a memset operation and false if it's a copy of a constant string.
2436 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2437 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2441 store_by_pieces (rtx to
, unsigned HOST_WIDE_INT len
,
2442 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
),
2443 void *constfundata
, unsigned int align
, bool memsetp
, int endp
)
2445 enum machine_mode to_addr_mode
2446 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (to
));
2447 struct store_by_pieces_d data
;
2451 gcc_assert (endp
!= 2);
2456 ? SET_BY_PIECES_P (len
, align
)
2457 : STORE_BY_PIECES_P (len
, align
));
2458 data
.constfun
= constfun
;
2459 data
.constfundata
= constfundata
;
2462 store_by_pieces_1 (&data
, align
);
2467 gcc_assert (!data
.reverse
);
2472 if (HAVE_POST_INCREMENT
&& data
.explicit_inc_to
> 0)
2473 emit_insn (gen_add2_insn (data
.to_addr
, constm1_rtx
));
2475 data
.to_addr
= copy_to_mode_reg (to_addr_mode
,
2476 plus_constant (data
.to_addr
,
2479 to1
= adjust_automodify_address (data
.to
, QImode
, data
.to_addr
,
2486 to1
= adjust_address (data
.to
, QImode
, data
.offset
);
2494 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2495 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2498 clear_by_pieces (rtx to
, unsigned HOST_WIDE_INT len
, unsigned int align
)
2500 struct store_by_pieces_d data
;
2505 data
.constfun
= clear_by_pieces_1
;
2506 data
.constfundata
= NULL
;
2509 store_by_pieces_1 (&data
, align
);
2512 /* Callback routine for clear_by_pieces.
2513 Return const0_rtx unconditionally. */
2516 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED
,
2517 HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
2518 enum machine_mode mode ATTRIBUTE_UNUSED
)
2523 /* Subroutine of clear_by_pieces and store_by_pieces.
2524 Generate several move instructions to store LEN bytes of block TO. (A MEM
2525 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2528 store_by_pieces_1 (struct store_by_pieces_d
*data ATTRIBUTE_UNUSED
,
2529 unsigned int align ATTRIBUTE_UNUSED
)
2531 enum machine_mode to_addr_mode
2532 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (data
->to
));
2533 rtx to_addr
= XEXP (data
->to
, 0);
2534 unsigned int max_size
= STORE_MAX_PIECES
+ 1;
2535 enum insn_code icode
;
2538 data
->to_addr
= to_addr
;
2540 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
2541 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
2543 data
->explicit_inc_to
= 0;
2545 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
2547 data
->offset
= data
->len
;
2549 /* If storing requires more than two move insns,
2550 copy addresses to registers (to make displacements shorter)
2551 and use post-increment if available. */
2552 if (!data
->autinc_to
2553 && move_by_pieces_ninsns (data
->len
, align
, max_size
) > 2)
2555 /* Determine the main mode we'll be using.
2556 MODE might not be used depending on the definitions of the
2557 USE_* macros below. */
2558 enum machine_mode mode ATTRIBUTE_UNUSED
2559 = widest_int_mode_for_size (max_size
);
2561 if (USE_STORE_PRE_DECREMENT (mode
) && data
->reverse
&& ! data
->autinc_to
)
2563 data
->to_addr
= copy_to_mode_reg (to_addr_mode
,
2564 plus_constant (to_addr
, data
->len
));
2565 data
->autinc_to
= 1;
2566 data
->explicit_inc_to
= -1;
2569 if (USE_STORE_POST_INCREMENT (mode
) && ! data
->reverse
2570 && ! data
->autinc_to
)
2572 data
->to_addr
= copy_to_mode_reg (to_addr_mode
, to_addr
);
2573 data
->autinc_to
= 1;
2574 data
->explicit_inc_to
= 1;
2577 if ( !data
->autinc_to
&& CONSTANT_P (to_addr
))
2578 data
->to_addr
= copy_to_mode_reg (to_addr_mode
, to_addr
);
2581 align
= alignment_for_piecewise_move (STORE_MAX_PIECES
, align
);
2583 /* First store what we can in the largest integer mode, then go to
2584 successively smaller modes. */
2586 while (max_size
> 1)
2588 enum machine_mode mode
= widest_int_mode_for_size (max_size
);
2590 if (mode
== VOIDmode
)
2593 icode
= optab_handler (mov_optab
, mode
);
2594 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
2595 store_by_pieces_2 (GEN_FCN (icode
), mode
, data
);
2597 max_size
= GET_MODE_SIZE (mode
);
2600 /* The code above should have handled everything. */
2601 gcc_assert (!data
->len
);
2604 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2605 with move instructions for mode MODE. GENFUN is the gen_... function
2606 to make a move insn for that mode. DATA has all the other info. */
2609 store_by_pieces_2 (rtx (*genfun
) (rtx
, ...), enum machine_mode mode
,
2610 struct store_by_pieces_d
*data
)
2612 unsigned int size
= GET_MODE_SIZE (mode
);
2615 while (data
->len
>= size
)
2618 data
->offset
-= size
;
2620 if (data
->autinc_to
)
2621 to1
= adjust_automodify_address (data
->to
, mode
, data
->to_addr
,
2624 to1
= adjust_address (data
->to
, mode
, data
->offset
);
2626 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
2627 emit_insn (gen_add2_insn (data
->to_addr
,
2628 GEN_INT (-(HOST_WIDE_INT
) size
)));
2630 cst
= (*data
->constfun
) (data
->constfundata
, data
->offset
, mode
);
2631 emit_insn ((*genfun
) (to1
, cst
));
2633 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
2634 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (size
)));
2636 if (! data
->reverse
)
2637 data
->offset
+= size
;
2643 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2644 its length in bytes. */
2647 clear_storage_hints (rtx object
, rtx size
, enum block_op_methods method
,
2648 unsigned int expected_align
, HOST_WIDE_INT expected_size
)
2650 enum machine_mode mode
= GET_MODE (object
);
2653 gcc_assert (method
== BLOCK_OP_NORMAL
|| method
== BLOCK_OP_TAILCALL
);
2655 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2656 just move a zero. Otherwise, do this a piece at a time. */
2658 && CONST_INT_P (size
)
2659 && INTVAL (size
) == (HOST_WIDE_INT
) GET_MODE_SIZE (mode
))
2661 rtx zero
= CONST0_RTX (mode
);
2664 emit_move_insn (object
, zero
);
2668 if (COMPLEX_MODE_P (mode
))
2670 zero
= CONST0_RTX (GET_MODE_INNER (mode
));
2673 write_complex_part (object
, zero
, 0);
2674 write_complex_part (object
, zero
, 1);
2680 if (size
== const0_rtx
)
2683 align
= MEM_ALIGN (object
);
2685 if (CONST_INT_P (size
)
2686 && CLEAR_BY_PIECES_P (INTVAL (size
), align
))
2687 clear_by_pieces (object
, INTVAL (size
), align
);
2688 else if (set_storage_via_setmem (object
, size
, const0_rtx
, align
,
2689 expected_align
, expected_size
))
2691 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object
)))
2692 return set_storage_via_libcall (object
, size
, const0_rtx
,
2693 method
== BLOCK_OP_TAILCALL
);
2701 clear_storage (rtx object
, rtx size
, enum block_op_methods method
)
2703 return clear_storage_hints (object
, size
, method
, 0, -1);
2707 /* A subroutine of clear_storage. Expand a call to memset.
2708 Return the return value of memset, 0 otherwise. */
2711 set_storage_via_libcall (rtx object
, rtx size
, rtx val
, bool tailcall
)
2713 tree call_expr
, fn
, object_tree
, size_tree
, val_tree
;
2714 enum machine_mode size_mode
;
2717 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2718 place those into new pseudos into a VAR_DECL and use them later. */
2720 object
= copy_addr_to_reg (XEXP (object
, 0));
2722 size_mode
= TYPE_MODE (sizetype
);
2723 size
= convert_to_mode (size_mode
, size
, 1);
2724 size
= copy_to_mode_reg (size_mode
, size
);
2726 /* It is incorrect to use the libcall calling conventions to call
2727 memset in this context. This could be a user call to memset and
2728 the user may wish to examine the return value from memset. For
2729 targets where libcalls and normal calls have different conventions
2730 for returning pointers, we could end up generating incorrect code. */
2732 object_tree
= make_tree (ptr_type_node
, object
);
2733 if (!CONST_INT_P (val
))
2734 val
= convert_to_mode (TYPE_MODE (integer_type_node
), val
, 1);
2735 size_tree
= make_tree (sizetype
, size
);
2736 val_tree
= make_tree (integer_type_node
, val
);
2738 fn
= clear_storage_libcall_fn (true);
2739 call_expr
= build_call_expr (fn
, 3, object_tree
, val_tree
, size_tree
);
2740 CALL_EXPR_TAILCALL (call_expr
) = tailcall
;
2742 retval
= expand_normal (call_expr
);
2747 /* A subroutine of set_storage_via_libcall. Create the tree node
2748 for the function we use for block clears. */
2750 tree block_clear_fn
;
2753 init_block_clear_fn (const char *asmspec
)
2755 if (!block_clear_fn
)
2759 fn
= get_identifier ("memset");
2760 args
= build_function_type_list (ptr_type_node
, ptr_type_node
,
2761 integer_type_node
, sizetype
,
2764 fn
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, fn
, args
);
2765 DECL_EXTERNAL (fn
) = 1;
2766 TREE_PUBLIC (fn
) = 1;
2767 DECL_ARTIFICIAL (fn
) = 1;
2768 TREE_NOTHROW (fn
) = 1;
2769 DECL_VISIBILITY (fn
) = VISIBILITY_DEFAULT
;
2770 DECL_VISIBILITY_SPECIFIED (fn
) = 1;
2772 block_clear_fn
= fn
;
2776 set_user_assembler_name (block_clear_fn
, asmspec
);
2780 clear_storage_libcall_fn (int for_call
)
2782 static bool emitted_extern
;
2784 if (!block_clear_fn
)
2785 init_block_clear_fn (NULL
);
2787 if (for_call
&& !emitted_extern
)
2789 emitted_extern
= true;
2790 make_decl_rtl (block_clear_fn
);
2793 return block_clear_fn
;
2796 /* Expand a setmem pattern; return true if successful. */
2799 set_storage_via_setmem (rtx object
, rtx size
, rtx val
, unsigned int align
,
2800 unsigned int expected_align
, HOST_WIDE_INT expected_size
)
2802 /* Try the most limited insn first, because there's no point
2803 including more than one in the machine description unless
2804 the more limited one has some advantage. */
2806 enum machine_mode mode
;
2808 if (expected_align
< align
)
2809 expected_align
= align
;
2811 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
2812 mode
= GET_MODE_WIDER_MODE (mode
))
2814 enum insn_code code
= direct_optab_handler (setmem_optab
, mode
);
2816 if (code
!= CODE_FOR_nothing
2817 /* We don't need MODE to be narrower than
2818 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2819 the mode mask, as it is returned by the macro, it will
2820 definitely be less than the actual mode mask. */
2821 && ((CONST_INT_P (size
)
2822 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
2823 <= (GET_MODE_MASK (mode
) >> 1)))
2824 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
))
2826 struct expand_operand ops
[6];
2829 nops
= insn_data
[(int) code
].n_generator_args
;
2830 gcc_assert (nops
== 4 || nops
== 6);
2832 create_fixed_operand (&ops
[0], object
);
2833 /* The check above guarantees that this size conversion is valid. */
2834 create_convert_operand_to (&ops
[1], size
, mode
, true);
2835 create_convert_operand_from (&ops
[2], val
, byte_mode
, true);
2836 create_integer_operand (&ops
[3], align
/ BITS_PER_UNIT
);
2839 create_integer_operand (&ops
[4], expected_align
/ BITS_PER_UNIT
);
2840 create_integer_operand (&ops
[5], expected_size
);
2842 if (maybe_expand_insn (code
, nops
, ops
))
2851 /* Write to one of the components of the complex value CPLX. Write VAL to
2852 the real part if IMAG_P is false, and the imaginary part if its true. */
2855 write_complex_part (rtx cplx
, rtx val
, bool imag_p
)
2857 enum machine_mode cmode
;
2858 enum machine_mode imode
;
2861 if (GET_CODE (cplx
) == CONCAT
)
2863 emit_move_insn (XEXP (cplx
, imag_p
), val
);
2867 cmode
= GET_MODE (cplx
);
2868 imode
= GET_MODE_INNER (cmode
);
2869 ibitsize
= GET_MODE_BITSIZE (imode
);
2871 /* For MEMs simplify_gen_subreg may generate an invalid new address
2872 because, e.g., the original address is considered mode-dependent
2873 by the target, which restricts simplify_subreg from invoking
2874 adjust_address_nv. Instead of preparing fallback support for an
2875 invalid address, we call adjust_address_nv directly. */
2878 emit_move_insn (adjust_address_nv (cplx
, imode
,
2879 imag_p
? GET_MODE_SIZE (imode
) : 0),
2884 /* If the sub-object is at least word sized, then we know that subregging
2885 will work. This special case is important, since store_bit_field
2886 wants to operate on integer modes, and there's rarely an OImode to
2887 correspond to TCmode. */
2888 if (ibitsize
>= BITS_PER_WORD
2889 /* For hard regs we have exact predicates. Assume we can split
2890 the original object if it spans an even number of hard regs.
2891 This special case is important for SCmode on 64-bit platforms
2892 where the natural size of floating-point regs is 32-bit. */
2894 && REGNO (cplx
) < FIRST_PSEUDO_REGISTER
2895 && hard_regno_nregs
[REGNO (cplx
)][cmode
] % 2 == 0))
2897 rtx part
= simplify_gen_subreg (imode
, cplx
, cmode
,
2898 imag_p
? GET_MODE_SIZE (imode
) : 0);
2901 emit_move_insn (part
, val
);
2905 /* simplify_gen_subreg may fail for sub-word MEMs. */
2906 gcc_assert (MEM_P (cplx
) && ibitsize
< BITS_PER_WORD
);
2909 store_bit_field (cplx
, ibitsize
, imag_p
? ibitsize
: 0, 0, 0, imode
, val
);
2912 /* Extract one of the components of the complex value CPLX. Extract the
2913 real part if IMAG_P is false, and the imaginary part if it's true. */
2916 read_complex_part (rtx cplx
, bool imag_p
)
2918 enum machine_mode cmode
, imode
;
2921 if (GET_CODE (cplx
) == CONCAT
)
2922 return XEXP (cplx
, imag_p
);
2924 cmode
= GET_MODE (cplx
);
2925 imode
= GET_MODE_INNER (cmode
);
2926 ibitsize
= GET_MODE_BITSIZE (imode
);
2928 /* Special case reads from complex constants that got spilled to memory. */
2929 if (MEM_P (cplx
) && GET_CODE (XEXP (cplx
, 0)) == SYMBOL_REF
)
2931 tree decl
= SYMBOL_REF_DECL (XEXP (cplx
, 0));
2932 if (decl
&& TREE_CODE (decl
) == COMPLEX_CST
)
2934 tree part
= imag_p
? TREE_IMAGPART (decl
) : TREE_REALPART (decl
);
2935 if (CONSTANT_CLASS_P (part
))
2936 return expand_expr (part
, NULL_RTX
, imode
, EXPAND_NORMAL
);
2940 /* For MEMs simplify_gen_subreg may generate an invalid new address
2941 because, e.g., the original address is considered mode-dependent
2942 by the target, which restricts simplify_subreg from invoking
2943 adjust_address_nv. Instead of preparing fallback support for an
2944 invalid address, we call adjust_address_nv directly. */
2946 return adjust_address_nv (cplx
, imode
,
2947 imag_p
? GET_MODE_SIZE (imode
) : 0);
2949 /* If the sub-object is at least word sized, then we know that subregging
2950 will work. This special case is important, since extract_bit_field
2951 wants to operate on integer modes, and there's rarely an OImode to
2952 correspond to TCmode. */
2953 if (ibitsize
>= BITS_PER_WORD
2954 /* For hard regs we have exact predicates. Assume we can split
2955 the original object if it spans an even number of hard regs.
2956 This special case is important for SCmode on 64-bit platforms
2957 where the natural size of floating-point regs is 32-bit. */
2959 && REGNO (cplx
) < FIRST_PSEUDO_REGISTER
2960 && hard_regno_nregs
[REGNO (cplx
)][cmode
] % 2 == 0))
2962 rtx ret
= simplify_gen_subreg (imode
, cplx
, cmode
,
2963 imag_p
? GET_MODE_SIZE (imode
) : 0);
2967 /* simplify_gen_subreg may fail for sub-word MEMs. */
2968 gcc_assert (MEM_P (cplx
) && ibitsize
< BITS_PER_WORD
);
2971 return extract_bit_field (cplx
, ibitsize
, imag_p
? ibitsize
: 0,
2972 true, false, NULL_RTX
, imode
, imode
);
2975 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2976 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2977 represented in NEW_MODE. If FORCE is true, this will never happen, as
2978 we'll force-create a SUBREG if needed. */
2981 emit_move_change_mode (enum machine_mode new_mode
,
2982 enum machine_mode old_mode
, rtx x
, bool force
)
2986 if (push_operand (x
, GET_MODE (x
)))
2988 ret
= gen_rtx_MEM (new_mode
, XEXP (x
, 0));
2989 MEM_COPY_ATTRIBUTES (ret
, x
);
2993 /* We don't have to worry about changing the address since the
2994 size in bytes is supposed to be the same. */
2995 if (reload_in_progress
)
2997 /* Copy the MEM to change the mode and move any
2998 substitutions from the old MEM to the new one. */
2999 ret
= adjust_address_nv (x
, new_mode
, 0);
3000 copy_replacements (x
, ret
);
3003 ret
= adjust_address (x
, new_mode
, 0);
3007 /* Note that we do want simplify_subreg's behavior of validating
3008 that the new mode is ok for a hard register. If we were to use
3009 simplify_gen_subreg, we would create the subreg, but would
3010 probably run into the target not being able to implement it. */
3011 /* Except, of course, when FORCE is true, when this is exactly what
3012 we want. Which is needed for CCmodes on some targets. */
3014 ret
= simplify_gen_subreg (new_mode
, x
, old_mode
, 0);
3016 ret
= simplify_subreg (new_mode
, x
, old_mode
, 0);
3022 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
3023 an integer mode of the same size as MODE. Returns the instruction
3024 emitted, or NULL if such a move could not be generated. */
3027 emit_move_via_integer (enum machine_mode mode
, rtx x
, rtx y
, bool force
)
3029 enum machine_mode imode
;
3030 enum insn_code code
;
3032 /* There must exist a mode of the exact size we require. */
3033 imode
= int_mode_for_mode (mode
);
3034 if (imode
== BLKmode
)
3037 /* The target must support moves in this mode. */
3038 code
= optab_handler (mov_optab
, imode
);
3039 if (code
== CODE_FOR_nothing
)
3042 x
= emit_move_change_mode (imode
, mode
, x
, force
);
3045 y
= emit_move_change_mode (imode
, mode
, y
, force
);
3048 return emit_insn (GEN_FCN (code
) (x
, y
));
3051 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
3052 Return an equivalent MEM that does not use an auto-increment. */
3055 emit_move_resolve_push (enum machine_mode mode
, rtx x
)
3057 enum rtx_code code
= GET_CODE (XEXP (x
, 0));
3058 HOST_WIDE_INT adjust
;
3061 adjust
= GET_MODE_SIZE (mode
);
3062 #ifdef PUSH_ROUNDING
3063 adjust
= PUSH_ROUNDING (adjust
);
3065 if (code
== PRE_DEC
|| code
== POST_DEC
)
3067 else if (code
== PRE_MODIFY
|| code
== POST_MODIFY
)
3069 rtx expr
= XEXP (XEXP (x
, 0), 1);
3072 gcc_assert (GET_CODE (expr
) == PLUS
|| GET_CODE (expr
) == MINUS
);
3073 gcc_assert (CONST_INT_P (XEXP (expr
, 1)));
3074 val
= INTVAL (XEXP (expr
, 1));
3075 if (GET_CODE (expr
) == MINUS
)
3077 gcc_assert (adjust
== val
|| adjust
== -val
);
3081 /* Do not use anti_adjust_stack, since we don't want to update
3082 stack_pointer_delta. */
3083 temp
= expand_simple_binop (Pmode
, PLUS
, stack_pointer_rtx
,
3084 GEN_INT (adjust
), stack_pointer_rtx
,
3085 0, OPTAB_LIB_WIDEN
);
3086 if (temp
!= stack_pointer_rtx
)
3087 emit_move_insn (stack_pointer_rtx
, temp
);
3094 temp
= stack_pointer_rtx
;
3099 temp
= plus_constant (stack_pointer_rtx
, -adjust
);
3105 return replace_equiv_address (x
, temp
);
3108 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3109 X is known to satisfy push_operand, and MODE is known to be complex.
3110 Returns the last instruction emitted. */
3113 emit_move_complex_push (enum machine_mode mode
, rtx x
, rtx y
)
3115 enum machine_mode submode
= GET_MODE_INNER (mode
);
3118 #ifdef PUSH_ROUNDING
3119 unsigned int submodesize
= GET_MODE_SIZE (submode
);
3121 /* In case we output to the stack, but the size is smaller than the
3122 machine can push exactly, we need to use move instructions. */
3123 if (PUSH_ROUNDING (submodesize
) != submodesize
)
3125 x
= emit_move_resolve_push (mode
, x
);
3126 return emit_move_insn (x
, y
);
3130 /* Note that the real part always precedes the imag part in memory
3131 regardless of machine's endianness. */
3132 switch (GET_CODE (XEXP (x
, 0)))
3146 emit_move_insn (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3147 read_complex_part (y
, imag_first
));
3148 return emit_move_insn (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3149 read_complex_part (y
, !imag_first
));
3152 /* A subroutine of emit_move_complex. Perform the move from Y to X
3153 via two moves of the parts. Returns the last instruction emitted. */
3156 emit_move_complex_parts (rtx x
, rtx y
)
3158 /* Show the output dies here. This is necessary for SUBREGs
3159 of pseudos since we cannot track their lifetimes correctly;
3160 hard regs shouldn't appear here except as return values. */
3161 if (!reload_completed
&& !reload_in_progress
3162 && REG_P (x
) && !reg_overlap_mentioned_p (x
, y
))
3165 write_complex_part (x
, read_complex_part (y
, false), false);
3166 write_complex_part (x
, read_complex_part (y
, true), true);
3168 return get_last_insn ();
3171 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3172 MODE is known to be complex. Returns the last instruction emitted. */
3175 emit_move_complex (enum machine_mode mode
, rtx x
, rtx y
)
3179 /* Need to take special care for pushes, to maintain proper ordering
3180 of the data, and possibly extra padding. */
3181 if (push_operand (x
, mode
))
3182 return emit_move_complex_push (mode
, x
, y
);
3184 /* See if we can coerce the target into moving both values at once. */
3186 /* Move floating point as parts. */
3187 if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
3188 && optab_handler (mov_optab
, GET_MODE_INNER (mode
)) != CODE_FOR_nothing
)
3190 /* Not possible if the values are inherently not adjacent. */
3191 else if (GET_CODE (x
) == CONCAT
|| GET_CODE (y
) == CONCAT
)
3193 /* Is possible if both are registers (or subregs of registers). */
3194 else if (register_operand (x
, mode
) && register_operand (y
, mode
))
3196 /* If one of the operands is a memory, and alignment constraints
3197 are friendly enough, we may be able to do combined memory operations.
3198 We do not attempt this if Y is a constant because that combination is
3199 usually better with the by-parts thing below. */
3200 else if ((MEM_P (x
) ? !CONSTANT_P (y
) : MEM_P (y
))
3201 && (!STRICT_ALIGNMENT
3202 || get_mode_alignment (mode
) == BIGGEST_ALIGNMENT
))
3211 /* For memory to memory moves, optimal behavior can be had with the
3212 existing block move logic. */
3213 if (MEM_P (x
) && MEM_P (y
))
3215 emit_block_move (x
, y
, GEN_INT (GET_MODE_SIZE (mode
)),
3216 BLOCK_OP_NO_LIBCALL
);
3217 return get_last_insn ();
3220 ret
= emit_move_via_integer (mode
, x
, y
, true);
3225 return emit_move_complex_parts (x
, y
);
3228 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3229 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3232 emit_move_ccmode (enum machine_mode mode
, rtx x
, rtx y
)
3236 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3239 enum insn_code code
= optab_handler (mov_optab
, CCmode
);
3240 if (code
!= CODE_FOR_nothing
)
3242 x
= emit_move_change_mode (CCmode
, mode
, x
, true);
3243 y
= emit_move_change_mode (CCmode
, mode
, y
, true);
3244 return emit_insn (GEN_FCN (code
) (x
, y
));
3248 /* Otherwise, find the MODE_INT mode of the same width. */
3249 ret
= emit_move_via_integer (mode
, x
, y
, false);
3250 gcc_assert (ret
!= NULL
);
3254 /* Return true if word I of OP lies entirely in the
3255 undefined bits of a paradoxical subreg. */
3258 undefined_operand_subword_p (const_rtx op
, int i
)
3260 enum machine_mode innermode
, innermostmode
;
3262 if (GET_CODE (op
) != SUBREG
)
3264 innermode
= GET_MODE (op
);
3265 innermostmode
= GET_MODE (SUBREG_REG (op
));
3266 offset
= i
* UNITS_PER_WORD
+ SUBREG_BYTE (op
);
3267 /* The SUBREG_BYTE represents offset, as if the value were stored in
3268 memory, except for a paradoxical subreg where we define
3269 SUBREG_BYTE to be 0; undo this exception as in
3271 if (SUBREG_BYTE (op
) == 0
3272 && GET_MODE_SIZE (innermostmode
) < GET_MODE_SIZE (innermode
))
3274 int difference
= (GET_MODE_SIZE (innermostmode
) - GET_MODE_SIZE (innermode
));
3275 if (WORDS_BIG_ENDIAN
)
3276 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3277 if (BYTES_BIG_ENDIAN
)
3278 offset
+= difference
% UNITS_PER_WORD
;
3280 if (offset
>= GET_MODE_SIZE (innermostmode
)
3281 || offset
<= -GET_MODE_SIZE (word_mode
))
3286 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3287 MODE is any multi-word or full-word mode that lacks a move_insn
3288 pattern. Note that you will get better code if you define such
3289 patterns, even if they must turn into multiple assembler instructions. */
3292 emit_move_multi_word (enum machine_mode mode
, rtx x
, rtx y
)
3299 gcc_assert (GET_MODE_SIZE (mode
) >= UNITS_PER_WORD
);
3301 /* If X is a push on the stack, do the push now and replace
3302 X with a reference to the stack pointer. */
3303 if (push_operand (x
, mode
))
3304 x
= emit_move_resolve_push (mode
, x
);
3306 /* If we are in reload, see if either operand is a MEM whose address
3307 is scheduled for replacement. */
3308 if (reload_in_progress
&& MEM_P (x
)
3309 && (inner
= find_replacement (&XEXP (x
, 0))) != XEXP (x
, 0))
3310 x
= replace_equiv_address_nv (x
, inner
);
3311 if (reload_in_progress
&& MEM_P (y
)
3312 && (inner
= find_replacement (&XEXP (y
, 0))) != XEXP (y
, 0))
3313 y
= replace_equiv_address_nv (y
, inner
);
3317 need_clobber
= false;
3319 i
< (GET_MODE_SIZE (mode
) + (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
3322 rtx xpart
= operand_subword (x
, i
, 1, mode
);
3325 /* Do not generate code for a move if it would come entirely
3326 from the undefined bits of a paradoxical subreg. */
3327 if (undefined_operand_subword_p (y
, i
))
3330 ypart
= operand_subword (y
, i
, 1, mode
);
3332 /* If we can't get a part of Y, put Y into memory if it is a
3333 constant. Otherwise, force it into a register. Then we must
3334 be able to get a part of Y. */
3335 if (ypart
== 0 && CONSTANT_P (y
))
3337 y
= use_anchored_address (force_const_mem (mode
, y
));
3338 ypart
= operand_subword (y
, i
, 1, mode
);
3340 else if (ypart
== 0)
3341 ypart
= operand_subword_force (y
, i
, mode
);
3343 gcc_assert (xpart
&& ypart
);
3345 need_clobber
|= (GET_CODE (xpart
) == SUBREG
);
3347 last_insn
= emit_move_insn (xpart
, ypart
);
3353 /* Show the output dies here. This is necessary for SUBREGs
3354 of pseudos since we cannot track their lifetimes correctly;
3355 hard regs shouldn't appear here except as return values.
3356 We never want to emit such a clobber after reload. */
3358 && ! (reload_in_progress
|| reload_completed
)
3359 && need_clobber
!= 0)
3367 /* Low level part of emit_move_insn.
3368 Called just like emit_move_insn, but assumes X and Y
3369 are basically valid. */
3372 emit_move_insn_1 (rtx x
, rtx y
)
3374 enum machine_mode mode
= GET_MODE (x
);
3375 enum insn_code code
;
3377 gcc_assert ((unsigned int) mode
< (unsigned int) MAX_MACHINE_MODE
);
3379 code
= optab_handler (mov_optab
, mode
);
3380 if (code
!= CODE_FOR_nothing
)
3381 return emit_insn (GEN_FCN (code
) (x
, y
));
3383 /* Expand complex moves by moving real part and imag part. */
3384 if (COMPLEX_MODE_P (mode
))
3385 return emit_move_complex (mode
, x
, y
);
3387 if (GET_MODE_CLASS (mode
) == MODE_DECIMAL_FLOAT
3388 || ALL_FIXED_POINT_MODE_P (mode
))
3390 rtx result
= emit_move_via_integer (mode
, x
, y
, true);
3392 /* If we can't find an integer mode, use multi words. */
3396 return emit_move_multi_word (mode
, x
, y
);
3399 if (GET_MODE_CLASS (mode
) == MODE_CC
)
3400 return emit_move_ccmode (mode
, x
, y
);
3402 /* Try using a move pattern for the corresponding integer mode. This is
3403 only safe when simplify_subreg can convert MODE constants into integer
3404 constants. At present, it can only do this reliably if the value
3405 fits within a HOST_WIDE_INT. */
3406 if (!CONSTANT_P (y
) || GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
)
3408 rtx ret
= emit_move_via_integer (mode
, x
, y
, false);
3413 return emit_move_multi_word (mode
, x
, y
);
3416 /* Generate code to copy Y into X.
3417 Both Y and X must have the same mode, except that
3418 Y can be a constant with VOIDmode.
3419 This mode cannot be BLKmode; use emit_block_move for that.
3421 Return the last instruction emitted. */
3424 emit_move_insn (rtx x
, rtx y
)
3426 enum machine_mode mode
= GET_MODE (x
);
3427 rtx y_cst
= NULL_RTX
;
3430 gcc_assert (mode
!= BLKmode
3431 && (GET_MODE (y
) == mode
|| GET_MODE (y
) == VOIDmode
));
3436 && SCALAR_FLOAT_MODE_P (GET_MODE (x
))
3437 && (last_insn
= compress_float_constant (x
, y
)))
3442 if (!targetm
.legitimate_constant_p (mode
, y
))
3444 y
= force_const_mem (mode
, y
);
3446 /* If the target's cannot_force_const_mem prevented the spill,
3447 assume that the target's move expanders will also take care
3448 of the non-legitimate constant. */
3452 y
= use_anchored_address (y
);
3456 /* If X or Y are memory references, verify that their addresses are valid
3459 && (! memory_address_addr_space_p (GET_MODE (x
), XEXP (x
, 0),
3461 && ! push_operand (x
, GET_MODE (x
))))
3462 x
= validize_mem (x
);
3465 && ! memory_address_addr_space_p (GET_MODE (y
), XEXP (y
, 0),
3466 MEM_ADDR_SPACE (y
)))
3467 y
= validize_mem (y
);
3469 gcc_assert (mode
!= BLKmode
);
3471 last_insn
= emit_move_insn_1 (x
, y
);
3473 if (y_cst
&& REG_P (x
)
3474 && (set
= single_set (last_insn
)) != NULL_RTX
3475 && SET_DEST (set
) == x
3476 && ! rtx_equal_p (y_cst
, SET_SRC (set
)))
3477 set_unique_reg_note (last_insn
, REG_EQUAL
, copy_rtx (y_cst
));
3482 /* If Y is representable exactly in a narrower mode, and the target can
3483 perform the extension directly from constant or memory, then emit the
3484 move as an extension. */
3487 compress_float_constant (rtx x
, rtx y
)
3489 enum machine_mode dstmode
= GET_MODE (x
);
3490 enum machine_mode orig_srcmode
= GET_MODE (y
);
3491 enum machine_mode srcmode
;
3493 int oldcost
, newcost
;
3494 bool speed
= optimize_insn_for_speed_p ();
3496 REAL_VALUE_FROM_CONST_DOUBLE (r
, y
);
3498 if (targetm
.legitimate_constant_p (dstmode
, y
))
3499 oldcost
= set_src_cost (y
, speed
);
3501 oldcost
= set_src_cost (force_const_mem (dstmode
, y
), speed
);
3503 for (srcmode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode
));
3504 srcmode
!= orig_srcmode
;
3505 srcmode
= GET_MODE_WIDER_MODE (srcmode
))
3508 rtx trunc_y
, last_insn
;
3510 /* Skip if the target can't extend this way. */
3511 ic
= can_extend_p (dstmode
, srcmode
, 0);
3512 if (ic
== CODE_FOR_nothing
)
3515 /* Skip if the narrowed value isn't exact. */
3516 if (! exact_real_truncate (srcmode
, &r
))
3519 trunc_y
= CONST_DOUBLE_FROM_REAL_VALUE (r
, srcmode
);
3521 if (targetm
.legitimate_constant_p (srcmode
, trunc_y
))
3523 /* Skip if the target needs extra instructions to perform
3525 if (!insn_operand_matches (ic
, 1, trunc_y
))
3527 /* This is valid, but may not be cheaper than the original. */
3528 newcost
= set_src_cost (gen_rtx_FLOAT_EXTEND (dstmode
, trunc_y
),
3530 if (oldcost
< newcost
)
3533 else if (float_extend_from_mem
[dstmode
][srcmode
])
3535 trunc_y
= force_const_mem (srcmode
, trunc_y
);
3536 /* This is valid, but may not be cheaper than the original. */
3537 newcost
= set_src_cost (gen_rtx_FLOAT_EXTEND (dstmode
, trunc_y
),
3539 if (oldcost
< newcost
)
3541 trunc_y
= validize_mem (trunc_y
);
3546 /* For CSE's benefit, force the compressed constant pool entry
3547 into a new pseudo. This constant may be used in different modes,
3548 and if not, combine will put things back together for us. */
3549 trunc_y
= force_reg (srcmode
, trunc_y
);
3550 emit_unop_insn (ic
, x
, trunc_y
, UNKNOWN
);
3551 last_insn
= get_last_insn ();
3554 set_unique_reg_note (last_insn
, REG_EQUAL
, y
);
3562 /* Pushing data onto the stack. */
3564 /* Push a block of length SIZE (perhaps variable)
3565 and return an rtx to address the beginning of the block.
3566 The value may be virtual_outgoing_args_rtx.
3568 EXTRA is the number of bytes of padding to push in addition to SIZE.
3569 BELOW nonzero means this padding comes at low addresses;
3570 otherwise, the padding comes at high addresses. */
3573 push_block (rtx size
, int extra
, int below
)
3577 size
= convert_modes (Pmode
, ptr_mode
, size
, 1);
3578 if (CONSTANT_P (size
))
3579 anti_adjust_stack (plus_constant (size
, extra
));
3580 else if (REG_P (size
) && extra
== 0)
3581 anti_adjust_stack (size
);
3584 temp
= copy_to_mode_reg (Pmode
, size
);
3586 temp
= expand_binop (Pmode
, add_optab
, temp
, GEN_INT (extra
),
3587 temp
, 0, OPTAB_LIB_WIDEN
);
3588 anti_adjust_stack (temp
);
3591 #ifndef STACK_GROWS_DOWNWARD
3597 temp
= virtual_outgoing_args_rtx
;
3598 if (extra
!= 0 && below
)
3599 temp
= plus_constant (temp
, extra
);
3603 if (CONST_INT_P (size
))
3604 temp
= plus_constant (virtual_outgoing_args_rtx
,
3605 -INTVAL (size
) - (below
? 0 : extra
));
3606 else if (extra
!= 0 && !below
)
3607 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
3608 negate_rtx (Pmode
, plus_constant (size
, extra
)));
3610 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
3611 negate_rtx (Pmode
, size
));
3614 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT
), temp
);
3617 /* A utility routine that returns the base of an auto-inc memory, or NULL. */
3620 mem_autoinc_base (rtx mem
)
3624 rtx addr
= XEXP (mem
, 0);
3625 if (GET_RTX_CLASS (GET_CODE (addr
)) == RTX_AUTOINC
)
3626 return XEXP (addr
, 0);
3631 /* A utility routine used here, in reload, and in try_split. The insns
3632 after PREV up to and including LAST are known to adjust the stack,
3633 with a final value of END_ARGS_SIZE. Iterate backward from LAST
3634 placing notes as appropriate. PREV may be NULL, indicating the
3635 entire insn sequence prior to LAST should be scanned.
3637 The set of allowed stack pointer modifications is small:
3638 (1) One or more auto-inc style memory references (aka pushes),
3639 (2) One or more addition/subtraction with the SP as destination,
3640 (3) A single move insn with the SP as destination,
3641 (4) A call_pop insn,
3642 (5) Noreturn call insns if !ACCUMULATE_OUTGOING_ARGS.
3644 Insns in the sequence that do not modify the SP are ignored,
3645 except for noreturn calls.
3647 The return value is the amount of adjustment that can be trivially
3648 verified, via immediate operand or auto-inc. If the adjustment
3649 cannot be trivially extracted, the return value is INT_MIN. */
3652 find_args_size_adjust (rtx insn
)
3657 pat
= PATTERN (insn
);
3660 /* Look for a call_pop pattern. */
3663 /* We have to allow non-call_pop patterns for the case
3664 of emit_single_push_insn of a TLS address. */
3665 if (GET_CODE (pat
) != PARALLEL
)
3668 /* All call_pop have a stack pointer adjust in the parallel.
3669 The call itself is always first, and the stack adjust is
3670 usually last, so search from the end. */
3671 for (i
= XVECLEN (pat
, 0) - 1; i
> 0; --i
)
3673 set
= XVECEXP (pat
, 0, i
);
3674 if (GET_CODE (set
) != SET
)
3676 dest
= SET_DEST (set
);
3677 if (dest
== stack_pointer_rtx
)
3680 /* We'd better have found the stack pointer adjust. */
3683 /* Fall through to process the extracted SET and DEST
3684 as if it was a standalone insn. */
3686 else if (GET_CODE (pat
) == SET
)
3688 else if ((set
= single_set (insn
)) != NULL
)
3690 else if (GET_CODE (pat
) == PARALLEL
)
3692 /* ??? Some older ports use a parallel with a stack adjust
3693 and a store for a PUSH_ROUNDING pattern, rather than a
3694 PRE/POST_MODIFY rtx. Don't force them to update yet... */
3695 /* ??? See h8300 and m68k, pushqi1. */
3696 for (i
= XVECLEN (pat
, 0) - 1; i
>= 0; --i
)
3698 set
= XVECEXP (pat
, 0, i
);
3699 if (GET_CODE (set
) != SET
)
3701 dest
= SET_DEST (set
);
3702 if (dest
== stack_pointer_rtx
)
3705 /* We do not expect an auto-inc of the sp in the parallel. */
3706 gcc_checking_assert (mem_autoinc_base (dest
) != stack_pointer_rtx
);
3707 gcc_checking_assert (mem_autoinc_base (SET_SRC (set
))
3708 != stack_pointer_rtx
);
3716 dest
= SET_DEST (set
);
3718 /* Look for direct modifications of the stack pointer. */
3719 if (REG_P (dest
) && REGNO (dest
) == STACK_POINTER_REGNUM
)
3721 /* Look for a trivial adjustment, otherwise assume nothing. */
3722 /* Note that the SPU restore_stack_block pattern refers to
3723 the stack pointer in V4SImode. Consider that non-trivial. */
3724 if (SCALAR_INT_MODE_P (GET_MODE (dest
))
3725 && GET_CODE (SET_SRC (set
)) == PLUS
3726 && XEXP (SET_SRC (set
), 0) == stack_pointer_rtx
3727 && CONST_INT_P (XEXP (SET_SRC (set
), 1)))
3728 return INTVAL (XEXP (SET_SRC (set
), 1));
3729 /* ??? Reload can generate no-op moves, which will be cleaned
3730 up later. Recognize it and continue searching. */
3731 else if (rtx_equal_p (dest
, SET_SRC (set
)))
3734 return HOST_WIDE_INT_MIN
;
3740 /* Otherwise only think about autoinc patterns. */
3741 if (mem_autoinc_base (dest
) == stack_pointer_rtx
)
3744 gcc_checking_assert (mem_autoinc_base (SET_SRC (set
))
3745 != stack_pointer_rtx
);
3747 else if (mem_autoinc_base (SET_SRC (set
)) == stack_pointer_rtx
)
3748 mem
= SET_SRC (set
);
3752 addr
= XEXP (mem
, 0);
3753 switch (GET_CODE (addr
))
3757 return GET_MODE_SIZE (GET_MODE (mem
));
3760 return -GET_MODE_SIZE (GET_MODE (mem
));
3763 addr
= XEXP (addr
, 1);
3764 gcc_assert (GET_CODE (addr
) == PLUS
);
3765 gcc_assert (XEXP (addr
, 0) == stack_pointer_rtx
);
3766 gcc_assert (CONST_INT_P (XEXP (addr
, 1)));
3767 return INTVAL (XEXP (addr
, 1));
3775 fixup_args_size_notes (rtx prev
, rtx last
, int end_args_size
)
3777 int args_size
= end_args_size
;
3778 bool saw_unknown
= false;
3781 for (insn
= last
; insn
!= prev
; insn
= PREV_INSN (insn
))
3783 HOST_WIDE_INT this_delta
;
3785 if (!NONDEBUG_INSN_P (insn
))
3788 this_delta
= find_args_size_adjust (insn
);
3789 if (this_delta
== 0)
3792 || ACCUMULATE_OUTGOING_ARGS
3793 || find_reg_note (insn
, REG_NORETURN
, NULL_RTX
) == NULL_RTX
)
3797 gcc_assert (!saw_unknown
);
3798 if (this_delta
== HOST_WIDE_INT_MIN
)
3801 add_reg_note (insn
, REG_ARGS_SIZE
, GEN_INT (args_size
));
3802 #ifdef STACK_GROWS_DOWNWARD
3803 this_delta
= -this_delta
;
3805 args_size
-= this_delta
;
3808 return saw_unknown
? INT_MIN
: args_size
;
3811 #ifdef PUSH_ROUNDING
3812 /* Emit single push insn. */
3815 emit_single_push_insn_1 (enum machine_mode mode
, rtx x
, tree type
)
3818 unsigned rounded_size
= PUSH_ROUNDING (GET_MODE_SIZE (mode
));
3820 enum insn_code icode
;
3822 stack_pointer_delta
+= PUSH_ROUNDING (GET_MODE_SIZE (mode
));
3823 /* If there is push pattern, use it. Otherwise try old way of throwing
3824 MEM representing push operation to move expander. */
3825 icode
= optab_handler (push_optab
, mode
);
3826 if (icode
!= CODE_FOR_nothing
)
3828 struct expand_operand ops
[1];
3830 create_input_operand (&ops
[0], x
, mode
);
3831 if (maybe_expand_insn (icode
, 1, ops
))
3834 if (GET_MODE_SIZE (mode
) == rounded_size
)
3835 dest_addr
= gen_rtx_fmt_e (STACK_PUSH_CODE
, Pmode
, stack_pointer_rtx
);
3836 /* If we are to pad downward, adjust the stack pointer first and
3837 then store X into the stack location using an offset. This is
3838 because emit_move_insn does not know how to pad; it does not have
3840 else if (FUNCTION_ARG_PADDING (mode
, type
) == downward
)
3842 unsigned padding_size
= rounded_size
- GET_MODE_SIZE (mode
);
3843 HOST_WIDE_INT offset
;
3845 emit_move_insn (stack_pointer_rtx
,
3846 expand_binop (Pmode
,
3847 #ifdef STACK_GROWS_DOWNWARD
3853 GEN_INT (rounded_size
),
3854 NULL_RTX
, 0, OPTAB_LIB_WIDEN
));
3856 offset
= (HOST_WIDE_INT
) padding_size
;
3857 #ifdef STACK_GROWS_DOWNWARD
3858 if (STACK_PUSH_CODE
== POST_DEC
)
3859 /* We have already decremented the stack pointer, so get the
3861 offset
+= (HOST_WIDE_INT
) rounded_size
;
3863 if (STACK_PUSH_CODE
== POST_INC
)
3864 /* We have already incremented the stack pointer, so get the
3866 offset
-= (HOST_WIDE_INT
) rounded_size
;
3868 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
, GEN_INT (offset
));
3872 #ifdef STACK_GROWS_DOWNWARD
3873 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3874 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
3875 GEN_INT (-(HOST_WIDE_INT
) rounded_size
));
3877 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3878 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
3879 GEN_INT (rounded_size
));
3881 dest_addr
= gen_rtx_PRE_MODIFY (Pmode
, stack_pointer_rtx
, dest_addr
);
3884 dest
= gen_rtx_MEM (mode
, dest_addr
);
3888 set_mem_attributes (dest
, type
, 1);
3890 if (flag_optimize_sibling_calls
)
3891 /* Function incoming arguments may overlap with sibling call
3892 outgoing arguments and we cannot allow reordering of reads
3893 from function arguments with stores to outgoing arguments
3894 of sibling calls. */
3895 set_mem_alias_set (dest
, 0);
3897 emit_move_insn (dest
, x
);
3900 /* Emit and annotate a single push insn. */
3903 emit_single_push_insn (enum machine_mode mode
, rtx x
, tree type
)
3905 int delta
, old_delta
= stack_pointer_delta
;
3906 rtx prev
= get_last_insn ();
3909 emit_single_push_insn_1 (mode
, x
, type
);
3911 last
= get_last_insn ();
3913 /* Notice the common case where we emitted exactly one insn. */
3914 if (PREV_INSN (last
) == prev
)
3916 add_reg_note (last
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
3920 delta
= fixup_args_size_notes (prev
, last
, stack_pointer_delta
);
3921 gcc_assert (delta
== INT_MIN
|| delta
== old_delta
);
3925 /* Generate code to push X onto the stack, assuming it has mode MODE and
3927 MODE is redundant except when X is a CONST_INT (since they don't
3929 SIZE is an rtx for the size of data to be copied (in bytes),
3930 needed only if X is BLKmode.
3932 ALIGN (in bits) is maximum alignment we can assume.
3934 If PARTIAL and REG are both nonzero, then copy that many of the first
3935 bytes of X into registers starting with REG, and push the rest of X.
3936 The amount of space pushed is decreased by PARTIAL bytes.
3937 REG must be a hard register in this case.
3938 If REG is zero but PARTIAL is not, take any all others actions for an
3939 argument partially in registers, but do not actually load any
3942 EXTRA is the amount in bytes of extra space to leave next to this arg.
3943 This is ignored if an argument block has already been allocated.
3945 On a machine that lacks real push insns, ARGS_ADDR is the address of
3946 the bottom of the argument block for this call. We use indexing off there
3947 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3948 argument block has not been preallocated.
3950 ARGS_SO_FAR is the size of args previously pushed for this call.
3952 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3953 for arguments passed in registers. If nonzero, it will be the number
3954 of bytes required. */
3957 emit_push_insn (rtx x
, enum machine_mode mode
, tree type
, rtx size
,
3958 unsigned int align
, int partial
, rtx reg
, int extra
,
3959 rtx args_addr
, rtx args_so_far
, int reg_parm_stack_space
,
3963 enum direction stack_direction
3964 #ifdef STACK_GROWS_DOWNWARD
3970 /* Decide where to pad the argument: `downward' for below,
3971 `upward' for above, or `none' for don't pad it.
3972 Default is below for small data on big-endian machines; else above. */
3973 enum direction where_pad
= FUNCTION_ARG_PADDING (mode
, type
);
3975 /* Invert direction if stack is post-decrement.
3977 if (STACK_PUSH_CODE
== POST_DEC
)
3978 if (where_pad
!= none
)
3979 where_pad
= (where_pad
== downward
? upward
: downward
);
3984 || (STRICT_ALIGNMENT
&& align
< GET_MODE_ALIGNMENT (mode
)))
3986 /* Copy a block into the stack, entirely or partially. */
3993 offset
= partial
% (PARM_BOUNDARY
/ BITS_PER_UNIT
);
3994 used
= partial
- offset
;
3996 if (mode
!= BLKmode
)
3998 /* A value is to be stored in an insufficiently aligned
3999 stack slot; copy via a suitably aligned slot if
4001 size
= GEN_INT (GET_MODE_SIZE (mode
));
4002 if (!MEM_P (xinner
))
4004 temp
= assign_temp (type
, 0, 1, 1);
4005 emit_move_insn (temp
, xinner
);
4012 /* USED is now the # of bytes we need not copy to the stack
4013 because registers will take care of them. */
4016 xinner
= adjust_address (xinner
, BLKmode
, used
);
4018 /* If the partial register-part of the arg counts in its stack size,
4019 skip the part of stack space corresponding to the registers.
4020 Otherwise, start copying to the beginning of the stack space,
4021 by setting SKIP to 0. */
4022 skip
= (reg_parm_stack_space
== 0) ? 0 : used
;
4024 #ifdef PUSH_ROUNDING
4025 /* Do it with several push insns if that doesn't take lots of insns
4026 and if there is no difficulty with push insns that skip bytes
4027 on the stack for alignment purposes. */
4030 && CONST_INT_P (size
)
4032 && MEM_ALIGN (xinner
) >= align
4033 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size
) - used
, align
))
4034 /* Here we avoid the case of a structure whose weak alignment
4035 forces many pushes of a small amount of data,
4036 and such small pushes do rounding that causes trouble. */
4037 && ((! SLOW_UNALIGNED_ACCESS (word_mode
, align
))
4038 || align
>= BIGGEST_ALIGNMENT
4039 || (PUSH_ROUNDING (align
/ BITS_PER_UNIT
)
4040 == (align
/ BITS_PER_UNIT
)))
4041 && (HOST_WIDE_INT
) PUSH_ROUNDING (INTVAL (size
)) == INTVAL (size
))
4043 /* Push padding now if padding above and stack grows down,
4044 or if padding below and stack grows up.
4045 But if space already allocated, this has already been done. */
4046 if (extra
&& args_addr
== 0
4047 && where_pad
!= none
&& where_pad
!= stack_direction
)
4048 anti_adjust_stack (GEN_INT (extra
));
4050 move_by_pieces (NULL
, xinner
, INTVAL (size
) - used
, align
, 0);
4053 #endif /* PUSH_ROUNDING */
4057 /* Otherwise make space on the stack and copy the data
4058 to the address of that space. */
4060 /* Deduct words put into registers from the size we must copy. */
4063 if (CONST_INT_P (size
))
4064 size
= GEN_INT (INTVAL (size
) - used
);
4066 size
= expand_binop (GET_MODE (size
), sub_optab
, size
,
4067 GEN_INT (used
), NULL_RTX
, 0,
4071 /* Get the address of the stack space.
4072 In this case, we do not deal with EXTRA separately.
4073 A single stack adjust will do. */
4076 temp
= push_block (size
, extra
, where_pad
== downward
);
4079 else if (CONST_INT_P (args_so_far
))
4080 temp
= memory_address (BLKmode
,
4081 plus_constant (args_addr
,
4082 skip
+ INTVAL (args_so_far
)));
4084 temp
= memory_address (BLKmode
,
4085 plus_constant (gen_rtx_PLUS (Pmode
,
4090 if (!ACCUMULATE_OUTGOING_ARGS
)
4092 /* If the source is referenced relative to the stack pointer,
4093 copy it to another register to stabilize it. We do not need
4094 to do this if we know that we won't be changing sp. */
4096 if (reg_mentioned_p (virtual_stack_dynamic_rtx
, temp
)
4097 || reg_mentioned_p (virtual_outgoing_args_rtx
, temp
))
4098 temp
= copy_to_reg (temp
);
4101 target
= gen_rtx_MEM (BLKmode
, temp
);
4103 /* We do *not* set_mem_attributes here, because incoming arguments
4104 may overlap with sibling call outgoing arguments and we cannot
4105 allow reordering of reads from function arguments with stores
4106 to outgoing arguments of sibling calls. We do, however, want
4107 to record the alignment of the stack slot. */
4108 /* ALIGN may well be better aligned than TYPE, e.g. due to
4109 PARM_BOUNDARY. Assume the caller isn't lying. */
4110 set_mem_align (target
, align
);
4112 emit_block_move (target
, xinner
, size
, BLOCK_OP_CALL_PARM
);
4115 else if (partial
> 0)
4117 /* Scalar partly in registers. */
4119 int size
= GET_MODE_SIZE (mode
) / UNITS_PER_WORD
;
4122 /* # bytes of start of argument
4123 that we must make space for but need not store. */
4124 int offset
= partial
% (PARM_BOUNDARY
/ BITS_PER_UNIT
);
4125 int args_offset
= INTVAL (args_so_far
);
4128 /* Push padding now if padding above and stack grows down,
4129 or if padding below and stack grows up.
4130 But if space already allocated, this has already been done. */
4131 if (extra
&& args_addr
== 0
4132 && where_pad
!= none
&& where_pad
!= stack_direction
)
4133 anti_adjust_stack (GEN_INT (extra
));
4135 /* If we make space by pushing it, we might as well push
4136 the real data. Otherwise, we can leave OFFSET nonzero
4137 and leave the space uninitialized. */
4141 /* Now NOT_STACK gets the number of words that we don't need to
4142 allocate on the stack. Convert OFFSET to words too. */
4143 not_stack
= (partial
- offset
) / UNITS_PER_WORD
;
4144 offset
/= UNITS_PER_WORD
;
4146 /* If the partial register-part of the arg counts in its stack size,
4147 skip the part of stack space corresponding to the registers.
4148 Otherwise, start copying to the beginning of the stack space,
4149 by setting SKIP to 0. */
4150 skip
= (reg_parm_stack_space
== 0) ? 0 : not_stack
;
4152 if (CONSTANT_P (x
) && !targetm
.legitimate_constant_p (mode
, x
))
4153 x
= validize_mem (force_const_mem (mode
, x
));
4155 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
4156 SUBREGs of such registers are not allowed. */
4157 if ((REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
4158 && GET_MODE_CLASS (GET_MODE (x
)) != MODE_INT
))
4159 x
= copy_to_reg (x
);
4161 /* Loop over all the words allocated on the stack for this arg. */
4162 /* We can do it by words, because any scalar bigger than a word
4163 has a size a multiple of a word. */
4164 #ifndef PUSH_ARGS_REVERSED
4165 for (i
= not_stack
; i
< size
; i
++)
4167 for (i
= size
- 1; i
>= not_stack
; i
--)
4169 if (i
>= not_stack
+ offset
)
4170 emit_push_insn (operand_subword_force (x
, i
, mode
),
4171 word_mode
, NULL_TREE
, NULL_RTX
, align
, 0, NULL_RTX
,
4173 GEN_INT (args_offset
+ ((i
- not_stack
+ skip
)
4175 reg_parm_stack_space
, alignment_pad
);
4182 /* Push padding now if padding above and stack grows down,
4183 or if padding below and stack grows up.
4184 But if space already allocated, this has already been done. */
4185 if (extra
&& args_addr
== 0
4186 && where_pad
!= none
&& where_pad
!= stack_direction
)
4187 anti_adjust_stack (GEN_INT (extra
));
4189 #ifdef PUSH_ROUNDING
4190 if (args_addr
== 0 && PUSH_ARGS
)
4191 emit_single_push_insn (mode
, x
, type
);
4195 if (CONST_INT_P (args_so_far
))
4197 = memory_address (mode
,
4198 plus_constant (args_addr
,
4199 INTVAL (args_so_far
)));
4201 addr
= memory_address (mode
, gen_rtx_PLUS (Pmode
, args_addr
,
4203 dest
= gen_rtx_MEM (mode
, addr
);
4205 /* We do *not* set_mem_attributes here, because incoming arguments
4206 may overlap with sibling call outgoing arguments and we cannot
4207 allow reordering of reads from function arguments with stores
4208 to outgoing arguments of sibling calls. We do, however, want
4209 to record the alignment of the stack slot. */
4210 /* ALIGN may well be better aligned than TYPE, e.g. due to
4211 PARM_BOUNDARY. Assume the caller isn't lying. */
4212 set_mem_align (dest
, align
);
4214 emit_move_insn (dest
, x
);
4218 /* If part should go in registers, copy that part
4219 into the appropriate registers. Do this now, at the end,
4220 since mem-to-mem copies above may do function calls. */
4221 if (partial
> 0 && reg
!= 0)
4223 /* Handle calls that pass values in multiple non-contiguous locations.
4224 The Irix 6 ABI has examples of this. */
4225 if (GET_CODE (reg
) == PARALLEL
)
4226 emit_group_load (reg
, x
, type
, -1);
4229 gcc_assert (partial
% UNITS_PER_WORD
== 0);
4230 move_block_to_reg (REGNO (reg
), x
, partial
/ UNITS_PER_WORD
, mode
);
4234 if (extra
&& args_addr
== 0 && where_pad
== stack_direction
)
4235 anti_adjust_stack (GEN_INT (extra
));
4237 if (alignment_pad
&& args_addr
== 0)
4238 anti_adjust_stack (alignment_pad
);
4241 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4245 get_subtarget (rtx x
)
4249 /* Only registers can be subtargets. */
4251 /* Don't use hard regs to avoid extending their life. */
4252 || REGNO (x
) < FIRST_PSEUDO_REGISTER
4256 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
4257 FIELD is a bitfield. Returns true if the optimization was successful,
4258 and there's nothing else to do. */
4261 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize
,
4262 unsigned HOST_WIDE_INT bitpos
,
4263 unsigned HOST_WIDE_INT bitregion_start
,
4264 unsigned HOST_WIDE_INT bitregion_end
,
4265 enum machine_mode mode1
, rtx str_rtx
,
4268 enum machine_mode str_mode
= GET_MODE (str_rtx
);
4269 unsigned int str_bitsize
= GET_MODE_BITSIZE (str_mode
);
4274 enum tree_code code
;
4276 if (mode1
!= VOIDmode
4277 || bitsize
>= BITS_PER_WORD
4278 || str_bitsize
> BITS_PER_WORD
4279 || TREE_SIDE_EFFECTS (to
)
4280 || TREE_THIS_VOLATILE (to
))
4284 if (TREE_CODE (src
) != SSA_NAME
)
4286 if (TREE_CODE (TREE_TYPE (src
)) != INTEGER_TYPE
)
4289 srcstmt
= get_gimple_for_ssa_name (src
);
4291 || TREE_CODE_CLASS (gimple_assign_rhs_code (srcstmt
)) != tcc_binary
)
4294 code
= gimple_assign_rhs_code (srcstmt
);
4296 op0
= gimple_assign_rhs1 (srcstmt
);
4298 /* If OP0 is an SSA_NAME, then we want to walk the use-def chain
4299 to find its initialization. Hopefully the initialization will
4300 be from a bitfield load. */
4301 if (TREE_CODE (op0
) == SSA_NAME
)
4303 gimple op0stmt
= get_gimple_for_ssa_name (op0
);
4305 /* We want to eventually have OP0 be the same as TO, which
4306 should be a bitfield. */
4308 || !is_gimple_assign (op0stmt
)
4309 || gimple_assign_rhs_code (op0stmt
) != TREE_CODE (to
))
4311 op0
= gimple_assign_rhs1 (op0stmt
);
4314 op1
= gimple_assign_rhs2 (srcstmt
);
4316 if (!operand_equal_p (to
, op0
, 0))
4319 if (MEM_P (str_rtx
))
4321 unsigned HOST_WIDE_INT offset1
;
4323 if (str_bitsize
== 0 || str_bitsize
> BITS_PER_WORD
)
4324 str_mode
= word_mode
;
4325 str_mode
= get_best_mode (bitsize
, bitpos
,
4326 bitregion_start
, bitregion_end
,
4327 MEM_ALIGN (str_rtx
), str_mode
, 0);
4328 if (str_mode
== VOIDmode
)
4330 str_bitsize
= GET_MODE_BITSIZE (str_mode
);
4333 bitpos
%= str_bitsize
;
4334 offset1
= (offset1
- bitpos
) / BITS_PER_UNIT
;
4335 str_rtx
= adjust_address (str_rtx
, str_mode
, offset1
);
4337 else if (!REG_P (str_rtx
) && GET_CODE (str_rtx
) != SUBREG
)
4340 /* If the bit field covers the whole REG/MEM, store_field
4341 will likely generate better code. */
4342 if (bitsize
>= str_bitsize
)
4345 /* We can't handle fields split across multiple entities. */
4346 if (bitpos
+ bitsize
> str_bitsize
)
4349 if (BYTES_BIG_ENDIAN
)
4350 bitpos
= str_bitsize
- bitpos
- bitsize
;
4356 /* For now, just optimize the case of the topmost bitfield
4357 where we don't need to do any masking and also
4358 1 bit bitfields where xor can be used.
4359 We might win by one instruction for the other bitfields
4360 too if insv/extv instructions aren't used, so that
4361 can be added later. */
4362 if (bitpos
+ bitsize
!= str_bitsize
4363 && (bitsize
!= 1 || TREE_CODE (op1
) != INTEGER_CST
))
4366 value
= expand_expr (op1
, NULL_RTX
, str_mode
, EXPAND_NORMAL
);
4367 value
= convert_modes (str_mode
,
4368 TYPE_MODE (TREE_TYPE (op1
)), value
,
4369 TYPE_UNSIGNED (TREE_TYPE (op1
)));
4371 /* We may be accessing data outside the field, which means
4372 we can alias adjacent data. */
4373 if (MEM_P (str_rtx
))
4375 str_rtx
= shallow_copy_rtx (str_rtx
);
4376 set_mem_alias_set (str_rtx
, 0);
4377 set_mem_expr (str_rtx
, 0);
4380 binop
= code
== PLUS_EXPR
? add_optab
: sub_optab
;
4381 if (bitsize
== 1 && bitpos
+ bitsize
!= str_bitsize
)
4383 value
= expand_and (str_mode
, value
, const1_rtx
, NULL
);
4386 value
= expand_shift (LSHIFT_EXPR
, str_mode
, value
, bitpos
, NULL_RTX
, 1);
4387 result
= expand_binop (str_mode
, binop
, str_rtx
,
4388 value
, str_rtx
, 1, OPTAB_WIDEN
);
4389 if (result
!= str_rtx
)
4390 emit_move_insn (str_rtx
, result
);
4395 if (TREE_CODE (op1
) != INTEGER_CST
)
4397 value
= expand_expr (op1
, NULL_RTX
, str_mode
, EXPAND_NORMAL
);
4398 value
= convert_modes (str_mode
,
4399 TYPE_MODE (TREE_TYPE (op1
)), value
,
4400 TYPE_UNSIGNED (TREE_TYPE (op1
)));
4402 /* We may be accessing data outside the field, which means
4403 we can alias adjacent data. */
4404 if (MEM_P (str_rtx
))
4406 str_rtx
= shallow_copy_rtx (str_rtx
);
4407 set_mem_alias_set (str_rtx
, 0);
4408 set_mem_expr (str_rtx
, 0);
4411 binop
= code
== BIT_IOR_EXPR
? ior_optab
: xor_optab
;
4412 if (bitpos
+ bitsize
!= str_bitsize
)
4414 rtx mask
= GEN_INT (((unsigned HOST_WIDE_INT
) 1 << bitsize
) - 1);
4415 value
= expand_and (str_mode
, value
, mask
, NULL_RTX
);
4417 value
= expand_shift (LSHIFT_EXPR
, str_mode
, value
, bitpos
, NULL_RTX
, 1);
4418 result
= expand_binop (str_mode
, binop
, str_rtx
,
4419 value
, str_rtx
, 1, OPTAB_WIDEN
);
4420 if (result
!= str_rtx
)
4421 emit_move_insn (str_rtx
, result
);
4431 /* In the C++ memory model, consecutive bit fields in a structure are
4432 considered one memory location.
4434 Given a COMPONENT_REF EXP at position (BITPOS, OFFSET), this function
4435 returns the bit range of consecutive bits in which this COMPONENT_REF
4436 belongs. The values are returned in *BITSTART and *BITEND. *BITPOS
4437 and *OFFSET may be adjusted in the process.
4439 If the access does not need to be restricted, 0 is returned in both
4440 *BITSTART and *BITEND. */
4443 get_bit_range (unsigned HOST_WIDE_INT
*bitstart
,
4444 unsigned HOST_WIDE_INT
*bitend
,
4446 HOST_WIDE_INT
*bitpos
,
4449 HOST_WIDE_INT bitoffset
;
4452 gcc_assert (TREE_CODE (exp
) == COMPONENT_REF
);
4454 field
= TREE_OPERAND (exp
, 1);
4455 repr
= DECL_BIT_FIELD_REPRESENTATIVE (field
);
4456 /* If we do not have a DECL_BIT_FIELD_REPRESENTATIVE there is no
4457 need to limit the range we can access. */
4460 *bitstart
= *bitend
= 0;
4464 /* If we have a DECL_BIT_FIELD_REPRESENTATIVE but the enclosing record is
4465 part of a larger bit field, then the representative does not serve any
4466 useful purpose. This can occur in Ada. */
4467 if (handled_component_p (TREE_OPERAND (exp
, 0)))
4469 enum machine_mode rmode
;
4470 HOST_WIDE_INT rbitsize
, rbitpos
;
4474 get_inner_reference (TREE_OPERAND (exp
, 0), &rbitsize
, &rbitpos
,
4475 &roffset
, &rmode
, &unsignedp
, &volatilep
, false);
4476 if ((rbitpos
% BITS_PER_UNIT
) != 0)
4478 *bitstart
= *bitend
= 0;
4483 /* Compute the adjustment to bitpos from the offset of the field
4484 relative to the representative. DECL_FIELD_OFFSET of field and
4485 repr are the same by construction if they are not constants,
4486 see finish_bitfield_layout. */
4487 if (host_integerp (DECL_FIELD_OFFSET (field
), 1)
4488 && host_integerp (DECL_FIELD_OFFSET (repr
), 1))
4489 bitoffset
= (tree_low_cst (DECL_FIELD_OFFSET (field
), 1)
4490 - tree_low_cst (DECL_FIELD_OFFSET (repr
), 1)) * BITS_PER_UNIT
;
4493 bitoffset
+= (tree_low_cst (DECL_FIELD_BIT_OFFSET (field
), 1)
4494 - tree_low_cst (DECL_FIELD_BIT_OFFSET (repr
), 1));
4496 /* If the adjustment is larger than bitpos, we would have a negative bit
4497 position for the lower bound and this may wreak havoc later. This can
4498 occur only if we have a non-null offset, so adjust offset and bitpos
4499 to make the lower bound non-negative. */
4500 if (bitoffset
> *bitpos
)
4502 HOST_WIDE_INT adjust
= bitoffset
- *bitpos
;
4504 gcc_assert ((adjust
% BITS_PER_UNIT
) == 0);
4505 gcc_assert (*offset
!= NULL_TREE
);
4509 = size_binop (MINUS_EXPR
, *offset
, size_int (adjust
/ BITS_PER_UNIT
));
4513 *bitstart
= *bitpos
- bitoffset
;
4515 *bitend
= *bitstart
+ tree_low_cst (DECL_SIZE (repr
), 1) - 1;
4518 /* Returns true if the MEM_REF REF refers to an object that does not
4519 reside in memory and has non-BLKmode. */
4522 mem_ref_refers_to_non_mem_p (tree ref
)
4524 tree base
= TREE_OPERAND (ref
, 0);
4525 if (TREE_CODE (base
) != ADDR_EXPR
)
4527 base
= TREE_OPERAND (base
, 0);
4528 return (DECL_P (base
)
4529 && !TREE_ADDRESSABLE (base
)
4530 && DECL_MODE (base
) != BLKmode
4531 && DECL_RTL_SET_P (base
)
4532 && !MEM_P (DECL_RTL (base
)));
4535 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4536 is true, try generating a nontemporal store. */
4539 expand_assignment (tree to
, tree from
, bool nontemporal
)
4543 enum machine_mode mode
;
4545 enum insn_code icode
;
4547 /* Don't crash if the lhs of the assignment was erroneous. */
4548 if (TREE_CODE (to
) == ERROR_MARK
)
4550 expand_normal (from
);
4554 /* Optimize away no-op moves without side-effects. */
4555 if (operand_equal_p (to
, from
, 0))
4558 /* Handle misaligned stores. */
4559 mode
= TYPE_MODE (TREE_TYPE (to
));
4560 if ((TREE_CODE (to
) == MEM_REF
4561 || TREE_CODE (to
) == TARGET_MEM_REF
)
4563 && !mem_ref_refers_to_non_mem_p (to
)
4564 && ((align
= get_object_or_type_alignment (to
))
4565 < GET_MODE_ALIGNMENT (mode
))
4566 && (((icode
= optab_handler (movmisalign_optab
, mode
))
4567 != CODE_FOR_nothing
)
4568 || SLOW_UNALIGNED_ACCESS (mode
, align
)))
4572 reg
= expand_expr (from
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
4573 reg
= force_not_mem (reg
);
4574 mem
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4576 if (icode
!= CODE_FOR_nothing
)
4578 struct expand_operand ops
[2];
4580 create_fixed_operand (&ops
[0], mem
);
4581 create_input_operand (&ops
[1], reg
, mode
);
4582 /* The movmisalign<mode> pattern cannot fail, else the assignment
4583 would silently be omitted. */
4584 expand_insn (icode
, 2, ops
);
4587 store_bit_field (mem
, GET_MODE_BITSIZE (mode
),
4588 0, 0, 0, mode
, reg
);
4592 /* Assignment of a structure component needs special treatment
4593 if the structure component's rtx is not simply a MEM.
4594 Assignment of an array element at a constant index, and assignment of
4595 an array element in an unaligned packed structure field, has the same
4596 problem. Same for (partially) storing into a non-memory object. */
4597 if (handled_component_p (to
)
4598 || (TREE_CODE (to
) == MEM_REF
4599 && mem_ref_refers_to_non_mem_p (to
))
4600 || TREE_CODE (TREE_TYPE (to
)) == ARRAY_TYPE
)
4602 enum machine_mode mode1
;
4603 HOST_WIDE_INT bitsize
, bitpos
;
4604 unsigned HOST_WIDE_INT bitregion_start
= 0;
4605 unsigned HOST_WIDE_INT bitregion_end
= 0;
4614 tem
= get_inner_reference (to
, &bitsize
, &bitpos
, &offset
, &mode1
,
4615 &unsignedp
, &volatilep
, true);
4617 if (TREE_CODE (to
) == COMPONENT_REF
4618 && DECL_BIT_FIELD_TYPE (TREE_OPERAND (to
, 1)))
4619 get_bit_range (&bitregion_start
, &bitregion_end
, to
, &bitpos
, &offset
);
4621 /* If we are going to use store_bit_field and extract_bit_field,
4622 make sure to_rtx will be safe for multiple use. */
4623 mode
= TYPE_MODE (TREE_TYPE (tem
));
4624 if (TREE_CODE (tem
) == MEM_REF
4626 && ((align
= get_object_or_type_alignment (tem
))
4627 < GET_MODE_ALIGNMENT (mode
))
4628 && ((icode
= optab_handler (movmisalign_optab
, mode
))
4629 != CODE_FOR_nothing
))
4631 struct expand_operand ops
[2];
4634 to_rtx
= gen_reg_rtx (mode
);
4635 mem
= expand_expr (tem
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4637 /* If the misaligned store doesn't overwrite all bits, perform
4638 rmw cycle on MEM. */
4639 if (bitsize
!= GET_MODE_BITSIZE (mode
))
4641 create_input_operand (&ops
[0], to_rtx
, mode
);
4642 create_fixed_operand (&ops
[1], mem
);
4643 /* The movmisalign<mode> pattern cannot fail, else the assignment
4644 would silently be omitted. */
4645 expand_insn (icode
, 2, ops
);
4647 mem
= copy_rtx (mem
);
4653 to_rtx
= expand_expr (tem
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4656 /* If the bitfield is volatile, we want to access it in the
4657 field's mode, not the computed mode.
4658 If a MEM has VOIDmode (external with incomplete type),
4659 use BLKmode for it instead. */
4662 if (volatilep
&& flag_strict_volatile_bitfields
> 0)
4663 to_rtx
= adjust_address (to_rtx
, mode1
, 0);
4664 else if (GET_MODE (to_rtx
) == VOIDmode
)
4665 to_rtx
= adjust_address (to_rtx
, BLKmode
, 0);
4670 enum machine_mode address_mode
;
4673 if (!MEM_P (to_rtx
))
4675 /* We can get constant negative offsets into arrays with broken
4676 user code. Translate this to a trap instead of ICEing. */
4677 gcc_assert (TREE_CODE (offset
) == INTEGER_CST
);
4678 expand_builtin_trap ();
4679 to_rtx
= gen_rtx_MEM (BLKmode
, const0_rtx
);
4682 offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
4684 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (to_rtx
));
4685 if (GET_MODE (offset_rtx
) != address_mode
)
4686 offset_rtx
= convert_to_mode (address_mode
, offset_rtx
, 0);
4688 /* A constant address in TO_RTX can have VOIDmode, we must not try
4689 to call force_reg for that case. Avoid that case. */
4691 && GET_MODE (to_rtx
) == BLKmode
4692 && GET_MODE (XEXP (to_rtx
, 0)) != VOIDmode
4694 && (bitpos
% bitsize
) == 0
4695 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
4696 && MEM_ALIGN (to_rtx
) == GET_MODE_ALIGNMENT (mode1
))
4698 to_rtx
= adjust_address (to_rtx
, mode1
, bitpos
/ BITS_PER_UNIT
);
4702 to_rtx
= offset_address (to_rtx
, offset_rtx
,
4703 highest_pow2_factor_for_target (to
,
4707 /* No action is needed if the target is not a memory and the field
4708 lies completely outside that target. This can occur if the source
4709 code contains an out-of-bounds access to a small array. */
4711 && GET_MODE (to_rtx
) != BLKmode
4712 && (unsigned HOST_WIDE_INT
) bitpos
4713 >= GET_MODE_PRECISION (GET_MODE (to_rtx
)))
4715 expand_normal (from
);
4718 /* Handle expand_expr of a complex value returning a CONCAT. */
4719 else if (GET_CODE (to_rtx
) == CONCAT
)
4721 unsigned short mode_bitsize
= GET_MODE_BITSIZE (GET_MODE (to_rtx
));
4722 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from
)))
4724 && bitsize
== mode_bitsize
)
4725 result
= store_expr (from
, to_rtx
, false, nontemporal
);
4726 else if (bitsize
== mode_bitsize
/ 2
4727 && (bitpos
== 0 || bitpos
== mode_bitsize
/ 2))
4728 result
= store_expr (from
, XEXP (to_rtx
, bitpos
!= 0), false,
4730 else if (bitpos
+ bitsize
<= mode_bitsize
/ 2)
4731 result
= store_field (XEXP (to_rtx
, 0), bitsize
, bitpos
,
4732 bitregion_start
, bitregion_end
,
4733 mode1
, from
, TREE_TYPE (tem
),
4734 get_alias_set (to
), nontemporal
);
4735 else if (bitpos
>= mode_bitsize
/ 2)
4736 result
= store_field (XEXP (to_rtx
, 1), bitsize
,
4737 bitpos
- mode_bitsize
/ 2,
4738 bitregion_start
, bitregion_end
,
4740 TREE_TYPE (tem
), get_alias_set (to
),
4742 else if (bitpos
== 0 && bitsize
== mode_bitsize
)
4745 result
= expand_normal (from
);
4746 from_rtx
= simplify_gen_subreg (GET_MODE (to_rtx
), result
,
4747 TYPE_MODE (TREE_TYPE (from
)), 0);
4748 emit_move_insn (XEXP (to_rtx
, 0),
4749 read_complex_part (from_rtx
, false));
4750 emit_move_insn (XEXP (to_rtx
, 1),
4751 read_complex_part (from_rtx
, true));
4755 rtx temp
= assign_stack_temp (GET_MODE (to_rtx
),
4756 GET_MODE_SIZE (GET_MODE (to_rtx
)),
4758 write_complex_part (temp
, XEXP (to_rtx
, 0), false);
4759 write_complex_part (temp
, XEXP (to_rtx
, 1), true);
4760 result
= store_field (temp
, bitsize
, bitpos
,
4761 bitregion_start
, bitregion_end
,
4763 TREE_TYPE (tem
), get_alias_set (to
),
4765 emit_move_insn (XEXP (to_rtx
, 0), read_complex_part (temp
, false));
4766 emit_move_insn (XEXP (to_rtx
, 1), read_complex_part (temp
, true));
4773 /* If the field is at offset zero, we could have been given the
4774 DECL_RTX of the parent struct. Don't munge it. */
4775 to_rtx
= shallow_copy_rtx (to_rtx
);
4777 set_mem_attributes_minus_bitpos (to_rtx
, to
, 0, bitpos
);
4779 /* Deal with volatile and readonly fields. The former is only
4780 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4782 MEM_VOLATILE_P (to_rtx
) = 1;
4783 if (component_uses_parent_alias_set (to
))
4784 MEM_KEEP_ALIAS_SET_P (to_rtx
) = 1;
4787 if (optimize_bitfield_assignment_op (bitsize
, bitpos
,
4788 bitregion_start
, bitregion_end
,
4793 result
= store_field (to_rtx
, bitsize
, bitpos
,
4794 bitregion_start
, bitregion_end
,
4796 TREE_TYPE (tem
), get_alias_set (to
),
4802 struct expand_operand ops
[2];
4804 create_fixed_operand (&ops
[0], mem
);
4805 create_input_operand (&ops
[1], to_rtx
, mode
);
4806 /* The movmisalign<mode> pattern cannot fail, else the assignment
4807 would silently be omitted. */
4808 expand_insn (icode
, 2, ops
);
4812 preserve_temp_slots (result
);
4818 /* If the rhs is a function call and its value is not an aggregate,
4819 call the function before we start to compute the lhs.
4820 This is needed for correct code for cases such as
4821 val = setjmp (buf) on machines where reference to val
4822 requires loading up part of an address in a separate insn.
4824 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4825 since it might be a promoted variable where the zero- or sign- extension
4826 needs to be done. Handling this in the normal way is safe because no
4827 computation is done before the call. The same is true for SSA names. */
4828 if (TREE_CODE (from
) == CALL_EXPR
&& ! aggregate_value_p (from
, from
)
4829 && COMPLETE_TYPE_P (TREE_TYPE (from
))
4830 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from
))) == INTEGER_CST
4831 && ! (((TREE_CODE (to
) == VAR_DECL
4832 || TREE_CODE (to
) == PARM_DECL
4833 || TREE_CODE (to
) == RESULT_DECL
)
4834 && REG_P (DECL_RTL (to
)))
4835 || TREE_CODE (to
) == SSA_NAME
))
4840 value
= expand_normal (from
);
4842 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4844 /* Handle calls that return values in multiple non-contiguous locations.
4845 The Irix 6 ABI has examples of this. */
4846 if (GET_CODE (to_rtx
) == PARALLEL
)
4847 emit_group_load (to_rtx
, value
, TREE_TYPE (from
),
4848 int_size_in_bytes (TREE_TYPE (from
)));
4849 else if (GET_MODE (to_rtx
) == BLKmode
)
4850 emit_block_move (to_rtx
, value
, expr_size (from
), BLOCK_OP_NORMAL
);
4853 if (POINTER_TYPE_P (TREE_TYPE (to
)))
4854 value
= convert_memory_address_addr_space
4855 (GET_MODE (to_rtx
), value
,
4856 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to
))));
4858 emit_move_insn (to_rtx
, value
);
4860 preserve_temp_slots (to_rtx
);
4866 /* Ordinary treatment. Expand TO to get a REG or MEM rtx. */
4867 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4869 /* Don't move directly into a return register. */
4870 if (TREE_CODE (to
) == RESULT_DECL
4871 && (REG_P (to_rtx
) || GET_CODE (to_rtx
) == PARALLEL
))
4876 if (REG_P (to_rtx
) && TYPE_MODE (TREE_TYPE (from
)) == BLKmode
)
4877 temp
= copy_blkmode_to_reg (GET_MODE (to_rtx
), from
);
4879 temp
= expand_expr (from
, NULL_RTX
, GET_MODE (to_rtx
), EXPAND_NORMAL
);
4881 if (GET_CODE (to_rtx
) == PARALLEL
)
4882 emit_group_load (to_rtx
, temp
, TREE_TYPE (from
),
4883 int_size_in_bytes (TREE_TYPE (from
)));
4885 emit_move_insn (to_rtx
, temp
);
4887 preserve_temp_slots (to_rtx
);
4893 /* In case we are returning the contents of an object which overlaps
4894 the place the value is being stored, use a safe function when copying
4895 a value through a pointer into a structure value return block. */
4896 if (TREE_CODE (to
) == RESULT_DECL
4897 && TREE_CODE (from
) == INDIRECT_REF
4898 && ADDR_SPACE_GENERIC_P
4899 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from
, 0)))))
4900 && refs_may_alias_p (to
, from
)
4901 && cfun
->returns_struct
4902 && !cfun
->returns_pcc_struct
)
4907 size
= expr_size (from
);
4908 from_rtx
= expand_normal (from
);
4910 emit_library_call (memmove_libfunc
, LCT_NORMAL
,
4911 VOIDmode
, 3, XEXP (to_rtx
, 0), Pmode
,
4912 XEXP (from_rtx
, 0), Pmode
,
4913 convert_to_mode (TYPE_MODE (sizetype
),
4914 size
, TYPE_UNSIGNED (sizetype
)),
4915 TYPE_MODE (sizetype
));
4917 preserve_temp_slots (to_rtx
);
4923 /* Compute FROM and store the value in the rtx we got. */
4926 result
= store_expr (from
, to_rtx
, 0, nontemporal
);
4927 preserve_temp_slots (result
);
4933 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4934 succeeded, false otherwise. */
4937 emit_storent_insn (rtx to
, rtx from
)
4939 struct expand_operand ops
[2];
4940 enum machine_mode mode
= GET_MODE (to
);
4941 enum insn_code code
= optab_handler (storent_optab
, mode
);
4943 if (code
== CODE_FOR_nothing
)
4946 create_fixed_operand (&ops
[0], to
);
4947 create_input_operand (&ops
[1], from
, mode
);
4948 return maybe_expand_insn (code
, 2, ops
);
4951 /* Generate code for computing expression EXP,
4952 and storing the value into TARGET.
4954 If the mode is BLKmode then we may return TARGET itself.
4955 It turns out that in BLKmode it doesn't cause a problem.
4956 because C has no operators that could combine two different
4957 assignments into the same BLKmode object with different values
4958 with no sequence point. Will other languages need this to
4961 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4962 stack, and block moves may need to be treated specially.
4964 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4967 store_expr (tree exp
, rtx target
, int call_param_p
, bool nontemporal
)
4970 rtx alt_rtl
= NULL_RTX
;
4971 location_t loc
= EXPR_LOCATION (exp
);
4973 if (VOID_TYPE_P (TREE_TYPE (exp
)))
4975 /* C++ can generate ?: expressions with a throw expression in one
4976 branch and an rvalue in the other. Here, we resolve attempts to
4977 store the throw expression's nonexistent result. */
4978 gcc_assert (!call_param_p
);
4979 expand_expr (exp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4982 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
4984 /* Perform first part of compound expression, then assign from second
4986 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
4987 call_param_p
? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
4988 return store_expr (TREE_OPERAND (exp
, 1), target
, call_param_p
,
4991 else if (TREE_CODE (exp
) == COND_EXPR
&& GET_MODE (target
) == BLKmode
)
4993 /* For conditional expression, get safe form of the target. Then
4994 test the condition, doing the appropriate assignment on either
4995 side. This avoids the creation of unnecessary temporaries.
4996 For non-BLKmode, it is more efficient not to do this. */
4998 rtx lab1
= gen_label_rtx (), lab2
= gen_label_rtx ();
5000 do_pending_stack_adjust ();
5002 jumpifnot (TREE_OPERAND (exp
, 0), lab1
, -1);
5003 store_expr (TREE_OPERAND (exp
, 1), target
, call_param_p
,
5005 emit_jump_insn (gen_jump (lab2
));
5008 store_expr (TREE_OPERAND (exp
, 2), target
, call_param_p
,
5015 else if (GET_CODE (target
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (target
))
5016 /* If this is a scalar in a register that is stored in a wider mode
5017 than the declared mode, compute the result into its declared mode
5018 and then convert to the wider mode. Our value is the computed
5021 rtx inner_target
= 0;
5023 /* We can do the conversion inside EXP, which will often result
5024 in some optimizations. Do the conversion in two steps: first
5025 change the signedness, if needed, then the extend. But don't
5026 do this if the type of EXP is a subtype of something else
5027 since then the conversion might involve more than just
5028 converting modes. */
5029 if (INTEGRAL_TYPE_P (TREE_TYPE (exp
))
5030 && TREE_TYPE (TREE_TYPE (exp
)) == 0
5031 && GET_MODE_PRECISION (GET_MODE (target
))
5032 == TYPE_PRECISION (TREE_TYPE (exp
)))
5034 if (TYPE_UNSIGNED (TREE_TYPE (exp
))
5035 != SUBREG_PROMOTED_UNSIGNED_P (target
))
5037 /* Some types, e.g. Fortran's logical*4, won't have a signed
5038 version, so use the mode instead. */
5040 = (signed_or_unsigned_type_for
5041 (SUBREG_PROMOTED_UNSIGNED_P (target
), TREE_TYPE (exp
)));
5043 ntype
= lang_hooks
.types
.type_for_mode
5044 (TYPE_MODE (TREE_TYPE (exp
)),
5045 SUBREG_PROMOTED_UNSIGNED_P (target
));
5047 exp
= fold_convert_loc (loc
, ntype
, exp
);
5050 exp
= fold_convert_loc (loc
, lang_hooks
.types
.type_for_mode
5051 (GET_MODE (SUBREG_REG (target
)),
5052 SUBREG_PROMOTED_UNSIGNED_P (target
)),
5055 inner_target
= SUBREG_REG (target
);
5058 temp
= expand_expr (exp
, inner_target
, VOIDmode
,
5059 call_param_p
? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
5061 /* If TEMP is a VOIDmode constant, use convert_modes to make
5062 sure that we properly convert it. */
5063 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
)
5065 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
5066 temp
, SUBREG_PROMOTED_UNSIGNED_P (target
));
5067 temp
= convert_modes (GET_MODE (SUBREG_REG (target
)),
5068 GET_MODE (target
), temp
,
5069 SUBREG_PROMOTED_UNSIGNED_P (target
));
5072 convert_move (SUBREG_REG (target
), temp
,
5073 SUBREG_PROMOTED_UNSIGNED_P (target
));
5077 else if ((TREE_CODE (exp
) == STRING_CST
5078 || (TREE_CODE (exp
) == MEM_REF
5079 && TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
5080 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
5082 && integer_zerop (TREE_OPERAND (exp
, 1))))
5083 && !nontemporal
&& !call_param_p
5086 /* Optimize initialization of an array with a STRING_CST. */
5087 HOST_WIDE_INT exp_len
, str_copy_len
;
5089 tree str
= TREE_CODE (exp
) == STRING_CST
5090 ? exp
: TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
5092 exp_len
= int_expr_size (exp
);
5096 if (TREE_STRING_LENGTH (str
) <= 0)
5099 str_copy_len
= strlen (TREE_STRING_POINTER (str
));
5100 if (str_copy_len
< TREE_STRING_LENGTH (str
) - 1)
5103 str_copy_len
= TREE_STRING_LENGTH (str
);
5104 if ((STORE_MAX_PIECES
& (STORE_MAX_PIECES
- 1)) == 0
5105 && TREE_STRING_POINTER (str
)[TREE_STRING_LENGTH (str
) - 1] == '\0')
5107 str_copy_len
+= STORE_MAX_PIECES
- 1;
5108 str_copy_len
&= ~(STORE_MAX_PIECES
- 1);
5110 str_copy_len
= MIN (str_copy_len
, exp_len
);
5111 if (!can_store_by_pieces (str_copy_len
, builtin_strncpy_read_str
,
5112 CONST_CAST (char *, TREE_STRING_POINTER (str
)),
5113 MEM_ALIGN (target
), false))
5118 dest_mem
= store_by_pieces (dest_mem
,
5119 str_copy_len
, builtin_strncpy_read_str
,
5121 TREE_STRING_POINTER (str
)),
5122 MEM_ALIGN (target
), false,
5123 exp_len
> str_copy_len
? 1 : 0);
5124 if (exp_len
> str_copy_len
)
5125 clear_storage (adjust_address (dest_mem
, BLKmode
, 0),
5126 GEN_INT (exp_len
- str_copy_len
),
5135 /* If we want to use a nontemporal store, force the value to
5137 tmp_target
= nontemporal
? NULL_RTX
: target
;
5138 temp
= expand_expr_real (exp
, tmp_target
, GET_MODE (target
),
5140 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
),
5144 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
5145 the same as that of TARGET, adjust the constant. This is needed, for
5146 example, in case it is a CONST_DOUBLE and we want only a word-sized
5148 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
5149 && TREE_CODE (exp
) != ERROR_MARK
5150 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
5151 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
5152 temp
, TYPE_UNSIGNED (TREE_TYPE (exp
)));
5154 /* If value was not generated in the target, store it there.
5155 Convert the value to TARGET's type first if necessary and emit the
5156 pending incrementations that have been queued when expanding EXP.
5157 Note that we cannot emit the whole queue blindly because this will
5158 effectively disable the POST_INC optimization later.
5160 If TEMP and TARGET compare equal according to rtx_equal_p, but
5161 one or both of them are volatile memory refs, we have to distinguish
5163 - expand_expr has used TARGET. In this case, we must not generate
5164 another copy. This can be detected by TARGET being equal according
5166 - expand_expr has not used TARGET - that means that the source just
5167 happens to have the same RTX form. Since temp will have been created
5168 by expand_expr, it will compare unequal according to == .
5169 We must generate a copy in this case, to reach the correct number
5170 of volatile memory references. */
5172 if ((! rtx_equal_p (temp
, target
)
5173 || (temp
!= target
&& (side_effects_p (temp
)
5174 || side_effects_p (target
))))
5175 && TREE_CODE (exp
) != ERROR_MARK
5176 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
5177 but TARGET is not valid memory reference, TEMP will differ
5178 from TARGET although it is really the same location. */
5180 && rtx_equal_p (alt_rtl
, target
)
5181 && !side_effects_p (alt_rtl
)
5182 && !side_effects_p (target
))
5183 /* If there's nothing to copy, don't bother. Don't call
5184 expr_size unless necessary, because some front-ends (C++)
5185 expr_size-hook must not be given objects that are not
5186 supposed to be bit-copied or bit-initialized. */
5187 && expr_size (exp
) != const0_rtx
)
5189 if (GET_MODE (temp
) != GET_MODE (target
)
5190 && GET_MODE (temp
) != VOIDmode
)
5192 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (exp
));
5193 if (GET_MODE (target
) == BLKmode
5194 && GET_MODE (temp
) == BLKmode
)
5195 emit_block_move (target
, temp
, expr_size (exp
),
5197 ? BLOCK_OP_CALL_PARM
5198 : BLOCK_OP_NORMAL
));
5199 else if (GET_MODE (target
) == BLKmode
)
5200 store_bit_field (target
, INTVAL (expr_size (exp
)) * BITS_PER_UNIT
,
5201 0, 0, 0, GET_MODE (temp
), temp
);
5203 convert_move (target
, temp
, unsignedp
);
5206 else if (GET_MODE (temp
) == BLKmode
&& TREE_CODE (exp
) == STRING_CST
)
5208 /* Handle copying a string constant into an array. The string
5209 constant may be shorter than the array. So copy just the string's
5210 actual length, and clear the rest. First get the size of the data
5211 type of the string, which is actually the size of the target. */
5212 rtx size
= expr_size (exp
);
5214 if (CONST_INT_P (size
)
5215 && INTVAL (size
) < TREE_STRING_LENGTH (exp
))
5216 emit_block_move (target
, temp
, size
,
5218 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
5221 enum machine_mode pointer_mode
5222 = targetm
.addr_space
.pointer_mode (MEM_ADDR_SPACE (target
));
5223 enum machine_mode address_mode
5224 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (target
));
5226 /* Compute the size of the data to copy from the string. */
5228 = size_binop_loc (loc
, MIN_EXPR
,
5229 make_tree (sizetype
, size
),
5230 size_int (TREE_STRING_LENGTH (exp
)));
5232 = expand_expr (copy_size
, NULL_RTX
, VOIDmode
,
5234 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
));
5237 /* Copy that much. */
5238 copy_size_rtx
= convert_to_mode (pointer_mode
, copy_size_rtx
,
5239 TYPE_UNSIGNED (sizetype
));
5240 emit_block_move (target
, temp
, copy_size_rtx
,
5242 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
5244 /* Figure out how much is left in TARGET that we have to clear.
5245 Do all calculations in pointer_mode. */
5246 if (CONST_INT_P (copy_size_rtx
))
5248 size
= plus_constant (size
, -INTVAL (copy_size_rtx
));
5249 target
= adjust_address (target
, BLKmode
,
5250 INTVAL (copy_size_rtx
));
5254 size
= expand_binop (TYPE_MODE (sizetype
), sub_optab
, size
,
5255 copy_size_rtx
, NULL_RTX
, 0,
5258 if (GET_MODE (copy_size_rtx
) != address_mode
)
5259 copy_size_rtx
= convert_to_mode (address_mode
,
5261 TYPE_UNSIGNED (sizetype
));
5263 target
= offset_address (target
, copy_size_rtx
,
5264 highest_pow2_factor (copy_size
));
5265 label
= gen_label_rtx ();
5266 emit_cmp_and_jump_insns (size
, const0_rtx
, LT
, NULL_RTX
,
5267 GET_MODE (size
), 0, label
);
5270 if (size
!= const0_rtx
)
5271 clear_storage (target
, size
, BLOCK_OP_NORMAL
);
5277 /* Handle calls that return values in multiple non-contiguous locations.
5278 The Irix 6 ABI has examples of this. */
5279 else if (GET_CODE (target
) == PARALLEL
)
5280 emit_group_load (target
, temp
, TREE_TYPE (exp
),
5281 int_size_in_bytes (TREE_TYPE (exp
)));
5282 else if (GET_MODE (temp
) == BLKmode
)
5283 emit_block_move (target
, temp
, expr_size (exp
),
5285 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
5286 else if (nontemporal
5287 && emit_storent_insn (target
, temp
))
5288 /* If we managed to emit a nontemporal store, there is nothing else to
5293 temp
= force_operand (temp
, target
);
5295 emit_move_insn (target
, temp
);
5302 /* Return true if field F of structure TYPE is a flexible array. */
5305 flexible_array_member_p (const_tree f
, const_tree type
)
5310 return (DECL_CHAIN (f
) == NULL
5311 && TREE_CODE (tf
) == ARRAY_TYPE
5313 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf
))
5314 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf
)))
5315 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf
))
5316 && int_size_in_bytes (type
) >= 0);
5319 /* If FOR_CTOR_P, return the number of top-level elements that a constructor
5320 must have in order for it to completely initialize a value of type TYPE.
5321 Return -1 if the number isn't known.
5323 If !FOR_CTOR_P, return an estimate of the number of scalars in TYPE. */
5325 static HOST_WIDE_INT
5326 count_type_elements (const_tree type
, bool for_ctor_p
)
5328 switch (TREE_CODE (type
))
5334 nelts
= array_type_nelts (type
);
5335 if (nelts
&& host_integerp (nelts
, 1))
5337 unsigned HOST_WIDE_INT n
;
5339 n
= tree_low_cst (nelts
, 1) + 1;
5340 if (n
== 0 || for_ctor_p
)
5343 return n
* count_type_elements (TREE_TYPE (type
), false);
5345 return for_ctor_p
? -1 : 1;
5350 unsigned HOST_WIDE_INT n
;
5354 for (f
= TYPE_FIELDS (type
); f
; f
= DECL_CHAIN (f
))
5355 if (TREE_CODE (f
) == FIELD_DECL
)
5358 n
+= count_type_elements (TREE_TYPE (f
), false);
5359 else if (!flexible_array_member_p (f
, type
))
5360 /* Don't count flexible arrays, which are not supposed
5361 to be initialized. */
5369 case QUAL_UNION_TYPE
:
5374 gcc_assert (!for_ctor_p
);
5375 /* Estimate the number of scalars in each field and pick the
5376 maximum. Other estimates would do instead; the idea is simply
5377 to make sure that the estimate is not sensitive to the ordering
5380 for (f
= TYPE_FIELDS (type
); f
; f
= DECL_CHAIN (f
))
5381 if (TREE_CODE (f
) == FIELD_DECL
)
5383 m
= count_type_elements (TREE_TYPE (f
), false);
5384 /* If the field doesn't span the whole union, add an extra
5385 scalar for the rest. */
5386 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (f
)),
5387 TYPE_SIZE (type
)) != 1)
5399 return TYPE_VECTOR_SUBPARTS (type
);
5403 case FIXED_POINT_TYPE
:
5408 case REFERENCE_TYPE
:
5424 /* Helper for categorize_ctor_elements. Identical interface. */
5427 categorize_ctor_elements_1 (const_tree ctor
, HOST_WIDE_INT
*p_nz_elts
,
5428 HOST_WIDE_INT
*p_init_elts
, bool *p_complete
)
5430 unsigned HOST_WIDE_INT idx
;
5431 HOST_WIDE_INT nz_elts
, init_elts
, num_fields
;
5432 tree value
, purpose
, elt_type
;
5434 /* Whether CTOR is a valid constant initializer, in accordance with what
5435 initializer_constant_valid_p does. If inferred from the constructor
5436 elements, true until proven otherwise. */
5437 bool const_from_elts_p
= constructor_static_from_elts_p (ctor
);
5438 bool const_p
= const_from_elts_p
? true : TREE_STATIC (ctor
);
5443 elt_type
= NULL_TREE
;
5445 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), idx
, purpose
, value
)
5447 HOST_WIDE_INT mult
= 1;
5449 if (TREE_CODE (purpose
) == RANGE_EXPR
)
5451 tree lo_index
= TREE_OPERAND (purpose
, 0);
5452 tree hi_index
= TREE_OPERAND (purpose
, 1);
5454 if (host_integerp (lo_index
, 1) && host_integerp (hi_index
, 1))
5455 mult
= (tree_low_cst (hi_index
, 1)
5456 - tree_low_cst (lo_index
, 1) + 1);
5459 elt_type
= TREE_TYPE (value
);
5461 switch (TREE_CODE (value
))
5465 HOST_WIDE_INT nz
= 0, ic
= 0;
5467 bool const_elt_p
= categorize_ctor_elements_1 (value
, &nz
, &ic
,
5470 nz_elts
+= mult
* nz
;
5471 init_elts
+= mult
* ic
;
5473 if (const_from_elts_p
&& const_p
)
5474 const_p
= const_elt_p
;
5481 if (!initializer_zerop (value
))
5487 nz_elts
+= mult
* TREE_STRING_LENGTH (value
);
5488 init_elts
+= mult
* TREE_STRING_LENGTH (value
);
5492 if (!initializer_zerop (TREE_REALPART (value
)))
5494 if (!initializer_zerop (TREE_IMAGPART (value
)))
5502 for (i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
5504 tree v
= VECTOR_CST_ELT (value
, i
);
5505 if (!initializer_zerop (v
))
5514 HOST_WIDE_INT tc
= count_type_elements (elt_type
, false);
5515 nz_elts
+= mult
* tc
;
5516 init_elts
+= mult
* tc
;
5518 if (const_from_elts_p
&& const_p
)
5519 const_p
= initializer_constant_valid_p (value
, elt_type
)
5526 if (*p_complete
&& !complete_ctor_at_level_p (TREE_TYPE (ctor
),
5527 num_fields
, elt_type
))
5528 *p_complete
= false;
5530 *p_nz_elts
+= nz_elts
;
5531 *p_init_elts
+= init_elts
;
5536 /* Examine CTOR to discover:
5537 * how many scalar fields are set to nonzero values,
5538 and place it in *P_NZ_ELTS;
5539 * how many scalar fields in total are in CTOR,
5540 and place it in *P_ELT_COUNT.
5541 * whether the constructor is complete -- in the sense that every
5542 meaningful byte is explicitly given a value --
5543 and place it in *P_COMPLETE.
5545 Return whether or not CTOR is a valid static constant initializer, the same
5546 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
5549 categorize_ctor_elements (const_tree ctor
, HOST_WIDE_INT
*p_nz_elts
,
5550 HOST_WIDE_INT
*p_init_elts
, bool *p_complete
)
5556 return categorize_ctor_elements_1 (ctor
, p_nz_elts
, p_init_elts
, p_complete
);
5559 /* TYPE is initialized by a constructor with NUM_ELTS elements, the last
5560 of which had type LAST_TYPE. Each element was itself a complete
5561 initializer, in the sense that every meaningful byte was explicitly
5562 given a value. Return true if the same is true for the constructor
5566 complete_ctor_at_level_p (const_tree type
, HOST_WIDE_INT num_elts
,
5567 const_tree last_type
)
5569 if (TREE_CODE (type
) == UNION_TYPE
5570 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
5575 gcc_assert (num_elts
== 1 && last_type
);
5577 /* ??? We could look at each element of the union, and find the
5578 largest element. Which would avoid comparing the size of the
5579 initialized element against any tail padding in the union.
5580 Doesn't seem worth the effort... */
5581 return simple_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (last_type
)) == 1;
5584 return count_type_elements (type
, true) == num_elts
;
5587 /* Return 1 if EXP contains mostly (3/4) zeros. */
5590 mostly_zeros_p (const_tree exp
)
5592 if (TREE_CODE (exp
) == CONSTRUCTOR
)
5594 HOST_WIDE_INT nz_elts
, init_elts
;
5597 categorize_ctor_elements (exp
, &nz_elts
, &init_elts
, &complete_p
);
5598 return !complete_p
|| nz_elts
< init_elts
/ 4;
5601 return initializer_zerop (exp
);
5604 /* Return 1 if EXP contains all zeros. */
5607 all_zeros_p (const_tree exp
)
5609 if (TREE_CODE (exp
) == CONSTRUCTOR
)
5611 HOST_WIDE_INT nz_elts
, init_elts
;
5614 categorize_ctor_elements (exp
, &nz_elts
, &init_elts
, &complete_p
);
5615 return nz_elts
== 0;
5618 return initializer_zerop (exp
);
5621 /* Helper function for store_constructor.
5622 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5623 TYPE is the type of the CONSTRUCTOR, not the element type.
5624 CLEARED is as for store_constructor.
5625 ALIAS_SET is the alias set to use for any stores.
5627 This provides a recursive shortcut back to store_constructor when it isn't
5628 necessary to go through store_field. This is so that we can pass through
5629 the cleared field to let store_constructor know that we may not have to
5630 clear a substructure if the outer structure has already been cleared. */
5633 store_constructor_field (rtx target
, unsigned HOST_WIDE_INT bitsize
,
5634 HOST_WIDE_INT bitpos
, enum machine_mode mode
,
5635 tree exp
, tree type
, int cleared
,
5636 alias_set_type alias_set
)
5638 if (TREE_CODE (exp
) == CONSTRUCTOR
5639 /* We can only call store_constructor recursively if the size and
5640 bit position are on a byte boundary. */
5641 && bitpos
% BITS_PER_UNIT
== 0
5642 && (bitsize
> 0 && bitsize
% BITS_PER_UNIT
== 0)
5643 /* If we have a nonzero bitpos for a register target, then we just
5644 let store_field do the bitfield handling. This is unlikely to
5645 generate unnecessary clear instructions anyways. */
5646 && (bitpos
== 0 || MEM_P (target
)))
5650 = adjust_address (target
,
5651 GET_MODE (target
) == BLKmode
5653 % GET_MODE_ALIGNMENT (GET_MODE (target
)))
5654 ? BLKmode
: VOIDmode
, bitpos
/ BITS_PER_UNIT
);
5657 /* Update the alias set, if required. */
5658 if (MEM_P (target
) && ! MEM_KEEP_ALIAS_SET_P (target
)
5659 && MEM_ALIAS_SET (target
) != 0)
5661 target
= copy_rtx (target
);
5662 set_mem_alias_set (target
, alias_set
);
5665 store_constructor (exp
, target
, cleared
, bitsize
/ BITS_PER_UNIT
);
5668 store_field (target
, bitsize
, bitpos
, 0, 0, mode
, exp
, type
, alias_set
,
5672 /* Store the value of constructor EXP into the rtx TARGET.
5673 TARGET is either a REG or a MEM; we know it cannot conflict, since
5674 safe_from_p has been called.
5675 CLEARED is true if TARGET is known to have been zero'd.
5676 SIZE is the number of bytes of TARGET we are allowed to modify: this
5677 may not be the same as the size of EXP if we are assigning to a field
5678 which has been packed to exclude padding bits. */
5681 store_constructor (tree exp
, rtx target
, int cleared
, HOST_WIDE_INT size
)
5683 tree type
= TREE_TYPE (exp
);
5684 #ifdef WORD_REGISTER_OPERATIONS
5685 HOST_WIDE_INT exp_size
= int_size_in_bytes (type
);
5688 switch (TREE_CODE (type
))
5692 case QUAL_UNION_TYPE
:
5694 unsigned HOST_WIDE_INT idx
;
5697 /* If size is zero or the target is already cleared, do nothing. */
5698 if (size
== 0 || cleared
)
5700 /* We either clear the aggregate or indicate the value is dead. */
5701 else if ((TREE_CODE (type
) == UNION_TYPE
5702 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
5703 && ! CONSTRUCTOR_ELTS (exp
))
5704 /* If the constructor is empty, clear the union. */
5706 clear_storage (target
, expr_size (exp
), BLOCK_OP_NORMAL
);
5710 /* If we are building a static constructor into a register,
5711 set the initial value as zero so we can fold the value into
5712 a constant. But if more than one register is involved,
5713 this probably loses. */
5714 else if (REG_P (target
) && TREE_STATIC (exp
)
5715 && GET_MODE_SIZE (GET_MODE (target
)) <= UNITS_PER_WORD
)
5717 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
5721 /* If the constructor has fewer fields than the structure or
5722 if we are initializing the structure to mostly zeros, clear
5723 the whole structure first. Don't do this if TARGET is a
5724 register whose mode size isn't equal to SIZE since
5725 clear_storage can't handle this case. */
5727 && (((int)VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (exp
))
5728 != fields_length (type
))
5729 || mostly_zeros_p (exp
))
5731 || ((HOST_WIDE_INT
) GET_MODE_SIZE (GET_MODE (target
))
5734 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
5738 if (REG_P (target
) && !cleared
)
5739 emit_clobber (target
);
5741 /* Store each element of the constructor into the
5742 corresponding field of TARGET. */
5743 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), idx
, field
, value
)
5745 enum machine_mode mode
;
5746 HOST_WIDE_INT bitsize
;
5747 HOST_WIDE_INT bitpos
= 0;
5749 rtx to_rtx
= target
;
5751 /* Just ignore missing fields. We cleared the whole
5752 structure, above, if any fields are missing. */
5756 if (cleared
&& initializer_zerop (value
))
5759 if (host_integerp (DECL_SIZE (field
), 1))
5760 bitsize
= tree_low_cst (DECL_SIZE (field
), 1);
5764 mode
= DECL_MODE (field
);
5765 if (DECL_BIT_FIELD (field
))
5768 offset
= DECL_FIELD_OFFSET (field
);
5769 if (host_integerp (offset
, 0)
5770 && host_integerp (bit_position (field
), 0))
5772 bitpos
= int_bit_position (field
);
5776 bitpos
= tree_low_cst (DECL_FIELD_BIT_OFFSET (field
), 0);
5780 enum machine_mode address_mode
;
5784 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset
,
5785 make_tree (TREE_TYPE (exp
),
5788 offset_rtx
= expand_normal (offset
);
5789 gcc_assert (MEM_P (to_rtx
));
5792 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (to_rtx
));
5793 if (GET_MODE (offset_rtx
) != address_mode
)
5794 offset_rtx
= convert_to_mode (address_mode
, offset_rtx
, 0);
5796 to_rtx
= offset_address (to_rtx
, offset_rtx
,
5797 highest_pow2_factor (offset
));
5800 #ifdef WORD_REGISTER_OPERATIONS
5801 /* If this initializes a field that is smaller than a
5802 word, at the start of a word, try to widen it to a full
5803 word. This special case allows us to output C++ member
5804 function initializations in a form that the optimizers
5807 && bitsize
< BITS_PER_WORD
5808 && bitpos
% BITS_PER_WORD
== 0
5809 && GET_MODE_CLASS (mode
) == MODE_INT
5810 && TREE_CODE (value
) == INTEGER_CST
5812 && bitpos
+ BITS_PER_WORD
<= exp_size
* BITS_PER_UNIT
)
5814 tree type
= TREE_TYPE (value
);
5816 if (TYPE_PRECISION (type
) < BITS_PER_WORD
)
5818 type
= lang_hooks
.types
.type_for_mode
5819 (word_mode
, TYPE_UNSIGNED (type
));
5820 value
= fold_convert (type
, value
);
5823 if (BYTES_BIG_ENDIAN
)
5825 = fold_build2 (LSHIFT_EXPR
, type
, value
,
5826 build_int_cst (type
,
5827 BITS_PER_WORD
- bitsize
));
5828 bitsize
= BITS_PER_WORD
;
5833 if (MEM_P (to_rtx
) && !MEM_KEEP_ALIAS_SET_P (to_rtx
)
5834 && DECL_NONADDRESSABLE_P (field
))
5836 to_rtx
= copy_rtx (to_rtx
);
5837 MEM_KEEP_ALIAS_SET_P (to_rtx
) = 1;
5840 store_constructor_field (to_rtx
, bitsize
, bitpos
, mode
,
5841 value
, type
, cleared
,
5842 get_alias_set (TREE_TYPE (field
)));
5849 unsigned HOST_WIDE_INT i
;
5852 tree elttype
= TREE_TYPE (type
);
5854 HOST_WIDE_INT minelt
= 0;
5855 HOST_WIDE_INT maxelt
= 0;
5857 domain
= TYPE_DOMAIN (type
);
5858 const_bounds_p
= (TYPE_MIN_VALUE (domain
)
5859 && TYPE_MAX_VALUE (domain
)
5860 && host_integerp (TYPE_MIN_VALUE (domain
), 0)
5861 && host_integerp (TYPE_MAX_VALUE (domain
), 0));
5863 /* If we have constant bounds for the range of the type, get them. */
5866 minelt
= tree_low_cst (TYPE_MIN_VALUE (domain
), 0);
5867 maxelt
= tree_low_cst (TYPE_MAX_VALUE (domain
), 0);
5870 /* If the constructor has fewer elements than the array, clear
5871 the whole array first. Similarly if this is static
5872 constructor of a non-BLKmode object. */
5875 else if (REG_P (target
) && TREE_STATIC (exp
))
5879 unsigned HOST_WIDE_INT idx
;
5881 HOST_WIDE_INT count
= 0, zero_count
= 0;
5882 need_to_clear
= ! const_bounds_p
;
5884 /* This loop is a more accurate version of the loop in
5885 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5886 is also needed to check for missing elements. */
5887 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), idx
, index
, value
)
5889 HOST_WIDE_INT this_node_count
;
5894 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
5896 tree lo_index
= TREE_OPERAND (index
, 0);
5897 tree hi_index
= TREE_OPERAND (index
, 1);
5899 if (! host_integerp (lo_index
, 1)
5900 || ! host_integerp (hi_index
, 1))
5906 this_node_count
= (tree_low_cst (hi_index
, 1)
5907 - tree_low_cst (lo_index
, 1) + 1);
5910 this_node_count
= 1;
5912 count
+= this_node_count
;
5913 if (mostly_zeros_p (value
))
5914 zero_count
+= this_node_count
;
5917 /* Clear the entire array first if there are any missing
5918 elements, or if the incidence of zero elements is >=
5921 && (count
< maxelt
- minelt
+ 1
5922 || 4 * zero_count
>= 3 * count
))
5926 if (need_to_clear
&& size
> 0)
5929 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
5931 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
5935 if (!cleared
&& REG_P (target
))
5936 /* Inform later passes that the old value is dead. */
5937 emit_clobber (target
);
5939 /* Store each element of the constructor into the
5940 corresponding element of TARGET, determined by counting the
5942 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), i
, index
, value
)
5944 enum machine_mode mode
;
5945 HOST_WIDE_INT bitsize
;
5946 HOST_WIDE_INT bitpos
;
5947 rtx xtarget
= target
;
5949 if (cleared
&& initializer_zerop (value
))
5952 mode
= TYPE_MODE (elttype
);
5953 if (mode
== BLKmode
)
5954 bitsize
= (host_integerp (TYPE_SIZE (elttype
), 1)
5955 ? tree_low_cst (TYPE_SIZE (elttype
), 1)
5958 bitsize
= GET_MODE_BITSIZE (mode
);
5960 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
5962 tree lo_index
= TREE_OPERAND (index
, 0);
5963 tree hi_index
= TREE_OPERAND (index
, 1);
5964 rtx index_r
, pos_rtx
;
5965 HOST_WIDE_INT lo
, hi
, count
;
5968 /* If the range is constant and "small", unroll the loop. */
5970 && host_integerp (lo_index
, 0)
5971 && host_integerp (hi_index
, 0)
5972 && (lo
= tree_low_cst (lo_index
, 0),
5973 hi
= tree_low_cst (hi_index
, 0),
5974 count
= hi
- lo
+ 1,
5977 || (host_integerp (TYPE_SIZE (elttype
), 1)
5978 && (tree_low_cst (TYPE_SIZE (elttype
), 1) * count
5981 lo
-= minelt
; hi
-= minelt
;
5982 for (; lo
<= hi
; lo
++)
5984 bitpos
= lo
* tree_low_cst (TYPE_SIZE (elttype
), 0);
5987 && !MEM_KEEP_ALIAS_SET_P (target
)
5988 && TREE_CODE (type
) == ARRAY_TYPE
5989 && TYPE_NONALIASED_COMPONENT (type
))
5991 target
= copy_rtx (target
);
5992 MEM_KEEP_ALIAS_SET_P (target
) = 1;
5995 store_constructor_field
5996 (target
, bitsize
, bitpos
, mode
, value
, type
, cleared
,
5997 get_alias_set (elttype
));
6002 rtx loop_start
= gen_label_rtx ();
6003 rtx loop_end
= gen_label_rtx ();
6006 expand_normal (hi_index
);
6008 index
= build_decl (EXPR_LOCATION (exp
),
6009 VAR_DECL
, NULL_TREE
, domain
);
6010 index_r
= gen_reg_rtx (promote_decl_mode (index
, NULL
));
6011 SET_DECL_RTL (index
, index_r
);
6012 store_expr (lo_index
, index_r
, 0, false);
6014 /* Build the head of the loop. */
6015 do_pending_stack_adjust ();
6016 emit_label (loop_start
);
6018 /* Assign value to element index. */
6020 fold_convert (ssizetype
,
6021 fold_build2 (MINUS_EXPR
,
6024 TYPE_MIN_VALUE (domain
)));
6027 size_binop (MULT_EXPR
, position
,
6028 fold_convert (ssizetype
,
6029 TYPE_SIZE_UNIT (elttype
)));
6031 pos_rtx
= expand_normal (position
);
6032 xtarget
= offset_address (target
, pos_rtx
,
6033 highest_pow2_factor (position
));
6034 xtarget
= adjust_address (xtarget
, mode
, 0);
6035 if (TREE_CODE (value
) == CONSTRUCTOR
)
6036 store_constructor (value
, xtarget
, cleared
,
6037 bitsize
/ BITS_PER_UNIT
);
6039 store_expr (value
, xtarget
, 0, false);
6041 /* Generate a conditional jump to exit the loop. */
6042 exit_cond
= build2 (LT_EXPR
, integer_type_node
,
6044 jumpif (exit_cond
, loop_end
, -1);
6046 /* Update the loop counter, and jump to the head of
6048 expand_assignment (index
,
6049 build2 (PLUS_EXPR
, TREE_TYPE (index
),
6050 index
, integer_one_node
),
6053 emit_jump (loop_start
);
6055 /* Build the end of the loop. */
6056 emit_label (loop_end
);
6059 else if ((index
!= 0 && ! host_integerp (index
, 0))
6060 || ! host_integerp (TYPE_SIZE (elttype
), 1))
6065 index
= ssize_int (1);
6068 index
= fold_convert (ssizetype
,
6069 fold_build2 (MINUS_EXPR
,
6072 TYPE_MIN_VALUE (domain
)));
6075 size_binop (MULT_EXPR
, index
,
6076 fold_convert (ssizetype
,
6077 TYPE_SIZE_UNIT (elttype
)));
6078 xtarget
= offset_address (target
,
6079 expand_normal (position
),
6080 highest_pow2_factor (position
));
6081 xtarget
= adjust_address (xtarget
, mode
, 0);
6082 store_expr (value
, xtarget
, 0, false);
6087 bitpos
= ((tree_low_cst (index
, 0) - minelt
)
6088 * tree_low_cst (TYPE_SIZE (elttype
), 1));
6090 bitpos
= (i
* tree_low_cst (TYPE_SIZE (elttype
), 1));
6092 if (MEM_P (target
) && !MEM_KEEP_ALIAS_SET_P (target
)
6093 && TREE_CODE (type
) == ARRAY_TYPE
6094 && TYPE_NONALIASED_COMPONENT (type
))
6096 target
= copy_rtx (target
);
6097 MEM_KEEP_ALIAS_SET_P (target
) = 1;
6099 store_constructor_field (target
, bitsize
, bitpos
, mode
, value
,
6100 type
, cleared
, get_alias_set (elttype
));
6108 unsigned HOST_WIDE_INT idx
;
6109 constructor_elt
*ce
;
6113 tree elttype
= TREE_TYPE (type
);
6114 int elt_size
= tree_low_cst (TYPE_SIZE (elttype
), 1);
6115 enum machine_mode eltmode
= TYPE_MODE (elttype
);
6116 HOST_WIDE_INT bitsize
;
6117 HOST_WIDE_INT bitpos
;
6118 rtvec vector
= NULL
;
6120 alias_set_type alias
;
6122 gcc_assert (eltmode
!= BLKmode
);
6124 n_elts
= TYPE_VECTOR_SUBPARTS (type
);
6125 if (REG_P (target
) && VECTOR_MODE_P (GET_MODE (target
)))
6127 enum machine_mode mode
= GET_MODE (target
);
6129 icode
= (int) optab_handler (vec_init_optab
, mode
);
6130 if (icode
!= CODE_FOR_nothing
)
6134 vector
= rtvec_alloc (n_elts
);
6135 for (i
= 0; i
< n_elts
; i
++)
6136 RTVEC_ELT (vector
, i
) = CONST0_RTX (GET_MODE_INNER (mode
));
6140 /* If the constructor has fewer elements than the vector,
6141 clear the whole array first. Similarly if this is static
6142 constructor of a non-BLKmode object. */
6145 else if (REG_P (target
) && TREE_STATIC (exp
))
6149 unsigned HOST_WIDE_INT count
= 0, zero_count
= 0;
6152 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
6154 int n_elts_here
= tree_low_cst
6155 (int_const_binop (TRUNC_DIV_EXPR
,
6156 TYPE_SIZE (TREE_TYPE (value
)),
6157 TYPE_SIZE (elttype
)), 1);
6159 count
+= n_elts_here
;
6160 if (mostly_zeros_p (value
))
6161 zero_count
+= n_elts_here
;
6164 /* Clear the entire vector first if there are any missing elements,
6165 or if the incidence of zero elements is >= 75%. */
6166 need_to_clear
= (count
< n_elts
|| 4 * zero_count
>= 3 * count
);
6169 if (need_to_clear
&& size
> 0 && !vector
)
6172 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
6174 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
6178 /* Inform later passes that the old value is dead. */
6179 if (!cleared
&& !vector
&& REG_P (target
))
6180 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
6183 alias
= MEM_ALIAS_SET (target
);
6185 alias
= get_alias_set (elttype
);
6187 /* Store each element of the constructor into the corresponding
6188 element of TARGET, determined by counting the elements. */
6189 for (idx
= 0, i
= 0;
6190 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (exp
), idx
, ce
);
6191 idx
++, i
+= bitsize
/ elt_size
)
6193 HOST_WIDE_INT eltpos
;
6194 tree value
= ce
->value
;
6196 bitsize
= tree_low_cst (TYPE_SIZE (TREE_TYPE (value
)), 1);
6197 if (cleared
&& initializer_zerop (value
))
6201 eltpos
= tree_low_cst (ce
->index
, 1);
6207 /* Vector CONSTRUCTORs should only be built from smaller
6208 vectors in the case of BLKmode vectors. */
6209 gcc_assert (TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
);
6210 RTVEC_ELT (vector
, eltpos
)
6211 = expand_normal (value
);
6215 enum machine_mode value_mode
=
6216 TREE_CODE (TREE_TYPE (value
)) == VECTOR_TYPE
6217 ? TYPE_MODE (TREE_TYPE (value
))
6219 bitpos
= eltpos
* elt_size
;
6220 store_constructor_field (target
, bitsize
, bitpos
,
6221 value_mode
, value
, type
,
6227 emit_insn (GEN_FCN (icode
)
6229 gen_rtx_PARALLEL (GET_MODE (target
), vector
)));
6238 /* Store the value of EXP (an expression tree)
6239 into a subfield of TARGET which has mode MODE and occupies
6240 BITSIZE bits, starting BITPOS bits from the start of TARGET.
6241 If MODE is VOIDmode, it means that we are storing into a bit-field.
6243 BITREGION_START is bitpos of the first bitfield in this region.
6244 BITREGION_END is the bitpos of the ending bitfield in this region.
6245 These two fields are 0, if the C++ memory model does not apply,
6246 or we are not interested in keeping track of bitfield regions.
6248 Always return const0_rtx unless we have something particular to
6251 TYPE is the type of the underlying object,
6253 ALIAS_SET is the alias set for the destination. This value will
6254 (in general) be different from that for TARGET, since TARGET is a
6255 reference to the containing structure.
6257 If NONTEMPORAL is true, try generating a nontemporal store. */
6260 store_field (rtx target
, HOST_WIDE_INT bitsize
, HOST_WIDE_INT bitpos
,
6261 unsigned HOST_WIDE_INT bitregion_start
,
6262 unsigned HOST_WIDE_INT bitregion_end
,
6263 enum machine_mode mode
, tree exp
, tree type
,
6264 alias_set_type alias_set
, bool nontemporal
)
6266 if (TREE_CODE (exp
) == ERROR_MARK
)
6269 /* If we have nothing to store, do nothing unless the expression has
6272 return expand_expr (exp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
6274 /* If we are storing into an unaligned field of an aligned union that is
6275 in a register, we may have the mode of TARGET being an integer mode but
6276 MODE == BLKmode. In that case, get an aligned object whose size and
6277 alignment are the same as TARGET and store TARGET into it (we can avoid
6278 the store if the field being stored is the entire width of TARGET). Then
6279 call ourselves recursively to store the field into a BLKmode version of
6280 that object. Finally, load from the object into TARGET. This is not
6281 very efficient in general, but should only be slightly more expensive
6282 than the otherwise-required unaligned accesses. Perhaps this can be
6283 cleaned up later. It's tempting to make OBJECT readonly, but it's set
6284 twice, once with emit_move_insn and once via store_field. */
6287 && (REG_P (target
) || GET_CODE (target
) == SUBREG
))
6289 rtx object
= assign_temp (type
, 0, 1, 1);
6290 rtx blk_object
= adjust_address (object
, BLKmode
, 0);
6292 if (bitsize
!= (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (target
)))
6293 emit_move_insn (object
, target
);
6295 store_field (blk_object
, bitsize
, bitpos
,
6296 bitregion_start
, bitregion_end
,
6297 mode
, exp
, type
, MEM_ALIAS_SET (blk_object
), nontemporal
);
6299 emit_move_insn (target
, object
);
6301 /* We want to return the BLKmode version of the data. */
6305 if (GET_CODE (target
) == CONCAT
)
6307 /* We're storing into a struct containing a single __complex. */
6309 gcc_assert (!bitpos
);
6310 return store_expr (exp
, target
, 0, nontemporal
);
6313 /* If the structure is in a register or if the component
6314 is a bit field, we cannot use addressing to access it.
6315 Use bit-field techniques or SUBREG to store in it. */
6317 if (mode
== VOIDmode
6318 || (mode
!= BLKmode
&& ! direct_store
[(int) mode
]
6319 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
6320 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
)
6322 || GET_CODE (target
) == SUBREG
6323 /* If the field isn't aligned enough to store as an ordinary memref,
6324 store it as a bit field. */
6326 && ((((MEM_ALIGN (target
) < GET_MODE_ALIGNMENT (mode
))
6327 || bitpos
% GET_MODE_ALIGNMENT (mode
))
6328 && SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (target
)))
6329 || (bitpos
% BITS_PER_UNIT
!= 0)))
6330 || (bitsize
>= 0 && mode
!= BLKmode
6331 && GET_MODE_BITSIZE (mode
) > bitsize
)
6332 /* If the RHS and field are a constant size and the size of the
6333 RHS isn't the same size as the bitfield, we must use bitfield
6336 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
6337 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)), bitsize
) != 0)
6338 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
6339 decl we must use bitfield operations. */
6341 && TREE_CODE (exp
) == MEM_REF
6342 && TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
6343 && DECL_P (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
6344 && !TREE_ADDRESSABLE (TREE_OPERAND (TREE_OPERAND (exp
, 0),0 ))
6345 && DECL_MODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)) != BLKmode
))
6350 /* If EXP is a NOP_EXPR of precision less than its mode, then that
6351 implies a mask operation. If the precision is the same size as
6352 the field we're storing into, that mask is redundant. This is
6353 particularly common with bit field assignments generated by the
6355 nop_def
= get_def_for_expr (exp
, NOP_EXPR
);
6358 tree type
= TREE_TYPE (exp
);
6359 if (INTEGRAL_TYPE_P (type
)
6360 && TYPE_PRECISION (type
) < GET_MODE_BITSIZE (TYPE_MODE (type
))
6361 && bitsize
== TYPE_PRECISION (type
))
6363 tree op
= gimple_assign_rhs1 (nop_def
);
6364 type
= TREE_TYPE (op
);
6365 if (INTEGRAL_TYPE_P (type
) && TYPE_PRECISION (type
) >= bitsize
)
6370 temp
= expand_normal (exp
);
6372 /* If BITSIZE is narrower than the size of the type of EXP
6373 we will be narrowing TEMP. Normally, what's wanted are the
6374 low-order bits. However, if EXP's type is a record and this is
6375 big-endian machine, we want the upper BITSIZE bits. */
6376 if (BYTES_BIG_ENDIAN
&& GET_MODE_CLASS (GET_MODE (temp
)) == MODE_INT
6377 && bitsize
< (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (temp
))
6378 && TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
6379 temp
= expand_shift (RSHIFT_EXPR
, GET_MODE (temp
), temp
,
6380 GET_MODE_BITSIZE (GET_MODE (temp
)) - bitsize
,
6383 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to MODE. */
6384 if (mode
!= VOIDmode
&& mode
!= BLKmode
6385 && mode
!= TYPE_MODE (TREE_TYPE (exp
)))
6386 temp
= convert_modes (mode
, TYPE_MODE (TREE_TYPE (exp
)), temp
, 1);
6388 /* If the modes of TEMP and TARGET are both BLKmode, both
6389 must be in memory and BITPOS must be aligned on a byte
6390 boundary. If so, we simply do a block copy. Likewise
6391 for a BLKmode-like TARGET. */
6392 if (GET_MODE (temp
) == BLKmode
6393 && (GET_MODE (target
) == BLKmode
6395 && GET_MODE_CLASS (GET_MODE (target
)) == MODE_INT
6396 && (bitpos
% BITS_PER_UNIT
) == 0
6397 && (bitsize
% BITS_PER_UNIT
) == 0)))
6399 gcc_assert (MEM_P (target
) && MEM_P (temp
)
6400 && (bitpos
% BITS_PER_UNIT
) == 0);
6402 target
= adjust_address (target
, VOIDmode
, bitpos
/ BITS_PER_UNIT
);
6403 emit_block_move (target
, temp
,
6404 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
6411 /* Store the value in the bitfield. */
6412 store_bit_field (target
, bitsize
, bitpos
,
6413 bitregion_start
, bitregion_end
,
6420 /* Now build a reference to just the desired component. */
6421 rtx to_rtx
= adjust_address (target
, mode
, bitpos
/ BITS_PER_UNIT
);
6423 if (to_rtx
== target
)
6424 to_rtx
= copy_rtx (to_rtx
);
6426 if (!MEM_KEEP_ALIAS_SET_P (to_rtx
) && MEM_ALIAS_SET (to_rtx
) != 0)
6427 set_mem_alias_set (to_rtx
, alias_set
);
6429 return store_expr (exp
, to_rtx
, 0, nontemporal
);
6433 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
6434 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
6435 codes and find the ultimate containing object, which we return.
6437 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
6438 bit position, and *PUNSIGNEDP to the signedness of the field.
6439 If the position of the field is variable, we store a tree
6440 giving the variable offset (in units) in *POFFSET.
6441 This offset is in addition to the bit position.
6442 If the position is not variable, we store 0 in *POFFSET.
6444 If any of the extraction expressions is volatile,
6445 we store 1 in *PVOLATILEP. Otherwise we don't change that.
6447 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
6448 Otherwise, it is a mode that can be used to access the field.
6450 If the field describes a variable-sized object, *PMODE is set to
6451 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
6452 this case, but the address of the object can be found.
6454 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
6455 look through nodes that serve as markers of a greater alignment than
6456 the one that can be deduced from the expression. These nodes make it
6457 possible for front-ends to prevent temporaries from being created by
6458 the middle-end on alignment considerations. For that purpose, the
6459 normal operating mode at high-level is to always pass FALSE so that
6460 the ultimate containing object is really returned; moreover, the
6461 associated predicate handled_component_p will always return TRUE
6462 on these nodes, thus indicating that they are essentially handled
6463 by get_inner_reference. TRUE should only be passed when the caller
6464 is scanning the expression in order to build another representation
6465 and specifically knows how to handle these nodes; as such, this is
6466 the normal operating mode in the RTL expanders. */
6469 get_inner_reference (tree exp
, HOST_WIDE_INT
*pbitsize
,
6470 HOST_WIDE_INT
*pbitpos
, tree
*poffset
,
6471 enum machine_mode
*pmode
, int *punsignedp
,
6472 int *pvolatilep
, bool keep_aligning
)
6475 enum machine_mode mode
= VOIDmode
;
6476 bool blkmode_bitfield
= false;
6477 tree offset
= size_zero_node
;
6478 double_int bit_offset
= double_int_zero
;
6480 /* First get the mode, signedness, and size. We do this from just the
6481 outermost expression. */
6483 if (TREE_CODE (exp
) == COMPONENT_REF
)
6485 tree field
= TREE_OPERAND (exp
, 1);
6486 size_tree
= DECL_SIZE (field
);
6487 if (!DECL_BIT_FIELD (field
))
6488 mode
= DECL_MODE (field
);
6489 else if (DECL_MODE (field
) == BLKmode
)
6490 blkmode_bitfield
= true;
6491 else if (TREE_THIS_VOLATILE (exp
)
6492 && flag_strict_volatile_bitfields
> 0)
6493 /* Volatile bitfields should be accessed in the mode of the
6494 field's type, not the mode computed based on the bit
6496 mode
= TYPE_MODE (DECL_BIT_FIELD_TYPE (field
));
6498 *punsignedp
= DECL_UNSIGNED (field
);
6500 else if (TREE_CODE (exp
) == BIT_FIELD_REF
)
6502 size_tree
= TREE_OPERAND (exp
, 1);
6503 *punsignedp
= (! INTEGRAL_TYPE_P (TREE_TYPE (exp
))
6504 || TYPE_UNSIGNED (TREE_TYPE (exp
)));
6506 /* For vector types, with the correct size of access, use the mode of
6508 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == VECTOR_TYPE
6509 && TREE_TYPE (exp
) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)))
6510 && tree_int_cst_equal (size_tree
, TYPE_SIZE (TREE_TYPE (exp
))))
6511 mode
= TYPE_MODE (TREE_TYPE (exp
));
6515 mode
= TYPE_MODE (TREE_TYPE (exp
));
6516 *punsignedp
= TYPE_UNSIGNED (TREE_TYPE (exp
));
6518 if (mode
== BLKmode
)
6519 size_tree
= TYPE_SIZE (TREE_TYPE (exp
));
6521 *pbitsize
= GET_MODE_BITSIZE (mode
);
6526 if (! host_integerp (size_tree
, 1))
6527 mode
= BLKmode
, *pbitsize
= -1;
6529 *pbitsize
= tree_low_cst (size_tree
, 1);
6532 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6533 and find the ultimate containing object. */
6536 switch (TREE_CODE (exp
))
6540 = double_int_add (bit_offset
,
6541 tree_to_double_int (TREE_OPERAND (exp
, 2)));
6546 tree field
= TREE_OPERAND (exp
, 1);
6547 tree this_offset
= component_ref_field_offset (exp
);
6549 /* If this field hasn't been filled in yet, don't go past it.
6550 This should only happen when folding expressions made during
6551 type construction. */
6552 if (this_offset
== 0)
6555 offset
= size_binop (PLUS_EXPR
, offset
, this_offset
);
6556 bit_offset
= double_int_add (bit_offset
,
6558 (DECL_FIELD_BIT_OFFSET (field
)));
6560 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6565 case ARRAY_RANGE_REF
:
6567 tree index
= TREE_OPERAND (exp
, 1);
6568 tree low_bound
= array_ref_low_bound (exp
);
6569 tree unit_size
= array_ref_element_size (exp
);
6571 /* We assume all arrays have sizes that are a multiple of a byte.
6572 First subtract the lower bound, if any, in the type of the
6573 index, then convert to sizetype and multiply by the size of
6574 the array element. */
6575 if (! integer_zerop (low_bound
))
6576 index
= fold_build2 (MINUS_EXPR
, TREE_TYPE (index
),
6579 offset
= size_binop (PLUS_EXPR
, offset
,
6580 size_binop (MULT_EXPR
,
6581 fold_convert (sizetype
, index
),
6590 bit_offset
= double_int_add (bit_offset
,
6591 uhwi_to_double_int (*pbitsize
));
6594 case VIEW_CONVERT_EXPR
:
6595 if (keep_aligning
&& STRICT_ALIGNMENT
6596 && (TYPE_ALIGN (TREE_TYPE (exp
))
6597 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp
, 0))))
6598 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp
, 0)))
6599 < BIGGEST_ALIGNMENT
)
6600 && (TYPE_ALIGN_OK (TREE_TYPE (exp
))
6601 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp
, 0)))))
6606 /* Hand back the decl for MEM[&decl, off]. */
6607 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
)
6609 tree off
= TREE_OPERAND (exp
, 1);
6610 if (!integer_zerop (off
))
6612 double_int boff
, coff
= mem_ref_offset (exp
);
6613 boff
= double_int_lshift (coff
,
6615 ? 3 : exact_log2 (BITS_PER_UNIT
),
6616 HOST_BITS_PER_DOUBLE_INT
, true);
6617 bit_offset
= double_int_add (bit_offset
, boff
);
6619 exp
= TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
6627 /* If any reference in the chain is volatile, the effect is volatile. */
6628 if (TREE_THIS_VOLATILE (exp
))
6631 exp
= TREE_OPERAND (exp
, 0);
6635 /* If OFFSET is constant, see if we can return the whole thing as a
6636 constant bit position. Make sure to handle overflow during
6638 if (TREE_CODE (offset
) == INTEGER_CST
)
6640 double_int tem
= tree_to_double_int (offset
);
6641 tem
= double_int_sext (tem
, TYPE_PRECISION (sizetype
));
6642 tem
= double_int_lshift (tem
,
6644 ? 3 : exact_log2 (BITS_PER_UNIT
),
6645 HOST_BITS_PER_DOUBLE_INT
, true);
6646 tem
= double_int_add (tem
, bit_offset
);
6647 if (double_int_fits_in_shwi_p (tem
))
6649 *pbitpos
= double_int_to_shwi (tem
);
6650 *poffset
= offset
= NULL_TREE
;
6654 /* Otherwise, split it up. */
6657 /* Avoid returning a negative bitpos as this may wreak havoc later. */
6658 if (double_int_negative_p (bit_offset
))
6661 = double_int_mask (BITS_PER_UNIT
== 8
6662 ? 3 : exact_log2 (BITS_PER_UNIT
));
6663 double_int tem
= double_int_and_not (bit_offset
, mask
);
6664 /* TEM is the bitpos rounded to BITS_PER_UNIT towards -Inf.
6665 Subtract it to BIT_OFFSET and add it (scaled) to OFFSET. */
6666 bit_offset
= double_int_sub (bit_offset
, tem
);
6667 tem
= double_int_rshift (tem
,
6669 ? 3 : exact_log2 (BITS_PER_UNIT
),
6670 HOST_BITS_PER_DOUBLE_INT
, true);
6671 offset
= size_binop (PLUS_EXPR
, offset
,
6672 double_int_to_tree (sizetype
, tem
));
6675 *pbitpos
= double_int_to_shwi (bit_offset
);
6679 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6680 if (mode
== VOIDmode
6682 && (*pbitpos
% BITS_PER_UNIT
) == 0
6683 && (*pbitsize
% BITS_PER_UNIT
) == 0)
6691 /* Given an expression EXP that may be a COMPONENT_REF, an ARRAY_REF or an
6692 ARRAY_RANGE_REF, look for whether EXP or any nested component-refs within
6693 EXP is marked as PACKED. */
6696 contains_packed_reference (const_tree exp
)
6698 bool packed_p
= false;
6702 switch (TREE_CODE (exp
))
6706 tree field
= TREE_OPERAND (exp
, 1);
6707 packed_p
= DECL_PACKED (field
)
6708 || TYPE_PACKED (TREE_TYPE (field
))
6709 || TYPE_PACKED (TREE_TYPE (exp
));
6717 case ARRAY_RANGE_REF
:
6720 case VIEW_CONVERT_EXPR
:
6726 exp
= TREE_OPERAND (exp
, 0);
6732 /* Return a tree of sizetype representing the size, in bytes, of the element
6733 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6736 array_ref_element_size (tree exp
)
6738 tree aligned_size
= TREE_OPERAND (exp
, 3);
6739 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6740 location_t loc
= EXPR_LOCATION (exp
);
6742 /* If a size was specified in the ARRAY_REF, it's the size measured
6743 in alignment units of the element type. So multiply by that value. */
6746 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6747 sizetype from another type of the same width and signedness. */
6748 if (TREE_TYPE (aligned_size
) != sizetype
)
6749 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
6750 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
6751 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
6754 /* Otherwise, take the size from that of the element type. Substitute
6755 any PLACEHOLDER_EXPR that we have. */
6757 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
6760 /* Return a tree representing the lower bound of the array mentioned in
6761 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6764 array_ref_low_bound (tree exp
)
6766 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6768 /* If a lower bound is specified in EXP, use it. */
6769 if (TREE_OPERAND (exp
, 2))
6770 return TREE_OPERAND (exp
, 2);
6772 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6773 substituting for a PLACEHOLDER_EXPR as needed. */
6774 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
6775 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
6777 /* Otherwise, return a zero of the appropriate type. */
6778 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
6781 /* Returns true if REF is an array reference to an array at the end of
6782 a structure. If this is the case, the array may be allocated larger
6783 than its upper bound implies. */
6786 array_at_struct_end_p (tree ref
)
6788 if (TREE_CODE (ref
) != ARRAY_REF
6789 && TREE_CODE (ref
) != ARRAY_RANGE_REF
)
6792 while (handled_component_p (ref
))
6794 /* If the reference chain contains a component reference to a
6795 non-union type and there follows another field the reference
6796 is not at the end of a structure. */
6797 if (TREE_CODE (ref
) == COMPONENT_REF
6798 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
6800 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
6801 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
6802 nextf
= DECL_CHAIN (nextf
);
6807 ref
= TREE_OPERAND (ref
, 0);
6810 /* If the reference is based on a declared entity, the size of the array
6811 is constrained by its given domain. */
6818 /* Return a tree representing the upper bound of the array mentioned in
6819 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6822 array_ref_up_bound (tree exp
)
6824 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6826 /* If there is a domain type and it has an upper bound, use it, substituting
6827 for a PLACEHOLDER_EXPR as needed. */
6828 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
6829 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
6831 /* Otherwise fail. */
6835 /* Return a tree representing the offset, in bytes, of the field referenced
6836 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6839 component_ref_field_offset (tree exp
)
6841 tree aligned_offset
= TREE_OPERAND (exp
, 2);
6842 tree field
= TREE_OPERAND (exp
, 1);
6843 location_t loc
= EXPR_LOCATION (exp
);
6845 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6846 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6850 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6851 sizetype from another type of the same width and signedness. */
6852 if (TREE_TYPE (aligned_offset
) != sizetype
)
6853 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
6854 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
6855 size_int (DECL_OFFSET_ALIGN (field
)
6859 /* Otherwise, take the offset from that of the field. Substitute
6860 any PLACEHOLDER_EXPR that we have. */
6862 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
6865 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
6867 static unsigned HOST_WIDE_INT
6868 target_align (const_tree target
)
6870 /* We might have a chain of nested references with intermediate misaligning
6871 bitfields components, so need to recurse to find out. */
6873 unsigned HOST_WIDE_INT this_align
, outer_align
;
6875 switch (TREE_CODE (target
))
6881 this_align
= DECL_ALIGN (TREE_OPERAND (target
, 1));
6882 outer_align
= target_align (TREE_OPERAND (target
, 0));
6883 return MIN (this_align
, outer_align
);
6886 case ARRAY_RANGE_REF
:
6887 this_align
= TYPE_ALIGN (TREE_TYPE (target
));
6888 outer_align
= target_align (TREE_OPERAND (target
, 0));
6889 return MIN (this_align
, outer_align
);
6892 case NON_LVALUE_EXPR
:
6893 case VIEW_CONVERT_EXPR
:
6894 this_align
= TYPE_ALIGN (TREE_TYPE (target
));
6895 outer_align
= target_align (TREE_OPERAND (target
, 0));
6896 return MAX (this_align
, outer_align
);
6899 return TYPE_ALIGN (TREE_TYPE (target
));
6904 /* Given an rtx VALUE that may contain additions and multiplications, return
6905 an equivalent value that just refers to a register, memory, or constant.
6906 This is done by generating instructions to perform the arithmetic and
6907 returning a pseudo-register containing the value.
6909 The returned value may be a REG, SUBREG, MEM or constant. */
6912 force_operand (rtx value
, rtx target
)
6915 /* Use subtarget as the target for operand 0 of a binary operation. */
6916 rtx subtarget
= get_subtarget (target
);
6917 enum rtx_code code
= GET_CODE (value
);
6919 /* Check for subreg applied to an expression produced by loop optimizer. */
6921 && !REG_P (SUBREG_REG (value
))
6922 && !MEM_P (SUBREG_REG (value
)))
6925 = simplify_gen_subreg (GET_MODE (value
),
6926 force_reg (GET_MODE (SUBREG_REG (value
)),
6927 force_operand (SUBREG_REG (value
),
6929 GET_MODE (SUBREG_REG (value
)),
6930 SUBREG_BYTE (value
));
6931 code
= GET_CODE (value
);
6934 /* Check for a PIC address load. */
6935 if ((code
== PLUS
|| code
== MINUS
)
6936 && XEXP (value
, 0) == pic_offset_table_rtx
6937 && (GET_CODE (XEXP (value
, 1)) == SYMBOL_REF
6938 || GET_CODE (XEXP (value
, 1)) == LABEL_REF
6939 || GET_CODE (XEXP (value
, 1)) == CONST
))
6942 subtarget
= gen_reg_rtx (GET_MODE (value
));
6943 emit_move_insn (subtarget
, value
);
6947 if (ARITHMETIC_P (value
))
6949 op2
= XEXP (value
, 1);
6950 if (!CONSTANT_P (op2
) && !(REG_P (op2
) && op2
!= subtarget
))
6952 if (code
== MINUS
&& CONST_INT_P (op2
))
6955 op2
= negate_rtx (GET_MODE (value
), op2
);
6958 /* Check for an addition with OP2 a constant integer and our first
6959 operand a PLUS of a virtual register and something else. In that
6960 case, we want to emit the sum of the virtual register and the
6961 constant first and then add the other value. This allows virtual
6962 register instantiation to simply modify the constant rather than
6963 creating another one around this addition. */
6964 if (code
== PLUS
&& CONST_INT_P (op2
)
6965 && GET_CODE (XEXP (value
, 0)) == PLUS
6966 && REG_P (XEXP (XEXP (value
, 0), 0))
6967 && REGNO (XEXP (XEXP (value
, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6968 && REGNO (XEXP (XEXP (value
, 0), 0)) <= LAST_VIRTUAL_REGISTER
)
6970 rtx temp
= expand_simple_binop (GET_MODE (value
), code
,
6971 XEXP (XEXP (value
, 0), 0), op2
,
6972 subtarget
, 0, OPTAB_LIB_WIDEN
);
6973 return expand_simple_binop (GET_MODE (value
), code
, temp
,
6974 force_operand (XEXP (XEXP (value
,
6976 target
, 0, OPTAB_LIB_WIDEN
);
6979 op1
= force_operand (XEXP (value
, 0), subtarget
);
6980 op2
= force_operand (op2
, NULL_RTX
);
6984 return expand_mult (GET_MODE (value
), op1
, op2
, target
, 1);
6986 if (!INTEGRAL_MODE_P (GET_MODE (value
)))
6987 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
6988 target
, 1, OPTAB_LIB_WIDEN
);
6990 return expand_divmod (0,
6991 FLOAT_MODE_P (GET_MODE (value
))
6992 ? RDIV_EXPR
: TRUNC_DIV_EXPR
,
6993 GET_MODE (value
), op1
, op2
, target
, 0);
6995 return expand_divmod (1, TRUNC_MOD_EXPR
, GET_MODE (value
), op1
, op2
,
6998 return expand_divmod (0, TRUNC_DIV_EXPR
, GET_MODE (value
), op1
, op2
,
7001 return expand_divmod (1, TRUNC_MOD_EXPR
, GET_MODE (value
), op1
, op2
,
7004 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
7005 target
, 0, OPTAB_LIB_WIDEN
);
7007 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
7008 target
, 1, OPTAB_LIB_WIDEN
);
7011 if (UNARY_P (value
))
7014 target
= gen_reg_rtx (GET_MODE (value
));
7015 op1
= force_operand (XEXP (value
, 0), NULL_RTX
);
7022 case FLOAT_TRUNCATE
:
7023 convert_move (target
, op1
, code
== ZERO_EXTEND
);
7028 expand_fix (target
, op1
, code
== UNSIGNED_FIX
);
7032 case UNSIGNED_FLOAT
:
7033 expand_float (target
, op1
, code
== UNSIGNED_FLOAT
);
7037 return expand_simple_unop (GET_MODE (value
), code
, op1
, target
, 0);
7041 #ifdef INSN_SCHEDULING
7042 /* On machines that have insn scheduling, we want all memory reference to be
7043 explicit, so we need to deal with such paradoxical SUBREGs. */
7044 if (paradoxical_subreg_p (value
) && MEM_P (SUBREG_REG (value
)))
7046 = simplify_gen_subreg (GET_MODE (value
),
7047 force_reg (GET_MODE (SUBREG_REG (value
)),
7048 force_operand (SUBREG_REG (value
),
7050 GET_MODE (SUBREG_REG (value
)),
7051 SUBREG_BYTE (value
));
7057 /* Subroutine of expand_expr: return nonzero iff there is no way that
7058 EXP can reference X, which is being modified. TOP_P is nonzero if this
7059 call is going to be used to determine whether we need a temporary
7060 for EXP, as opposed to a recursive call to this function.
7062 It is always safe for this routine to return zero since it merely
7063 searches for optimization opportunities. */
7066 safe_from_p (const_rtx x
, tree exp
, int top_p
)
7072 /* If EXP has varying size, we MUST use a target since we currently
7073 have no way of allocating temporaries of variable size
7074 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
7075 So we assume here that something at a higher level has prevented a
7076 clash. This is somewhat bogus, but the best we can do. Only
7077 do this when X is BLKmode and when we are at the top level. */
7078 || (top_p
&& TREE_TYPE (exp
) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp
))
7079 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) != INTEGER_CST
7080 && (TREE_CODE (TREE_TYPE (exp
)) != ARRAY_TYPE
7081 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)) == NULL_TREE
7082 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)))
7084 && GET_MODE (x
) == BLKmode
)
7085 /* If X is in the outgoing argument area, it is always safe. */
7087 && (XEXP (x
, 0) == virtual_outgoing_args_rtx
7088 || (GET_CODE (XEXP (x
, 0)) == PLUS
7089 && XEXP (XEXP (x
, 0), 0) == virtual_outgoing_args_rtx
))))
7092 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
7093 find the underlying pseudo. */
7094 if (GET_CODE (x
) == SUBREG
)
7097 if (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
7101 /* Now look at our tree code and possibly recurse. */
7102 switch (TREE_CODE_CLASS (TREE_CODE (exp
)))
7104 case tcc_declaration
:
7105 exp_rtl
= DECL_RTL_IF_SET (exp
);
7111 case tcc_exceptional
:
7112 if (TREE_CODE (exp
) == TREE_LIST
)
7116 if (TREE_VALUE (exp
) && !safe_from_p (x
, TREE_VALUE (exp
), 0))
7118 exp
= TREE_CHAIN (exp
);
7121 if (TREE_CODE (exp
) != TREE_LIST
)
7122 return safe_from_p (x
, exp
, 0);
7125 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
7127 constructor_elt
*ce
;
7128 unsigned HOST_WIDE_INT idx
;
7130 FOR_EACH_VEC_ELT (constructor_elt
, CONSTRUCTOR_ELTS (exp
), idx
, ce
)
7131 if ((ce
->index
!= NULL_TREE
&& !safe_from_p (x
, ce
->index
, 0))
7132 || !safe_from_p (x
, ce
->value
, 0))
7136 else if (TREE_CODE (exp
) == ERROR_MARK
)
7137 return 1; /* An already-visited SAVE_EXPR? */
7142 /* The only case we look at here is the DECL_INITIAL inside a
7144 return (TREE_CODE (exp
) != DECL_EXPR
7145 || TREE_CODE (DECL_EXPR_DECL (exp
)) != VAR_DECL
7146 || !DECL_INITIAL (DECL_EXPR_DECL (exp
))
7147 || safe_from_p (x
, DECL_INITIAL (DECL_EXPR_DECL (exp
)), 0));
7150 case tcc_comparison
:
7151 if (!safe_from_p (x
, TREE_OPERAND (exp
, 1), 0))
7156 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
7158 case tcc_expression
:
7161 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
7162 the expression. If it is set, we conflict iff we are that rtx or
7163 both are in memory. Otherwise, we check all operands of the
7164 expression recursively. */
7166 switch (TREE_CODE (exp
))
7169 /* If the operand is static or we are static, we can't conflict.
7170 Likewise if we don't conflict with the operand at all. */
7171 if (staticp (TREE_OPERAND (exp
, 0))
7172 || TREE_STATIC (exp
)
7173 || safe_from_p (x
, TREE_OPERAND (exp
, 0), 0))
7176 /* Otherwise, the only way this can conflict is if we are taking
7177 the address of a DECL a that address if part of X, which is
7179 exp
= TREE_OPERAND (exp
, 0);
7182 if (!DECL_RTL_SET_P (exp
)
7183 || !MEM_P (DECL_RTL (exp
)))
7186 exp_rtl
= XEXP (DECL_RTL (exp
), 0);
7192 && alias_sets_conflict_p (MEM_ALIAS_SET (x
),
7193 get_alias_set (exp
)))
7198 /* Assume that the call will clobber all hard registers and
7200 if ((REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
7205 case WITH_CLEANUP_EXPR
:
7206 case CLEANUP_POINT_EXPR
:
7207 /* Lowered by gimplify.c. */
7211 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
7217 /* If we have an rtx, we do not need to scan our operands. */
7221 nops
= TREE_OPERAND_LENGTH (exp
);
7222 for (i
= 0; i
< nops
; i
++)
7223 if (TREE_OPERAND (exp
, i
) != 0
7224 && ! safe_from_p (x
, TREE_OPERAND (exp
, i
), 0))
7230 /* Should never get a type here. */
7234 /* If we have an rtl, find any enclosed object. Then see if we conflict
7238 if (GET_CODE (exp_rtl
) == SUBREG
)
7240 exp_rtl
= SUBREG_REG (exp_rtl
);
7242 && REGNO (exp_rtl
) < FIRST_PSEUDO_REGISTER
)
7246 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
7247 are memory and they conflict. */
7248 return ! (rtx_equal_p (x
, exp_rtl
)
7249 || (MEM_P (x
) && MEM_P (exp_rtl
)
7250 && true_dependence (exp_rtl
, VOIDmode
, x
)));
7253 /* If we reach here, it is safe. */
7258 /* Return the highest power of two that EXP is known to be a multiple of.
7259 This is used in updating alignment of MEMs in array references. */
7261 unsigned HOST_WIDE_INT
7262 highest_pow2_factor (const_tree exp
)
7264 unsigned HOST_WIDE_INT c0
, c1
;
7266 switch (TREE_CODE (exp
))
7269 /* We can find the lowest bit that's a one. If the low
7270 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
7271 We need to handle this case since we can find it in a COND_EXPR,
7272 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
7273 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
7275 if (TREE_OVERFLOW (exp
))
7276 return BIGGEST_ALIGNMENT
;
7279 /* Note: tree_low_cst is intentionally not used here,
7280 we don't care about the upper bits. */
7281 c0
= TREE_INT_CST_LOW (exp
);
7283 return c0
? c0
: BIGGEST_ALIGNMENT
;
7287 case PLUS_EXPR
: case MINUS_EXPR
: case MIN_EXPR
: case MAX_EXPR
:
7288 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
7289 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
7290 return MIN (c0
, c1
);
7293 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
7294 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
7297 case ROUND_DIV_EXPR
: case TRUNC_DIV_EXPR
: case FLOOR_DIV_EXPR
:
7299 if (integer_pow2p (TREE_OPERAND (exp
, 1))
7300 && host_integerp (TREE_OPERAND (exp
, 1), 1))
7302 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
7303 c1
= tree_low_cst (TREE_OPERAND (exp
, 1), 1);
7304 return MAX (1, c0
/ c1
);
7309 /* The highest power of two of a bit-and expression is the maximum of
7310 that of its operands. We typically get here for a complex LHS and
7311 a constant negative power of two on the RHS to force an explicit
7312 alignment, so don't bother looking at the LHS. */
7313 return highest_pow2_factor (TREE_OPERAND (exp
, 1));
7317 return highest_pow2_factor (TREE_OPERAND (exp
, 0));
7320 return highest_pow2_factor (TREE_OPERAND (exp
, 1));
7323 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
7324 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 2));
7325 return MIN (c0
, c1
);
7334 /* Similar, except that the alignment requirements of TARGET are
7335 taken into account. Assume it is at least as aligned as its
7336 type, unless it is a COMPONENT_REF in which case the layout of
7337 the structure gives the alignment. */
7339 static unsigned HOST_WIDE_INT
7340 highest_pow2_factor_for_target (const_tree target
, const_tree exp
)
7342 unsigned HOST_WIDE_INT talign
= target_align (target
) / BITS_PER_UNIT
;
7343 unsigned HOST_WIDE_INT factor
= highest_pow2_factor (exp
);
7345 return MAX (factor
, talign
);
7348 /* Subroutine of expand_expr. Expand the two operands of a binary
7349 expression EXP0 and EXP1 placing the results in OP0 and OP1.
7350 The value may be stored in TARGET if TARGET is nonzero. The
7351 MODIFIER argument is as documented by expand_expr. */
7354 expand_operands (tree exp0
, tree exp1
, rtx target
, rtx
*op0
, rtx
*op1
,
7355 enum expand_modifier modifier
)
7357 if (! safe_from_p (target
, exp1
, 1))
7359 if (operand_equal_p (exp0
, exp1
, 0))
7361 *op0
= expand_expr (exp0
, target
, VOIDmode
, modifier
);
7362 *op1
= copy_rtx (*op0
);
7366 /* If we need to preserve evaluation order, copy exp0 into its own
7367 temporary variable so that it can't be clobbered by exp1. */
7368 if (flag_evaluation_order
&& TREE_SIDE_EFFECTS (exp1
))
7369 exp0
= save_expr (exp0
);
7370 *op0
= expand_expr (exp0
, target
, VOIDmode
, modifier
);
7371 *op1
= expand_expr (exp1
, NULL_RTX
, VOIDmode
, modifier
);
7376 /* Return a MEM that contains constant EXP. DEFER is as for
7377 output_constant_def and MODIFIER is as for expand_expr. */
7380 expand_expr_constant (tree exp
, int defer
, enum expand_modifier modifier
)
7384 mem
= output_constant_def (exp
, defer
);
7385 if (modifier
!= EXPAND_INITIALIZER
)
7386 mem
= use_anchored_address (mem
);
7390 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
7391 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7394 expand_expr_addr_expr_1 (tree exp
, rtx target
, enum machine_mode tmode
,
7395 enum expand_modifier modifier
, addr_space_t as
)
7397 rtx result
, subtarget
;
7399 HOST_WIDE_INT bitsize
, bitpos
;
7400 int volatilep
, unsignedp
;
7401 enum machine_mode mode1
;
7403 /* If we are taking the address of a constant and are at the top level,
7404 we have to use output_constant_def since we can't call force_const_mem
7406 /* ??? This should be considered a front-end bug. We should not be
7407 generating ADDR_EXPR of something that isn't an LVALUE. The only
7408 exception here is STRING_CST. */
7409 if (CONSTANT_CLASS_P (exp
))
7411 result
= XEXP (expand_expr_constant (exp
, 0, modifier
), 0);
7412 if (modifier
< EXPAND_SUM
)
7413 result
= force_operand (result
, target
);
7417 /* Everything must be something allowed by is_gimple_addressable. */
7418 switch (TREE_CODE (exp
))
7421 /* This case will happen via recursion for &a->b. */
7422 return expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, modifier
);
7426 tree tem
= TREE_OPERAND (exp
, 0);
7427 if (!integer_zerop (TREE_OPERAND (exp
, 1)))
7428 tem
= fold_build_pointer_plus (tem
, TREE_OPERAND (exp
, 1));
7429 return expand_expr (tem
, target
, tmode
, modifier
);
7433 /* Expand the initializer like constants above. */
7434 result
= XEXP (expand_expr_constant (DECL_INITIAL (exp
),
7436 if (modifier
< EXPAND_SUM
)
7437 result
= force_operand (result
, target
);
7441 /* The real part of the complex number is always first, therefore
7442 the address is the same as the address of the parent object. */
7445 inner
= TREE_OPERAND (exp
, 0);
7449 /* The imaginary part of the complex number is always second.
7450 The expression is therefore always offset by the size of the
7453 bitpos
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp
)));
7454 inner
= TREE_OPERAND (exp
, 0);
7458 /* If the object is a DECL, then expand it for its rtl. Don't bypass
7459 expand_expr, as that can have various side effects; LABEL_DECLs for
7460 example, may not have their DECL_RTL set yet. Expand the rtl of
7461 CONSTRUCTORs too, which should yield a memory reference for the
7462 constructor's contents. Assume language specific tree nodes can
7463 be expanded in some interesting way. */
7464 gcc_assert (TREE_CODE (exp
) < LAST_AND_UNUSED_TREE_CODE
);
7466 || TREE_CODE (exp
) == CONSTRUCTOR
7467 || TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
)
7469 result
= expand_expr (exp
, target
, tmode
,
7470 modifier
== EXPAND_INITIALIZER
7471 ? EXPAND_INITIALIZER
: EXPAND_CONST_ADDRESS
);
7473 /* If the DECL isn't in memory, then the DECL wasn't properly
7474 marked TREE_ADDRESSABLE, which will be either a front-end
7475 or a tree optimizer bug. */
7477 if (TREE_ADDRESSABLE (exp
)
7479 && ! targetm
.calls
.allocate_stack_slots_for_args())
7481 error ("local frame unavailable (naked function?)");
7485 gcc_assert (MEM_P (result
));
7486 result
= XEXP (result
, 0);
7488 /* ??? Is this needed anymore? */
7490 TREE_USED (exp
) = 1;
7492 if (modifier
!= EXPAND_INITIALIZER
7493 && modifier
!= EXPAND_CONST_ADDRESS
7494 && modifier
!= EXPAND_SUM
)
7495 result
= force_operand (result
, target
);
7499 /* Pass FALSE as the last argument to get_inner_reference although
7500 we are expanding to RTL. The rationale is that we know how to
7501 handle "aligning nodes" here: we can just bypass them because
7502 they won't change the final object whose address will be returned
7503 (they actually exist only for that purpose). */
7504 inner
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
7505 &mode1
, &unsignedp
, &volatilep
, false);
7509 /* We must have made progress. */
7510 gcc_assert (inner
!= exp
);
7512 subtarget
= offset
|| bitpos
? NULL_RTX
: target
;
7513 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
7514 inner alignment, force the inner to be sufficiently aligned. */
7515 if (CONSTANT_CLASS_P (inner
)
7516 && TYPE_ALIGN (TREE_TYPE (inner
)) < TYPE_ALIGN (TREE_TYPE (exp
)))
7518 inner
= copy_node (inner
);
7519 TREE_TYPE (inner
) = copy_node (TREE_TYPE (inner
));
7520 TYPE_ALIGN (TREE_TYPE (inner
)) = TYPE_ALIGN (TREE_TYPE (exp
));
7521 TYPE_USER_ALIGN (TREE_TYPE (inner
)) = 1;
7523 result
= expand_expr_addr_expr_1 (inner
, subtarget
, tmode
, modifier
, as
);
7529 if (modifier
!= EXPAND_NORMAL
)
7530 result
= force_operand (result
, NULL
);
7531 tmp
= expand_expr (offset
, NULL_RTX
, tmode
,
7532 modifier
== EXPAND_INITIALIZER
7533 ? EXPAND_INITIALIZER
: EXPAND_NORMAL
);
7535 result
= convert_memory_address_addr_space (tmode
, result
, as
);
7536 tmp
= convert_memory_address_addr_space (tmode
, tmp
, as
);
7538 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
7539 result
= simplify_gen_binary (PLUS
, tmode
, result
, tmp
);
7542 subtarget
= bitpos
? NULL_RTX
: target
;
7543 result
= expand_simple_binop (tmode
, PLUS
, result
, tmp
, subtarget
,
7544 1, OPTAB_LIB_WIDEN
);
7550 /* Someone beforehand should have rejected taking the address
7551 of such an object. */
7552 gcc_assert ((bitpos
% BITS_PER_UNIT
) == 0);
7554 result
= plus_constant (result
, bitpos
/ BITS_PER_UNIT
);
7555 if (modifier
< EXPAND_SUM
)
7556 result
= force_operand (result
, target
);
7562 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
7563 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7566 expand_expr_addr_expr (tree exp
, rtx target
, enum machine_mode tmode
,
7567 enum expand_modifier modifier
)
7569 addr_space_t as
= ADDR_SPACE_GENERIC
;
7570 enum machine_mode address_mode
= Pmode
;
7571 enum machine_mode pointer_mode
= ptr_mode
;
7572 enum machine_mode rmode
;
7575 /* Target mode of VOIDmode says "whatever's natural". */
7576 if (tmode
== VOIDmode
)
7577 tmode
= TYPE_MODE (TREE_TYPE (exp
));
7579 if (POINTER_TYPE_P (TREE_TYPE (exp
)))
7581 as
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp
)));
7582 address_mode
= targetm
.addr_space
.address_mode (as
);
7583 pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7586 /* We can get called with some Weird Things if the user does silliness
7587 like "(short) &a". In that case, convert_memory_address won't do
7588 the right thing, so ignore the given target mode. */
7589 if (tmode
!= address_mode
&& tmode
!= pointer_mode
)
7590 tmode
= address_mode
;
7592 result
= expand_expr_addr_expr_1 (TREE_OPERAND (exp
, 0), target
,
7593 tmode
, modifier
, as
);
7595 /* Despite expand_expr claims concerning ignoring TMODE when not
7596 strictly convenient, stuff breaks if we don't honor it. Note
7597 that combined with the above, we only do this for pointer modes. */
7598 rmode
= GET_MODE (result
);
7599 if (rmode
== VOIDmode
)
7602 result
= convert_memory_address_addr_space (tmode
, result
, as
);
7607 /* Generate code for computing CONSTRUCTOR EXP.
7608 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7609 is TRUE, instead of creating a temporary variable in memory
7610 NULL is returned and the caller needs to handle it differently. */
7613 expand_constructor (tree exp
, rtx target
, enum expand_modifier modifier
,
7614 bool avoid_temp_mem
)
7616 tree type
= TREE_TYPE (exp
);
7617 enum machine_mode mode
= TYPE_MODE (type
);
7619 /* Try to avoid creating a temporary at all. This is possible
7620 if all of the initializer is zero.
7621 FIXME: try to handle all [0..255] initializers we can handle
7623 if (TREE_STATIC (exp
)
7624 && !TREE_ADDRESSABLE (exp
)
7625 && target
!= 0 && mode
== BLKmode
7626 && all_zeros_p (exp
))
7628 clear_storage (target
, expr_size (exp
), BLOCK_OP_NORMAL
);
7632 /* All elts simple constants => refer to a constant in memory. But
7633 if this is a non-BLKmode mode, let it store a field at a time
7634 since that should make a CONST_INT or CONST_DOUBLE when we
7635 fold. Likewise, if we have a target we can use, it is best to
7636 store directly into the target unless the type is large enough
7637 that memcpy will be used. If we are making an initializer and
7638 all operands are constant, put it in memory as well.
7640 FIXME: Avoid trying to fill vector constructors piece-meal.
7641 Output them with output_constant_def below unless we're sure
7642 they're zeros. This should go away when vector initializers
7643 are treated like VECTOR_CST instead of arrays. */
7644 if ((TREE_STATIC (exp
)
7645 && ((mode
== BLKmode
7646 && ! (target
!= 0 && safe_from_p (target
, exp
, 1)))
7647 || TREE_ADDRESSABLE (exp
)
7648 || (host_integerp (TYPE_SIZE_UNIT (type
), 1)
7649 && (! MOVE_BY_PIECES_P
7650 (tree_low_cst (TYPE_SIZE_UNIT (type
), 1),
7652 && ! mostly_zeros_p (exp
))))
7653 || ((modifier
== EXPAND_INITIALIZER
|| modifier
== EXPAND_CONST_ADDRESS
)
7654 && TREE_CONSTANT (exp
)))
7661 constructor
= expand_expr_constant (exp
, 1, modifier
);
7663 if (modifier
!= EXPAND_CONST_ADDRESS
7664 && modifier
!= EXPAND_INITIALIZER
7665 && modifier
!= EXPAND_SUM
)
7666 constructor
= validize_mem (constructor
);
7671 /* Handle calls that pass values in multiple non-contiguous
7672 locations. The Irix 6 ABI has examples of this. */
7673 if (target
== 0 || ! safe_from_p (target
, exp
, 1)
7674 || GET_CODE (target
) == PARALLEL
|| modifier
== EXPAND_STACK_PARM
)
7680 = assign_temp (build_qualified_type (type
, (TYPE_QUALS (type
)
7681 | (TREE_READONLY (exp
)
7682 * TYPE_QUAL_CONST
))),
7683 0, TREE_ADDRESSABLE (exp
), 1);
7686 store_constructor (exp
, target
, 0, int_expr_size (exp
));
7691 /* expand_expr: generate code for computing expression EXP.
7692 An rtx for the computed value is returned. The value is never null.
7693 In the case of a void EXP, const0_rtx is returned.
7695 The value may be stored in TARGET if TARGET is nonzero.
7696 TARGET is just a suggestion; callers must assume that
7697 the rtx returned may not be the same as TARGET.
7699 If TARGET is CONST0_RTX, it means that the value will be ignored.
7701 If TMODE is not VOIDmode, it suggests generating the
7702 result in mode TMODE. But this is done only when convenient.
7703 Otherwise, TMODE is ignored and the value generated in its natural mode.
7704 TMODE is just a suggestion; callers must assume that
7705 the rtx returned may not have mode TMODE.
7707 Note that TARGET may have neither TMODE nor MODE. In that case, it
7708 probably will not be used.
7710 If MODIFIER is EXPAND_SUM then when EXP is an addition
7711 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7712 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7713 products as above, or REG or MEM, or constant.
7714 Ordinarily in such cases we would output mul or add instructions
7715 and then return a pseudo reg containing the sum.
7717 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7718 it also marks a label as absolutely required (it can't be dead).
7719 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7720 This is used for outputting expressions used in initializers.
7722 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7723 with a constant address even if that address is not normally legitimate.
7724 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7726 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7727 a call parameter. Such targets require special care as we haven't yet
7728 marked TARGET so that it's safe from being trashed by libcalls. We
7729 don't want to use TARGET for anything but the final result;
7730 Intermediate values must go elsewhere. Additionally, calls to
7731 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7733 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7734 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7735 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7736 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7740 expand_expr_real (tree exp
, rtx target
, enum machine_mode tmode
,
7741 enum expand_modifier modifier
, rtx
*alt_rtl
)
7745 /* Handle ERROR_MARK before anybody tries to access its type. */
7746 if (TREE_CODE (exp
) == ERROR_MARK
7747 || (TREE_CODE (TREE_TYPE (exp
)) == ERROR_MARK
))
7749 ret
= CONST0_RTX (tmode
);
7750 return ret
? ret
: const0_rtx
;
7753 /* If this is an expression of some kind and it has an associated line
7754 number, then emit the line number before expanding the expression.
7756 We need to save and restore the file and line information so that
7757 errors discovered during expansion are emitted with the right
7758 information. It would be better of the diagnostic routines
7759 used the file/line information embedded in the tree nodes rather
7761 if (cfun
&& EXPR_HAS_LOCATION (exp
))
7763 location_t saved_location
= input_location
;
7764 location_t saved_curr_loc
= get_curr_insn_source_location ();
7765 tree saved_block
= get_curr_insn_block ();
7766 input_location
= EXPR_LOCATION (exp
);
7767 set_curr_insn_source_location (input_location
);
7769 /* Record where the insns produced belong. */
7770 set_curr_insn_block (TREE_BLOCK (exp
));
7772 ret
= expand_expr_real_1 (exp
, target
, tmode
, modifier
, alt_rtl
);
7774 input_location
= saved_location
;
7775 set_curr_insn_block (saved_block
);
7776 set_curr_insn_source_location (saved_curr_loc
);
7780 ret
= expand_expr_real_1 (exp
, target
, tmode
, modifier
, alt_rtl
);
7787 expand_expr_real_2 (sepops ops
, rtx target
, enum machine_mode tmode
,
7788 enum expand_modifier modifier
)
7790 rtx op0
, op1
, op2
, temp
;
7793 enum machine_mode mode
;
7794 enum tree_code code
= ops
->code
;
7796 rtx subtarget
, original_target
;
7798 bool reduce_bit_field
;
7799 location_t loc
= ops
->location
;
7800 tree treeop0
, treeop1
, treeop2
;
7801 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
7802 ? reduce_to_bit_field_precision ((expr), \
7808 mode
= TYPE_MODE (type
);
7809 unsignedp
= TYPE_UNSIGNED (type
);
7815 /* We should be called only on simple (binary or unary) expressions,
7816 exactly those that are valid in gimple expressions that aren't
7817 GIMPLE_SINGLE_RHS (or invalid). */
7818 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_UNARY_RHS
7819 || get_gimple_rhs_class (code
) == GIMPLE_BINARY_RHS
7820 || get_gimple_rhs_class (code
) == GIMPLE_TERNARY_RHS
);
7822 ignore
= (target
== const0_rtx
7823 || ((CONVERT_EXPR_CODE_P (code
)
7824 || code
== COND_EXPR
|| code
== VIEW_CONVERT_EXPR
)
7825 && TREE_CODE (type
) == VOID_TYPE
));
7827 /* We should be called only if we need the result. */
7828 gcc_assert (!ignore
);
7830 /* An operation in what may be a bit-field type needs the
7831 result to be reduced to the precision of the bit-field type,
7832 which is narrower than that of the type's mode. */
7833 reduce_bit_field
= (INTEGRAL_TYPE_P (type
)
7834 && GET_MODE_PRECISION (mode
) > TYPE_PRECISION (type
));
7836 if (reduce_bit_field
&& modifier
== EXPAND_STACK_PARM
)
7839 /* Use subtarget as the target for operand 0 of a binary operation. */
7840 subtarget
= get_subtarget (target
);
7841 original_target
= target
;
7845 case NON_LVALUE_EXPR
:
7848 if (treeop0
== error_mark_node
)
7851 if (TREE_CODE (type
) == UNION_TYPE
)
7853 tree valtype
= TREE_TYPE (treeop0
);
7855 /* If both input and output are BLKmode, this conversion isn't doing
7856 anything except possibly changing memory attribute. */
7857 if (mode
== BLKmode
&& TYPE_MODE (valtype
) == BLKmode
)
7859 rtx result
= expand_expr (treeop0
, target
, tmode
,
7862 result
= copy_rtx (result
);
7863 set_mem_attributes (result
, type
, 0);
7869 if (TYPE_MODE (type
) != BLKmode
)
7870 target
= gen_reg_rtx (TYPE_MODE (type
));
7872 target
= assign_temp (type
, 0, 1, 1);
7876 /* Store data into beginning of memory target. */
7877 store_expr (treeop0
,
7878 adjust_address (target
, TYPE_MODE (valtype
), 0),
7879 modifier
== EXPAND_STACK_PARM
,
7884 gcc_assert (REG_P (target
));
7886 /* Store this field into a union of the proper type. */
7887 store_field (target
,
7888 MIN ((int_size_in_bytes (TREE_TYPE
7891 (HOST_WIDE_INT
) GET_MODE_BITSIZE (mode
)),
7892 0, 0, 0, TYPE_MODE (valtype
), treeop0
,
7896 /* Return the entire union. */
7900 if (mode
== TYPE_MODE (TREE_TYPE (treeop0
)))
7902 op0
= expand_expr (treeop0
, target
, VOIDmode
,
7905 /* If the signedness of the conversion differs and OP0 is
7906 a promoted SUBREG, clear that indication since we now
7907 have to do the proper extension. */
7908 if (TYPE_UNSIGNED (TREE_TYPE (treeop0
)) != unsignedp
7909 && GET_CODE (op0
) == SUBREG
)
7910 SUBREG_PROMOTED_VAR_P (op0
) = 0;
7912 return REDUCE_BIT_FIELD (op0
);
7915 op0
= expand_expr (treeop0
, NULL_RTX
, mode
,
7916 modifier
== EXPAND_SUM
? EXPAND_NORMAL
: modifier
);
7917 if (GET_MODE (op0
) == mode
)
7920 /* If OP0 is a constant, just convert it into the proper mode. */
7921 else if (CONSTANT_P (op0
))
7923 tree inner_type
= TREE_TYPE (treeop0
);
7924 enum machine_mode inner_mode
= GET_MODE (op0
);
7926 if (inner_mode
== VOIDmode
)
7927 inner_mode
= TYPE_MODE (inner_type
);
7929 if (modifier
== EXPAND_INITIALIZER
)
7930 op0
= simplify_gen_subreg (mode
, op0
, inner_mode
,
7931 subreg_lowpart_offset (mode
,
7934 op0
= convert_modes (mode
, inner_mode
, op0
,
7935 TYPE_UNSIGNED (inner_type
));
7938 else if (modifier
== EXPAND_INITIALIZER
)
7939 op0
= gen_rtx_fmt_e (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
, mode
, op0
);
7941 else if (target
== 0)
7942 op0
= convert_to_mode (mode
, op0
,
7943 TYPE_UNSIGNED (TREE_TYPE
7947 convert_move (target
, op0
,
7948 TYPE_UNSIGNED (TREE_TYPE (treeop0
)));
7952 return REDUCE_BIT_FIELD (op0
);
7954 case ADDR_SPACE_CONVERT_EXPR
:
7956 tree treeop0_type
= TREE_TYPE (treeop0
);
7958 addr_space_t as_from
;
7960 gcc_assert (POINTER_TYPE_P (type
));
7961 gcc_assert (POINTER_TYPE_P (treeop0_type
));
7963 as_to
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
7964 as_from
= TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type
));
7966 /* Conversions between pointers to the same address space should
7967 have been implemented via CONVERT_EXPR / NOP_EXPR. */
7968 gcc_assert (as_to
!= as_from
);
7970 /* Ask target code to handle conversion between pointers
7971 to overlapping address spaces. */
7972 if (targetm
.addr_space
.subset_p (as_to
, as_from
)
7973 || targetm
.addr_space
.subset_p (as_from
, as_to
))
7975 op0
= expand_expr (treeop0
, NULL_RTX
, VOIDmode
, modifier
);
7976 op0
= targetm
.addr_space
.convert (op0
, treeop0_type
, type
);
7981 /* For disjoint address spaces, converting anything but
7982 a null pointer invokes undefined behaviour. We simply
7983 always return a null pointer here. */
7984 return CONST0_RTX (mode
);
7987 case POINTER_PLUS_EXPR
:
7988 /* Even though the sizetype mode and the pointer's mode can be different
7989 expand is able to handle this correctly and get the correct result out
7990 of the PLUS_EXPR code. */
7991 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
7992 if sizetype precision is smaller than pointer precision. */
7993 if (TYPE_PRECISION (sizetype
) < TYPE_PRECISION (type
))
7994 treeop1
= fold_convert_loc (loc
, type
,
7995 fold_convert_loc (loc
, ssizetype
,
7997 /* If sizetype precision is larger than pointer precision, truncate the
7998 offset to have matching modes. */
7999 else if (TYPE_PRECISION (sizetype
) > TYPE_PRECISION (type
))
8000 treeop1
= fold_convert_loc (loc
, type
, treeop1
);
8003 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
8004 something else, make sure we add the register to the constant and
8005 then to the other thing. This case can occur during strength
8006 reduction and doing it this way will produce better code if the
8007 frame pointer or argument pointer is eliminated.
8009 fold-const.c will ensure that the constant is always in the inner
8010 PLUS_EXPR, so the only case we need to do anything about is if
8011 sp, ap, or fp is our second argument, in which case we must swap
8012 the innermost first argument and our second argument. */
8014 if (TREE_CODE (treeop0
) == PLUS_EXPR
8015 && TREE_CODE (TREE_OPERAND (treeop0
, 1)) == INTEGER_CST
8016 && TREE_CODE (treeop1
) == VAR_DECL
8017 && (DECL_RTL (treeop1
) == frame_pointer_rtx
8018 || DECL_RTL (treeop1
) == stack_pointer_rtx
8019 || DECL_RTL (treeop1
) == arg_pointer_rtx
))
8023 treeop1
= TREE_OPERAND (treeop0
, 0);
8024 TREE_OPERAND (treeop0
, 0) = t
;
8027 /* If the result is to be ptr_mode and we are adding an integer to
8028 something, we might be forming a constant. So try to use
8029 plus_constant. If it produces a sum and we can't accept it,
8030 use force_operand. This allows P = &ARR[const] to generate
8031 efficient code on machines where a SYMBOL_REF is not a valid
8034 If this is an EXPAND_SUM call, always return the sum. */
8035 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
8036 || (mode
== ptr_mode
&& (unsignedp
|| ! flag_trapv
)))
8038 if (modifier
== EXPAND_STACK_PARM
)
8040 if (TREE_CODE (treeop0
) == INTEGER_CST
8041 && GET_MODE_PRECISION (mode
) <= HOST_BITS_PER_WIDE_INT
8042 && TREE_CONSTANT (treeop1
))
8046 op1
= expand_expr (treeop1
, subtarget
, VOIDmode
,
8048 /* Use immed_double_const to ensure that the constant is
8049 truncated according to the mode of OP1, then sign extended
8050 to a HOST_WIDE_INT. Using the constant directly can result
8051 in non-canonical RTL in a 64x32 cross compile. */
8053 = immed_double_const (TREE_INT_CST_LOW (treeop0
),
8055 TYPE_MODE (TREE_TYPE (treeop1
)));
8056 op1
= plus_constant (op1
, INTVAL (constant_part
));
8057 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8058 op1
= force_operand (op1
, target
);
8059 return REDUCE_BIT_FIELD (op1
);
8062 else if (TREE_CODE (treeop1
) == INTEGER_CST
8063 && GET_MODE_PRECISION (mode
) <= HOST_BITS_PER_WIDE_INT
8064 && TREE_CONSTANT (treeop0
))
8068 op0
= expand_expr (treeop0
, subtarget
, VOIDmode
,
8069 (modifier
== EXPAND_INITIALIZER
8070 ? EXPAND_INITIALIZER
: EXPAND_SUM
));
8071 if (! CONSTANT_P (op0
))
8073 op1
= expand_expr (treeop1
, NULL_RTX
,
8074 VOIDmode
, modifier
);
8075 /* Return a PLUS if modifier says it's OK. */
8076 if (modifier
== EXPAND_SUM
8077 || modifier
== EXPAND_INITIALIZER
)
8078 return simplify_gen_binary (PLUS
, mode
, op0
, op1
);
8081 /* Use immed_double_const to ensure that the constant is
8082 truncated according to the mode of OP1, then sign extended
8083 to a HOST_WIDE_INT. Using the constant directly can result
8084 in non-canonical RTL in a 64x32 cross compile. */
8086 = immed_double_const (TREE_INT_CST_LOW (treeop1
),
8088 TYPE_MODE (TREE_TYPE (treeop0
)));
8089 op0
= plus_constant (op0
, INTVAL (constant_part
));
8090 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8091 op0
= force_operand (op0
, target
);
8092 return REDUCE_BIT_FIELD (op0
);
8096 /* Use TER to expand pointer addition of a negated value
8097 as pointer subtraction. */
8098 if ((POINTER_TYPE_P (TREE_TYPE (treeop0
))
8099 || (TREE_CODE (TREE_TYPE (treeop0
)) == VECTOR_TYPE
8100 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0
)))))
8101 && TREE_CODE (treeop1
) == SSA_NAME
8102 && TYPE_MODE (TREE_TYPE (treeop0
))
8103 == TYPE_MODE (TREE_TYPE (treeop1
)))
8105 gimple def
= get_def_for_expr (treeop1
, NEGATE_EXPR
);
8108 treeop1
= gimple_assign_rhs1 (def
);
8114 /* No sense saving up arithmetic to be done
8115 if it's all in the wrong mode to form part of an address.
8116 And force_operand won't know whether to sign-extend or
8118 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8119 || mode
!= ptr_mode
)
8121 expand_operands (treeop0
, treeop1
,
8122 subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8123 if (op0
== const0_rtx
)
8125 if (op1
== const0_rtx
)
8130 expand_operands (treeop0
, treeop1
,
8131 subtarget
, &op0
, &op1
, modifier
);
8132 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS
, mode
, op0
, op1
));
8136 /* For initializers, we are allowed to return a MINUS of two
8137 symbolic constants. Here we handle all cases when both operands
8139 /* Handle difference of two symbolic constants,
8140 for the sake of an initializer. */
8141 if ((modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
8142 && really_constant_p (treeop0
)
8143 && really_constant_p (treeop1
))
8145 expand_operands (treeop0
, treeop1
,
8146 NULL_RTX
, &op0
, &op1
, modifier
);
8148 /* If the last operand is a CONST_INT, use plus_constant of
8149 the negated constant. Else make the MINUS. */
8150 if (CONST_INT_P (op1
))
8151 return REDUCE_BIT_FIELD (plus_constant (op0
, - INTVAL (op1
)));
8153 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode
, op0
, op1
));
8156 /* No sense saving up arithmetic to be done
8157 if it's all in the wrong mode to form part of an address.
8158 And force_operand won't know whether to sign-extend or
8160 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8161 || mode
!= ptr_mode
)
8164 expand_operands (treeop0
, treeop1
,
8165 subtarget
, &op0
, &op1
, modifier
);
8167 /* Convert A - const to A + (-const). */
8168 if (CONST_INT_P (op1
))
8170 op1
= negate_rtx (mode
, op1
);
8171 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS
, mode
, op0
, op1
));
8176 case WIDEN_MULT_PLUS_EXPR
:
8177 case WIDEN_MULT_MINUS_EXPR
:
8178 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8179 op2
= expand_normal (treeop2
);
8180 target
= expand_widen_pattern_expr (ops
, op0
, op1
, op2
,
8184 case WIDEN_MULT_EXPR
:
8185 /* If first operand is constant, swap them.
8186 Thus the following special case checks need only
8187 check the second operand. */
8188 if (TREE_CODE (treeop0
) == INTEGER_CST
)
8195 /* First, check if we have a multiplication of one signed and one
8196 unsigned operand. */
8197 if (TREE_CODE (treeop1
) != INTEGER_CST
8198 && (TYPE_UNSIGNED (TREE_TYPE (treeop0
))
8199 != TYPE_UNSIGNED (TREE_TYPE (treeop1
))))
8201 enum machine_mode innermode
= TYPE_MODE (TREE_TYPE (treeop0
));
8202 this_optab
= usmul_widen_optab
;
8203 if (find_widening_optab_handler (this_optab
, mode
, innermode
, 0)
8204 != CODE_FOR_nothing
)
8206 if (TYPE_UNSIGNED (TREE_TYPE (treeop0
)))
8207 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op0
, &op1
,
8210 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op1
, &op0
,
8215 /* Check for a multiplication with matching signedness. */
8216 else if ((TREE_CODE (treeop1
) == INTEGER_CST
8217 && int_fits_type_p (treeop1
, TREE_TYPE (treeop0
)))
8218 || (TYPE_UNSIGNED (TREE_TYPE (treeop1
))
8219 == TYPE_UNSIGNED (TREE_TYPE (treeop0
))))
8221 tree op0type
= TREE_TYPE (treeop0
);
8222 enum machine_mode innermode
= TYPE_MODE (op0type
);
8223 bool zextend_p
= TYPE_UNSIGNED (op0type
);
8224 optab other_optab
= zextend_p
? smul_widen_optab
: umul_widen_optab
;
8225 this_optab
= zextend_p
? umul_widen_optab
: smul_widen_optab
;
8227 if (TREE_CODE (treeop0
) != INTEGER_CST
)
8229 if (find_widening_optab_handler (this_optab
, mode
, innermode
, 0)
8230 != CODE_FOR_nothing
)
8232 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op0
, &op1
,
8234 temp
= expand_widening_mult (mode
, op0
, op1
, target
,
8235 unsignedp
, this_optab
);
8236 return REDUCE_BIT_FIELD (temp
);
8238 if (find_widening_optab_handler (other_optab
, mode
, innermode
, 0)
8240 && innermode
== word_mode
)
8243 op0
= expand_normal (treeop0
);
8244 if (TREE_CODE (treeop1
) == INTEGER_CST
)
8245 op1
= convert_modes (innermode
, mode
,
8246 expand_normal (treeop1
), unsignedp
);
8248 op1
= expand_normal (treeop1
);
8249 temp
= expand_binop (mode
, other_optab
, op0
, op1
, target
,
8250 unsignedp
, OPTAB_LIB_WIDEN
);
8251 hipart
= gen_highpart (innermode
, temp
);
8252 htem
= expand_mult_highpart_adjust (innermode
, hipart
,
8256 emit_move_insn (hipart
, htem
);
8257 return REDUCE_BIT_FIELD (temp
);
8261 treeop0
= fold_build1 (CONVERT_EXPR
, type
, treeop0
);
8262 treeop1
= fold_build1 (CONVERT_EXPR
, type
, treeop1
);
8263 expand_operands (treeop0
, treeop1
, subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8264 return REDUCE_BIT_FIELD (expand_mult (mode
, op0
, op1
, target
, unsignedp
));
8268 optab opt
= fma_optab
;
8271 /* If there is no insn for FMA, emit it as __builtin_fma{,f,l}
8273 if (optab_handler (fma_optab
, mode
) == CODE_FOR_nothing
)
8275 tree fn
= mathfn_built_in (TREE_TYPE (treeop0
), BUILT_IN_FMA
);
8278 gcc_assert (fn
!= NULL_TREE
);
8279 call_expr
= build_call_expr (fn
, 3, treeop0
, treeop1
, treeop2
);
8280 return expand_builtin (call_expr
, target
, subtarget
, mode
, false);
8283 def0
= get_def_for_expr (treeop0
, NEGATE_EXPR
);
8284 def2
= get_def_for_expr (treeop2
, NEGATE_EXPR
);
8289 && optab_handler (fnms_optab
, mode
) != CODE_FOR_nothing
)
8292 op0
= expand_normal (gimple_assign_rhs1 (def0
));
8293 op2
= expand_normal (gimple_assign_rhs1 (def2
));
8296 && optab_handler (fnma_optab
, mode
) != CODE_FOR_nothing
)
8299 op0
= expand_normal (gimple_assign_rhs1 (def0
));
8302 && optab_handler (fms_optab
, mode
) != CODE_FOR_nothing
)
8305 op2
= expand_normal (gimple_assign_rhs1 (def2
));
8309 op0
= expand_expr (treeop0
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
8311 op2
= expand_normal (treeop2
);
8312 op1
= expand_normal (treeop1
);
8314 return expand_ternary_op (TYPE_MODE (type
), opt
,
8315 op0
, op1
, op2
, target
, 0);
8319 /* If this is a fixed-point operation, then we cannot use the code
8320 below because "expand_mult" doesn't support sat/no-sat fixed-point
8322 if (ALL_FIXED_POINT_MODE_P (mode
))
8325 /* If first operand is constant, swap them.
8326 Thus the following special case checks need only
8327 check the second operand. */
8328 if (TREE_CODE (treeop0
) == INTEGER_CST
)
8335 /* Attempt to return something suitable for generating an
8336 indexed address, for machines that support that. */
8338 if (modifier
== EXPAND_SUM
&& mode
== ptr_mode
8339 && host_integerp (treeop1
, 0))
8341 tree exp1
= treeop1
;
8343 op0
= expand_expr (treeop0
, subtarget
, VOIDmode
,
8347 op0
= force_operand (op0
, NULL_RTX
);
8349 op0
= copy_to_mode_reg (mode
, op0
);
8351 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode
, op0
,
8352 gen_int_mode (tree_low_cst (exp1
, 0),
8353 TYPE_MODE (TREE_TYPE (exp1
)))));
8356 if (modifier
== EXPAND_STACK_PARM
)
8359 expand_operands (treeop0
, treeop1
, subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8360 return REDUCE_BIT_FIELD (expand_mult (mode
, op0
, op1
, target
, unsignedp
));
8362 case TRUNC_DIV_EXPR
:
8363 case FLOOR_DIV_EXPR
:
8365 case ROUND_DIV_EXPR
:
8366 case EXACT_DIV_EXPR
:
8367 /* If this is a fixed-point operation, then we cannot use the code
8368 below because "expand_divmod" doesn't support sat/no-sat fixed-point
8370 if (ALL_FIXED_POINT_MODE_P (mode
))
8373 if (modifier
== EXPAND_STACK_PARM
)
8375 /* Possible optimization: compute the dividend with EXPAND_SUM
8376 then if the divisor is constant can optimize the case
8377 where some terms of the dividend have coeffs divisible by it. */
8378 expand_operands (treeop0
, treeop1
,
8379 subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8380 return expand_divmod (0, code
, mode
, op0
, op1
, target
, unsignedp
);
8385 case TRUNC_MOD_EXPR
:
8386 case FLOOR_MOD_EXPR
:
8388 case ROUND_MOD_EXPR
:
8389 if (modifier
== EXPAND_STACK_PARM
)
8391 expand_operands (treeop0
, treeop1
,
8392 subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8393 return expand_divmod (1, code
, mode
, op0
, op1
, target
, unsignedp
);
8395 case FIXED_CONVERT_EXPR
:
8396 op0
= expand_normal (treeop0
);
8397 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8398 target
= gen_reg_rtx (mode
);
8400 if ((TREE_CODE (TREE_TYPE (treeop0
)) == INTEGER_TYPE
8401 && TYPE_UNSIGNED (TREE_TYPE (treeop0
)))
8402 || (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
)))
8403 expand_fixed_convert (target
, op0
, 1, TYPE_SATURATING (type
));
8405 expand_fixed_convert (target
, op0
, 0, TYPE_SATURATING (type
));
8408 case FIX_TRUNC_EXPR
:
8409 op0
= expand_normal (treeop0
);
8410 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8411 target
= gen_reg_rtx (mode
);
8412 expand_fix (target
, op0
, unsignedp
);
8416 op0
= expand_normal (treeop0
);
8417 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8418 target
= gen_reg_rtx (mode
);
8419 /* expand_float can't figure out what to do if FROM has VOIDmode.
8420 So give it the correct mode. With -O, cse will optimize this. */
8421 if (GET_MODE (op0
) == VOIDmode
)
8422 op0
= copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0
)),
8424 expand_float (target
, op0
,
8425 TYPE_UNSIGNED (TREE_TYPE (treeop0
)));
8429 op0
= expand_expr (treeop0
, subtarget
,
8430 VOIDmode
, EXPAND_NORMAL
);
8431 if (modifier
== EXPAND_STACK_PARM
)
8433 temp
= expand_unop (mode
,
8434 optab_for_tree_code (NEGATE_EXPR
, type
,
8438 return REDUCE_BIT_FIELD (temp
);
8441 op0
= expand_expr (treeop0
, subtarget
,
8442 VOIDmode
, EXPAND_NORMAL
);
8443 if (modifier
== EXPAND_STACK_PARM
)
8446 /* ABS_EXPR is not valid for complex arguments. */
8447 gcc_assert (GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
8448 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
);
8450 /* Unsigned abs is simply the operand. Testing here means we don't
8451 risk generating incorrect code below. */
8452 if (TYPE_UNSIGNED (type
))
8455 return expand_abs (mode
, op0
, target
, unsignedp
,
8456 safe_from_p (target
, treeop0
, 1));
8460 target
= original_target
;
8462 || modifier
== EXPAND_STACK_PARM
8463 || (MEM_P (target
) && MEM_VOLATILE_P (target
))
8464 || GET_MODE (target
) != mode
8466 && REGNO (target
) < FIRST_PSEUDO_REGISTER
))
8467 target
= gen_reg_rtx (mode
);
8468 expand_operands (treeop0
, treeop1
,
8469 target
, &op0
, &op1
, EXPAND_NORMAL
);
8471 /* First try to do it with a special MIN or MAX instruction.
8472 If that does not win, use a conditional jump to select the proper
8474 this_optab
= optab_for_tree_code (code
, type
, optab_default
);
8475 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
, unsignedp
,
8480 /* At this point, a MEM target is no longer useful; we will get better
8483 if (! REG_P (target
))
8484 target
= gen_reg_rtx (mode
);
8486 /* If op1 was placed in target, swap op0 and op1. */
8487 if (target
!= op0
&& target
== op1
)
8494 /* We generate better code and avoid problems with op1 mentioning
8495 target by forcing op1 into a pseudo if it isn't a constant. */
8496 if (! CONSTANT_P (op1
))
8497 op1
= force_reg (mode
, op1
);
8500 enum rtx_code comparison_code
;
8503 if (code
== MAX_EXPR
)
8504 comparison_code
= unsignedp
? GEU
: GE
;
8506 comparison_code
= unsignedp
? LEU
: LE
;
8508 /* Canonicalize to comparisons against 0. */
8509 if (op1
== const1_rtx
)
8511 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
8512 or (a != 0 ? a : 1) for unsigned.
8513 For MIN we are safe converting (a <= 1 ? a : 1)
8514 into (a <= 0 ? a : 1) */
8515 cmpop1
= const0_rtx
;
8516 if (code
== MAX_EXPR
)
8517 comparison_code
= unsignedp
? NE
: GT
;
8519 if (op1
== constm1_rtx
&& !unsignedp
)
8521 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
8522 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
8523 cmpop1
= const0_rtx
;
8524 if (code
== MIN_EXPR
)
8525 comparison_code
= LT
;
8527 #ifdef HAVE_conditional_move
8528 /* Use a conditional move if possible. */
8529 if (can_conditionally_move_p (mode
))
8533 /* ??? Same problem as in expmed.c: emit_conditional_move
8534 forces a stack adjustment via compare_from_rtx, and we
8535 lose the stack adjustment if the sequence we are about
8536 to create is discarded. */
8537 do_pending_stack_adjust ();
8541 /* Try to emit the conditional move. */
8542 insn
= emit_conditional_move (target
, comparison_code
,
8547 /* If we could do the conditional move, emit the sequence,
8551 rtx seq
= get_insns ();
8557 /* Otherwise discard the sequence and fall back to code with
8563 emit_move_insn (target
, op0
);
8565 temp
= gen_label_rtx ();
8566 do_compare_rtx_and_jump (target
, cmpop1
, comparison_code
,
8567 unsignedp
, mode
, NULL_RTX
, NULL_RTX
, temp
,
8570 emit_move_insn (target
, op1
);
8575 op0
= expand_expr (treeop0
, subtarget
,
8576 VOIDmode
, EXPAND_NORMAL
);
8577 if (modifier
== EXPAND_STACK_PARM
)
8579 /* In case we have to reduce the result to bitfield precision
8580 for unsigned bitfield expand this as XOR with a proper constant
8582 if (reduce_bit_field
&& TYPE_UNSIGNED (type
))
8583 temp
= expand_binop (mode
, xor_optab
, op0
,
8584 immed_double_int_const
8585 (double_int_mask (TYPE_PRECISION (type
)), mode
),
8586 target
, 1, OPTAB_LIB_WIDEN
);
8588 temp
= expand_unop (mode
, one_cmpl_optab
, op0
, target
, 1);
8592 /* ??? Can optimize bitwise operations with one arg constant.
8593 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8594 and (a bitwise1 b) bitwise2 b (etc)
8595 but that is probably not worth while. */
8604 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type
))
8605 || (GET_MODE_PRECISION (TYPE_MODE (type
))
8606 == TYPE_PRECISION (type
)));
8611 /* If this is a fixed-point operation, then we cannot use the code
8612 below because "expand_shift" doesn't support sat/no-sat fixed-point
8614 if (ALL_FIXED_POINT_MODE_P (mode
))
8617 if (! safe_from_p (subtarget
, treeop1
, 1))
8619 if (modifier
== EXPAND_STACK_PARM
)
8621 op0
= expand_expr (treeop0
, subtarget
,
8622 VOIDmode
, EXPAND_NORMAL
);
8623 temp
= expand_variable_shift (code
, mode
, op0
, treeop1
, target
,
8625 if (code
== LSHIFT_EXPR
)
8626 temp
= REDUCE_BIT_FIELD (temp
);
8629 /* Could determine the answer when only additive constants differ. Also,
8630 the addition of one can be handled by changing the condition. */
8637 case UNORDERED_EXPR
:
8645 temp
= do_store_flag (ops
,
8646 modifier
!= EXPAND_STACK_PARM
? target
: NULL_RTX
,
8647 tmode
!= VOIDmode
? tmode
: mode
);
8651 /* Use a compare and a jump for BLKmode comparisons, or for function
8652 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8655 || modifier
== EXPAND_STACK_PARM
8656 || ! safe_from_p (target
, treeop0
, 1)
8657 || ! safe_from_p (target
, treeop1
, 1)
8658 /* Make sure we don't have a hard reg (such as function's return
8659 value) live across basic blocks, if not optimizing. */
8660 || (!optimize
&& REG_P (target
)
8661 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)))
8662 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
8664 emit_move_insn (target
, const0_rtx
);
8666 op1
= gen_label_rtx ();
8667 jumpifnot_1 (code
, treeop0
, treeop1
, op1
, -1);
8669 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
8670 emit_move_insn (target
, constm1_rtx
);
8672 emit_move_insn (target
, const1_rtx
);
8678 /* Get the rtx code of the operands. */
8679 op0
= expand_normal (treeop0
);
8680 op1
= expand_normal (treeop1
);
8683 target
= gen_reg_rtx (TYPE_MODE (type
));
8685 /* Move the real (op0) and imaginary (op1) parts to their location. */
8686 write_complex_part (target
, op0
, false);
8687 write_complex_part (target
, op1
, true);
8691 case WIDEN_SUM_EXPR
:
8693 tree oprnd0
= treeop0
;
8694 tree oprnd1
= treeop1
;
8696 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8697 target
= expand_widen_pattern_expr (ops
, op0
, NULL_RTX
, op1
,
8702 case REDUC_MAX_EXPR
:
8703 case REDUC_MIN_EXPR
:
8704 case REDUC_PLUS_EXPR
:
8706 op0
= expand_normal (treeop0
);
8707 this_optab
= optab_for_tree_code (code
, type
, optab_default
);
8708 temp
= expand_unop (mode
, this_optab
, op0
, target
, unsignedp
);
8713 case VEC_LSHIFT_EXPR
:
8714 case VEC_RSHIFT_EXPR
:
8716 target
= expand_vec_shift_expr (ops
, target
);
8720 case VEC_UNPACK_HI_EXPR
:
8721 case VEC_UNPACK_LO_EXPR
:
8723 op0
= expand_normal (treeop0
);
8724 temp
= expand_widen_pattern_expr (ops
, op0
, NULL_RTX
, NULL_RTX
,
8730 case VEC_UNPACK_FLOAT_HI_EXPR
:
8731 case VEC_UNPACK_FLOAT_LO_EXPR
:
8733 op0
= expand_normal (treeop0
);
8734 /* The signedness is determined from input operand. */
8735 temp
= expand_widen_pattern_expr
8736 (ops
, op0
, NULL_RTX
, NULL_RTX
,
8737 target
, TYPE_UNSIGNED (TREE_TYPE (treeop0
)));
8743 case VEC_WIDEN_MULT_HI_EXPR
:
8744 case VEC_WIDEN_MULT_LO_EXPR
:
8746 tree oprnd0
= treeop0
;
8747 tree oprnd1
= treeop1
;
8749 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8750 target
= expand_widen_pattern_expr (ops
, op0
, op1
, NULL_RTX
,
8752 gcc_assert (target
);
8756 case VEC_WIDEN_LSHIFT_HI_EXPR
:
8757 case VEC_WIDEN_LSHIFT_LO_EXPR
:
8759 tree oprnd0
= treeop0
;
8760 tree oprnd1
= treeop1
;
8762 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8763 target
= expand_widen_pattern_expr (ops
, op0
, op1
, NULL_RTX
,
8765 gcc_assert (target
);
8769 case VEC_PACK_TRUNC_EXPR
:
8770 case VEC_PACK_SAT_EXPR
:
8771 case VEC_PACK_FIX_TRUNC_EXPR
:
8772 mode
= TYPE_MODE (TREE_TYPE (treeop0
));
8776 expand_operands (treeop0
, treeop1
, target
, &op0
, &op1
, EXPAND_NORMAL
);
8777 op2
= expand_normal (treeop2
);
8779 /* Careful here: if the target doesn't support integral vector modes,
8780 a constant selection vector could wind up smooshed into a normal
8781 integral constant. */
8782 if (CONSTANT_P (op2
) && GET_CODE (op2
) != CONST_VECTOR
)
8784 tree sel_type
= TREE_TYPE (treeop2
);
8785 enum machine_mode vmode
8786 = mode_for_vector (TYPE_MODE (TREE_TYPE (sel_type
)),
8787 TYPE_VECTOR_SUBPARTS (sel_type
));
8788 gcc_assert (GET_MODE_CLASS (vmode
) == MODE_VECTOR_INT
);
8789 op2
= simplify_subreg (vmode
, op2
, TYPE_MODE (sel_type
), 0);
8790 gcc_assert (op2
&& GET_CODE (op2
) == CONST_VECTOR
);
8793 gcc_assert (GET_MODE_CLASS (GET_MODE (op2
)) == MODE_VECTOR_INT
);
8795 temp
= expand_vec_perm (mode
, op0
, op1
, op2
, target
);
8801 tree oprnd0
= treeop0
;
8802 tree oprnd1
= treeop1
;
8803 tree oprnd2
= treeop2
;
8806 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8807 op2
= expand_normal (oprnd2
);
8808 target
= expand_widen_pattern_expr (ops
, op0
, op1
, op2
,
8813 case REALIGN_LOAD_EXPR
:
8815 tree oprnd0
= treeop0
;
8816 tree oprnd1
= treeop1
;
8817 tree oprnd2
= treeop2
;
8820 this_optab
= optab_for_tree_code (code
, type
, optab_default
);
8821 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8822 op2
= expand_normal (oprnd2
);
8823 temp
= expand_ternary_op (mode
, this_optab
, op0
, op1
, op2
,
8830 /* A COND_EXPR with its type being VOID_TYPE represents a
8831 conditional jump and is handled in
8832 expand_gimple_cond_expr. */
8833 gcc_assert (!VOID_TYPE_P (type
));
8835 /* Note that COND_EXPRs whose type is a structure or union
8836 are required to be constructed to contain assignments of
8837 a temporary variable, so that we can evaluate them here
8838 for side effect only. If type is void, we must do likewise. */
8840 gcc_assert (!TREE_ADDRESSABLE (type
)
8842 && TREE_TYPE (treeop1
) != void_type_node
8843 && TREE_TYPE (treeop2
) != void_type_node
);
8845 /* If we are not to produce a result, we have no target. Otherwise,
8846 if a target was specified use it; it will not be used as an
8847 intermediate target unless it is safe. If no target, use a
8850 if (modifier
!= EXPAND_STACK_PARM
8852 && safe_from_p (original_target
, treeop0
, 1)
8853 && GET_MODE (original_target
) == mode
8854 #ifdef HAVE_conditional_move
8855 && (! can_conditionally_move_p (mode
)
8856 || REG_P (original_target
))
8858 && !MEM_P (original_target
))
8859 temp
= original_target
;
8861 temp
= assign_temp (type
, 0, 0, 1);
8863 do_pending_stack_adjust ();
8865 op0
= gen_label_rtx ();
8866 op1
= gen_label_rtx ();
8867 jumpifnot (treeop0
, op0
, -1);
8868 store_expr (treeop1
, temp
,
8869 modifier
== EXPAND_STACK_PARM
,
8872 emit_jump_insn (gen_jump (op1
));
8875 store_expr (treeop2
, temp
,
8876 modifier
== EXPAND_STACK_PARM
,
8884 target
= expand_vec_cond_expr (type
, treeop0
, treeop1
, treeop2
, target
);
8891 /* Here to do an ordinary binary operator. */
8893 expand_operands (treeop0
, treeop1
,
8894 subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8896 this_optab
= optab_for_tree_code (code
, type
, optab_default
);
8898 if (modifier
== EXPAND_STACK_PARM
)
8900 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
,
8901 unsignedp
, OPTAB_LIB_WIDEN
);
8903 /* Bitwise operations do not need bitfield reduction as we expect their
8904 operands being properly truncated. */
8905 if (code
== BIT_XOR_EXPR
8906 || code
== BIT_AND_EXPR
8907 || code
== BIT_IOR_EXPR
)
8909 return REDUCE_BIT_FIELD (temp
);
8911 #undef REDUCE_BIT_FIELD
8914 expand_expr_real_1 (tree exp
, rtx target
, enum machine_mode tmode
,
8915 enum expand_modifier modifier
, rtx
*alt_rtl
)
8917 rtx op0
, op1
, temp
, decl_rtl
;
8920 enum machine_mode mode
;
8921 enum tree_code code
= TREE_CODE (exp
);
8922 rtx subtarget
, original_target
;
8925 bool reduce_bit_field
;
8926 location_t loc
= EXPR_LOCATION (exp
);
8927 struct separate_ops ops
;
8928 tree treeop0
, treeop1
, treeop2
;
8929 tree ssa_name
= NULL_TREE
;
8932 type
= TREE_TYPE (exp
);
8933 mode
= TYPE_MODE (type
);
8934 unsignedp
= TYPE_UNSIGNED (type
);
8936 treeop0
= treeop1
= treeop2
= NULL_TREE
;
8937 if (!VL_EXP_CLASS_P (exp
))
8938 switch (TREE_CODE_LENGTH (code
))
8941 case 3: treeop2
= TREE_OPERAND (exp
, 2);
8942 case 2: treeop1
= TREE_OPERAND (exp
, 1);
8943 case 1: treeop0
= TREE_OPERAND (exp
, 0);
8953 ignore
= (target
== const0_rtx
8954 || ((CONVERT_EXPR_CODE_P (code
)
8955 || code
== COND_EXPR
|| code
== VIEW_CONVERT_EXPR
)
8956 && TREE_CODE (type
) == VOID_TYPE
));
8958 /* An operation in what may be a bit-field type needs the
8959 result to be reduced to the precision of the bit-field type,
8960 which is narrower than that of the type's mode. */
8961 reduce_bit_field
= (!ignore
8962 && INTEGRAL_TYPE_P (type
)
8963 && GET_MODE_PRECISION (mode
) > TYPE_PRECISION (type
));
8965 /* If we are going to ignore this result, we need only do something
8966 if there is a side-effect somewhere in the expression. If there
8967 is, short-circuit the most common cases here. Note that we must
8968 not call expand_expr with anything but const0_rtx in case this
8969 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
8973 if (! TREE_SIDE_EFFECTS (exp
))
8976 /* Ensure we reference a volatile object even if value is ignored, but
8977 don't do this if all we are doing is taking its address. */
8978 if (TREE_THIS_VOLATILE (exp
)
8979 && TREE_CODE (exp
) != FUNCTION_DECL
8980 && mode
!= VOIDmode
&& mode
!= BLKmode
8981 && modifier
!= EXPAND_CONST_ADDRESS
)
8983 temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, modifier
);
8989 if (TREE_CODE_CLASS (code
) == tcc_unary
8990 || code
== COMPONENT_REF
|| code
== INDIRECT_REF
)
8991 return expand_expr (treeop0
, const0_rtx
, VOIDmode
,
8994 else if (TREE_CODE_CLASS (code
) == tcc_binary
8995 || TREE_CODE_CLASS (code
) == tcc_comparison
8996 || code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
8998 expand_expr (treeop0
, const0_rtx
, VOIDmode
, modifier
);
8999 expand_expr (treeop1
, const0_rtx
, VOIDmode
, modifier
);
9002 else if (code
== BIT_FIELD_REF
)
9004 expand_expr (treeop0
, const0_rtx
, VOIDmode
, modifier
);
9005 expand_expr (treeop1
, const0_rtx
, VOIDmode
, modifier
);
9006 expand_expr (treeop2
, const0_rtx
, VOIDmode
, modifier
);
9013 if (reduce_bit_field
&& modifier
== EXPAND_STACK_PARM
)
9016 /* Use subtarget as the target for operand 0 of a binary operation. */
9017 subtarget
= get_subtarget (target
);
9018 original_target
= target
;
9024 tree function
= decl_function_context (exp
);
9026 temp
= label_rtx (exp
);
9027 temp
= gen_rtx_LABEL_REF (Pmode
, temp
);
9029 if (function
!= current_function_decl
9031 LABEL_REF_NONLOCAL_P (temp
) = 1;
9033 temp
= gen_rtx_MEM (FUNCTION_MODE
, temp
);
9038 /* ??? ivopts calls expander, without any preparation from
9039 out-of-ssa. So fake instructions as if this was an access to the
9040 base variable. This unnecessarily allocates a pseudo, see how we can
9041 reuse it, if partition base vars have it set already. */
9042 if (!currently_expanding_to_rtl
)
9043 return expand_expr_real_1 (SSA_NAME_VAR (exp
), target
, tmode
, modifier
,
9046 g
= get_gimple_for_ssa_name (exp
);
9047 /* For EXPAND_INITIALIZER try harder to get something simpler. */
9049 && modifier
== EXPAND_INITIALIZER
9050 && !SSA_NAME_IS_DEFAULT_DEF (exp
)
9051 && (optimize
|| DECL_IGNORED_P (SSA_NAME_VAR (exp
)))
9052 && stmt_is_replaceable_p (SSA_NAME_DEF_STMT (exp
)))
9053 g
= SSA_NAME_DEF_STMT (exp
);
9056 rtx r
= expand_expr_real (gimple_assign_rhs_to_tree (g
), target
,
9057 tmode
, modifier
, NULL
);
9058 if (REG_P (r
) && !REG_EXPR (r
))
9059 set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (exp
), r
);
9064 decl_rtl
= get_rtx_for_ssa_name (ssa_name
);
9065 exp
= SSA_NAME_VAR (ssa_name
);
9066 goto expand_decl_rtl
;
9070 /* If a static var's type was incomplete when the decl was written,
9071 but the type is complete now, lay out the decl now. */
9072 if (DECL_SIZE (exp
) == 0
9073 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp
))
9074 && (TREE_STATIC (exp
) || DECL_EXTERNAL (exp
)))
9075 layout_decl (exp
, 0);
9077 /* ... fall through ... */
9081 decl_rtl
= DECL_RTL (exp
);
9083 gcc_assert (decl_rtl
);
9084 decl_rtl
= copy_rtx (decl_rtl
);
9085 /* Record writes to register variables. */
9086 if (modifier
== EXPAND_WRITE
9088 && HARD_REGISTER_P (decl_rtl
))
9089 add_to_hard_reg_set (&crtl
->asm_clobbers
,
9090 GET_MODE (decl_rtl
), REGNO (decl_rtl
));
9092 /* Ensure variable marked as used even if it doesn't go through
9093 a parser. If it hasn't be used yet, write out an external
9095 TREE_USED (exp
) = 1;
9097 /* Show we haven't gotten RTL for this yet. */
9100 /* Variables inherited from containing functions should have
9101 been lowered by this point. */
9102 context
= decl_function_context (exp
);
9103 gcc_assert (!context
9104 || context
== current_function_decl
9105 || TREE_STATIC (exp
)
9106 || DECL_EXTERNAL (exp
)
9107 /* ??? C++ creates functions that are not TREE_STATIC. */
9108 || TREE_CODE (exp
) == FUNCTION_DECL
);
9110 /* This is the case of an array whose size is to be determined
9111 from its initializer, while the initializer is still being parsed.
9114 if (MEM_P (decl_rtl
) && REG_P (XEXP (decl_rtl
, 0)))
9115 temp
= validize_mem (decl_rtl
);
9117 /* If DECL_RTL is memory, we are in the normal case and the
9118 address is not valid, get the address into a register. */
9120 else if (MEM_P (decl_rtl
) && modifier
!= EXPAND_INITIALIZER
)
9123 *alt_rtl
= decl_rtl
;
9124 decl_rtl
= use_anchored_address (decl_rtl
);
9125 if (modifier
!= EXPAND_CONST_ADDRESS
9126 && modifier
!= EXPAND_SUM
9127 && !memory_address_addr_space_p (DECL_MODE (exp
),
9129 MEM_ADDR_SPACE (decl_rtl
)))
9130 temp
= replace_equiv_address (decl_rtl
,
9131 copy_rtx (XEXP (decl_rtl
, 0)));
9134 /* If we got something, return it. But first, set the alignment
9135 if the address is a register. */
9138 if (MEM_P (temp
) && REG_P (XEXP (temp
, 0)))
9139 mark_reg_pointer (XEXP (temp
, 0), DECL_ALIGN (exp
));
9144 /* If the mode of DECL_RTL does not match that of the decl,
9145 there are two cases: we are dealing with a BLKmode value
9146 that is returned in a register, or we are dealing with
9147 a promoted value. In the latter case, return a SUBREG
9148 of the wanted mode, but mark it so that we know that it
9149 was already extended. */
9150 if (REG_P (decl_rtl
)
9151 && DECL_MODE (exp
) != BLKmode
9152 && GET_MODE (decl_rtl
) != DECL_MODE (exp
))
9154 enum machine_mode pmode
;
9156 /* Get the signedness to be used for this variable. Ensure we get
9157 the same mode we got when the variable was declared. */
9158 if (code
== SSA_NAME
9159 && (g
= SSA_NAME_DEF_STMT (ssa_name
))
9160 && gimple_code (g
) == GIMPLE_CALL
)
9162 gcc_assert (!gimple_call_internal_p (g
));
9163 pmode
= promote_function_mode (type
, mode
, &unsignedp
,
9164 gimple_call_fntype (g
),
9168 pmode
= promote_decl_mode (exp
, &unsignedp
);
9169 gcc_assert (GET_MODE (decl_rtl
) == pmode
);
9171 temp
= gen_lowpart_SUBREG (mode
, decl_rtl
);
9172 SUBREG_PROMOTED_VAR_P (temp
) = 1;
9173 SUBREG_PROMOTED_UNSIGNED_SET (temp
, unsignedp
);
9180 temp
= immed_double_const (TREE_INT_CST_LOW (exp
),
9181 TREE_INT_CST_HIGH (exp
), mode
);
9187 tree tmp
= NULL_TREE
;
9188 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
9189 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
9190 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FRACT
9191 || GET_MODE_CLASS (mode
) == MODE_VECTOR_UFRACT
9192 || GET_MODE_CLASS (mode
) == MODE_VECTOR_ACCUM
9193 || GET_MODE_CLASS (mode
) == MODE_VECTOR_UACCUM
)
9194 return const_vector_from_tree (exp
);
9195 if (GET_MODE_CLASS (mode
) == MODE_INT
)
9197 tree type_for_mode
= lang_hooks
.types
.type_for_mode (mode
, 1);
9199 tmp
= fold_unary_loc (loc
, VIEW_CONVERT_EXPR
, type_for_mode
, exp
);
9203 VEC(constructor_elt
,gc
) *v
;
9205 v
= VEC_alloc (constructor_elt
, gc
, VECTOR_CST_NELTS (exp
));
9206 for (i
= 0; i
< VECTOR_CST_NELTS (exp
); ++i
)
9207 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, VECTOR_CST_ELT (exp
, i
));
9208 tmp
= build_constructor (type
, v
);
9210 return expand_expr (tmp
, ignore
? const0_rtx
: target
,
9215 return expand_expr (DECL_INITIAL (exp
), target
, VOIDmode
, modifier
);
9218 /* If optimized, generate immediate CONST_DOUBLE
9219 which will be turned into memory by reload if necessary.
9221 We used to force a register so that loop.c could see it. But
9222 this does not allow gen_* patterns to perform optimizations with
9223 the constants. It also produces two insns in cases like "x = 1.0;".
9224 On most machines, floating-point constants are not permitted in
9225 many insns, so we'd end up copying it to a register in any case.
9227 Now, we do the copying in expand_binop, if appropriate. */
9228 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp
),
9229 TYPE_MODE (TREE_TYPE (exp
)));
9232 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp
),
9233 TYPE_MODE (TREE_TYPE (exp
)));
9236 /* Handle evaluating a complex constant in a CONCAT target. */
9237 if (original_target
&& GET_CODE (original_target
) == CONCAT
)
9239 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
9242 rtarg
= XEXP (original_target
, 0);
9243 itarg
= XEXP (original_target
, 1);
9245 /* Move the real and imaginary parts separately. */
9246 op0
= expand_expr (TREE_REALPART (exp
), rtarg
, mode
, EXPAND_NORMAL
);
9247 op1
= expand_expr (TREE_IMAGPART (exp
), itarg
, mode
, EXPAND_NORMAL
);
9250 emit_move_insn (rtarg
, op0
);
9252 emit_move_insn (itarg
, op1
);
9254 return original_target
;
9257 /* ... fall through ... */
9260 temp
= expand_expr_constant (exp
, 1, modifier
);
9262 /* temp contains a constant address.
9263 On RISC machines where a constant address isn't valid,
9264 make some insns to get that address into a register. */
9265 if (modifier
!= EXPAND_CONST_ADDRESS
9266 && modifier
!= EXPAND_INITIALIZER
9267 && modifier
!= EXPAND_SUM
9268 && ! memory_address_addr_space_p (mode
, XEXP (temp
, 0),
9269 MEM_ADDR_SPACE (temp
)))
9270 return replace_equiv_address (temp
,
9271 copy_rtx (XEXP (temp
, 0)));
9277 rtx ret
= expand_expr_real_1 (val
, target
, tmode
, modifier
, alt_rtl
);
9279 if (!SAVE_EXPR_RESOLVED_P (exp
))
9281 /* We can indeed still hit this case, typically via builtin
9282 expanders calling save_expr immediately before expanding
9283 something. Assume this means that we only have to deal
9284 with non-BLKmode values. */
9285 gcc_assert (GET_MODE (ret
) != BLKmode
);
9287 val
= build_decl (EXPR_LOCATION (exp
),
9288 VAR_DECL
, NULL
, TREE_TYPE (exp
));
9289 DECL_ARTIFICIAL (val
) = 1;
9290 DECL_IGNORED_P (val
) = 1;
9292 TREE_OPERAND (exp
, 0) = treeop0
;
9293 SAVE_EXPR_RESOLVED_P (exp
) = 1;
9295 if (!CONSTANT_P (ret
))
9296 ret
= copy_to_reg (ret
);
9297 SET_DECL_RTL (val
, ret
);
9305 /* If we don't need the result, just ensure we evaluate any
9309 unsigned HOST_WIDE_INT idx
;
9312 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
9313 expand_expr (value
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
9318 return expand_constructor (exp
, target
, modifier
, false);
9320 case TARGET_MEM_REF
:
9323 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
9324 struct mem_address addr
;
9325 enum insn_code icode
;
9328 get_address_description (exp
, &addr
);
9329 op0
= addr_for_mem_ref (&addr
, as
, true);
9330 op0
= memory_address_addr_space (mode
, op0
, as
);
9331 temp
= gen_rtx_MEM (mode
, op0
);
9332 set_mem_attributes (temp
, exp
, 0);
9333 set_mem_addr_space (temp
, as
);
9334 align
= get_object_or_type_alignment (exp
);
9335 if (modifier
!= EXPAND_WRITE
9337 && align
< GET_MODE_ALIGNMENT (mode
)
9338 /* If the target does not have special handling for unaligned
9339 loads of mode then it can use regular moves for them. */
9340 && ((icode
= optab_handler (movmisalign_optab
, mode
))
9341 != CODE_FOR_nothing
))
9343 struct expand_operand ops
[2];
9345 /* We've already validated the memory, and we're creating a
9346 new pseudo destination. The predicates really can't fail,
9347 nor can the generator. */
9348 create_output_operand (&ops
[0], NULL_RTX
, mode
);
9349 create_fixed_operand (&ops
[1], temp
);
9350 expand_insn (icode
, 2, ops
);
9351 return ops
[0].value
;
9359 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
9360 enum machine_mode address_mode
;
9361 tree base
= TREE_OPERAND (exp
, 0);
9363 enum insn_code icode
;
9365 /* Handle expansion of non-aliased memory with non-BLKmode. That
9366 might end up in a register. */
9367 if (mem_ref_refers_to_non_mem_p (exp
))
9369 HOST_WIDE_INT offset
= mem_ref_offset (exp
).low
;
9372 base
= TREE_OPERAND (base
, 0);
9374 && host_integerp (TYPE_SIZE (TREE_TYPE (exp
)), 1)
9375 && (GET_MODE_BITSIZE (DECL_MODE (base
))
9376 == TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp
)))))
9377 return expand_expr (build1 (VIEW_CONVERT_EXPR
,
9378 TREE_TYPE (exp
), base
),
9379 target
, tmode
, modifier
);
9380 bit_offset
= bitsize_int (offset
* BITS_PER_UNIT
);
9381 bftype
= TREE_TYPE (base
);
9382 if (TYPE_MODE (TREE_TYPE (exp
)) != BLKmode
)
9383 bftype
= TREE_TYPE (exp
);
9386 temp
= assign_stack_temp (DECL_MODE (base
),
9387 GET_MODE_SIZE (DECL_MODE (base
)),
9389 store_expr (base
, temp
, 0, false);
9390 temp
= adjust_address (temp
, BLKmode
, offset
);
9391 set_mem_size (temp
, int_size_in_bytes (TREE_TYPE (exp
)));
9394 return expand_expr (build3 (BIT_FIELD_REF
, bftype
,
9396 TYPE_SIZE (TREE_TYPE (exp
)),
9398 target
, tmode
, modifier
);
9400 address_mode
= targetm
.addr_space
.address_mode (as
);
9401 base
= TREE_OPERAND (exp
, 0);
9402 if ((def_stmt
= get_def_for_expr (base
, BIT_AND_EXPR
)))
9404 tree mask
= gimple_assign_rhs2 (def_stmt
);
9405 base
= build2 (BIT_AND_EXPR
, TREE_TYPE (base
),
9406 gimple_assign_rhs1 (def_stmt
), mask
);
9407 TREE_OPERAND (exp
, 0) = base
;
9409 align
= get_object_or_type_alignment (exp
);
9410 op0
= expand_expr (base
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
9411 op0
= memory_address_addr_space (address_mode
, op0
, as
);
9412 if (!integer_zerop (TREE_OPERAND (exp
, 1)))
9415 = immed_double_int_const (mem_ref_offset (exp
), address_mode
);
9416 op0
= simplify_gen_binary (PLUS
, address_mode
, op0
, off
);
9418 op0
= memory_address_addr_space (mode
, op0
, as
);
9419 temp
= gen_rtx_MEM (mode
, op0
);
9420 set_mem_attributes (temp
, exp
, 0);
9421 set_mem_addr_space (temp
, as
);
9422 if (TREE_THIS_VOLATILE (exp
))
9423 MEM_VOLATILE_P (temp
) = 1;
9424 if (modifier
!= EXPAND_WRITE
9426 && align
< GET_MODE_ALIGNMENT (mode
))
9428 if ((icode
= optab_handler (movmisalign_optab
, mode
))
9429 != CODE_FOR_nothing
)
9431 struct expand_operand ops
[2];
9433 /* We've already validated the memory, and we're creating a
9434 new pseudo destination. The predicates really can't fail,
9435 nor can the generator. */
9436 create_output_operand (&ops
[0], NULL_RTX
, mode
);
9437 create_fixed_operand (&ops
[1], temp
);
9438 expand_insn (icode
, 2, ops
);
9439 return ops
[0].value
;
9441 else if (SLOW_UNALIGNED_ACCESS (mode
, align
))
9442 temp
= extract_bit_field (temp
, GET_MODE_BITSIZE (mode
),
9443 0, TYPE_UNSIGNED (TREE_TYPE (exp
)),
9444 true, (modifier
== EXPAND_STACK_PARM
9445 ? NULL_RTX
: target
),
9454 tree array
= treeop0
;
9455 tree index
= treeop1
;
9457 /* Fold an expression like: "foo"[2].
9458 This is not done in fold so it won't happen inside &.
9459 Don't fold if this is for wide characters since it's too
9460 difficult to do correctly and this is a very rare case. */
9462 if (modifier
!= EXPAND_CONST_ADDRESS
9463 && modifier
!= EXPAND_INITIALIZER
9464 && modifier
!= EXPAND_MEMORY
)
9466 tree t
= fold_read_from_constant_string (exp
);
9469 return expand_expr (t
, target
, tmode
, modifier
);
9472 /* If this is a constant index into a constant array,
9473 just get the value from the array. Handle both the cases when
9474 we have an explicit constructor and when our operand is a variable
9475 that was declared const. */
9477 if (modifier
!= EXPAND_CONST_ADDRESS
9478 && modifier
!= EXPAND_INITIALIZER
9479 && modifier
!= EXPAND_MEMORY
9480 && TREE_CODE (array
) == CONSTRUCTOR
9481 && ! TREE_SIDE_EFFECTS (array
)
9482 && TREE_CODE (index
) == INTEGER_CST
)
9484 unsigned HOST_WIDE_INT ix
;
9487 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array
), ix
,
9489 if (tree_int_cst_equal (field
, index
))
9491 if (!TREE_SIDE_EFFECTS (value
))
9492 return expand_expr (fold (value
), target
, tmode
, modifier
);
9497 else if (optimize
>= 1
9498 && modifier
!= EXPAND_CONST_ADDRESS
9499 && modifier
!= EXPAND_INITIALIZER
9500 && modifier
!= EXPAND_MEMORY
9501 && TREE_READONLY (array
) && ! TREE_SIDE_EFFECTS (array
)
9502 && TREE_CODE (array
) == VAR_DECL
&& DECL_INITIAL (array
)
9503 && TREE_CODE (DECL_INITIAL (array
)) != ERROR_MARK
9504 && const_value_known_p (array
))
9506 if (TREE_CODE (index
) == INTEGER_CST
)
9508 tree init
= DECL_INITIAL (array
);
9510 if (TREE_CODE (init
) == CONSTRUCTOR
)
9512 unsigned HOST_WIDE_INT ix
;
9515 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), ix
,
9517 if (tree_int_cst_equal (field
, index
))
9519 if (TREE_SIDE_EFFECTS (value
))
9522 if (TREE_CODE (value
) == CONSTRUCTOR
)
9524 /* If VALUE is a CONSTRUCTOR, this
9525 optimization is only useful if
9526 this doesn't store the CONSTRUCTOR
9527 into memory. If it does, it is more
9528 efficient to just load the data from
9529 the array directly. */
9530 rtx ret
= expand_constructor (value
, target
,
9532 if (ret
== NULL_RTX
)
9536 return expand_expr (fold (value
), target
, tmode
,
9540 else if(TREE_CODE (init
) == STRING_CST
)
9542 tree index1
= index
;
9543 tree low_bound
= array_ref_low_bound (exp
);
9544 index1
= fold_convert_loc (loc
, sizetype
,
9547 /* Optimize the special-case of a zero lower bound.
9549 We convert the low_bound to sizetype to avoid some problems
9550 with constant folding. (E.g. suppose the lower bound is 1,
9551 and its mode is QI. Without the conversion,l (ARRAY
9552 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
9553 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
9555 if (! integer_zerop (low_bound
))
9556 index1
= size_diffop_loc (loc
, index1
,
9557 fold_convert_loc (loc
, sizetype
,
9560 if (0 > compare_tree_int (index1
,
9561 TREE_STRING_LENGTH (init
)))
9563 tree type
= TREE_TYPE (TREE_TYPE (init
));
9564 enum machine_mode mode
= TYPE_MODE (type
);
9566 if (GET_MODE_CLASS (mode
) == MODE_INT
9567 && GET_MODE_SIZE (mode
) == 1)
9568 return gen_int_mode (TREE_STRING_POINTER (init
)
9569 [TREE_INT_CST_LOW (index1
)],
9576 goto normal_inner_ref
;
9579 /* If the operand is a CONSTRUCTOR, we can just extract the
9580 appropriate field if it is present. */
9581 if (TREE_CODE (treeop0
) == CONSTRUCTOR
)
9583 unsigned HOST_WIDE_INT idx
;
9586 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0
),
9588 if (field
== treeop1
9589 /* We can normally use the value of the field in the
9590 CONSTRUCTOR. However, if this is a bitfield in
9591 an integral mode that we can fit in a HOST_WIDE_INT,
9592 we must mask only the number of bits in the bitfield,
9593 since this is done implicitly by the constructor. If
9594 the bitfield does not meet either of those conditions,
9595 we can't do this optimization. */
9596 && (! DECL_BIT_FIELD (field
)
9597 || ((GET_MODE_CLASS (DECL_MODE (field
)) == MODE_INT
)
9598 && (GET_MODE_PRECISION (DECL_MODE (field
))
9599 <= HOST_BITS_PER_WIDE_INT
))))
9601 if (DECL_BIT_FIELD (field
)
9602 && modifier
== EXPAND_STACK_PARM
)
9604 op0
= expand_expr (value
, target
, tmode
, modifier
);
9605 if (DECL_BIT_FIELD (field
))
9607 HOST_WIDE_INT bitsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
9608 enum machine_mode imode
= TYPE_MODE (TREE_TYPE (field
));
9610 if (TYPE_UNSIGNED (TREE_TYPE (field
)))
9612 op1
= GEN_INT (((HOST_WIDE_INT
) 1 << bitsize
) - 1);
9613 op0
= expand_and (imode
, op0
, op1
, target
);
9617 int count
= GET_MODE_PRECISION (imode
) - bitsize
;
9619 op0
= expand_shift (LSHIFT_EXPR
, imode
, op0
, count
,
9621 op0
= expand_shift (RSHIFT_EXPR
, imode
, op0
, count
,
9629 goto normal_inner_ref
;
9632 case ARRAY_RANGE_REF
:
9635 enum machine_mode mode1
, mode2
;
9636 HOST_WIDE_INT bitsize
, bitpos
;
9638 int volatilep
= 0, must_force_mem
;
9639 bool packedp
= false;
9640 tree tem
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
9641 &mode1
, &unsignedp
, &volatilep
, true);
9642 rtx orig_op0
, memloc
;
9643 bool mem_attrs_from_type
= false;
9645 /* If we got back the original object, something is wrong. Perhaps
9646 we are evaluating an expression too early. In any event, don't
9647 infinitely recurse. */
9648 gcc_assert (tem
!= exp
);
9650 if (TYPE_PACKED (TREE_TYPE (TREE_OPERAND (exp
, 0)))
9651 || (TREE_CODE (TREE_OPERAND (exp
, 1)) == FIELD_DECL
9652 && DECL_PACKED (TREE_OPERAND (exp
, 1))))
9655 /* If TEM's type is a union of variable size, pass TARGET to the inner
9656 computation, since it will need a temporary and TARGET is known
9657 to have to do. This occurs in unchecked conversion in Ada. */
9660 (TREE_CODE (TREE_TYPE (tem
)) == UNION_TYPE
9661 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem
)))
9663 && modifier
!= EXPAND_STACK_PARM
9664 ? target
: NULL_RTX
),
9666 (modifier
== EXPAND_INITIALIZER
9667 || modifier
== EXPAND_CONST_ADDRESS
9668 || modifier
== EXPAND_STACK_PARM
)
9669 ? modifier
: EXPAND_NORMAL
);
9672 /* If the bitfield is volatile, we want to access it in the
9673 field's mode, not the computed mode.
9674 If a MEM has VOIDmode (external with incomplete type),
9675 use BLKmode for it instead. */
9678 if (volatilep
&& flag_strict_volatile_bitfields
> 0)
9679 op0
= adjust_address (op0
, mode1
, 0);
9680 else if (GET_MODE (op0
) == VOIDmode
)
9681 op0
= adjust_address (op0
, BLKmode
, 0);
9685 = CONSTANT_P (op0
) ? TYPE_MODE (TREE_TYPE (tem
)) : GET_MODE (op0
);
9687 /* If we have either an offset, a BLKmode result, or a reference
9688 outside the underlying object, we must force it to memory.
9689 Such a case can occur in Ada if we have unchecked conversion
9690 of an expression from a scalar type to an aggregate type or
9691 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
9692 passed a partially uninitialized object or a view-conversion
9693 to a larger size. */
9694 must_force_mem
= (offset
9696 || bitpos
+ bitsize
> GET_MODE_BITSIZE (mode2
));
9698 /* Handle CONCAT first. */
9699 if (GET_CODE (op0
) == CONCAT
&& !must_force_mem
)
9702 && bitsize
== GET_MODE_BITSIZE (GET_MODE (op0
)))
9705 && bitsize
== GET_MODE_BITSIZE (GET_MODE (XEXP (op0
, 0)))
9708 op0
= XEXP (op0
, 0);
9709 mode2
= GET_MODE (op0
);
9711 else if (bitpos
== GET_MODE_BITSIZE (GET_MODE (XEXP (op0
, 0)))
9712 && bitsize
== GET_MODE_BITSIZE (GET_MODE (XEXP (op0
, 1)))
9716 op0
= XEXP (op0
, 1);
9718 mode2
= GET_MODE (op0
);
9721 /* Otherwise force into memory. */
9725 /* If this is a constant, put it in a register if it is a legitimate
9726 constant and we don't need a memory reference. */
9727 if (CONSTANT_P (op0
)
9729 && targetm
.legitimate_constant_p (mode2
, op0
)
9731 op0
= force_reg (mode2
, op0
);
9733 /* Otherwise, if this is a constant, try to force it to the constant
9734 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
9735 is a legitimate constant. */
9736 else if (CONSTANT_P (op0
) && (memloc
= force_const_mem (mode2
, op0
)))
9737 op0
= validize_mem (memloc
);
9739 /* Otherwise, if this is a constant or the object is not in memory
9740 and need be, put it there. */
9741 else if (CONSTANT_P (op0
) || (!MEM_P (op0
) && must_force_mem
))
9743 tree nt
= build_qualified_type (TREE_TYPE (tem
),
9744 (TYPE_QUALS (TREE_TYPE (tem
))
9745 | TYPE_QUAL_CONST
));
9746 memloc
= assign_temp (nt
, 1, 1, 1);
9747 emit_move_insn (memloc
, op0
);
9749 mem_attrs_from_type
= true;
9754 enum machine_mode address_mode
;
9755 rtx offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
,
9758 gcc_assert (MEM_P (op0
));
9761 = targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (op0
));
9762 if (GET_MODE (offset_rtx
) != address_mode
)
9763 offset_rtx
= convert_to_mode (address_mode
, offset_rtx
, 0);
9765 if (GET_MODE (op0
) == BLKmode
9766 /* A constant address in OP0 can have VOIDmode, we must
9767 not try to call force_reg in that case. */
9768 && GET_MODE (XEXP (op0
, 0)) != VOIDmode
9770 && (bitpos
% bitsize
) == 0
9771 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
9772 && MEM_ALIGN (op0
) == GET_MODE_ALIGNMENT (mode1
))
9774 op0
= adjust_address (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
9778 op0
= offset_address (op0
, offset_rtx
,
9779 highest_pow2_factor (offset
));
9782 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
9783 record its alignment as BIGGEST_ALIGNMENT. */
9784 if (MEM_P (op0
) && bitpos
== 0 && offset
!= 0
9785 && is_aligning_offset (offset
, tem
))
9786 set_mem_align (op0
, BIGGEST_ALIGNMENT
);
9788 /* Don't forget about volatility even if this is a bitfield. */
9789 if (MEM_P (op0
) && volatilep
&& ! MEM_VOLATILE_P (op0
))
9791 if (op0
== orig_op0
)
9792 op0
= copy_rtx (op0
);
9794 MEM_VOLATILE_P (op0
) = 1;
9797 /* In cases where an aligned union has an unaligned object
9798 as a field, we might be extracting a BLKmode value from
9799 an integer-mode (e.g., SImode) object. Handle this case
9800 by doing the extract into an object as wide as the field
9801 (which we know to be the width of a basic mode), then
9802 storing into memory, and changing the mode to BLKmode. */
9803 if (mode1
== VOIDmode
9804 || REG_P (op0
) || GET_CODE (op0
) == SUBREG
9805 || (mode1
!= BLKmode
&& ! direct_load
[(int) mode1
]
9806 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
9807 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
9808 && modifier
!= EXPAND_CONST_ADDRESS
9809 && modifier
!= EXPAND_INITIALIZER
)
9810 /* If the field is volatile, we always want an aligned
9811 access. Do this in following two situations:
9812 1. the access is not already naturally
9813 aligned, otherwise "normal" (non-bitfield) volatile fields
9814 become non-addressable.
9815 2. the bitsize is narrower than the access size. Need
9816 to extract bitfields from the access. */
9817 || (volatilep
&& flag_strict_volatile_bitfields
> 0
9818 && (bitpos
% GET_MODE_ALIGNMENT (mode
) != 0
9819 || (mode1
!= BLKmode
9820 && bitsize
< GET_MODE_SIZE (mode1
) * BITS_PER_UNIT
)))
9821 /* If the field isn't aligned enough to fetch as a memref,
9822 fetch it as a bit field. */
9823 || (mode1
!= BLKmode
9824 && (((TYPE_ALIGN (TREE_TYPE (tem
)) < GET_MODE_ALIGNMENT (mode
)
9825 || (bitpos
% GET_MODE_ALIGNMENT (mode
) != 0)
9827 && (MEM_ALIGN (op0
) < GET_MODE_ALIGNMENT (mode1
)
9828 || (bitpos
% GET_MODE_ALIGNMENT (mode1
) != 0))))
9829 && ((modifier
== EXPAND_CONST_ADDRESS
9830 || modifier
== EXPAND_INITIALIZER
)
9832 : SLOW_UNALIGNED_ACCESS (mode1
, MEM_ALIGN (op0
))))
9833 || (bitpos
% BITS_PER_UNIT
!= 0)))
9834 /* If the type and the field are a constant size and the
9835 size of the type isn't the same size as the bitfield,
9836 we must use bitfield operations. */
9838 && TYPE_SIZE (TREE_TYPE (exp
))
9839 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
9840 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)),
9843 enum machine_mode ext_mode
= mode
;
9845 if (ext_mode
== BLKmode
9846 && ! (target
!= 0 && MEM_P (op0
)
9848 && bitpos
% BITS_PER_UNIT
== 0))
9849 ext_mode
= mode_for_size (bitsize
, MODE_INT
, 1);
9851 if (ext_mode
== BLKmode
)
9854 target
= assign_temp (type
, 0, 1, 1);
9859 /* In this case, BITPOS must start at a byte boundary and
9860 TARGET, if specified, must be a MEM. */
9861 gcc_assert (MEM_P (op0
)
9862 && (!target
|| MEM_P (target
))
9863 && !(bitpos
% BITS_PER_UNIT
));
9865 emit_block_move (target
,
9866 adjust_address (op0
, VOIDmode
,
9867 bitpos
/ BITS_PER_UNIT
),
9868 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
9870 (modifier
== EXPAND_STACK_PARM
9871 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
9876 op0
= validize_mem (op0
);
9878 if (MEM_P (op0
) && REG_P (XEXP (op0
, 0)))
9879 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
9881 op0
= extract_bit_field (op0
, bitsize
, bitpos
, unsignedp
, packedp
,
9882 (modifier
== EXPAND_STACK_PARM
9883 ? NULL_RTX
: target
),
9884 ext_mode
, ext_mode
);
9886 /* If the result is a record type and BITSIZE is narrower than
9887 the mode of OP0, an integral mode, and this is a big endian
9888 machine, we must put the field into the high-order bits. */
9889 if (TREE_CODE (type
) == RECORD_TYPE
&& BYTES_BIG_ENDIAN
9890 && GET_MODE_CLASS (GET_MODE (op0
)) == MODE_INT
9891 && bitsize
< (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (op0
)))
9892 op0
= expand_shift (LSHIFT_EXPR
, GET_MODE (op0
), op0
,
9893 GET_MODE_BITSIZE (GET_MODE (op0
))
9896 /* If the result type is BLKmode, store the data into a temporary
9897 of the appropriate type, but with the mode corresponding to the
9898 mode for the data we have (op0's mode). It's tempting to make
9899 this a constant type, since we know it's only being stored once,
9900 but that can cause problems if we are taking the address of this
9901 COMPONENT_REF because the MEM of any reference via that address
9902 will have flags corresponding to the type, which will not
9903 necessarily be constant. */
9904 if (mode
== BLKmode
)
9908 new_rtx
= assign_stack_temp_for_type (ext_mode
,
9909 GET_MODE_BITSIZE (ext_mode
),
9911 emit_move_insn (new_rtx
, op0
);
9912 op0
= copy_rtx (new_rtx
);
9913 PUT_MODE (op0
, BLKmode
);
9919 /* If the result is BLKmode, use that to access the object
9921 if (mode
== BLKmode
)
9924 /* Get a reference to just this component. */
9925 if (modifier
== EXPAND_CONST_ADDRESS
9926 || modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
9927 op0
= adjust_address_nv (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
9929 op0
= adjust_address (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
9931 if (op0
== orig_op0
)
9932 op0
= copy_rtx (op0
);
9934 /* If op0 is a temporary because of forcing to memory, pass only the
9935 type to set_mem_attributes so that the original expression is never
9936 marked as ADDRESSABLE through MEM_EXPR of the temporary. */
9937 if (mem_attrs_from_type
)
9938 set_mem_attributes (op0
, type
, 0);
9940 set_mem_attributes (op0
, exp
, 0);
9942 if (REG_P (XEXP (op0
, 0)))
9943 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
9945 MEM_VOLATILE_P (op0
) |= volatilep
;
9946 if (mode
== mode1
|| mode1
== BLKmode
|| mode1
== tmode
9947 || modifier
== EXPAND_CONST_ADDRESS
9948 || modifier
== EXPAND_INITIALIZER
)
9950 else if (target
== 0)
9951 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
9953 convert_move (target
, op0
, unsignedp
);
9958 return expand_expr (OBJ_TYPE_REF_EXPR (exp
), target
, tmode
, modifier
);
9961 /* All valid uses of __builtin_va_arg_pack () are removed during
9963 if (CALL_EXPR_VA_ARG_PACK (exp
))
9964 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp
);
9966 tree fndecl
= get_callee_fndecl (exp
), attr
;
9969 && (attr
= lookup_attribute ("error",
9970 DECL_ATTRIBUTES (fndecl
))) != NULL
)
9971 error ("%Kcall to %qs declared with attribute error: %s",
9972 exp
, identifier_to_locale (lang_hooks
.decl_printable_name (fndecl
, 1)),
9973 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
9975 && (attr
= lookup_attribute ("warning",
9976 DECL_ATTRIBUTES (fndecl
))) != NULL
)
9977 warning_at (tree_nonartificial_location (exp
),
9978 0, "%Kcall to %qs declared with attribute warning: %s",
9979 exp
, identifier_to_locale (lang_hooks
.decl_printable_name (fndecl
, 1)),
9980 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
9982 /* Check for a built-in function. */
9983 if (fndecl
&& DECL_BUILT_IN (fndecl
))
9985 gcc_assert (DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_FRONTEND
);
9986 return expand_builtin (exp
, target
, subtarget
, tmode
, ignore
);
9989 return expand_call (exp
, target
, ignore
);
9991 case VIEW_CONVERT_EXPR
:
9994 /* If we are converting to BLKmode, try to avoid an intermediate
9995 temporary by fetching an inner memory reference. */
9997 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
9998 && TYPE_MODE (TREE_TYPE (treeop0
)) != BLKmode
9999 && handled_component_p (treeop0
))
10001 enum machine_mode mode1
;
10002 HOST_WIDE_INT bitsize
, bitpos
;
10007 = get_inner_reference (treeop0
, &bitsize
, &bitpos
,
10008 &offset
, &mode1
, &unsignedp
, &volatilep
,
10012 /* ??? We should work harder and deal with non-zero offsets. */
10014 && (bitpos
% BITS_PER_UNIT
) == 0
10016 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)), bitsize
) == 0)
10018 /* See the normal_inner_ref case for the rationale. */
10020 = expand_expr (tem
,
10021 (TREE_CODE (TREE_TYPE (tem
)) == UNION_TYPE
10022 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem
)))
10024 && modifier
!= EXPAND_STACK_PARM
10025 ? target
: NULL_RTX
),
10027 (modifier
== EXPAND_INITIALIZER
10028 || modifier
== EXPAND_CONST_ADDRESS
10029 || modifier
== EXPAND_STACK_PARM
)
10030 ? modifier
: EXPAND_NORMAL
);
10032 if (MEM_P (orig_op0
))
10036 /* Get a reference to just this component. */
10037 if (modifier
== EXPAND_CONST_ADDRESS
10038 || modifier
== EXPAND_SUM
10039 || modifier
== EXPAND_INITIALIZER
)
10040 op0
= adjust_address_nv (op0
, mode
, bitpos
/ BITS_PER_UNIT
);
10042 op0
= adjust_address (op0
, mode
, bitpos
/ BITS_PER_UNIT
);
10044 if (op0
== orig_op0
)
10045 op0
= copy_rtx (op0
);
10047 set_mem_attributes (op0
, treeop0
, 0);
10048 if (REG_P (XEXP (op0
, 0)))
10049 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
10051 MEM_VOLATILE_P (op0
) |= volatilep
;
10057 op0
= expand_expr (treeop0
,
10058 NULL_RTX
, VOIDmode
, modifier
);
10060 /* If the input and output modes are both the same, we are done. */
10061 if (mode
== GET_MODE (op0
))
10063 /* If neither mode is BLKmode, and both modes are the same size
10064 then we can use gen_lowpart. */
10065 else if (mode
!= BLKmode
&& GET_MODE (op0
) != BLKmode
10066 && (GET_MODE_PRECISION (mode
)
10067 == GET_MODE_PRECISION (GET_MODE (op0
)))
10068 && !COMPLEX_MODE_P (GET_MODE (op0
)))
10070 if (GET_CODE (op0
) == SUBREG
)
10071 op0
= force_reg (GET_MODE (op0
), op0
);
10072 temp
= gen_lowpart_common (mode
, op0
);
10077 if (!REG_P (op0
) && !MEM_P (op0
))
10078 op0
= force_reg (GET_MODE (op0
), op0
);
10079 op0
= gen_lowpart (mode
, op0
);
10082 /* If both types are integral, convert from one mode to the other. */
10083 else if (INTEGRAL_TYPE_P (type
) && INTEGRAL_TYPE_P (TREE_TYPE (treeop0
)))
10084 op0
= convert_modes (mode
, GET_MODE (op0
), op0
,
10085 TYPE_UNSIGNED (TREE_TYPE (treeop0
)));
10086 /* As a last resort, spill op0 to memory, and reload it in a
10088 else if (!MEM_P (op0
))
10090 /* If the operand is not a MEM, force it into memory. Since we
10091 are going to be changing the mode of the MEM, don't call
10092 force_const_mem for constants because we don't allow pool
10093 constants to change mode. */
10094 tree inner_type
= TREE_TYPE (treeop0
);
10096 gcc_assert (!TREE_ADDRESSABLE (exp
));
10098 if (target
== 0 || GET_MODE (target
) != TYPE_MODE (inner_type
))
10100 = assign_stack_temp_for_type
10101 (TYPE_MODE (inner_type
),
10102 GET_MODE_SIZE (TYPE_MODE (inner_type
)), 0, inner_type
);
10104 emit_move_insn (target
, op0
);
10108 /* At this point, OP0 is in the correct mode. If the output type is
10109 such that the operand is known to be aligned, indicate that it is.
10110 Otherwise, we need only be concerned about alignment for non-BLKmode
10114 enum insn_code icode
;
10116 op0
= copy_rtx (op0
);
10118 if (TYPE_ALIGN_OK (type
))
10119 set_mem_align (op0
, MAX (MEM_ALIGN (op0
), TYPE_ALIGN (type
)));
10120 else if (mode
!= BLKmode
10121 && MEM_ALIGN (op0
) < GET_MODE_ALIGNMENT (mode
)
10122 /* If the target does have special handling for unaligned
10123 loads of mode then use them. */
10124 && ((icode
= optab_handler (movmisalign_optab
, mode
))
10125 != CODE_FOR_nothing
))
10129 op0
= adjust_address (op0
, mode
, 0);
10130 /* We've already validated the memory, and we're creating a
10131 new pseudo destination. The predicates really can't
10133 reg
= gen_reg_rtx (mode
);
10135 /* Nor can the insn generator. */
10136 insn
= GEN_FCN (icode
) (reg
, op0
);
10140 else if (STRICT_ALIGNMENT
10142 && MEM_ALIGN (op0
) < GET_MODE_ALIGNMENT (mode
))
10144 tree inner_type
= TREE_TYPE (treeop0
);
10145 HOST_WIDE_INT temp_size
10146 = MAX (int_size_in_bytes (inner_type
),
10147 (HOST_WIDE_INT
) GET_MODE_SIZE (mode
));
10149 = assign_stack_temp_for_type (mode
, temp_size
, 0, type
);
10150 rtx new_with_op0_mode
10151 = adjust_address (new_rtx
, GET_MODE (op0
), 0);
10153 gcc_assert (!TREE_ADDRESSABLE (exp
));
10155 if (GET_MODE (op0
) == BLKmode
)
10156 emit_block_move (new_with_op0_mode
, op0
,
10157 GEN_INT (GET_MODE_SIZE (mode
)),
10158 (modifier
== EXPAND_STACK_PARM
10159 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
10161 emit_move_insn (new_with_op0_mode
, op0
);
10166 op0
= adjust_address (op0
, mode
, 0);
10173 tree lhs
= treeop0
;
10174 tree rhs
= treeop1
;
10175 gcc_assert (ignore
);
10177 /* Check for |= or &= of a bitfield of size one into another bitfield
10178 of size 1. In this case, (unless we need the result of the
10179 assignment) we can do this more efficiently with a
10180 test followed by an assignment, if necessary.
10182 ??? At this point, we can't get a BIT_FIELD_REF here. But if
10183 things change so we do, this code should be enhanced to
10185 if (TREE_CODE (lhs
) == COMPONENT_REF
10186 && (TREE_CODE (rhs
) == BIT_IOR_EXPR
10187 || TREE_CODE (rhs
) == BIT_AND_EXPR
)
10188 && TREE_OPERAND (rhs
, 0) == lhs
10189 && TREE_CODE (TREE_OPERAND (rhs
, 1)) == COMPONENT_REF
10190 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs
, 1)))
10191 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs
, 1), 1))))
10193 rtx label
= gen_label_rtx ();
10194 int value
= TREE_CODE (rhs
) == BIT_IOR_EXPR
;
10195 do_jump (TREE_OPERAND (rhs
, 1),
10197 value
? 0 : label
, -1);
10198 expand_assignment (lhs
, build_int_cst (TREE_TYPE (rhs
), value
),
10199 MOVE_NONTEMPORAL (exp
));
10200 do_pending_stack_adjust ();
10201 emit_label (label
);
10205 expand_assignment (lhs
, rhs
, MOVE_NONTEMPORAL (exp
));
10210 return expand_expr_addr_expr (exp
, target
, tmode
, modifier
);
10212 case REALPART_EXPR
:
10213 op0
= expand_normal (treeop0
);
10214 return read_complex_part (op0
, false);
10216 case IMAGPART_EXPR
:
10217 op0
= expand_normal (treeop0
);
10218 return read_complex_part (op0
, true);
10225 /* Expanded in cfgexpand.c. */
10226 gcc_unreachable ();
10228 case TRY_CATCH_EXPR
:
10230 case EH_FILTER_EXPR
:
10231 case TRY_FINALLY_EXPR
:
10232 /* Lowered by tree-eh.c. */
10233 gcc_unreachable ();
10235 case WITH_CLEANUP_EXPR
:
10236 case CLEANUP_POINT_EXPR
:
10238 case CASE_LABEL_EXPR
:
10243 case COMPOUND_EXPR
:
10244 case PREINCREMENT_EXPR
:
10245 case PREDECREMENT_EXPR
:
10246 case POSTINCREMENT_EXPR
:
10247 case POSTDECREMENT_EXPR
:
10250 /* Lowered by gimplify.c. */
10251 gcc_unreachable ();
10254 /* Function descriptors are not valid except for as
10255 initialization constants, and should not be expanded. */
10256 gcc_unreachable ();
10258 case WITH_SIZE_EXPR
:
10259 /* WITH_SIZE_EXPR expands to its first argument. The caller should
10260 have pulled out the size to use in whatever context it needed. */
10261 return expand_expr_real (treeop0
, original_target
, tmode
,
10262 modifier
, alt_rtl
);
10264 case COMPOUND_LITERAL_EXPR
:
10266 /* Initialize the anonymous variable declared in the compound
10267 literal, then return the variable. */
10268 tree decl
= COMPOUND_LITERAL_EXPR_DECL (exp
);
10270 /* Create RTL for this variable. */
10271 if (!DECL_RTL_SET_P (decl
))
10273 if (DECL_HARD_REGISTER (decl
))
10274 /* The user specified an assembler name for this variable.
10275 Set that up now. */
10276 rest_of_decl_compilation (decl
, 0, 0);
10278 expand_decl (decl
);
10281 return expand_expr_real (decl
, original_target
, tmode
,
10282 modifier
, alt_rtl
);
10286 return expand_expr_real_2 (&ops
, target
, tmode
, modifier
);
10290 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
10291 signedness of TYPE), possibly returning the result in TARGET. */
10293 reduce_to_bit_field_precision (rtx exp
, rtx target
, tree type
)
10295 HOST_WIDE_INT prec
= TYPE_PRECISION (type
);
10296 if (target
&& GET_MODE (target
) != GET_MODE (exp
))
10298 /* For constant values, reduce using build_int_cst_type. */
10299 if (CONST_INT_P (exp
))
10301 HOST_WIDE_INT value
= INTVAL (exp
);
10302 tree t
= build_int_cst_type (type
, value
);
10303 return expand_expr (t
, target
, VOIDmode
, EXPAND_NORMAL
);
10305 else if (TYPE_UNSIGNED (type
))
10307 rtx mask
= immed_double_int_const (double_int_mask (prec
),
10309 return expand_and (GET_MODE (exp
), exp
, mask
, target
);
10313 int count
= GET_MODE_PRECISION (GET_MODE (exp
)) - prec
;
10314 exp
= expand_shift (LSHIFT_EXPR
, GET_MODE (exp
),
10315 exp
, count
, target
, 0);
10316 return expand_shift (RSHIFT_EXPR
, GET_MODE (exp
),
10317 exp
, count
, target
, 0);
10321 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
10322 when applied to the address of EXP produces an address known to be
10323 aligned more than BIGGEST_ALIGNMENT. */
10326 is_aligning_offset (const_tree offset
, const_tree exp
)
10328 /* Strip off any conversions. */
10329 while (CONVERT_EXPR_P (offset
))
10330 offset
= TREE_OPERAND (offset
, 0);
10332 /* We must now have a BIT_AND_EXPR with a constant that is one less than
10333 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
10334 if (TREE_CODE (offset
) != BIT_AND_EXPR
10335 || !host_integerp (TREE_OPERAND (offset
, 1), 1)
10336 || compare_tree_int (TREE_OPERAND (offset
, 1),
10337 BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) <= 0
10338 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset
, 1), 1) + 1) < 0)
10341 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
10342 It must be NEGATE_EXPR. Then strip any more conversions. */
10343 offset
= TREE_OPERAND (offset
, 0);
10344 while (CONVERT_EXPR_P (offset
))
10345 offset
= TREE_OPERAND (offset
, 0);
10347 if (TREE_CODE (offset
) != NEGATE_EXPR
)
10350 offset
= TREE_OPERAND (offset
, 0);
10351 while (CONVERT_EXPR_P (offset
))
10352 offset
= TREE_OPERAND (offset
, 0);
10354 /* This must now be the address of EXP. */
10355 return TREE_CODE (offset
) == ADDR_EXPR
&& TREE_OPERAND (offset
, 0) == exp
;
10358 /* Return the tree node if an ARG corresponds to a string constant or zero
10359 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
10360 in bytes within the string that ARG is accessing. The type of the
10361 offset will be `sizetype'. */
10364 string_constant (tree arg
, tree
*ptr_offset
)
10366 tree array
, offset
, lower_bound
;
10369 if (TREE_CODE (arg
) == ADDR_EXPR
)
10371 if (TREE_CODE (TREE_OPERAND (arg
, 0)) == STRING_CST
)
10373 *ptr_offset
= size_zero_node
;
10374 return TREE_OPERAND (arg
, 0);
10376 else if (TREE_CODE (TREE_OPERAND (arg
, 0)) == VAR_DECL
)
10378 array
= TREE_OPERAND (arg
, 0);
10379 offset
= size_zero_node
;
10381 else if (TREE_CODE (TREE_OPERAND (arg
, 0)) == ARRAY_REF
)
10383 array
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
10384 offset
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 1);
10385 if (TREE_CODE (array
) != STRING_CST
10386 && TREE_CODE (array
) != VAR_DECL
)
10389 /* Check if the array has a nonzero lower bound. */
10390 lower_bound
= array_ref_low_bound (TREE_OPERAND (arg
, 0));
10391 if (!integer_zerop (lower_bound
))
10393 /* If the offset and base aren't both constants, return 0. */
10394 if (TREE_CODE (lower_bound
) != INTEGER_CST
)
10396 if (TREE_CODE (offset
) != INTEGER_CST
)
10398 /* Adjust offset by the lower bound. */
10399 offset
= size_diffop (fold_convert (sizetype
, offset
),
10400 fold_convert (sizetype
, lower_bound
));
10403 else if (TREE_CODE (TREE_OPERAND (arg
, 0)) == MEM_REF
)
10405 array
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
10406 offset
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 1);
10407 if (TREE_CODE (array
) != ADDR_EXPR
)
10409 array
= TREE_OPERAND (array
, 0);
10410 if (TREE_CODE (array
) != STRING_CST
10411 && TREE_CODE (array
) != VAR_DECL
)
10417 else if (TREE_CODE (arg
) == PLUS_EXPR
|| TREE_CODE (arg
) == POINTER_PLUS_EXPR
)
10419 tree arg0
= TREE_OPERAND (arg
, 0);
10420 tree arg1
= TREE_OPERAND (arg
, 1);
10425 if (TREE_CODE (arg0
) == ADDR_EXPR
10426 && (TREE_CODE (TREE_OPERAND (arg0
, 0)) == STRING_CST
10427 || TREE_CODE (TREE_OPERAND (arg0
, 0)) == VAR_DECL
))
10429 array
= TREE_OPERAND (arg0
, 0);
10432 else if (TREE_CODE (arg1
) == ADDR_EXPR
10433 && (TREE_CODE (TREE_OPERAND (arg1
, 0)) == STRING_CST
10434 || TREE_CODE (TREE_OPERAND (arg1
, 0)) == VAR_DECL
))
10436 array
= TREE_OPERAND (arg1
, 0);
10445 if (TREE_CODE (array
) == STRING_CST
)
10447 *ptr_offset
= fold_convert (sizetype
, offset
);
10450 else if (TREE_CODE (array
) == VAR_DECL
10451 || TREE_CODE (array
) == CONST_DECL
)
10455 /* Variables initialized to string literals can be handled too. */
10456 if (!const_value_known_p (array
)
10457 || !DECL_INITIAL (array
)
10458 || TREE_CODE (DECL_INITIAL (array
)) != STRING_CST
)
10461 /* Avoid const char foo[4] = "abcde"; */
10462 if (DECL_SIZE_UNIT (array
) == NULL_TREE
10463 || TREE_CODE (DECL_SIZE_UNIT (array
)) != INTEGER_CST
10464 || (length
= TREE_STRING_LENGTH (DECL_INITIAL (array
))) <= 0
10465 || compare_tree_int (DECL_SIZE_UNIT (array
), length
) < 0)
10468 /* If variable is bigger than the string literal, OFFSET must be constant
10469 and inside of the bounds of the string literal. */
10470 offset
= fold_convert (sizetype
, offset
);
10471 if (compare_tree_int (DECL_SIZE_UNIT (array
), length
) > 0
10472 && (! host_integerp (offset
, 1)
10473 || compare_tree_int (offset
, length
) >= 0))
10476 *ptr_offset
= offset
;
10477 return DECL_INITIAL (array
);
10483 /* Generate code to calculate OPS, and exploded expression
10484 using a store-flag instruction and return an rtx for the result.
10485 OPS reflects a comparison.
10487 If TARGET is nonzero, store the result there if convenient.
10489 Return zero if there is no suitable set-flag instruction
10490 available on this machine.
10492 Once expand_expr has been called on the arguments of the comparison,
10493 we are committed to doing the store flag, since it is not safe to
10494 re-evaluate the expression. We emit the store-flag insn by calling
10495 emit_store_flag, but only expand the arguments if we have a reason
10496 to believe that emit_store_flag will be successful. If we think that
10497 it will, but it isn't, we have to simulate the store-flag with a
10498 set/jump/set sequence. */
10501 do_store_flag (sepops ops
, rtx target
, enum machine_mode mode
)
10503 enum rtx_code code
;
10504 tree arg0
, arg1
, type
;
10506 enum machine_mode operand_mode
;
10509 rtx subtarget
= target
;
10510 location_t loc
= ops
->location
;
10515 /* Don't crash if the comparison was erroneous. */
10516 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
10519 type
= TREE_TYPE (arg0
);
10520 operand_mode
= TYPE_MODE (type
);
10521 unsignedp
= TYPE_UNSIGNED (type
);
10523 /* We won't bother with BLKmode store-flag operations because it would mean
10524 passing a lot of information to emit_store_flag. */
10525 if (operand_mode
== BLKmode
)
10528 /* We won't bother with store-flag operations involving function pointers
10529 when function pointers must be canonicalized before comparisons. */
10530 #ifdef HAVE_canonicalize_funcptr_for_compare
10531 if (HAVE_canonicalize_funcptr_for_compare
10532 && ((TREE_CODE (TREE_TYPE (arg0
)) == POINTER_TYPE
10533 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
)))
10535 || (TREE_CODE (TREE_TYPE (arg1
)) == POINTER_TYPE
10536 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1
)))
10537 == FUNCTION_TYPE
))))
10544 /* For vector typed comparisons emit code to generate the desired
10545 all-ones or all-zeros mask. Conveniently use the VEC_COND_EXPR
10546 expander for this. */
10547 if (TREE_CODE (ops
->type
) == VECTOR_TYPE
)
10549 tree ifexp
= build2 (ops
->code
, ops
->type
, arg0
, arg1
);
10550 tree if_true
= constant_boolean_node (true, ops
->type
);
10551 tree if_false
= constant_boolean_node (false, ops
->type
);
10552 return expand_vec_cond_expr (ops
->type
, ifexp
, if_true
, if_false
, target
);
10555 /* For vector typed comparisons emit code to generate the desired
10556 all-ones or all-zeros mask. Conveniently use the VEC_COND_EXPR
10557 expander for this. */
10558 if (TREE_CODE (ops
->type
) == VECTOR_TYPE
)
10560 tree ifexp
= build2 (ops
->code
, ops
->type
, arg0
, arg1
);
10561 tree if_true
= constant_boolean_node (true, ops
->type
);
10562 tree if_false
= constant_boolean_node (false, ops
->type
);
10563 return expand_vec_cond_expr (ops
->type
, ifexp
, if_true
, if_false
, target
);
10566 /* Get the rtx comparison code to use. We know that EXP is a comparison
10567 operation of some type. Some comparisons against 1 and -1 can be
10568 converted to comparisons with zero. Do so here so that the tests
10569 below will be aware that we have a comparison with zero. These
10570 tests will not catch constants in the first operand, but constants
10571 are rarely passed as the first operand. */
10582 if (integer_onep (arg1
))
10583 arg1
= integer_zero_node
, code
= unsignedp
? LEU
: LE
;
10585 code
= unsignedp
? LTU
: LT
;
10588 if (! unsignedp
&& integer_all_onesp (arg1
))
10589 arg1
= integer_zero_node
, code
= LT
;
10591 code
= unsignedp
? LEU
: LE
;
10594 if (! unsignedp
&& integer_all_onesp (arg1
))
10595 arg1
= integer_zero_node
, code
= GE
;
10597 code
= unsignedp
? GTU
: GT
;
10600 if (integer_onep (arg1
))
10601 arg1
= integer_zero_node
, code
= unsignedp
? GTU
: GT
;
10603 code
= unsignedp
? GEU
: GE
;
10606 case UNORDERED_EXPR
:
10632 gcc_unreachable ();
10635 /* Put a constant second. */
10636 if (TREE_CODE (arg0
) == REAL_CST
|| TREE_CODE (arg0
) == INTEGER_CST
10637 || TREE_CODE (arg0
) == FIXED_CST
)
10639 tem
= arg0
; arg0
= arg1
; arg1
= tem
;
10640 code
= swap_condition (code
);
10643 /* If this is an equality or inequality test of a single bit, we can
10644 do this by shifting the bit being tested to the low-order bit and
10645 masking the result with the constant 1. If the condition was EQ,
10646 we xor it with 1. This does not require an scc insn and is faster
10647 than an scc insn even if we have it.
10649 The code to make this transformation was moved into fold_single_bit_test,
10650 so we just call into the folder and expand its result. */
10652 if ((code
== NE
|| code
== EQ
)
10653 && integer_zerop (arg1
)
10654 && (TYPE_PRECISION (ops
->type
) != 1 || TYPE_UNSIGNED (ops
->type
)))
10656 gimple srcstmt
= get_def_for_expr (arg0
, BIT_AND_EXPR
);
10658 && integer_pow2p (gimple_assign_rhs2 (srcstmt
)))
10660 enum tree_code tcode
= code
== NE
? NE_EXPR
: EQ_EXPR
;
10661 tree type
= lang_hooks
.types
.type_for_mode (mode
, unsignedp
);
10662 tree temp
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg1
),
10663 gimple_assign_rhs1 (srcstmt
),
10664 gimple_assign_rhs2 (srcstmt
));
10665 temp
= fold_single_bit_test (loc
, tcode
, temp
, arg1
, type
);
10667 return expand_expr (temp
, target
, VOIDmode
, EXPAND_NORMAL
);
10671 if (! get_subtarget (target
)
10672 || GET_MODE (subtarget
) != operand_mode
)
10675 expand_operands (arg0
, arg1
, subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
10678 target
= gen_reg_rtx (mode
);
10680 /* Try a cstore if possible. */
10681 return emit_store_flag_force (target
, code
, op0
, op1
,
10682 operand_mode
, unsignedp
,
10683 (TYPE_PRECISION (ops
->type
) == 1
10684 && !TYPE_UNSIGNED (ops
->type
)) ? -1 : 1);
10688 /* Stubs in case we haven't got a casesi insn. */
10689 #ifndef HAVE_casesi
10690 # define HAVE_casesi 0
10691 # define gen_casesi(a, b, c, d, e) (0)
10692 # define CODE_FOR_casesi CODE_FOR_nothing
10695 /* Attempt to generate a casesi instruction. Returns 1 if successful,
10696 0 otherwise (i.e. if there is no casesi instruction). */
10698 try_casesi (tree index_type
, tree index_expr
, tree minval
, tree range
,
10699 rtx table_label ATTRIBUTE_UNUSED
, rtx default_label
,
10700 rtx fallback_label ATTRIBUTE_UNUSED
)
10702 struct expand_operand ops
[5];
10703 enum machine_mode index_mode
= SImode
;
10704 rtx op1
, op2
, index
;
10709 /* Convert the index to SImode. */
10710 if (GET_MODE_BITSIZE (TYPE_MODE (index_type
)) > GET_MODE_BITSIZE (index_mode
))
10712 enum machine_mode omode
= TYPE_MODE (index_type
);
10713 rtx rangertx
= expand_normal (range
);
10715 /* We must handle the endpoints in the original mode. */
10716 index_expr
= build2 (MINUS_EXPR
, index_type
,
10717 index_expr
, minval
);
10718 minval
= integer_zero_node
;
10719 index
= expand_normal (index_expr
);
10721 emit_cmp_and_jump_insns (rangertx
, index
, LTU
, NULL_RTX
,
10722 omode
, 1, default_label
);
10723 /* Now we can safely truncate. */
10724 index
= convert_to_mode (index_mode
, index
, 0);
10728 if (TYPE_MODE (index_type
) != index_mode
)
10730 index_type
= lang_hooks
.types
.type_for_mode (index_mode
, 0);
10731 index_expr
= fold_convert (index_type
, index_expr
);
10734 index
= expand_normal (index_expr
);
10737 do_pending_stack_adjust ();
10739 op1
= expand_normal (minval
);
10740 op2
= expand_normal (range
);
10742 create_input_operand (&ops
[0], index
, index_mode
);
10743 create_convert_operand_from_type (&ops
[1], op1
, TREE_TYPE (minval
));
10744 create_convert_operand_from_type (&ops
[2], op2
, TREE_TYPE (range
));
10745 create_fixed_operand (&ops
[3], table_label
);
10746 create_fixed_operand (&ops
[4], (default_label
10748 : fallback_label
));
10749 expand_jump_insn (CODE_FOR_casesi
, 5, ops
);
10753 /* Attempt to generate a tablejump instruction; same concept. */
10754 #ifndef HAVE_tablejump
10755 #define HAVE_tablejump 0
10756 #define gen_tablejump(x, y) (0)
10759 /* Subroutine of the next function.
10761 INDEX is the value being switched on, with the lowest value
10762 in the table already subtracted.
10763 MODE is its expected mode (needed if INDEX is constant).
10764 RANGE is the length of the jump table.
10765 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
10767 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
10768 index value is out of range. */
10771 do_tablejump (rtx index
, enum machine_mode mode
, rtx range
, rtx table_label
,
10776 if (INTVAL (range
) > cfun
->cfg
->max_jumptable_ents
)
10777 cfun
->cfg
->max_jumptable_ents
= INTVAL (range
);
10779 /* Do an unsigned comparison (in the proper mode) between the index
10780 expression and the value which represents the length of the range.
10781 Since we just finished subtracting the lower bound of the range
10782 from the index expression, this comparison allows us to simultaneously
10783 check that the original index expression value is both greater than
10784 or equal to the minimum value of the range and less than or equal to
10785 the maximum value of the range. */
10788 emit_cmp_and_jump_insns (index
, range
, GTU
, NULL_RTX
, mode
, 1,
10791 /* If index is in range, it must fit in Pmode.
10792 Convert to Pmode so we can index with it. */
10794 index
= convert_to_mode (Pmode
, index
, 1);
10796 /* Don't let a MEM slip through, because then INDEX that comes
10797 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
10798 and break_out_memory_refs will go to work on it and mess it up. */
10799 #ifdef PIC_CASE_VECTOR_ADDRESS
10800 if (flag_pic
&& !REG_P (index
))
10801 index
= copy_to_mode_reg (Pmode
, index
);
10804 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
10805 GET_MODE_SIZE, because this indicates how large insns are. The other
10806 uses should all be Pmode, because they are addresses. This code
10807 could fail if addresses and insns are not the same size. */
10808 index
= gen_rtx_PLUS (Pmode
,
10809 gen_rtx_MULT (Pmode
, index
,
10810 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE
))),
10811 gen_rtx_LABEL_REF (Pmode
, table_label
));
10812 #ifdef PIC_CASE_VECTOR_ADDRESS
10814 index
= PIC_CASE_VECTOR_ADDRESS (index
);
10817 index
= memory_address (CASE_VECTOR_MODE
, index
);
10818 temp
= gen_reg_rtx (CASE_VECTOR_MODE
);
10819 vector
= gen_const_mem (CASE_VECTOR_MODE
, index
);
10820 convert_move (temp
, vector
, 0);
10822 emit_jump_insn (gen_tablejump (temp
, table_label
));
10824 /* If we are generating PIC code or if the table is PC-relative, the
10825 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
10826 if (! CASE_VECTOR_PC_RELATIVE
&& ! flag_pic
)
10831 try_tablejump (tree index_type
, tree index_expr
, tree minval
, tree range
,
10832 rtx table_label
, rtx default_label
)
10836 if (! HAVE_tablejump
)
10839 index_expr
= fold_build2 (MINUS_EXPR
, index_type
,
10840 fold_convert (index_type
, index_expr
),
10841 fold_convert (index_type
, minval
));
10842 index
= expand_normal (index_expr
);
10843 do_pending_stack_adjust ();
10845 do_tablejump (index
, TYPE_MODE (index_type
),
10846 convert_modes (TYPE_MODE (index_type
),
10847 TYPE_MODE (TREE_TYPE (range
)),
10848 expand_normal (range
),
10849 TYPE_UNSIGNED (TREE_TYPE (range
))),
10850 table_label
, default_label
);
10854 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
10856 const_vector_from_tree (tree exp
)
10862 enum machine_mode inner
, mode
;
10864 mode
= TYPE_MODE (TREE_TYPE (exp
));
10866 if (initializer_zerop (exp
))
10867 return CONST0_RTX (mode
);
10869 units
= GET_MODE_NUNITS (mode
);
10870 inner
= GET_MODE_INNER (mode
);
10872 v
= rtvec_alloc (units
);
10874 for (i
= 0; i
< VECTOR_CST_NELTS (exp
); ++i
)
10876 elt
= VECTOR_CST_ELT (exp
, i
);
10878 if (TREE_CODE (elt
) == REAL_CST
)
10879 RTVEC_ELT (v
, i
) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt
),
10881 else if (TREE_CODE (elt
) == FIXED_CST
)
10882 RTVEC_ELT (v
, i
) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt
),
10885 RTVEC_ELT (v
, i
) = immed_double_int_const (tree_to_double_int (elt
),
10889 return gen_rtx_CONST_VECTOR (mode
, v
);
10892 /* Build a decl for a personality function given a language prefix. */
10895 build_personality_function (const char *lang
)
10897 const char *unwind_and_version
;
10901 switch (targetm_common
.except_unwind_info (&global_options
))
10906 unwind_and_version
= "_sj0";
10910 unwind_and_version
= "_v0";
10913 gcc_unreachable ();
10916 name
= ACONCAT (("__", lang
, "_personality", unwind_and_version
, NULL
));
10918 type
= build_function_type_list (integer_type_node
, integer_type_node
,
10919 long_long_unsigned_type_node
,
10920 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10921 decl
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
,
10922 get_identifier (name
), type
);
10923 DECL_ARTIFICIAL (decl
) = 1;
10924 DECL_EXTERNAL (decl
) = 1;
10925 TREE_PUBLIC (decl
) = 1;
10927 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
10928 are the flags assigned by targetm.encode_section_info. */
10929 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl
), 0), NULL
);
10934 /* Extracts the personality function of DECL and returns the corresponding
10938 get_personality_function (tree decl
)
10940 tree personality
= DECL_FUNCTION_PERSONALITY (decl
);
10941 enum eh_personality_kind pk
;
10943 pk
= function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl
));
10944 if (pk
== eh_personality_none
)
10948 && pk
== eh_personality_any
)
10949 personality
= lang_hooks
.eh_personality ();
10951 if (pk
== eh_personality_lang
)
10952 gcc_assert (personality
!= NULL_TREE
);
10954 return XEXP (DECL_RTL (personality
), 0);
10957 #include "gt-expr.h"