1 /* Convert tree expression to rtl instructions, for GNU compiler.
2 Copyright (C) 1988-2014 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
22 #include "coretypes.h"
27 #include "stringpool.h"
28 #include "stor-layout.h"
33 #include "hard-reg-set.h"
36 #include "insn-config.h"
37 #include "insn-attr.h"
38 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
44 #include "typeclass.h"
46 #include "langhooks.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-ssa-alias.h"
52 #include "internal-fn.h"
53 #include "gimple-expr.h"
56 #include "gimple-ssa.h"
58 #include "tree-ssanames.h"
60 #include "common/common-target.h"
63 #include "diagnostic.h"
64 #include "tree-ssa-live.h"
65 #include "tree-outof-ssa.h"
66 #include "target-globals.h"
68 #include "tree-ssa-address.h"
69 #include "cfgexpand.h"
71 /* Decide whether a function's arguments should be processed
72 from first to last or from last to first.
74 They should if the stack and args grow in opposite directions, but
75 only if we have push insns. */
79 #ifndef PUSH_ARGS_REVERSED
80 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
81 #define PUSH_ARGS_REVERSED /* If it's last to first. */
87 #ifndef STACK_PUSH_CODE
88 #ifdef STACK_GROWS_DOWNWARD
89 #define STACK_PUSH_CODE PRE_DEC
91 #define STACK_PUSH_CODE PRE_INC
96 /* If this is nonzero, we do not bother generating VOLATILE
97 around volatile memory references, and we are willing to
98 output indirect addresses. If cse is to follow, we reject
99 indirect addresses so a useful potential cse is generated;
100 if it is used only once, instruction combination will produce
101 the same indirect address eventually. */
102 int cse_not_expected
;
104 /* This structure is used by move_by_pieces to describe the move to
106 struct move_by_pieces_d
115 int explicit_inc_from
;
116 unsigned HOST_WIDE_INT len
;
117 HOST_WIDE_INT offset
;
121 /* This structure is used by store_by_pieces to describe the clear to
124 struct store_by_pieces_d
130 unsigned HOST_WIDE_INT len
;
131 HOST_WIDE_INT offset
;
132 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
);
137 static void move_by_pieces_1 (insn_gen_fn
, machine_mode
,
138 struct move_by_pieces_d
*);
139 static bool block_move_libcall_safe_for_call_parm (void);
140 static bool emit_block_move_via_movmem (rtx
, rtx
, rtx
, unsigned, unsigned, HOST_WIDE_INT
,
141 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
,
142 unsigned HOST_WIDE_INT
);
143 static tree
emit_block_move_libcall_fn (int);
144 static void emit_block_move_via_loop (rtx
, rtx
, rtx
, unsigned);
145 static rtx
clear_by_pieces_1 (void *, HOST_WIDE_INT
, enum machine_mode
);
146 static void clear_by_pieces (rtx
, unsigned HOST_WIDE_INT
, unsigned int);
147 static void store_by_pieces_1 (struct store_by_pieces_d
*, unsigned int);
148 static void store_by_pieces_2 (insn_gen_fn
, machine_mode
,
149 struct store_by_pieces_d
*);
150 static tree
clear_storage_libcall_fn (int);
151 static rtx
compress_float_constant (rtx
, rtx
);
152 static rtx
get_subtarget (rtx
);
153 static void store_constructor_field (rtx
, unsigned HOST_WIDE_INT
,
154 HOST_WIDE_INT
, enum machine_mode
,
155 tree
, int, alias_set_type
);
156 static void store_constructor (tree
, rtx
, int, HOST_WIDE_INT
);
157 static rtx
store_field (rtx
, HOST_WIDE_INT
, HOST_WIDE_INT
,
158 unsigned HOST_WIDE_INT
, unsigned HOST_WIDE_INT
,
159 enum machine_mode
, tree
, alias_set_type
, bool);
161 static unsigned HOST_WIDE_INT
highest_pow2_factor_for_target (const_tree
, const_tree
);
163 static int is_aligning_offset (const_tree
, const_tree
);
164 static void expand_operands (tree
, tree
, rtx
, rtx
*, rtx
*,
165 enum expand_modifier
);
166 static rtx
reduce_to_bit_field_precision (rtx
, rtx
, tree
);
167 static rtx
do_store_flag (sepops
, rtx
, enum machine_mode
);
169 static void emit_single_push_insn (enum machine_mode
, rtx
, tree
);
171 static void do_tablejump (rtx
, enum machine_mode
, rtx
, rtx
, rtx
, int);
172 static rtx
const_vector_from_tree (tree
);
173 static void write_complex_part (rtx
, rtx
, bool);
175 /* This macro is used to determine whether move_by_pieces should be called
176 to perform a structure copy. */
177 #ifndef MOVE_BY_PIECES_P
178 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
179 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
180 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
183 /* This macro is used to determine whether clear_by_pieces should be
184 called to clear storage. */
185 #ifndef CLEAR_BY_PIECES_P
186 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
187 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
188 < (unsigned int) CLEAR_RATIO (optimize_insn_for_speed_p ()))
191 /* This macro is used to determine whether store_by_pieces should be
192 called to "memset" storage with byte values other than zero. */
193 #ifndef SET_BY_PIECES_P
194 #define SET_BY_PIECES_P(SIZE, ALIGN) \
195 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
196 < (unsigned int) SET_RATIO (optimize_insn_for_speed_p ()))
199 /* This macro is used to determine whether store_by_pieces should be
200 called to "memcpy" storage when the source is a constant string. */
201 #ifndef STORE_BY_PIECES_P
202 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
203 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
204 < (unsigned int) MOVE_RATIO (optimize_insn_for_speed_p ()))
207 /* This is run to set up which modes can be used
208 directly in memory and to initialize the block move optab. It is run
209 at the beginning of compilation and when the target is reinitialized. */
212 init_expr_target (void)
215 enum machine_mode mode
;
220 /* Try indexing by frame ptr and try by stack ptr.
221 It is known that on the Convex the stack ptr isn't a valid index.
222 With luck, one or the other is valid on any machine. */
223 mem
= gen_rtx_MEM (VOIDmode
, stack_pointer_rtx
);
224 mem1
= gen_rtx_MEM (VOIDmode
, frame_pointer_rtx
);
226 /* A scratch register we can modify in-place below to avoid
227 useless RTL allocations. */
228 reg
= gen_rtx_REG (VOIDmode
, -1);
230 insn
= rtx_alloc (INSN
);
231 pat
= gen_rtx_SET (VOIDmode
, NULL_RTX
, NULL_RTX
);
232 PATTERN (insn
) = pat
;
234 for (mode
= VOIDmode
; (int) mode
< NUM_MACHINE_MODES
;
235 mode
= (enum machine_mode
) ((int) mode
+ 1))
239 direct_load
[(int) mode
] = direct_store
[(int) mode
] = 0;
240 PUT_MODE (mem
, mode
);
241 PUT_MODE (mem1
, mode
);
242 PUT_MODE (reg
, mode
);
244 /* See if there is some register that can be used in this mode and
245 directly loaded or stored from memory. */
247 if (mode
!= VOIDmode
&& mode
!= BLKmode
)
248 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
249 && (direct_load
[(int) mode
] == 0 || direct_store
[(int) mode
] == 0);
252 if (! HARD_REGNO_MODE_OK (regno
, mode
))
255 SET_REGNO (reg
, regno
);
258 SET_DEST (pat
) = reg
;
259 if (recog (pat
, insn
, &num_clobbers
) >= 0)
260 direct_load
[(int) mode
] = 1;
262 SET_SRC (pat
) = mem1
;
263 SET_DEST (pat
) = reg
;
264 if (recog (pat
, insn
, &num_clobbers
) >= 0)
265 direct_load
[(int) mode
] = 1;
268 SET_DEST (pat
) = mem
;
269 if (recog (pat
, insn
, &num_clobbers
) >= 0)
270 direct_store
[(int) mode
] = 1;
273 SET_DEST (pat
) = mem1
;
274 if (recog (pat
, insn
, &num_clobbers
) >= 0)
275 direct_store
[(int) mode
] = 1;
279 mem
= gen_rtx_MEM (VOIDmode
, gen_rtx_raw_REG (Pmode
, 10000));
281 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
282 mode
= GET_MODE_WIDER_MODE (mode
))
284 enum machine_mode srcmode
;
285 for (srcmode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); srcmode
!= mode
;
286 srcmode
= GET_MODE_WIDER_MODE (srcmode
))
290 ic
= can_extend_p (mode
, srcmode
, 0);
291 if (ic
== CODE_FOR_nothing
)
294 PUT_MODE (mem
, srcmode
);
296 if (insn_operand_matches (ic
, 1, mem
))
297 float_extend_from_mem
[mode
][srcmode
] = true;
302 /* This is run at the start of compiling a function. */
307 memset (&crtl
->expr
, 0, sizeof (crtl
->expr
));
310 /* Copy data from FROM to TO, where the machine modes are not the same.
311 Both modes may be integer, or both may be floating, or both may be
313 UNSIGNEDP should be nonzero if FROM is an unsigned type.
314 This causes zero-extension instead of sign-extension. */
317 convert_move (rtx to
, rtx from
, int unsignedp
)
319 enum machine_mode to_mode
= GET_MODE (to
);
320 enum machine_mode from_mode
= GET_MODE (from
);
321 int to_real
= SCALAR_FLOAT_MODE_P (to_mode
);
322 int from_real
= SCALAR_FLOAT_MODE_P (from_mode
);
326 /* rtx code for making an equivalent value. */
327 enum rtx_code equiv_code
= (unsignedp
< 0 ? UNKNOWN
328 : (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
));
331 gcc_assert (to_real
== from_real
);
332 gcc_assert (to_mode
!= BLKmode
);
333 gcc_assert (from_mode
!= BLKmode
);
335 /* If the source and destination are already the same, then there's
340 /* If FROM is a SUBREG that indicates that we have already done at least
341 the required extension, strip it. We don't handle such SUBREGs as
344 if (GET_CODE (from
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (from
)
345 && (GET_MODE_PRECISION (GET_MODE (SUBREG_REG (from
)))
346 >= GET_MODE_PRECISION (to_mode
))
347 && SUBREG_PROMOTED_UNSIGNED_P (from
) == unsignedp
)
348 from
= gen_lowpart (to_mode
, from
), from_mode
= to_mode
;
350 gcc_assert (GET_CODE (to
) != SUBREG
|| !SUBREG_PROMOTED_VAR_P (to
));
352 if (to_mode
== from_mode
353 || (from_mode
== VOIDmode
&& CONSTANT_P (from
)))
355 emit_move_insn (to
, from
);
359 if (VECTOR_MODE_P (to_mode
) || VECTOR_MODE_P (from_mode
))
361 gcc_assert (GET_MODE_BITSIZE (from_mode
) == GET_MODE_BITSIZE (to_mode
));
363 if (VECTOR_MODE_P (to_mode
))
364 from
= simplify_gen_subreg (to_mode
, from
, GET_MODE (from
), 0);
366 to
= simplify_gen_subreg (from_mode
, to
, GET_MODE (to
), 0);
368 emit_move_insn (to
, from
);
372 if (GET_CODE (to
) == CONCAT
&& GET_CODE (from
) == CONCAT
)
374 convert_move (XEXP (to
, 0), XEXP (from
, 0), unsignedp
);
375 convert_move (XEXP (to
, 1), XEXP (from
, 1), unsignedp
);
384 gcc_assert ((GET_MODE_PRECISION (from_mode
)
385 != GET_MODE_PRECISION (to_mode
))
386 || (DECIMAL_FLOAT_MODE_P (from_mode
)
387 != DECIMAL_FLOAT_MODE_P (to_mode
)));
389 if (GET_MODE_PRECISION (from_mode
) == GET_MODE_PRECISION (to_mode
))
390 /* Conversion between decimal float and binary float, same size. */
391 tab
= DECIMAL_FLOAT_MODE_P (from_mode
) ? trunc_optab
: sext_optab
;
392 else if (GET_MODE_PRECISION (from_mode
) < GET_MODE_PRECISION (to_mode
))
397 /* Try converting directly if the insn is supported. */
399 code
= convert_optab_handler (tab
, to_mode
, from_mode
);
400 if (code
!= CODE_FOR_nothing
)
402 emit_unop_insn (code
, to
, from
,
403 tab
== sext_optab
? FLOAT_EXTEND
: FLOAT_TRUNCATE
);
407 /* Otherwise use a libcall. */
408 libcall
= convert_optab_libfunc (tab
, to_mode
, from_mode
);
410 /* Is this conversion implemented yet? */
411 gcc_assert (libcall
);
414 value
= emit_library_call_value (libcall
, NULL_RTX
, LCT_CONST
, to_mode
,
416 insns
= get_insns ();
418 emit_libcall_block (insns
, to
, value
,
419 tab
== trunc_optab
? gen_rtx_FLOAT_TRUNCATE (to_mode
,
421 : gen_rtx_FLOAT_EXTEND (to_mode
, from
));
425 /* Handle pointer conversion. */ /* SPEE 900220. */
426 /* Targets are expected to provide conversion insns between PxImode and
427 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
428 if (GET_MODE_CLASS (to_mode
) == MODE_PARTIAL_INT
)
430 enum machine_mode full_mode
431 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode
), MODE_INT
);
433 gcc_assert (convert_optab_handler (trunc_optab
, to_mode
, full_mode
)
434 != CODE_FOR_nothing
);
436 if (full_mode
!= from_mode
)
437 from
= convert_to_mode (full_mode
, from
, unsignedp
);
438 emit_unop_insn (convert_optab_handler (trunc_optab
, to_mode
, full_mode
),
442 if (GET_MODE_CLASS (from_mode
) == MODE_PARTIAL_INT
)
445 enum machine_mode full_mode
446 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode
), MODE_INT
);
447 convert_optab ctab
= unsignedp
? zext_optab
: sext_optab
;
448 enum insn_code icode
;
450 icode
= convert_optab_handler (ctab
, full_mode
, from_mode
);
451 gcc_assert (icode
!= CODE_FOR_nothing
);
453 if (to_mode
== full_mode
)
455 emit_unop_insn (icode
, to
, from
, UNKNOWN
);
459 new_from
= gen_reg_rtx (full_mode
);
460 emit_unop_insn (icode
, new_from
, from
, UNKNOWN
);
462 /* else proceed to integer conversions below. */
463 from_mode
= full_mode
;
467 /* Make sure both are fixed-point modes or both are not. */
468 gcc_assert (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode
) ==
469 ALL_SCALAR_FIXED_POINT_MODE_P (to_mode
));
470 if (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode
))
472 /* If we widen from_mode to to_mode and they are in the same class,
473 we won't saturate the result.
474 Otherwise, always saturate the result to play safe. */
475 if (GET_MODE_CLASS (from_mode
) == GET_MODE_CLASS (to_mode
)
476 && GET_MODE_SIZE (from_mode
) < GET_MODE_SIZE (to_mode
))
477 expand_fixed_convert (to
, from
, 0, 0);
479 expand_fixed_convert (to
, from
, 0, 1);
483 /* Now both modes are integers. */
485 /* Handle expanding beyond a word. */
486 if (GET_MODE_PRECISION (from_mode
) < GET_MODE_PRECISION (to_mode
)
487 && GET_MODE_PRECISION (to_mode
) > BITS_PER_WORD
)
494 enum machine_mode lowpart_mode
;
495 int nwords
= CEIL (GET_MODE_SIZE (to_mode
), UNITS_PER_WORD
);
497 /* Try converting directly if the insn is supported. */
498 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
501 /* If FROM is a SUBREG, put it into a register. Do this
502 so that we always generate the same set of insns for
503 better cse'ing; if an intermediate assignment occurred,
504 we won't be doing the operation directly on the SUBREG. */
505 if (optimize
> 0 && GET_CODE (from
) == SUBREG
)
506 from
= force_reg (from_mode
, from
);
507 emit_unop_insn (code
, to
, from
, equiv_code
);
510 /* Next, try converting via full word. */
511 else if (GET_MODE_PRECISION (from_mode
) < BITS_PER_WORD
512 && ((code
= can_extend_p (to_mode
, word_mode
, unsignedp
))
513 != CODE_FOR_nothing
))
515 rtx word_to
= gen_reg_rtx (word_mode
);
518 if (reg_overlap_mentioned_p (to
, from
))
519 from
= force_reg (from_mode
, from
);
522 convert_move (word_to
, from
, unsignedp
);
523 emit_unop_insn (code
, to
, word_to
, equiv_code
);
527 /* No special multiword conversion insn; do it by hand. */
530 /* Since we will turn this into a no conflict block, we must ensure the
531 the source does not overlap the target so force it into an isolated
532 register when maybe so. Likewise for any MEM input, since the
533 conversion sequence might require several references to it and we
534 must ensure we're getting the same value every time. */
536 if (MEM_P (from
) || reg_overlap_mentioned_p (to
, from
))
537 from
= force_reg (from_mode
, from
);
539 /* Get a copy of FROM widened to a word, if necessary. */
540 if (GET_MODE_PRECISION (from_mode
) < BITS_PER_WORD
)
541 lowpart_mode
= word_mode
;
543 lowpart_mode
= from_mode
;
545 lowfrom
= convert_to_mode (lowpart_mode
, from
, unsignedp
);
547 lowpart
= gen_lowpart (lowpart_mode
, to
);
548 emit_move_insn (lowpart
, lowfrom
);
550 /* Compute the value to put in each remaining word. */
552 fill_value
= const0_rtx
;
554 fill_value
= emit_store_flag_force (gen_reg_rtx (word_mode
),
555 LT
, lowfrom
, const0_rtx
,
556 lowpart_mode
, 0, -1);
558 /* Fill the remaining words. */
559 for (i
= GET_MODE_SIZE (lowpart_mode
) / UNITS_PER_WORD
; i
< nwords
; i
++)
561 int index
= (WORDS_BIG_ENDIAN
? nwords
- i
- 1 : i
);
562 rtx subword
= operand_subword (to
, index
, 1, to_mode
);
564 gcc_assert (subword
);
566 if (fill_value
!= subword
)
567 emit_move_insn (subword
, fill_value
);
570 insns
= get_insns ();
577 /* Truncating multi-word to a word or less. */
578 if (GET_MODE_PRECISION (from_mode
) > BITS_PER_WORD
579 && GET_MODE_PRECISION (to_mode
) <= BITS_PER_WORD
)
582 && ! MEM_VOLATILE_P (from
)
583 && direct_load
[(int) to_mode
]
584 && ! mode_dependent_address_p (XEXP (from
, 0),
585 MEM_ADDR_SPACE (from
)))
587 || GET_CODE (from
) == SUBREG
))
588 from
= force_reg (from_mode
, from
);
589 convert_move (to
, gen_lowpart (word_mode
, from
), 0);
593 /* Now follow all the conversions between integers
594 no more than a word long. */
596 /* For truncation, usually we can just refer to FROM in a narrower mode. */
597 if (GET_MODE_BITSIZE (to_mode
) < GET_MODE_BITSIZE (from_mode
)
598 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode
, from_mode
))
601 && ! MEM_VOLATILE_P (from
)
602 && direct_load
[(int) to_mode
]
603 && ! mode_dependent_address_p (XEXP (from
, 0),
604 MEM_ADDR_SPACE (from
)))
606 || GET_CODE (from
) == SUBREG
))
607 from
= force_reg (from_mode
, from
);
608 if (REG_P (from
) && REGNO (from
) < FIRST_PSEUDO_REGISTER
609 && ! HARD_REGNO_MODE_OK (REGNO (from
), to_mode
))
610 from
= copy_to_reg (from
);
611 emit_move_insn (to
, gen_lowpart (to_mode
, from
));
615 /* Handle extension. */
616 if (GET_MODE_PRECISION (to_mode
) > GET_MODE_PRECISION (from_mode
))
618 /* Convert directly if that works. */
619 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
622 emit_unop_insn (code
, to
, from
, equiv_code
);
627 enum machine_mode intermediate
;
631 /* Search for a mode to convert via. */
632 for (intermediate
= from_mode
; intermediate
!= VOIDmode
;
633 intermediate
= GET_MODE_WIDER_MODE (intermediate
))
634 if (((can_extend_p (to_mode
, intermediate
, unsignedp
)
636 || (GET_MODE_SIZE (to_mode
) < GET_MODE_SIZE (intermediate
)
637 && TRULY_NOOP_TRUNCATION_MODES_P (to_mode
, intermediate
)))
638 && (can_extend_p (intermediate
, from_mode
, unsignedp
)
639 != CODE_FOR_nothing
))
641 convert_move (to
, convert_to_mode (intermediate
, from
,
642 unsignedp
), unsignedp
);
646 /* No suitable intermediate mode.
647 Generate what we need with shifts. */
648 shift_amount
= (GET_MODE_PRECISION (to_mode
)
649 - GET_MODE_PRECISION (from_mode
));
650 from
= gen_lowpart (to_mode
, force_reg (from_mode
, from
));
651 tmp
= expand_shift (LSHIFT_EXPR
, to_mode
, from
, shift_amount
,
653 tmp
= expand_shift (RSHIFT_EXPR
, to_mode
, tmp
, shift_amount
,
656 emit_move_insn (to
, tmp
);
661 /* Support special truncate insns for certain modes. */
662 if (convert_optab_handler (trunc_optab
, to_mode
,
663 from_mode
) != CODE_FOR_nothing
)
665 emit_unop_insn (convert_optab_handler (trunc_optab
, to_mode
, from_mode
),
670 /* Handle truncation of volatile memrefs, and so on;
671 the things that couldn't be truncated directly,
672 and for which there was no special instruction.
674 ??? Code above formerly short-circuited this, for most integer
675 mode pairs, with a force_reg in from_mode followed by a recursive
676 call to this routine. Appears always to have been wrong. */
677 if (GET_MODE_PRECISION (to_mode
) < GET_MODE_PRECISION (from_mode
))
679 rtx temp
= force_reg (to_mode
, gen_lowpart (to_mode
, from
));
680 emit_move_insn (to
, temp
);
684 /* Mode combination is not recognized. */
688 /* Return an rtx for a value that would result
689 from converting X to mode MODE.
690 Both X and MODE may be floating, or both integer.
691 UNSIGNEDP is nonzero if X is an unsigned value.
692 This can be done by referring to a part of X in place
693 or by copying to a new temporary with conversion. */
696 convert_to_mode (enum machine_mode mode
, rtx x
, int unsignedp
)
698 return convert_modes (mode
, VOIDmode
, x
, unsignedp
);
701 /* Return an rtx for a value that would result
702 from converting X from mode OLDMODE to mode MODE.
703 Both modes may be floating, or both integer.
704 UNSIGNEDP is nonzero if X is an unsigned value.
706 This can be done by referring to a part of X in place
707 or by copying to a new temporary with conversion.
709 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
712 convert_modes (enum machine_mode mode
, enum machine_mode oldmode
, rtx x
, int unsignedp
)
716 /* If FROM is a SUBREG that indicates that we have already done at least
717 the required extension, strip it. */
719 if (GET_CODE (x
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (x
)
720 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
))) >= GET_MODE_SIZE (mode
)
721 && SUBREG_PROMOTED_UNSIGNED_P (x
) == unsignedp
)
722 x
= gen_lowpart (mode
, SUBREG_REG (x
));
724 if (GET_MODE (x
) != VOIDmode
)
725 oldmode
= GET_MODE (x
);
730 /* There is one case that we must handle specially: If we are converting
731 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
732 we are to interpret the constant as unsigned, gen_lowpart will do
733 the wrong if the constant appears negative. What we want to do is
734 make the high-order word of the constant zero, not all ones. */
736 if (unsignedp
&& GET_MODE_CLASS (mode
) == MODE_INT
737 && GET_MODE_BITSIZE (mode
) == HOST_BITS_PER_DOUBLE_INT
738 && CONST_INT_P (x
) && INTVAL (x
) < 0)
740 double_int val
= double_int::from_uhwi (INTVAL (x
));
742 /* We need to zero extend VAL. */
743 if (oldmode
!= VOIDmode
)
744 val
= val
.zext (GET_MODE_BITSIZE (oldmode
));
746 return immed_double_int_const (val
, mode
);
749 /* We can do this with a gen_lowpart if both desired and current modes
750 are integer, and this is either a constant integer, a register, or a
751 non-volatile MEM. Except for the constant case where MODE is no
752 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
755 && GET_MODE_PRECISION (mode
) <= HOST_BITS_PER_WIDE_INT
)
756 || (GET_MODE_CLASS (mode
) == MODE_INT
757 && GET_MODE_CLASS (oldmode
) == MODE_INT
758 && (CONST_DOUBLE_AS_INT_P (x
)
759 || (GET_MODE_PRECISION (mode
) <= GET_MODE_PRECISION (oldmode
)
760 && ((MEM_P (x
) && ! MEM_VOLATILE_P (x
)
761 && direct_load
[(int) mode
])
763 && (! HARD_REGISTER_P (x
)
764 || HARD_REGNO_MODE_OK (REGNO (x
), mode
))
765 && TRULY_NOOP_TRUNCATION_MODES_P (mode
,
768 /* ?? If we don't know OLDMODE, we have to assume here that
769 X does not need sign- or zero-extension. This may not be
770 the case, but it's the best we can do. */
771 if (CONST_INT_P (x
) && oldmode
!= VOIDmode
772 && GET_MODE_PRECISION (mode
) > GET_MODE_PRECISION (oldmode
))
774 HOST_WIDE_INT val
= INTVAL (x
);
776 /* We must sign or zero-extend in this case. Start by
777 zero-extending, then sign extend if we need to. */
778 val
&= GET_MODE_MASK (oldmode
);
780 && val_signbit_known_set_p (oldmode
, val
))
781 val
|= ~GET_MODE_MASK (oldmode
);
783 return gen_int_mode (val
, mode
);
786 return gen_lowpart (mode
, x
);
789 /* Converting from integer constant into mode is always equivalent to an
791 if (VECTOR_MODE_P (mode
) && GET_MODE (x
) == VOIDmode
)
793 gcc_assert (GET_MODE_BITSIZE (mode
) == GET_MODE_BITSIZE (oldmode
));
794 return simplify_gen_subreg (mode
, x
, oldmode
, 0);
797 temp
= gen_reg_rtx (mode
);
798 convert_move (temp
, x
, unsignedp
);
802 /* Return the largest alignment we can use for doing a move (or store)
803 of MAX_PIECES. ALIGN is the largest alignment we could use. */
806 alignment_for_piecewise_move (unsigned int max_pieces
, unsigned int align
)
808 enum machine_mode tmode
;
810 tmode
= mode_for_size (max_pieces
* BITS_PER_UNIT
, MODE_INT
, 1);
811 if (align
>= GET_MODE_ALIGNMENT (tmode
))
812 align
= GET_MODE_ALIGNMENT (tmode
);
815 enum machine_mode tmode
, xmode
;
817 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
), xmode
= tmode
;
819 xmode
= tmode
, tmode
= GET_MODE_WIDER_MODE (tmode
))
820 if (GET_MODE_SIZE (tmode
) > max_pieces
821 || SLOW_UNALIGNED_ACCESS (tmode
, align
))
824 align
= MAX (align
, GET_MODE_ALIGNMENT (xmode
));
830 /* Return the widest integer mode no wider than SIZE. If no such mode
831 can be found, return VOIDmode. */
833 static enum machine_mode
834 widest_int_mode_for_size (unsigned int size
)
836 enum machine_mode tmode
, mode
= VOIDmode
;
838 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
839 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
840 if (GET_MODE_SIZE (tmode
) < size
)
846 /* STORE_MAX_PIECES is the number of bytes at a time that we can
847 store efficiently. Due to internal GCC limitations, this is
848 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
849 for an immediate constant. */
851 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
853 /* Determine whether the LEN bytes can be moved by using several move
854 instructions. Return nonzero if a call to move_by_pieces should
858 can_move_by_pieces (unsigned HOST_WIDE_INT len ATTRIBUTE_UNUSED
,
859 unsigned int align ATTRIBUTE_UNUSED
)
861 return MOVE_BY_PIECES_P (len
, align
);
864 /* Generate several move instructions to copy LEN bytes from block FROM to
865 block TO. (These are MEM rtx's with BLKmode).
867 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
868 used to push FROM to the stack.
870 ALIGN is maximum stack alignment we can assume.
872 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
873 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
877 move_by_pieces (rtx to
, rtx from
, unsigned HOST_WIDE_INT len
,
878 unsigned int align
, int endp
)
880 struct move_by_pieces_d data
;
881 enum machine_mode to_addr_mode
;
882 enum machine_mode from_addr_mode
= get_address_mode (from
);
883 rtx to_addr
, from_addr
= XEXP (from
, 0);
884 unsigned int max_size
= MOVE_MAX_PIECES
+ 1;
885 enum insn_code icode
;
887 align
= MIN (to
? MEM_ALIGN (to
) : align
, MEM_ALIGN (from
));
890 data
.from_addr
= from_addr
;
893 to_addr_mode
= get_address_mode (to
);
894 to_addr
= XEXP (to
, 0);
897 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
898 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
900 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
904 to_addr_mode
= VOIDmode
;
908 #ifdef STACK_GROWS_DOWNWARD
914 data
.to_addr
= to_addr
;
917 = (GET_CODE (from_addr
) == PRE_INC
|| GET_CODE (from_addr
) == PRE_DEC
918 || GET_CODE (from_addr
) == POST_INC
919 || GET_CODE (from_addr
) == POST_DEC
);
921 data
.explicit_inc_from
= 0;
922 data
.explicit_inc_to
= 0;
923 if (data
.reverse
) data
.offset
= len
;
926 /* If copying requires more than two move insns,
927 copy addresses to registers (to make displacements shorter)
928 and use post-increment if available. */
929 if (!(data
.autinc_from
&& data
.autinc_to
)
930 && move_by_pieces_ninsns (len
, align
, max_size
) > 2)
932 /* Find the mode of the largest move...
933 MODE might not be used depending on the definitions of the
934 USE_* macros below. */
935 enum machine_mode mode ATTRIBUTE_UNUSED
936 = widest_int_mode_for_size (max_size
);
938 if (USE_LOAD_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_from
)
940 data
.from_addr
= copy_to_mode_reg (from_addr_mode
,
941 plus_constant (from_addr_mode
,
943 data
.autinc_from
= 1;
944 data
.explicit_inc_from
= -1;
946 if (USE_LOAD_POST_INCREMENT (mode
) && ! data
.autinc_from
)
948 data
.from_addr
= copy_to_mode_reg (from_addr_mode
, from_addr
);
949 data
.autinc_from
= 1;
950 data
.explicit_inc_from
= 1;
952 if (!data
.autinc_from
&& CONSTANT_P (from_addr
))
953 data
.from_addr
= copy_to_mode_reg (from_addr_mode
, from_addr
);
954 if (USE_STORE_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_to
)
956 data
.to_addr
= copy_to_mode_reg (to_addr_mode
,
957 plus_constant (to_addr_mode
,
960 data
.explicit_inc_to
= -1;
962 if (USE_STORE_POST_INCREMENT (mode
) && ! data
.reverse
&& ! data
.autinc_to
)
964 data
.to_addr
= copy_to_mode_reg (to_addr_mode
, to_addr
);
966 data
.explicit_inc_to
= 1;
968 if (!data
.autinc_to
&& CONSTANT_P (to_addr
))
969 data
.to_addr
= copy_to_mode_reg (to_addr_mode
, to_addr
);
972 align
= alignment_for_piecewise_move (MOVE_MAX_PIECES
, align
);
974 /* First move what we can in the largest integer mode, then go to
975 successively smaller modes. */
977 while (max_size
> 1 && data
.len
> 0)
979 enum machine_mode mode
= widest_int_mode_for_size (max_size
);
981 if (mode
== VOIDmode
)
984 icode
= optab_handler (mov_optab
, mode
);
985 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
986 move_by_pieces_1 (GEN_FCN (icode
), mode
, &data
);
988 max_size
= GET_MODE_SIZE (mode
);
991 /* The code above should have handled everything. */
992 gcc_assert (!data
.len
);
998 gcc_assert (!data
.reverse
);
1003 if (HAVE_POST_INCREMENT
&& data
.explicit_inc_to
> 0)
1004 emit_insn (gen_add2_insn (data
.to_addr
, constm1_rtx
));
1006 data
.to_addr
= copy_to_mode_reg (to_addr_mode
,
1007 plus_constant (to_addr_mode
,
1011 to1
= adjust_automodify_address (data
.to
, QImode
, data
.to_addr
,
1018 to1
= adjust_address (data
.to
, QImode
, data
.offset
);
1026 /* Return number of insns required to move L bytes by pieces.
1027 ALIGN (in bits) is maximum alignment we can assume. */
1029 unsigned HOST_WIDE_INT
1030 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l
, unsigned int align
,
1031 unsigned int max_size
)
1033 unsigned HOST_WIDE_INT n_insns
= 0;
1035 align
= alignment_for_piecewise_move (MOVE_MAX_PIECES
, align
);
1037 while (max_size
> 1 && l
> 0)
1039 enum machine_mode mode
;
1040 enum insn_code icode
;
1042 mode
= widest_int_mode_for_size (max_size
);
1044 if (mode
== VOIDmode
)
1047 icode
= optab_handler (mov_optab
, mode
);
1048 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
1049 n_insns
+= l
/ GET_MODE_SIZE (mode
), l
%= GET_MODE_SIZE (mode
);
1051 max_size
= GET_MODE_SIZE (mode
);
1058 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1059 with move instructions for mode MODE. GENFUN is the gen_... function
1060 to make a move insn for that mode. DATA has all the other info. */
1063 move_by_pieces_1 (insn_gen_fn genfun
, machine_mode mode
,
1064 struct move_by_pieces_d
*data
)
1066 unsigned int size
= GET_MODE_SIZE (mode
);
1067 rtx to1
= NULL_RTX
, from1
;
1069 while (data
->len
>= size
)
1072 data
->offset
-= size
;
1076 if (data
->autinc_to
)
1077 to1
= adjust_automodify_address (data
->to
, mode
, data
->to_addr
,
1080 to1
= adjust_address (data
->to
, mode
, data
->offset
);
1083 if (data
->autinc_from
)
1084 from1
= adjust_automodify_address (data
->from
, mode
, data
->from_addr
,
1087 from1
= adjust_address (data
->from
, mode
, data
->offset
);
1089 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
1090 emit_insn (gen_add2_insn (data
->to_addr
,
1091 gen_int_mode (-(HOST_WIDE_INT
) size
,
1092 GET_MODE (data
->to_addr
))));
1093 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_from
< 0)
1094 emit_insn (gen_add2_insn (data
->from_addr
,
1095 gen_int_mode (-(HOST_WIDE_INT
) size
,
1096 GET_MODE (data
->from_addr
))));
1099 emit_insn ((*genfun
) (to1
, from1
));
1102 #ifdef PUSH_ROUNDING
1103 emit_single_push_insn (mode
, from1
, NULL
);
1109 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
1110 emit_insn (gen_add2_insn (data
->to_addr
,
1112 GET_MODE (data
->to_addr
))));
1113 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_from
> 0)
1114 emit_insn (gen_add2_insn (data
->from_addr
,
1116 GET_MODE (data
->from_addr
))));
1118 if (! data
->reverse
)
1119 data
->offset
+= size
;
1125 /* Emit code to move a block Y to a block X. This may be done with
1126 string-move instructions, with multiple scalar move instructions,
1127 or with a library call.
1129 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1130 SIZE is an rtx that says how long they are.
1131 ALIGN is the maximum alignment we can assume they have.
1132 METHOD describes what kind of copy this is, and what mechanisms may be used.
1133 MIN_SIZE is the minimal size of block to move
1134 MAX_SIZE is the maximal size of block to move, if it can not be represented
1135 in unsigned HOST_WIDE_INT, than it is mask of all ones.
1137 Return the address of the new block, if memcpy is called and returns it,
1141 emit_block_move_hints (rtx x
, rtx y
, rtx size
, enum block_op_methods method
,
1142 unsigned int expected_align
, HOST_WIDE_INT expected_size
,
1143 unsigned HOST_WIDE_INT min_size
,
1144 unsigned HOST_WIDE_INT max_size
,
1145 unsigned HOST_WIDE_INT probable_max_size
)
1152 if (CONST_INT_P (size
)
1153 && INTVAL (size
) == 0)
1158 case BLOCK_OP_NORMAL
:
1159 case BLOCK_OP_TAILCALL
:
1160 may_use_call
= true;
1163 case BLOCK_OP_CALL_PARM
:
1164 may_use_call
= block_move_libcall_safe_for_call_parm ();
1166 /* Make inhibit_defer_pop nonzero around the library call
1167 to force it to pop the arguments right away. */
1171 case BLOCK_OP_NO_LIBCALL
:
1172 may_use_call
= false;
1179 gcc_assert (MEM_P (x
) && MEM_P (y
));
1180 align
= MIN (MEM_ALIGN (x
), MEM_ALIGN (y
));
1181 gcc_assert (align
>= BITS_PER_UNIT
);
1183 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1184 block copy is more efficient for other large modes, e.g. DCmode. */
1185 x
= adjust_address (x
, BLKmode
, 0);
1186 y
= adjust_address (y
, BLKmode
, 0);
1188 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1189 can be incorrect is coming from __builtin_memcpy. */
1190 if (CONST_INT_P (size
))
1192 x
= shallow_copy_rtx (x
);
1193 y
= shallow_copy_rtx (y
);
1194 set_mem_size (x
, INTVAL (size
));
1195 set_mem_size (y
, INTVAL (size
));
1198 if (CONST_INT_P (size
) && MOVE_BY_PIECES_P (INTVAL (size
), align
))
1199 move_by_pieces (x
, y
, INTVAL (size
), align
, 0);
1200 else if (emit_block_move_via_movmem (x
, y
, size
, align
,
1201 expected_align
, expected_size
,
1202 min_size
, max_size
, probable_max_size
))
1204 else if (may_use_call
1205 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (x
))
1206 && ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (y
)))
1208 /* Since x and y are passed to a libcall, mark the corresponding
1209 tree EXPR as addressable. */
1210 tree y_expr
= MEM_EXPR (y
);
1211 tree x_expr
= MEM_EXPR (x
);
1213 mark_addressable (y_expr
);
1215 mark_addressable (x_expr
);
1216 retval
= emit_block_move_via_libcall (x
, y
, size
,
1217 method
== BLOCK_OP_TAILCALL
);
1221 emit_block_move_via_loop (x
, y
, size
, align
);
1223 if (method
== BLOCK_OP_CALL_PARM
)
1230 emit_block_move (rtx x
, rtx y
, rtx size
, enum block_op_methods method
)
1232 unsigned HOST_WIDE_INT max
, min
= 0;
1233 if (GET_CODE (size
) == CONST_INT
)
1234 min
= max
= UINTVAL (size
);
1236 max
= GET_MODE_MASK (GET_MODE (size
));
1237 return emit_block_move_hints (x
, y
, size
, method
, 0, -1,
1241 /* A subroutine of emit_block_move. Returns true if calling the
1242 block move libcall will not clobber any parameters which may have
1243 already been placed on the stack. */
1246 block_move_libcall_safe_for_call_parm (void)
1248 #if defined (REG_PARM_STACK_SPACE)
1252 /* If arguments are pushed on the stack, then they're safe. */
1256 /* If registers go on the stack anyway, any argument is sure to clobber
1257 an outgoing argument. */
1258 #if defined (REG_PARM_STACK_SPACE)
1259 fn
= emit_block_move_libcall_fn (false);
1260 /* Avoid set but not used warning if *REG_PARM_STACK_SPACE doesn't
1261 depend on its argument. */
1263 if (OUTGOING_REG_PARM_STACK_SPACE ((!fn
? NULL_TREE
: TREE_TYPE (fn
)))
1264 && REG_PARM_STACK_SPACE (fn
) != 0)
1268 /* If any argument goes in memory, then it might clobber an outgoing
1271 CUMULATIVE_ARGS args_so_far_v
;
1272 cumulative_args_t args_so_far
;
1275 fn
= emit_block_move_libcall_fn (false);
1276 INIT_CUMULATIVE_ARGS (args_so_far_v
, TREE_TYPE (fn
), NULL_RTX
, 0, 3);
1277 args_so_far
= pack_cumulative_args (&args_so_far_v
);
1279 arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1280 for ( ; arg
!= void_list_node
; arg
= TREE_CHAIN (arg
))
1282 enum machine_mode mode
= TYPE_MODE (TREE_VALUE (arg
));
1283 rtx tmp
= targetm
.calls
.function_arg (args_so_far
, mode
,
1285 if (!tmp
|| !REG_P (tmp
))
1287 if (targetm
.calls
.arg_partial_bytes (args_so_far
, mode
, NULL
, 1))
1289 targetm
.calls
.function_arg_advance (args_so_far
, mode
,
1296 /* A subroutine of emit_block_move. Expand a movmem pattern;
1297 return true if successful. */
1300 emit_block_move_via_movmem (rtx x
, rtx y
, rtx size
, unsigned int align
,
1301 unsigned int expected_align
, HOST_WIDE_INT expected_size
,
1302 unsigned HOST_WIDE_INT min_size
,
1303 unsigned HOST_WIDE_INT max_size
,
1304 unsigned HOST_WIDE_INT probable_max_size
)
1306 int save_volatile_ok
= volatile_ok
;
1307 enum machine_mode mode
;
1309 if (expected_align
< align
)
1310 expected_align
= align
;
1311 if (expected_size
!= -1)
1313 if ((unsigned HOST_WIDE_INT
)expected_size
> probable_max_size
)
1314 expected_size
= probable_max_size
;
1315 if ((unsigned HOST_WIDE_INT
)expected_size
< min_size
)
1316 expected_size
= min_size
;
1319 /* Since this is a move insn, we don't care about volatility. */
1322 /* Try the most limited insn first, because there's no point
1323 including more than one in the machine description unless
1324 the more limited one has some advantage. */
1326 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
1327 mode
= GET_MODE_WIDER_MODE (mode
))
1329 enum insn_code code
= direct_optab_handler (movmem_optab
, mode
);
1331 if (code
!= CODE_FOR_nothing
1332 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1333 here because if SIZE is less than the mode mask, as it is
1334 returned by the macro, it will definitely be less than the
1335 actual mode mask. Since SIZE is within the Pmode address
1336 space, we limit MODE to Pmode. */
1337 && ((CONST_INT_P (size
)
1338 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
1339 <= (GET_MODE_MASK (mode
) >> 1)))
1340 || max_size
<= (GET_MODE_MASK (mode
) >> 1)
1341 || GET_MODE_BITSIZE (mode
) >= GET_MODE_BITSIZE (Pmode
)))
1343 struct expand_operand ops
[9];
1346 /* ??? When called via emit_block_move_for_call, it'd be
1347 nice if there were some way to inform the backend, so
1348 that it doesn't fail the expansion because it thinks
1349 emitting the libcall would be more efficient. */
1350 nops
= insn_data
[(int) code
].n_generator_args
;
1351 gcc_assert (nops
== 4 || nops
== 6 || nops
== 8 || nops
== 9);
1353 create_fixed_operand (&ops
[0], x
);
1354 create_fixed_operand (&ops
[1], y
);
1355 /* The check above guarantees that this size conversion is valid. */
1356 create_convert_operand_to (&ops
[2], size
, mode
, true);
1357 create_integer_operand (&ops
[3], align
/ BITS_PER_UNIT
);
1360 create_integer_operand (&ops
[4], expected_align
/ BITS_PER_UNIT
);
1361 create_integer_operand (&ops
[5], expected_size
);
1365 create_integer_operand (&ops
[6], min_size
);
1366 /* If we can not represent the maximal size,
1367 make parameter NULL. */
1368 if ((HOST_WIDE_INT
) max_size
!= -1)
1369 create_integer_operand (&ops
[7], max_size
);
1371 create_fixed_operand (&ops
[7], NULL
);
1375 /* If we can not represent the maximal size,
1376 make parameter NULL. */
1377 if ((HOST_WIDE_INT
) probable_max_size
!= -1)
1378 create_integer_operand (&ops
[8], probable_max_size
);
1380 create_fixed_operand (&ops
[8], NULL
);
1382 if (maybe_expand_insn (code
, nops
, ops
))
1384 volatile_ok
= save_volatile_ok
;
1390 volatile_ok
= save_volatile_ok
;
1394 /* A subroutine of emit_block_move. Expand a call to memcpy.
1395 Return the return value from memcpy, 0 otherwise. */
1398 emit_block_move_via_libcall (rtx dst
, rtx src
, rtx size
, bool tailcall
)
1400 rtx dst_addr
, src_addr
;
1401 tree call_expr
, fn
, src_tree
, dst_tree
, size_tree
;
1402 enum machine_mode size_mode
;
1405 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1406 pseudos. We can then place those new pseudos into a VAR_DECL and
1409 dst_addr
= copy_addr_to_reg (XEXP (dst
, 0));
1410 src_addr
= copy_addr_to_reg (XEXP (src
, 0));
1412 dst_addr
= convert_memory_address (ptr_mode
, dst_addr
);
1413 src_addr
= convert_memory_address (ptr_mode
, src_addr
);
1415 dst_tree
= make_tree (ptr_type_node
, dst_addr
);
1416 src_tree
= make_tree (ptr_type_node
, src_addr
);
1418 size_mode
= TYPE_MODE (sizetype
);
1420 size
= convert_to_mode (size_mode
, size
, 1);
1421 size
= copy_to_mode_reg (size_mode
, size
);
1423 /* It is incorrect to use the libcall calling conventions to call
1424 memcpy in this context. This could be a user call to memcpy and
1425 the user may wish to examine the return value from memcpy. For
1426 targets where libcalls and normal calls have different conventions
1427 for returning pointers, we could end up generating incorrect code. */
1429 size_tree
= make_tree (sizetype
, size
);
1431 fn
= emit_block_move_libcall_fn (true);
1432 call_expr
= build_call_expr (fn
, 3, dst_tree
, src_tree
, size_tree
);
1433 CALL_EXPR_TAILCALL (call_expr
) = tailcall
;
1435 retval
= expand_normal (call_expr
);
1440 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1441 for the function we use for block copies. */
1443 static GTY(()) tree block_move_fn
;
1446 init_block_move_fn (const char *asmspec
)
1450 tree args
, fn
, attrs
, attr_args
;
1452 fn
= get_identifier ("memcpy");
1453 args
= build_function_type_list (ptr_type_node
, ptr_type_node
,
1454 const_ptr_type_node
, sizetype
,
1457 fn
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, fn
, args
);
1458 DECL_EXTERNAL (fn
) = 1;
1459 TREE_PUBLIC (fn
) = 1;
1460 DECL_ARTIFICIAL (fn
) = 1;
1461 TREE_NOTHROW (fn
) = 1;
1462 DECL_VISIBILITY (fn
) = VISIBILITY_DEFAULT
;
1463 DECL_VISIBILITY_SPECIFIED (fn
) = 1;
1465 attr_args
= build_tree_list (NULL_TREE
, build_string (1, "1"));
1466 attrs
= tree_cons (get_identifier ("fn spec"), attr_args
, NULL
);
1468 decl_attributes (&fn
, attrs
, ATTR_FLAG_BUILT_IN
);
1474 set_user_assembler_name (block_move_fn
, asmspec
);
1478 emit_block_move_libcall_fn (int for_call
)
1480 static bool emitted_extern
;
1483 init_block_move_fn (NULL
);
1485 if (for_call
&& !emitted_extern
)
1487 emitted_extern
= true;
1488 make_decl_rtl (block_move_fn
);
1491 return block_move_fn
;
1494 /* A subroutine of emit_block_move. Copy the data via an explicit
1495 loop. This is used only when libcalls are forbidden. */
1496 /* ??? It'd be nice to copy in hunks larger than QImode. */
1499 emit_block_move_via_loop (rtx x
, rtx y
, rtx size
,
1500 unsigned int align ATTRIBUTE_UNUSED
)
1502 rtx cmp_label
, top_label
, iter
, x_addr
, y_addr
, tmp
;
1503 enum machine_mode x_addr_mode
= get_address_mode (x
);
1504 enum machine_mode y_addr_mode
= get_address_mode (y
);
1505 enum machine_mode iter_mode
;
1507 iter_mode
= GET_MODE (size
);
1508 if (iter_mode
== VOIDmode
)
1509 iter_mode
= word_mode
;
1511 top_label
= gen_label_rtx ();
1512 cmp_label
= gen_label_rtx ();
1513 iter
= gen_reg_rtx (iter_mode
);
1515 emit_move_insn (iter
, const0_rtx
);
1517 x_addr
= force_operand (XEXP (x
, 0), NULL_RTX
);
1518 y_addr
= force_operand (XEXP (y
, 0), NULL_RTX
);
1519 do_pending_stack_adjust ();
1521 emit_jump (cmp_label
);
1522 emit_label (top_label
);
1524 tmp
= convert_modes (x_addr_mode
, iter_mode
, iter
, true);
1525 x_addr
= simplify_gen_binary (PLUS
, x_addr_mode
, x_addr
, tmp
);
1527 if (x_addr_mode
!= y_addr_mode
)
1528 tmp
= convert_modes (y_addr_mode
, iter_mode
, iter
, true);
1529 y_addr
= simplify_gen_binary (PLUS
, y_addr_mode
, y_addr
, tmp
);
1531 x
= change_address (x
, QImode
, x_addr
);
1532 y
= change_address (y
, QImode
, y_addr
);
1534 emit_move_insn (x
, y
);
1536 tmp
= expand_simple_binop (iter_mode
, PLUS
, iter
, const1_rtx
, iter
,
1537 true, OPTAB_LIB_WIDEN
);
1539 emit_move_insn (iter
, tmp
);
1541 emit_label (cmp_label
);
1543 emit_cmp_and_jump_insns (iter
, size
, LT
, NULL_RTX
, iter_mode
,
1544 true, top_label
, REG_BR_PROB_BASE
* 90 / 100);
1547 /* Copy all or part of a value X into registers starting at REGNO.
1548 The number of registers to be filled is NREGS. */
1551 move_block_to_reg (int regno
, rtx x
, int nregs
, enum machine_mode mode
)
1554 #ifdef HAVE_load_multiple
1562 if (CONSTANT_P (x
) && !targetm
.legitimate_constant_p (mode
, x
))
1563 x
= validize_mem (force_const_mem (mode
, x
));
1565 /* See if the machine can do this with a load multiple insn. */
1566 #ifdef HAVE_load_multiple
1567 if (HAVE_load_multiple
)
1569 last
= get_last_insn ();
1570 pat
= gen_load_multiple (gen_rtx_REG (word_mode
, regno
), x
,
1578 delete_insns_since (last
);
1582 for (i
= 0; i
< nregs
; i
++)
1583 emit_move_insn (gen_rtx_REG (word_mode
, regno
+ i
),
1584 operand_subword_force (x
, i
, mode
));
1587 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1588 The number of registers to be filled is NREGS. */
1591 move_block_from_reg (int regno
, rtx x
, int nregs
)
1598 /* See if the machine can do this with a store multiple insn. */
1599 #ifdef HAVE_store_multiple
1600 if (HAVE_store_multiple
)
1602 rtx last
= get_last_insn ();
1603 rtx pat
= gen_store_multiple (x
, gen_rtx_REG (word_mode
, regno
),
1611 delete_insns_since (last
);
1615 for (i
= 0; i
< nregs
; i
++)
1617 rtx tem
= operand_subword (x
, i
, 1, BLKmode
);
1621 emit_move_insn (tem
, gen_rtx_REG (word_mode
, regno
+ i
));
1625 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1626 ORIG, where ORIG is a non-consecutive group of registers represented by
1627 a PARALLEL. The clone is identical to the original except in that the
1628 original set of registers is replaced by a new set of pseudo registers.
1629 The new set has the same modes as the original set. */
1632 gen_group_rtx (rtx orig
)
1637 gcc_assert (GET_CODE (orig
) == PARALLEL
);
1639 length
= XVECLEN (orig
, 0);
1640 tmps
= XALLOCAVEC (rtx
, length
);
1642 /* Skip a NULL entry in first slot. */
1643 i
= XEXP (XVECEXP (orig
, 0, 0), 0) ? 0 : 1;
1648 for (; i
< length
; i
++)
1650 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (orig
, 0, i
), 0));
1651 rtx offset
= XEXP (XVECEXP (orig
, 0, i
), 1);
1653 tmps
[i
] = gen_rtx_EXPR_LIST (VOIDmode
, gen_reg_rtx (mode
), offset
);
1656 return gen_rtx_PARALLEL (GET_MODE (orig
), gen_rtvec_v (length
, tmps
));
1659 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1660 except that values are placed in TMPS[i], and must later be moved
1661 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1664 emit_group_load_1 (rtx
*tmps
, rtx dst
, rtx orig_src
, tree type
, int ssize
)
1668 enum machine_mode m
= GET_MODE (orig_src
);
1670 gcc_assert (GET_CODE (dst
) == PARALLEL
);
1673 && !SCALAR_INT_MODE_P (m
)
1674 && !MEM_P (orig_src
)
1675 && GET_CODE (orig_src
) != CONCAT
)
1677 enum machine_mode imode
= int_mode_for_mode (GET_MODE (orig_src
));
1678 if (imode
== BLKmode
)
1679 src
= assign_stack_temp (GET_MODE (orig_src
), ssize
);
1681 src
= gen_reg_rtx (imode
);
1682 if (imode
!= BLKmode
)
1683 src
= gen_lowpart (GET_MODE (orig_src
), src
);
1684 emit_move_insn (src
, orig_src
);
1685 /* ...and back again. */
1686 if (imode
!= BLKmode
)
1687 src
= gen_lowpart (imode
, src
);
1688 emit_group_load_1 (tmps
, dst
, src
, type
, ssize
);
1692 /* Check for a NULL entry, used to indicate that the parameter goes
1693 both on the stack and in registers. */
1694 if (XEXP (XVECEXP (dst
, 0, 0), 0))
1699 /* Process the pieces. */
1700 for (i
= start
; i
< XVECLEN (dst
, 0); i
++)
1702 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (dst
, 0, i
), 0));
1703 HOST_WIDE_INT bytepos
= INTVAL (XEXP (XVECEXP (dst
, 0, i
), 1));
1704 unsigned int bytelen
= GET_MODE_SIZE (mode
);
1707 /* Handle trailing fragments that run over the size of the struct. */
1708 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
1710 /* Arrange to shift the fragment to where it belongs.
1711 extract_bit_field loads to the lsb of the reg. */
1713 #ifdef BLOCK_REG_PADDING
1714 BLOCK_REG_PADDING (GET_MODE (orig_src
), type
, i
== start
)
1715 == (BYTES_BIG_ENDIAN
? upward
: downward
)
1720 shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
1721 bytelen
= ssize
- bytepos
;
1722 gcc_assert (bytelen
> 0);
1725 /* If we won't be loading directly from memory, protect the real source
1726 from strange tricks we might play; but make sure that the source can
1727 be loaded directly into the destination. */
1729 if (!MEM_P (orig_src
)
1730 && (!CONSTANT_P (orig_src
)
1731 || (GET_MODE (orig_src
) != mode
1732 && GET_MODE (orig_src
) != VOIDmode
)))
1734 if (GET_MODE (orig_src
) == VOIDmode
)
1735 src
= gen_reg_rtx (mode
);
1737 src
= gen_reg_rtx (GET_MODE (orig_src
));
1739 emit_move_insn (src
, orig_src
);
1742 /* Optimize the access just a bit. */
1744 && (! SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (src
))
1745 || MEM_ALIGN (src
) >= GET_MODE_ALIGNMENT (mode
))
1746 && bytepos
* BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
1747 && bytelen
== GET_MODE_SIZE (mode
))
1749 tmps
[i
] = gen_reg_rtx (mode
);
1750 emit_move_insn (tmps
[i
], adjust_address (src
, mode
, bytepos
));
1752 else if (COMPLEX_MODE_P (mode
)
1753 && GET_MODE (src
) == mode
1754 && bytelen
== GET_MODE_SIZE (mode
))
1755 /* Let emit_move_complex do the bulk of the work. */
1757 else if (GET_CODE (src
) == CONCAT
)
1759 unsigned int slen
= GET_MODE_SIZE (GET_MODE (src
));
1760 unsigned int slen0
= GET_MODE_SIZE (GET_MODE (XEXP (src
, 0)));
1762 if ((bytepos
== 0 && bytelen
== slen0
)
1763 || (bytepos
!= 0 && bytepos
+ bytelen
<= slen
))
1765 /* The following assumes that the concatenated objects all
1766 have the same size. In this case, a simple calculation
1767 can be used to determine the object and the bit field
1769 tmps
[i
] = XEXP (src
, bytepos
/ slen0
);
1770 if (! CONSTANT_P (tmps
[i
])
1771 && (!REG_P (tmps
[i
]) || GET_MODE (tmps
[i
]) != mode
))
1772 tmps
[i
] = extract_bit_field (tmps
[i
], bytelen
* BITS_PER_UNIT
,
1773 (bytepos
% slen0
) * BITS_PER_UNIT
,
1774 1, NULL_RTX
, mode
, mode
);
1780 gcc_assert (!bytepos
);
1781 mem
= assign_stack_temp (GET_MODE (src
), slen
);
1782 emit_move_insn (mem
, src
);
1783 tmps
[i
] = extract_bit_field (mem
, bytelen
* BITS_PER_UNIT
,
1784 0, 1, NULL_RTX
, mode
, mode
);
1787 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1788 SIMD register, which is currently broken. While we get GCC
1789 to emit proper RTL for these cases, let's dump to memory. */
1790 else if (VECTOR_MODE_P (GET_MODE (dst
))
1793 int slen
= GET_MODE_SIZE (GET_MODE (src
));
1796 mem
= assign_stack_temp (GET_MODE (src
), slen
);
1797 emit_move_insn (mem
, src
);
1798 tmps
[i
] = adjust_address (mem
, mode
, (int) bytepos
);
1800 else if (CONSTANT_P (src
) && GET_MODE (dst
) != BLKmode
1801 && XVECLEN (dst
, 0) > 1)
1802 tmps
[i
] = simplify_gen_subreg (mode
, src
, GET_MODE (dst
), bytepos
);
1803 else if (CONSTANT_P (src
))
1805 HOST_WIDE_INT len
= (HOST_WIDE_INT
) bytelen
;
1813 gcc_assert (2 * len
== ssize
);
1814 split_double (src
, &first
, &second
);
1821 else if (REG_P (src
) && GET_MODE (src
) == mode
)
1824 tmps
[i
] = extract_bit_field (src
, bytelen
* BITS_PER_UNIT
,
1825 bytepos
* BITS_PER_UNIT
, 1, NULL_RTX
,
1829 tmps
[i
] = expand_shift (LSHIFT_EXPR
, mode
, tmps
[i
],
1834 /* Emit code to move a block SRC of type TYPE to a block DST,
1835 where DST is non-consecutive registers represented by a PARALLEL.
1836 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1840 emit_group_load (rtx dst
, rtx src
, tree type
, int ssize
)
1845 tmps
= XALLOCAVEC (rtx
, XVECLEN (dst
, 0));
1846 emit_group_load_1 (tmps
, dst
, src
, type
, ssize
);
1848 /* Copy the extracted pieces into the proper (probable) hard regs. */
1849 for (i
= 0; i
< XVECLEN (dst
, 0); i
++)
1851 rtx d
= XEXP (XVECEXP (dst
, 0, i
), 0);
1854 emit_move_insn (d
, tmps
[i
]);
1858 /* Similar, but load SRC into new pseudos in a format that looks like
1859 PARALLEL. This can later be fed to emit_group_move to get things
1860 in the right place. */
1863 emit_group_load_into_temps (rtx parallel
, rtx src
, tree type
, int ssize
)
1868 vec
= rtvec_alloc (XVECLEN (parallel
, 0));
1869 emit_group_load_1 (&RTVEC_ELT (vec
, 0), parallel
, src
, type
, ssize
);
1871 /* Convert the vector to look just like the original PARALLEL, except
1872 with the computed values. */
1873 for (i
= 0; i
< XVECLEN (parallel
, 0); i
++)
1875 rtx e
= XVECEXP (parallel
, 0, i
);
1876 rtx d
= XEXP (e
, 0);
1880 d
= force_reg (GET_MODE (d
), RTVEC_ELT (vec
, i
));
1881 e
= alloc_EXPR_LIST (REG_NOTE_KIND (e
), d
, XEXP (e
, 1));
1883 RTVEC_ELT (vec
, i
) = e
;
1886 return gen_rtx_PARALLEL (GET_MODE (parallel
), vec
);
1889 /* Emit code to move a block SRC to block DST, where SRC and DST are
1890 non-consecutive groups of registers, each represented by a PARALLEL. */
1893 emit_group_move (rtx dst
, rtx src
)
1897 gcc_assert (GET_CODE (src
) == PARALLEL
1898 && GET_CODE (dst
) == PARALLEL
1899 && XVECLEN (src
, 0) == XVECLEN (dst
, 0));
1901 /* Skip first entry if NULL. */
1902 for (i
= XEXP (XVECEXP (src
, 0, 0), 0) ? 0 : 1; i
< XVECLEN (src
, 0); i
++)
1903 emit_move_insn (XEXP (XVECEXP (dst
, 0, i
), 0),
1904 XEXP (XVECEXP (src
, 0, i
), 0));
1907 /* Move a group of registers represented by a PARALLEL into pseudos. */
1910 emit_group_move_into_temps (rtx src
)
1912 rtvec vec
= rtvec_alloc (XVECLEN (src
, 0));
1915 for (i
= 0; i
< XVECLEN (src
, 0); i
++)
1917 rtx e
= XVECEXP (src
, 0, i
);
1918 rtx d
= XEXP (e
, 0);
1921 e
= alloc_EXPR_LIST (REG_NOTE_KIND (e
), copy_to_reg (d
), XEXP (e
, 1));
1922 RTVEC_ELT (vec
, i
) = e
;
1925 return gen_rtx_PARALLEL (GET_MODE (src
), vec
);
1928 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1929 where SRC is non-consecutive registers represented by a PARALLEL.
1930 SSIZE represents the total size of block ORIG_DST, or -1 if not
1934 emit_group_store (rtx orig_dst
, rtx src
, tree type ATTRIBUTE_UNUSED
, int ssize
)
1937 int start
, finish
, i
;
1938 enum machine_mode m
= GET_MODE (orig_dst
);
1940 gcc_assert (GET_CODE (src
) == PARALLEL
);
1942 if (!SCALAR_INT_MODE_P (m
)
1943 && !MEM_P (orig_dst
) && GET_CODE (orig_dst
) != CONCAT
)
1945 enum machine_mode imode
= int_mode_for_mode (GET_MODE (orig_dst
));
1946 if (imode
== BLKmode
)
1947 dst
= assign_stack_temp (GET_MODE (orig_dst
), ssize
);
1949 dst
= gen_reg_rtx (imode
);
1950 emit_group_store (dst
, src
, type
, ssize
);
1951 if (imode
!= BLKmode
)
1952 dst
= gen_lowpart (GET_MODE (orig_dst
), dst
);
1953 emit_move_insn (orig_dst
, dst
);
1957 /* Check for a NULL entry, used to indicate that the parameter goes
1958 both on the stack and in registers. */
1959 if (XEXP (XVECEXP (src
, 0, 0), 0))
1963 finish
= XVECLEN (src
, 0);
1965 tmps
= XALLOCAVEC (rtx
, finish
);
1967 /* Copy the (probable) hard regs into pseudos. */
1968 for (i
= start
; i
< finish
; i
++)
1970 rtx reg
= XEXP (XVECEXP (src
, 0, i
), 0);
1971 if (!REG_P (reg
) || REGNO (reg
) < FIRST_PSEUDO_REGISTER
)
1973 tmps
[i
] = gen_reg_rtx (GET_MODE (reg
));
1974 emit_move_insn (tmps
[i
], reg
);
1980 /* If we won't be storing directly into memory, protect the real destination
1981 from strange tricks we might play. */
1983 if (GET_CODE (dst
) == PARALLEL
)
1987 /* We can get a PARALLEL dst if there is a conditional expression in
1988 a return statement. In that case, the dst and src are the same,
1989 so no action is necessary. */
1990 if (rtx_equal_p (dst
, src
))
1993 /* It is unclear if we can ever reach here, but we may as well handle
1994 it. Allocate a temporary, and split this into a store/load to/from
1996 temp
= assign_stack_temp (GET_MODE (dst
), ssize
);
1997 emit_group_store (temp
, src
, type
, ssize
);
1998 emit_group_load (dst
, temp
, type
, ssize
);
2001 else if (!MEM_P (dst
) && GET_CODE (dst
) != CONCAT
)
2003 enum machine_mode outer
= GET_MODE (dst
);
2004 enum machine_mode inner
;
2005 HOST_WIDE_INT bytepos
;
2009 if (!REG_P (dst
) || REGNO (dst
) < FIRST_PSEUDO_REGISTER
)
2010 dst
= gen_reg_rtx (outer
);
2012 /* Make life a bit easier for combine. */
2013 /* If the first element of the vector is the low part
2014 of the destination mode, use a paradoxical subreg to
2015 initialize the destination. */
2018 inner
= GET_MODE (tmps
[start
]);
2019 bytepos
= subreg_lowpart_offset (inner
, outer
);
2020 if (INTVAL (XEXP (XVECEXP (src
, 0, start
), 1)) == bytepos
)
2022 temp
= simplify_gen_subreg (outer
, tmps
[start
],
2026 emit_move_insn (dst
, temp
);
2033 /* If the first element wasn't the low part, try the last. */
2035 && start
< finish
- 1)
2037 inner
= GET_MODE (tmps
[finish
- 1]);
2038 bytepos
= subreg_lowpart_offset (inner
, outer
);
2039 if (INTVAL (XEXP (XVECEXP (src
, 0, finish
- 1), 1)) == bytepos
)
2041 temp
= simplify_gen_subreg (outer
, tmps
[finish
- 1],
2045 emit_move_insn (dst
, temp
);
2052 /* Otherwise, simply initialize the result to zero. */
2054 emit_move_insn (dst
, CONST0_RTX (outer
));
2057 /* Process the pieces. */
2058 for (i
= start
; i
< finish
; i
++)
2060 HOST_WIDE_INT bytepos
= INTVAL (XEXP (XVECEXP (src
, 0, i
), 1));
2061 enum machine_mode mode
= GET_MODE (tmps
[i
]);
2062 unsigned int bytelen
= GET_MODE_SIZE (mode
);
2063 unsigned int adj_bytelen
;
2066 /* Handle trailing fragments that run over the size of the struct. */
2067 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
2068 adj_bytelen
= ssize
- bytepos
;
2070 adj_bytelen
= bytelen
;
2072 if (GET_CODE (dst
) == CONCAT
)
2074 if (bytepos
+ adj_bytelen
2075 <= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0))))
2076 dest
= XEXP (dst
, 0);
2077 else if (bytepos
>= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0))))
2079 bytepos
-= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0)));
2080 dest
= XEXP (dst
, 1);
2084 enum machine_mode dest_mode
= GET_MODE (dest
);
2085 enum machine_mode tmp_mode
= GET_MODE (tmps
[i
]);
2087 gcc_assert (bytepos
== 0 && XVECLEN (src
, 0));
2089 if (GET_MODE_ALIGNMENT (dest_mode
)
2090 >= GET_MODE_ALIGNMENT (tmp_mode
))
2092 dest
= assign_stack_temp (dest_mode
,
2093 GET_MODE_SIZE (dest_mode
));
2094 emit_move_insn (adjust_address (dest
,
2102 dest
= assign_stack_temp (tmp_mode
,
2103 GET_MODE_SIZE (tmp_mode
));
2104 emit_move_insn (dest
, tmps
[i
]);
2105 dst
= adjust_address (dest
, dest_mode
, bytepos
);
2111 /* Handle trailing fragments that run over the size of the struct. */
2112 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
2114 /* store_bit_field always takes its value from the lsb.
2115 Move the fragment to the lsb if it's not already there. */
2117 #ifdef BLOCK_REG_PADDING
2118 BLOCK_REG_PADDING (GET_MODE (orig_dst
), type
, i
== start
)
2119 == (BYTES_BIG_ENDIAN
? upward
: downward
)
2125 int shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
2126 tmps
[i
] = expand_shift (RSHIFT_EXPR
, mode
, tmps
[i
],
2130 /* Make sure not to write past the end of the struct. */
2131 store_bit_field (dest
,
2132 adj_bytelen
* BITS_PER_UNIT
, bytepos
* BITS_PER_UNIT
,
2133 bytepos
* BITS_PER_UNIT
, ssize
* BITS_PER_UNIT
- 1,
2137 /* Optimize the access just a bit. */
2138 else if (MEM_P (dest
)
2139 && (!SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (dest
))
2140 || MEM_ALIGN (dest
) >= GET_MODE_ALIGNMENT (mode
))
2141 && bytepos
* BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
2142 && bytelen
== GET_MODE_SIZE (mode
))
2143 emit_move_insn (adjust_address (dest
, mode
, bytepos
), tmps
[i
]);
2146 store_bit_field (dest
, bytelen
* BITS_PER_UNIT
, bytepos
* BITS_PER_UNIT
,
2147 0, 0, mode
, tmps
[i
]);
2150 /* Copy from the pseudo into the (probable) hard reg. */
2151 if (orig_dst
!= dst
)
2152 emit_move_insn (orig_dst
, dst
);
2155 /* Return a form of X that does not use a PARALLEL. TYPE is the type
2156 of the value stored in X. */
2159 maybe_emit_group_store (rtx x
, tree type
)
2161 enum machine_mode mode
= TYPE_MODE (type
);
2162 gcc_checking_assert (GET_MODE (x
) == VOIDmode
|| GET_MODE (x
) == mode
);
2163 if (GET_CODE (x
) == PARALLEL
)
2165 rtx result
= gen_reg_rtx (mode
);
2166 emit_group_store (result
, x
, type
, int_size_in_bytes (type
));
2172 /* Copy a BLKmode object of TYPE out of a register SRCREG into TARGET.
2174 This is used on targets that return BLKmode values in registers. */
2177 copy_blkmode_from_reg (rtx target
, rtx srcreg
, tree type
)
2179 unsigned HOST_WIDE_INT bytes
= int_size_in_bytes (type
);
2180 rtx src
= NULL
, dst
= NULL
;
2181 unsigned HOST_WIDE_INT bitsize
= MIN (TYPE_ALIGN (type
), BITS_PER_WORD
);
2182 unsigned HOST_WIDE_INT bitpos
, xbitpos
, padding_correction
= 0;
2183 enum machine_mode mode
= GET_MODE (srcreg
);
2184 enum machine_mode tmode
= GET_MODE (target
);
2185 enum machine_mode copy_mode
;
2187 /* BLKmode registers created in the back-end shouldn't have survived. */
2188 gcc_assert (mode
!= BLKmode
);
2190 /* If the structure doesn't take up a whole number of words, see whether
2191 SRCREG is padded on the left or on the right. If it's on the left,
2192 set PADDING_CORRECTION to the number of bits to skip.
2194 In most ABIs, the structure will be returned at the least end of
2195 the register, which translates to right padding on little-endian
2196 targets and left padding on big-endian targets. The opposite
2197 holds if the structure is returned at the most significant
2198 end of the register. */
2199 if (bytes
% UNITS_PER_WORD
!= 0
2200 && (targetm
.calls
.return_in_msb (type
)
2202 : BYTES_BIG_ENDIAN
))
2204 = (BITS_PER_WORD
- ((bytes
% UNITS_PER_WORD
) * BITS_PER_UNIT
));
2206 /* We can use a single move if we have an exact mode for the size. */
2207 else if (MEM_P (target
)
2208 && (!SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (target
))
2209 || MEM_ALIGN (target
) >= GET_MODE_ALIGNMENT (mode
))
2210 && bytes
== GET_MODE_SIZE (mode
))
2212 emit_move_insn (adjust_address (target
, mode
, 0), srcreg
);
2216 /* And if we additionally have the same mode for a register. */
2217 else if (REG_P (target
)
2218 && GET_MODE (target
) == mode
2219 && bytes
== GET_MODE_SIZE (mode
))
2221 emit_move_insn (target
, srcreg
);
2225 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2226 into a new pseudo which is a full word. */
2227 if (GET_MODE_SIZE (mode
) < UNITS_PER_WORD
)
2229 srcreg
= convert_to_mode (word_mode
, srcreg
, TYPE_UNSIGNED (type
));
2233 /* Copy the structure BITSIZE bits at a time. If the target lives in
2234 memory, take care of not reading/writing past its end by selecting
2235 a copy mode suited to BITSIZE. This should always be possible given
2238 If the target lives in register, make sure not to select a copy mode
2239 larger than the mode of the register.
2241 We could probably emit more efficient code for machines which do not use
2242 strict alignment, but it doesn't seem worth the effort at the current
2245 copy_mode
= word_mode
;
2248 enum machine_mode mem_mode
= mode_for_size (bitsize
, MODE_INT
, 1);
2249 if (mem_mode
!= BLKmode
)
2250 copy_mode
= mem_mode
;
2252 else if (REG_P (target
) && GET_MODE_BITSIZE (tmode
) < BITS_PER_WORD
)
2255 for (bitpos
= 0, xbitpos
= padding_correction
;
2256 bitpos
< bytes
* BITS_PER_UNIT
;
2257 bitpos
+= bitsize
, xbitpos
+= bitsize
)
2259 /* We need a new source operand each time xbitpos is on a
2260 word boundary and when xbitpos == padding_correction
2261 (the first time through). */
2262 if (xbitpos
% BITS_PER_WORD
== 0 || xbitpos
== padding_correction
)
2263 src
= operand_subword_force (srcreg
, xbitpos
/ BITS_PER_WORD
, mode
);
2265 /* We need a new destination operand each time bitpos is on
2267 if (REG_P (target
) && GET_MODE_BITSIZE (tmode
) < BITS_PER_WORD
)
2269 else if (bitpos
% BITS_PER_WORD
== 0)
2270 dst
= operand_subword (target
, bitpos
/ BITS_PER_WORD
, 1, tmode
);
2272 /* Use xbitpos for the source extraction (right justified) and
2273 bitpos for the destination store (left justified). */
2274 store_bit_field (dst
, bitsize
, bitpos
% BITS_PER_WORD
, 0, 0, copy_mode
,
2275 extract_bit_field (src
, bitsize
,
2276 xbitpos
% BITS_PER_WORD
, 1,
2277 NULL_RTX
, copy_mode
, copy_mode
));
2281 /* Copy BLKmode value SRC into a register of mode MODE. Return the
2282 register if it contains any data, otherwise return null.
2284 This is used on targets that return BLKmode values in registers. */
2287 copy_blkmode_to_reg (enum machine_mode mode
, tree src
)
2290 unsigned HOST_WIDE_INT bitpos
, xbitpos
, padding_correction
= 0, bytes
;
2291 unsigned int bitsize
;
2292 rtx
*dst_words
, dst
, x
, src_word
= NULL_RTX
, dst_word
= NULL_RTX
;
2293 enum machine_mode dst_mode
;
2295 gcc_assert (TYPE_MODE (TREE_TYPE (src
)) == BLKmode
);
2297 x
= expand_normal (src
);
2299 bytes
= int_size_in_bytes (TREE_TYPE (src
));
2303 /* If the structure doesn't take up a whole number of words, see
2304 whether the register value should be padded on the left or on
2305 the right. Set PADDING_CORRECTION to the number of padding
2306 bits needed on the left side.
2308 In most ABIs, the structure will be returned at the least end of
2309 the register, which translates to right padding on little-endian
2310 targets and left padding on big-endian targets. The opposite
2311 holds if the structure is returned at the most significant
2312 end of the register. */
2313 if (bytes
% UNITS_PER_WORD
!= 0
2314 && (targetm
.calls
.return_in_msb (TREE_TYPE (src
))
2316 : BYTES_BIG_ENDIAN
))
2317 padding_correction
= (BITS_PER_WORD
- ((bytes
% UNITS_PER_WORD
)
2320 n_regs
= (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
2321 dst_words
= XALLOCAVEC (rtx
, n_regs
);
2322 bitsize
= MIN (TYPE_ALIGN (TREE_TYPE (src
)), BITS_PER_WORD
);
2324 /* Copy the structure BITSIZE bits at a time. */
2325 for (bitpos
= 0, xbitpos
= padding_correction
;
2326 bitpos
< bytes
* BITS_PER_UNIT
;
2327 bitpos
+= bitsize
, xbitpos
+= bitsize
)
2329 /* We need a new destination pseudo each time xbitpos is
2330 on a word boundary and when xbitpos == padding_correction
2331 (the first time through). */
2332 if (xbitpos
% BITS_PER_WORD
== 0
2333 || xbitpos
== padding_correction
)
2335 /* Generate an appropriate register. */
2336 dst_word
= gen_reg_rtx (word_mode
);
2337 dst_words
[xbitpos
/ BITS_PER_WORD
] = dst_word
;
2339 /* Clear the destination before we move anything into it. */
2340 emit_move_insn (dst_word
, CONST0_RTX (word_mode
));
2343 /* We need a new source operand each time bitpos is on a word
2345 if (bitpos
% BITS_PER_WORD
== 0)
2346 src_word
= operand_subword_force (x
, bitpos
/ BITS_PER_WORD
, BLKmode
);
2348 /* Use bitpos for the source extraction (left justified) and
2349 xbitpos for the destination store (right justified). */
2350 store_bit_field (dst_word
, bitsize
, xbitpos
% BITS_PER_WORD
,
2352 extract_bit_field (src_word
, bitsize
,
2353 bitpos
% BITS_PER_WORD
, 1,
2354 NULL_RTX
, word_mode
, word_mode
));
2357 if (mode
== BLKmode
)
2359 /* Find the smallest integer mode large enough to hold the
2360 entire structure. */
2361 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2363 mode
= GET_MODE_WIDER_MODE (mode
))
2364 /* Have we found a large enough mode? */
2365 if (GET_MODE_SIZE (mode
) >= bytes
)
2368 /* A suitable mode should have been found. */
2369 gcc_assert (mode
!= VOIDmode
);
2372 if (GET_MODE_SIZE (mode
) < GET_MODE_SIZE (word_mode
))
2373 dst_mode
= word_mode
;
2376 dst
= gen_reg_rtx (dst_mode
);
2378 for (i
= 0; i
< n_regs
; i
++)
2379 emit_move_insn (operand_subword (dst
, i
, 0, dst_mode
), dst_words
[i
]);
2381 if (mode
!= dst_mode
)
2382 dst
= gen_lowpart (mode
, dst
);
2387 /* Add a USE expression for REG to the (possibly empty) list pointed
2388 to by CALL_FUSAGE. REG must denote a hard register. */
2391 use_reg_mode (rtx
*call_fusage
, rtx reg
, enum machine_mode mode
)
2393 gcc_assert (REG_P (reg
) && REGNO (reg
) < FIRST_PSEUDO_REGISTER
);
2396 = gen_rtx_EXPR_LIST (mode
, gen_rtx_USE (VOIDmode
, reg
), *call_fusage
);
2399 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2400 starting at REGNO. All of these registers must be hard registers. */
2403 use_regs (rtx
*call_fusage
, int regno
, int nregs
)
2407 gcc_assert (regno
+ nregs
<= FIRST_PSEUDO_REGISTER
);
2409 for (i
= 0; i
< nregs
; i
++)
2410 use_reg (call_fusage
, regno_reg_rtx
[regno
+ i
]);
2413 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2414 PARALLEL REGS. This is for calls that pass values in multiple
2415 non-contiguous locations. The Irix 6 ABI has examples of this. */
2418 use_group_regs (rtx
*call_fusage
, rtx regs
)
2422 for (i
= 0; i
< XVECLEN (regs
, 0); i
++)
2424 rtx reg
= XEXP (XVECEXP (regs
, 0, i
), 0);
2426 /* A NULL entry means the parameter goes both on the stack and in
2427 registers. This can also be a MEM for targets that pass values
2428 partially on the stack and partially in registers. */
2429 if (reg
!= 0 && REG_P (reg
))
2430 use_reg (call_fusage
, reg
);
2434 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2435 assigment and the code of the expresion on the RHS is CODE. Return
2439 get_def_for_expr (tree name
, enum tree_code code
)
2443 if (TREE_CODE (name
) != SSA_NAME
)
2446 def_stmt
= get_gimple_for_ssa_name (name
);
2448 || gimple_assign_rhs_code (def_stmt
) != code
)
2454 #ifdef HAVE_conditional_move
2455 /* Return the defining gimple statement for SSA_NAME NAME if it is an
2456 assigment and the class of the expresion on the RHS is CLASS. Return
2460 get_def_for_expr_class (tree name
, enum tree_code_class tclass
)
2464 if (TREE_CODE (name
) != SSA_NAME
)
2467 def_stmt
= get_gimple_for_ssa_name (name
);
2469 || TREE_CODE_CLASS (gimple_assign_rhs_code (def_stmt
)) != tclass
)
2477 /* Determine whether the LEN bytes generated by CONSTFUN can be
2478 stored to memory using several move instructions. CONSTFUNDATA is
2479 a pointer which will be passed as argument in every CONSTFUN call.
2480 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2481 a memset operation and false if it's a copy of a constant string.
2482 Return nonzero if a call to store_by_pieces should succeed. */
2485 can_store_by_pieces (unsigned HOST_WIDE_INT len
,
2486 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
),
2487 void *constfundata
, unsigned int align
, bool memsetp
)
2489 unsigned HOST_WIDE_INT l
;
2490 unsigned int max_size
;
2491 HOST_WIDE_INT offset
= 0;
2492 enum machine_mode mode
;
2493 enum insn_code icode
;
2495 /* cst is set but not used if LEGITIMATE_CONSTANT doesn't use it. */
2496 rtx cst ATTRIBUTE_UNUSED
;
2502 ? SET_BY_PIECES_P (len
, align
)
2503 : STORE_BY_PIECES_P (len
, align
)))
2506 align
= alignment_for_piecewise_move (STORE_MAX_PIECES
, align
);
2508 /* We would first store what we can in the largest integer mode, then go to
2509 successively smaller modes. */
2512 reverse
<= (HAVE_PRE_DECREMENT
|| HAVE_POST_DECREMENT
);
2516 max_size
= STORE_MAX_PIECES
+ 1;
2517 while (max_size
> 1 && l
> 0)
2519 mode
= widest_int_mode_for_size (max_size
);
2521 if (mode
== VOIDmode
)
2524 icode
= optab_handler (mov_optab
, mode
);
2525 if (icode
!= CODE_FOR_nothing
2526 && align
>= GET_MODE_ALIGNMENT (mode
))
2528 unsigned int size
= GET_MODE_SIZE (mode
);
2535 cst
= (*constfun
) (constfundata
, offset
, mode
);
2536 if (!targetm
.legitimate_constant_p (mode
, cst
))
2546 max_size
= GET_MODE_SIZE (mode
);
2549 /* The code above should have handled everything. */
2556 /* Generate several move instructions to store LEN bytes generated by
2557 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2558 pointer which will be passed as argument in every CONSTFUN call.
2559 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2560 a memset operation and false if it's a copy of a constant string.
2561 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2562 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2566 store_by_pieces (rtx to
, unsigned HOST_WIDE_INT len
,
2567 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
),
2568 void *constfundata
, unsigned int align
, bool memsetp
, int endp
)
2570 enum machine_mode to_addr_mode
= get_address_mode (to
);
2571 struct store_by_pieces_d data
;
2575 gcc_assert (endp
!= 2);
2580 ? SET_BY_PIECES_P (len
, align
)
2581 : STORE_BY_PIECES_P (len
, align
));
2582 data
.constfun
= constfun
;
2583 data
.constfundata
= constfundata
;
2586 store_by_pieces_1 (&data
, align
);
2591 gcc_assert (!data
.reverse
);
2596 if (HAVE_POST_INCREMENT
&& data
.explicit_inc_to
> 0)
2597 emit_insn (gen_add2_insn (data
.to_addr
, constm1_rtx
));
2599 data
.to_addr
= copy_to_mode_reg (to_addr_mode
,
2600 plus_constant (to_addr_mode
,
2604 to1
= adjust_automodify_address (data
.to
, QImode
, data
.to_addr
,
2611 to1
= adjust_address (data
.to
, QImode
, data
.offset
);
2619 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2620 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2623 clear_by_pieces (rtx to
, unsigned HOST_WIDE_INT len
, unsigned int align
)
2625 struct store_by_pieces_d data
;
2630 data
.constfun
= clear_by_pieces_1
;
2631 data
.constfundata
= NULL
;
2634 store_by_pieces_1 (&data
, align
);
2637 /* Callback routine for clear_by_pieces.
2638 Return const0_rtx unconditionally. */
2641 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED
,
2642 HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
2643 enum machine_mode mode ATTRIBUTE_UNUSED
)
2648 /* Subroutine of clear_by_pieces and store_by_pieces.
2649 Generate several move instructions to store LEN bytes of block TO. (A MEM
2650 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2653 store_by_pieces_1 (struct store_by_pieces_d
*data ATTRIBUTE_UNUSED
,
2654 unsigned int align ATTRIBUTE_UNUSED
)
2656 enum machine_mode to_addr_mode
= get_address_mode (data
->to
);
2657 rtx to_addr
= XEXP (data
->to
, 0);
2658 unsigned int max_size
= STORE_MAX_PIECES
+ 1;
2659 enum insn_code icode
;
2662 data
->to_addr
= to_addr
;
2664 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
2665 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
2667 data
->explicit_inc_to
= 0;
2669 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
2671 data
->offset
= data
->len
;
2673 /* If storing requires more than two move insns,
2674 copy addresses to registers (to make displacements shorter)
2675 and use post-increment if available. */
2676 if (!data
->autinc_to
2677 && move_by_pieces_ninsns (data
->len
, align
, max_size
) > 2)
2679 /* Determine the main mode we'll be using.
2680 MODE might not be used depending on the definitions of the
2681 USE_* macros below. */
2682 enum machine_mode mode ATTRIBUTE_UNUSED
2683 = widest_int_mode_for_size (max_size
);
2685 if (USE_STORE_PRE_DECREMENT (mode
) && data
->reverse
&& ! data
->autinc_to
)
2687 data
->to_addr
= copy_to_mode_reg (to_addr_mode
,
2688 plus_constant (to_addr_mode
,
2691 data
->autinc_to
= 1;
2692 data
->explicit_inc_to
= -1;
2695 if (USE_STORE_POST_INCREMENT (mode
) && ! data
->reverse
2696 && ! data
->autinc_to
)
2698 data
->to_addr
= copy_to_mode_reg (to_addr_mode
, to_addr
);
2699 data
->autinc_to
= 1;
2700 data
->explicit_inc_to
= 1;
2703 if ( !data
->autinc_to
&& CONSTANT_P (to_addr
))
2704 data
->to_addr
= copy_to_mode_reg (to_addr_mode
, to_addr
);
2707 align
= alignment_for_piecewise_move (STORE_MAX_PIECES
, align
);
2709 /* First store what we can in the largest integer mode, then go to
2710 successively smaller modes. */
2712 while (max_size
> 1 && data
->len
> 0)
2714 enum machine_mode mode
= widest_int_mode_for_size (max_size
);
2716 if (mode
== VOIDmode
)
2719 icode
= optab_handler (mov_optab
, mode
);
2720 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
2721 store_by_pieces_2 (GEN_FCN (icode
), mode
, data
);
2723 max_size
= GET_MODE_SIZE (mode
);
2726 /* The code above should have handled everything. */
2727 gcc_assert (!data
->len
);
2730 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2731 with move instructions for mode MODE. GENFUN is the gen_... function
2732 to make a move insn for that mode. DATA has all the other info. */
2735 store_by_pieces_2 (insn_gen_fn genfun
, machine_mode mode
,
2736 struct store_by_pieces_d
*data
)
2738 unsigned int size
= GET_MODE_SIZE (mode
);
2741 while (data
->len
>= size
)
2744 data
->offset
-= size
;
2746 if (data
->autinc_to
)
2747 to1
= adjust_automodify_address (data
->to
, mode
, data
->to_addr
,
2750 to1
= adjust_address (data
->to
, mode
, data
->offset
);
2752 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
2753 emit_insn (gen_add2_insn (data
->to_addr
,
2754 gen_int_mode (-(HOST_WIDE_INT
) size
,
2755 GET_MODE (data
->to_addr
))));
2757 cst
= (*data
->constfun
) (data
->constfundata
, data
->offset
, mode
);
2758 emit_insn ((*genfun
) (to1
, cst
));
2760 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
2761 emit_insn (gen_add2_insn (data
->to_addr
,
2763 GET_MODE (data
->to_addr
))));
2765 if (! data
->reverse
)
2766 data
->offset
+= size
;
2772 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2773 its length in bytes. */
2776 clear_storage_hints (rtx object
, rtx size
, enum block_op_methods method
,
2777 unsigned int expected_align
, HOST_WIDE_INT expected_size
,
2778 unsigned HOST_WIDE_INT min_size
,
2779 unsigned HOST_WIDE_INT max_size
,
2780 unsigned HOST_WIDE_INT probable_max_size
)
2782 enum machine_mode mode
= GET_MODE (object
);
2785 gcc_assert (method
== BLOCK_OP_NORMAL
|| method
== BLOCK_OP_TAILCALL
);
2787 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2788 just move a zero. Otherwise, do this a piece at a time. */
2790 && CONST_INT_P (size
)
2791 && INTVAL (size
) == (HOST_WIDE_INT
) GET_MODE_SIZE (mode
))
2793 rtx zero
= CONST0_RTX (mode
);
2796 emit_move_insn (object
, zero
);
2800 if (COMPLEX_MODE_P (mode
))
2802 zero
= CONST0_RTX (GET_MODE_INNER (mode
));
2805 write_complex_part (object
, zero
, 0);
2806 write_complex_part (object
, zero
, 1);
2812 if (size
== const0_rtx
)
2815 align
= MEM_ALIGN (object
);
2817 if (CONST_INT_P (size
)
2818 && CLEAR_BY_PIECES_P (INTVAL (size
), align
))
2819 clear_by_pieces (object
, INTVAL (size
), align
);
2820 else if (set_storage_via_setmem (object
, size
, const0_rtx
, align
,
2821 expected_align
, expected_size
,
2822 min_size
, max_size
, probable_max_size
))
2824 else if (ADDR_SPACE_GENERIC_P (MEM_ADDR_SPACE (object
)))
2825 return set_storage_via_libcall (object
, size
, const0_rtx
,
2826 method
== BLOCK_OP_TAILCALL
);
2834 clear_storage (rtx object
, rtx size
, enum block_op_methods method
)
2836 unsigned HOST_WIDE_INT max
, min
= 0;
2837 if (GET_CODE (size
) == CONST_INT
)
2838 min
= max
= UINTVAL (size
);
2840 max
= GET_MODE_MASK (GET_MODE (size
));
2841 return clear_storage_hints (object
, size
, method
, 0, -1, min
, max
, max
);
2845 /* A subroutine of clear_storage. Expand a call to memset.
2846 Return the return value of memset, 0 otherwise. */
2849 set_storage_via_libcall (rtx object
, rtx size
, rtx val
, bool tailcall
)
2851 tree call_expr
, fn
, object_tree
, size_tree
, val_tree
;
2852 enum machine_mode size_mode
;
2855 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2856 place those into new pseudos into a VAR_DECL and use them later. */
2858 object
= copy_addr_to_reg (XEXP (object
, 0));
2860 size_mode
= TYPE_MODE (sizetype
);
2861 size
= convert_to_mode (size_mode
, size
, 1);
2862 size
= copy_to_mode_reg (size_mode
, size
);
2864 /* It is incorrect to use the libcall calling conventions to call
2865 memset in this context. This could be a user call to memset and
2866 the user may wish to examine the return value from memset. For
2867 targets where libcalls and normal calls have different conventions
2868 for returning pointers, we could end up generating incorrect code. */
2870 object_tree
= make_tree (ptr_type_node
, object
);
2871 if (!CONST_INT_P (val
))
2872 val
= convert_to_mode (TYPE_MODE (integer_type_node
), val
, 1);
2873 size_tree
= make_tree (sizetype
, size
);
2874 val_tree
= make_tree (integer_type_node
, val
);
2876 fn
= clear_storage_libcall_fn (true);
2877 call_expr
= build_call_expr (fn
, 3, object_tree
, val_tree
, size_tree
);
2878 CALL_EXPR_TAILCALL (call_expr
) = tailcall
;
2880 retval
= expand_normal (call_expr
);
2885 /* A subroutine of set_storage_via_libcall. Create the tree node
2886 for the function we use for block clears. */
2888 tree block_clear_fn
;
2891 init_block_clear_fn (const char *asmspec
)
2893 if (!block_clear_fn
)
2897 fn
= get_identifier ("memset");
2898 args
= build_function_type_list (ptr_type_node
, ptr_type_node
,
2899 integer_type_node
, sizetype
,
2902 fn
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, fn
, args
);
2903 DECL_EXTERNAL (fn
) = 1;
2904 TREE_PUBLIC (fn
) = 1;
2905 DECL_ARTIFICIAL (fn
) = 1;
2906 TREE_NOTHROW (fn
) = 1;
2907 DECL_VISIBILITY (fn
) = VISIBILITY_DEFAULT
;
2908 DECL_VISIBILITY_SPECIFIED (fn
) = 1;
2910 block_clear_fn
= fn
;
2914 set_user_assembler_name (block_clear_fn
, asmspec
);
2918 clear_storage_libcall_fn (int for_call
)
2920 static bool emitted_extern
;
2922 if (!block_clear_fn
)
2923 init_block_clear_fn (NULL
);
2925 if (for_call
&& !emitted_extern
)
2927 emitted_extern
= true;
2928 make_decl_rtl (block_clear_fn
);
2931 return block_clear_fn
;
2934 /* Expand a setmem pattern; return true if successful. */
2937 set_storage_via_setmem (rtx object
, rtx size
, rtx val
, unsigned int align
,
2938 unsigned int expected_align
, HOST_WIDE_INT expected_size
,
2939 unsigned HOST_WIDE_INT min_size
,
2940 unsigned HOST_WIDE_INT max_size
,
2941 unsigned HOST_WIDE_INT probable_max_size
)
2943 /* Try the most limited insn first, because there's no point
2944 including more than one in the machine description unless
2945 the more limited one has some advantage. */
2947 enum machine_mode mode
;
2949 if (expected_align
< align
)
2950 expected_align
= align
;
2951 if (expected_size
!= -1)
2953 if ((unsigned HOST_WIDE_INT
)expected_size
> max_size
)
2954 expected_size
= max_size
;
2955 if ((unsigned HOST_WIDE_INT
)expected_size
< min_size
)
2956 expected_size
= min_size
;
2959 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
2960 mode
= GET_MODE_WIDER_MODE (mode
))
2962 enum insn_code code
= direct_optab_handler (setmem_optab
, mode
);
2964 if (code
!= CODE_FOR_nothing
2965 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
2966 here because if SIZE is less than the mode mask, as it is
2967 returned by the macro, it will definitely be less than the
2968 actual mode mask. Since SIZE is within the Pmode address
2969 space, we limit MODE to Pmode. */
2970 && ((CONST_INT_P (size
)
2971 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
2972 <= (GET_MODE_MASK (mode
) >> 1)))
2973 || max_size
<= (GET_MODE_MASK (mode
) >> 1)
2974 || GET_MODE_BITSIZE (mode
) >= GET_MODE_BITSIZE (Pmode
)))
2976 struct expand_operand ops
[9];
2979 nops
= insn_data
[(int) code
].n_generator_args
;
2980 gcc_assert (nops
== 4 || nops
== 6 || nops
== 8 || nops
== 9);
2982 create_fixed_operand (&ops
[0], object
);
2983 /* The check above guarantees that this size conversion is valid. */
2984 create_convert_operand_to (&ops
[1], size
, mode
, true);
2985 create_convert_operand_from (&ops
[2], val
, byte_mode
, true);
2986 create_integer_operand (&ops
[3], align
/ BITS_PER_UNIT
);
2989 create_integer_operand (&ops
[4], expected_align
/ BITS_PER_UNIT
);
2990 create_integer_operand (&ops
[5], expected_size
);
2994 create_integer_operand (&ops
[6], min_size
);
2995 /* If we can not represent the maximal size,
2996 make parameter NULL. */
2997 if ((HOST_WIDE_INT
) max_size
!= -1)
2998 create_integer_operand (&ops
[7], max_size
);
3000 create_fixed_operand (&ops
[7], NULL
);
3004 /* If we can not represent the maximal size,
3005 make parameter NULL. */
3006 if ((HOST_WIDE_INT
) probable_max_size
!= -1)
3007 create_integer_operand (&ops
[8], probable_max_size
);
3009 create_fixed_operand (&ops
[8], NULL
);
3011 if (maybe_expand_insn (code
, nops
, ops
))
3020 /* Write to one of the components of the complex value CPLX. Write VAL to
3021 the real part if IMAG_P is false, and the imaginary part if its true. */
3024 write_complex_part (rtx cplx
, rtx val
, bool imag_p
)
3026 enum machine_mode cmode
;
3027 enum machine_mode imode
;
3030 if (GET_CODE (cplx
) == CONCAT
)
3032 emit_move_insn (XEXP (cplx
, imag_p
), val
);
3036 cmode
= GET_MODE (cplx
);
3037 imode
= GET_MODE_INNER (cmode
);
3038 ibitsize
= GET_MODE_BITSIZE (imode
);
3040 /* For MEMs simplify_gen_subreg may generate an invalid new address
3041 because, e.g., the original address is considered mode-dependent
3042 by the target, which restricts simplify_subreg from invoking
3043 adjust_address_nv. Instead of preparing fallback support for an
3044 invalid address, we call adjust_address_nv directly. */
3047 emit_move_insn (adjust_address_nv (cplx
, imode
,
3048 imag_p
? GET_MODE_SIZE (imode
) : 0),
3053 /* If the sub-object is at least word sized, then we know that subregging
3054 will work. This special case is important, since store_bit_field
3055 wants to operate on integer modes, and there's rarely an OImode to
3056 correspond to TCmode. */
3057 if (ibitsize
>= BITS_PER_WORD
3058 /* For hard regs we have exact predicates. Assume we can split
3059 the original object if it spans an even number of hard regs.
3060 This special case is important for SCmode on 64-bit platforms
3061 where the natural size of floating-point regs is 32-bit. */
3063 && REGNO (cplx
) < FIRST_PSEUDO_REGISTER
3064 && hard_regno_nregs
[REGNO (cplx
)][cmode
] % 2 == 0))
3066 rtx part
= simplify_gen_subreg (imode
, cplx
, cmode
,
3067 imag_p
? GET_MODE_SIZE (imode
) : 0);
3070 emit_move_insn (part
, val
);
3074 /* simplify_gen_subreg may fail for sub-word MEMs. */
3075 gcc_assert (MEM_P (cplx
) && ibitsize
< BITS_PER_WORD
);
3078 store_bit_field (cplx
, ibitsize
, imag_p
? ibitsize
: 0, 0, 0, imode
, val
);
3081 /* Extract one of the components of the complex value CPLX. Extract the
3082 real part if IMAG_P is false, and the imaginary part if it's true. */
3085 read_complex_part (rtx cplx
, bool imag_p
)
3087 enum machine_mode cmode
, imode
;
3090 if (GET_CODE (cplx
) == CONCAT
)
3091 return XEXP (cplx
, imag_p
);
3093 cmode
= GET_MODE (cplx
);
3094 imode
= GET_MODE_INNER (cmode
);
3095 ibitsize
= GET_MODE_BITSIZE (imode
);
3097 /* Special case reads from complex constants that got spilled to memory. */
3098 if (MEM_P (cplx
) && GET_CODE (XEXP (cplx
, 0)) == SYMBOL_REF
)
3100 tree decl
= SYMBOL_REF_DECL (XEXP (cplx
, 0));
3101 if (decl
&& TREE_CODE (decl
) == COMPLEX_CST
)
3103 tree part
= imag_p
? TREE_IMAGPART (decl
) : TREE_REALPART (decl
);
3104 if (CONSTANT_CLASS_P (part
))
3105 return expand_expr (part
, NULL_RTX
, imode
, EXPAND_NORMAL
);
3109 /* For MEMs simplify_gen_subreg may generate an invalid new address
3110 because, e.g., the original address is considered mode-dependent
3111 by the target, which restricts simplify_subreg from invoking
3112 adjust_address_nv. Instead of preparing fallback support for an
3113 invalid address, we call adjust_address_nv directly. */
3115 return adjust_address_nv (cplx
, imode
,
3116 imag_p
? GET_MODE_SIZE (imode
) : 0);
3118 /* If the sub-object is at least word sized, then we know that subregging
3119 will work. This special case is important, since extract_bit_field
3120 wants to operate on integer modes, and there's rarely an OImode to
3121 correspond to TCmode. */
3122 if (ibitsize
>= BITS_PER_WORD
3123 /* For hard regs we have exact predicates. Assume we can split
3124 the original object if it spans an even number of hard regs.
3125 This special case is important for SCmode on 64-bit platforms
3126 where the natural size of floating-point regs is 32-bit. */
3128 && REGNO (cplx
) < FIRST_PSEUDO_REGISTER
3129 && hard_regno_nregs
[REGNO (cplx
)][cmode
] % 2 == 0))
3131 rtx ret
= simplify_gen_subreg (imode
, cplx
, cmode
,
3132 imag_p
? GET_MODE_SIZE (imode
) : 0);
3136 /* simplify_gen_subreg may fail for sub-word MEMs. */
3137 gcc_assert (MEM_P (cplx
) && ibitsize
< BITS_PER_WORD
);
3140 return extract_bit_field (cplx
, ibitsize
, imag_p
? ibitsize
: 0,
3141 true, NULL_RTX
, imode
, imode
);
3144 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
3145 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
3146 represented in NEW_MODE. If FORCE is true, this will never happen, as
3147 we'll force-create a SUBREG if needed. */
3150 emit_move_change_mode (enum machine_mode new_mode
,
3151 enum machine_mode old_mode
, rtx x
, bool force
)
3155 if (push_operand (x
, GET_MODE (x
)))
3157 ret
= gen_rtx_MEM (new_mode
, XEXP (x
, 0));
3158 MEM_COPY_ATTRIBUTES (ret
, x
);
3162 /* We don't have to worry about changing the address since the
3163 size in bytes is supposed to be the same. */
3164 if (reload_in_progress
)
3166 /* Copy the MEM to change the mode and move any
3167 substitutions from the old MEM to the new one. */
3168 ret
= adjust_address_nv (x
, new_mode
, 0);
3169 copy_replacements (x
, ret
);
3172 ret
= adjust_address (x
, new_mode
, 0);
3176 /* Note that we do want simplify_subreg's behavior of validating
3177 that the new mode is ok for a hard register. If we were to use
3178 simplify_gen_subreg, we would create the subreg, but would
3179 probably run into the target not being able to implement it. */
3180 /* Except, of course, when FORCE is true, when this is exactly what
3181 we want. Which is needed for CCmodes on some targets. */
3183 ret
= simplify_gen_subreg (new_mode
, x
, old_mode
, 0);
3185 ret
= simplify_subreg (new_mode
, x
, old_mode
, 0);
3191 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
3192 an integer mode of the same size as MODE. Returns the instruction
3193 emitted, or NULL if such a move could not be generated. */
3196 emit_move_via_integer (enum machine_mode mode
, rtx x
, rtx y
, bool force
)
3198 enum machine_mode imode
;
3199 enum insn_code code
;
3201 /* There must exist a mode of the exact size we require. */
3202 imode
= int_mode_for_mode (mode
);
3203 if (imode
== BLKmode
)
3206 /* The target must support moves in this mode. */
3207 code
= optab_handler (mov_optab
, imode
);
3208 if (code
== CODE_FOR_nothing
)
3211 x
= emit_move_change_mode (imode
, mode
, x
, force
);
3214 y
= emit_move_change_mode (imode
, mode
, y
, force
);
3217 return emit_insn (GEN_FCN (code
) (x
, y
));
3220 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
3221 Return an equivalent MEM that does not use an auto-increment. */
3224 emit_move_resolve_push (enum machine_mode mode
, rtx x
)
3226 enum rtx_code code
= GET_CODE (XEXP (x
, 0));
3227 HOST_WIDE_INT adjust
;
3230 adjust
= GET_MODE_SIZE (mode
);
3231 #ifdef PUSH_ROUNDING
3232 adjust
= PUSH_ROUNDING (adjust
);
3234 if (code
== PRE_DEC
|| code
== POST_DEC
)
3236 else if (code
== PRE_MODIFY
|| code
== POST_MODIFY
)
3238 rtx expr
= XEXP (XEXP (x
, 0), 1);
3241 gcc_assert (GET_CODE (expr
) == PLUS
|| GET_CODE (expr
) == MINUS
);
3242 gcc_assert (CONST_INT_P (XEXP (expr
, 1)));
3243 val
= INTVAL (XEXP (expr
, 1));
3244 if (GET_CODE (expr
) == MINUS
)
3246 gcc_assert (adjust
== val
|| adjust
== -val
);
3250 /* Do not use anti_adjust_stack, since we don't want to update
3251 stack_pointer_delta. */
3252 temp
= expand_simple_binop (Pmode
, PLUS
, stack_pointer_rtx
,
3253 gen_int_mode (adjust
, Pmode
), stack_pointer_rtx
,
3254 0, OPTAB_LIB_WIDEN
);
3255 if (temp
!= stack_pointer_rtx
)
3256 emit_move_insn (stack_pointer_rtx
, temp
);
3263 temp
= stack_pointer_rtx
;
3268 temp
= plus_constant (Pmode
, stack_pointer_rtx
, -adjust
);
3274 return replace_equiv_address (x
, temp
);
3277 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3278 X is known to satisfy push_operand, and MODE is known to be complex.
3279 Returns the last instruction emitted. */
3282 emit_move_complex_push (enum machine_mode mode
, rtx x
, rtx y
)
3284 enum machine_mode submode
= GET_MODE_INNER (mode
);
3287 #ifdef PUSH_ROUNDING
3288 unsigned int submodesize
= GET_MODE_SIZE (submode
);
3290 /* In case we output to the stack, but the size is smaller than the
3291 machine can push exactly, we need to use move instructions. */
3292 if (PUSH_ROUNDING (submodesize
) != submodesize
)
3294 x
= emit_move_resolve_push (mode
, x
);
3295 return emit_move_insn (x
, y
);
3299 /* Note that the real part always precedes the imag part in memory
3300 regardless of machine's endianness. */
3301 switch (GET_CODE (XEXP (x
, 0)))
3315 emit_move_insn (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3316 read_complex_part (y
, imag_first
));
3317 return emit_move_insn (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3318 read_complex_part (y
, !imag_first
));
3321 /* A subroutine of emit_move_complex. Perform the move from Y to X
3322 via two moves of the parts. Returns the last instruction emitted. */
3325 emit_move_complex_parts (rtx x
, rtx y
)
3327 /* Show the output dies here. This is necessary for SUBREGs
3328 of pseudos since we cannot track their lifetimes correctly;
3329 hard regs shouldn't appear here except as return values. */
3330 if (!reload_completed
&& !reload_in_progress
3331 && REG_P (x
) && !reg_overlap_mentioned_p (x
, y
))
3334 write_complex_part (x
, read_complex_part (y
, false), false);
3335 write_complex_part (x
, read_complex_part (y
, true), true);
3337 return get_last_insn ();
3340 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3341 MODE is known to be complex. Returns the last instruction emitted. */
3344 emit_move_complex (enum machine_mode mode
, rtx x
, rtx y
)
3348 /* Need to take special care for pushes, to maintain proper ordering
3349 of the data, and possibly extra padding. */
3350 if (push_operand (x
, mode
))
3351 return emit_move_complex_push (mode
, x
, y
);
3353 /* See if we can coerce the target into moving both values at once, except
3354 for floating point where we favor moving as parts if this is easy. */
3355 if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
3356 && optab_handler (mov_optab
, GET_MODE_INNER (mode
)) != CODE_FOR_nothing
3358 && HARD_REGISTER_P (x
)
3359 && hard_regno_nregs
[REGNO (x
)][mode
] == 1)
3361 && HARD_REGISTER_P (y
)
3362 && hard_regno_nregs
[REGNO (y
)][mode
] == 1))
3364 /* Not possible if the values are inherently not adjacent. */
3365 else if (GET_CODE (x
) == CONCAT
|| GET_CODE (y
) == CONCAT
)
3367 /* Is possible if both are registers (or subregs of registers). */
3368 else if (register_operand (x
, mode
) && register_operand (y
, mode
))
3370 /* If one of the operands is a memory, and alignment constraints
3371 are friendly enough, we may be able to do combined memory operations.
3372 We do not attempt this if Y is a constant because that combination is
3373 usually better with the by-parts thing below. */
3374 else if ((MEM_P (x
) ? !CONSTANT_P (y
) : MEM_P (y
))
3375 && (!STRICT_ALIGNMENT
3376 || get_mode_alignment (mode
) == BIGGEST_ALIGNMENT
))
3385 /* For memory to memory moves, optimal behavior can be had with the
3386 existing block move logic. */
3387 if (MEM_P (x
) && MEM_P (y
))
3389 emit_block_move (x
, y
, GEN_INT (GET_MODE_SIZE (mode
)),
3390 BLOCK_OP_NO_LIBCALL
);
3391 return get_last_insn ();
3394 ret
= emit_move_via_integer (mode
, x
, y
, true);
3399 return emit_move_complex_parts (x
, y
);
3402 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3403 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3406 emit_move_ccmode (enum machine_mode mode
, rtx x
, rtx y
)
3410 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3413 enum insn_code code
= optab_handler (mov_optab
, CCmode
);
3414 if (code
!= CODE_FOR_nothing
)
3416 x
= emit_move_change_mode (CCmode
, mode
, x
, true);
3417 y
= emit_move_change_mode (CCmode
, mode
, y
, true);
3418 return emit_insn (GEN_FCN (code
) (x
, y
));
3422 /* Otherwise, find the MODE_INT mode of the same width. */
3423 ret
= emit_move_via_integer (mode
, x
, y
, false);
3424 gcc_assert (ret
!= NULL
);
3428 /* Return true if word I of OP lies entirely in the
3429 undefined bits of a paradoxical subreg. */
3432 undefined_operand_subword_p (const_rtx op
, int i
)
3434 enum machine_mode innermode
, innermostmode
;
3436 if (GET_CODE (op
) != SUBREG
)
3438 innermode
= GET_MODE (op
);
3439 innermostmode
= GET_MODE (SUBREG_REG (op
));
3440 offset
= i
* UNITS_PER_WORD
+ SUBREG_BYTE (op
);
3441 /* The SUBREG_BYTE represents offset, as if the value were stored in
3442 memory, except for a paradoxical subreg where we define
3443 SUBREG_BYTE to be 0; undo this exception as in
3445 if (SUBREG_BYTE (op
) == 0
3446 && GET_MODE_SIZE (innermostmode
) < GET_MODE_SIZE (innermode
))
3448 int difference
= (GET_MODE_SIZE (innermostmode
) - GET_MODE_SIZE (innermode
));
3449 if (WORDS_BIG_ENDIAN
)
3450 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3451 if (BYTES_BIG_ENDIAN
)
3452 offset
+= difference
% UNITS_PER_WORD
;
3454 if (offset
>= GET_MODE_SIZE (innermostmode
)
3455 || offset
<= -GET_MODE_SIZE (word_mode
))
3460 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3461 MODE is any multi-word or full-word mode that lacks a move_insn
3462 pattern. Note that you will get better code if you define such
3463 patterns, even if they must turn into multiple assembler instructions. */
3466 emit_move_multi_word (enum machine_mode mode
, rtx x
, rtx y
)
3473 gcc_assert (GET_MODE_SIZE (mode
) >= UNITS_PER_WORD
);
3475 /* If X is a push on the stack, do the push now and replace
3476 X with a reference to the stack pointer. */
3477 if (push_operand (x
, mode
))
3478 x
= emit_move_resolve_push (mode
, x
);
3480 /* If we are in reload, see if either operand is a MEM whose address
3481 is scheduled for replacement. */
3482 if (reload_in_progress
&& MEM_P (x
)
3483 && (inner
= find_replacement (&XEXP (x
, 0))) != XEXP (x
, 0))
3484 x
= replace_equiv_address_nv (x
, inner
);
3485 if (reload_in_progress
&& MEM_P (y
)
3486 && (inner
= find_replacement (&XEXP (y
, 0))) != XEXP (y
, 0))
3487 y
= replace_equiv_address_nv (y
, inner
);
3491 need_clobber
= false;
3493 i
< (GET_MODE_SIZE (mode
) + (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
3496 rtx xpart
= operand_subword (x
, i
, 1, mode
);
3499 /* Do not generate code for a move if it would come entirely
3500 from the undefined bits of a paradoxical subreg. */
3501 if (undefined_operand_subword_p (y
, i
))
3504 ypart
= operand_subword (y
, i
, 1, mode
);
3506 /* If we can't get a part of Y, put Y into memory if it is a
3507 constant. Otherwise, force it into a register. Then we must
3508 be able to get a part of Y. */
3509 if (ypart
== 0 && CONSTANT_P (y
))
3511 y
= use_anchored_address (force_const_mem (mode
, y
));
3512 ypart
= operand_subword (y
, i
, 1, mode
);
3514 else if (ypart
== 0)
3515 ypart
= operand_subword_force (y
, i
, mode
);
3517 gcc_assert (xpart
&& ypart
);
3519 need_clobber
|= (GET_CODE (xpart
) == SUBREG
);
3521 last_insn
= emit_move_insn (xpart
, ypart
);
3527 /* Show the output dies here. This is necessary for SUBREGs
3528 of pseudos since we cannot track their lifetimes correctly;
3529 hard regs shouldn't appear here except as return values.
3530 We never want to emit such a clobber after reload. */
3532 && ! (reload_in_progress
|| reload_completed
)
3533 && need_clobber
!= 0)
3541 /* Low level part of emit_move_insn.
3542 Called just like emit_move_insn, but assumes X and Y
3543 are basically valid. */
3546 emit_move_insn_1 (rtx x
, rtx y
)
3548 enum machine_mode mode
= GET_MODE (x
);
3549 enum insn_code code
;
3551 gcc_assert ((unsigned int) mode
< (unsigned int) MAX_MACHINE_MODE
);
3553 code
= optab_handler (mov_optab
, mode
);
3554 if (code
!= CODE_FOR_nothing
)
3555 return emit_insn (GEN_FCN (code
) (x
, y
));
3557 /* Expand complex moves by moving real part and imag part. */
3558 if (COMPLEX_MODE_P (mode
))
3559 return emit_move_complex (mode
, x
, y
);
3561 if (GET_MODE_CLASS (mode
) == MODE_DECIMAL_FLOAT
3562 || ALL_FIXED_POINT_MODE_P (mode
))
3564 rtx result
= emit_move_via_integer (mode
, x
, y
, true);
3566 /* If we can't find an integer mode, use multi words. */
3570 return emit_move_multi_word (mode
, x
, y
);
3573 if (GET_MODE_CLASS (mode
) == MODE_CC
)
3574 return emit_move_ccmode (mode
, x
, y
);
3576 /* Try using a move pattern for the corresponding integer mode. This is
3577 only safe when simplify_subreg can convert MODE constants into integer
3578 constants. At present, it can only do this reliably if the value
3579 fits within a HOST_WIDE_INT. */
3580 if (!CONSTANT_P (y
) || GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
)
3582 rtx ret
= emit_move_via_integer (mode
, x
, y
, lra_in_progress
);
3586 if (! lra_in_progress
|| recog (PATTERN (ret
), ret
, 0) >= 0)
3591 return emit_move_multi_word (mode
, x
, y
);
3594 /* Generate code to copy Y into X.
3595 Both Y and X must have the same mode, except that
3596 Y can be a constant with VOIDmode.
3597 This mode cannot be BLKmode; use emit_block_move for that.
3599 Return the last instruction emitted. */
3602 emit_move_insn (rtx x
, rtx y
)
3604 enum machine_mode mode
= GET_MODE (x
);
3605 rtx y_cst
= NULL_RTX
;
3608 gcc_assert (mode
!= BLKmode
3609 && (GET_MODE (y
) == mode
|| GET_MODE (y
) == VOIDmode
));
3614 && SCALAR_FLOAT_MODE_P (GET_MODE (x
))
3615 && (last_insn
= compress_float_constant (x
, y
)))
3620 if (!targetm
.legitimate_constant_p (mode
, y
))
3622 y
= force_const_mem (mode
, y
);
3624 /* If the target's cannot_force_const_mem prevented the spill,
3625 assume that the target's move expanders will also take care
3626 of the non-legitimate constant. */
3630 y
= use_anchored_address (y
);
3634 /* If X or Y are memory references, verify that their addresses are valid
3637 && (! memory_address_addr_space_p (GET_MODE (x
), XEXP (x
, 0),
3639 && ! push_operand (x
, GET_MODE (x
))))
3640 x
= validize_mem (x
);
3643 && ! memory_address_addr_space_p (GET_MODE (y
), XEXP (y
, 0),
3644 MEM_ADDR_SPACE (y
)))
3645 y
= validize_mem (y
);
3647 gcc_assert (mode
!= BLKmode
);
3649 last_insn
= emit_move_insn_1 (x
, y
);
3651 if (y_cst
&& REG_P (x
)
3652 && (set
= single_set (last_insn
)) != NULL_RTX
3653 && SET_DEST (set
) == x
3654 && ! rtx_equal_p (y_cst
, SET_SRC (set
)))
3655 set_unique_reg_note (last_insn
, REG_EQUAL
, copy_rtx (y_cst
));
3660 /* If Y is representable exactly in a narrower mode, and the target can
3661 perform the extension directly from constant or memory, then emit the
3662 move as an extension. */
3665 compress_float_constant (rtx x
, rtx y
)
3667 enum machine_mode dstmode
= GET_MODE (x
);
3668 enum machine_mode orig_srcmode
= GET_MODE (y
);
3669 enum machine_mode srcmode
;
3671 int oldcost
, newcost
;
3672 bool speed
= optimize_insn_for_speed_p ();
3674 REAL_VALUE_FROM_CONST_DOUBLE (r
, y
);
3676 if (targetm
.legitimate_constant_p (dstmode
, y
))
3677 oldcost
= set_src_cost (y
, speed
);
3679 oldcost
= set_src_cost (force_const_mem (dstmode
, y
), speed
);
3681 for (srcmode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode
));
3682 srcmode
!= orig_srcmode
;
3683 srcmode
= GET_MODE_WIDER_MODE (srcmode
))
3686 rtx trunc_y
, last_insn
;
3688 /* Skip if the target can't extend this way. */
3689 ic
= can_extend_p (dstmode
, srcmode
, 0);
3690 if (ic
== CODE_FOR_nothing
)
3693 /* Skip if the narrowed value isn't exact. */
3694 if (! exact_real_truncate (srcmode
, &r
))
3697 trunc_y
= CONST_DOUBLE_FROM_REAL_VALUE (r
, srcmode
);
3699 if (targetm
.legitimate_constant_p (srcmode
, trunc_y
))
3701 /* Skip if the target needs extra instructions to perform
3703 if (!insn_operand_matches (ic
, 1, trunc_y
))
3705 /* This is valid, but may not be cheaper than the original. */
3706 newcost
= set_src_cost (gen_rtx_FLOAT_EXTEND (dstmode
, trunc_y
),
3708 if (oldcost
< newcost
)
3711 else if (float_extend_from_mem
[dstmode
][srcmode
])
3713 trunc_y
= force_const_mem (srcmode
, trunc_y
);
3714 /* This is valid, but may not be cheaper than the original. */
3715 newcost
= set_src_cost (gen_rtx_FLOAT_EXTEND (dstmode
, trunc_y
),
3717 if (oldcost
< newcost
)
3719 trunc_y
= validize_mem (trunc_y
);
3724 /* For CSE's benefit, force the compressed constant pool entry
3725 into a new pseudo. This constant may be used in different modes,
3726 and if not, combine will put things back together for us. */
3727 trunc_y
= force_reg (srcmode
, trunc_y
);
3729 /* If x is a hard register, perform the extension into a pseudo,
3730 so that e.g. stack realignment code is aware of it. */
3732 if (REG_P (x
) && HARD_REGISTER_P (x
))
3733 target
= gen_reg_rtx (dstmode
);
3735 emit_unop_insn (ic
, target
, trunc_y
, UNKNOWN
);
3736 last_insn
= get_last_insn ();
3739 set_unique_reg_note (last_insn
, REG_EQUAL
, y
);
3742 return emit_move_insn (x
, target
);
3749 /* Pushing data onto the stack. */
3751 /* Push a block of length SIZE (perhaps variable)
3752 and return an rtx to address the beginning of the block.
3753 The value may be virtual_outgoing_args_rtx.
3755 EXTRA is the number of bytes of padding to push in addition to SIZE.
3756 BELOW nonzero means this padding comes at low addresses;
3757 otherwise, the padding comes at high addresses. */
3760 push_block (rtx size
, int extra
, int below
)
3764 size
= convert_modes (Pmode
, ptr_mode
, size
, 1);
3765 if (CONSTANT_P (size
))
3766 anti_adjust_stack (plus_constant (Pmode
, size
, extra
));
3767 else if (REG_P (size
) && extra
== 0)
3768 anti_adjust_stack (size
);
3771 temp
= copy_to_mode_reg (Pmode
, size
);
3773 temp
= expand_binop (Pmode
, add_optab
, temp
,
3774 gen_int_mode (extra
, Pmode
),
3775 temp
, 0, OPTAB_LIB_WIDEN
);
3776 anti_adjust_stack (temp
);
3779 #ifndef STACK_GROWS_DOWNWARD
3785 temp
= virtual_outgoing_args_rtx
;
3786 if (extra
!= 0 && below
)
3787 temp
= plus_constant (Pmode
, temp
, extra
);
3791 if (CONST_INT_P (size
))
3792 temp
= plus_constant (Pmode
, virtual_outgoing_args_rtx
,
3793 -INTVAL (size
) - (below
? 0 : extra
));
3794 else if (extra
!= 0 && !below
)
3795 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
3796 negate_rtx (Pmode
, plus_constant (Pmode
, size
,
3799 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
3800 negate_rtx (Pmode
, size
));
3803 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT
), temp
);
3806 /* A utility routine that returns the base of an auto-inc memory, or NULL. */
3809 mem_autoinc_base (rtx mem
)
3813 rtx addr
= XEXP (mem
, 0);
3814 if (GET_RTX_CLASS (GET_CODE (addr
)) == RTX_AUTOINC
)
3815 return XEXP (addr
, 0);
3820 /* A utility routine used here, in reload, and in try_split. The insns
3821 after PREV up to and including LAST are known to adjust the stack,
3822 with a final value of END_ARGS_SIZE. Iterate backward from LAST
3823 placing notes as appropriate. PREV may be NULL, indicating the
3824 entire insn sequence prior to LAST should be scanned.
3826 The set of allowed stack pointer modifications is small:
3827 (1) One or more auto-inc style memory references (aka pushes),
3828 (2) One or more addition/subtraction with the SP as destination,
3829 (3) A single move insn with the SP as destination,
3830 (4) A call_pop insn,
3831 (5) Noreturn call insns if !ACCUMULATE_OUTGOING_ARGS.
3833 Insns in the sequence that do not modify the SP are ignored,
3834 except for noreturn calls.
3836 The return value is the amount of adjustment that can be trivially
3837 verified, via immediate operand or auto-inc. If the adjustment
3838 cannot be trivially extracted, the return value is INT_MIN. */
3841 find_args_size_adjust (rtx insn
)
3846 pat
= PATTERN (insn
);
3849 /* Look for a call_pop pattern. */
3852 /* We have to allow non-call_pop patterns for the case
3853 of emit_single_push_insn of a TLS address. */
3854 if (GET_CODE (pat
) != PARALLEL
)
3857 /* All call_pop have a stack pointer adjust in the parallel.
3858 The call itself is always first, and the stack adjust is
3859 usually last, so search from the end. */
3860 for (i
= XVECLEN (pat
, 0) - 1; i
> 0; --i
)
3862 set
= XVECEXP (pat
, 0, i
);
3863 if (GET_CODE (set
) != SET
)
3865 dest
= SET_DEST (set
);
3866 if (dest
== stack_pointer_rtx
)
3869 /* We'd better have found the stack pointer adjust. */
3872 /* Fall through to process the extracted SET and DEST
3873 as if it was a standalone insn. */
3875 else if (GET_CODE (pat
) == SET
)
3877 else if ((set
= single_set (insn
)) != NULL
)
3879 else if (GET_CODE (pat
) == PARALLEL
)
3881 /* ??? Some older ports use a parallel with a stack adjust
3882 and a store for a PUSH_ROUNDING pattern, rather than a
3883 PRE/POST_MODIFY rtx. Don't force them to update yet... */
3884 /* ??? See h8300 and m68k, pushqi1. */
3885 for (i
= XVECLEN (pat
, 0) - 1; i
>= 0; --i
)
3887 set
= XVECEXP (pat
, 0, i
);
3888 if (GET_CODE (set
) != SET
)
3890 dest
= SET_DEST (set
);
3891 if (dest
== stack_pointer_rtx
)
3894 /* We do not expect an auto-inc of the sp in the parallel. */
3895 gcc_checking_assert (mem_autoinc_base (dest
) != stack_pointer_rtx
);
3896 gcc_checking_assert (mem_autoinc_base (SET_SRC (set
))
3897 != stack_pointer_rtx
);
3905 dest
= SET_DEST (set
);
3907 /* Look for direct modifications of the stack pointer. */
3908 if (REG_P (dest
) && REGNO (dest
) == STACK_POINTER_REGNUM
)
3910 /* Look for a trivial adjustment, otherwise assume nothing. */
3911 /* Note that the SPU restore_stack_block pattern refers to
3912 the stack pointer in V4SImode. Consider that non-trivial. */
3913 if (SCALAR_INT_MODE_P (GET_MODE (dest
))
3914 && GET_CODE (SET_SRC (set
)) == PLUS
3915 && XEXP (SET_SRC (set
), 0) == stack_pointer_rtx
3916 && CONST_INT_P (XEXP (SET_SRC (set
), 1)))
3917 return INTVAL (XEXP (SET_SRC (set
), 1));
3918 /* ??? Reload can generate no-op moves, which will be cleaned
3919 up later. Recognize it and continue searching. */
3920 else if (rtx_equal_p (dest
, SET_SRC (set
)))
3923 return HOST_WIDE_INT_MIN
;
3929 /* Otherwise only think about autoinc patterns. */
3930 if (mem_autoinc_base (dest
) == stack_pointer_rtx
)
3933 gcc_checking_assert (mem_autoinc_base (SET_SRC (set
))
3934 != stack_pointer_rtx
);
3936 else if (mem_autoinc_base (SET_SRC (set
)) == stack_pointer_rtx
)
3937 mem
= SET_SRC (set
);
3941 addr
= XEXP (mem
, 0);
3942 switch (GET_CODE (addr
))
3946 return GET_MODE_SIZE (GET_MODE (mem
));
3949 return -GET_MODE_SIZE (GET_MODE (mem
));
3952 addr
= XEXP (addr
, 1);
3953 gcc_assert (GET_CODE (addr
) == PLUS
);
3954 gcc_assert (XEXP (addr
, 0) == stack_pointer_rtx
);
3955 gcc_assert (CONST_INT_P (XEXP (addr
, 1)));
3956 return INTVAL (XEXP (addr
, 1));
3964 fixup_args_size_notes (rtx prev
, rtx last
, int end_args_size
)
3966 int args_size
= end_args_size
;
3967 bool saw_unknown
= false;
3970 for (insn
= last
; insn
!= prev
; insn
= PREV_INSN (insn
))
3972 HOST_WIDE_INT this_delta
;
3974 if (!NONDEBUG_INSN_P (insn
))
3977 this_delta
= find_args_size_adjust (insn
);
3978 if (this_delta
== 0)
3981 || ACCUMULATE_OUTGOING_ARGS
3982 || find_reg_note (insn
, REG_NORETURN
, NULL_RTX
) == NULL_RTX
)
3986 gcc_assert (!saw_unknown
);
3987 if (this_delta
== HOST_WIDE_INT_MIN
)
3990 add_reg_note (insn
, REG_ARGS_SIZE
, GEN_INT (args_size
));
3991 #ifdef STACK_GROWS_DOWNWARD
3992 this_delta
= -(unsigned HOST_WIDE_INT
) this_delta
;
3994 args_size
-= this_delta
;
3997 return saw_unknown
? INT_MIN
: args_size
;
4000 #ifdef PUSH_ROUNDING
4001 /* Emit single push insn. */
4004 emit_single_push_insn_1 (enum machine_mode mode
, rtx x
, tree type
)
4007 unsigned rounded_size
= PUSH_ROUNDING (GET_MODE_SIZE (mode
));
4009 enum insn_code icode
;
4011 stack_pointer_delta
+= PUSH_ROUNDING (GET_MODE_SIZE (mode
));
4012 /* If there is push pattern, use it. Otherwise try old way of throwing
4013 MEM representing push operation to move expander. */
4014 icode
= optab_handler (push_optab
, mode
);
4015 if (icode
!= CODE_FOR_nothing
)
4017 struct expand_operand ops
[1];
4019 create_input_operand (&ops
[0], x
, mode
);
4020 if (maybe_expand_insn (icode
, 1, ops
))
4023 if (GET_MODE_SIZE (mode
) == rounded_size
)
4024 dest_addr
= gen_rtx_fmt_e (STACK_PUSH_CODE
, Pmode
, stack_pointer_rtx
);
4025 /* If we are to pad downward, adjust the stack pointer first and
4026 then store X into the stack location using an offset. This is
4027 because emit_move_insn does not know how to pad; it does not have
4029 else if (FUNCTION_ARG_PADDING (mode
, type
) == downward
)
4031 unsigned padding_size
= rounded_size
- GET_MODE_SIZE (mode
);
4032 HOST_WIDE_INT offset
;
4034 emit_move_insn (stack_pointer_rtx
,
4035 expand_binop (Pmode
,
4036 #ifdef STACK_GROWS_DOWNWARD
4042 gen_int_mode (rounded_size
, Pmode
),
4043 NULL_RTX
, 0, OPTAB_LIB_WIDEN
));
4045 offset
= (HOST_WIDE_INT
) padding_size
;
4046 #ifdef STACK_GROWS_DOWNWARD
4047 if (STACK_PUSH_CODE
== POST_DEC
)
4048 /* We have already decremented the stack pointer, so get the
4050 offset
+= (HOST_WIDE_INT
) rounded_size
;
4052 if (STACK_PUSH_CODE
== POST_INC
)
4053 /* We have already incremented the stack pointer, so get the
4055 offset
-= (HOST_WIDE_INT
) rounded_size
;
4057 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
4058 gen_int_mode (offset
, Pmode
));
4062 #ifdef STACK_GROWS_DOWNWARD
4063 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
4064 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
4065 gen_int_mode (-(HOST_WIDE_INT
) rounded_size
,
4068 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
4069 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
4070 gen_int_mode (rounded_size
, Pmode
));
4072 dest_addr
= gen_rtx_PRE_MODIFY (Pmode
, stack_pointer_rtx
, dest_addr
);
4075 dest
= gen_rtx_MEM (mode
, dest_addr
);
4079 set_mem_attributes (dest
, type
, 1);
4081 if (cfun
->tail_call_marked
)
4082 /* Function incoming arguments may overlap with sibling call
4083 outgoing arguments and we cannot allow reordering of reads
4084 from function arguments with stores to outgoing arguments
4085 of sibling calls. */
4086 set_mem_alias_set (dest
, 0);
4088 emit_move_insn (dest
, x
);
4091 /* Emit and annotate a single push insn. */
4094 emit_single_push_insn (enum machine_mode mode
, rtx x
, tree type
)
4096 int delta
, old_delta
= stack_pointer_delta
;
4097 rtx prev
= get_last_insn ();
4100 emit_single_push_insn_1 (mode
, x
, type
);
4102 last
= get_last_insn ();
4104 /* Notice the common case where we emitted exactly one insn. */
4105 if (PREV_INSN (last
) == prev
)
4107 add_reg_note (last
, REG_ARGS_SIZE
, GEN_INT (stack_pointer_delta
));
4111 delta
= fixup_args_size_notes (prev
, last
, stack_pointer_delta
);
4112 gcc_assert (delta
== INT_MIN
|| delta
== old_delta
);
4116 /* Generate code to push X onto the stack, assuming it has mode MODE and
4118 MODE is redundant except when X is a CONST_INT (since they don't
4120 SIZE is an rtx for the size of data to be copied (in bytes),
4121 needed only if X is BLKmode.
4123 ALIGN (in bits) is maximum alignment we can assume.
4125 If PARTIAL and REG are both nonzero, then copy that many of the first
4126 bytes of X into registers starting with REG, and push the rest of X.
4127 The amount of space pushed is decreased by PARTIAL bytes.
4128 REG must be a hard register in this case.
4129 If REG is zero but PARTIAL is not, take any all others actions for an
4130 argument partially in registers, but do not actually load any
4133 EXTRA is the amount in bytes of extra space to leave next to this arg.
4134 This is ignored if an argument block has already been allocated.
4136 On a machine that lacks real push insns, ARGS_ADDR is the address of
4137 the bottom of the argument block for this call. We use indexing off there
4138 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
4139 argument block has not been preallocated.
4141 ARGS_SO_FAR is the size of args previously pushed for this call.
4143 REG_PARM_STACK_SPACE is nonzero if functions require stack space
4144 for arguments passed in registers. If nonzero, it will be the number
4145 of bytes required. */
4148 emit_push_insn (rtx x
, enum machine_mode mode
, tree type
, rtx size
,
4149 unsigned int align
, int partial
, rtx reg
, int extra
,
4150 rtx args_addr
, rtx args_so_far
, int reg_parm_stack_space
,
4154 enum direction stack_direction
4155 #ifdef STACK_GROWS_DOWNWARD
4161 /* Decide where to pad the argument: `downward' for below,
4162 `upward' for above, or `none' for don't pad it.
4163 Default is below for small data on big-endian machines; else above. */
4164 enum direction where_pad
= FUNCTION_ARG_PADDING (mode
, type
);
4166 /* Invert direction if stack is post-decrement.
4168 if (STACK_PUSH_CODE
== POST_DEC
)
4169 if (where_pad
!= none
)
4170 where_pad
= (where_pad
== downward
? upward
: downward
);
4175 || (STRICT_ALIGNMENT
&& align
< GET_MODE_ALIGNMENT (mode
)))
4177 /* Copy a block into the stack, entirely or partially. */
4184 offset
= partial
% (PARM_BOUNDARY
/ BITS_PER_UNIT
);
4185 used
= partial
- offset
;
4187 if (mode
!= BLKmode
)
4189 /* A value is to be stored in an insufficiently aligned
4190 stack slot; copy via a suitably aligned slot if
4192 size
= GEN_INT (GET_MODE_SIZE (mode
));
4193 if (!MEM_P (xinner
))
4195 temp
= assign_temp (type
, 1, 1);
4196 emit_move_insn (temp
, xinner
);
4203 /* USED is now the # of bytes we need not copy to the stack
4204 because registers will take care of them. */
4207 xinner
= adjust_address (xinner
, BLKmode
, used
);
4209 /* If the partial register-part of the arg counts in its stack size,
4210 skip the part of stack space corresponding to the registers.
4211 Otherwise, start copying to the beginning of the stack space,
4212 by setting SKIP to 0. */
4213 skip
= (reg_parm_stack_space
== 0) ? 0 : used
;
4215 #ifdef PUSH_ROUNDING
4216 /* Do it with several push insns if that doesn't take lots of insns
4217 and if there is no difficulty with push insns that skip bytes
4218 on the stack for alignment purposes. */
4221 && CONST_INT_P (size
)
4223 && MEM_ALIGN (xinner
) >= align
4224 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size
) - used
, align
))
4225 /* Here we avoid the case of a structure whose weak alignment
4226 forces many pushes of a small amount of data,
4227 and such small pushes do rounding that causes trouble. */
4228 && ((! SLOW_UNALIGNED_ACCESS (word_mode
, align
))
4229 || align
>= BIGGEST_ALIGNMENT
4230 || (PUSH_ROUNDING (align
/ BITS_PER_UNIT
)
4231 == (align
/ BITS_PER_UNIT
)))
4232 && (HOST_WIDE_INT
) PUSH_ROUNDING (INTVAL (size
)) == INTVAL (size
))
4234 /* Push padding now if padding above and stack grows down,
4235 or if padding below and stack grows up.
4236 But if space already allocated, this has already been done. */
4237 if (extra
&& args_addr
== 0
4238 && where_pad
!= none
&& where_pad
!= stack_direction
)
4239 anti_adjust_stack (GEN_INT (extra
));
4241 move_by_pieces (NULL
, xinner
, INTVAL (size
) - used
, align
, 0);
4244 #endif /* PUSH_ROUNDING */
4248 /* Otherwise make space on the stack and copy the data
4249 to the address of that space. */
4251 /* Deduct words put into registers from the size we must copy. */
4254 if (CONST_INT_P (size
))
4255 size
= GEN_INT (INTVAL (size
) - used
);
4257 size
= expand_binop (GET_MODE (size
), sub_optab
, size
,
4258 gen_int_mode (used
, GET_MODE (size
)),
4259 NULL_RTX
, 0, OPTAB_LIB_WIDEN
);
4262 /* Get the address of the stack space.
4263 In this case, we do not deal with EXTRA separately.
4264 A single stack adjust will do. */
4267 temp
= push_block (size
, extra
, where_pad
== downward
);
4270 else if (CONST_INT_P (args_so_far
))
4271 temp
= memory_address (BLKmode
,
4272 plus_constant (Pmode
, args_addr
,
4273 skip
+ INTVAL (args_so_far
)));
4275 temp
= memory_address (BLKmode
,
4276 plus_constant (Pmode
,
4277 gen_rtx_PLUS (Pmode
,
4282 if (!ACCUMULATE_OUTGOING_ARGS
)
4284 /* If the source is referenced relative to the stack pointer,
4285 copy it to another register to stabilize it. We do not need
4286 to do this if we know that we won't be changing sp. */
4288 if (reg_mentioned_p (virtual_stack_dynamic_rtx
, temp
)
4289 || reg_mentioned_p (virtual_outgoing_args_rtx
, temp
))
4290 temp
= copy_to_reg (temp
);
4293 target
= gen_rtx_MEM (BLKmode
, temp
);
4295 /* We do *not* set_mem_attributes here, because incoming arguments
4296 may overlap with sibling call outgoing arguments and we cannot
4297 allow reordering of reads from function arguments with stores
4298 to outgoing arguments of sibling calls. We do, however, want
4299 to record the alignment of the stack slot. */
4300 /* ALIGN may well be better aligned than TYPE, e.g. due to
4301 PARM_BOUNDARY. Assume the caller isn't lying. */
4302 set_mem_align (target
, align
);
4304 emit_block_move (target
, xinner
, size
, BLOCK_OP_CALL_PARM
);
4307 else if (partial
> 0)
4309 /* Scalar partly in registers. */
4311 int size
= GET_MODE_SIZE (mode
) / UNITS_PER_WORD
;
4314 /* # bytes of start of argument
4315 that we must make space for but need not store. */
4316 int offset
= partial
% (PARM_BOUNDARY
/ BITS_PER_UNIT
);
4317 int args_offset
= INTVAL (args_so_far
);
4320 /* Push padding now if padding above and stack grows down,
4321 or if padding below and stack grows up.
4322 But if space already allocated, this has already been done. */
4323 if (extra
&& args_addr
== 0
4324 && where_pad
!= none
&& where_pad
!= stack_direction
)
4325 anti_adjust_stack (GEN_INT (extra
));
4327 /* If we make space by pushing it, we might as well push
4328 the real data. Otherwise, we can leave OFFSET nonzero
4329 and leave the space uninitialized. */
4333 /* Now NOT_STACK gets the number of words that we don't need to
4334 allocate on the stack. Convert OFFSET to words too. */
4335 not_stack
= (partial
- offset
) / UNITS_PER_WORD
;
4336 offset
/= UNITS_PER_WORD
;
4338 /* If the partial register-part of the arg counts in its stack size,
4339 skip the part of stack space corresponding to the registers.
4340 Otherwise, start copying to the beginning of the stack space,
4341 by setting SKIP to 0. */
4342 skip
= (reg_parm_stack_space
== 0) ? 0 : not_stack
;
4344 if (CONSTANT_P (x
) && !targetm
.legitimate_constant_p (mode
, x
))
4345 x
= validize_mem (force_const_mem (mode
, x
));
4347 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
4348 SUBREGs of such registers are not allowed. */
4349 if ((REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
4350 && GET_MODE_CLASS (GET_MODE (x
)) != MODE_INT
))
4351 x
= copy_to_reg (x
);
4353 /* Loop over all the words allocated on the stack for this arg. */
4354 /* We can do it by words, because any scalar bigger than a word
4355 has a size a multiple of a word. */
4356 #ifndef PUSH_ARGS_REVERSED
4357 for (i
= not_stack
; i
< size
; i
++)
4359 for (i
= size
- 1; i
>= not_stack
; i
--)
4361 if (i
>= not_stack
+ offset
)
4362 emit_push_insn (operand_subword_force (x
, i
, mode
),
4363 word_mode
, NULL_TREE
, NULL_RTX
, align
, 0, NULL_RTX
,
4365 GEN_INT (args_offset
+ ((i
- not_stack
+ skip
)
4367 reg_parm_stack_space
, alignment_pad
);
4374 /* Push padding now if padding above and stack grows down,
4375 or if padding below and stack grows up.
4376 But if space already allocated, this has already been done. */
4377 if (extra
&& args_addr
== 0
4378 && where_pad
!= none
&& where_pad
!= stack_direction
)
4379 anti_adjust_stack (GEN_INT (extra
));
4381 #ifdef PUSH_ROUNDING
4382 if (args_addr
== 0 && PUSH_ARGS
)
4383 emit_single_push_insn (mode
, x
, type
);
4387 if (CONST_INT_P (args_so_far
))
4389 = memory_address (mode
,
4390 plus_constant (Pmode
, args_addr
,
4391 INTVAL (args_so_far
)));
4393 addr
= memory_address (mode
, gen_rtx_PLUS (Pmode
, args_addr
,
4395 dest
= gen_rtx_MEM (mode
, addr
);
4397 /* We do *not* set_mem_attributes here, because incoming arguments
4398 may overlap with sibling call outgoing arguments and we cannot
4399 allow reordering of reads from function arguments with stores
4400 to outgoing arguments of sibling calls. We do, however, want
4401 to record the alignment of the stack slot. */
4402 /* ALIGN may well be better aligned than TYPE, e.g. due to
4403 PARM_BOUNDARY. Assume the caller isn't lying. */
4404 set_mem_align (dest
, align
);
4406 emit_move_insn (dest
, x
);
4410 /* If part should go in registers, copy that part
4411 into the appropriate registers. Do this now, at the end,
4412 since mem-to-mem copies above may do function calls. */
4413 if (partial
> 0 && reg
!= 0)
4415 /* Handle calls that pass values in multiple non-contiguous locations.
4416 The Irix 6 ABI has examples of this. */
4417 if (GET_CODE (reg
) == PARALLEL
)
4418 emit_group_load (reg
, x
, type
, -1);
4421 gcc_assert (partial
% UNITS_PER_WORD
== 0);
4422 move_block_to_reg (REGNO (reg
), x
, partial
/ UNITS_PER_WORD
, mode
);
4426 if (extra
&& args_addr
== 0 && where_pad
== stack_direction
)
4427 anti_adjust_stack (GEN_INT (extra
));
4429 if (alignment_pad
&& args_addr
== 0)
4430 anti_adjust_stack (alignment_pad
);
4433 /* Return X if X can be used as a subtarget in a sequence of arithmetic
4437 get_subtarget (rtx x
)
4441 /* Only registers can be subtargets. */
4443 /* Don't use hard regs to avoid extending their life. */
4444 || REGNO (x
) < FIRST_PSEUDO_REGISTER
4448 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
4449 FIELD is a bitfield. Returns true if the optimization was successful,
4450 and there's nothing else to do. */
4453 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize
,
4454 unsigned HOST_WIDE_INT bitpos
,
4455 unsigned HOST_WIDE_INT bitregion_start
,
4456 unsigned HOST_WIDE_INT bitregion_end
,
4457 enum machine_mode mode1
, rtx str_rtx
,
4460 enum machine_mode str_mode
= GET_MODE (str_rtx
);
4461 unsigned int str_bitsize
= GET_MODE_BITSIZE (str_mode
);
4466 enum tree_code code
;
4468 if (mode1
!= VOIDmode
4469 || bitsize
>= BITS_PER_WORD
4470 || str_bitsize
> BITS_PER_WORD
4471 || TREE_SIDE_EFFECTS (to
)
4472 || TREE_THIS_VOLATILE (to
))
4476 if (TREE_CODE (src
) != SSA_NAME
)
4478 if (TREE_CODE (TREE_TYPE (src
)) != INTEGER_TYPE
)
4481 srcstmt
= get_gimple_for_ssa_name (src
);
4483 || TREE_CODE_CLASS (gimple_assign_rhs_code (srcstmt
)) != tcc_binary
)
4486 code
= gimple_assign_rhs_code (srcstmt
);
4488 op0
= gimple_assign_rhs1 (srcstmt
);
4490 /* If OP0 is an SSA_NAME, then we want to walk the use-def chain
4491 to find its initialization. Hopefully the initialization will
4492 be from a bitfield load. */
4493 if (TREE_CODE (op0
) == SSA_NAME
)
4495 gimple op0stmt
= get_gimple_for_ssa_name (op0
);
4497 /* We want to eventually have OP0 be the same as TO, which
4498 should be a bitfield. */
4500 || !is_gimple_assign (op0stmt
)
4501 || gimple_assign_rhs_code (op0stmt
) != TREE_CODE (to
))
4503 op0
= gimple_assign_rhs1 (op0stmt
);
4506 op1
= gimple_assign_rhs2 (srcstmt
);
4508 if (!operand_equal_p (to
, op0
, 0))
4511 if (MEM_P (str_rtx
))
4513 unsigned HOST_WIDE_INT offset1
;
4515 if (str_bitsize
== 0 || str_bitsize
> BITS_PER_WORD
)
4516 str_mode
= word_mode
;
4517 str_mode
= get_best_mode (bitsize
, bitpos
,
4518 bitregion_start
, bitregion_end
,
4519 MEM_ALIGN (str_rtx
), str_mode
, 0);
4520 if (str_mode
== VOIDmode
)
4522 str_bitsize
= GET_MODE_BITSIZE (str_mode
);
4525 bitpos
%= str_bitsize
;
4526 offset1
= (offset1
- bitpos
) / BITS_PER_UNIT
;
4527 str_rtx
= adjust_address (str_rtx
, str_mode
, offset1
);
4529 else if (!REG_P (str_rtx
) && GET_CODE (str_rtx
) != SUBREG
)
4532 /* If the bit field covers the whole REG/MEM, store_field
4533 will likely generate better code. */
4534 if (bitsize
>= str_bitsize
)
4537 /* We can't handle fields split across multiple entities. */
4538 if (bitpos
+ bitsize
> str_bitsize
)
4541 if (BYTES_BIG_ENDIAN
)
4542 bitpos
= str_bitsize
- bitpos
- bitsize
;
4548 /* For now, just optimize the case of the topmost bitfield
4549 where we don't need to do any masking and also
4550 1 bit bitfields where xor can be used.
4551 We might win by one instruction for the other bitfields
4552 too if insv/extv instructions aren't used, so that
4553 can be added later. */
4554 if (bitpos
+ bitsize
!= str_bitsize
4555 && (bitsize
!= 1 || TREE_CODE (op1
) != INTEGER_CST
))
4558 value
= expand_expr (op1
, NULL_RTX
, str_mode
, EXPAND_NORMAL
);
4559 value
= convert_modes (str_mode
,
4560 TYPE_MODE (TREE_TYPE (op1
)), value
,
4561 TYPE_UNSIGNED (TREE_TYPE (op1
)));
4563 /* We may be accessing data outside the field, which means
4564 we can alias adjacent data. */
4565 if (MEM_P (str_rtx
))
4567 str_rtx
= shallow_copy_rtx (str_rtx
);
4568 set_mem_alias_set (str_rtx
, 0);
4569 set_mem_expr (str_rtx
, 0);
4572 binop
= code
== PLUS_EXPR
? add_optab
: sub_optab
;
4573 if (bitsize
== 1 && bitpos
+ bitsize
!= str_bitsize
)
4575 value
= expand_and (str_mode
, value
, const1_rtx
, NULL
);
4578 value
= expand_shift (LSHIFT_EXPR
, str_mode
, value
, bitpos
, NULL_RTX
, 1);
4579 result
= expand_binop (str_mode
, binop
, str_rtx
,
4580 value
, str_rtx
, 1, OPTAB_WIDEN
);
4581 if (result
!= str_rtx
)
4582 emit_move_insn (str_rtx
, result
);
4587 if (TREE_CODE (op1
) != INTEGER_CST
)
4589 value
= expand_expr (op1
, NULL_RTX
, str_mode
, EXPAND_NORMAL
);
4590 value
= convert_modes (str_mode
,
4591 TYPE_MODE (TREE_TYPE (op1
)), value
,
4592 TYPE_UNSIGNED (TREE_TYPE (op1
)));
4594 /* We may be accessing data outside the field, which means
4595 we can alias adjacent data. */
4596 if (MEM_P (str_rtx
))
4598 str_rtx
= shallow_copy_rtx (str_rtx
);
4599 set_mem_alias_set (str_rtx
, 0);
4600 set_mem_expr (str_rtx
, 0);
4603 binop
= code
== BIT_IOR_EXPR
? ior_optab
: xor_optab
;
4604 if (bitpos
+ bitsize
!= str_bitsize
)
4606 rtx mask
= gen_int_mode (((unsigned HOST_WIDE_INT
) 1 << bitsize
) - 1,
4608 value
= expand_and (str_mode
, value
, mask
, NULL_RTX
);
4610 value
= expand_shift (LSHIFT_EXPR
, str_mode
, value
, bitpos
, NULL_RTX
, 1);
4611 result
= expand_binop (str_mode
, binop
, str_rtx
,
4612 value
, str_rtx
, 1, OPTAB_WIDEN
);
4613 if (result
!= str_rtx
)
4614 emit_move_insn (str_rtx
, result
);
4624 /* In the C++ memory model, consecutive bit fields in a structure are
4625 considered one memory location.
4627 Given a COMPONENT_REF EXP at position (BITPOS, OFFSET), this function
4628 returns the bit range of consecutive bits in which this COMPONENT_REF
4629 belongs. The values are returned in *BITSTART and *BITEND. *BITPOS
4630 and *OFFSET may be adjusted in the process.
4632 If the access does not need to be restricted, 0 is returned in both
4633 *BITSTART and *BITEND. */
4636 get_bit_range (unsigned HOST_WIDE_INT
*bitstart
,
4637 unsigned HOST_WIDE_INT
*bitend
,
4639 HOST_WIDE_INT
*bitpos
,
4642 HOST_WIDE_INT bitoffset
;
4645 gcc_assert (TREE_CODE (exp
) == COMPONENT_REF
);
4647 field
= TREE_OPERAND (exp
, 1);
4648 repr
= DECL_BIT_FIELD_REPRESENTATIVE (field
);
4649 /* If we do not have a DECL_BIT_FIELD_REPRESENTATIVE there is no
4650 need to limit the range we can access. */
4653 *bitstart
= *bitend
= 0;
4657 /* If we have a DECL_BIT_FIELD_REPRESENTATIVE but the enclosing record is
4658 part of a larger bit field, then the representative does not serve any
4659 useful purpose. This can occur in Ada. */
4660 if (handled_component_p (TREE_OPERAND (exp
, 0)))
4662 enum machine_mode rmode
;
4663 HOST_WIDE_INT rbitsize
, rbitpos
;
4667 get_inner_reference (TREE_OPERAND (exp
, 0), &rbitsize
, &rbitpos
,
4668 &roffset
, &rmode
, &unsignedp
, &volatilep
, false);
4669 if ((rbitpos
% BITS_PER_UNIT
) != 0)
4671 *bitstart
= *bitend
= 0;
4676 /* Compute the adjustment to bitpos from the offset of the field
4677 relative to the representative. DECL_FIELD_OFFSET of field and
4678 repr are the same by construction if they are not constants,
4679 see finish_bitfield_layout. */
4680 if (tree_fits_uhwi_p (DECL_FIELD_OFFSET (field
))
4681 && tree_fits_uhwi_p (DECL_FIELD_OFFSET (repr
)))
4682 bitoffset
= (tree_to_uhwi (DECL_FIELD_OFFSET (field
))
4683 - tree_to_uhwi (DECL_FIELD_OFFSET (repr
))) * BITS_PER_UNIT
;
4686 bitoffset
+= (tree_to_uhwi (DECL_FIELD_BIT_OFFSET (field
))
4687 - tree_to_uhwi (DECL_FIELD_BIT_OFFSET (repr
)));
4689 /* If the adjustment is larger than bitpos, we would have a negative bit
4690 position for the lower bound and this may wreak havoc later. Adjust
4691 offset and bitpos to make the lower bound non-negative in that case. */
4692 if (bitoffset
> *bitpos
)
4694 HOST_WIDE_INT adjust
= bitoffset
- *bitpos
;
4695 gcc_assert ((adjust
% BITS_PER_UNIT
) == 0);
4698 if (*offset
== NULL_TREE
)
4699 *offset
= size_int (-adjust
/ BITS_PER_UNIT
);
4702 = size_binop (MINUS_EXPR
, *offset
, size_int (adjust
/ BITS_PER_UNIT
));
4706 *bitstart
= *bitpos
- bitoffset
;
4708 *bitend
= *bitstart
+ tree_to_uhwi (DECL_SIZE (repr
)) - 1;
4711 /* Returns true if ADDR is an ADDR_EXPR of a DECL that does not reside
4712 in memory and has non-BLKmode. DECL_RTL must not be a MEM; if
4713 DECL_RTL was not set yet, return NORTL. */
4716 addr_expr_of_non_mem_decl_p_1 (tree addr
, bool nortl
)
4718 if (TREE_CODE (addr
) != ADDR_EXPR
)
4721 tree base
= TREE_OPERAND (addr
, 0);
4724 || TREE_ADDRESSABLE (base
)
4725 || DECL_MODE (base
) == BLKmode
)
4728 if (!DECL_RTL_SET_P (base
))
4731 return (!MEM_P (DECL_RTL (base
)));
4734 /* Returns true if the MEM_REF REF refers to an object that does not
4735 reside in memory and has non-BLKmode. */
4738 mem_ref_refers_to_non_mem_p (tree ref
)
4740 tree base
= TREE_OPERAND (ref
, 0);
4741 return addr_expr_of_non_mem_decl_p_1 (base
, false);
4744 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4745 is true, try generating a nontemporal store. */
4748 expand_assignment (tree to
, tree from
, bool nontemporal
)
4752 enum machine_mode mode
;
4754 enum insn_code icode
;
4756 /* Don't crash if the lhs of the assignment was erroneous. */
4757 if (TREE_CODE (to
) == ERROR_MARK
)
4759 expand_normal (from
);
4763 /* Optimize away no-op moves without side-effects. */
4764 if (operand_equal_p (to
, from
, 0))
4767 /* Handle misaligned stores. */
4768 mode
= TYPE_MODE (TREE_TYPE (to
));
4769 if ((TREE_CODE (to
) == MEM_REF
4770 || TREE_CODE (to
) == TARGET_MEM_REF
)
4772 && !mem_ref_refers_to_non_mem_p (to
)
4773 && ((align
= get_object_alignment (to
))
4774 < GET_MODE_ALIGNMENT (mode
))
4775 && (((icode
= optab_handler (movmisalign_optab
, mode
))
4776 != CODE_FOR_nothing
)
4777 || SLOW_UNALIGNED_ACCESS (mode
, align
)))
4781 reg
= expand_expr (from
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
4782 reg
= force_not_mem (reg
);
4783 mem
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4785 if (icode
!= CODE_FOR_nothing
)
4787 struct expand_operand ops
[2];
4789 create_fixed_operand (&ops
[0], mem
);
4790 create_input_operand (&ops
[1], reg
, mode
);
4791 /* The movmisalign<mode> pattern cannot fail, else the assignment
4792 would silently be omitted. */
4793 expand_insn (icode
, 2, ops
);
4796 store_bit_field (mem
, GET_MODE_BITSIZE (mode
), 0, 0, 0, mode
, reg
);
4800 /* Assignment of a structure component needs special treatment
4801 if the structure component's rtx is not simply a MEM.
4802 Assignment of an array element at a constant index, and assignment of
4803 an array element in an unaligned packed structure field, has the same
4804 problem. Same for (partially) storing into a non-memory object. */
4805 if (handled_component_p (to
)
4806 || (TREE_CODE (to
) == MEM_REF
4807 && mem_ref_refers_to_non_mem_p (to
))
4808 || TREE_CODE (TREE_TYPE (to
)) == ARRAY_TYPE
)
4810 enum machine_mode mode1
;
4811 HOST_WIDE_INT bitsize
, bitpos
;
4812 unsigned HOST_WIDE_INT bitregion_start
= 0;
4813 unsigned HOST_WIDE_INT bitregion_end
= 0;
4820 tem
= get_inner_reference (to
, &bitsize
, &bitpos
, &offset
, &mode1
,
4821 &unsignedp
, &volatilep
, true);
4823 /* Make sure bitpos is not negative, it can wreak havoc later. */
4826 gcc_assert (offset
== NULL_TREE
);
4827 offset
= size_int (bitpos
>> (BITS_PER_UNIT
== 8
4828 ? 3 : exact_log2 (BITS_PER_UNIT
)));
4829 bitpos
&= BITS_PER_UNIT
- 1;
4832 if (TREE_CODE (to
) == COMPONENT_REF
4833 && DECL_BIT_FIELD_TYPE (TREE_OPERAND (to
, 1)))
4834 get_bit_range (&bitregion_start
, &bitregion_end
, to
, &bitpos
, &offset
);
4835 /* The C++ memory model naturally applies to byte-aligned fields.
4836 However, if we do not have a DECL_BIT_FIELD_TYPE but BITPOS or
4837 BITSIZE are not byte-aligned, there is no need to limit the range
4838 we can access. This can occur with packed structures in Ada. */
4839 else if (bitsize
> 0
4840 && bitsize
% BITS_PER_UNIT
== 0
4841 && bitpos
% BITS_PER_UNIT
== 0)
4843 bitregion_start
= bitpos
;
4844 bitregion_end
= bitpos
+ bitsize
- 1;
4847 to_rtx
= expand_expr (tem
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4849 /* If the field has a mode, we want to access it in the
4850 field's mode, not the computed mode.
4851 If a MEM has VOIDmode (external with incomplete type),
4852 use BLKmode for it instead. */
4855 if (mode1
!= VOIDmode
)
4856 to_rtx
= adjust_address (to_rtx
, mode1
, 0);
4857 else if (GET_MODE (to_rtx
) == VOIDmode
)
4858 to_rtx
= adjust_address (to_rtx
, BLKmode
, 0);
4863 enum machine_mode address_mode
;
4866 if (!MEM_P (to_rtx
))
4868 /* We can get constant negative offsets into arrays with broken
4869 user code. Translate this to a trap instead of ICEing. */
4870 gcc_assert (TREE_CODE (offset
) == INTEGER_CST
);
4871 expand_builtin_trap ();
4872 to_rtx
= gen_rtx_MEM (BLKmode
, const0_rtx
);
4875 offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
4876 address_mode
= get_address_mode (to_rtx
);
4877 if (GET_MODE (offset_rtx
) != address_mode
)
4878 offset_rtx
= convert_to_mode (address_mode
, offset_rtx
, 0);
4880 /* The check for a constant address in TO_RTX not having VOIDmode
4881 is probably no longer necessary. */
4883 && GET_MODE (to_rtx
) == BLKmode
4884 && GET_MODE (XEXP (to_rtx
, 0)) != VOIDmode
4886 && (bitpos
% bitsize
) == 0
4887 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
4888 && MEM_ALIGN (to_rtx
) == GET_MODE_ALIGNMENT (mode1
))
4890 to_rtx
= adjust_address (to_rtx
, mode1
, bitpos
/ BITS_PER_UNIT
);
4891 bitregion_start
= 0;
4892 if (bitregion_end
>= (unsigned HOST_WIDE_INT
) bitpos
)
4893 bitregion_end
-= bitpos
;
4897 to_rtx
= offset_address (to_rtx
, offset_rtx
,
4898 highest_pow2_factor_for_target (to
,
4902 /* No action is needed if the target is not a memory and the field
4903 lies completely outside that target. This can occur if the source
4904 code contains an out-of-bounds access to a small array. */
4906 && GET_MODE (to_rtx
) != BLKmode
4907 && (unsigned HOST_WIDE_INT
) bitpos
4908 >= GET_MODE_PRECISION (GET_MODE (to_rtx
)))
4910 expand_normal (from
);
4913 /* Handle expand_expr of a complex value returning a CONCAT. */
4914 else if (GET_CODE (to_rtx
) == CONCAT
)
4916 unsigned short mode_bitsize
= GET_MODE_BITSIZE (GET_MODE (to_rtx
));
4917 if (COMPLEX_MODE_P (TYPE_MODE (TREE_TYPE (from
)))
4919 && bitsize
== mode_bitsize
)
4920 result
= store_expr (from
, to_rtx
, false, nontemporal
);
4921 else if (bitsize
== mode_bitsize
/ 2
4922 && (bitpos
== 0 || bitpos
== mode_bitsize
/ 2))
4923 result
= store_expr (from
, XEXP (to_rtx
, bitpos
!= 0), false,
4925 else if (bitpos
+ bitsize
<= mode_bitsize
/ 2)
4926 result
= store_field (XEXP (to_rtx
, 0), bitsize
, bitpos
,
4927 bitregion_start
, bitregion_end
,
4929 get_alias_set (to
), nontemporal
);
4930 else if (bitpos
>= mode_bitsize
/ 2)
4931 result
= store_field (XEXP (to_rtx
, 1), bitsize
,
4932 bitpos
- mode_bitsize
/ 2,
4933 bitregion_start
, bitregion_end
,
4935 get_alias_set (to
), nontemporal
);
4936 else if (bitpos
== 0 && bitsize
== mode_bitsize
)
4939 result
= expand_normal (from
);
4940 from_rtx
= simplify_gen_subreg (GET_MODE (to_rtx
), result
,
4941 TYPE_MODE (TREE_TYPE (from
)), 0);
4942 emit_move_insn (XEXP (to_rtx
, 0),
4943 read_complex_part (from_rtx
, false));
4944 emit_move_insn (XEXP (to_rtx
, 1),
4945 read_complex_part (from_rtx
, true));
4949 rtx temp
= assign_stack_temp (GET_MODE (to_rtx
),
4950 GET_MODE_SIZE (GET_MODE (to_rtx
)));
4951 write_complex_part (temp
, XEXP (to_rtx
, 0), false);
4952 write_complex_part (temp
, XEXP (to_rtx
, 1), true);
4953 result
= store_field (temp
, bitsize
, bitpos
,
4954 bitregion_start
, bitregion_end
,
4956 get_alias_set (to
), nontemporal
);
4957 emit_move_insn (XEXP (to_rtx
, 0), read_complex_part (temp
, false));
4958 emit_move_insn (XEXP (to_rtx
, 1), read_complex_part (temp
, true));
4965 /* If the field is at offset zero, we could have been given the
4966 DECL_RTX of the parent struct. Don't munge it. */
4967 to_rtx
= shallow_copy_rtx (to_rtx
);
4968 set_mem_attributes_minus_bitpos (to_rtx
, to
, 0, bitpos
);
4970 MEM_VOLATILE_P (to_rtx
) = 1;
4973 if (optimize_bitfield_assignment_op (bitsize
, bitpos
,
4974 bitregion_start
, bitregion_end
,
4979 result
= store_field (to_rtx
, bitsize
, bitpos
,
4980 bitregion_start
, bitregion_end
,
4982 get_alias_set (to
), nontemporal
);
4986 preserve_temp_slots (result
);
4991 /* If the rhs is a function call and its value is not an aggregate,
4992 call the function before we start to compute the lhs.
4993 This is needed for correct code for cases such as
4994 val = setjmp (buf) on machines where reference to val
4995 requires loading up part of an address in a separate insn.
4997 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4998 since it might be a promoted variable where the zero- or sign- extension
4999 needs to be done. Handling this in the normal way is safe because no
5000 computation is done before the call. The same is true for SSA names. */
5001 if (TREE_CODE (from
) == CALL_EXPR
&& ! aggregate_value_p (from
, from
)
5002 && COMPLETE_TYPE_P (TREE_TYPE (from
))
5003 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from
))) == INTEGER_CST
5004 && ! (((TREE_CODE (to
) == VAR_DECL
5005 || TREE_CODE (to
) == PARM_DECL
5006 || TREE_CODE (to
) == RESULT_DECL
)
5007 && REG_P (DECL_RTL (to
)))
5008 || TREE_CODE (to
) == SSA_NAME
))
5013 value
= expand_normal (from
);
5015 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
5017 /* Handle calls that return values in multiple non-contiguous locations.
5018 The Irix 6 ABI has examples of this. */
5019 if (GET_CODE (to_rtx
) == PARALLEL
)
5021 if (GET_CODE (value
) == PARALLEL
)
5022 emit_group_move (to_rtx
, value
);
5024 emit_group_load (to_rtx
, value
, TREE_TYPE (from
),
5025 int_size_in_bytes (TREE_TYPE (from
)));
5027 else if (GET_CODE (value
) == PARALLEL
)
5028 emit_group_store (to_rtx
, value
, TREE_TYPE (from
),
5029 int_size_in_bytes (TREE_TYPE (from
)));
5030 else if (GET_MODE (to_rtx
) == BLKmode
)
5032 /* Handle calls that return BLKmode values in registers. */
5034 copy_blkmode_from_reg (to_rtx
, value
, TREE_TYPE (from
));
5036 emit_block_move (to_rtx
, value
, expr_size (from
), BLOCK_OP_NORMAL
);
5040 if (POINTER_TYPE_P (TREE_TYPE (to
)))
5041 value
= convert_memory_address_addr_space
5042 (GET_MODE (to_rtx
), value
,
5043 TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (to
))));
5045 emit_move_insn (to_rtx
, value
);
5047 preserve_temp_slots (to_rtx
);
5052 /* Ordinary treatment. Expand TO to get a REG or MEM rtx. */
5053 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
5055 /* Don't move directly into a return register. */
5056 if (TREE_CODE (to
) == RESULT_DECL
5057 && (REG_P (to_rtx
) || GET_CODE (to_rtx
) == PARALLEL
))
5063 /* If the source is itself a return value, it still is in a pseudo at
5064 this point so we can move it back to the return register directly. */
5066 && TYPE_MODE (TREE_TYPE (from
)) == BLKmode
5067 && TREE_CODE (from
) != CALL_EXPR
)
5068 temp
= copy_blkmode_to_reg (GET_MODE (to_rtx
), from
);
5070 temp
= expand_expr (from
, NULL_RTX
, GET_MODE (to_rtx
), EXPAND_NORMAL
);
5072 /* Handle calls that return values in multiple non-contiguous locations.
5073 The Irix 6 ABI has examples of this. */
5074 if (GET_CODE (to_rtx
) == PARALLEL
)
5076 if (GET_CODE (temp
) == PARALLEL
)
5077 emit_group_move (to_rtx
, temp
);
5079 emit_group_load (to_rtx
, temp
, TREE_TYPE (from
),
5080 int_size_in_bytes (TREE_TYPE (from
)));
5083 emit_move_insn (to_rtx
, temp
);
5085 preserve_temp_slots (to_rtx
);
5090 /* In case we are returning the contents of an object which overlaps
5091 the place the value is being stored, use a safe function when copying
5092 a value through a pointer into a structure value return block. */
5093 if (TREE_CODE (to
) == RESULT_DECL
5094 && TREE_CODE (from
) == INDIRECT_REF
5095 && ADDR_SPACE_GENERIC_P
5096 (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (from
, 0)))))
5097 && refs_may_alias_p (to
, from
)
5098 && cfun
->returns_struct
5099 && !cfun
->returns_pcc_struct
)
5104 size
= expr_size (from
);
5105 from_rtx
= expand_normal (from
);
5107 emit_library_call (memmove_libfunc
, LCT_NORMAL
,
5108 VOIDmode
, 3, XEXP (to_rtx
, 0), Pmode
,
5109 XEXP (from_rtx
, 0), Pmode
,
5110 convert_to_mode (TYPE_MODE (sizetype
),
5111 size
, TYPE_UNSIGNED (sizetype
)),
5112 TYPE_MODE (sizetype
));
5114 preserve_temp_slots (to_rtx
);
5119 /* Compute FROM and store the value in the rtx we got. */
5122 result
= store_expr (from
, to_rtx
, 0, nontemporal
);
5123 preserve_temp_slots (result
);
5128 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
5129 succeeded, false otherwise. */
5132 emit_storent_insn (rtx to
, rtx from
)
5134 struct expand_operand ops
[2];
5135 enum machine_mode mode
= GET_MODE (to
);
5136 enum insn_code code
= optab_handler (storent_optab
, mode
);
5138 if (code
== CODE_FOR_nothing
)
5141 create_fixed_operand (&ops
[0], to
);
5142 create_input_operand (&ops
[1], from
, mode
);
5143 return maybe_expand_insn (code
, 2, ops
);
5146 /* Generate code for computing expression EXP,
5147 and storing the value into TARGET.
5149 If the mode is BLKmode then we may return TARGET itself.
5150 It turns out that in BLKmode it doesn't cause a problem.
5151 because C has no operators that could combine two different
5152 assignments into the same BLKmode object with different values
5153 with no sequence point. Will other languages need this to
5156 If CALL_PARAM_P is nonzero, this is a store into a call param on the
5157 stack, and block moves may need to be treated specially.
5159 If NONTEMPORAL is true, try using a nontemporal store instruction. */
5162 store_expr (tree exp
, rtx target
, int call_param_p
, bool nontemporal
)
5165 rtx alt_rtl
= NULL_RTX
;
5166 location_t loc
= curr_insn_location ();
5168 if (VOID_TYPE_P (TREE_TYPE (exp
)))
5170 /* C++ can generate ?: expressions with a throw expression in one
5171 branch and an rvalue in the other. Here, we resolve attempts to
5172 store the throw expression's nonexistent result. */
5173 gcc_assert (!call_param_p
);
5174 expand_expr (exp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
5177 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
5179 /* Perform first part of compound expression, then assign from second
5181 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
5182 call_param_p
? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
5183 return store_expr (TREE_OPERAND (exp
, 1), target
, call_param_p
,
5186 else if (TREE_CODE (exp
) == COND_EXPR
&& GET_MODE (target
) == BLKmode
)
5188 /* For conditional expression, get safe form of the target. Then
5189 test the condition, doing the appropriate assignment on either
5190 side. This avoids the creation of unnecessary temporaries.
5191 For non-BLKmode, it is more efficient not to do this. */
5193 rtx lab1
= gen_label_rtx (), lab2
= gen_label_rtx ();
5195 do_pending_stack_adjust ();
5197 jumpifnot (TREE_OPERAND (exp
, 0), lab1
, -1);
5198 store_expr (TREE_OPERAND (exp
, 1), target
, call_param_p
,
5200 emit_jump_insn (gen_jump (lab2
));
5203 store_expr (TREE_OPERAND (exp
, 2), target
, call_param_p
,
5210 else if (GET_CODE (target
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (target
))
5211 /* If this is a scalar in a register that is stored in a wider mode
5212 than the declared mode, compute the result into its declared mode
5213 and then convert to the wider mode. Our value is the computed
5216 rtx inner_target
= 0;
5218 /* We can do the conversion inside EXP, which will often result
5219 in some optimizations. Do the conversion in two steps: first
5220 change the signedness, if needed, then the extend. But don't
5221 do this if the type of EXP is a subtype of something else
5222 since then the conversion might involve more than just
5223 converting modes. */
5224 if (INTEGRAL_TYPE_P (TREE_TYPE (exp
))
5225 && TREE_TYPE (TREE_TYPE (exp
)) == 0
5226 && GET_MODE_PRECISION (GET_MODE (target
))
5227 == TYPE_PRECISION (TREE_TYPE (exp
)))
5229 if (TYPE_UNSIGNED (TREE_TYPE (exp
))
5230 != SUBREG_PROMOTED_UNSIGNED_P (target
))
5232 /* Some types, e.g. Fortran's logical*4, won't have a signed
5233 version, so use the mode instead. */
5235 = (signed_or_unsigned_type_for
5236 (SUBREG_PROMOTED_UNSIGNED_P (target
), TREE_TYPE (exp
)));
5238 ntype
= lang_hooks
.types
.type_for_mode
5239 (TYPE_MODE (TREE_TYPE (exp
)),
5240 SUBREG_PROMOTED_UNSIGNED_P (target
));
5242 exp
= fold_convert_loc (loc
, ntype
, exp
);
5245 exp
= fold_convert_loc (loc
, lang_hooks
.types
.type_for_mode
5246 (GET_MODE (SUBREG_REG (target
)),
5247 SUBREG_PROMOTED_UNSIGNED_P (target
)),
5250 inner_target
= SUBREG_REG (target
);
5253 temp
= expand_expr (exp
, inner_target
, VOIDmode
,
5254 call_param_p
? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
5256 /* If TEMP is a VOIDmode constant, use convert_modes to make
5257 sure that we properly convert it. */
5258 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
)
5260 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
5261 temp
, SUBREG_PROMOTED_UNSIGNED_P (target
));
5262 temp
= convert_modes (GET_MODE (SUBREG_REG (target
)),
5263 GET_MODE (target
), temp
,
5264 SUBREG_PROMOTED_UNSIGNED_P (target
));
5267 convert_move (SUBREG_REG (target
), temp
,
5268 SUBREG_PROMOTED_UNSIGNED_P (target
));
5272 else if ((TREE_CODE (exp
) == STRING_CST
5273 || (TREE_CODE (exp
) == MEM_REF
5274 && TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
5275 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
5277 && integer_zerop (TREE_OPERAND (exp
, 1))))
5278 && !nontemporal
&& !call_param_p
5281 /* Optimize initialization of an array with a STRING_CST. */
5282 HOST_WIDE_INT exp_len
, str_copy_len
;
5284 tree str
= TREE_CODE (exp
) == STRING_CST
5285 ? exp
: TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
5287 exp_len
= int_expr_size (exp
);
5291 if (TREE_STRING_LENGTH (str
) <= 0)
5294 str_copy_len
= strlen (TREE_STRING_POINTER (str
));
5295 if (str_copy_len
< TREE_STRING_LENGTH (str
) - 1)
5298 str_copy_len
= TREE_STRING_LENGTH (str
);
5299 if ((STORE_MAX_PIECES
& (STORE_MAX_PIECES
- 1)) == 0
5300 && TREE_STRING_POINTER (str
)[TREE_STRING_LENGTH (str
) - 1] == '\0')
5302 str_copy_len
+= STORE_MAX_PIECES
- 1;
5303 str_copy_len
&= ~(STORE_MAX_PIECES
- 1);
5305 str_copy_len
= MIN (str_copy_len
, exp_len
);
5306 if (!can_store_by_pieces (str_copy_len
, builtin_strncpy_read_str
,
5307 CONST_CAST (char *, TREE_STRING_POINTER (str
)),
5308 MEM_ALIGN (target
), false))
5313 dest_mem
= store_by_pieces (dest_mem
,
5314 str_copy_len
, builtin_strncpy_read_str
,
5316 TREE_STRING_POINTER (str
)),
5317 MEM_ALIGN (target
), false,
5318 exp_len
> str_copy_len
? 1 : 0);
5319 if (exp_len
> str_copy_len
)
5320 clear_storage (adjust_address (dest_mem
, BLKmode
, 0),
5321 GEN_INT (exp_len
- str_copy_len
),
5330 /* If we want to use a nontemporal store, force the value to
5332 tmp_target
= nontemporal
? NULL_RTX
: target
;
5333 temp
= expand_expr_real (exp
, tmp_target
, GET_MODE (target
),
5335 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
),
5339 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
5340 the same as that of TARGET, adjust the constant. This is needed, for
5341 example, in case it is a CONST_DOUBLE and we want only a word-sized
5343 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
5344 && TREE_CODE (exp
) != ERROR_MARK
5345 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
5346 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
5347 temp
, TYPE_UNSIGNED (TREE_TYPE (exp
)));
5349 /* If value was not generated in the target, store it there.
5350 Convert the value to TARGET's type first if necessary and emit the
5351 pending incrementations that have been queued when expanding EXP.
5352 Note that we cannot emit the whole queue blindly because this will
5353 effectively disable the POST_INC optimization later.
5355 If TEMP and TARGET compare equal according to rtx_equal_p, but
5356 one or both of them are volatile memory refs, we have to distinguish
5358 - expand_expr has used TARGET. In this case, we must not generate
5359 another copy. This can be detected by TARGET being equal according
5361 - expand_expr has not used TARGET - that means that the source just
5362 happens to have the same RTX form. Since temp will have been created
5363 by expand_expr, it will compare unequal according to == .
5364 We must generate a copy in this case, to reach the correct number
5365 of volatile memory references. */
5367 if ((! rtx_equal_p (temp
, target
)
5368 || (temp
!= target
&& (side_effects_p (temp
)
5369 || side_effects_p (target
))))
5370 && TREE_CODE (exp
) != ERROR_MARK
5371 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
5372 but TARGET is not valid memory reference, TEMP will differ
5373 from TARGET although it is really the same location. */
5375 && rtx_equal_p (alt_rtl
, target
)
5376 && !side_effects_p (alt_rtl
)
5377 && !side_effects_p (target
))
5378 /* If there's nothing to copy, don't bother. Don't call
5379 expr_size unless necessary, because some front-ends (C++)
5380 expr_size-hook must not be given objects that are not
5381 supposed to be bit-copied or bit-initialized. */
5382 && expr_size (exp
) != const0_rtx
)
5384 if (GET_MODE (temp
) != GET_MODE (target
) && GET_MODE (temp
) != VOIDmode
)
5386 if (GET_MODE (target
) == BLKmode
)
5388 /* Handle calls that return BLKmode values in registers. */
5389 if (REG_P (temp
) && TREE_CODE (exp
) == CALL_EXPR
)
5390 copy_blkmode_from_reg (target
, temp
, TREE_TYPE (exp
));
5392 store_bit_field (target
,
5393 INTVAL (expr_size (exp
)) * BITS_PER_UNIT
,
5394 0, 0, 0, GET_MODE (temp
), temp
);
5397 convert_move (target
, temp
, TYPE_UNSIGNED (TREE_TYPE (exp
)));
5400 else if (GET_MODE (temp
) == BLKmode
&& TREE_CODE (exp
) == STRING_CST
)
5402 /* Handle copying a string constant into an array. The string
5403 constant may be shorter than the array. So copy just the string's
5404 actual length, and clear the rest. First get the size of the data
5405 type of the string, which is actually the size of the target. */
5406 rtx size
= expr_size (exp
);
5408 if (CONST_INT_P (size
)
5409 && INTVAL (size
) < TREE_STRING_LENGTH (exp
))
5410 emit_block_move (target
, temp
, size
,
5412 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
5415 enum machine_mode pointer_mode
5416 = targetm
.addr_space
.pointer_mode (MEM_ADDR_SPACE (target
));
5417 enum machine_mode address_mode
= get_address_mode (target
);
5419 /* Compute the size of the data to copy from the string. */
5421 = size_binop_loc (loc
, MIN_EXPR
,
5422 make_tree (sizetype
, size
),
5423 size_int (TREE_STRING_LENGTH (exp
)));
5425 = expand_expr (copy_size
, NULL_RTX
, VOIDmode
,
5427 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
));
5430 /* Copy that much. */
5431 copy_size_rtx
= convert_to_mode (pointer_mode
, copy_size_rtx
,
5432 TYPE_UNSIGNED (sizetype
));
5433 emit_block_move (target
, temp
, copy_size_rtx
,
5435 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
5437 /* Figure out how much is left in TARGET that we have to clear.
5438 Do all calculations in pointer_mode. */
5439 if (CONST_INT_P (copy_size_rtx
))
5441 size
= plus_constant (address_mode
, size
,
5442 -INTVAL (copy_size_rtx
));
5443 target
= adjust_address (target
, BLKmode
,
5444 INTVAL (copy_size_rtx
));
5448 size
= expand_binop (TYPE_MODE (sizetype
), sub_optab
, size
,
5449 copy_size_rtx
, NULL_RTX
, 0,
5452 if (GET_MODE (copy_size_rtx
) != address_mode
)
5453 copy_size_rtx
= convert_to_mode (address_mode
,
5455 TYPE_UNSIGNED (sizetype
));
5457 target
= offset_address (target
, copy_size_rtx
,
5458 highest_pow2_factor (copy_size
));
5459 label
= gen_label_rtx ();
5460 emit_cmp_and_jump_insns (size
, const0_rtx
, LT
, NULL_RTX
,
5461 GET_MODE (size
), 0, label
);
5464 if (size
!= const0_rtx
)
5465 clear_storage (target
, size
, BLOCK_OP_NORMAL
);
5471 /* Handle calls that return values in multiple non-contiguous locations.
5472 The Irix 6 ABI has examples of this. */
5473 else if (GET_CODE (target
) == PARALLEL
)
5475 if (GET_CODE (temp
) == PARALLEL
)
5476 emit_group_move (target
, temp
);
5478 emit_group_load (target
, temp
, TREE_TYPE (exp
),
5479 int_size_in_bytes (TREE_TYPE (exp
)));
5481 else if (GET_CODE (temp
) == PARALLEL
)
5482 emit_group_store (target
, temp
, TREE_TYPE (exp
),
5483 int_size_in_bytes (TREE_TYPE (exp
)));
5484 else if (GET_MODE (temp
) == BLKmode
)
5485 emit_block_move (target
, temp
, expr_size (exp
),
5487 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
5488 /* If we emit a nontemporal store, there is nothing else to do. */
5489 else if (nontemporal
&& emit_storent_insn (target
, temp
))
5493 temp
= force_operand (temp
, target
);
5495 emit_move_insn (target
, temp
);
5502 /* Return true if field F of structure TYPE is a flexible array. */
5505 flexible_array_member_p (const_tree f
, const_tree type
)
5510 return (DECL_CHAIN (f
) == NULL
5511 && TREE_CODE (tf
) == ARRAY_TYPE
5513 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf
))
5514 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf
)))
5515 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf
))
5516 && int_size_in_bytes (type
) >= 0);
5519 /* If FOR_CTOR_P, return the number of top-level elements that a constructor
5520 must have in order for it to completely initialize a value of type TYPE.
5521 Return -1 if the number isn't known.
5523 If !FOR_CTOR_P, return an estimate of the number of scalars in TYPE. */
5525 static HOST_WIDE_INT
5526 count_type_elements (const_tree type
, bool for_ctor_p
)
5528 switch (TREE_CODE (type
))
5534 nelts
= array_type_nelts (type
);
5535 if (nelts
&& tree_fits_uhwi_p (nelts
))
5537 unsigned HOST_WIDE_INT n
;
5539 n
= tree_to_uhwi (nelts
) + 1;
5540 if (n
== 0 || for_ctor_p
)
5543 return n
* count_type_elements (TREE_TYPE (type
), false);
5545 return for_ctor_p
? -1 : 1;
5550 unsigned HOST_WIDE_INT n
;
5554 for (f
= TYPE_FIELDS (type
); f
; f
= DECL_CHAIN (f
))
5555 if (TREE_CODE (f
) == FIELD_DECL
)
5558 n
+= count_type_elements (TREE_TYPE (f
), false);
5559 else if (!flexible_array_member_p (f
, type
))
5560 /* Don't count flexible arrays, which are not supposed
5561 to be initialized. */
5569 case QUAL_UNION_TYPE
:
5574 gcc_assert (!for_ctor_p
);
5575 /* Estimate the number of scalars in each field and pick the
5576 maximum. Other estimates would do instead; the idea is simply
5577 to make sure that the estimate is not sensitive to the ordering
5580 for (f
= TYPE_FIELDS (type
); f
; f
= DECL_CHAIN (f
))
5581 if (TREE_CODE (f
) == FIELD_DECL
)
5583 m
= count_type_elements (TREE_TYPE (f
), false);
5584 /* If the field doesn't span the whole union, add an extra
5585 scalar for the rest. */
5586 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (f
)),
5587 TYPE_SIZE (type
)) != 1)
5599 return TYPE_VECTOR_SUBPARTS (type
);
5603 case FIXED_POINT_TYPE
:
5608 case REFERENCE_TYPE
:
5624 /* Helper for categorize_ctor_elements. Identical interface. */
5627 categorize_ctor_elements_1 (const_tree ctor
, HOST_WIDE_INT
*p_nz_elts
,
5628 HOST_WIDE_INT
*p_init_elts
, bool *p_complete
)
5630 unsigned HOST_WIDE_INT idx
;
5631 HOST_WIDE_INT nz_elts
, init_elts
, num_fields
;
5632 tree value
, purpose
, elt_type
;
5634 /* Whether CTOR is a valid constant initializer, in accordance with what
5635 initializer_constant_valid_p does. If inferred from the constructor
5636 elements, true until proven otherwise. */
5637 bool const_from_elts_p
= constructor_static_from_elts_p (ctor
);
5638 bool const_p
= const_from_elts_p
? true : TREE_STATIC (ctor
);
5643 elt_type
= NULL_TREE
;
5645 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), idx
, purpose
, value
)
5647 HOST_WIDE_INT mult
= 1;
5649 if (purpose
&& TREE_CODE (purpose
) == RANGE_EXPR
)
5651 tree lo_index
= TREE_OPERAND (purpose
, 0);
5652 tree hi_index
= TREE_OPERAND (purpose
, 1);
5654 if (tree_fits_uhwi_p (lo_index
) && tree_fits_uhwi_p (hi_index
))
5655 mult
= (tree_to_uhwi (hi_index
)
5656 - tree_to_uhwi (lo_index
) + 1);
5659 elt_type
= TREE_TYPE (value
);
5661 switch (TREE_CODE (value
))
5665 HOST_WIDE_INT nz
= 0, ic
= 0;
5667 bool const_elt_p
= categorize_ctor_elements_1 (value
, &nz
, &ic
,
5670 nz_elts
+= mult
* nz
;
5671 init_elts
+= mult
* ic
;
5673 if (const_from_elts_p
&& const_p
)
5674 const_p
= const_elt_p
;
5681 if (!initializer_zerop (value
))
5687 nz_elts
+= mult
* TREE_STRING_LENGTH (value
);
5688 init_elts
+= mult
* TREE_STRING_LENGTH (value
);
5692 if (!initializer_zerop (TREE_REALPART (value
)))
5694 if (!initializer_zerop (TREE_IMAGPART (value
)))
5702 for (i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
5704 tree v
= VECTOR_CST_ELT (value
, i
);
5705 if (!initializer_zerop (v
))
5714 HOST_WIDE_INT tc
= count_type_elements (elt_type
, false);
5715 nz_elts
+= mult
* tc
;
5716 init_elts
+= mult
* tc
;
5718 if (const_from_elts_p
&& const_p
)
5719 const_p
= initializer_constant_valid_p (value
, elt_type
)
5726 if (*p_complete
&& !complete_ctor_at_level_p (TREE_TYPE (ctor
),
5727 num_fields
, elt_type
))
5728 *p_complete
= false;
5730 *p_nz_elts
+= nz_elts
;
5731 *p_init_elts
+= init_elts
;
5736 /* Examine CTOR to discover:
5737 * how many scalar fields are set to nonzero values,
5738 and place it in *P_NZ_ELTS;
5739 * how many scalar fields in total are in CTOR,
5740 and place it in *P_ELT_COUNT.
5741 * whether the constructor is complete -- in the sense that every
5742 meaningful byte is explicitly given a value --
5743 and place it in *P_COMPLETE.
5745 Return whether or not CTOR is a valid static constant initializer, the same
5746 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
5749 categorize_ctor_elements (const_tree ctor
, HOST_WIDE_INT
*p_nz_elts
,
5750 HOST_WIDE_INT
*p_init_elts
, bool *p_complete
)
5756 return categorize_ctor_elements_1 (ctor
, p_nz_elts
, p_init_elts
, p_complete
);
5759 /* TYPE is initialized by a constructor with NUM_ELTS elements, the last
5760 of which had type LAST_TYPE. Each element was itself a complete
5761 initializer, in the sense that every meaningful byte was explicitly
5762 given a value. Return true if the same is true for the constructor
5766 complete_ctor_at_level_p (const_tree type
, HOST_WIDE_INT num_elts
,
5767 const_tree last_type
)
5769 if (TREE_CODE (type
) == UNION_TYPE
5770 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
5775 gcc_assert (num_elts
== 1 && last_type
);
5777 /* ??? We could look at each element of the union, and find the
5778 largest element. Which would avoid comparing the size of the
5779 initialized element against any tail padding in the union.
5780 Doesn't seem worth the effort... */
5781 return simple_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (last_type
)) == 1;
5784 return count_type_elements (type
, true) == num_elts
;
5787 /* Return 1 if EXP contains mostly (3/4) zeros. */
5790 mostly_zeros_p (const_tree exp
)
5792 if (TREE_CODE (exp
) == CONSTRUCTOR
)
5794 HOST_WIDE_INT nz_elts
, init_elts
;
5797 categorize_ctor_elements (exp
, &nz_elts
, &init_elts
, &complete_p
);
5798 return !complete_p
|| nz_elts
< init_elts
/ 4;
5801 return initializer_zerop (exp
);
5804 /* Return 1 if EXP contains all zeros. */
5807 all_zeros_p (const_tree exp
)
5809 if (TREE_CODE (exp
) == CONSTRUCTOR
)
5811 HOST_WIDE_INT nz_elts
, init_elts
;
5814 categorize_ctor_elements (exp
, &nz_elts
, &init_elts
, &complete_p
);
5815 return nz_elts
== 0;
5818 return initializer_zerop (exp
);
5821 /* Helper function for store_constructor.
5822 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5823 CLEARED is as for store_constructor.
5824 ALIAS_SET is the alias set to use for any stores.
5826 This provides a recursive shortcut back to store_constructor when it isn't
5827 necessary to go through store_field. This is so that we can pass through
5828 the cleared field to let store_constructor know that we may not have to
5829 clear a substructure if the outer structure has already been cleared. */
5832 store_constructor_field (rtx target
, unsigned HOST_WIDE_INT bitsize
,
5833 HOST_WIDE_INT bitpos
, enum machine_mode mode
,
5834 tree exp
, int cleared
, alias_set_type alias_set
)
5836 if (TREE_CODE (exp
) == CONSTRUCTOR
5837 /* We can only call store_constructor recursively if the size and
5838 bit position are on a byte boundary. */
5839 && bitpos
% BITS_PER_UNIT
== 0
5840 && (bitsize
> 0 && bitsize
% BITS_PER_UNIT
== 0)
5841 /* If we have a nonzero bitpos for a register target, then we just
5842 let store_field do the bitfield handling. This is unlikely to
5843 generate unnecessary clear instructions anyways. */
5844 && (bitpos
== 0 || MEM_P (target
)))
5848 = adjust_address (target
,
5849 GET_MODE (target
) == BLKmode
5851 % GET_MODE_ALIGNMENT (GET_MODE (target
)))
5852 ? BLKmode
: VOIDmode
, bitpos
/ BITS_PER_UNIT
);
5855 /* Update the alias set, if required. */
5856 if (MEM_P (target
) && ! MEM_KEEP_ALIAS_SET_P (target
)
5857 && MEM_ALIAS_SET (target
) != 0)
5859 target
= copy_rtx (target
);
5860 set_mem_alias_set (target
, alias_set
);
5863 store_constructor (exp
, target
, cleared
, bitsize
/ BITS_PER_UNIT
);
5866 store_field (target
, bitsize
, bitpos
, 0, 0, mode
, exp
, alias_set
, false);
5870 /* Returns the number of FIELD_DECLs in TYPE. */
5873 fields_length (const_tree type
)
5875 tree t
= TYPE_FIELDS (type
);
5878 for (; t
; t
= DECL_CHAIN (t
))
5879 if (TREE_CODE (t
) == FIELD_DECL
)
5886 /* Store the value of constructor EXP into the rtx TARGET.
5887 TARGET is either a REG or a MEM; we know it cannot conflict, since
5888 safe_from_p has been called.
5889 CLEARED is true if TARGET is known to have been zero'd.
5890 SIZE is the number of bytes of TARGET we are allowed to modify: this
5891 may not be the same as the size of EXP if we are assigning to a field
5892 which has been packed to exclude padding bits. */
5895 store_constructor (tree exp
, rtx target
, int cleared
, HOST_WIDE_INT size
)
5897 tree type
= TREE_TYPE (exp
);
5898 #ifdef WORD_REGISTER_OPERATIONS
5899 HOST_WIDE_INT exp_size
= int_size_in_bytes (type
);
5902 switch (TREE_CODE (type
))
5906 case QUAL_UNION_TYPE
:
5908 unsigned HOST_WIDE_INT idx
;
5911 /* If size is zero or the target is already cleared, do nothing. */
5912 if (size
== 0 || cleared
)
5914 /* We either clear the aggregate or indicate the value is dead. */
5915 else if ((TREE_CODE (type
) == UNION_TYPE
5916 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
5917 && ! CONSTRUCTOR_ELTS (exp
))
5918 /* If the constructor is empty, clear the union. */
5920 clear_storage (target
, expr_size (exp
), BLOCK_OP_NORMAL
);
5924 /* If we are building a static constructor into a register,
5925 set the initial value as zero so we can fold the value into
5926 a constant. But if more than one register is involved,
5927 this probably loses. */
5928 else if (REG_P (target
) && TREE_STATIC (exp
)
5929 && GET_MODE_SIZE (GET_MODE (target
)) <= UNITS_PER_WORD
)
5931 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
5935 /* If the constructor has fewer fields than the structure or
5936 if we are initializing the structure to mostly zeros, clear
5937 the whole structure first. Don't do this if TARGET is a
5938 register whose mode size isn't equal to SIZE since
5939 clear_storage can't handle this case. */
5941 && (((int)vec_safe_length (CONSTRUCTOR_ELTS (exp
))
5942 != fields_length (type
))
5943 || mostly_zeros_p (exp
))
5945 || ((HOST_WIDE_INT
) GET_MODE_SIZE (GET_MODE (target
))
5948 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
5952 if (REG_P (target
) && !cleared
)
5953 emit_clobber (target
);
5955 /* Store each element of the constructor into the
5956 corresponding field of TARGET. */
5957 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), idx
, field
, value
)
5959 enum machine_mode mode
;
5960 HOST_WIDE_INT bitsize
;
5961 HOST_WIDE_INT bitpos
= 0;
5963 rtx to_rtx
= target
;
5965 /* Just ignore missing fields. We cleared the whole
5966 structure, above, if any fields are missing. */
5970 if (cleared
&& initializer_zerop (value
))
5973 if (tree_fits_uhwi_p (DECL_SIZE (field
)))
5974 bitsize
= tree_to_uhwi (DECL_SIZE (field
));
5978 mode
= DECL_MODE (field
);
5979 if (DECL_BIT_FIELD (field
))
5982 offset
= DECL_FIELD_OFFSET (field
);
5983 if (tree_fits_shwi_p (offset
)
5984 && tree_fits_shwi_p (bit_position (field
)))
5986 bitpos
= int_bit_position (field
);
5990 bitpos
= tree_to_shwi (DECL_FIELD_BIT_OFFSET (field
));
5994 enum machine_mode address_mode
;
5998 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset
,
5999 make_tree (TREE_TYPE (exp
),
6002 offset_rtx
= expand_normal (offset
);
6003 gcc_assert (MEM_P (to_rtx
));
6005 address_mode
= get_address_mode (to_rtx
);
6006 if (GET_MODE (offset_rtx
) != address_mode
)
6007 offset_rtx
= convert_to_mode (address_mode
, offset_rtx
, 0);
6009 to_rtx
= offset_address (to_rtx
, offset_rtx
,
6010 highest_pow2_factor (offset
));
6013 #ifdef WORD_REGISTER_OPERATIONS
6014 /* If this initializes a field that is smaller than a
6015 word, at the start of a word, try to widen it to a full
6016 word. This special case allows us to output C++ member
6017 function initializations in a form that the optimizers
6020 && bitsize
< BITS_PER_WORD
6021 && bitpos
% BITS_PER_WORD
== 0
6022 && GET_MODE_CLASS (mode
) == MODE_INT
6023 && TREE_CODE (value
) == INTEGER_CST
6025 && bitpos
+ BITS_PER_WORD
<= exp_size
* BITS_PER_UNIT
)
6027 tree type
= TREE_TYPE (value
);
6029 if (TYPE_PRECISION (type
) < BITS_PER_WORD
)
6031 type
= lang_hooks
.types
.type_for_mode
6032 (word_mode
, TYPE_UNSIGNED (type
));
6033 value
= fold_convert (type
, value
);
6036 if (BYTES_BIG_ENDIAN
)
6038 = fold_build2 (LSHIFT_EXPR
, type
, value
,
6039 build_int_cst (type
,
6040 BITS_PER_WORD
- bitsize
));
6041 bitsize
= BITS_PER_WORD
;
6046 if (MEM_P (to_rtx
) && !MEM_KEEP_ALIAS_SET_P (to_rtx
)
6047 && DECL_NONADDRESSABLE_P (field
))
6049 to_rtx
= copy_rtx (to_rtx
);
6050 MEM_KEEP_ALIAS_SET_P (to_rtx
) = 1;
6053 store_constructor_field (to_rtx
, bitsize
, bitpos
, mode
,
6055 get_alias_set (TREE_TYPE (field
)));
6062 unsigned HOST_WIDE_INT i
;
6065 tree elttype
= TREE_TYPE (type
);
6067 HOST_WIDE_INT minelt
= 0;
6068 HOST_WIDE_INT maxelt
= 0;
6070 domain
= TYPE_DOMAIN (type
);
6071 const_bounds_p
= (TYPE_MIN_VALUE (domain
)
6072 && TYPE_MAX_VALUE (domain
)
6073 && tree_fits_shwi_p (TYPE_MIN_VALUE (domain
))
6074 && tree_fits_shwi_p (TYPE_MAX_VALUE (domain
)));
6076 /* If we have constant bounds for the range of the type, get them. */
6079 minelt
= tree_to_shwi (TYPE_MIN_VALUE (domain
));
6080 maxelt
= tree_to_shwi (TYPE_MAX_VALUE (domain
));
6083 /* If the constructor has fewer elements than the array, clear
6084 the whole array first. Similarly if this is static
6085 constructor of a non-BLKmode object. */
6088 else if (REG_P (target
) && TREE_STATIC (exp
))
6092 unsigned HOST_WIDE_INT idx
;
6094 HOST_WIDE_INT count
= 0, zero_count
= 0;
6095 need_to_clear
= ! const_bounds_p
;
6097 /* This loop is a more accurate version of the loop in
6098 mostly_zeros_p (it handles RANGE_EXPR in an index). It
6099 is also needed to check for missing elements. */
6100 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), idx
, index
, value
)
6102 HOST_WIDE_INT this_node_count
;
6107 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
6109 tree lo_index
= TREE_OPERAND (index
, 0);
6110 tree hi_index
= TREE_OPERAND (index
, 1);
6112 if (! tree_fits_uhwi_p (lo_index
)
6113 || ! tree_fits_uhwi_p (hi_index
))
6119 this_node_count
= (tree_to_uhwi (hi_index
)
6120 - tree_to_uhwi (lo_index
) + 1);
6123 this_node_count
= 1;
6125 count
+= this_node_count
;
6126 if (mostly_zeros_p (value
))
6127 zero_count
+= this_node_count
;
6130 /* Clear the entire array first if there are any missing
6131 elements, or if the incidence of zero elements is >=
6134 && (count
< maxelt
- minelt
+ 1
6135 || 4 * zero_count
>= 3 * count
))
6139 if (need_to_clear
&& size
> 0)
6142 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
6144 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
6148 if (!cleared
&& REG_P (target
))
6149 /* Inform later passes that the old value is dead. */
6150 emit_clobber (target
);
6152 /* Store each element of the constructor into the
6153 corresponding element of TARGET, determined by counting the
6155 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), i
, index
, value
)
6157 enum machine_mode mode
;
6158 HOST_WIDE_INT bitsize
;
6159 HOST_WIDE_INT bitpos
;
6160 rtx xtarget
= target
;
6162 if (cleared
&& initializer_zerop (value
))
6165 mode
= TYPE_MODE (elttype
);
6166 if (mode
== BLKmode
)
6167 bitsize
= (tree_fits_uhwi_p (TYPE_SIZE (elttype
))
6168 ? tree_to_uhwi (TYPE_SIZE (elttype
))
6171 bitsize
= GET_MODE_BITSIZE (mode
);
6173 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
6175 tree lo_index
= TREE_OPERAND (index
, 0);
6176 tree hi_index
= TREE_OPERAND (index
, 1);
6177 rtx index_r
, pos_rtx
;
6178 HOST_WIDE_INT lo
, hi
, count
;
6181 /* If the range is constant and "small", unroll the loop. */
6183 && tree_fits_shwi_p (lo_index
)
6184 && tree_fits_shwi_p (hi_index
)
6185 && (lo
= tree_to_shwi (lo_index
),
6186 hi
= tree_to_shwi (hi_index
),
6187 count
= hi
- lo
+ 1,
6190 || (tree_fits_uhwi_p (TYPE_SIZE (elttype
))
6191 && (tree_to_uhwi (TYPE_SIZE (elttype
)) * count
6194 lo
-= minelt
; hi
-= minelt
;
6195 for (; lo
<= hi
; lo
++)
6197 bitpos
= lo
* tree_to_shwi (TYPE_SIZE (elttype
));
6200 && !MEM_KEEP_ALIAS_SET_P (target
)
6201 && TREE_CODE (type
) == ARRAY_TYPE
6202 && TYPE_NONALIASED_COMPONENT (type
))
6204 target
= copy_rtx (target
);
6205 MEM_KEEP_ALIAS_SET_P (target
) = 1;
6208 store_constructor_field
6209 (target
, bitsize
, bitpos
, mode
, value
, cleared
,
6210 get_alias_set (elttype
));
6215 rtx loop_start
= gen_label_rtx ();
6216 rtx loop_end
= gen_label_rtx ();
6219 expand_normal (hi_index
);
6221 index
= build_decl (EXPR_LOCATION (exp
),
6222 VAR_DECL
, NULL_TREE
, domain
);
6223 index_r
= gen_reg_rtx (promote_decl_mode (index
, NULL
));
6224 SET_DECL_RTL (index
, index_r
);
6225 store_expr (lo_index
, index_r
, 0, false);
6227 /* Build the head of the loop. */
6228 do_pending_stack_adjust ();
6229 emit_label (loop_start
);
6231 /* Assign value to element index. */
6233 fold_convert (ssizetype
,
6234 fold_build2 (MINUS_EXPR
,
6237 TYPE_MIN_VALUE (domain
)));
6240 size_binop (MULT_EXPR
, position
,
6241 fold_convert (ssizetype
,
6242 TYPE_SIZE_UNIT (elttype
)));
6244 pos_rtx
= expand_normal (position
);
6245 xtarget
= offset_address (target
, pos_rtx
,
6246 highest_pow2_factor (position
));
6247 xtarget
= adjust_address (xtarget
, mode
, 0);
6248 if (TREE_CODE (value
) == CONSTRUCTOR
)
6249 store_constructor (value
, xtarget
, cleared
,
6250 bitsize
/ BITS_PER_UNIT
);
6252 store_expr (value
, xtarget
, 0, false);
6254 /* Generate a conditional jump to exit the loop. */
6255 exit_cond
= build2 (LT_EXPR
, integer_type_node
,
6257 jumpif (exit_cond
, loop_end
, -1);
6259 /* Update the loop counter, and jump to the head of
6261 expand_assignment (index
,
6262 build2 (PLUS_EXPR
, TREE_TYPE (index
),
6263 index
, integer_one_node
),
6266 emit_jump (loop_start
);
6268 /* Build the end of the loop. */
6269 emit_label (loop_end
);
6272 else if ((index
!= 0 && ! tree_fits_shwi_p (index
))
6273 || ! tree_fits_uhwi_p (TYPE_SIZE (elttype
)))
6278 index
= ssize_int (1);
6281 index
= fold_convert (ssizetype
,
6282 fold_build2 (MINUS_EXPR
,
6285 TYPE_MIN_VALUE (domain
)));
6288 size_binop (MULT_EXPR
, index
,
6289 fold_convert (ssizetype
,
6290 TYPE_SIZE_UNIT (elttype
)));
6291 xtarget
= offset_address (target
,
6292 expand_normal (position
),
6293 highest_pow2_factor (position
));
6294 xtarget
= adjust_address (xtarget
, mode
, 0);
6295 store_expr (value
, xtarget
, 0, false);
6300 bitpos
= ((tree_to_shwi (index
) - minelt
)
6301 * tree_to_uhwi (TYPE_SIZE (elttype
)));
6303 bitpos
= (i
* tree_to_uhwi (TYPE_SIZE (elttype
)));
6305 if (MEM_P (target
) && !MEM_KEEP_ALIAS_SET_P (target
)
6306 && TREE_CODE (type
) == ARRAY_TYPE
6307 && TYPE_NONALIASED_COMPONENT (type
))
6309 target
= copy_rtx (target
);
6310 MEM_KEEP_ALIAS_SET_P (target
) = 1;
6312 store_constructor_field (target
, bitsize
, bitpos
, mode
, value
,
6313 cleared
, get_alias_set (elttype
));
6321 unsigned HOST_WIDE_INT idx
;
6322 constructor_elt
*ce
;
6325 int icode
= CODE_FOR_nothing
;
6326 tree elttype
= TREE_TYPE (type
);
6327 int elt_size
= tree_to_uhwi (TYPE_SIZE (elttype
));
6328 enum machine_mode eltmode
= TYPE_MODE (elttype
);
6329 HOST_WIDE_INT bitsize
;
6330 HOST_WIDE_INT bitpos
;
6331 rtvec vector
= NULL
;
6333 alias_set_type alias
;
6335 gcc_assert (eltmode
!= BLKmode
);
6337 n_elts
= TYPE_VECTOR_SUBPARTS (type
);
6338 if (REG_P (target
) && VECTOR_MODE_P (GET_MODE (target
)))
6340 enum machine_mode mode
= GET_MODE (target
);
6342 icode
= (int) optab_handler (vec_init_optab
, mode
);
6343 /* Don't use vec_init<mode> if some elements have VECTOR_TYPE. */
6344 if (icode
!= CODE_FOR_nothing
)
6348 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
6349 if (TREE_CODE (TREE_TYPE (value
)) == VECTOR_TYPE
)
6351 icode
= CODE_FOR_nothing
;
6355 if (icode
!= CODE_FOR_nothing
)
6359 vector
= rtvec_alloc (n_elts
);
6360 for (i
= 0; i
< n_elts
; i
++)
6361 RTVEC_ELT (vector
, i
) = CONST0_RTX (GET_MODE_INNER (mode
));
6365 /* If the constructor has fewer elements than the vector,
6366 clear the whole array first. Similarly if this is static
6367 constructor of a non-BLKmode object. */
6370 else if (REG_P (target
) && TREE_STATIC (exp
))
6374 unsigned HOST_WIDE_INT count
= 0, zero_count
= 0;
6377 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
6379 int n_elts_here
= tree_to_uhwi
6380 (int_const_binop (TRUNC_DIV_EXPR
,
6381 TYPE_SIZE (TREE_TYPE (value
)),
6382 TYPE_SIZE (elttype
)));
6384 count
+= n_elts_here
;
6385 if (mostly_zeros_p (value
))
6386 zero_count
+= n_elts_here
;
6389 /* Clear the entire vector first if there are any missing elements,
6390 or if the incidence of zero elements is >= 75%. */
6391 need_to_clear
= (count
< n_elts
|| 4 * zero_count
>= 3 * count
);
6394 if (need_to_clear
&& size
> 0 && !vector
)
6397 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
6399 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
6403 /* Inform later passes that the old value is dead. */
6404 if (!cleared
&& !vector
&& REG_P (target
))
6405 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
6408 alias
= MEM_ALIAS_SET (target
);
6410 alias
= get_alias_set (elttype
);
6412 /* Store each element of the constructor into the corresponding
6413 element of TARGET, determined by counting the elements. */
6414 for (idx
= 0, i
= 0;
6415 vec_safe_iterate (CONSTRUCTOR_ELTS (exp
), idx
, &ce
);
6416 idx
++, i
+= bitsize
/ elt_size
)
6418 HOST_WIDE_INT eltpos
;
6419 tree value
= ce
->value
;
6421 bitsize
= tree_to_uhwi (TYPE_SIZE (TREE_TYPE (value
)));
6422 if (cleared
&& initializer_zerop (value
))
6426 eltpos
= tree_to_uhwi (ce
->index
);
6432 /* vec_init<mode> should not be used if there are VECTOR_TYPE
6434 gcc_assert (TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
);
6435 RTVEC_ELT (vector
, eltpos
)
6436 = expand_normal (value
);
6440 enum machine_mode value_mode
=
6441 TREE_CODE (TREE_TYPE (value
)) == VECTOR_TYPE
6442 ? TYPE_MODE (TREE_TYPE (value
))
6444 bitpos
= eltpos
* elt_size
;
6445 store_constructor_field (target
, bitsize
, bitpos
, value_mode
,
6446 value
, cleared
, alias
);
6451 emit_insn (GEN_FCN (icode
)
6453 gen_rtx_PARALLEL (GET_MODE (target
), vector
)));
6462 /* Store the value of EXP (an expression tree)
6463 into a subfield of TARGET which has mode MODE and occupies
6464 BITSIZE bits, starting BITPOS bits from the start of TARGET.
6465 If MODE is VOIDmode, it means that we are storing into a bit-field.
6467 BITREGION_START is bitpos of the first bitfield in this region.
6468 BITREGION_END is the bitpos of the ending bitfield in this region.
6469 These two fields are 0, if the C++ memory model does not apply,
6470 or we are not interested in keeping track of bitfield regions.
6472 Always return const0_rtx unless we have something particular to
6475 ALIAS_SET is the alias set for the destination. This value will
6476 (in general) be different from that for TARGET, since TARGET is a
6477 reference to the containing structure.
6479 If NONTEMPORAL is true, try generating a nontemporal store. */
6482 store_field (rtx target
, HOST_WIDE_INT bitsize
, HOST_WIDE_INT bitpos
,
6483 unsigned HOST_WIDE_INT bitregion_start
,
6484 unsigned HOST_WIDE_INT bitregion_end
,
6485 enum machine_mode mode
, tree exp
,
6486 alias_set_type alias_set
, bool nontemporal
)
6488 if (TREE_CODE (exp
) == ERROR_MARK
)
6491 /* If we have nothing to store, do nothing unless the expression has
6494 return expand_expr (exp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
6496 if (GET_CODE (target
) == CONCAT
)
6498 /* We're storing into a struct containing a single __complex. */
6500 gcc_assert (!bitpos
);
6501 return store_expr (exp
, target
, 0, nontemporal
);
6504 /* If the structure is in a register or if the component
6505 is a bit field, we cannot use addressing to access it.
6506 Use bit-field techniques or SUBREG to store in it. */
6508 if (mode
== VOIDmode
6509 || (mode
!= BLKmode
&& ! direct_store
[(int) mode
]
6510 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
6511 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
)
6513 || GET_CODE (target
) == SUBREG
6514 /* If the field isn't aligned enough to store as an ordinary memref,
6515 store it as a bit field. */
6517 && ((((MEM_ALIGN (target
) < GET_MODE_ALIGNMENT (mode
))
6518 || bitpos
% GET_MODE_ALIGNMENT (mode
))
6519 && SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (target
)))
6520 || (bitpos
% BITS_PER_UNIT
!= 0)))
6521 || (bitsize
>= 0 && mode
!= BLKmode
6522 && GET_MODE_BITSIZE (mode
) > bitsize
)
6523 /* If the RHS and field are a constant size and the size of the
6524 RHS isn't the same size as the bitfield, we must use bitfield
6527 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
6528 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)), bitsize
) != 0)
6529 /* If we are expanding a MEM_REF of a non-BLKmode non-addressable
6530 decl we must use bitfield operations. */
6532 && TREE_CODE (exp
) == MEM_REF
6533 && TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
6534 && DECL_P (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
6535 && !TREE_ADDRESSABLE (TREE_OPERAND (TREE_OPERAND (exp
, 0),0 ))
6536 && DECL_MODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)) != BLKmode
))
6541 /* If EXP is a NOP_EXPR of precision less than its mode, then that
6542 implies a mask operation. If the precision is the same size as
6543 the field we're storing into, that mask is redundant. This is
6544 particularly common with bit field assignments generated by the
6546 nop_def
= get_def_for_expr (exp
, NOP_EXPR
);
6549 tree type
= TREE_TYPE (exp
);
6550 if (INTEGRAL_TYPE_P (type
)
6551 && TYPE_PRECISION (type
) < GET_MODE_BITSIZE (TYPE_MODE (type
))
6552 && bitsize
== TYPE_PRECISION (type
))
6554 tree op
= gimple_assign_rhs1 (nop_def
);
6555 type
= TREE_TYPE (op
);
6556 if (INTEGRAL_TYPE_P (type
) && TYPE_PRECISION (type
) >= bitsize
)
6561 temp
= expand_normal (exp
);
6563 /* If BITSIZE is narrower than the size of the type of EXP
6564 we will be narrowing TEMP. Normally, what's wanted are the
6565 low-order bits. However, if EXP's type is a record and this is
6566 big-endian machine, we want the upper BITSIZE bits. */
6567 if (BYTES_BIG_ENDIAN
&& GET_MODE_CLASS (GET_MODE (temp
)) == MODE_INT
6568 && bitsize
< (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (temp
))
6569 && TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
6570 temp
= expand_shift (RSHIFT_EXPR
, GET_MODE (temp
), temp
,
6571 GET_MODE_BITSIZE (GET_MODE (temp
)) - bitsize
,
6574 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to MODE. */
6575 if (mode
!= VOIDmode
&& mode
!= BLKmode
6576 && mode
!= TYPE_MODE (TREE_TYPE (exp
)))
6577 temp
= convert_modes (mode
, TYPE_MODE (TREE_TYPE (exp
)), temp
, 1);
6579 /* If the modes of TEMP and TARGET are both BLKmode, both
6580 must be in memory and BITPOS must be aligned on a byte
6581 boundary. If so, we simply do a block copy. Likewise
6582 for a BLKmode-like TARGET. */
6583 if (GET_MODE (temp
) == BLKmode
6584 && (GET_MODE (target
) == BLKmode
6586 && GET_MODE_CLASS (GET_MODE (target
)) == MODE_INT
6587 && (bitpos
% BITS_PER_UNIT
) == 0
6588 && (bitsize
% BITS_PER_UNIT
) == 0)))
6590 gcc_assert (MEM_P (target
) && MEM_P (temp
)
6591 && (bitpos
% BITS_PER_UNIT
) == 0);
6593 target
= adjust_address (target
, VOIDmode
, bitpos
/ BITS_PER_UNIT
);
6594 emit_block_move (target
, temp
,
6595 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
6602 /* Handle calls that return values in multiple non-contiguous locations.
6603 The Irix 6 ABI has examples of this. */
6604 if (GET_CODE (temp
) == PARALLEL
)
6606 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
6608 if (mode
== BLKmode
|| mode
== VOIDmode
)
6609 mode
= smallest_mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
);
6610 temp_target
= gen_reg_rtx (mode
);
6611 emit_group_store (temp_target
, temp
, TREE_TYPE (exp
), size
);
6614 else if (mode
== BLKmode
)
6616 /* Handle calls that return BLKmode values in registers. */
6617 if (REG_P (temp
) && TREE_CODE (exp
) == CALL_EXPR
)
6619 rtx temp_target
= gen_reg_rtx (GET_MODE (temp
));
6620 copy_blkmode_from_reg (temp_target
, temp
, TREE_TYPE (exp
));
6625 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
6627 mode
= smallest_mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
);
6628 temp_target
= gen_reg_rtx (mode
);
6630 = extract_bit_field (temp
, size
* BITS_PER_UNIT
, 0, 1,
6631 temp_target
, mode
, mode
);
6636 /* Store the value in the bitfield. */
6637 store_bit_field (target
, bitsize
, bitpos
,
6638 bitregion_start
, bitregion_end
,
6645 /* Now build a reference to just the desired component. */
6646 rtx to_rtx
= adjust_address (target
, mode
, bitpos
/ BITS_PER_UNIT
);
6648 if (to_rtx
== target
)
6649 to_rtx
= copy_rtx (to_rtx
);
6651 if (!MEM_KEEP_ALIAS_SET_P (to_rtx
) && MEM_ALIAS_SET (to_rtx
) != 0)
6652 set_mem_alias_set (to_rtx
, alias_set
);
6654 return store_expr (exp
, to_rtx
, 0, nontemporal
);
6658 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
6659 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
6660 codes and find the ultimate containing object, which we return.
6662 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
6663 bit position, and *PUNSIGNEDP to the signedness of the field.
6664 If the position of the field is variable, we store a tree
6665 giving the variable offset (in units) in *POFFSET.
6666 This offset is in addition to the bit position.
6667 If the position is not variable, we store 0 in *POFFSET.
6669 If any of the extraction expressions is volatile,
6670 we store 1 in *PVOLATILEP. Otherwise we don't change that.
6672 If the field is a non-BLKmode bit-field, *PMODE is set to VOIDmode.
6673 Otherwise, it is a mode that can be used to access the field.
6675 If the field describes a variable-sized object, *PMODE is set to
6676 BLKmode and *PBITSIZE is set to -1. An access cannot be made in
6677 this case, but the address of the object can be found.
6679 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
6680 look through nodes that serve as markers of a greater alignment than
6681 the one that can be deduced from the expression. These nodes make it
6682 possible for front-ends to prevent temporaries from being created by
6683 the middle-end on alignment considerations. For that purpose, the
6684 normal operating mode at high-level is to always pass FALSE so that
6685 the ultimate containing object is really returned; moreover, the
6686 associated predicate handled_component_p will always return TRUE
6687 on these nodes, thus indicating that they are essentially handled
6688 by get_inner_reference. TRUE should only be passed when the caller
6689 is scanning the expression in order to build another representation
6690 and specifically knows how to handle these nodes; as such, this is
6691 the normal operating mode in the RTL expanders. */
6694 get_inner_reference (tree exp
, HOST_WIDE_INT
*pbitsize
,
6695 HOST_WIDE_INT
*pbitpos
, tree
*poffset
,
6696 enum machine_mode
*pmode
, int *punsignedp
,
6697 int *pvolatilep
, bool keep_aligning
)
6700 enum machine_mode mode
= VOIDmode
;
6701 bool blkmode_bitfield
= false;
6702 tree offset
= size_zero_node
;
6703 double_int bit_offset
= double_int_zero
;
6705 /* First get the mode, signedness, and size. We do this from just the
6706 outermost expression. */
6708 if (TREE_CODE (exp
) == COMPONENT_REF
)
6710 tree field
= TREE_OPERAND (exp
, 1);
6711 size_tree
= DECL_SIZE (field
);
6712 if (flag_strict_volatile_bitfields
> 0
6713 && TREE_THIS_VOLATILE (exp
)
6714 && DECL_BIT_FIELD_TYPE (field
)
6715 && DECL_MODE (field
) != BLKmode
)
6716 /* Volatile bitfields should be accessed in the mode of the
6717 field's type, not the mode computed based on the bit
6719 mode
= TYPE_MODE (DECL_BIT_FIELD_TYPE (field
));
6720 else if (!DECL_BIT_FIELD (field
))
6721 mode
= DECL_MODE (field
);
6722 else if (DECL_MODE (field
) == BLKmode
)
6723 blkmode_bitfield
= true;
6725 *punsignedp
= DECL_UNSIGNED (field
);
6727 else if (TREE_CODE (exp
) == BIT_FIELD_REF
)
6729 size_tree
= TREE_OPERAND (exp
, 1);
6730 *punsignedp
= (! INTEGRAL_TYPE_P (TREE_TYPE (exp
))
6731 || TYPE_UNSIGNED (TREE_TYPE (exp
)));
6733 /* For vector types, with the correct size of access, use the mode of
6735 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == VECTOR_TYPE
6736 && TREE_TYPE (exp
) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)))
6737 && tree_int_cst_equal (size_tree
, TYPE_SIZE (TREE_TYPE (exp
))))
6738 mode
= TYPE_MODE (TREE_TYPE (exp
));
6742 mode
= TYPE_MODE (TREE_TYPE (exp
));
6743 *punsignedp
= TYPE_UNSIGNED (TREE_TYPE (exp
));
6745 if (mode
== BLKmode
)
6746 size_tree
= TYPE_SIZE (TREE_TYPE (exp
));
6748 *pbitsize
= GET_MODE_BITSIZE (mode
);
6753 if (! tree_fits_uhwi_p (size_tree
))
6754 mode
= BLKmode
, *pbitsize
= -1;
6756 *pbitsize
= tree_to_uhwi (size_tree
);
6759 /* Compute cumulative bit-offset for nested component-refs and array-refs,
6760 and find the ultimate containing object. */
6763 switch (TREE_CODE (exp
))
6766 bit_offset
+= tree_to_double_int (TREE_OPERAND (exp
, 2));
6771 tree field
= TREE_OPERAND (exp
, 1);
6772 tree this_offset
= component_ref_field_offset (exp
);
6774 /* If this field hasn't been filled in yet, don't go past it.
6775 This should only happen when folding expressions made during
6776 type construction. */
6777 if (this_offset
== 0)
6780 offset
= size_binop (PLUS_EXPR
, offset
, this_offset
);
6781 bit_offset
+= tree_to_double_int (DECL_FIELD_BIT_OFFSET (field
));
6783 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
6788 case ARRAY_RANGE_REF
:
6790 tree index
= TREE_OPERAND (exp
, 1);
6791 tree low_bound
= array_ref_low_bound (exp
);
6792 tree unit_size
= array_ref_element_size (exp
);
6794 /* We assume all arrays have sizes that are a multiple of a byte.
6795 First subtract the lower bound, if any, in the type of the
6796 index, then convert to sizetype and multiply by the size of
6797 the array element. */
6798 if (! integer_zerop (low_bound
))
6799 index
= fold_build2 (MINUS_EXPR
, TREE_TYPE (index
),
6802 offset
= size_binop (PLUS_EXPR
, offset
,
6803 size_binop (MULT_EXPR
,
6804 fold_convert (sizetype
, index
),
6813 bit_offset
+= double_int::from_uhwi (*pbitsize
);
6816 case VIEW_CONVERT_EXPR
:
6817 if (keep_aligning
&& STRICT_ALIGNMENT
6818 && (TYPE_ALIGN (TREE_TYPE (exp
))
6819 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp
, 0))))
6820 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp
, 0)))
6821 < BIGGEST_ALIGNMENT
)
6822 && (TYPE_ALIGN_OK (TREE_TYPE (exp
))
6823 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp
, 0)))))
6828 /* Hand back the decl for MEM[&decl, off]. */
6829 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
)
6831 tree off
= TREE_OPERAND (exp
, 1);
6832 if (!integer_zerop (off
))
6834 double_int boff
, coff
= mem_ref_offset (exp
);
6835 boff
= coff
.lshift (BITS_PER_UNIT
== 8
6836 ? 3 : exact_log2 (BITS_PER_UNIT
));
6839 exp
= TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
6847 /* If any reference in the chain is volatile, the effect is volatile. */
6848 if (TREE_THIS_VOLATILE (exp
))
6851 exp
= TREE_OPERAND (exp
, 0);
6855 /* If OFFSET is constant, see if we can return the whole thing as a
6856 constant bit position. Make sure to handle overflow during
6858 if (TREE_CODE (offset
) == INTEGER_CST
)
6860 double_int tem
= tree_to_double_int (offset
);
6861 tem
= tem
.sext (TYPE_PRECISION (sizetype
));
6862 tem
= tem
.lshift (BITS_PER_UNIT
== 8 ? 3 : exact_log2 (BITS_PER_UNIT
));
6864 if (tem
.fits_shwi ())
6866 *pbitpos
= tem
.to_shwi ();
6867 *poffset
= offset
= NULL_TREE
;
6871 /* Otherwise, split it up. */
6874 /* Avoid returning a negative bitpos as this may wreak havoc later. */
6875 if (bit_offset
.is_negative ())
6878 = double_int::mask (BITS_PER_UNIT
== 8
6879 ? 3 : exact_log2 (BITS_PER_UNIT
));
6880 double_int tem
= bit_offset
.and_not (mask
);
6881 /* TEM is the bitpos rounded to BITS_PER_UNIT towards -Inf.
6882 Subtract it to BIT_OFFSET and add it (scaled) to OFFSET. */
6884 tem
= tem
.arshift (BITS_PER_UNIT
== 8
6885 ? 3 : exact_log2 (BITS_PER_UNIT
),
6886 HOST_BITS_PER_DOUBLE_INT
);
6887 offset
= size_binop (PLUS_EXPR
, offset
,
6888 double_int_to_tree (sizetype
, tem
));
6891 *pbitpos
= bit_offset
.to_shwi ();
6895 /* We can use BLKmode for a byte-aligned BLKmode bitfield. */
6896 if (mode
== VOIDmode
6898 && (*pbitpos
% BITS_PER_UNIT
) == 0
6899 && (*pbitsize
% BITS_PER_UNIT
) == 0)
6907 /* Return a tree of sizetype representing the size, in bytes, of the element
6908 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6911 array_ref_element_size (tree exp
)
6913 tree aligned_size
= TREE_OPERAND (exp
, 3);
6914 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6915 location_t loc
= EXPR_LOCATION (exp
);
6917 /* If a size was specified in the ARRAY_REF, it's the size measured
6918 in alignment units of the element type. So multiply by that value. */
6921 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6922 sizetype from another type of the same width and signedness. */
6923 if (TREE_TYPE (aligned_size
) != sizetype
)
6924 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
6925 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
6926 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
6929 /* Otherwise, take the size from that of the element type. Substitute
6930 any PLACEHOLDER_EXPR that we have. */
6932 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
6935 /* Return a tree representing the lower bound of the array mentioned in
6936 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6939 array_ref_low_bound (tree exp
)
6941 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6943 /* If a lower bound is specified in EXP, use it. */
6944 if (TREE_OPERAND (exp
, 2))
6945 return TREE_OPERAND (exp
, 2);
6947 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6948 substituting for a PLACEHOLDER_EXPR as needed. */
6949 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
6950 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
6952 /* Otherwise, return a zero of the appropriate type. */
6953 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
6956 /* Returns true if REF is an array reference to an array at the end of
6957 a structure. If this is the case, the array may be allocated larger
6958 than its upper bound implies. */
6961 array_at_struct_end_p (tree ref
)
6963 if (TREE_CODE (ref
) != ARRAY_REF
6964 && TREE_CODE (ref
) != ARRAY_RANGE_REF
)
6967 while (handled_component_p (ref
))
6969 /* If the reference chain contains a component reference to a
6970 non-union type and there follows another field the reference
6971 is not at the end of a structure. */
6972 if (TREE_CODE (ref
) == COMPONENT_REF
6973 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
6975 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
6976 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
6977 nextf
= DECL_CHAIN (nextf
);
6982 ref
= TREE_OPERAND (ref
, 0);
6985 /* If the reference is based on a declared entity, the size of the array
6986 is constrained by its given domain. */
6993 /* Return a tree representing the upper bound of the array mentioned in
6994 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
6997 array_ref_up_bound (tree exp
)
6999 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
7001 /* If there is a domain type and it has an upper bound, use it, substituting
7002 for a PLACEHOLDER_EXPR as needed. */
7003 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
7004 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
7006 /* Otherwise fail. */
7010 /* Return a tree representing the offset, in bytes, of the field referenced
7011 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
7014 component_ref_field_offset (tree exp
)
7016 tree aligned_offset
= TREE_OPERAND (exp
, 2);
7017 tree field
= TREE_OPERAND (exp
, 1);
7018 location_t loc
= EXPR_LOCATION (exp
);
7020 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
7021 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
7025 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
7026 sizetype from another type of the same width and signedness. */
7027 if (TREE_TYPE (aligned_offset
) != sizetype
)
7028 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
7029 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
7030 size_int (DECL_OFFSET_ALIGN (field
)
7034 /* Otherwise, take the offset from that of the field. Substitute
7035 any PLACEHOLDER_EXPR that we have. */
7037 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
7040 /* Alignment in bits the TARGET of an assignment may be assumed to have. */
7042 static unsigned HOST_WIDE_INT
7043 target_align (const_tree target
)
7045 /* We might have a chain of nested references with intermediate misaligning
7046 bitfields components, so need to recurse to find out. */
7048 unsigned HOST_WIDE_INT this_align
, outer_align
;
7050 switch (TREE_CODE (target
))
7056 this_align
= DECL_ALIGN (TREE_OPERAND (target
, 1));
7057 outer_align
= target_align (TREE_OPERAND (target
, 0));
7058 return MIN (this_align
, outer_align
);
7061 case ARRAY_RANGE_REF
:
7062 this_align
= TYPE_ALIGN (TREE_TYPE (target
));
7063 outer_align
= target_align (TREE_OPERAND (target
, 0));
7064 return MIN (this_align
, outer_align
);
7067 case NON_LVALUE_EXPR
:
7068 case VIEW_CONVERT_EXPR
:
7069 this_align
= TYPE_ALIGN (TREE_TYPE (target
));
7070 outer_align
= target_align (TREE_OPERAND (target
, 0));
7071 return MAX (this_align
, outer_align
);
7074 return TYPE_ALIGN (TREE_TYPE (target
));
7079 /* Given an rtx VALUE that may contain additions and multiplications, return
7080 an equivalent value that just refers to a register, memory, or constant.
7081 This is done by generating instructions to perform the arithmetic and
7082 returning a pseudo-register containing the value.
7084 The returned value may be a REG, SUBREG, MEM or constant. */
7087 force_operand (rtx value
, rtx target
)
7090 /* Use subtarget as the target for operand 0 of a binary operation. */
7091 rtx subtarget
= get_subtarget (target
);
7092 enum rtx_code code
= GET_CODE (value
);
7094 /* Check for subreg applied to an expression produced by loop optimizer. */
7096 && !REG_P (SUBREG_REG (value
))
7097 && !MEM_P (SUBREG_REG (value
)))
7100 = simplify_gen_subreg (GET_MODE (value
),
7101 force_reg (GET_MODE (SUBREG_REG (value
)),
7102 force_operand (SUBREG_REG (value
),
7104 GET_MODE (SUBREG_REG (value
)),
7105 SUBREG_BYTE (value
));
7106 code
= GET_CODE (value
);
7109 /* Check for a PIC address load. */
7110 if ((code
== PLUS
|| code
== MINUS
)
7111 && XEXP (value
, 0) == pic_offset_table_rtx
7112 && (GET_CODE (XEXP (value
, 1)) == SYMBOL_REF
7113 || GET_CODE (XEXP (value
, 1)) == LABEL_REF
7114 || GET_CODE (XEXP (value
, 1)) == CONST
))
7117 subtarget
= gen_reg_rtx (GET_MODE (value
));
7118 emit_move_insn (subtarget
, value
);
7122 if (ARITHMETIC_P (value
))
7124 op2
= XEXP (value
, 1);
7125 if (!CONSTANT_P (op2
) && !(REG_P (op2
) && op2
!= subtarget
))
7127 if (code
== MINUS
&& CONST_INT_P (op2
))
7130 op2
= negate_rtx (GET_MODE (value
), op2
);
7133 /* Check for an addition with OP2 a constant integer and our first
7134 operand a PLUS of a virtual register and something else. In that
7135 case, we want to emit the sum of the virtual register and the
7136 constant first and then add the other value. This allows virtual
7137 register instantiation to simply modify the constant rather than
7138 creating another one around this addition. */
7139 if (code
== PLUS
&& CONST_INT_P (op2
)
7140 && GET_CODE (XEXP (value
, 0)) == PLUS
7141 && REG_P (XEXP (XEXP (value
, 0), 0))
7142 && REGNO (XEXP (XEXP (value
, 0), 0)) >= FIRST_VIRTUAL_REGISTER
7143 && REGNO (XEXP (XEXP (value
, 0), 0)) <= LAST_VIRTUAL_REGISTER
)
7145 rtx temp
= expand_simple_binop (GET_MODE (value
), code
,
7146 XEXP (XEXP (value
, 0), 0), op2
,
7147 subtarget
, 0, OPTAB_LIB_WIDEN
);
7148 return expand_simple_binop (GET_MODE (value
), code
, temp
,
7149 force_operand (XEXP (XEXP (value
,
7151 target
, 0, OPTAB_LIB_WIDEN
);
7154 op1
= force_operand (XEXP (value
, 0), subtarget
);
7155 op2
= force_operand (op2
, NULL_RTX
);
7159 return expand_mult (GET_MODE (value
), op1
, op2
, target
, 1);
7161 if (!INTEGRAL_MODE_P (GET_MODE (value
)))
7162 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
7163 target
, 1, OPTAB_LIB_WIDEN
);
7165 return expand_divmod (0,
7166 FLOAT_MODE_P (GET_MODE (value
))
7167 ? RDIV_EXPR
: TRUNC_DIV_EXPR
,
7168 GET_MODE (value
), op1
, op2
, target
, 0);
7170 return expand_divmod (1, TRUNC_MOD_EXPR
, GET_MODE (value
), op1
, op2
,
7173 return expand_divmod (0, TRUNC_DIV_EXPR
, GET_MODE (value
), op1
, op2
,
7176 return expand_divmod (1, TRUNC_MOD_EXPR
, GET_MODE (value
), op1
, op2
,
7179 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
7180 target
, 0, OPTAB_LIB_WIDEN
);
7182 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
7183 target
, 1, OPTAB_LIB_WIDEN
);
7186 if (UNARY_P (value
))
7189 target
= gen_reg_rtx (GET_MODE (value
));
7190 op1
= force_operand (XEXP (value
, 0), NULL_RTX
);
7197 case FLOAT_TRUNCATE
:
7198 convert_move (target
, op1
, code
== ZERO_EXTEND
);
7203 expand_fix (target
, op1
, code
== UNSIGNED_FIX
);
7207 case UNSIGNED_FLOAT
:
7208 expand_float (target
, op1
, code
== UNSIGNED_FLOAT
);
7212 return expand_simple_unop (GET_MODE (value
), code
, op1
, target
, 0);
7216 #ifdef INSN_SCHEDULING
7217 /* On machines that have insn scheduling, we want all memory reference to be
7218 explicit, so we need to deal with such paradoxical SUBREGs. */
7219 if (paradoxical_subreg_p (value
) && MEM_P (SUBREG_REG (value
)))
7221 = simplify_gen_subreg (GET_MODE (value
),
7222 force_reg (GET_MODE (SUBREG_REG (value
)),
7223 force_operand (SUBREG_REG (value
),
7225 GET_MODE (SUBREG_REG (value
)),
7226 SUBREG_BYTE (value
));
7232 /* Subroutine of expand_expr: return nonzero iff there is no way that
7233 EXP can reference X, which is being modified. TOP_P is nonzero if this
7234 call is going to be used to determine whether we need a temporary
7235 for EXP, as opposed to a recursive call to this function.
7237 It is always safe for this routine to return zero since it merely
7238 searches for optimization opportunities. */
7241 safe_from_p (const_rtx x
, tree exp
, int top_p
)
7247 /* If EXP has varying size, we MUST use a target since we currently
7248 have no way of allocating temporaries of variable size
7249 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
7250 So we assume here that something at a higher level has prevented a
7251 clash. This is somewhat bogus, but the best we can do. Only
7252 do this when X is BLKmode and when we are at the top level. */
7253 || (top_p
&& TREE_TYPE (exp
) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp
))
7254 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) != INTEGER_CST
7255 && (TREE_CODE (TREE_TYPE (exp
)) != ARRAY_TYPE
7256 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)) == NULL_TREE
7257 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)))
7259 && GET_MODE (x
) == BLKmode
)
7260 /* If X is in the outgoing argument area, it is always safe. */
7262 && (XEXP (x
, 0) == virtual_outgoing_args_rtx
7263 || (GET_CODE (XEXP (x
, 0)) == PLUS
7264 && XEXP (XEXP (x
, 0), 0) == virtual_outgoing_args_rtx
))))
7267 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
7268 find the underlying pseudo. */
7269 if (GET_CODE (x
) == SUBREG
)
7272 if (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
7276 /* Now look at our tree code and possibly recurse. */
7277 switch (TREE_CODE_CLASS (TREE_CODE (exp
)))
7279 case tcc_declaration
:
7280 exp_rtl
= DECL_RTL_IF_SET (exp
);
7286 case tcc_exceptional
:
7287 if (TREE_CODE (exp
) == TREE_LIST
)
7291 if (TREE_VALUE (exp
) && !safe_from_p (x
, TREE_VALUE (exp
), 0))
7293 exp
= TREE_CHAIN (exp
);
7296 if (TREE_CODE (exp
) != TREE_LIST
)
7297 return safe_from_p (x
, exp
, 0);
7300 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
7302 constructor_elt
*ce
;
7303 unsigned HOST_WIDE_INT idx
;
7305 FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (exp
), idx
, ce
)
7306 if ((ce
->index
!= NULL_TREE
&& !safe_from_p (x
, ce
->index
, 0))
7307 || !safe_from_p (x
, ce
->value
, 0))
7311 else if (TREE_CODE (exp
) == ERROR_MARK
)
7312 return 1; /* An already-visited SAVE_EXPR? */
7317 /* The only case we look at here is the DECL_INITIAL inside a
7319 return (TREE_CODE (exp
) != DECL_EXPR
7320 || TREE_CODE (DECL_EXPR_DECL (exp
)) != VAR_DECL
7321 || !DECL_INITIAL (DECL_EXPR_DECL (exp
))
7322 || safe_from_p (x
, DECL_INITIAL (DECL_EXPR_DECL (exp
)), 0));
7325 case tcc_comparison
:
7326 if (!safe_from_p (x
, TREE_OPERAND (exp
, 1), 0))
7331 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
7333 case tcc_expression
:
7336 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
7337 the expression. If it is set, we conflict iff we are that rtx or
7338 both are in memory. Otherwise, we check all operands of the
7339 expression recursively. */
7341 switch (TREE_CODE (exp
))
7344 /* If the operand is static or we are static, we can't conflict.
7345 Likewise if we don't conflict with the operand at all. */
7346 if (staticp (TREE_OPERAND (exp
, 0))
7347 || TREE_STATIC (exp
)
7348 || safe_from_p (x
, TREE_OPERAND (exp
, 0), 0))
7351 /* Otherwise, the only way this can conflict is if we are taking
7352 the address of a DECL a that address if part of X, which is
7354 exp
= TREE_OPERAND (exp
, 0);
7357 if (!DECL_RTL_SET_P (exp
)
7358 || !MEM_P (DECL_RTL (exp
)))
7361 exp_rtl
= XEXP (DECL_RTL (exp
), 0);
7367 && alias_sets_conflict_p (MEM_ALIAS_SET (x
),
7368 get_alias_set (exp
)))
7373 /* Assume that the call will clobber all hard registers and
7375 if ((REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
7380 case WITH_CLEANUP_EXPR
:
7381 case CLEANUP_POINT_EXPR
:
7382 /* Lowered by gimplify.c. */
7386 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
7392 /* If we have an rtx, we do not need to scan our operands. */
7396 nops
= TREE_OPERAND_LENGTH (exp
);
7397 for (i
= 0; i
< nops
; i
++)
7398 if (TREE_OPERAND (exp
, i
) != 0
7399 && ! safe_from_p (x
, TREE_OPERAND (exp
, i
), 0))
7405 /* Should never get a type here. */
7409 /* If we have an rtl, find any enclosed object. Then see if we conflict
7413 if (GET_CODE (exp_rtl
) == SUBREG
)
7415 exp_rtl
= SUBREG_REG (exp_rtl
);
7417 && REGNO (exp_rtl
) < FIRST_PSEUDO_REGISTER
)
7421 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
7422 are memory and they conflict. */
7423 return ! (rtx_equal_p (x
, exp_rtl
)
7424 || (MEM_P (x
) && MEM_P (exp_rtl
)
7425 && true_dependence (exp_rtl
, VOIDmode
, x
)));
7428 /* If we reach here, it is safe. */
7433 /* Return the highest power of two that EXP is known to be a multiple of.
7434 This is used in updating alignment of MEMs in array references. */
7436 unsigned HOST_WIDE_INT
7437 highest_pow2_factor (const_tree exp
)
7439 unsigned HOST_WIDE_INT ret
;
7440 int trailing_zeros
= tree_ctz (exp
);
7441 if (trailing_zeros
>= HOST_BITS_PER_WIDE_INT
)
7442 return BIGGEST_ALIGNMENT
;
7443 ret
= (unsigned HOST_WIDE_INT
) 1 << trailing_zeros
;
7444 if (ret
> BIGGEST_ALIGNMENT
)
7445 return BIGGEST_ALIGNMENT
;
7449 /* Similar, except that the alignment requirements of TARGET are
7450 taken into account. Assume it is at least as aligned as its
7451 type, unless it is a COMPONENT_REF in which case the layout of
7452 the structure gives the alignment. */
7454 static unsigned HOST_WIDE_INT
7455 highest_pow2_factor_for_target (const_tree target
, const_tree exp
)
7457 unsigned HOST_WIDE_INT talign
= target_align (target
) / BITS_PER_UNIT
;
7458 unsigned HOST_WIDE_INT factor
= highest_pow2_factor (exp
);
7460 return MAX (factor
, talign
);
7463 #ifdef HAVE_conditional_move
7464 /* Convert the tree comparison code TCODE to the rtl one where the
7465 signedness is UNSIGNEDP. */
7467 static enum rtx_code
7468 convert_tree_comp_to_rtx (enum tree_code tcode
, int unsignedp
)
7480 code
= unsignedp
? LTU
: LT
;
7483 code
= unsignedp
? LEU
: LE
;
7486 code
= unsignedp
? GTU
: GT
;
7489 code
= unsignedp
? GEU
: GE
;
7491 case UNORDERED_EXPR
:
7523 /* Subroutine of expand_expr. Expand the two operands of a binary
7524 expression EXP0 and EXP1 placing the results in OP0 and OP1.
7525 The value may be stored in TARGET if TARGET is nonzero. The
7526 MODIFIER argument is as documented by expand_expr. */
7529 expand_operands (tree exp0
, tree exp1
, rtx target
, rtx
*op0
, rtx
*op1
,
7530 enum expand_modifier modifier
)
7532 if (! safe_from_p (target
, exp1
, 1))
7534 if (operand_equal_p (exp0
, exp1
, 0))
7536 *op0
= expand_expr (exp0
, target
, VOIDmode
, modifier
);
7537 *op1
= copy_rtx (*op0
);
7541 /* If we need to preserve evaluation order, copy exp0 into its own
7542 temporary variable so that it can't be clobbered by exp1. */
7543 if (flag_evaluation_order
&& TREE_SIDE_EFFECTS (exp1
))
7544 exp0
= save_expr (exp0
);
7545 *op0
= expand_expr (exp0
, target
, VOIDmode
, modifier
);
7546 *op1
= expand_expr (exp1
, NULL_RTX
, VOIDmode
, modifier
);
7551 /* Return a MEM that contains constant EXP. DEFER is as for
7552 output_constant_def and MODIFIER is as for expand_expr. */
7555 expand_expr_constant (tree exp
, int defer
, enum expand_modifier modifier
)
7559 mem
= output_constant_def (exp
, defer
);
7560 if (modifier
!= EXPAND_INITIALIZER
)
7561 mem
= use_anchored_address (mem
);
7565 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
7566 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7569 expand_expr_addr_expr_1 (tree exp
, rtx target
, enum machine_mode tmode
,
7570 enum expand_modifier modifier
, addr_space_t as
)
7572 rtx result
, subtarget
;
7574 HOST_WIDE_INT bitsize
, bitpos
;
7575 int volatilep
, unsignedp
;
7576 enum machine_mode mode1
;
7578 /* If we are taking the address of a constant and are at the top level,
7579 we have to use output_constant_def since we can't call force_const_mem
7581 /* ??? This should be considered a front-end bug. We should not be
7582 generating ADDR_EXPR of something that isn't an LVALUE. The only
7583 exception here is STRING_CST. */
7584 if (CONSTANT_CLASS_P (exp
))
7586 result
= XEXP (expand_expr_constant (exp
, 0, modifier
), 0);
7587 if (modifier
< EXPAND_SUM
)
7588 result
= force_operand (result
, target
);
7592 /* Everything must be something allowed by is_gimple_addressable. */
7593 switch (TREE_CODE (exp
))
7596 /* This case will happen via recursion for &a->b. */
7597 return expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, modifier
);
7601 tree tem
= TREE_OPERAND (exp
, 0);
7602 if (!integer_zerop (TREE_OPERAND (exp
, 1)))
7603 tem
= fold_build_pointer_plus (tem
, TREE_OPERAND (exp
, 1));
7604 return expand_expr (tem
, target
, tmode
, modifier
);
7608 /* Expand the initializer like constants above. */
7609 result
= XEXP (expand_expr_constant (DECL_INITIAL (exp
),
7611 if (modifier
< EXPAND_SUM
)
7612 result
= force_operand (result
, target
);
7616 /* The real part of the complex number is always first, therefore
7617 the address is the same as the address of the parent object. */
7620 inner
= TREE_OPERAND (exp
, 0);
7624 /* The imaginary part of the complex number is always second.
7625 The expression is therefore always offset by the size of the
7628 bitpos
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp
)));
7629 inner
= TREE_OPERAND (exp
, 0);
7632 case COMPOUND_LITERAL_EXPR
:
7633 /* Allow COMPOUND_LITERAL_EXPR in initializers or coming from
7634 initializers, if e.g. rtl_for_decl_init is called on DECL_INITIAL
7635 with COMPOUND_LITERAL_EXPRs in it, or ARRAY_REF on a const static
7636 array with address of COMPOUND_LITERAL_EXPR in DECL_INITIAL;
7637 the initializers aren't gimplified. */
7638 if (COMPOUND_LITERAL_EXPR_DECL (exp
)
7639 && TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (exp
)))
7640 return expand_expr_addr_expr_1 (COMPOUND_LITERAL_EXPR_DECL (exp
),
7641 target
, tmode
, modifier
, as
);
7644 /* If the object is a DECL, then expand it for its rtl. Don't bypass
7645 expand_expr, as that can have various side effects; LABEL_DECLs for
7646 example, may not have their DECL_RTL set yet. Expand the rtl of
7647 CONSTRUCTORs too, which should yield a memory reference for the
7648 constructor's contents. Assume language specific tree nodes can
7649 be expanded in some interesting way. */
7650 gcc_assert (TREE_CODE (exp
) < LAST_AND_UNUSED_TREE_CODE
);
7652 || TREE_CODE (exp
) == CONSTRUCTOR
7653 || TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
)
7655 result
= expand_expr (exp
, target
, tmode
,
7656 modifier
== EXPAND_INITIALIZER
7657 ? EXPAND_INITIALIZER
: EXPAND_CONST_ADDRESS
);
7659 /* If the DECL isn't in memory, then the DECL wasn't properly
7660 marked TREE_ADDRESSABLE, which will be either a front-end
7661 or a tree optimizer bug. */
7663 if (TREE_ADDRESSABLE (exp
)
7665 && ! targetm
.calls
.allocate_stack_slots_for_args ())
7667 error ("local frame unavailable (naked function?)");
7671 gcc_assert (MEM_P (result
));
7672 result
= XEXP (result
, 0);
7674 /* ??? Is this needed anymore? */
7676 TREE_USED (exp
) = 1;
7678 if (modifier
!= EXPAND_INITIALIZER
7679 && modifier
!= EXPAND_CONST_ADDRESS
7680 && modifier
!= EXPAND_SUM
)
7681 result
= force_operand (result
, target
);
7685 /* Pass FALSE as the last argument to get_inner_reference although
7686 we are expanding to RTL. The rationale is that we know how to
7687 handle "aligning nodes" here: we can just bypass them because
7688 they won't change the final object whose address will be returned
7689 (they actually exist only for that purpose). */
7690 inner
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
7691 &mode1
, &unsignedp
, &volatilep
, false);
7695 /* We must have made progress. */
7696 gcc_assert (inner
!= exp
);
7698 subtarget
= offset
|| bitpos
? NULL_RTX
: target
;
7699 /* For VIEW_CONVERT_EXPR, where the outer alignment is bigger than
7700 inner alignment, force the inner to be sufficiently aligned. */
7701 if (CONSTANT_CLASS_P (inner
)
7702 && TYPE_ALIGN (TREE_TYPE (inner
)) < TYPE_ALIGN (TREE_TYPE (exp
)))
7704 inner
= copy_node (inner
);
7705 TREE_TYPE (inner
) = copy_node (TREE_TYPE (inner
));
7706 TYPE_ALIGN (TREE_TYPE (inner
)) = TYPE_ALIGN (TREE_TYPE (exp
));
7707 TYPE_USER_ALIGN (TREE_TYPE (inner
)) = 1;
7709 result
= expand_expr_addr_expr_1 (inner
, subtarget
, tmode
, modifier
, as
);
7715 if (modifier
!= EXPAND_NORMAL
)
7716 result
= force_operand (result
, NULL
);
7717 tmp
= expand_expr (offset
, NULL_RTX
, tmode
,
7718 modifier
== EXPAND_INITIALIZER
7719 ? EXPAND_INITIALIZER
: EXPAND_NORMAL
);
7721 /* expand_expr is allowed to return an object in a mode other
7722 than TMODE. If it did, we need to convert. */
7723 if (GET_MODE (tmp
) != VOIDmode
&& tmode
!= GET_MODE (tmp
))
7724 tmp
= convert_modes (tmode
, GET_MODE (tmp
),
7725 tmp
, TYPE_UNSIGNED (TREE_TYPE (offset
)));
7726 result
= convert_memory_address_addr_space (tmode
, result
, as
);
7727 tmp
= convert_memory_address_addr_space (tmode
, tmp
, as
);
7729 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
7730 result
= simplify_gen_binary (PLUS
, tmode
, result
, tmp
);
7733 subtarget
= bitpos
? NULL_RTX
: target
;
7734 result
= expand_simple_binop (tmode
, PLUS
, result
, tmp
, subtarget
,
7735 1, OPTAB_LIB_WIDEN
);
7741 /* Someone beforehand should have rejected taking the address
7742 of such an object. */
7743 gcc_assert ((bitpos
% BITS_PER_UNIT
) == 0);
7745 result
= convert_memory_address_addr_space (tmode
, result
, as
);
7746 result
= plus_constant (tmode
, result
, bitpos
/ BITS_PER_UNIT
);
7747 if (modifier
< EXPAND_SUM
)
7748 result
= force_operand (result
, target
);
7754 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
7755 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
7758 expand_expr_addr_expr (tree exp
, rtx target
, enum machine_mode tmode
,
7759 enum expand_modifier modifier
)
7761 addr_space_t as
= ADDR_SPACE_GENERIC
;
7762 enum machine_mode address_mode
= Pmode
;
7763 enum machine_mode pointer_mode
= ptr_mode
;
7764 enum machine_mode rmode
;
7767 /* Target mode of VOIDmode says "whatever's natural". */
7768 if (tmode
== VOIDmode
)
7769 tmode
= TYPE_MODE (TREE_TYPE (exp
));
7771 if (POINTER_TYPE_P (TREE_TYPE (exp
)))
7773 as
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp
)));
7774 address_mode
= targetm
.addr_space
.address_mode (as
);
7775 pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7778 /* We can get called with some Weird Things if the user does silliness
7779 like "(short) &a". In that case, convert_memory_address won't do
7780 the right thing, so ignore the given target mode. */
7781 if (tmode
!= address_mode
&& tmode
!= pointer_mode
)
7782 tmode
= address_mode
;
7784 result
= expand_expr_addr_expr_1 (TREE_OPERAND (exp
, 0), target
,
7785 tmode
, modifier
, as
);
7787 /* Despite expand_expr claims concerning ignoring TMODE when not
7788 strictly convenient, stuff breaks if we don't honor it. Note
7789 that combined with the above, we only do this for pointer modes. */
7790 rmode
= GET_MODE (result
);
7791 if (rmode
== VOIDmode
)
7794 result
= convert_memory_address_addr_space (tmode
, result
, as
);
7799 /* Generate code for computing CONSTRUCTOR EXP.
7800 An rtx for the computed value is returned. If AVOID_TEMP_MEM
7801 is TRUE, instead of creating a temporary variable in memory
7802 NULL is returned and the caller needs to handle it differently. */
7805 expand_constructor (tree exp
, rtx target
, enum expand_modifier modifier
,
7806 bool avoid_temp_mem
)
7808 tree type
= TREE_TYPE (exp
);
7809 enum machine_mode mode
= TYPE_MODE (type
);
7811 /* Try to avoid creating a temporary at all. This is possible
7812 if all of the initializer is zero.
7813 FIXME: try to handle all [0..255] initializers we can handle
7815 if (TREE_STATIC (exp
)
7816 && !TREE_ADDRESSABLE (exp
)
7817 && target
!= 0 && mode
== BLKmode
7818 && all_zeros_p (exp
))
7820 clear_storage (target
, expr_size (exp
), BLOCK_OP_NORMAL
);
7824 /* All elts simple constants => refer to a constant in memory. But
7825 if this is a non-BLKmode mode, let it store a field at a time
7826 since that should make a CONST_INT or CONST_DOUBLE when we
7827 fold. Likewise, if we have a target we can use, it is best to
7828 store directly into the target unless the type is large enough
7829 that memcpy will be used. If we are making an initializer and
7830 all operands are constant, put it in memory as well.
7832 FIXME: Avoid trying to fill vector constructors piece-meal.
7833 Output them with output_constant_def below unless we're sure
7834 they're zeros. This should go away when vector initializers
7835 are treated like VECTOR_CST instead of arrays. */
7836 if ((TREE_STATIC (exp
)
7837 && ((mode
== BLKmode
7838 && ! (target
!= 0 && safe_from_p (target
, exp
, 1)))
7839 || TREE_ADDRESSABLE (exp
)
7840 || (tree_fits_uhwi_p (TYPE_SIZE_UNIT (type
))
7841 && (! MOVE_BY_PIECES_P
7842 (tree_to_uhwi (TYPE_SIZE_UNIT (type
)),
7844 && ! mostly_zeros_p (exp
))))
7845 || ((modifier
== EXPAND_INITIALIZER
|| modifier
== EXPAND_CONST_ADDRESS
)
7846 && TREE_CONSTANT (exp
)))
7853 constructor
= expand_expr_constant (exp
, 1, modifier
);
7855 if (modifier
!= EXPAND_CONST_ADDRESS
7856 && modifier
!= EXPAND_INITIALIZER
7857 && modifier
!= EXPAND_SUM
)
7858 constructor
= validize_mem (constructor
);
7863 /* Handle calls that pass values in multiple non-contiguous
7864 locations. The Irix 6 ABI has examples of this. */
7865 if (target
== 0 || ! safe_from_p (target
, exp
, 1)
7866 || GET_CODE (target
) == PARALLEL
|| modifier
== EXPAND_STACK_PARM
)
7871 target
= assign_temp (type
, TREE_ADDRESSABLE (exp
), 1);
7874 store_constructor (exp
, target
, 0, int_expr_size (exp
));
7879 /* expand_expr: generate code for computing expression EXP.
7880 An rtx for the computed value is returned. The value is never null.
7881 In the case of a void EXP, const0_rtx is returned.
7883 The value may be stored in TARGET if TARGET is nonzero.
7884 TARGET is just a suggestion; callers must assume that
7885 the rtx returned may not be the same as TARGET.
7887 If TARGET is CONST0_RTX, it means that the value will be ignored.
7889 If TMODE is not VOIDmode, it suggests generating the
7890 result in mode TMODE. But this is done only when convenient.
7891 Otherwise, TMODE is ignored and the value generated in its natural mode.
7892 TMODE is just a suggestion; callers must assume that
7893 the rtx returned may not have mode TMODE.
7895 Note that TARGET may have neither TMODE nor MODE. In that case, it
7896 probably will not be used.
7898 If MODIFIER is EXPAND_SUM then when EXP is an addition
7899 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
7900 or a nest of (PLUS ...) and (MINUS ...) where the terms are
7901 products as above, or REG or MEM, or constant.
7902 Ordinarily in such cases we would output mul or add instructions
7903 and then return a pseudo reg containing the sum.
7905 EXPAND_INITIALIZER is much like EXPAND_SUM except that
7906 it also marks a label as absolutely required (it can't be dead).
7907 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
7908 This is used for outputting expressions used in initializers.
7910 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
7911 with a constant address even if that address is not normally legitimate.
7912 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
7914 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
7915 a call parameter. Such targets require special care as we haven't yet
7916 marked TARGET so that it's safe from being trashed by libcalls. We
7917 don't want to use TARGET for anything but the final result;
7918 Intermediate values must go elsewhere. Additionally, calls to
7919 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
7921 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
7922 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
7923 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
7924 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
7927 If INNER_REFERENCE_P is true, we are expanding an inner reference.
7928 In this case, we don't adjust a returned MEM rtx that wouldn't be
7929 sufficiently aligned for its mode; instead, it's up to the caller
7930 to deal with it afterwards. This is used to make sure that unaligned
7931 base objects for which out-of-bounds accesses are supported, for
7932 example record types with trailing arrays, aren't realigned behind
7933 the back of the caller.
7934 The normal operating mode is to pass FALSE for this parameter. */
7937 expand_expr_real (tree exp
, rtx target
, enum machine_mode tmode
,
7938 enum expand_modifier modifier
, rtx
*alt_rtl
,
7939 bool inner_reference_p
)
7943 /* Handle ERROR_MARK before anybody tries to access its type. */
7944 if (TREE_CODE (exp
) == ERROR_MARK
7945 || (TREE_CODE (TREE_TYPE (exp
)) == ERROR_MARK
))
7947 ret
= CONST0_RTX (tmode
);
7948 return ret
? ret
: const0_rtx
;
7951 ret
= expand_expr_real_1 (exp
, target
, tmode
, modifier
, alt_rtl
,
7956 /* Try to expand the conditional expression which is represented by
7957 TREEOP0 ? TREEOP1 : TREEOP2 using conditonal moves. If succeseds
7958 return the rtl reg which repsents the result. Otherwise return
7962 expand_cond_expr_using_cmove (tree treeop0 ATTRIBUTE_UNUSED
,
7963 tree treeop1 ATTRIBUTE_UNUSED
,
7964 tree treeop2 ATTRIBUTE_UNUSED
)
7966 #ifdef HAVE_conditional_move
7968 rtx op00
, op01
, op1
, op2
;
7969 enum rtx_code comparison_code
;
7970 enum machine_mode comparison_mode
;
7973 tree type
= TREE_TYPE (treeop1
);
7974 int unsignedp
= TYPE_UNSIGNED (type
);
7975 enum machine_mode mode
= TYPE_MODE (type
);
7976 enum machine_mode orig_mode
= mode
;
7978 /* If we cannot do a conditional move on the mode, try doing it
7979 with the promoted mode. */
7980 if (!can_conditionally_move_p (mode
))
7982 mode
= promote_mode (type
, mode
, &unsignedp
);
7983 if (!can_conditionally_move_p (mode
))
7985 temp
= assign_temp (type
, 0, 0); /* Use promoted mode for temp. */
7988 temp
= assign_temp (type
, 0, 1);
7991 expand_operands (treeop1
, treeop2
,
7992 temp
, &op1
, &op2
, EXPAND_NORMAL
);
7994 if (TREE_CODE (treeop0
) == SSA_NAME
7995 && (srcstmt
= get_def_for_expr_class (treeop0
, tcc_comparison
)))
7997 tree type
= TREE_TYPE (gimple_assign_rhs1 (srcstmt
));
7998 enum tree_code cmpcode
= gimple_assign_rhs_code (srcstmt
);
7999 op00
= expand_normal (gimple_assign_rhs1 (srcstmt
));
8000 op01
= expand_normal (gimple_assign_rhs2 (srcstmt
));
8001 comparison_mode
= TYPE_MODE (type
);
8002 unsignedp
= TYPE_UNSIGNED (type
);
8003 comparison_code
= convert_tree_comp_to_rtx (cmpcode
, unsignedp
);
8005 else if (TREE_CODE_CLASS (TREE_CODE (treeop0
)) == tcc_comparison
)
8007 tree type
= TREE_TYPE (TREE_OPERAND (treeop0
, 0));
8008 enum tree_code cmpcode
= TREE_CODE (treeop0
);
8009 op00
= expand_normal (TREE_OPERAND (treeop0
, 0));
8010 op01
= expand_normal (TREE_OPERAND (treeop0
, 1));
8011 unsignedp
= TYPE_UNSIGNED (type
);
8012 comparison_mode
= TYPE_MODE (type
);
8013 comparison_code
= convert_tree_comp_to_rtx (cmpcode
, unsignedp
);
8017 op00
= expand_normal (treeop0
);
8019 comparison_code
= NE
;
8020 comparison_mode
= TYPE_MODE (TREE_TYPE (treeop0
));
8023 if (GET_MODE (op1
) != mode
)
8024 op1
= gen_lowpart (mode
, op1
);
8026 if (GET_MODE (op2
) != mode
)
8027 op2
= gen_lowpart (mode
, op2
);
8029 /* Try to emit the conditional move. */
8030 insn
= emit_conditional_move (temp
, comparison_code
,
8031 op00
, op01
, comparison_mode
,
8035 /* If we could do the conditional move, emit the sequence,
8039 rtx seq
= get_insns ();
8042 return convert_modes (orig_mode
, mode
, temp
, 0);
8045 /* Otherwise discard the sequence and fall back to code with
8053 expand_expr_real_2 (sepops ops
, rtx target
, enum machine_mode tmode
,
8054 enum expand_modifier modifier
)
8056 rtx op0
, op1
, op2
, temp
;
8059 enum machine_mode mode
;
8060 enum tree_code code
= ops
->code
;
8062 rtx subtarget
, original_target
;
8064 bool reduce_bit_field
;
8065 location_t loc
= ops
->location
;
8066 tree treeop0
, treeop1
, treeop2
;
8067 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field \
8068 ? reduce_to_bit_field_precision ((expr), \
8074 mode
= TYPE_MODE (type
);
8075 unsignedp
= TYPE_UNSIGNED (type
);
8081 /* We should be called only on simple (binary or unary) expressions,
8082 exactly those that are valid in gimple expressions that aren't
8083 GIMPLE_SINGLE_RHS (or invalid). */
8084 gcc_assert (get_gimple_rhs_class (code
) == GIMPLE_UNARY_RHS
8085 || get_gimple_rhs_class (code
) == GIMPLE_BINARY_RHS
8086 || get_gimple_rhs_class (code
) == GIMPLE_TERNARY_RHS
);
8088 ignore
= (target
== const0_rtx
8089 || ((CONVERT_EXPR_CODE_P (code
)
8090 || code
== COND_EXPR
|| code
== VIEW_CONVERT_EXPR
)
8091 && TREE_CODE (type
) == VOID_TYPE
));
8093 /* We should be called only if we need the result. */
8094 gcc_assert (!ignore
);
8096 /* An operation in what may be a bit-field type needs the
8097 result to be reduced to the precision of the bit-field type,
8098 which is narrower than that of the type's mode. */
8099 reduce_bit_field
= (INTEGRAL_TYPE_P (type
)
8100 && GET_MODE_PRECISION (mode
) > TYPE_PRECISION (type
));
8102 if (reduce_bit_field
&& modifier
== EXPAND_STACK_PARM
)
8105 /* Use subtarget as the target for operand 0 of a binary operation. */
8106 subtarget
= get_subtarget (target
);
8107 original_target
= target
;
8111 case NON_LVALUE_EXPR
:
8114 if (treeop0
== error_mark_node
)
8117 if (TREE_CODE (type
) == UNION_TYPE
)
8119 tree valtype
= TREE_TYPE (treeop0
);
8121 /* If both input and output are BLKmode, this conversion isn't doing
8122 anything except possibly changing memory attribute. */
8123 if (mode
== BLKmode
&& TYPE_MODE (valtype
) == BLKmode
)
8125 rtx result
= expand_expr (treeop0
, target
, tmode
,
8128 result
= copy_rtx (result
);
8129 set_mem_attributes (result
, type
, 0);
8135 if (TYPE_MODE (type
) != BLKmode
)
8136 target
= gen_reg_rtx (TYPE_MODE (type
));
8138 target
= assign_temp (type
, 1, 1);
8142 /* Store data into beginning of memory target. */
8143 store_expr (treeop0
,
8144 adjust_address (target
, TYPE_MODE (valtype
), 0),
8145 modifier
== EXPAND_STACK_PARM
,
8150 gcc_assert (REG_P (target
));
8152 /* Store this field into a union of the proper type. */
8153 store_field (target
,
8154 MIN ((int_size_in_bytes (TREE_TYPE
8157 (HOST_WIDE_INT
) GET_MODE_BITSIZE (mode
)),
8158 0, 0, 0, TYPE_MODE (valtype
), treeop0
, 0, false);
8161 /* Return the entire union. */
8165 if (mode
== TYPE_MODE (TREE_TYPE (treeop0
)))
8167 op0
= expand_expr (treeop0
, target
, VOIDmode
,
8170 /* If the signedness of the conversion differs and OP0 is
8171 a promoted SUBREG, clear that indication since we now
8172 have to do the proper extension. */
8173 if (TYPE_UNSIGNED (TREE_TYPE (treeop0
)) != unsignedp
8174 && GET_CODE (op0
) == SUBREG
)
8175 SUBREG_PROMOTED_VAR_P (op0
) = 0;
8177 return REDUCE_BIT_FIELD (op0
);
8180 op0
= expand_expr (treeop0
, NULL_RTX
, mode
,
8181 modifier
== EXPAND_SUM
? EXPAND_NORMAL
: modifier
);
8182 if (GET_MODE (op0
) == mode
)
8185 /* If OP0 is a constant, just convert it into the proper mode. */
8186 else if (CONSTANT_P (op0
))
8188 tree inner_type
= TREE_TYPE (treeop0
);
8189 enum machine_mode inner_mode
= GET_MODE (op0
);
8191 if (inner_mode
== VOIDmode
)
8192 inner_mode
= TYPE_MODE (inner_type
);
8194 if (modifier
== EXPAND_INITIALIZER
)
8195 op0
= simplify_gen_subreg (mode
, op0
, inner_mode
,
8196 subreg_lowpart_offset (mode
,
8199 op0
= convert_modes (mode
, inner_mode
, op0
,
8200 TYPE_UNSIGNED (inner_type
));
8203 else if (modifier
== EXPAND_INITIALIZER
)
8204 op0
= gen_rtx_fmt_e (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
, mode
, op0
);
8206 else if (target
== 0)
8207 op0
= convert_to_mode (mode
, op0
,
8208 TYPE_UNSIGNED (TREE_TYPE
8212 convert_move (target
, op0
,
8213 TYPE_UNSIGNED (TREE_TYPE (treeop0
)));
8217 return REDUCE_BIT_FIELD (op0
);
8219 case ADDR_SPACE_CONVERT_EXPR
:
8221 tree treeop0_type
= TREE_TYPE (treeop0
);
8223 addr_space_t as_from
;
8225 gcc_assert (POINTER_TYPE_P (type
));
8226 gcc_assert (POINTER_TYPE_P (treeop0_type
));
8228 as_to
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
8229 as_from
= TYPE_ADDR_SPACE (TREE_TYPE (treeop0_type
));
8231 /* Conversions between pointers to the same address space should
8232 have been implemented via CONVERT_EXPR / NOP_EXPR. */
8233 gcc_assert (as_to
!= as_from
);
8235 /* Ask target code to handle conversion between pointers
8236 to overlapping address spaces. */
8237 if (targetm
.addr_space
.subset_p (as_to
, as_from
)
8238 || targetm
.addr_space
.subset_p (as_from
, as_to
))
8240 op0
= expand_expr (treeop0
, NULL_RTX
, VOIDmode
, modifier
);
8241 op0
= targetm
.addr_space
.convert (op0
, treeop0_type
, type
);
8246 /* For disjoint address spaces, converting anything but
8247 a null pointer invokes undefined behaviour. We simply
8248 always return a null pointer here. */
8249 return CONST0_RTX (mode
);
8252 case POINTER_PLUS_EXPR
:
8253 /* Even though the sizetype mode and the pointer's mode can be different
8254 expand is able to handle this correctly and get the correct result out
8255 of the PLUS_EXPR code. */
8256 /* Make sure to sign-extend the sizetype offset in a POINTER_PLUS_EXPR
8257 if sizetype precision is smaller than pointer precision. */
8258 if (TYPE_PRECISION (sizetype
) < TYPE_PRECISION (type
))
8259 treeop1
= fold_convert_loc (loc
, type
,
8260 fold_convert_loc (loc
, ssizetype
,
8262 /* If sizetype precision is larger than pointer precision, truncate the
8263 offset to have matching modes. */
8264 else if (TYPE_PRECISION (sizetype
) > TYPE_PRECISION (type
))
8265 treeop1
= fold_convert_loc (loc
, type
, treeop1
);
8268 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
8269 something else, make sure we add the register to the constant and
8270 then to the other thing. This case can occur during strength
8271 reduction and doing it this way will produce better code if the
8272 frame pointer or argument pointer is eliminated.
8274 fold-const.c will ensure that the constant is always in the inner
8275 PLUS_EXPR, so the only case we need to do anything about is if
8276 sp, ap, or fp is our second argument, in which case we must swap
8277 the innermost first argument and our second argument. */
8279 if (TREE_CODE (treeop0
) == PLUS_EXPR
8280 && TREE_CODE (TREE_OPERAND (treeop0
, 1)) == INTEGER_CST
8281 && TREE_CODE (treeop1
) == VAR_DECL
8282 && (DECL_RTL (treeop1
) == frame_pointer_rtx
8283 || DECL_RTL (treeop1
) == stack_pointer_rtx
8284 || DECL_RTL (treeop1
) == arg_pointer_rtx
))
8289 /* If the result is to be ptr_mode and we are adding an integer to
8290 something, we might be forming a constant. So try to use
8291 plus_constant. If it produces a sum and we can't accept it,
8292 use force_operand. This allows P = &ARR[const] to generate
8293 efficient code on machines where a SYMBOL_REF is not a valid
8296 If this is an EXPAND_SUM call, always return the sum. */
8297 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
8298 || (mode
== ptr_mode
&& (unsignedp
|| ! flag_trapv
)))
8300 if (modifier
== EXPAND_STACK_PARM
)
8302 if (TREE_CODE (treeop0
) == INTEGER_CST
8303 && GET_MODE_PRECISION (mode
) <= HOST_BITS_PER_WIDE_INT
8304 && TREE_CONSTANT (treeop1
))
8308 op1
= expand_expr (treeop1
, subtarget
, VOIDmode
,
8310 /* Use immed_double_const to ensure that the constant is
8311 truncated according to the mode of OP1, then sign extended
8312 to a HOST_WIDE_INT. Using the constant directly can result
8313 in non-canonical RTL in a 64x32 cross compile. */
8315 = immed_double_const (TREE_INT_CST_LOW (treeop0
),
8317 TYPE_MODE (TREE_TYPE (treeop1
)));
8318 op1
= plus_constant (mode
, op1
, INTVAL (constant_part
));
8319 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8320 op1
= force_operand (op1
, target
);
8321 return REDUCE_BIT_FIELD (op1
);
8324 else if (TREE_CODE (treeop1
) == INTEGER_CST
8325 && GET_MODE_PRECISION (mode
) <= HOST_BITS_PER_WIDE_INT
8326 && TREE_CONSTANT (treeop0
))
8330 op0
= expand_expr (treeop0
, subtarget
, VOIDmode
,
8331 (modifier
== EXPAND_INITIALIZER
8332 ? EXPAND_INITIALIZER
: EXPAND_SUM
));
8333 if (! CONSTANT_P (op0
))
8335 op1
= expand_expr (treeop1
, NULL_RTX
,
8336 VOIDmode
, modifier
);
8337 /* Return a PLUS if modifier says it's OK. */
8338 if (modifier
== EXPAND_SUM
8339 || modifier
== EXPAND_INITIALIZER
)
8340 return simplify_gen_binary (PLUS
, mode
, op0
, op1
);
8343 /* Use immed_double_const to ensure that the constant is
8344 truncated according to the mode of OP1, then sign extended
8345 to a HOST_WIDE_INT. Using the constant directly can result
8346 in non-canonical RTL in a 64x32 cross compile. */
8348 = immed_double_const (TREE_INT_CST_LOW (treeop1
),
8350 TYPE_MODE (TREE_TYPE (treeop0
)));
8351 op0
= plus_constant (mode
, op0
, INTVAL (constant_part
));
8352 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8353 op0
= force_operand (op0
, target
);
8354 return REDUCE_BIT_FIELD (op0
);
8358 /* Use TER to expand pointer addition of a negated value
8359 as pointer subtraction. */
8360 if ((POINTER_TYPE_P (TREE_TYPE (treeop0
))
8361 || (TREE_CODE (TREE_TYPE (treeop0
)) == VECTOR_TYPE
8362 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (treeop0
)))))
8363 && TREE_CODE (treeop1
) == SSA_NAME
8364 && TYPE_MODE (TREE_TYPE (treeop0
))
8365 == TYPE_MODE (TREE_TYPE (treeop1
)))
8367 gimple def
= get_def_for_expr (treeop1
, NEGATE_EXPR
);
8370 treeop1
= gimple_assign_rhs1 (def
);
8376 /* No sense saving up arithmetic to be done
8377 if it's all in the wrong mode to form part of an address.
8378 And force_operand won't know whether to sign-extend or
8380 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8381 || mode
!= ptr_mode
)
8383 expand_operands (treeop0
, treeop1
,
8384 subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8385 if (op0
== const0_rtx
)
8387 if (op1
== const0_rtx
)
8392 expand_operands (treeop0
, treeop1
,
8393 subtarget
, &op0
, &op1
, modifier
);
8394 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS
, mode
, op0
, op1
));
8398 /* For initializers, we are allowed to return a MINUS of two
8399 symbolic constants. Here we handle all cases when both operands
8401 /* Handle difference of two symbolic constants,
8402 for the sake of an initializer. */
8403 if ((modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
8404 && really_constant_p (treeop0
)
8405 && really_constant_p (treeop1
))
8407 expand_operands (treeop0
, treeop1
,
8408 NULL_RTX
, &op0
, &op1
, modifier
);
8410 /* If the last operand is a CONST_INT, use plus_constant of
8411 the negated constant. Else make the MINUS. */
8412 if (CONST_INT_P (op1
))
8413 return REDUCE_BIT_FIELD (plus_constant (mode
, op0
,
8416 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode
, op0
, op1
));
8419 /* No sense saving up arithmetic to be done
8420 if it's all in the wrong mode to form part of an address.
8421 And force_operand won't know whether to sign-extend or
8423 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8424 || mode
!= ptr_mode
)
8427 expand_operands (treeop0
, treeop1
,
8428 subtarget
, &op0
, &op1
, modifier
);
8430 /* Convert A - const to A + (-const). */
8431 if (CONST_INT_P (op1
))
8433 op1
= negate_rtx (mode
, op1
);
8434 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS
, mode
, op0
, op1
));
8439 case WIDEN_MULT_PLUS_EXPR
:
8440 case WIDEN_MULT_MINUS_EXPR
:
8441 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8442 op2
= expand_normal (treeop2
);
8443 target
= expand_widen_pattern_expr (ops
, op0
, op1
, op2
,
8447 case WIDEN_MULT_EXPR
:
8448 /* If first operand is constant, swap them.
8449 Thus the following special case checks need only
8450 check the second operand. */
8451 if (TREE_CODE (treeop0
) == INTEGER_CST
)
8458 /* First, check if we have a multiplication of one signed and one
8459 unsigned operand. */
8460 if (TREE_CODE (treeop1
) != INTEGER_CST
8461 && (TYPE_UNSIGNED (TREE_TYPE (treeop0
))
8462 != TYPE_UNSIGNED (TREE_TYPE (treeop1
))))
8464 enum machine_mode innermode
= TYPE_MODE (TREE_TYPE (treeop0
));
8465 this_optab
= usmul_widen_optab
;
8466 if (find_widening_optab_handler (this_optab
, mode
, innermode
, 0)
8467 != CODE_FOR_nothing
)
8469 if (TYPE_UNSIGNED (TREE_TYPE (treeop0
)))
8470 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op0
, &op1
,
8473 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op1
, &op0
,
8475 /* op0 and op1 might still be constant, despite the above
8476 != INTEGER_CST check. Handle it. */
8477 if (GET_MODE (op0
) == VOIDmode
&& GET_MODE (op1
) == VOIDmode
)
8479 op0
= convert_modes (innermode
, mode
, op0
, true);
8480 op1
= convert_modes (innermode
, mode
, op1
, false);
8481 return REDUCE_BIT_FIELD (expand_mult (mode
, op0
, op1
,
8482 target
, unsignedp
));
8487 /* Check for a multiplication with matching signedness. */
8488 else if ((TREE_CODE (treeop1
) == INTEGER_CST
8489 && int_fits_type_p (treeop1
, TREE_TYPE (treeop0
)))
8490 || (TYPE_UNSIGNED (TREE_TYPE (treeop1
))
8491 == TYPE_UNSIGNED (TREE_TYPE (treeop0
))))
8493 tree op0type
= TREE_TYPE (treeop0
);
8494 enum machine_mode innermode
= TYPE_MODE (op0type
);
8495 bool zextend_p
= TYPE_UNSIGNED (op0type
);
8496 optab other_optab
= zextend_p
? smul_widen_optab
: umul_widen_optab
;
8497 this_optab
= zextend_p
? umul_widen_optab
: smul_widen_optab
;
8499 if (TREE_CODE (treeop0
) != INTEGER_CST
)
8501 if (find_widening_optab_handler (this_optab
, mode
, innermode
, 0)
8502 != CODE_FOR_nothing
)
8504 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op0
, &op1
,
8506 /* op0 and op1 might still be constant, despite the above
8507 != INTEGER_CST check. Handle it. */
8508 if (GET_MODE (op0
) == VOIDmode
&& GET_MODE (op1
) == VOIDmode
)
8511 op0
= convert_modes (innermode
, mode
, op0
, zextend_p
);
8513 = convert_modes (innermode
, mode
, op1
,
8514 TYPE_UNSIGNED (TREE_TYPE (treeop1
)));
8515 return REDUCE_BIT_FIELD (expand_mult (mode
, op0
, op1
,
8519 temp
= expand_widening_mult (mode
, op0
, op1
, target
,
8520 unsignedp
, this_optab
);
8521 return REDUCE_BIT_FIELD (temp
);
8523 if (find_widening_optab_handler (other_optab
, mode
, innermode
, 0)
8525 && innermode
== word_mode
)
8528 op0
= expand_normal (treeop0
);
8529 if (TREE_CODE (treeop1
) == INTEGER_CST
)
8530 op1
= convert_modes (innermode
, mode
,
8531 expand_normal (treeop1
),
8532 TYPE_UNSIGNED (TREE_TYPE (treeop1
)));
8534 op1
= expand_normal (treeop1
);
8535 /* op0 and op1 might still be constant, despite the above
8536 != INTEGER_CST check. Handle it. */
8537 if (GET_MODE (op0
) == VOIDmode
&& GET_MODE (op1
) == VOIDmode
)
8538 goto widen_mult_const
;
8539 temp
= expand_binop (mode
, other_optab
, op0
, op1
, target
,
8540 unsignedp
, OPTAB_LIB_WIDEN
);
8541 hipart
= gen_highpart (innermode
, temp
);
8542 htem
= expand_mult_highpart_adjust (innermode
, hipart
,
8546 emit_move_insn (hipart
, htem
);
8547 return REDUCE_BIT_FIELD (temp
);
8551 treeop0
= fold_build1 (CONVERT_EXPR
, type
, treeop0
);
8552 treeop1
= fold_build1 (CONVERT_EXPR
, type
, treeop1
);
8553 expand_operands (treeop0
, treeop1
, subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8554 return REDUCE_BIT_FIELD (expand_mult (mode
, op0
, op1
, target
, unsignedp
));
8558 optab opt
= fma_optab
;
8561 /* If there is no insn for FMA, emit it as __builtin_fma{,f,l}
8563 if (optab_handler (fma_optab
, mode
) == CODE_FOR_nothing
)
8565 tree fn
= mathfn_built_in (TREE_TYPE (treeop0
), BUILT_IN_FMA
);
8568 gcc_assert (fn
!= NULL_TREE
);
8569 call_expr
= build_call_expr (fn
, 3, treeop0
, treeop1
, treeop2
);
8570 return expand_builtin (call_expr
, target
, subtarget
, mode
, false);
8573 def0
= get_def_for_expr (treeop0
, NEGATE_EXPR
);
8574 def2
= get_def_for_expr (treeop2
, NEGATE_EXPR
);
8579 && optab_handler (fnms_optab
, mode
) != CODE_FOR_nothing
)
8582 op0
= expand_normal (gimple_assign_rhs1 (def0
));
8583 op2
= expand_normal (gimple_assign_rhs1 (def2
));
8586 && optab_handler (fnma_optab
, mode
) != CODE_FOR_nothing
)
8589 op0
= expand_normal (gimple_assign_rhs1 (def0
));
8592 && optab_handler (fms_optab
, mode
) != CODE_FOR_nothing
)
8595 op2
= expand_normal (gimple_assign_rhs1 (def2
));
8599 op0
= expand_expr (treeop0
, subtarget
, VOIDmode
, EXPAND_NORMAL
);
8601 op2
= expand_normal (treeop2
);
8602 op1
= expand_normal (treeop1
);
8604 return expand_ternary_op (TYPE_MODE (type
), opt
,
8605 op0
, op1
, op2
, target
, 0);
8609 /* If this is a fixed-point operation, then we cannot use the code
8610 below because "expand_mult" doesn't support sat/no-sat fixed-point
8612 if (ALL_FIXED_POINT_MODE_P (mode
))
8615 /* If first operand is constant, swap them.
8616 Thus the following special case checks need only
8617 check the second operand. */
8618 if (TREE_CODE (treeop0
) == INTEGER_CST
)
8625 /* Attempt to return something suitable for generating an
8626 indexed address, for machines that support that. */
8628 if (modifier
== EXPAND_SUM
&& mode
== ptr_mode
8629 && tree_fits_shwi_p (treeop1
))
8631 tree exp1
= treeop1
;
8633 op0
= expand_expr (treeop0
, subtarget
, VOIDmode
,
8637 op0
= force_operand (op0
, NULL_RTX
);
8639 op0
= copy_to_mode_reg (mode
, op0
);
8641 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode
, op0
,
8642 gen_int_mode (tree_to_shwi (exp1
),
8643 TYPE_MODE (TREE_TYPE (exp1
)))));
8646 if (modifier
== EXPAND_STACK_PARM
)
8649 expand_operands (treeop0
, treeop1
, subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8650 return REDUCE_BIT_FIELD (expand_mult (mode
, op0
, op1
, target
, unsignedp
));
8652 case TRUNC_DIV_EXPR
:
8653 case FLOOR_DIV_EXPR
:
8655 case ROUND_DIV_EXPR
:
8656 case EXACT_DIV_EXPR
:
8657 /* If this is a fixed-point operation, then we cannot use the code
8658 below because "expand_divmod" doesn't support sat/no-sat fixed-point
8660 if (ALL_FIXED_POINT_MODE_P (mode
))
8663 if (modifier
== EXPAND_STACK_PARM
)
8665 /* Possible optimization: compute the dividend with EXPAND_SUM
8666 then if the divisor is constant can optimize the case
8667 where some terms of the dividend have coeffs divisible by it. */
8668 expand_operands (treeop0
, treeop1
,
8669 subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8670 return expand_divmod (0, code
, mode
, op0
, op1
, target
, unsignedp
);
8675 case MULT_HIGHPART_EXPR
:
8676 expand_operands (treeop0
, treeop1
, subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8677 temp
= expand_mult_highpart (mode
, op0
, op1
, target
, unsignedp
);
8681 case TRUNC_MOD_EXPR
:
8682 case FLOOR_MOD_EXPR
:
8684 case ROUND_MOD_EXPR
:
8685 if (modifier
== EXPAND_STACK_PARM
)
8687 expand_operands (treeop0
, treeop1
,
8688 subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
8689 return expand_divmod (1, code
, mode
, op0
, op1
, target
, unsignedp
);
8691 case FIXED_CONVERT_EXPR
:
8692 op0
= expand_normal (treeop0
);
8693 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8694 target
= gen_reg_rtx (mode
);
8696 if ((TREE_CODE (TREE_TYPE (treeop0
)) == INTEGER_TYPE
8697 && TYPE_UNSIGNED (TREE_TYPE (treeop0
)))
8698 || (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
)))
8699 expand_fixed_convert (target
, op0
, 1, TYPE_SATURATING (type
));
8701 expand_fixed_convert (target
, op0
, 0, TYPE_SATURATING (type
));
8704 case FIX_TRUNC_EXPR
:
8705 op0
= expand_normal (treeop0
);
8706 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8707 target
= gen_reg_rtx (mode
);
8708 expand_fix (target
, op0
, unsignedp
);
8712 op0
= expand_normal (treeop0
);
8713 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8714 target
= gen_reg_rtx (mode
);
8715 /* expand_float can't figure out what to do if FROM has VOIDmode.
8716 So give it the correct mode. With -O, cse will optimize this. */
8717 if (GET_MODE (op0
) == VOIDmode
)
8718 op0
= copy_to_mode_reg (TYPE_MODE (TREE_TYPE (treeop0
)),
8720 expand_float (target
, op0
,
8721 TYPE_UNSIGNED (TREE_TYPE (treeop0
)));
8725 op0
= expand_expr (treeop0
, subtarget
,
8726 VOIDmode
, EXPAND_NORMAL
);
8727 if (modifier
== EXPAND_STACK_PARM
)
8729 temp
= expand_unop (mode
,
8730 optab_for_tree_code (NEGATE_EXPR
, type
,
8734 return REDUCE_BIT_FIELD (temp
);
8737 op0
= expand_expr (treeop0
, subtarget
,
8738 VOIDmode
, EXPAND_NORMAL
);
8739 if (modifier
== EXPAND_STACK_PARM
)
8742 /* ABS_EXPR is not valid for complex arguments. */
8743 gcc_assert (GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
8744 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
);
8746 /* Unsigned abs is simply the operand. Testing here means we don't
8747 risk generating incorrect code below. */
8748 if (TYPE_UNSIGNED (type
))
8751 return expand_abs (mode
, op0
, target
, unsignedp
,
8752 safe_from_p (target
, treeop0
, 1));
8756 target
= original_target
;
8758 || modifier
== EXPAND_STACK_PARM
8759 || (MEM_P (target
) && MEM_VOLATILE_P (target
))
8760 || GET_MODE (target
) != mode
8762 && REGNO (target
) < FIRST_PSEUDO_REGISTER
))
8763 target
= gen_reg_rtx (mode
);
8764 expand_operands (treeop0
, treeop1
,
8765 target
, &op0
, &op1
, EXPAND_NORMAL
);
8767 /* First try to do it with a special MIN or MAX instruction.
8768 If that does not win, use a conditional jump to select the proper
8770 this_optab
= optab_for_tree_code (code
, type
, optab_default
);
8771 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
, unsignedp
,
8776 /* At this point, a MEM target is no longer useful; we will get better
8779 if (! REG_P (target
))
8780 target
= gen_reg_rtx (mode
);
8782 /* If op1 was placed in target, swap op0 and op1. */
8783 if (target
!= op0
&& target
== op1
)
8790 /* We generate better code and avoid problems with op1 mentioning
8791 target by forcing op1 into a pseudo if it isn't a constant. */
8792 if (! CONSTANT_P (op1
))
8793 op1
= force_reg (mode
, op1
);
8796 enum rtx_code comparison_code
;
8799 if (code
== MAX_EXPR
)
8800 comparison_code
= unsignedp
? GEU
: GE
;
8802 comparison_code
= unsignedp
? LEU
: LE
;
8804 /* Canonicalize to comparisons against 0. */
8805 if (op1
== const1_rtx
)
8807 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
8808 or (a != 0 ? a : 1) for unsigned.
8809 For MIN we are safe converting (a <= 1 ? a : 1)
8810 into (a <= 0 ? a : 1) */
8811 cmpop1
= const0_rtx
;
8812 if (code
== MAX_EXPR
)
8813 comparison_code
= unsignedp
? NE
: GT
;
8815 if (op1
== constm1_rtx
&& !unsignedp
)
8817 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
8818 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
8819 cmpop1
= const0_rtx
;
8820 if (code
== MIN_EXPR
)
8821 comparison_code
= LT
;
8823 #ifdef HAVE_conditional_move
8824 /* Use a conditional move if possible. */
8825 if (can_conditionally_move_p (mode
))
8831 /* Try to emit the conditional move. */
8832 insn
= emit_conditional_move (target
, comparison_code
,
8837 /* If we could do the conditional move, emit the sequence,
8841 rtx seq
= get_insns ();
8847 /* Otherwise discard the sequence and fall back to code with
8853 emit_move_insn (target
, op0
);
8855 temp
= gen_label_rtx ();
8856 do_compare_rtx_and_jump (target
, cmpop1
, comparison_code
,
8857 unsignedp
, mode
, NULL_RTX
, NULL_RTX
, temp
,
8860 emit_move_insn (target
, op1
);
8865 op0
= expand_expr (treeop0
, subtarget
,
8866 VOIDmode
, EXPAND_NORMAL
);
8867 if (modifier
== EXPAND_STACK_PARM
)
8869 /* In case we have to reduce the result to bitfield precision
8870 for unsigned bitfield expand this as XOR with a proper constant
8872 if (reduce_bit_field
&& TYPE_UNSIGNED (type
))
8873 temp
= expand_binop (mode
, xor_optab
, op0
,
8874 immed_double_int_const
8875 (double_int::mask (TYPE_PRECISION (type
)), mode
),
8876 target
, 1, OPTAB_LIB_WIDEN
);
8878 temp
= expand_unop (mode
, one_cmpl_optab
, op0
, target
, 1);
8882 /* ??? Can optimize bitwise operations with one arg constant.
8883 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8884 and (a bitwise1 b) bitwise2 b (etc)
8885 but that is probably not worth while. */
8894 gcc_assert (VECTOR_MODE_P (TYPE_MODE (type
))
8895 || (GET_MODE_PRECISION (TYPE_MODE (type
))
8896 == TYPE_PRECISION (type
)));
8901 /* If this is a fixed-point operation, then we cannot use the code
8902 below because "expand_shift" doesn't support sat/no-sat fixed-point
8904 if (ALL_FIXED_POINT_MODE_P (mode
))
8907 if (! safe_from_p (subtarget
, treeop1
, 1))
8909 if (modifier
== EXPAND_STACK_PARM
)
8911 op0
= expand_expr (treeop0
, subtarget
,
8912 VOIDmode
, EXPAND_NORMAL
);
8913 temp
= expand_variable_shift (code
, mode
, op0
, treeop1
, target
,
8915 if (code
== LSHIFT_EXPR
)
8916 temp
= REDUCE_BIT_FIELD (temp
);
8919 /* Could determine the answer when only additive constants differ. Also,
8920 the addition of one can be handled by changing the condition. */
8927 case UNORDERED_EXPR
:
8935 temp
= do_store_flag (ops
,
8936 modifier
!= EXPAND_STACK_PARM
? target
: NULL_RTX
,
8937 tmode
!= VOIDmode
? tmode
: mode
);
8941 /* Use a compare and a jump for BLKmode comparisons, or for function
8942 type comparisons is HAVE_canonicalize_funcptr_for_compare. */
8945 || modifier
== EXPAND_STACK_PARM
8946 || ! safe_from_p (target
, treeop0
, 1)
8947 || ! safe_from_p (target
, treeop1
, 1)
8948 /* Make sure we don't have a hard reg (such as function's return
8949 value) live across basic blocks, if not optimizing. */
8950 || (!optimize
&& REG_P (target
)
8951 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)))
8952 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
8954 emit_move_insn (target
, const0_rtx
);
8956 op1
= gen_label_rtx ();
8957 jumpifnot_1 (code
, treeop0
, treeop1
, op1
, -1);
8959 if (TYPE_PRECISION (type
) == 1 && !TYPE_UNSIGNED (type
))
8960 emit_move_insn (target
, constm1_rtx
);
8962 emit_move_insn (target
, const1_rtx
);
8968 /* Get the rtx code of the operands. */
8969 op0
= expand_normal (treeop0
);
8970 op1
= expand_normal (treeop1
);
8973 target
= gen_reg_rtx (TYPE_MODE (type
));
8975 /* If target overlaps with op1, then either we need to force
8976 op1 into a pseudo (if target also overlaps with op0),
8977 or write the complex parts in reverse order. */
8978 switch (GET_CODE (target
))
8981 if (reg_overlap_mentioned_p (XEXP (target
, 0), op1
))
8983 if (reg_overlap_mentioned_p (XEXP (target
, 1), op0
))
8985 complex_expr_force_op1
:
8986 temp
= gen_reg_rtx (GET_MODE_INNER (GET_MODE (target
)));
8987 emit_move_insn (temp
, op1
);
8991 complex_expr_swap_order
:
8992 /* Move the imaginary (op1) and real (op0) parts to their
8994 write_complex_part (target
, op1
, true);
8995 write_complex_part (target
, op0
, false);
9001 temp
= adjust_address_nv (target
,
9002 GET_MODE_INNER (GET_MODE (target
)), 0);
9003 if (reg_overlap_mentioned_p (temp
, op1
))
9005 enum machine_mode imode
= GET_MODE_INNER (GET_MODE (target
));
9006 temp
= adjust_address_nv (target
, imode
,
9007 GET_MODE_SIZE (imode
));
9008 if (reg_overlap_mentioned_p (temp
, op0
))
9009 goto complex_expr_force_op1
;
9010 goto complex_expr_swap_order
;
9014 if (reg_overlap_mentioned_p (target
, op1
))
9016 if (reg_overlap_mentioned_p (target
, op0
))
9017 goto complex_expr_force_op1
;
9018 goto complex_expr_swap_order
;
9023 /* Move the real (op0) and imaginary (op1) parts to their location. */
9024 write_complex_part (target
, op0
, false);
9025 write_complex_part (target
, op1
, true);
9029 case WIDEN_SUM_EXPR
:
9031 tree oprnd0
= treeop0
;
9032 tree oprnd1
= treeop1
;
9034 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
9035 target
= expand_widen_pattern_expr (ops
, op0
, NULL_RTX
, op1
,
9040 case REDUC_MAX_EXPR
:
9041 case REDUC_MIN_EXPR
:
9042 case REDUC_PLUS_EXPR
:
9044 op0
= expand_normal (treeop0
);
9045 this_optab
= optab_for_tree_code (code
, type
, optab_default
);
9046 temp
= expand_unop (mode
, this_optab
, op0
, target
, unsignedp
);
9051 case VEC_LSHIFT_EXPR
:
9052 case VEC_RSHIFT_EXPR
:
9054 target
= expand_vec_shift_expr (ops
, target
);
9058 case VEC_UNPACK_HI_EXPR
:
9059 case VEC_UNPACK_LO_EXPR
:
9061 op0
= expand_normal (treeop0
);
9062 temp
= expand_widen_pattern_expr (ops
, op0
, NULL_RTX
, NULL_RTX
,
9068 case VEC_UNPACK_FLOAT_HI_EXPR
:
9069 case VEC_UNPACK_FLOAT_LO_EXPR
:
9071 op0
= expand_normal (treeop0
);
9072 /* The signedness is determined from input operand. */
9073 temp
= expand_widen_pattern_expr
9074 (ops
, op0
, NULL_RTX
, NULL_RTX
,
9075 target
, TYPE_UNSIGNED (TREE_TYPE (treeop0
)));
9081 case VEC_WIDEN_MULT_HI_EXPR
:
9082 case VEC_WIDEN_MULT_LO_EXPR
:
9083 case VEC_WIDEN_MULT_EVEN_EXPR
:
9084 case VEC_WIDEN_MULT_ODD_EXPR
:
9085 case VEC_WIDEN_LSHIFT_HI_EXPR
:
9086 case VEC_WIDEN_LSHIFT_LO_EXPR
:
9087 expand_operands (treeop0
, treeop1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
9088 target
= expand_widen_pattern_expr (ops
, op0
, op1
, NULL_RTX
,
9090 gcc_assert (target
);
9093 case VEC_PACK_TRUNC_EXPR
:
9094 case VEC_PACK_SAT_EXPR
:
9095 case VEC_PACK_FIX_TRUNC_EXPR
:
9096 mode
= TYPE_MODE (TREE_TYPE (treeop0
));
9100 expand_operands (treeop0
, treeop1
, target
, &op0
, &op1
, EXPAND_NORMAL
);
9101 op2
= expand_normal (treeop2
);
9103 /* Careful here: if the target doesn't support integral vector modes,
9104 a constant selection vector could wind up smooshed into a normal
9105 integral constant. */
9106 if (CONSTANT_P (op2
) && GET_CODE (op2
) != CONST_VECTOR
)
9108 tree sel_type
= TREE_TYPE (treeop2
);
9109 enum machine_mode vmode
9110 = mode_for_vector (TYPE_MODE (TREE_TYPE (sel_type
)),
9111 TYPE_VECTOR_SUBPARTS (sel_type
));
9112 gcc_assert (GET_MODE_CLASS (vmode
) == MODE_VECTOR_INT
);
9113 op2
= simplify_subreg (vmode
, op2
, TYPE_MODE (sel_type
), 0);
9114 gcc_assert (op2
&& GET_CODE (op2
) == CONST_VECTOR
);
9117 gcc_assert (GET_MODE_CLASS (GET_MODE (op2
)) == MODE_VECTOR_INT
);
9119 temp
= expand_vec_perm (mode
, op0
, op1
, op2
, target
);
9125 tree oprnd0
= treeop0
;
9126 tree oprnd1
= treeop1
;
9127 tree oprnd2
= treeop2
;
9130 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
9131 op2
= expand_normal (oprnd2
);
9132 target
= expand_widen_pattern_expr (ops
, op0
, op1
, op2
,
9137 case REALIGN_LOAD_EXPR
:
9139 tree oprnd0
= treeop0
;
9140 tree oprnd1
= treeop1
;
9141 tree oprnd2
= treeop2
;
9144 this_optab
= optab_for_tree_code (code
, type
, optab_default
);
9145 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
9146 op2
= expand_normal (oprnd2
);
9147 temp
= expand_ternary_op (mode
, this_optab
, op0
, op1
, op2
,
9154 /* A COND_EXPR with its type being VOID_TYPE represents a
9155 conditional jump and is handled in
9156 expand_gimple_cond_expr. */
9157 gcc_assert (!VOID_TYPE_P (type
));
9159 /* Note that COND_EXPRs whose type is a structure or union
9160 are required to be constructed to contain assignments of
9161 a temporary variable, so that we can evaluate them here
9162 for side effect only. If type is void, we must do likewise. */
9164 gcc_assert (!TREE_ADDRESSABLE (type
)
9166 && TREE_TYPE (treeop1
) != void_type_node
9167 && TREE_TYPE (treeop2
) != void_type_node
);
9169 temp
= expand_cond_expr_using_cmove (treeop0
, treeop1
, treeop2
);
9173 /* If we are not to produce a result, we have no target. Otherwise,
9174 if a target was specified use it; it will not be used as an
9175 intermediate target unless it is safe. If no target, use a
9178 if (modifier
!= EXPAND_STACK_PARM
9180 && safe_from_p (original_target
, treeop0
, 1)
9181 && GET_MODE (original_target
) == mode
9182 && !MEM_P (original_target
))
9183 temp
= original_target
;
9185 temp
= assign_temp (type
, 0, 1);
9187 do_pending_stack_adjust ();
9189 op0
= gen_label_rtx ();
9190 op1
= gen_label_rtx ();
9191 jumpifnot (treeop0
, op0
, -1);
9192 store_expr (treeop1
, temp
,
9193 modifier
== EXPAND_STACK_PARM
,
9196 emit_jump_insn (gen_jump (op1
));
9199 store_expr (treeop2
, temp
,
9200 modifier
== EXPAND_STACK_PARM
,
9208 target
= expand_vec_cond_expr (type
, treeop0
, treeop1
, treeop2
, target
);
9215 /* Here to do an ordinary binary operator. */
9217 expand_operands (treeop0
, treeop1
,
9218 subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
9220 this_optab
= optab_for_tree_code (code
, type
, optab_default
);
9222 if (modifier
== EXPAND_STACK_PARM
)
9224 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
,
9225 unsignedp
, OPTAB_LIB_WIDEN
);
9227 /* Bitwise operations do not need bitfield reduction as we expect their
9228 operands being properly truncated. */
9229 if (code
== BIT_XOR_EXPR
9230 || code
== BIT_AND_EXPR
9231 || code
== BIT_IOR_EXPR
)
9233 return REDUCE_BIT_FIELD (temp
);
9235 #undef REDUCE_BIT_FIELD
9238 /* Return TRUE if expression STMT is suitable for replacement.
9239 Never consider memory loads as replaceable, because those don't ever lead
9240 into constant expressions. */
9243 stmt_is_replaceable_p (gimple stmt
)
9245 if (ssa_is_replaceable_p (stmt
))
9247 /* Don't move around loads. */
9248 if (!gimple_assign_single_p (stmt
)
9249 || is_gimple_val (gimple_assign_rhs1 (stmt
)))
9256 expand_expr_real_1 (tree exp
, rtx target
, enum machine_mode tmode
,
9257 enum expand_modifier modifier
, rtx
*alt_rtl
,
9258 bool inner_reference_p
)
9260 rtx op0
, op1
, temp
, decl_rtl
;
9263 enum machine_mode mode
;
9264 enum tree_code code
= TREE_CODE (exp
);
9265 rtx subtarget
, original_target
;
9268 bool reduce_bit_field
;
9269 location_t loc
= EXPR_LOCATION (exp
);
9270 struct separate_ops ops
;
9271 tree treeop0
, treeop1
, treeop2
;
9272 tree ssa_name
= NULL_TREE
;
9275 type
= TREE_TYPE (exp
);
9276 mode
= TYPE_MODE (type
);
9277 unsignedp
= TYPE_UNSIGNED (type
);
9279 treeop0
= treeop1
= treeop2
= NULL_TREE
;
9280 if (!VL_EXP_CLASS_P (exp
))
9281 switch (TREE_CODE_LENGTH (code
))
9284 case 3: treeop2
= TREE_OPERAND (exp
, 2);
9285 case 2: treeop1
= TREE_OPERAND (exp
, 1);
9286 case 1: treeop0
= TREE_OPERAND (exp
, 0);
9296 ignore
= (target
== const0_rtx
9297 || ((CONVERT_EXPR_CODE_P (code
)
9298 || code
== COND_EXPR
|| code
== VIEW_CONVERT_EXPR
)
9299 && TREE_CODE (type
) == VOID_TYPE
));
9301 /* An operation in what may be a bit-field type needs the
9302 result to be reduced to the precision of the bit-field type,
9303 which is narrower than that of the type's mode. */
9304 reduce_bit_field
= (!ignore
9305 && INTEGRAL_TYPE_P (type
)
9306 && GET_MODE_PRECISION (mode
) > TYPE_PRECISION (type
));
9308 /* If we are going to ignore this result, we need only do something
9309 if there is a side-effect somewhere in the expression. If there
9310 is, short-circuit the most common cases here. Note that we must
9311 not call expand_expr with anything but const0_rtx in case this
9312 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
9316 if (! TREE_SIDE_EFFECTS (exp
))
9319 /* Ensure we reference a volatile object even if value is ignored, but
9320 don't do this if all we are doing is taking its address. */
9321 if (TREE_THIS_VOLATILE (exp
)
9322 && TREE_CODE (exp
) != FUNCTION_DECL
9323 && mode
!= VOIDmode
&& mode
!= BLKmode
9324 && modifier
!= EXPAND_CONST_ADDRESS
)
9326 temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, modifier
);
9332 if (TREE_CODE_CLASS (code
) == tcc_unary
9333 || code
== BIT_FIELD_REF
9334 || code
== COMPONENT_REF
9335 || code
== INDIRECT_REF
)
9336 return expand_expr (treeop0
, const0_rtx
, VOIDmode
,
9339 else if (TREE_CODE_CLASS (code
) == tcc_binary
9340 || TREE_CODE_CLASS (code
) == tcc_comparison
9341 || code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
9343 expand_expr (treeop0
, const0_rtx
, VOIDmode
, modifier
);
9344 expand_expr (treeop1
, const0_rtx
, VOIDmode
, modifier
);
9351 if (reduce_bit_field
&& modifier
== EXPAND_STACK_PARM
)
9354 /* Use subtarget as the target for operand 0 of a binary operation. */
9355 subtarget
= get_subtarget (target
);
9356 original_target
= target
;
9362 tree function
= decl_function_context (exp
);
9364 temp
= label_rtx (exp
);
9365 temp
= gen_rtx_LABEL_REF (Pmode
, temp
);
9367 if (function
!= current_function_decl
9369 LABEL_REF_NONLOCAL_P (temp
) = 1;
9371 temp
= gen_rtx_MEM (FUNCTION_MODE
, temp
);
9376 /* ??? ivopts calls expander, without any preparation from
9377 out-of-ssa. So fake instructions as if this was an access to the
9378 base variable. This unnecessarily allocates a pseudo, see how we can
9379 reuse it, if partition base vars have it set already. */
9380 if (!currently_expanding_to_rtl
)
9382 tree var
= SSA_NAME_VAR (exp
);
9383 if (var
&& DECL_RTL_SET_P (var
))
9384 return DECL_RTL (var
);
9385 return gen_raw_REG (TYPE_MODE (TREE_TYPE (exp
)),
9386 LAST_VIRTUAL_REGISTER
+ 1);
9389 g
= get_gimple_for_ssa_name (exp
);
9390 /* For EXPAND_INITIALIZER try harder to get something simpler. */
9392 && modifier
== EXPAND_INITIALIZER
9393 && !SSA_NAME_IS_DEFAULT_DEF (exp
)
9394 && (optimize
|| DECL_IGNORED_P (SSA_NAME_VAR (exp
)))
9395 && stmt_is_replaceable_p (SSA_NAME_DEF_STMT (exp
)))
9396 g
= SSA_NAME_DEF_STMT (exp
);
9400 location_t saved_loc
= curr_insn_location ();
9402 set_curr_insn_location (gimple_location (g
));
9403 r
= expand_expr_real (gimple_assign_rhs_to_tree (g
), target
,
9404 tmode
, modifier
, NULL
, inner_reference_p
);
9405 set_curr_insn_location (saved_loc
);
9406 if (REG_P (r
) && !REG_EXPR (r
))
9407 set_reg_attrs_for_decl_rtl (SSA_NAME_VAR (exp
), r
);
9412 decl_rtl
= get_rtx_for_ssa_name (ssa_name
);
9413 exp
= SSA_NAME_VAR (ssa_name
);
9414 goto expand_decl_rtl
;
9418 /* If a static var's type was incomplete when the decl was written,
9419 but the type is complete now, lay out the decl now. */
9420 if (DECL_SIZE (exp
) == 0
9421 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp
))
9422 && (TREE_STATIC (exp
) || DECL_EXTERNAL (exp
)))
9423 layout_decl (exp
, 0);
9425 /* ... fall through ... */
9429 decl_rtl
= DECL_RTL (exp
);
9431 gcc_assert (decl_rtl
);
9432 decl_rtl
= copy_rtx (decl_rtl
);
9433 /* Record writes to register variables. */
9434 if (modifier
== EXPAND_WRITE
9436 && HARD_REGISTER_P (decl_rtl
))
9437 add_to_hard_reg_set (&crtl
->asm_clobbers
,
9438 GET_MODE (decl_rtl
), REGNO (decl_rtl
));
9440 /* Ensure variable marked as used even if it doesn't go through
9441 a parser. If it hasn't be used yet, write out an external
9443 TREE_USED (exp
) = 1;
9445 /* Show we haven't gotten RTL for this yet. */
9448 /* Variables inherited from containing functions should have
9449 been lowered by this point. */
9450 context
= decl_function_context (exp
);
9451 gcc_assert (SCOPE_FILE_SCOPE_P (context
)
9452 || context
== current_function_decl
9453 || TREE_STATIC (exp
)
9454 || DECL_EXTERNAL (exp
)
9455 /* ??? C++ creates functions that are not TREE_STATIC. */
9456 || TREE_CODE (exp
) == FUNCTION_DECL
);
9458 /* This is the case of an array whose size is to be determined
9459 from its initializer, while the initializer is still being parsed.
9460 ??? We aren't parsing while expanding anymore. */
9462 if (MEM_P (decl_rtl
) && REG_P (XEXP (decl_rtl
, 0)))
9463 temp
= validize_mem (decl_rtl
);
9465 /* If DECL_RTL is memory, we are in the normal case and the
9466 address is not valid, get the address into a register. */
9468 else if (MEM_P (decl_rtl
) && modifier
!= EXPAND_INITIALIZER
)
9471 *alt_rtl
= decl_rtl
;
9472 decl_rtl
= use_anchored_address (decl_rtl
);
9473 if (modifier
!= EXPAND_CONST_ADDRESS
9474 && modifier
!= EXPAND_SUM
9475 && !memory_address_addr_space_p (DECL_MODE (exp
),
9477 MEM_ADDR_SPACE (decl_rtl
)))
9478 temp
= replace_equiv_address (decl_rtl
,
9479 copy_rtx (XEXP (decl_rtl
, 0)));
9482 /* If we got something, return it. But first, set the alignment
9483 if the address is a register. */
9486 if (MEM_P (temp
) && REG_P (XEXP (temp
, 0)))
9487 mark_reg_pointer (XEXP (temp
, 0), DECL_ALIGN (exp
));
9492 /* If the mode of DECL_RTL does not match that of the decl,
9493 there are two cases: we are dealing with a BLKmode value
9494 that is returned in a register, or we are dealing with
9495 a promoted value. In the latter case, return a SUBREG
9496 of the wanted mode, but mark it so that we know that it
9497 was already extended. */
9498 if (REG_P (decl_rtl
)
9499 && DECL_MODE (exp
) != BLKmode
9500 && GET_MODE (decl_rtl
) != DECL_MODE (exp
))
9502 enum machine_mode pmode
;
9504 /* Get the signedness to be used for this variable. Ensure we get
9505 the same mode we got when the variable was declared. */
9506 if (code
== SSA_NAME
9507 && (g
= SSA_NAME_DEF_STMT (ssa_name
))
9508 && gimple_code (g
) == GIMPLE_CALL
9509 && !gimple_call_internal_p (g
))
9510 pmode
= promote_function_mode (type
, mode
, &unsignedp
,
9511 gimple_call_fntype (g
),
9514 pmode
= promote_decl_mode (exp
, &unsignedp
);
9515 gcc_assert (GET_MODE (decl_rtl
) == pmode
);
9517 temp
= gen_lowpart_SUBREG (mode
, decl_rtl
);
9518 SUBREG_PROMOTED_VAR_P (temp
) = 1;
9519 SUBREG_PROMOTED_UNSIGNED_SET (temp
, unsignedp
);
9526 temp
= immed_double_const (TREE_INT_CST_LOW (exp
),
9527 TREE_INT_CST_HIGH (exp
), mode
);
9533 tree tmp
= NULL_TREE
;
9534 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
9535 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
9536 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FRACT
9537 || GET_MODE_CLASS (mode
) == MODE_VECTOR_UFRACT
9538 || GET_MODE_CLASS (mode
) == MODE_VECTOR_ACCUM
9539 || GET_MODE_CLASS (mode
) == MODE_VECTOR_UACCUM
)
9540 return const_vector_from_tree (exp
);
9541 if (GET_MODE_CLASS (mode
) == MODE_INT
)
9543 tree type_for_mode
= lang_hooks
.types
.type_for_mode (mode
, 1);
9545 tmp
= fold_unary_loc (loc
, VIEW_CONVERT_EXPR
, type_for_mode
, exp
);
9549 vec
<constructor_elt
, va_gc
> *v
;
9551 vec_alloc (v
, VECTOR_CST_NELTS (exp
));
9552 for (i
= 0; i
< VECTOR_CST_NELTS (exp
); ++i
)
9553 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, VECTOR_CST_ELT (exp
, i
));
9554 tmp
= build_constructor (type
, v
);
9556 return expand_expr (tmp
, ignore
? const0_rtx
: target
,
9561 return expand_expr (DECL_INITIAL (exp
), target
, VOIDmode
, modifier
);
9564 /* If optimized, generate immediate CONST_DOUBLE
9565 which will be turned into memory by reload if necessary.
9567 We used to force a register so that loop.c could see it. But
9568 this does not allow gen_* patterns to perform optimizations with
9569 the constants. It also produces two insns in cases like "x = 1.0;".
9570 On most machines, floating-point constants are not permitted in
9571 many insns, so we'd end up copying it to a register in any case.
9573 Now, we do the copying in expand_binop, if appropriate. */
9574 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp
),
9575 TYPE_MODE (TREE_TYPE (exp
)));
9578 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp
),
9579 TYPE_MODE (TREE_TYPE (exp
)));
9582 /* Handle evaluating a complex constant in a CONCAT target. */
9583 if (original_target
&& GET_CODE (original_target
) == CONCAT
)
9585 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
9588 rtarg
= XEXP (original_target
, 0);
9589 itarg
= XEXP (original_target
, 1);
9591 /* Move the real and imaginary parts separately. */
9592 op0
= expand_expr (TREE_REALPART (exp
), rtarg
, mode
, EXPAND_NORMAL
);
9593 op1
= expand_expr (TREE_IMAGPART (exp
), itarg
, mode
, EXPAND_NORMAL
);
9596 emit_move_insn (rtarg
, op0
);
9598 emit_move_insn (itarg
, op1
);
9600 return original_target
;
9603 /* ... fall through ... */
9606 temp
= expand_expr_constant (exp
, 1, modifier
);
9608 /* temp contains a constant address.
9609 On RISC machines where a constant address isn't valid,
9610 make some insns to get that address into a register. */
9611 if (modifier
!= EXPAND_CONST_ADDRESS
9612 && modifier
!= EXPAND_INITIALIZER
9613 && modifier
!= EXPAND_SUM
9614 && ! memory_address_addr_space_p (mode
, XEXP (temp
, 0),
9615 MEM_ADDR_SPACE (temp
)))
9616 return replace_equiv_address (temp
,
9617 copy_rtx (XEXP (temp
, 0)));
9623 rtx ret
= expand_expr_real_1 (val
, target
, tmode
, modifier
, alt_rtl
,
9626 if (!SAVE_EXPR_RESOLVED_P (exp
))
9628 /* We can indeed still hit this case, typically via builtin
9629 expanders calling save_expr immediately before expanding
9630 something. Assume this means that we only have to deal
9631 with non-BLKmode values. */
9632 gcc_assert (GET_MODE (ret
) != BLKmode
);
9634 val
= build_decl (curr_insn_location (),
9635 VAR_DECL
, NULL
, TREE_TYPE (exp
));
9636 DECL_ARTIFICIAL (val
) = 1;
9637 DECL_IGNORED_P (val
) = 1;
9639 TREE_OPERAND (exp
, 0) = treeop0
;
9640 SAVE_EXPR_RESOLVED_P (exp
) = 1;
9642 if (!CONSTANT_P (ret
))
9643 ret
= copy_to_reg (ret
);
9644 SET_DECL_RTL (val
, ret
);
9652 /* If we don't need the result, just ensure we evaluate any
9656 unsigned HOST_WIDE_INT idx
;
9659 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
9660 expand_expr (value
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
9665 return expand_constructor (exp
, target
, modifier
, false);
9667 case TARGET_MEM_REF
:
9670 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
9671 enum insn_code icode
;
9674 op0
= addr_for_mem_ref (exp
, as
, true);
9675 op0
= memory_address_addr_space (mode
, op0
, as
);
9676 temp
= gen_rtx_MEM (mode
, op0
);
9677 set_mem_attributes (temp
, exp
, 0);
9678 set_mem_addr_space (temp
, as
);
9679 align
= get_object_alignment (exp
);
9680 if (modifier
!= EXPAND_WRITE
9681 && modifier
!= EXPAND_MEMORY
9683 && align
< GET_MODE_ALIGNMENT (mode
)
9684 /* If the target does not have special handling for unaligned
9685 loads of mode then it can use regular moves for them. */
9686 && ((icode
= optab_handler (movmisalign_optab
, mode
))
9687 != CODE_FOR_nothing
))
9689 struct expand_operand ops
[2];
9691 /* We've already validated the memory, and we're creating a
9692 new pseudo destination. The predicates really can't fail,
9693 nor can the generator. */
9694 create_output_operand (&ops
[0], NULL_RTX
, mode
);
9695 create_fixed_operand (&ops
[1], temp
);
9696 expand_insn (icode
, 2, ops
);
9697 temp
= ops
[0].value
;
9705 = TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
9706 enum machine_mode address_mode
;
9707 tree base
= TREE_OPERAND (exp
, 0);
9709 enum insn_code icode
;
9711 /* Handle expansion of non-aliased memory with non-BLKmode. That
9712 might end up in a register. */
9713 if (mem_ref_refers_to_non_mem_p (exp
))
9715 HOST_WIDE_INT offset
= mem_ref_offset (exp
).low
;
9716 base
= TREE_OPERAND (base
, 0);
9718 && tree_fits_uhwi_p (TYPE_SIZE (type
))
9719 && (GET_MODE_BITSIZE (DECL_MODE (base
))
9720 == tree_to_uhwi (TYPE_SIZE (type
))))
9721 return expand_expr (build1 (VIEW_CONVERT_EXPR
, type
, base
),
9722 target
, tmode
, modifier
);
9723 if (TYPE_MODE (type
) == BLKmode
)
9725 temp
= assign_stack_temp (DECL_MODE (base
),
9726 GET_MODE_SIZE (DECL_MODE (base
)));
9727 store_expr (base
, temp
, 0, false);
9728 temp
= adjust_address (temp
, BLKmode
, offset
);
9729 set_mem_size (temp
, int_size_in_bytes (type
));
9732 exp
= build3 (BIT_FIELD_REF
, type
, base
, TYPE_SIZE (type
),
9733 bitsize_int (offset
* BITS_PER_UNIT
));
9734 return expand_expr (exp
, target
, tmode
, modifier
);
9736 address_mode
= targetm
.addr_space
.address_mode (as
);
9737 base
= TREE_OPERAND (exp
, 0);
9738 if ((def_stmt
= get_def_for_expr (base
, BIT_AND_EXPR
)))
9740 tree mask
= gimple_assign_rhs2 (def_stmt
);
9741 base
= build2 (BIT_AND_EXPR
, TREE_TYPE (base
),
9742 gimple_assign_rhs1 (def_stmt
), mask
);
9743 TREE_OPERAND (exp
, 0) = base
;
9745 align
= get_object_alignment (exp
);
9746 op0
= expand_expr (base
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
9747 op0
= memory_address_addr_space (mode
, op0
, as
);
9748 if (!integer_zerop (TREE_OPERAND (exp
, 1)))
9751 = immed_double_int_const (mem_ref_offset (exp
), address_mode
);
9752 op0
= simplify_gen_binary (PLUS
, address_mode
, op0
, off
);
9753 op0
= memory_address_addr_space (mode
, op0
, as
);
9755 temp
= gen_rtx_MEM (mode
, op0
);
9756 set_mem_attributes (temp
, exp
, 0);
9757 set_mem_addr_space (temp
, as
);
9758 if (TREE_THIS_VOLATILE (exp
))
9759 MEM_VOLATILE_P (temp
) = 1;
9760 if (modifier
!= EXPAND_WRITE
9761 && modifier
!= EXPAND_MEMORY
9762 && !inner_reference_p
9764 && align
< GET_MODE_ALIGNMENT (mode
))
9766 if ((icode
= optab_handler (movmisalign_optab
, mode
))
9767 != CODE_FOR_nothing
)
9769 struct expand_operand ops
[2];
9771 /* We've already validated the memory, and we're creating a
9772 new pseudo destination. The predicates really can't fail,
9773 nor can the generator. */
9774 create_output_operand (&ops
[0], NULL_RTX
, mode
);
9775 create_fixed_operand (&ops
[1], temp
);
9776 expand_insn (icode
, 2, ops
);
9777 temp
= ops
[0].value
;
9779 else if (SLOW_UNALIGNED_ACCESS (mode
, align
))
9780 temp
= extract_bit_field (temp
, GET_MODE_BITSIZE (mode
),
9781 0, TYPE_UNSIGNED (TREE_TYPE (exp
)),
9782 (modifier
== EXPAND_STACK_PARM
9783 ? NULL_RTX
: target
),
9792 tree array
= treeop0
;
9793 tree index
= treeop1
;
9796 /* Fold an expression like: "foo"[2].
9797 This is not done in fold so it won't happen inside &.
9798 Don't fold if this is for wide characters since it's too
9799 difficult to do correctly and this is a very rare case. */
9801 if (modifier
!= EXPAND_CONST_ADDRESS
9802 && modifier
!= EXPAND_INITIALIZER
9803 && modifier
!= EXPAND_MEMORY
)
9805 tree t
= fold_read_from_constant_string (exp
);
9808 return expand_expr (t
, target
, tmode
, modifier
);
9811 /* If this is a constant index into a constant array,
9812 just get the value from the array. Handle both the cases when
9813 we have an explicit constructor and when our operand is a variable
9814 that was declared const. */
9816 if (modifier
!= EXPAND_CONST_ADDRESS
9817 && modifier
!= EXPAND_INITIALIZER
9818 && modifier
!= EXPAND_MEMORY
9819 && TREE_CODE (array
) == CONSTRUCTOR
9820 && ! TREE_SIDE_EFFECTS (array
)
9821 && TREE_CODE (index
) == INTEGER_CST
)
9823 unsigned HOST_WIDE_INT ix
;
9826 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array
), ix
,
9828 if (tree_int_cst_equal (field
, index
))
9830 if (!TREE_SIDE_EFFECTS (value
))
9831 return expand_expr (fold (value
), target
, tmode
, modifier
);
9836 else if (optimize
>= 1
9837 && modifier
!= EXPAND_CONST_ADDRESS
9838 && modifier
!= EXPAND_INITIALIZER
9839 && modifier
!= EXPAND_MEMORY
9840 && TREE_READONLY (array
) && ! TREE_SIDE_EFFECTS (array
)
9841 && TREE_CODE (index
) == INTEGER_CST
9842 && (TREE_CODE (array
) == VAR_DECL
9843 || TREE_CODE (array
) == CONST_DECL
)
9844 && (init
= ctor_for_folding (array
)) != error_mark_node
)
9846 if (init
== NULL_TREE
)
9848 tree value
= build_zero_cst (type
);
9849 if (TREE_CODE (value
) == CONSTRUCTOR
)
9851 /* If VALUE is a CONSTRUCTOR, this optimization is only
9852 useful if this doesn't store the CONSTRUCTOR into
9853 memory. If it does, it is more efficient to just
9854 load the data from the array directly. */
9855 rtx ret
= expand_constructor (value
, target
,
9857 if (ret
== NULL_RTX
)
9862 return expand_expr (value
, target
, tmode
, modifier
);
9864 else if (TREE_CODE (init
) == CONSTRUCTOR
)
9866 unsigned HOST_WIDE_INT ix
;
9869 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), ix
,
9871 if (tree_int_cst_equal (field
, index
))
9873 if (TREE_SIDE_EFFECTS (value
))
9876 if (TREE_CODE (value
) == CONSTRUCTOR
)
9878 /* If VALUE is a CONSTRUCTOR, this
9879 optimization is only useful if
9880 this doesn't store the CONSTRUCTOR
9881 into memory. If it does, it is more
9882 efficient to just load the data from
9883 the array directly. */
9884 rtx ret
= expand_constructor (value
, target
,
9886 if (ret
== NULL_RTX
)
9891 expand_expr (fold (value
), target
, tmode
, modifier
);
9894 else if (TREE_CODE (init
) == STRING_CST
)
9896 tree low_bound
= array_ref_low_bound (exp
);
9897 tree index1
= fold_convert_loc (loc
, sizetype
, treeop1
);
9899 /* Optimize the special case of a zero lower bound.
9901 We convert the lower bound to sizetype to avoid problems
9902 with constant folding. E.g. suppose the lower bound is
9903 1 and its mode is QI. Without the conversion
9904 (ARRAY + (INDEX - (unsigned char)1))
9906 (ARRAY + (-(unsigned char)1) + INDEX)
9908 (ARRAY + 255 + INDEX). Oops! */
9909 if (!integer_zerop (low_bound
))
9910 index1
= size_diffop_loc (loc
, index1
,
9911 fold_convert_loc (loc
, sizetype
,
9914 if (compare_tree_int (index1
, TREE_STRING_LENGTH (init
)) < 0)
9916 tree type
= TREE_TYPE (TREE_TYPE (init
));
9917 enum machine_mode mode
= TYPE_MODE (type
);
9919 if (GET_MODE_CLASS (mode
) == MODE_INT
9920 && GET_MODE_SIZE (mode
) == 1)
9921 return gen_int_mode (TREE_STRING_POINTER (init
)
9922 [TREE_INT_CST_LOW (index1
)],
9928 goto normal_inner_ref
;
9931 /* If the operand is a CONSTRUCTOR, we can just extract the
9932 appropriate field if it is present. */
9933 if (TREE_CODE (treeop0
) == CONSTRUCTOR
)
9935 unsigned HOST_WIDE_INT idx
;
9938 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (treeop0
),
9940 if (field
== treeop1
9941 /* We can normally use the value of the field in the
9942 CONSTRUCTOR. However, if this is a bitfield in
9943 an integral mode that we can fit in a HOST_WIDE_INT,
9944 we must mask only the number of bits in the bitfield,
9945 since this is done implicitly by the constructor. If
9946 the bitfield does not meet either of those conditions,
9947 we can't do this optimization. */
9948 && (! DECL_BIT_FIELD (field
)
9949 || ((GET_MODE_CLASS (DECL_MODE (field
)) == MODE_INT
)
9950 && (GET_MODE_PRECISION (DECL_MODE (field
))
9951 <= HOST_BITS_PER_WIDE_INT
))))
9953 if (DECL_BIT_FIELD (field
)
9954 && modifier
== EXPAND_STACK_PARM
)
9956 op0
= expand_expr (value
, target
, tmode
, modifier
);
9957 if (DECL_BIT_FIELD (field
))
9959 HOST_WIDE_INT bitsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
9960 enum machine_mode imode
= TYPE_MODE (TREE_TYPE (field
));
9962 if (TYPE_UNSIGNED (TREE_TYPE (field
)))
9964 op1
= gen_int_mode (((HOST_WIDE_INT
) 1 << bitsize
) - 1,
9966 op0
= expand_and (imode
, op0
, op1
, target
);
9970 int count
= GET_MODE_PRECISION (imode
) - bitsize
;
9972 op0
= expand_shift (LSHIFT_EXPR
, imode
, op0
, count
,
9974 op0
= expand_shift (RSHIFT_EXPR
, imode
, op0
, count
,
9982 goto normal_inner_ref
;
9985 case ARRAY_RANGE_REF
:
9988 enum machine_mode mode1
, mode2
;
9989 HOST_WIDE_INT bitsize
, bitpos
;
9991 int volatilep
= 0, must_force_mem
;
9992 tree tem
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
9993 &mode1
, &unsignedp
, &volatilep
, true);
9994 rtx orig_op0
, memloc
;
9995 bool mem_attrs_from_type
= false;
9997 /* If we got back the original object, something is wrong. Perhaps
9998 we are evaluating an expression too early. In any event, don't
9999 infinitely recurse. */
10000 gcc_assert (tem
!= exp
);
10002 /* If TEM's type is a union of variable size, pass TARGET to the inner
10003 computation, since it will need a temporary and TARGET is known
10004 to have to do. This occurs in unchecked conversion in Ada. */
10006 = expand_expr_real (tem
,
10007 (TREE_CODE (TREE_TYPE (tem
)) == UNION_TYPE
10008 && COMPLETE_TYPE_P (TREE_TYPE (tem
))
10009 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem
)))
10011 && modifier
!= EXPAND_STACK_PARM
10012 ? target
: NULL_RTX
),
10014 modifier
== EXPAND_SUM
? EXPAND_NORMAL
: modifier
,
10017 /* If the field has a mode, we want to access it in the
10018 field's mode, not the computed mode.
10019 If a MEM has VOIDmode (external with incomplete type),
10020 use BLKmode for it instead. */
10023 if (mode1
!= VOIDmode
)
10024 op0
= adjust_address (op0
, mode1
, 0);
10025 else if (GET_MODE (op0
) == VOIDmode
)
10026 op0
= adjust_address (op0
, BLKmode
, 0);
10030 = CONSTANT_P (op0
) ? TYPE_MODE (TREE_TYPE (tem
)) : GET_MODE (op0
);
10032 /* If we have either an offset, a BLKmode result, or a reference
10033 outside the underlying object, we must force it to memory.
10034 Such a case can occur in Ada if we have unchecked conversion
10035 of an expression from a scalar type to an aggregate type or
10036 for an ARRAY_RANGE_REF whose type is BLKmode, or if we were
10037 passed a partially uninitialized object or a view-conversion
10038 to a larger size. */
10039 must_force_mem
= (offset
10040 || mode1
== BLKmode
10041 || bitpos
+ bitsize
> GET_MODE_BITSIZE (mode2
));
10043 /* Handle CONCAT first. */
10044 if (GET_CODE (op0
) == CONCAT
&& !must_force_mem
)
10047 && bitsize
== GET_MODE_BITSIZE (GET_MODE (op0
)))
10050 && bitsize
== GET_MODE_BITSIZE (GET_MODE (XEXP (op0
, 0)))
10053 op0
= XEXP (op0
, 0);
10054 mode2
= GET_MODE (op0
);
10056 else if (bitpos
== GET_MODE_BITSIZE (GET_MODE (XEXP (op0
, 0)))
10057 && bitsize
== GET_MODE_BITSIZE (GET_MODE (XEXP (op0
, 1)))
10061 op0
= XEXP (op0
, 1);
10063 mode2
= GET_MODE (op0
);
10066 /* Otherwise force into memory. */
10067 must_force_mem
= 1;
10070 /* If this is a constant, put it in a register if it is a legitimate
10071 constant and we don't need a memory reference. */
10072 if (CONSTANT_P (op0
)
10073 && mode2
!= BLKmode
10074 && targetm
.legitimate_constant_p (mode2
, op0
)
10075 && !must_force_mem
)
10076 op0
= force_reg (mode2
, op0
);
10078 /* Otherwise, if this is a constant, try to force it to the constant
10079 pool. Note that back-ends, e.g. MIPS, may refuse to do so if it
10080 is a legitimate constant. */
10081 else if (CONSTANT_P (op0
) && (memloc
= force_const_mem (mode2
, op0
)))
10082 op0
= validize_mem (memloc
);
10084 /* Otherwise, if this is a constant or the object is not in memory
10085 and need be, put it there. */
10086 else if (CONSTANT_P (op0
) || (!MEM_P (op0
) && must_force_mem
))
10088 memloc
= assign_temp (TREE_TYPE (tem
), 1, 1);
10089 emit_move_insn (memloc
, op0
);
10091 mem_attrs_from_type
= true;
10096 enum machine_mode address_mode
;
10097 rtx offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
,
10100 gcc_assert (MEM_P (op0
));
10102 address_mode
= get_address_mode (op0
);
10103 if (GET_MODE (offset_rtx
) != address_mode
)
10104 offset_rtx
= convert_to_mode (address_mode
, offset_rtx
, 0);
10106 if (GET_MODE (op0
) == BLKmode
10107 /* The check for a constant address in OP0 not having VOIDmode
10108 is probably no longer necessary. */
10109 && GET_MODE (XEXP (op0
, 0)) != VOIDmode
10111 && (bitpos
% bitsize
) == 0
10112 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
10113 && MEM_ALIGN (op0
) == GET_MODE_ALIGNMENT (mode1
))
10115 op0
= adjust_address (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
10119 op0
= offset_address (op0
, offset_rtx
,
10120 highest_pow2_factor (offset
));
10123 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
10124 record its alignment as BIGGEST_ALIGNMENT. */
10125 if (MEM_P (op0
) && bitpos
== 0 && offset
!= 0
10126 && is_aligning_offset (offset
, tem
))
10127 set_mem_align (op0
, BIGGEST_ALIGNMENT
);
10129 /* Don't forget about volatility even if this is a bitfield. */
10130 if (MEM_P (op0
) && volatilep
&& ! MEM_VOLATILE_P (op0
))
10132 if (op0
== orig_op0
)
10133 op0
= copy_rtx (op0
);
10135 MEM_VOLATILE_P (op0
) = 1;
10138 /* In cases where an aligned union has an unaligned object
10139 as a field, we might be extracting a BLKmode value from
10140 an integer-mode (e.g., SImode) object. Handle this case
10141 by doing the extract into an object as wide as the field
10142 (which we know to be the width of a basic mode), then
10143 storing into memory, and changing the mode to BLKmode. */
10144 if (mode1
== VOIDmode
10145 || REG_P (op0
) || GET_CODE (op0
) == SUBREG
10146 || (mode1
!= BLKmode
&& ! direct_load
[(int) mode1
]
10147 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
10148 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
10149 && modifier
!= EXPAND_CONST_ADDRESS
10150 && modifier
!= EXPAND_INITIALIZER
10151 && modifier
!= EXPAND_MEMORY
)
10152 /* If the bitfield is volatile and the bitsize
10153 is narrower than the access size of the bitfield,
10154 we need to extract bitfields from the access. */
10155 || (volatilep
&& TREE_CODE (exp
) == COMPONENT_REF
10156 && DECL_BIT_FIELD_TYPE (TREE_OPERAND (exp
, 1))
10157 && mode1
!= BLKmode
10158 && bitsize
< GET_MODE_SIZE (mode1
) * BITS_PER_UNIT
)
10159 /* If the field isn't aligned enough to fetch as a memref,
10160 fetch it as a bit field. */
10161 || (mode1
!= BLKmode
10162 && (((TYPE_ALIGN (TREE_TYPE (tem
)) < GET_MODE_ALIGNMENT (mode
)
10163 || (bitpos
% GET_MODE_ALIGNMENT (mode
) != 0)
10165 && (MEM_ALIGN (op0
) < GET_MODE_ALIGNMENT (mode1
)
10166 || (bitpos
% GET_MODE_ALIGNMENT (mode1
) != 0))))
10167 && modifier
!= EXPAND_MEMORY
10168 && ((modifier
== EXPAND_CONST_ADDRESS
10169 || modifier
== EXPAND_INITIALIZER
)
10171 : SLOW_UNALIGNED_ACCESS (mode1
, MEM_ALIGN (op0
))))
10172 || (bitpos
% BITS_PER_UNIT
!= 0)))
10173 /* If the type and the field are a constant size and the
10174 size of the type isn't the same size as the bitfield,
10175 we must use bitfield operations. */
10177 && TYPE_SIZE (TREE_TYPE (exp
))
10178 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
10179 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)),
10182 enum machine_mode ext_mode
= mode
;
10184 if (ext_mode
== BLKmode
10185 && ! (target
!= 0 && MEM_P (op0
)
10187 && bitpos
% BITS_PER_UNIT
== 0))
10188 ext_mode
= mode_for_size (bitsize
, MODE_INT
, 1);
10190 if (ext_mode
== BLKmode
)
10193 target
= assign_temp (type
, 1, 1);
10195 /* ??? Unlike the similar test a few lines below, this one is
10196 very likely obsolete. */
10200 /* In this case, BITPOS must start at a byte boundary and
10201 TARGET, if specified, must be a MEM. */
10202 gcc_assert (MEM_P (op0
)
10203 && (!target
|| MEM_P (target
))
10204 && !(bitpos
% BITS_PER_UNIT
));
10206 emit_block_move (target
,
10207 adjust_address (op0
, VOIDmode
,
10208 bitpos
/ BITS_PER_UNIT
),
10209 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
10211 (modifier
== EXPAND_STACK_PARM
10212 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
10217 /* If we have nothing to extract, the result will be 0 for targets
10218 with SHIFT_COUNT_TRUNCATED == 0 and garbage otherwise. Always
10219 return 0 for the sake of consistency, as reading a zero-sized
10220 bitfield is valid in Ada and the value is fully specified. */
10224 op0
= validize_mem (op0
);
10226 if (MEM_P (op0
) && REG_P (XEXP (op0
, 0)))
10227 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
10229 op0
= extract_bit_field (op0
, bitsize
, bitpos
, unsignedp
,
10230 (modifier
== EXPAND_STACK_PARM
10231 ? NULL_RTX
: target
),
10232 ext_mode
, ext_mode
);
10234 /* If the result is a record type and BITSIZE is narrower than
10235 the mode of OP0, an integral mode, and this is a big endian
10236 machine, we must put the field into the high-order bits. */
10237 if (TREE_CODE (type
) == RECORD_TYPE
&& BYTES_BIG_ENDIAN
10238 && GET_MODE_CLASS (GET_MODE (op0
)) == MODE_INT
10239 && bitsize
< (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (op0
)))
10240 op0
= expand_shift (LSHIFT_EXPR
, GET_MODE (op0
), op0
,
10241 GET_MODE_BITSIZE (GET_MODE (op0
))
10242 - bitsize
, op0
, 1);
10244 /* If the result type is BLKmode, store the data into a temporary
10245 of the appropriate type, but with the mode corresponding to the
10246 mode for the data we have (op0's mode). */
10247 if (mode
== BLKmode
)
10250 = assign_stack_temp_for_type (ext_mode
,
10251 GET_MODE_BITSIZE (ext_mode
),
10253 emit_move_insn (new_rtx
, op0
);
10254 op0
= copy_rtx (new_rtx
);
10255 PUT_MODE (op0
, BLKmode
);
10261 /* If the result is BLKmode, use that to access the object
10263 if (mode
== BLKmode
)
10266 /* Get a reference to just this component. */
10267 if (modifier
== EXPAND_CONST_ADDRESS
10268 || modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
10269 op0
= adjust_address_nv (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
10271 op0
= adjust_address (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
10273 if (op0
== orig_op0
)
10274 op0
= copy_rtx (op0
);
10276 /* If op0 is a temporary because of forcing to memory, pass only the
10277 type to set_mem_attributes so that the original expression is never
10278 marked as ADDRESSABLE through MEM_EXPR of the temporary. */
10279 if (mem_attrs_from_type
)
10280 set_mem_attributes (op0
, type
, 0);
10282 set_mem_attributes (op0
, exp
, 0);
10284 if (REG_P (XEXP (op0
, 0)))
10285 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
10287 MEM_VOLATILE_P (op0
) |= volatilep
;
10288 if (mode
== mode1
|| mode1
== BLKmode
|| mode1
== tmode
10289 || modifier
== EXPAND_CONST_ADDRESS
10290 || modifier
== EXPAND_INITIALIZER
)
10294 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
10296 convert_move (target
, op0
, unsignedp
);
10301 return expand_expr (OBJ_TYPE_REF_EXPR (exp
), target
, tmode
, modifier
);
10304 /* All valid uses of __builtin_va_arg_pack () are removed during
10306 if (CALL_EXPR_VA_ARG_PACK (exp
))
10307 error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp
);
10309 tree fndecl
= get_callee_fndecl (exp
), attr
;
10312 && (attr
= lookup_attribute ("error",
10313 DECL_ATTRIBUTES (fndecl
))) != NULL
)
10314 error ("%Kcall to %qs declared with attribute error: %s",
10315 exp
, identifier_to_locale (lang_hooks
.decl_printable_name (fndecl
, 1)),
10316 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
10318 && (attr
= lookup_attribute ("warning",
10319 DECL_ATTRIBUTES (fndecl
))) != NULL
)
10320 warning_at (tree_nonartificial_location (exp
),
10321 0, "%Kcall to %qs declared with attribute warning: %s",
10322 exp
, identifier_to_locale (lang_hooks
.decl_printable_name (fndecl
, 1)),
10323 TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
10325 /* Check for a built-in function. */
10326 if (fndecl
&& DECL_BUILT_IN (fndecl
))
10328 gcc_assert (DECL_BUILT_IN_CLASS (fndecl
) != BUILT_IN_FRONTEND
);
10329 return expand_builtin (exp
, target
, subtarget
, tmode
, ignore
);
10332 return expand_call (exp
, target
, ignore
);
10334 case VIEW_CONVERT_EXPR
:
10337 /* If we are converting to BLKmode, try to avoid an intermediate
10338 temporary by fetching an inner memory reference. */
10339 if (mode
== BLKmode
10340 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
10341 && TYPE_MODE (TREE_TYPE (treeop0
)) != BLKmode
10342 && handled_component_p (treeop0
))
10344 enum machine_mode mode1
;
10345 HOST_WIDE_INT bitsize
, bitpos
;
10350 = get_inner_reference (treeop0
, &bitsize
, &bitpos
,
10351 &offset
, &mode1
, &unsignedp
, &volatilep
,
10355 /* ??? We should work harder and deal with non-zero offsets. */
10357 && (bitpos
% BITS_PER_UNIT
) == 0
10359 && compare_tree_int (TYPE_SIZE (type
), bitsize
) == 0)
10361 /* See the normal_inner_ref case for the rationale. */
10363 = expand_expr_real (tem
,
10364 (TREE_CODE (TREE_TYPE (tem
)) == UNION_TYPE
10365 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem
)))
10367 && modifier
!= EXPAND_STACK_PARM
10368 ? target
: NULL_RTX
),
10370 modifier
== EXPAND_SUM
? EXPAND_NORMAL
: modifier
,
10373 if (MEM_P (orig_op0
))
10377 /* Get a reference to just this component. */
10378 if (modifier
== EXPAND_CONST_ADDRESS
10379 || modifier
== EXPAND_SUM
10380 || modifier
== EXPAND_INITIALIZER
)
10381 op0
= adjust_address_nv (op0
, mode
, bitpos
/ BITS_PER_UNIT
);
10383 op0
= adjust_address (op0
, mode
, bitpos
/ BITS_PER_UNIT
);
10385 if (op0
== orig_op0
)
10386 op0
= copy_rtx (op0
);
10388 set_mem_attributes (op0
, treeop0
, 0);
10389 if (REG_P (XEXP (op0
, 0)))
10390 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
10392 MEM_VOLATILE_P (op0
) |= volatilep
;
10398 op0
= expand_expr_real (treeop0
, NULL_RTX
, VOIDmode
, modifier
,
10399 NULL
, inner_reference_p
);
10401 /* If the input and output modes are both the same, we are done. */
10402 if (mode
== GET_MODE (op0
))
10404 /* If neither mode is BLKmode, and both modes are the same size
10405 then we can use gen_lowpart. */
10406 else if (mode
!= BLKmode
&& GET_MODE (op0
) != BLKmode
10407 && (GET_MODE_PRECISION (mode
)
10408 == GET_MODE_PRECISION (GET_MODE (op0
)))
10409 && !COMPLEX_MODE_P (GET_MODE (op0
)))
10411 if (GET_CODE (op0
) == SUBREG
)
10412 op0
= force_reg (GET_MODE (op0
), op0
);
10413 temp
= gen_lowpart_common (mode
, op0
);
10418 if (!REG_P (op0
) && !MEM_P (op0
))
10419 op0
= force_reg (GET_MODE (op0
), op0
);
10420 op0
= gen_lowpart (mode
, op0
);
10423 /* If both types are integral, convert from one mode to the other. */
10424 else if (INTEGRAL_TYPE_P (type
) && INTEGRAL_TYPE_P (TREE_TYPE (treeop0
)))
10425 op0
= convert_modes (mode
, GET_MODE (op0
), op0
,
10426 TYPE_UNSIGNED (TREE_TYPE (treeop0
)));
10427 /* If the output type is a bit-field type, do an extraction. */
10428 else if (reduce_bit_field
)
10429 return extract_bit_field (op0
, TYPE_PRECISION (type
), 0,
10430 TYPE_UNSIGNED (type
), NULL_RTX
,
10432 /* As a last resort, spill op0 to memory, and reload it in a
10434 else if (!MEM_P (op0
))
10436 /* If the operand is not a MEM, force it into memory. Since we
10437 are going to be changing the mode of the MEM, don't call
10438 force_const_mem for constants because we don't allow pool
10439 constants to change mode. */
10440 tree inner_type
= TREE_TYPE (treeop0
);
10442 gcc_assert (!TREE_ADDRESSABLE (exp
));
10444 if (target
== 0 || GET_MODE (target
) != TYPE_MODE (inner_type
))
10446 = assign_stack_temp_for_type
10447 (TYPE_MODE (inner_type
),
10448 GET_MODE_SIZE (TYPE_MODE (inner_type
)), inner_type
);
10450 emit_move_insn (target
, op0
);
10454 /* If OP0 is (now) a MEM, we need to deal with alignment issues. If the
10455 output type is such that the operand is known to be aligned, indicate
10456 that it is. Otherwise, we need only be concerned about alignment for
10457 non-BLKmode results. */
10460 enum insn_code icode
;
10462 if (TYPE_ALIGN_OK (type
))
10464 /* ??? Copying the MEM without substantially changing it might
10465 run afoul of the code handling volatile memory references in
10466 store_expr, which assumes that TARGET is returned unmodified
10467 if it has been used. */
10468 op0
= copy_rtx (op0
);
10469 set_mem_align (op0
, MAX (MEM_ALIGN (op0
), TYPE_ALIGN (type
)));
10471 else if (modifier
!= EXPAND_WRITE
10472 && modifier
!= EXPAND_MEMORY
10473 && !inner_reference_p
10475 && MEM_ALIGN (op0
) < GET_MODE_ALIGNMENT (mode
))
10477 /* If the target does have special handling for unaligned
10478 loads of mode then use them. */
10479 if ((icode
= optab_handler (movmisalign_optab
, mode
))
10480 != CODE_FOR_nothing
)
10484 op0
= adjust_address (op0
, mode
, 0);
10485 /* We've already validated the memory, and we're creating a
10486 new pseudo destination. The predicates really can't
10488 reg
= gen_reg_rtx (mode
);
10490 /* Nor can the insn generator. */
10491 insn
= GEN_FCN (icode
) (reg
, op0
);
10495 else if (STRICT_ALIGNMENT
)
10497 tree inner_type
= TREE_TYPE (treeop0
);
10498 HOST_WIDE_INT temp_size
10499 = MAX (int_size_in_bytes (inner_type
),
10500 (HOST_WIDE_INT
) GET_MODE_SIZE (mode
));
10502 = assign_stack_temp_for_type (mode
, temp_size
, type
);
10503 rtx new_with_op0_mode
10504 = adjust_address (new_rtx
, GET_MODE (op0
), 0);
10506 gcc_assert (!TREE_ADDRESSABLE (exp
));
10508 if (GET_MODE (op0
) == BLKmode
)
10509 emit_block_move (new_with_op0_mode
, op0
,
10510 GEN_INT (GET_MODE_SIZE (mode
)),
10511 (modifier
== EXPAND_STACK_PARM
10512 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
10514 emit_move_insn (new_with_op0_mode
, op0
);
10520 op0
= adjust_address (op0
, mode
, 0);
10527 tree lhs
= treeop0
;
10528 tree rhs
= treeop1
;
10529 gcc_assert (ignore
);
10531 /* Check for |= or &= of a bitfield of size one into another bitfield
10532 of size 1. In this case, (unless we need the result of the
10533 assignment) we can do this more efficiently with a
10534 test followed by an assignment, if necessary.
10536 ??? At this point, we can't get a BIT_FIELD_REF here. But if
10537 things change so we do, this code should be enhanced to
10539 if (TREE_CODE (lhs
) == COMPONENT_REF
10540 && (TREE_CODE (rhs
) == BIT_IOR_EXPR
10541 || TREE_CODE (rhs
) == BIT_AND_EXPR
)
10542 && TREE_OPERAND (rhs
, 0) == lhs
10543 && TREE_CODE (TREE_OPERAND (rhs
, 1)) == COMPONENT_REF
10544 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs
, 1)))
10545 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs
, 1), 1))))
10547 rtx label
= gen_label_rtx ();
10548 int value
= TREE_CODE (rhs
) == BIT_IOR_EXPR
;
10549 do_jump (TREE_OPERAND (rhs
, 1),
10551 value
? 0 : label
, -1);
10552 expand_assignment (lhs
, build_int_cst (TREE_TYPE (rhs
), value
),
10554 do_pending_stack_adjust ();
10555 emit_label (label
);
10559 expand_assignment (lhs
, rhs
, false);
10564 return expand_expr_addr_expr (exp
, target
, tmode
, modifier
);
10566 case REALPART_EXPR
:
10567 op0
= expand_normal (treeop0
);
10568 return read_complex_part (op0
, false);
10570 case IMAGPART_EXPR
:
10571 op0
= expand_normal (treeop0
);
10572 return read_complex_part (op0
, true);
10579 /* Expanded in cfgexpand.c. */
10580 gcc_unreachable ();
10582 case TRY_CATCH_EXPR
:
10584 case EH_FILTER_EXPR
:
10585 case TRY_FINALLY_EXPR
:
10586 /* Lowered by tree-eh.c. */
10587 gcc_unreachable ();
10589 case WITH_CLEANUP_EXPR
:
10590 case CLEANUP_POINT_EXPR
:
10592 case CASE_LABEL_EXPR
:
10597 case COMPOUND_EXPR
:
10598 case PREINCREMENT_EXPR
:
10599 case PREDECREMENT_EXPR
:
10600 case POSTINCREMENT_EXPR
:
10601 case POSTDECREMENT_EXPR
:
10604 case COMPOUND_LITERAL_EXPR
:
10605 /* Lowered by gimplify.c. */
10606 gcc_unreachable ();
10609 /* Function descriptors are not valid except for as
10610 initialization constants, and should not be expanded. */
10611 gcc_unreachable ();
10613 case WITH_SIZE_EXPR
:
10614 /* WITH_SIZE_EXPR expands to its first argument. The caller should
10615 have pulled out the size to use in whatever context it needed. */
10616 return expand_expr_real (treeop0
, original_target
, tmode
,
10617 modifier
, alt_rtl
, inner_reference_p
);
10620 return expand_expr_real_2 (&ops
, target
, tmode
, modifier
);
10624 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
10625 signedness of TYPE), possibly returning the result in TARGET. */
10627 reduce_to_bit_field_precision (rtx exp
, rtx target
, tree type
)
10629 HOST_WIDE_INT prec
= TYPE_PRECISION (type
);
10630 if (target
&& GET_MODE (target
) != GET_MODE (exp
))
10632 /* For constant values, reduce using build_int_cst_type. */
10633 if (CONST_INT_P (exp
))
10635 HOST_WIDE_INT value
= INTVAL (exp
);
10636 tree t
= build_int_cst_type (type
, value
);
10637 return expand_expr (t
, target
, VOIDmode
, EXPAND_NORMAL
);
10639 else if (TYPE_UNSIGNED (type
))
10641 rtx mask
= immed_double_int_const (double_int::mask (prec
),
10643 return expand_and (GET_MODE (exp
), exp
, mask
, target
);
10647 int count
= GET_MODE_PRECISION (GET_MODE (exp
)) - prec
;
10648 exp
= expand_shift (LSHIFT_EXPR
, GET_MODE (exp
),
10649 exp
, count
, target
, 0);
10650 return expand_shift (RSHIFT_EXPR
, GET_MODE (exp
),
10651 exp
, count
, target
, 0);
10655 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
10656 when applied to the address of EXP produces an address known to be
10657 aligned more than BIGGEST_ALIGNMENT. */
10660 is_aligning_offset (const_tree offset
, const_tree exp
)
10662 /* Strip off any conversions. */
10663 while (CONVERT_EXPR_P (offset
))
10664 offset
= TREE_OPERAND (offset
, 0);
10666 /* We must now have a BIT_AND_EXPR with a constant that is one less than
10667 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
10668 if (TREE_CODE (offset
) != BIT_AND_EXPR
10669 || !tree_fits_uhwi_p (TREE_OPERAND (offset
, 1))
10670 || compare_tree_int (TREE_OPERAND (offset
, 1),
10671 BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) <= 0
10672 || exact_log2 (tree_to_uhwi (TREE_OPERAND (offset
, 1)) + 1) < 0)
10675 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
10676 It must be NEGATE_EXPR. Then strip any more conversions. */
10677 offset
= TREE_OPERAND (offset
, 0);
10678 while (CONVERT_EXPR_P (offset
))
10679 offset
= TREE_OPERAND (offset
, 0);
10681 if (TREE_CODE (offset
) != NEGATE_EXPR
)
10684 offset
= TREE_OPERAND (offset
, 0);
10685 while (CONVERT_EXPR_P (offset
))
10686 offset
= TREE_OPERAND (offset
, 0);
10688 /* This must now be the address of EXP. */
10689 return TREE_CODE (offset
) == ADDR_EXPR
&& TREE_OPERAND (offset
, 0) == exp
;
10692 /* Return the tree node if an ARG corresponds to a string constant or zero
10693 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
10694 in bytes within the string that ARG is accessing. The type of the
10695 offset will be `sizetype'. */
10698 string_constant (tree arg
, tree
*ptr_offset
)
10700 tree array
, offset
, lower_bound
;
10703 if (TREE_CODE (arg
) == ADDR_EXPR
)
10705 if (TREE_CODE (TREE_OPERAND (arg
, 0)) == STRING_CST
)
10707 *ptr_offset
= size_zero_node
;
10708 return TREE_OPERAND (arg
, 0);
10710 else if (TREE_CODE (TREE_OPERAND (arg
, 0)) == VAR_DECL
)
10712 array
= TREE_OPERAND (arg
, 0);
10713 offset
= size_zero_node
;
10715 else if (TREE_CODE (TREE_OPERAND (arg
, 0)) == ARRAY_REF
)
10717 array
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
10718 offset
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 1);
10719 if (TREE_CODE (array
) != STRING_CST
10720 && TREE_CODE (array
) != VAR_DECL
)
10723 /* Check if the array has a nonzero lower bound. */
10724 lower_bound
= array_ref_low_bound (TREE_OPERAND (arg
, 0));
10725 if (!integer_zerop (lower_bound
))
10727 /* If the offset and base aren't both constants, return 0. */
10728 if (TREE_CODE (lower_bound
) != INTEGER_CST
)
10730 if (TREE_CODE (offset
) != INTEGER_CST
)
10732 /* Adjust offset by the lower bound. */
10733 offset
= size_diffop (fold_convert (sizetype
, offset
),
10734 fold_convert (sizetype
, lower_bound
));
10737 else if (TREE_CODE (TREE_OPERAND (arg
, 0)) == MEM_REF
)
10739 array
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
10740 offset
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 1);
10741 if (TREE_CODE (array
) != ADDR_EXPR
)
10743 array
= TREE_OPERAND (array
, 0);
10744 if (TREE_CODE (array
) != STRING_CST
10745 && TREE_CODE (array
) != VAR_DECL
)
10751 else if (TREE_CODE (arg
) == PLUS_EXPR
|| TREE_CODE (arg
) == POINTER_PLUS_EXPR
)
10753 tree arg0
= TREE_OPERAND (arg
, 0);
10754 tree arg1
= TREE_OPERAND (arg
, 1);
10759 if (TREE_CODE (arg0
) == ADDR_EXPR
10760 && (TREE_CODE (TREE_OPERAND (arg0
, 0)) == STRING_CST
10761 || TREE_CODE (TREE_OPERAND (arg0
, 0)) == VAR_DECL
))
10763 array
= TREE_OPERAND (arg0
, 0);
10766 else if (TREE_CODE (arg1
) == ADDR_EXPR
10767 && (TREE_CODE (TREE_OPERAND (arg1
, 0)) == STRING_CST
10768 || TREE_CODE (TREE_OPERAND (arg1
, 0)) == VAR_DECL
))
10770 array
= TREE_OPERAND (arg1
, 0);
10779 if (TREE_CODE (array
) == STRING_CST
)
10781 *ptr_offset
= fold_convert (sizetype
, offset
);
10784 else if (TREE_CODE (array
) == VAR_DECL
10785 || TREE_CODE (array
) == CONST_DECL
)
10788 tree init
= ctor_for_folding (array
);
10790 /* Variables initialized to string literals can be handled too. */
10791 if (init
== error_mark_node
10793 || TREE_CODE (init
) != STRING_CST
)
10796 /* Avoid const char foo[4] = "abcde"; */
10797 if (DECL_SIZE_UNIT (array
) == NULL_TREE
10798 || TREE_CODE (DECL_SIZE_UNIT (array
)) != INTEGER_CST
10799 || (length
= TREE_STRING_LENGTH (init
)) <= 0
10800 || compare_tree_int (DECL_SIZE_UNIT (array
), length
) < 0)
10803 /* If variable is bigger than the string literal, OFFSET must be constant
10804 and inside of the bounds of the string literal. */
10805 offset
= fold_convert (sizetype
, offset
);
10806 if (compare_tree_int (DECL_SIZE_UNIT (array
), length
) > 0
10807 && (! tree_fits_uhwi_p (offset
)
10808 || compare_tree_int (offset
, length
) >= 0))
10811 *ptr_offset
= offset
;
10818 /* Generate code to calculate OPS, and exploded expression
10819 using a store-flag instruction and return an rtx for the result.
10820 OPS reflects a comparison.
10822 If TARGET is nonzero, store the result there if convenient.
10824 Return zero if there is no suitable set-flag instruction
10825 available on this machine.
10827 Once expand_expr has been called on the arguments of the comparison,
10828 we are committed to doing the store flag, since it is not safe to
10829 re-evaluate the expression. We emit the store-flag insn by calling
10830 emit_store_flag, but only expand the arguments if we have a reason
10831 to believe that emit_store_flag will be successful. If we think that
10832 it will, but it isn't, we have to simulate the store-flag with a
10833 set/jump/set sequence. */
10836 do_store_flag (sepops ops
, rtx target
, enum machine_mode mode
)
10838 enum rtx_code code
;
10839 tree arg0
, arg1
, type
;
10841 enum machine_mode operand_mode
;
10844 rtx subtarget
= target
;
10845 location_t loc
= ops
->location
;
10850 /* Don't crash if the comparison was erroneous. */
10851 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
10854 type
= TREE_TYPE (arg0
);
10855 operand_mode
= TYPE_MODE (type
);
10856 unsignedp
= TYPE_UNSIGNED (type
);
10858 /* We won't bother with BLKmode store-flag operations because it would mean
10859 passing a lot of information to emit_store_flag. */
10860 if (operand_mode
== BLKmode
)
10863 /* We won't bother with store-flag operations involving function pointers
10864 when function pointers must be canonicalized before comparisons. */
10865 #ifdef HAVE_canonicalize_funcptr_for_compare
10866 if (HAVE_canonicalize_funcptr_for_compare
10867 && ((TREE_CODE (TREE_TYPE (arg0
)) == POINTER_TYPE
10868 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg0
)))
10870 || (TREE_CODE (TREE_TYPE (arg1
)) == POINTER_TYPE
10871 && (TREE_CODE (TREE_TYPE (TREE_TYPE (arg1
)))
10872 == FUNCTION_TYPE
))))
10879 /* For vector typed comparisons emit code to generate the desired
10880 all-ones or all-zeros mask. Conveniently use the VEC_COND_EXPR
10881 expander for this. */
10882 if (TREE_CODE (ops
->type
) == VECTOR_TYPE
)
10884 tree ifexp
= build2 (ops
->code
, ops
->type
, arg0
, arg1
);
10885 tree if_true
= constant_boolean_node (true, ops
->type
);
10886 tree if_false
= constant_boolean_node (false, ops
->type
);
10887 return expand_vec_cond_expr (ops
->type
, ifexp
, if_true
, if_false
, target
);
10890 /* Get the rtx comparison code to use. We know that EXP is a comparison
10891 operation of some type. Some comparisons against 1 and -1 can be
10892 converted to comparisons with zero. Do so here so that the tests
10893 below will be aware that we have a comparison with zero. These
10894 tests will not catch constants in the first operand, but constants
10895 are rarely passed as the first operand. */
10906 if (integer_onep (arg1
))
10907 arg1
= integer_zero_node
, code
= unsignedp
? LEU
: LE
;
10909 code
= unsignedp
? LTU
: LT
;
10912 if (! unsignedp
&& integer_all_onesp (arg1
))
10913 arg1
= integer_zero_node
, code
= LT
;
10915 code
= unsignedp
? LEU
: LE
;
10918 if (! unsignedp
&& integer_all_onesp (arg1
))
10919 arg1
= integer_zero_node
, code
= GE
;
10921 code
= unsignedp
? GTU
: GT
;
10924 if (integer_onep (arg1
))
10925 arg1
= integer_zero_node
, code
= unsignedp
? GTU
: GT
;
10927 code
= unsignedp
? GEU
: GE
;
10930 case UNORDERED_EXPR
:
10956 gcc_unreachable ();
10959 /* Put a constant second. */
10960 if (TREE_CODE (arg0
) == REAL_CST
|| TREE_CODE (arg0
) == INTEGER_CST
10961 || TREE_CODE (arg0
) == FIXED_CST
)
10963 tem
= arg0
; arg0
= arg1
; arg1
= tem
;
10964 code
= swap_condition (code
);
10967 /* If this is an equality or inequality test of a single bit, we can
10968 do this by shifting the bit being tested to the low-order bit and
10969 masking the result with the constant 1. If the condition was EQ,
10970 we xor it with 1. This does not require an scc insn and is faster
10971 than an scc insn even if we have it.
10973 The code to make this transformation was moved into fold_single_bit_test,
10974 so we just call into the folder and expand its result. */
10976 if ((code
== NE
|| code
== EQ
)
10977 && integer_zerop (arg1
)
10978 && (TYPE_PRECISION (ops
->type
) != 1 || TYPE_UNSIGNED (ops
->type
)))
10980 gimple srcstmt
= get_def_for_expr (arg0
, BIT_AND_EXPR
);
10982 && integer_pow2p (gimple_assign_rhs2 (srcstmt
)))
10984 enum tree_code tcode
= code
== NE
? NE_EXPR
: EQ_EXPR
;
10985 tree type
= lang_hooks
.types
.type_for_mode (mode
, unsignedp
);
10986 tree temp
= fold_build2_loc (loc
, BIT_AND_EXPR
, TREE_TYPE (arg1
),
10987 gimple_assign_rhs1 (srcstmt
),
10988 gimple_assign_rhs2 (srcstmt
));
10989 temp
= fold_single_bit_test (loc
, tcode
, temp
, arg1
, type
);
10991 return expand_expr (temp
, target
, VOIDmode
, EXPAND_NORMAL
);
10995 if (! get_subtarget (target
)
10996 || GET_MODE (subtarget
) != operand_mode
)
10999 expand_operands (arg0
, arg1
, subtarget
, &op0
, &op1
, EXPAND_NORMAL
);
11002 target
= gen_reg_rtx (mode
);
11004 /* Try a cstore if possible. */
11005 return emit_store_flag_force (target
, code
, op0
, op1
,
11006 operand_mode
, unsignedp
,
11007 (TYPE_PRECISION (ops
->type
) == 1
11008 && !TYPE_UNSIGNED (ops
->type
)) ? -1 : 1);
11012 /* Stubs in case we haven't got a casesi insn. */
11013 #ifndef HAVE_casesi
11014 # define HAVE_casesi 0
11015 # define gen_casesi(a, b, c, d, e) (0)
11016 # define CODE_FOR_casesi CODE_FOR_nothing
11019 /* Attempt to generate a casesi instruction. Returns 1 if successful,
11020 0 otherwise (i.e. if there is no casesi instruction).
11022 DEFAULT_PROBABILITY is the probability of jumping to the default
11025 try_casesi (tree index_type
, tree index_expr
, tree minval
, tree range
,
11026 rtx table_label
, rtx default_label
, rtx fallback_label
,
11027 int default_probability
)
11029 struct expand_operand ops
[5];
11030 enum machine_mode index_mode
= SImode
;
11031 rtx op1
, op2
, index
;
11036 /* Convert the index to SImode. */
11037 if (GET_MODE_BITSIZE (TYPE_MODE (index_type
)) > GET_MODE_BITSIZE (index_mode
))
11039 enum machine_mode omode
= TYPE_MODE (index_type
);
11040 rtx rangertx
= expand_normal (range
);
11042 /* We must handle the endpoints in the original mode. */
11043 index_expr
= build2 (MINUS_EXPR
, index_type
,
11044 index_expr
, minval
);
11045 minval
= integer_zero_node
;
11046 index
= expand_normal (index_expr
);
11048 emit_cmp_and_jump_insns (rangertx
, index
, LTU
, NULL_RTX
,
11049 omode
, 1, default_label
,
11050 default_probability
);
11051 /* Now we can safely truncate. */
11052 index
= convert_to_mode (index_mode
, index
, 0);
11056 if (TYPE_MODE (index_type
) != index_mode
)
11058 index_type
= lang_hooks
.types
.type_for_mode (index_mode
, 0);
11059 index_expr
= fold_convert (index_type
, index_expr
);
11062 index
= expand_normal (index_expr
);
11065 do_pending_stack_adjust ();
11067 op1
= expand_normal (minval
);
11068 op2
= expand_normal (range
);
11070 create_input_operand (&ops
[0], index
, index_mode
);
11071 create_convert_operand_from_type (&ops
[1], op1
, TREE_TYPE (minval
));
11072 create_convert_operand_from_type (&ops
[2], op2
, TREE_TYPE (range
));
11073 create_fixed_operand (&ops
[3], table_label
);
11074 create_fixed_operand (&ops
[4], (default_label
11076 : fallback_label
));
11077 expand_jump_insn (CODE_FOR_casesi
, 5, ops
);
11081 /* Attempt to generate a tablejump instruction; same concept. */
11082 #ifndef HAVE_tablejump
11083 #define HAVE_tablejump 0
11084 #define gen_tablejump(x, y) (0)
11087 /* Subroutine of the next function.
11089 INDEX is the value being switched on, with the lowest value
11090 in the table already subtracted.
11091 MODE is its expected mode (needed if INDEX is constant).
11092 RANGE is the length of the jump table.
11093 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
11095 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
11096 index value is out of range.
11097 DEFAULT_PROBABILITY is the probability of jumping to
11098 the default label. */
11101 do_tablejump (rtx index
, enum machine_mode mode
, rtx range
, rtx table_label
,
11102 rtx default_label
, int default_probability
)
11106 if (INTVAL (range
) > cfun
->cfg
->max_jumptable_ents
)
11107 cfun
->cfg
->max_jumptable_ents
= INTVAL (range
);
11109 /* Do an unsigned comparison (in the proper mode) between the index
11110 expression and the value which represents the length of the range.
11111 Since we just finished subtracting the lower bound of the range
11112 from the index expression, this comparison allows us to simultaneously
11113 check that the original index expression value is both greater than
11114 or equal to the minimum value of the range and less than or equal to
11115 the maximum value of the range. */
11118 emit_cmp_and_jump_insns (index
, range
, GTU
, NULL_RTX
, mode
, 1,
11119 default_label
, default_probability
);
11122 /* If index is in range, it must fit in Pmode.
11123 Convert to Pmode so we can index with it. */
11125 index
= convert_to_mode (Pmode
, index
, 1);
11127 /* Don't let a MEM slip through, because then INDEX that comes
11128 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
11129 and break_out_memory_refs will go to work on it and mess it up. */
11130 #ifdef PIC_CASE_VECTOR_ADDRESS
11131 if (flag_pic
&& !REG_P (index
))
11132 index
= copy_to_mode_reg (Pmode
, index
);
11135 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
11136 GET_MODE_SIZE, because this indicates how large insns are. The other
11137 uses should all be Pmode, because they are addresses. This code
11138 could fail if addresses and insns are not the same size. */
11139 index
= simplify_gen_binary (MULT
, Pmode
, index
,
11140 gen_int_mode (GET_MODE_SIZE (CASE_VECTOR_MODE
),
11142 index
= simplify_gen_binary (PLUS
, Pmode
, index
,
11143 gen_rtx_LABEL_REF (Pmode
, table_label
));
11145 #ifdef PIC_CASE_VECTOR_ADDRESS
11147 index
= PIC_CASE_VECTOR_ADDRESS (index
);
11150 index
= memory_address (CASE_VECTOR_MODE
, index
);
11151 temp
= gen_reg_rtx (CASE_VECTOR_MODE
);
11152 vector
= gen_const_mem (CASE_VECTOR_MODE
, index
);
11153 convert_move (temp
, vector
, 0);
11155 emit_jump_insn (gen_tablejump (temp
, table_label
));
11157 /* If we are generating PIC code or if the table is PC-relative, the
11158 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
11159 if (! CASE_VECTOR_PC_RELATIVE
&& ! flag_pic
)
11164 try_tablejump (tree index_type
, tree index_expr
, tree minval
, tree range
,
11165 rtx table_label
, rtx default_label
, int default_probability
)
11169 if (! HAVE_tablejump
)
11172 index_expr
= fold_build2 (MINUS_EXPR
, index_type
,
11173 fold_convert (index_type
, index_expr
),
11174 fold_convert (index_type
, minval
));
11175 index
= expand_normal (index_expr
);
11176 do_pending_stack_adjust ();
11178 do_tablejump (index
, TYPE_MODE (index_type
),
11179 convert_modes (TYPE_MODE (index_type
),
11180 TYPE_MODE (TREE_TYPE (range
)),
11181 expand_normal (range
),
11182 TYPE_UNSIGNED (TREE_TYPE (range
))),
11183 table_label
, default_label
, default_probability
);
11187 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
11189 const_vector_from_tree (tree exp
)
11195 enum machine_mode inner
, mode
;
11197 mode
= TYPE_MODE (TREE_TYPE (exp
));
11199 if (initializer_zerop (exp
))
11200 return CONST0_RTX (mode
);
11202 units
= GET_MODE_NUNITS (mode
);
11203 inner
= GET_MODE_INNER (mode
);
11205 v
= rtvec_alloc (units
);
11207 for (i
= 0; i
< VECTOR_CST_NELTS (exp
); ++i
)
11209 elt
= VECTOR_CST_ELT (exp
, i
);
11211 if (TREE_CODE (elt
) == REAL_CST
)
11212 RTVEC_ELT (v
, i
) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt
),
11214 else if (TREE_CODE (elt
) == FIXED_CST
)
11215 RTVEC_ELT (v
, i
) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt
),
11218 RTVEC_ELT (v
, i
) = immed_double_int_const (tree_to_double_int (elt
),
11222 return gen_rtx_CONST_VECTOR (mode
, v
);
11225 /* Build a decl for a personality function given a language prefix. */
11228 build_personality_function (const char *lang
)
11230 const char *unwind_and_version
;
11234 switch (targetm_common
.except_unwind_info (&global_options
))
11239 unwind_and_version
= "_sj0";
11243 unwind_and_version
= "_v0";
11246 unwind_and_version
= "_seh0";
11249 gcc_unreachable ();
11252 name
= ACONCAT (("__", lang
, "_personality", unwind_and_version
, NULL
));
11254 type
= build_function_type_list (integer_type_node
, integer_type_node
,
11255 long_long_unsigned_type_node
,
11256 ptr_type_node
, ptr_type_node
, NULL_TREE
);
11257 decl
= build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
,
11258 get_identifier (name
), type
);
11259 DECL_ARTIFICIAL (decl
) = 1;
11260 DECL_EXTERNAL (decl
) = 1;
11261 TREE_PUBLIC (decl
) = 1;
11263 /* Zap the nonsensical SYMBOL_REF_DECL for this. What we're left with
11264 are the flags assigned by targetm.encode_section_info. */
11265 SET_SYMBOL_REF_DECL (XEXP (DECL_RTL (decl
), 0), NULL
);
11270 /* Extracts the personality function of DECL and returns the corresponding
11274 get_personality_function (tree decl
)
11276 tree personality
= DECL_FUNCTION_PERSONALITY (decl
);
11277 enum eh_personality_kind pk
;
11279 pk
= function_needs_eh_personality (DECL_STRUCT_FUNCTION (decl
));
11280 if (pk
== eh_personality_none
)
11284 && pk
== eh_personality_any
)
11285 personality
= lang_hooks
.eh_personality ();
11287 if (pk
== eh_personality_lang
)
11288 gcc_assert (personality
!= NULL_TREE
);
11290 return XEXP (DECL_RTL (personality
), 0);
11293 #include "gt-expr.h"