1 /* Convert tree expression to rtl instructions, for GNU compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
32 #include "hard-reg-set.h"
35 #include "insn-config.h"
36 #include "insn-attr.h"
37 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
44 #include "typeclass.h"
47 #include "langhooks.h"
50 #include "tree-iterator.h"
51 #include "tree-pass.h"
52 #include "tree-flow.h"
57 /* Decide whether a function's arguments should be processed
58 from first to last or from last to first.
60 They should if the stack and args grow in opposite directions, but
61 only if we have push insns. */
65 #ifndef PUSH_ARGS_REVERSED
66 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
67 #define PUSH_ARGS_REVERSED /* If it's last to first. */
73 #ifndef STACK_PUSH_CODE
74 #ifdef STACK_GROWS_DOWNWARD
75 #define STACK_PUSH_CODE PRE_DEC
77 #define STACK_PUSH_CODE PRE_INC
82 /* If this is nonzero, we do not bother generating VOLATILE
83 around volatile memory references, and we are willing to
84 output indirect addresses. If cse is to follow, we reject
85 indirect addresses so a useful potential cse is generated;
86 if it is used only once, instruction combination will produce
87 the same indirect address eventually. */
90 /* This structure is used by move_by_pieces to describe the move to
101 int explicit_inc_from
;
102 unsigned HOST_WIDE_INT len
;
103 HOST_WIDE_INT offset
;
107 /* This structure is used by store_by_pieces to describe the clear to
110 struct store_by_pieces
116 unsigned HOST_WIDE_INT len
;
117 HOST_WIDE_INT offset
;
118 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
);
123 static unsigned HOST_WIDE_INT
move_by_pieces_ninsns (unsigned HOST_WIDE_INT
,
126 static void move_by_pieces_1 (rtx (*) (rtx
, ...), enum machine_mode
,
127 struct move_by_pieces
*);
128 static bool block_move_libcall_safe_for_call_parm (void);
129 static bool emit_block_move_via_movmem (rtx
, rtx
, rtx
, unsigned, unsigned, HOST_WIDE_INT
);
130 static tree
emit_block_move_libcall_fn (int);
131 static void emit_block_move_via_loop (rtx
, rtx
, rtx
, unsigned);
132 static rtx
clear_by_pieces_1 (void *, HOST_WIDE_INT
, enum machine_mode
);
133 static void clear_by_pieces (rtx
, unsigned HOST_WIDE_INT
, unsigned int);
134 static void store_by_pieces_1 (struct store_by_pieces
*, unsigned int);
135 static void store_by_pieces_2 (rtx (*) (rtx
, ...), enum machine_mode
,
136 struct store_by_pieces
*);
137 static tree
clear_storage_libcall_fn (int);
138 static rtx
compress_float_constant (rtx
, rtx
);
139 static rtx
get_subtarget (rtx
);
140 static void store_constructor_field (rtx
, unsigned HOST_WIDE_INT
,
141 HOST_WIDE_INT
, enum machine_mode
,
142 tree
, tree
, int, alias_set_type
);
143 static void store_constructor (tree
, rtx
, int, HOST_WIDE_INT
);
144 static rtx
store_field (rtx
, HOST_WIDE_INT
, HOST_WIDE_INT
, enum machine_mode
,
145 tree
, tree
, alias_set_type
, bool);
147 static unsigned HOST_WIDE_INT
highest_pow2_factor_for_target (const_tree
, const_tree
);
149 static int is_aligning_offset (const_tree
, const_tree
);
150 static void expand_operands (tree
, tree
, rtx
, rtx
*, rtx
*,
151 enum expand_modifier
);
152 static rtx
reduce_to_bit_field_precision (rtx
, rtx
, tree
);
153 static rtx
do_store_flag (tree
, rtx
, enum machine_mode
, int);
155 static void emit_single_push_insn (enum machine_mode
, rtx
, tree
);
157 static void do_tablejump (rtx
, enum machine_mode
, rtx
, rtx
, rtx
);
158 static rtx
const_vector_from_tree (tree
);
159 static void write_complex_part (rtx
, rtx
, bool);
161 /* Record for each mode whether we can move a register directly to or
162 from an object of that mode in memory. If we can't, we won't try
163 to use that mode directly when accessing a field of that mode. */
165 static char direct_load
[NUM_MACHINE_MODES
];
166 static char direct_store
[NUM_MACHINE_MODES
];
168 /* Record for each mode whether we can float-extend from memory. */
170 static bool float_extend_from_mem
[NUM_MACHINE_MODES
][NUM_MACHINE_MODES
];
172 /* This macro is used to determine whether move_by_pieces should be called
173 to perform a structure copy. */
174 #ifndef MOVE_BY_PIECES_P
175 #define MOVE_BY_PIECES_P(SIZE, ALIGN) \
176 (move_by_pieces_ninsns (SIZE, ALIGN, MOVE_MAX_PIECES + 1) \
177 < (unsigned int) MOVE_RATIO)
180 /* This macro is used to determine whether clear_by_pieces should be
181 called to clear storage. */
182 #ifndef CLEAR_BY_PIECES_P
183 #define CLEAR_BY_PIECES_P(SIZE, ALIGN) \
184 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
185 < (unsigned int) CLEAR_RATIO)
188 /* This macro is used to determine whether store_by_pieces should be
189 called to "memset" storage with byte values other than zero. */
190 #ifndef SET_BY_PIECES_P
191 #define SET_BY_PIECES_P(SIZE, ALIGN) \
192 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
193 < (unsigned int) SET_RATIO)
196 /* This macro is used to determine whether store_by_pieces should be
197 called to "memcpy" storage when the source is a constant string. */
198 #ifndef STORE_BY_PIECES_P
199 #define STORE_BY_PIECES_P(SIZE, ALIGN) \
200 (move_by_pieces_ninsns (SIZE, ALIGN, STORE_MAX_PIECES + 1) \
201 < (unsigned int) MOVE_RATIO)
204 /* This array records the insn_code of insns to perform block moves. */
205 enum insn_code movmem_optab
[NUM_MACHINE_MODES
];
207 /* This array records the insn_code of insns to perform block sets. */
208 enum insn_code setmem_optab
[NUM_MACHINE_MODES
];
210 /* These arrays record the insn_code of three different kinds of insns
211 to perform block compares. */
212 enum insn_code cmpstr_optab
[NUM_MACHINE_MODES
];
213 enum insn_code cmpstrn_optab
[NUM_MACHINE_MODES
];
214 enum insn_code cmpmem_optab
[NUM_MACHINE_MODES
];
216 /* Synchronization primitives. */
217 enum insn_code sync_add_optab
[NUM_MACHINE_MODES
];
218 enum insn_code sync_sub_optab
[NUM_MACHINE_MODES
];
219 enum insn_code sync_ior_optab
[NUM_MACHINE_MODES
];
220 enum insn_code sync_and_optab
[NUM_MACHINE_MODES
];
221 enum insn_code sync_xor_optab
[NUM_MACHINE_MODES
];
222 enum insn_code sync_nand_optab
[NUM_MACHINE_MODES
];
223 enum insn_code sync_old_add_optab
[NUM_MACHINE_MODES
];
224 enum insn_code sync_old_sub_optab
[NUM_MACHINE_MODES
];
225 enum insn_code sync_old_ior_optab
[NUM_MACHINE_MODES
];
226 enum insn_code sync_old_and_optab
[NUM_MACHINE_MODES
];
227 enum insn_code sync_old_xor_optab
[NUM_MACHINE_MODES
];
228 enum insn_code sync_old_nand_optab
[NUM_MACHINE_MODES
];
229 enum insn_code sync_new_add_optab
[NUM_MACHINE_MODES
];
230 enum insn_code sync_new_sub_optab
[NUM_MACHINE_MODES
];
231 enum insn_code sync_new_ior_optab
[NUM_MACHINE_MODES
];
232 enum insn_code sync_new_and_optab
[NUM_MACHINE_MODES
];
233 enum insn_code sync_new_xor_optab
[NUM_MACHINE_MODES
];
234 enum insn_code sync_new_nand_optab
[NUM_MACHINE_MODES
];
235 enum insn_code sync_compare_and_swap
[NUM_MACHINE_MODES
];
236 enum insn_code sync_compare_and_swap_cc
[NUM_MACHINE_MODES
];
237 enum insn_code sync_lock_test_and_set
[NUM_MACHINE_MODES
];
238 enum insn_code sync_lock_release
[NUM_MACHINE_MODES
];
240 /* SLOW_UNALIGNED_ACCESS is nonzero if unaligned accesses are very slow. */
242 #ifndef SLOW_UNALIGNED_ACCESS
243 #define SLOW_UNALIGNED_ACCESS(MODE, ALIGN) STRICT_ALIGNMENT
246 /* This is run to set up which modes can be used
247 directly in memory and to initialize the block move optab. It is run
248 at the beginning of compilation and when the target is reinitialized. */
251 init_expr_target (void)
254 enum machine_mode mode
;
259 /* Try indexing by frame ptr and try by stack ptr.
260 It is known that on the Convex the stack ptr isn't a valid index.
261 With luck, one or the other is valid on any machine. */
262 mem
= gen_rtx_MEM (VOIDmode
, stack_pointer_rtx
);
263 mem1
= gen_rtx_MEM (VOIDmode
, frame_pointer_rtx
);
265 /* A scratch register we can modify in-place below to avoid
266 useless RTL allocations. */
267 reg
= gen_rtx_REG (VOIDmode
, -1);
269 insn
= rtx_alloc (INSN
);
270 pat
= gen_rtx_SET (0, NULL_RTX
, NULL_RTX
);
271 PATTERN (insn
) = pat
;
273 for (mode
= VOIDmode
; (int) mode
< NUM_MACHINE_MODES
;
274 mode
= (enum machine_mode
) ((int) mode
+ 1))
278 direct_load
[(int) mode
] = direct_store
[(int) mode
] = 0;
279 PUT_MODE (mem
, mode
);
280 PUT_MODE (mem1
, mode
);
281 PUT_MODE (reg
, mode
);
283 /* See if there is some register that can be used in this mode and
284 directly loaded or stored from memory. */
286 if (mode
!= VOIDmode
&& mode
!= BLKmode
)
287 for (regno
= 0; regno
< FIRST_PSEUDO_REGISTER
288 && (direct_load
[(int) mode
] == 0 || direct_store
[(int) mode
] == 0);
291 if (! HARD_REGNO_MODE_OK (regno
, mode
))
294 SET_REGNO (reg
, regno
);
297 SET_DEST (pat
) = reg
;
298 if (recog (pat
, insn
, &num_clobbers
) >= 0)
299 direct_load
[(int) mode
] = 1;
301 SET_SRC (pat
) = mem1
;
302 SET_DEST (pat
) = reg
;
303 if (recog (pat
, insn
, &num_clobbers
) >= 0)
304 direct_load
[(int) mode
] = 1;
307 SET_DEST (pat
) = mem
;
308 if (recog (pat
, insn
, &num_clobbers
) >= 0)
309 direct_store
[(int) mode
] = 1;
312 SET_DEST (pat
) = mem1
;
313 if (recog (pat
, insn
, &num_clobbers
) >= 0)
314 direct_store
[(int) mode
] = 1;
318 mem
= gen_rtx_MEM (VOIDmode
, gen_rtx_raw_REG (Pmode
, 10000));
320 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
321 mode
= GET_MODE_WIDER_MODE (mode
))
323 enum machine_mode srcmode
;
324 for (srcmode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); srcmode
!= mode
;
325 srcmode
= GET_MODE_WIDER_MODE (srcmode
))
329 ic
= can_extend_p (mode
, srcmode
, 0);
330 if (ic
== CODE_FOR_nothing
)
333 PUT_MODE (mem
, srcmode
);
335 if ((*insn_data
[ic
].operand
[1].predicate
) (mem
, srcmode
))
336 float_extend_from_mem
[mode
][srcmode
] = true;
341 /* This is run at the start of compiling a function. */
346 cfun
->expr
= ggc_alloc_cleared (sizeof (struct expr_status
));
349 /* Copy data from FROM to TO, where the machine modes are not the same.
350 Both modes may be integer, or both may be floating, or both may be
352 UNSIGNEDP should be nonzero if FROM is an unsigned type.
353 This causes zero-extension instead of sign-extension. */
356 convert_move (rtx to
, rtx from
, int unsignedp
)
358 enum machine_mode to_mode
= GET_MODE (to
);
359 enum machine_mode from_mode
= GET_MODE (from
);
360 int to_real
= SCALAR_FLOAT_MODE_P (to_mode
);
361 int from_real
= SCALAR_FLOAT_MODE_P (from_mode
);
365 /* rtx code for making an equivalent value. */
366 enum rtx_code equiv_code
= (unsignedp
< 0 ? UNKNOWN
367 : (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
));
370 gcc_assert (to_real
== from_real
);
371 gcc_assert (to_mode
!= BLKmode
);
372 gcc_assert (from_mode
!= BLKmode
);
374 /* If the source and destination are already the same, then there's
379 /* If FROM is a SUBREG that indicates that we have already done at least
380 the required extension, strip it. We don't handle such SUBREGs as
383 if (GET_CODE (from
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (from
)
384 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (from
)))
385 >= GET_MODE_SIZE (to_mode
))
386 && SUBREG_PROMOTED_UNSIGNED_P (from
) == unsignedp
)
387 from
= gen_lowpart (to_mode
, from
), from_mode
= to_mode
;
389 gcc_assert (GET_CODE (to
) != SUBREG
|| !SUBREG_PROMOTED_VAR_P (to
));
391 if (to_mode
== from_mode
392 || (from_mode
== VOIDmode
&& CONSTANT_P (from
)))
394 emit_move_insn (to
, from
);
398 if (VECTOR_MODE_P (to_mode
) || VECTOR_MODE_P (from_mode
))
400 gcc_assert (GET_MODE_BITSIZE (from_mode
) == GET_MODE_BITSIZE (to_mode
));
402 if (VECTOR_MODE_P (to_mode
))
403 from
= simplify_gen_subreg (to_mode
, from
, GET_MODE (from
), 0);
405 to
= simplify_gen_subreg (from_mode
, to
, GET_MODE (to
), 0);
407 emit_move_insn (to
, from
);
411 if (GET_CODE (to
) == CONCAT
&& GET_CODE (from
) == CONCAT
)
413 convert_move (XEXP (to
, 0), XEXP (from
, 0), unsignedp
);
414 convert_move (XEXP (to
, 1), XEXP (from
, 1), unsignedp
);
423 gcc_assert ((GET_MODE_PRECISION (from_mode
)
424 != GET_MODE_PRECISION (to_mode
))
425 || (DECIMAL_FLOAT_MODE_P (from_mode
)
426 != DECIMAL_FLOAT_MODE_P (to_mode
)));
428 if (GET_MODE_PRECISION (from_mode
) == GET_MODE_PRECISION (to_mode
))
429 /* Conversion between decimal float and binary float, same size. */
430 tab
= DECIMAL_FLOAT_MODE_P (from_mode
) ? trunc_optab
: sext_optab
;
431 else if (GET_MODE_PRECISION (from_mode
) < GET_MODE_PRECISION (to_mode
))
436 /* Try converting directly if the insn is supported. */
438 code
= convert_optab_handler (tab
, to_mode
, from_mode
)->insn_code
;
439 if (code
!= CODE_FOR_nothing
)
441 emit_unop_insn (code
, to
, from
,
442 tab
== sext_optab
? FLOAT_EXTEND
: FLOAT_TRUNCATE
);
446 /* Otherwise use a libcall. */
447 libcall
= convert_optab_libfunc (tab
, to_mode
, from_mode
);
449 /* Is this conversion implemented yet? */
450 gcc_assert (libcall
);
453 value
= emit_library_call_value (libcall
, NULL_RTX
, LCT_CONST
, to_mode
,
455 insns
= get_insns ();
457 emit_libcall_block (insns
, to
, value
,
458 tab
== trunc_optab
? gen_rtx_FLOAT_TRUNCATE (to_mode
,
460 : gen_rtx_FLOAT_EXTEND (to_mode
, from
));
464 /* Handle pointer conversion. */ /* SPEE 900220. */
465 /* Targets are expected to provide conversion insns between PxImode and
466 xImode for all MODE_PARTIAL_INT modes they use, but no others. */
467 if (GET_MODE_CLASS (to_mode
) == MODE_PARTIAL_INT
)
469 enum machine_mode full_mode
470 = smallest_mode_for_size (GET_MODE_BITSIZE (to_mode
), MODE_INT
);
472 gcc_assert (convert_optab_handler (trunc_optab
, to_mode
, full_mode
)->insn_code
473 != CODE_FOR_nothing
);
475 if (full_mode
!= from_mode
)
476 from
= convert_to_mode (full_mode
, from
, unsignedp
);
477 emit_unop_insn (convert_optab_handler (trunc_optab
, to_mode
, full_mode
)->insn_code
,
481 if (GET_MODE_CLASS (from_mode
) == MODE_PARTIAL_INT
)
484 enum machine_mode full_mode
485 = smallest_mode_for_size (GET_MODE_BITSIZE (from_mode
), MODE_INT
);
487 gcc_assert (convert_optab_handler (sext_optab
, full_mode
, from_mode
)->insn_code
488 != CODE_FOR_nothing
);
490 if (to_mode
== full_mode
)
492 emit_unop_insn (convert_optab_handler (sext_optab
, full_mode
, from_mode
)->insn_code
,
497 new_from
= gen_reg_rtx (full_mode
);
498 emit_unop_insn (convert_optab_handler (sext_optab
, full_mode
, from_mode
)->insn_code
,
499 new_from
, from
, UNKNOWN
);
501 /* else proceed to integer conversions below. */
502 from_mode
= full_mode
;
506 /* Make sure both are fixed-point modes or both are not. */
507 gcc_assert (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode
) ==
508 ALL_SCALAR_FIXED_POINT_MODE_P (to_mode
));
509 if (ALL_SCALAR_FIXED_POINT_MODE_P (from_mode
))
511 /* If we widen from_mode to to_mode and they are in the same class,
512 we won't saturate the result.
513 Otherwise, always saturate the result to play safe. */
514 if (GET_MODE_CLASS (from_mode
) == GET_MODE_CLASS (to_mode
)
515 && GET_MODE_SIZE (from_mode
) < GET_MODE_SIZE (to_mode
))
516 expand_fixed_convert (to
, from
, 0, 0);
518 expand_fixed_convert (to
, from
, 0, 1);
522 /* Now both modes are integers. */
524 /* Handle expanding beyond a word. */
525 if (GET_MODE_BITSIZE (from_mode
) < GET_MODE_BITSIZE (to_mode
)
526 && GET_MODE_BITSIZE (to_mode
) > BITS_PER_WORD
)
533 enum machine_mode lowpart_mode
;
534 int nwords
= CEIL (GET_MODE_SIZE (to_mode
), UNITS_PER_WORD
);
536 /* Try converting directly if the insn is supported. */
537 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
540 /* If FROM is a SUBREG, put it into a register. Do this
541 so that we always generate the same set of insns for
542 better cse'ing; if an intermediate assignment occurred,
543 we won't be doing the operation directly on the SUBREG. */
544 if (optimize
> 0 && GET_CODE (from
) == SUBREG
)
545 from
= force_reg (from_mode
, from
);
546 emit_unop_insn (code
, to
, from
, equiv_code
);
549 /* Next, try converting via full word. */
550 else if (GET_MODE_BITSIZE (from_mode
) < BITS_PER_WORD
551 && ((code
= can_extend_p (to_mode
, word_mode
, unsignedp
))
552 != CODE_FOR_nothing
))
556 if (reg_overlap_mentioned_p (to
, from
))
557 from
= force_reg (from_mode
, from
);
558 emit_insn (gen_rtx_CLOBBER (VOIDmode
, to
));
560 convert_move (gen_lowpart (word_mode
, to
), from
, unsignedp
);
561 emit_unop_insn (code
, to
,
562 gen_lowpart (word_mode
, to
), equiv_code
);
566 /* No special multiword conversion insn; do it by hand. */
569 /* Since we will turn this into a no conflict block, we must ensure
570 that the source does not overlap the target. */
572 if (reg_overlap_mentioned_p (to
, from
))
573 from
= force_reg (from_mode
, from
);
575 /* Get a copy of FROM widened to a word, if necessary. */
576 if (GET_MODE_BITSIZE (from_mode
) < BITS_PER_WORD
)
577 lowpart_mode
= word_mode
;
579 lowpart_mode
= from_mode
;
581 lowfrom
= convert_to_mode (lowpart_mode
, from
, unsignedp
);
583 lowpart
= gen_lowpart (lowpart_mode
, to
);
584 emit_move_insn (lowpart
, lowfrom
);
586 /* Compute the value to put in each remaining word. */
588 fill_value
= const0_rtx
;
593 && insn_data
[(int) CODE_FOR_slt
].operand
[0].mode
== word_mode
594 && STORE_FLAG_VALUE
== -1)
596 emit_cmp_insn (lowfrom
, const0_rtx
, NE
, NULL_RTX
,
598 fill_value
= gen_reg_rtx (word_mode
);
599 emit_insn (gen_slt (fill_value
));
605 = expand_shift (RSHIFT_EXPR
, lowpart_mode
, lowfrom
,
606 size_int (GET_MODE_BITSIZE (lowpart_mode
) - 1),
608 fill_value
= convert_to_mode (word_mode
, fill_value
, 1);
612 /* Fill the remaining words. */
613 for (i
= GET_MODE_SIZE (lowpart_mode
) / UNITS_PER_WORD
; i
< nwords
; i
++)
615 int index
= (WORDS_BIG_ENDIAN
? nwords
- i
- 1 : i
);
616 rtx subword
= operand_subword (to
, index
, 1, to_mode
);
618 gcc_assert (subword
);
620 if (fill_value
!= subword
)
621 emit_move_insn (subword
, fill_value
);
624 insns
= get_insns ();
627 emit_no_conflict_block (insns
, to
, from
, NULL_RTX
,
628 gen_rtx_fmt_e (equiv_code
, to_mode
, copy_rtx (from
)));
632 /* Truncating multi-word to a word or less. */
633 if (GET_MODE_BITSIZE (from_mode
) > BITS_PER_WORD
634 && GET_MODE_BITSIZE (to_mode
) <= BITS_PER_WORD
)
637 && ! MEM_VOLATILE_P (from
)
638 && direct_load
[(int) to_mode
]
639 && ! mode_dependent_address_p (XEXP (from
, 0)))
641 || GET_CODE (from
) == SUBREG
))
642 from
= force_reg (from_mode
, from
);
643 convert_move (to
, gen_lowpart (word_mode
, from
), 0);
647 /* Now follow all the conversions between integers
648 no more than a word long. */
650 /* For truncation, usually we can just refer to FROM in a narrower mode. */
651 if (GET_MODE_BITSIZE (to_mode
) < GET_MODE_BITSIZE (from_mode
)
652 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode
),
653 GET_MODE_BITSIZE (from_mode
)))
656 && ! MEM_VOLATILE_P (from
)
657 && direct_load
[(int) to_mode
]
658 && ! mode_dependent_address_p (XEXP (from
, 0)))
660 || GET_CODE (from
) == SUBREG
))
661 from
= force_reg (from_mode
, from
);
662 if (REG_P (from
) && REGNO (from
) < FIRST_PSEUDO_REGISTER
663 && ! HARD_REGNO_MODE_OK (REGNO (from
), to_mode
))
664 from
= copy_to_reg (from
);
665 emit_move_insn (to
, gen_lowpart (to_mode
, from
));
669 /* Handle extension. */
670 if (GET_MODE_BITSIZE (to_mode
) > GET_MODE_BITSIZE (from_mode
))
672 /* Convert directly if that works. */
673 if ((code
= can_extend_p (to_mode
, from_mode
, unsignedp
))
676 emit_unop_insn (code
, to
, from
, equiv_code
);
681 enum machine_mode intermediate
;
685 /* Search for a mode to convert via. */
686 for (intermediate
= from_mode
; intermediate
!= VOIDmode
;
687 intermediate
= GET_MODE_WIDER_MODE (intermediate
))
688 if (((can_extend_p (to_mode
, intermediate
, unsignedp
)
690 || (GET_MODE_SIZE (to_mode
) < GET_MODE_SIZE (intermediate
)
691 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (to_mode
),
692 GET_MODE_BITSIZE (intermediate
))))
693 && (can_extend_p (intermediate
, from_mode
, unsignedp
)
694 != CODE_FOR_nothing
))
696 convert_move (to
, convert_to_mode (intermediate
, from
,
697 unsignedp
), unsignedp
);
701 /* No suitable intermediate mode.
702 Generate what we need with shifts. */
703 shift_amount
= build_int_cst (NULL_TREE
,
704 GET_MODE_BITSIZE (to_mode
)
705 - GET_MODE_BITSIZE (from_mode
));
706 from
= gen_lowpart (to_mode
, force_reg (from_mode
, from
));
707 tmp
= expand_shift (LSHIFT_EXPR
, to_mode
, from
, shift_amount
,
709 tmp
= expand_shift (RSHIFT_EXPR
, to_mode
, tmp
, shift_amount
,
712 emit_move_insn (to
, tmp
);
717 /* Support special truncate insns for certain modes. */
718 if (convert_optab_handler (trunc_optab
, to_mode
, from_mode
)->insn_code
!= CODE_FOR_nothing
)
720 emit_unop_insn (convert_optab_handler (trunc_optab
, to_mode
, from_mode
)->insn_code
,
725 /* Handle truncation of volatile memrefs, and so on;
726 the things that couldn't be truncated directly,
727 and for which there was no special instruction.
729 ??? Code above formerly short-circuited this, for most integer
730 mode pairs, with a force_reg in from_mode followed by a recursive
731 call to this routine. Appears always to have been wrong. */
732 if (GET_MODE_BITSIZE (to_mode
) < GET_MODE_BITSIZE (from_mode
))
734 rtx temp
= force_reg (to_mode
, gen_lowpart (to_mode
, from
));
735 emit_move_insn (to
, temp
);
739 /* Mode combination is not recognized. */
743 /* Return an rtx for a value that would result
744 from converting X to mode MODE.
745 Both X and MODE may be floating, or both integer.
746 UNSIGNEDP is nonzero if X is an unsigned value.
747 This can be done by referring to a part of X in place
748 or by copying to a new temporary with conversion. */
751 convert_to_mode (enum machine_mode mode
, rtx x
, int unsignedp
)
753 return convert_modes (mode
, VOIDmode
, x
, unsignedp
);
756 /* Return an rtx for a value that would result
757 from converting X from mode OLDMODE to mode MODE.
758 Both modes may be floating, or both integer.
759 UNSIGNEDP is nonzero if X is an unsigned value.
761 This can be done by referring to a part of X in place
762 or by copying to a new temporary with conversion.
764 You can give VOIDmode for OLDMODE, if you are sure X has a nonvoid mode. */
767 convert_modes (enum machine_mode mode
, enum machine_mode oldmode
, rtx x
, int unsignedp
)
771 /* If FROM is a SUBREG that indicates that we have already done at least
772 the required extension, strip it. */
774 if (GET_CODE (x
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (x
)
775 && GET_MODE_SIZE (GET_MODE (SUBREG_REG (x
))) >= GET_MODE_SIZE (mode
)
776 && SUBREG_PROMOTED_UNSIGNED_P (x
) == unsignedp
)
777 x
= gen_lowpart (mode
, x
);
779 if (GET_MODE (x
) != VOIDmode
)
780 oldmode
= GET_MODE (x
);
785 /* There is one case that we must handle specially: If we are converting
786 a CONST_INT into a mode whose size is twice HOST_BITS_PER_WIDE_INT and
787 we are to interpret the constant as unsigned, gen_lowpart will do
788 the wrong if the constant appears negative. What we want to do is
789 make the high-order word of the constant zero, not all ones. */
791 if (unsignedp
&& GET_MODE_CLASS (mode
) == MODE_INT
792 && GET_MODE_BITSIZE (mode
) == 2 * HOST_BITS_PER_WIDE_INT
793 && GET_CODE (x
) == CONST_INT
&& INTVAL (x
) < 0)
795 HOST_WIDE_INT val
= INTVAL (x
);
797 if (oldmode
!= VOIDmode
798 && HOST_BITS_PER_WIDE_INT
> GET_MODE_BITSIZE (oldmode
))
800 int width
= GET_MODE_BITSIZE (oldmode
);
802 /* We need to zero extend VAL. */
803 val
&= ((HOST_WIDE_INT
) 1 << width
) - 1;
806 return immed_double_const (val
, (HOST_WIDE_INT
) 0, mode
);
809 /* We can do this with a gen_lowpart if both desired and current modes
810 are integer, and this is either a constant integer, a register, or a
811 non-volatile MEM. Except for the constant case where MODE is no
812 wider than HOST_BITS_PER_WIDE_INT, we must be narrowing the operand. */
814 if ((GET_CODE (x
) == CONST_INT
815 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
)
816 || (GET_MODE_CLASS (mode
) == MODE_INT
817 && GET_MODE_CLASS (oldmode
) == MODE_INT
818 && (GET_CODE (x
) == CONST_DOUBLE
819 || (GET_MODE_SIZE (mode
) <= GET_MODE_SIZE (oldmode
)
820 && ((MEM_P (x
) && ! MEM_VOLATILE_P (x
)
821 && direct_load
[(int) mode
])
823 && (! HARD_REGISTER_P (x
)
824 || HARD_REGNO_MODE_OK (REGNO (x
), mode
))
825 && TRULY_NOOP_TRUNCATION (GET_MODE_BITSIZE (mode
),
826 GET_MODE_BITSIZE (GET_MODE (x
)))))))))
828 /* ?? If we don't know OLDMODE, we have to assume here that
829 X does not need sign- or zero-extension. This may not be
830 the case, but it's the best we can do. */
831 if (GET_CODE (x
) == CONST_INT
&& oldmode
!= VOIDmode
832 && GET_MODE_SIZE (mode
) > GET_MODE_SIZE (oldmode
))
834 HOST_WIDE_INT val
= INTVAL (x
);
835 int width
= GET_MODE_BITSIZE (oldmode
);
837 /* We must sign or zero-extend in this case. Start by
838 zero-extending, then sign extend if we need to. */
839 val
&= ((HOST_WIDE_INT
) 1 << width
) - 1;
841 && (val
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
842 val
|= (HOST_WIDE_INT
) (-1) << width
;
844 return gen_int_mode (val
, mode
);
847 return gen_lowpart (mode
, x
);
850 /* Converting from integer constant into mode is always equivalent to an
852 if (VECTOR_MODE_P (mode
) && GET_MODE (x
) == VOIDmode
)
854 gcc_assert (GET_MODE_BITSIZE (mode
) == GET_MODE_BITSIZE (oldmode
));
855 return simplify_gen_subreg (mode
, x
, oldmode
, 0);
858 temp
= gen_reg_rtx (mode
);
859 convert_move (temp
, x
, unsignedp
);
863 /* STORE_MAX_PIECES is the number of bytes at a time that we can
864 store efficiently. Due to internal GCC limitations, this is
865 MOVE_MAX_PIECES limited by the number of bytes GCC can represent
866 for an immediate constant. */
868 #define STORE_MAX_PIECES MIN (MOVE_MAX_PIECES, 2 * sizeof (HOST_WIDE_INT))
870 /* Determine whether the LEN bytes can be moved by using several move
871 instructions. Return nonzero if a call to move_by_pieces should
875 can_move_by_pieces (unsigned HOST_WIDE_INT len
,
876 unsigned int align ATTRIBUTE_UNUSED
)
878 return MOVE_BY_PIECES_P (len
, align
);
881 /* Generate several move instructions to copy LEN bytes from block FROM to
882 block TO. (These are MEM rtx's with BLKmode).
884 If PUSH_ROUNDING is defined and TO is NULL, emit_single_push_insn is
885 used to push FROM to the stack.
887 ALIGN is maximum stack alignment we can assume.
889 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
890 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
894 move_by_pieces (rtx to
, rtx from
, unsigned HOST_WIDE_INT len
,
895 unsigned int align
, int endp
)
897 struct move_by_pieces data
;
898 rtx to_addr
, from_addr
= XEXP (from
, 0);
899 unsigned int max_size
= MOVE_MAX_PIECES
+ 1;
900 enum machine_mode mode
= VOIDmode
, tmode
;
901 enum insn_code icode
;
903 align
= MIN (to
? MEM_ALIGN (to
) : align
, MEM_ALIGN (from
));
906 data
.from_addr
= from_addr
;
909 to_addr
= XEXP (to
, 0);
912 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
913 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
915 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
922 #ifdef STACK_GROWS_DOWNWARD
928 data
.to_addr
= to_addr
;
931 = (GET_CODE (from_addr
) == PRE_INC
|| GET_CODE (from_addr
) == PRE_DEC
932 || GET_CODE (from_addr
) == POST_INC
933 || GET_CODE (from_addr
) == POST_DEC
);
935 data
.explicit_inc_from
= 0;
936 data
.explicit_inc_to
= 0;
937 if (data
.reverse
) data
.offset
= len
;
940 /* If copying requires more than two move insns,
941 copy addresses to registers (to make displacements shorter)
942 and use post-increment if available. */
943 if (!(data
.autinc_from
&& data
.autinc_to
)
944 && move_by_pieces_ninsns (len
, align
, max_size
) > 2)
946 /* Find the mode of the largest move... */
947 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
948 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
949 if (GET_MODE_SIZE (tmode
) < max_size
)
952 if (USE_LOAD_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_from
)
954 data
.from_addr
= copy_addr_to_reg (plus_constant (from_addr
, len
));
955 data
.autinc_from
= 1;
956 data
.explicit_inc_from
= -1;
958 if (USE_LOAD_POST_INCREMENT (mode
) && ! data
.autinc_from
)
960 data
.from_addr
= copy_addr_to_reg (from_addr
);
961 data
.autinc_from
= 1;
962 data
.explicit_inc_from
= 1;
964 if (!data
.autinc_from
&& CONSTANT_P (from_addr
))
965 data
.from_addr
= copy_addr_to_reg (from_addr
);
966 if (USE_STORE_PRE_DECREMENT (mode
) && data
.reverse
&& ! data
.autinc_to
)
968 data
.to_addr
= copy_addr_to_reg (plus_constant (to_addr
, len
));
970 data
.explicit_inc_to
= -1;
972 if (USE_STORE_POST_INCREMENT (mode
) && ! data
.reverse
&& ! data
.autinc_to
)
974 data
.to_addr
= copy_addr_to_reg (to_addr
);
976 data
.explicit_inc_to
= 1;
978 if (!data
.autinc_to
&& CONSTANT_P (to_addr
))
979 data
.to_addr
= copy_addr_to_reg (to_addr
);
982 tmode
= mode_for_size (MOVE_MAX_PIECES
* BITS_PER_UNIT
, MODE_INT
, 1);
983 if (align
>= GET_MODE_ALIGNMENT (tmode
))
984 align
= GET_MODE_ALIGNMENT (tmode
);
987 enum machine_mode xmode
;
989 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
), xmode
= tmode
;
991 xmode
= tmode
, tmode
= GET_MODE_WIDER_MODE (tmode
))
992 if (GET_MODE_SIZE (tmode
) > MOVE_MAX_PIECES
993 || SLOW_UNALIGNED_ACCESS (tmode
, align
))
996 align
= MAX (align
, GET_MODE_ALIGNMENT (xmode
));
999 /* First move what we can in the largest integer mode, then go to
1000 successively smaller modes. */
1002 while (max_size
> 1)
1004 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1005 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
1006 if (GET_MODE_SIZE (tmode
) < max_size
)
1009 if (mode
== VOIDmode
)
1012 icode
= optab_handler (mov_optab
, mode
)->insn_code
;
1013 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
1014 move_by_pieces_1 (GEN_FCN (icode
), mode
, &data
);
1016 max_size
= GET_MODE_SIZE (mode
);
1019 /* The code above should have handled everything. */
1020 gcc_assert (!data
.len
);
1026 gcc_assert (!data
.reverse
);
1031 if (HAVE_POST_INCREMENT
&& data
.explicit_inc_to
> 0)
1032 emit_insn (gen_add2_insn (data
.to_addr
, constm1_rtx
));
1034 data
.to_addr
= copy_addr_to_reg (plus_constant (data
.to_addr
,
1037 to1
= adjust_automodify_address (data
.to
, QImode
, data
.to_addr
,
1044 to1
= adjust_address (data
.to
, QImode
, data
.offset
);
1052 /* Return number of insns required to move L bytes by pieces.
1053 ALIGN (in bits) is maximum alignment we can assume. */
1055 static unsigned HOST_WIDE_INT
1056 move_by_pieces_ninsns (unsigned HOST_WIDE_INT l
, unsigned int align
,
1057 unsigned int max_size
)
1059 unsigned HOST_WIDE_INT n_insns
= 0;
1060 enum machine_mode tmode
;
1062 tmode
= mode_for_size (MOVE_MAX_PIECES
* BITS_PER_UNIT
, MODE_INT
, 1);
1063 if (align
>= GET_MODE_ALIGNMENT (tmode
))
1064 align
= GET_MODE_ALIGNMENT (tmode
);
1067 enum machine_mode tmode
, xmode
;
1069 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
), xmode
= tmode
;
1071 xmode
= tmode
, tmode
= GET_MODE_WIDER_MODE (tmode
))
1072 if (GET_MODE_SIZE (tmode
) > MOVE_MAX_PIECES
1073 || SLOW_UNALIGNED_ACCESS (tmode
, align
))
1076 align
= MAX (align
, GET_MODE_ALIGNMENT (xmode
));
1079 while (max_size
> 1)
1081 enum machine_mode mode
= VOIDmode
;
1082 enum insn_code icode
;
1084 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
1085 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
1086 if (GET_MODE_SIZE (tmode
) < max_size
)
1089 if (mode
== VOIDmode
)
1092 icode
= optab_handler (mov_optab
, mode
)->insn_code
;
1093 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
1094 n_insns
+= l
/ GET_MODE_SIZE (mode
), l
%= GET_MODE_SIZE (mode
);
1096 max_size
= GET_MODE_SIZE (mode
);
1103 /* Subroutine of move_by_pieces. Move as many bytes as appropriate
1104 with move instructions for mode MODE. GENFUN is the gen_... function
1105 to make a move insn for that mode. DATA has all the other info. */
1108 move_by_pieces_1 (rtx (*genfun
) (rtx
, ...), enum machine_mode mode
,
1109 struct move_by_pieces
*data
)
1111 unsigned int size
= GET_MODE_SIZE (mode
);
1112 rtx to1
= NULL_RTX
, from1
;
1114 while (data
->len
>= size
)
1117 data
->offset
-= size
;
1121 if (data
->autinc_to
)
1122 to1
= adjust_automodify_address (data
->to
, mode
, data
->to_addr
,
1125 to1
= adjust_address (data
->to
, mode
, data
->offset
);
1128 if (data
->autinc_from
)
1129 from1
= adjust_automodify_address (data
->from
, mode
, data
->from_addr
,
1132 from1
= adjust_address (data
->from
, mode
, data
->offset
);
1134 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
1135 emit_insn (gen_add2_insn (data
->to_addr
,
1136 GEN_INT (-(HOST_WIDE_INT
)size
)));
1137 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_from
< 0)
1138 emit_insn (gen_add2_insn (data
->from_addr
,
1139 GEN_INT (-(HOST_WIDE_INT
)size
)));
1142 emit_insn ((*genfun
) (to1
, from1
));
1145 #ifdef PUSH_ROUNDING
1146 emit_single_push_insn (mode
, from1
, NULL
);
1152 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
1153 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (size
)));
1154 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_from
> 0)
1155 emit_insn (gen_add2_insn (data
->from_addr
, GEN_INT (size
)));
1157 if (! data
->reverse
)
1158 data
->offset
+= size
;
1164 /* Emit code to move a block Y to a block X. This may be done with
1165 string-move instructions, with multiple scalar move instructions,
1166 or with a library call.
1168 Both X and Y must be MEM rtx's (perhaps inside VOLATILE) with mode BLKmode.
1169 SIZE is an rtx that says how long they are.
1170 ALIGN is the maximum alignment we can assume they have.
1171 METHOD describes what kind of copy this is, and what mechanisms may be used.
1173 Return the address of the new block, if memcpy is called and returns it,
1177 emit_block_move_hints (rtx x
, rtx y
, rtx size
, enum block_op_methods method
,
1178 unsigned int expected_align
, HOST_WIDE_INT expected_size
)
1186 case BLOCK_OP_NORMAL
:
1187 case BLOCK_OP_TAILCALL
:
1188 may_use_call
= true;
1191 case BLOCK_OP_CALL_PARM
:
1192 may_use_call
= block_move_libcall_safe_for_call_parm ();
1194 /* Make inhibit_defer_pop nonzero around the library call
1195 to force it to pop the arguments right away. */
1199 case BLOCK_OP_NO_LIBCALL
:
1200 may_use_call
= false;
1207 align
= MIN (MEM_ALIGN (x
), MEM_ALIGN (y
));
1209 gcc_assert (MEM_P (x
));
1210 gcc_assert (MEM_P (y
));
1213 /* Make sure we've got BLKmode addresses; store_one_arg can decide that
1214 block copy is more efficient for other large modes, e.g. DCmode. */
1215 x
= adjust_address (x
, BLKmode
, 0);
1216 y
= adjust_address (y
, BLKmode
, 0);
1218 /* Set MEM_SIZE as appropriate for this block copy. The main place this
1219 can be incorrect is coming from __builtin_memcpy. */
1220 if (GET_CODE (size
) == CONST_INT
)
1222 if (INTVAL (size
) == 0)
1225 x
= shallow_copy_rtx (x
);
1226 y
= shallow_copy_rtx (y
);
1227 set_mem_size (x
, size
);
1228 set_mem_size (y
, size
);
1231 if (GET_CODE (size
) == CONST_INT
&& MOVE_BY_PIECES_P (INTVAL (size
), align
))
1232 move_by_pieces (x
, y
, INTVAL (size
), align
, 0);
1233 else if (emit_block_move_via_movmem (x
, y
, size
, align
,
1234 expected_align
, expected_size
))
1236 else if (may_use_call
)
1237 retval
= emit_block_move_via_libcall (x
, y
, size
,
1238 method
== BLOCK_OP_TAILCALL
);
1240 emit_block_move_via_loop (x
, y
, size
, align
);
1242 if (method
== BLOCK_OP_CALL_PARM
)
1249 emit_block_move (rtx x
, rtx y
, rtx size
, enum block_op_methods method
)
1251 return emit_block_move_hints (x
, y
, size
, method
, 0, -1);
1254 /* A subroutine of emit_block_move. Returns true if calling the
1255 block move libcall will not clobber any parameters which may have
1256 already been placed on the stack. */
1259 block_move_libcall_safe_for_call_parm (void)
1261 /* If arguments are pushed on the stack, then they're safe. */
1265 /* If registers go on the stack anyway, any argument is sure to clobber
1266 an outgoing argument. */
1267 #if defined (REG_PARM_STACK_SPACE)
1268 if (OUTGOING_REG_PARM_STACK_SPACE
)
1271 fn
= emit_block_move_libcall_fn (false);
1272 if (REG_PARM_STACK_SPACE (fn
) != 0)
1277 /* If any argument goes in memory, then it might clobber an outgoing
1280 CUMULATIVE_ARGS args_so_far
;
1283 fn
= emit_block_move_libcall_fn (false);
1284 INIT_CUMULATIVE_ARGS (args_so_far
, TREE_TYPE (fn
), NULL_RTX
, 0, 3);
1286 arg
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1287 for ( ; arg
!= void_list_node
; arg
= TREE_CHAIN (arg
))
1289 enum machine_mode mode
= TYPE_MODE (TREE_VALUE (arg
));
1290 rtx tmp
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
1291 if (!tmp
|| !REG_P (tmp
))
1293 if (targetm
.calls
.arg_partial_bytes (&args_so_far
, mode
, NULL
, 1))
1295 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, NULL_TREE
, 1);
1301 /* A subroutine of emit_block_move. Expand a movmem pattern;
1302 return true if successful. */
1305 emit_block_move_via_movmem (rtx x
, rtx y
, rtx size
, unsigned int align
,
1306 unsigned int expected_align
, HOST_WIDE_INT expected_size
)
1308 rtx opalign
= GEN_INT (align
/ BITS_PER_UNIT
);
1309 int save_volatile_ok
= volatile_ok
;
1310 enum machine_mode mode
;
1312 if (expected_align
< align
)
1313 expected_align
= align
;
1315 /* Since this is a move insn, we don't care about volatility. */
1318 /* Try the most limited insn first, because there's no point
1319 including more than one in the machine description unless
1320 the more limited one has some advantage. */
1322 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
1323 mode
= GET_MODE_WIDER_MODE (mode
))
1325 enum insn_code code
= movmem_optab
[(int) mode
];
1326 insn_operand_predicate_fn pred
;
1328 if (code
!= CODE_FOR_nothing
1329 /* We don't need MODE to be narrower than BITS_PER_HOST_WIDE_INT
1330 here because if SIZE is less than the mode mask, as it is
1331 returned by the macro, it will definitely be less than the
1332 actual mode mask. */
1333 && ((GET_CODE (size
) == CONST_INT
1334 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
1335 <= (GET_MODE_MASK (mode
) >> 1)))
1336 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
)
1337 && ((pred
= insn_data
[(int) code
].operand
[0].predicate
) == 0
1338 || (*pred
) (x
, BLKmode
))
1339 && ((pred
= insn_data
[(int) code
].operand
[1].predicate
) == 0
1340 || (*pred
) (y
, BLKmode
))
1341 && ((pred
= insn_data
[(int) code
].operand
[3].predicate
) == 0
1342 || (*pred
) (opalign
, VOIDmode
)))
1345 rtx last
= get_last_insn ();
1348 op2
= convert_to_mode (mode
, size
, 1);
1349 pred
= insn_data
[(int) code
].operand
[2].predicate
;
1350 if (pred
!= 0 && ! (*pred
) (op2
, mode
))
1351 op2
= copy_to_mode_reg (mode
, op2
);
1353 /* ??? When called via emit_block_move_for_call, it'd be
1354 nice if there were some way to inform the backend, so
1355 that it doesn't fail the expansion because it thinks
1356 emitting the libcall would be more efficient. */
1358 if (insn_data
[(int) code
].n_operands
== 4)
1359 pat
= GEN_FCN ((int) code
) (x
, y
, op2
, opalign
);
1361 pat
= GEN_FCN ((int) code
) (x
, y
, op2
, opalign
,
1362 GEN_INT (expected_align
),
1363 GEN_INT (expected_size
));
1367 volatile_ok
= save_volatile_ok
;
1371 delete_insns_since (last
);
1375 volatile_ok
= save_volatile_ok
;
1379 /* A subroutine of emit_block_move. Expand a call to memcpy.
1380 Return the return value from memcpy, 0 otherwise. */
1383 emit_block_move_via_libcall (rtx dst
, rtx src
, rtx size
, bool tailcall
)
1385 rtx dst_addr
, src_addr
;
1386 tree call_expr
, fn
, src_tree
, dst_tree
, size_tree
;
1387 enum machine_mode size_mode
;
1390 /* Emit code to copy the addresses of DST and SRC and SIZE into new
1391 pseudos. We can then place those new pseudos into a VAR_DECL and
1394 dst_addr
= copy_to_mode_reg (Pmode
, XEXP (dst
, 0));
1395 src_addr
= copy_to_mode_reg (Pmode
, XEXP (src
, 0));
1397 dst_addr
= convert_memory_address (ptr_mode
, dst_addr
);
1398 src_addr
= convert_memory_address (ptr_mode
, src_addr
);
1400 dst_tree
= make_tree (ptr_type_node
, dst_addr
);
1401 src_tree
= make_tree (ptr_type_node
, src_addr
);
1403 size_mode
= TYPE_MODE (sizetype
);
1405 size
= convert_to_mode (size_mode
, size
, 1);
1406 size
= copy_to_mode_reg (size_mode
, size
);
1408 /* It is incorrect to use the libcall calling conventions to call
1409 memcpy in this context. This could be a user call to memcpy and
1410 the user may wish to examine the return value from memcpy. For
1411 targets where libcalls and normal calls have different conventions
1412 for returning pointers, we could end up generating incorrect code. */
1414 size_tree
= make_tree (sizetype
, size
);
1416 fn
= emit_block_move_libcall_fn (true);
1417 call_expr
= build_call_expr (fn
, 3, dst_tree
, src_tree
, size_tree
);
1418 CALL_EXPR_TAILCALL (call_expr
) = tailcall
;
1420 retval
= expand_normal (call_expr
);
1425 /* A subroutine of emit_block_move_via_libcall. Create the tree node
1426 for the function we use for block copies. The first time FOR_CALL
1427 is true, we call assemble_external. */
1429 static GTY(()) tree block_move_fn
;
1432 init_block_move_fn (const char *asmspec
)
1438 fn
= get_identifier ("memcpy");
1439 args
= build_function_type_list (ptr_type_node
, ptr_type_node
,
1440 const_ptr_type_node
, sizetype
,
1443 fn
= build_decl (FUNCTION_DECL
, fn
, args
);
1444 DECL_EXTERNAL (fn
) = 1;
1445 TREE_PUBLIC (fn
) = 1;
1446 DECL_ARTIFICIAL (fn
) = 1;
1447 TREE_NOTHROW (fn
) = 1;
1448 DECL_VISIBILITY (fn
) = VISIBILITY_DEFAULT
;
1449 DECL_VISIBILITY_SPECIFIED (fn
) = 1;
1455 set_user_assembler_name (block_move_fn
, asmspec
);
1459 emit_block_move_libcall_fn (int for_call
)
1461 static bool emitted_extern
;
1464 init_block_move_fn (NULL
);
1466 if (for_call
&& !emitted_extern
)
1468 emitted_extern
= true;
1469 make_decl_rtl (block_move_fn
);
1470 assemble_external (block_move_fn
);
1473 return block_move_fn
;
1476 /* A subroutine of emit_block_move. Copy the data via an explicit
1477 loop. This is used only when libcalls are forbidden. */
1478 /* ??? It'd be nice to copy in hunks larger than QImode. */
1481 emit_block_move_via_loop (rtx x
, rtx y
, rtx size
,
1482 unsigned int align ATTRIBUTE_UNUSED
)
1484 rtx cmp_label
, top_label
, iter
, x_addr
, y_addr
, tmp
;
1485 enum machine_mode iter_mode
;
1487 iter_mode
= GET_MODE (size
);
1488 if (iter_mode
== VOIDmode
)
1489 iter_mode
= word_mode
;
1491 top_label
= gen_label_rtx ();
1492 cmp_label
= gen_label_rtx ();
1493 iter
= gen_reg_rtx (iter_mode
);
1495 emit_move_insn (iter
, const0_rtx
);
1497 x_addr
= force_operand (XEXP (x
, 0), NULL_RTX
);
1498 y_addr
= force_operand (XEXP (y
, 0), NULL_RTX
);
1499 do_pending_stack_adjust ();
1501 emit_jump (cmp_label
);
1502 emit_label (top_label
);
1504 tmp
= convert_modes (Pmode
, iter_mode
, iter
, true);
1505 x_addr
= gen_rtx_PLUS (Pmode
, x_addr
, tmp
);
1506 y_addr
= gen_rtx_PLUS (Pmode
, y_addr
, tmp
);
1507 x
= change_address (x
, QImode
, x_addr
);
1508 y
= change_address (y
, QImode
, y_addr
);
1510 emit_move_insn (x
, y
);
1512 tmp
= expand_simple_binop (iter_mode
, PLUS
, iter
, const1_rtx
, iter
,
1513 true, OPTAB_LIB_WIDEN
);
1515 emit_move_insn (iter
, tmp
);
1517 emit_label (cmp_label
);
1519 emit_cmp_and_jump_insns (iter
, size
, LT
, NULL_RTX
, iter_mode
,
1523 /* Copy all or part of a value X into registers starting at REGNO.
1524 The number of registers to be filled is NREGS. */
1527 move_block_to_reg (int regno
, rtx x
, int nregs
, enum machine_mode mode
)
1530 #ifdef HAVE_load_multiple
1538 if (CONSTANT_P (x
) && ! LEGITIMATE_CONSTANT_P (x
))
1539 x
= validize_mem (force_const_mem (mode
, x
));
1541 /* See if the machine can do this with a load multiple insn. */
1542 #ifdef HAVE_load_multiple
1543 if (HAVE_load_multiple
)
1545 last
= get_last_insn ();
1546 pat
= gen_load_multiple (gen_rtx_REG (word_mode
, regno
), x
,
1554 delete_insns_since (last
);
1558 for (i
= 0; i
< nregs
; i
++)
1559 emit_move_insn (gen_rtx_REG (word_mode
, regno
+ i
),
1560 operand_subword_force (x
, i
, mode
));
1563 /* Copy all or part of a BLKmode value X out of registers starting at REGNO.
1564 The number of registers to be filled is NREGS. */
1567 move_block_from_reg (int regno
, rtx x
, int nregs
)
1574 /* See if the machine can do this with a store multiple insn. */
1575 #ifdef HAVE_store_multiple
1576 if (HAVE_store_multiple
)
1578 rtx last
= get_last_insn ();
1579 rtx pat
= gen_store_multiple (x
, gen_rtx_REG (word_mode
, regno
),
1587 delete_insns_since (last
);
1591 for (i
= 0; i
< nregs
; i
++)
1593 rtx tem
= operand_subword (x
, i
, 1, BLKmode
);
1597 emit_move_insn (tem
, gen_rtx_REG (word_mode
, regno
+ i
));
1601 /* Generate a PARALLEL rtx for a new non-consecutive group of registers from
1602 ORIG, where ORIG is a non-consecutive group of registers represented by
1603 a PARALLEL. The clone is identical to the original except in that the
1604 original set of registers is replaced by a new set of pseudo registers.
1605 The new set has the same modes as the original set. */
1608 gen_group_rtx (rtx orig
)
1613 gcc_assert (GET_CODE (orig
) == PARALLEL
);
1615 length
= XVECLEN (orig
, 0);
1616 tmps
= alloca (sizeof (rtx
) * length
);
1618 /* Skip a NULL entry in first slot. */
1619 i
= XEXP (XVECEXP (orig
, 0, 0), 0) ? 0 : 1;
1624 for (; i
< length
; i
++)
1626 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (orig
, 0, i
), 0));
1627 rtx offset
= XEXP (XVECEXP (orig
, 0, i
), 1);
1629 tmps
[i
] = gen_rtx_EXPR_LIST (VOIDmode
, gen_reg_rtx (mode
), offset
);
1632 return gen_rtx_PARALLEL (GET_MODE (orig
), gen_rtvec_v (length
, tmps
));
1635 /* A subroutine of emit_group_load. Arguments as for emit_group_load,
1636 except that values are placed in TMPS[i], and must later be moved
1637 into corresponding XEXP (XVECEXP (DST, 0, i), 0) element. */
1640 emit_group_load_1 (rtx
*tmps
, rtx dst
, rtx orig_src
, tree type
, int ssize
)
1644 enum machine_mode m
= GET_MODE (orig_src
);
1646 gcc_assert (GET_CODE (dst
) == PARALLEL
);
1649 && !SCALAR_INT_MODE_P (m
)
1650 && !MEM_P (orig_src
)
1651 && GET_CODE (orig_src
) != CONCAT
)
1653 enum machine_mode imode
= int_mode_for_mode (GET_MODE (orig_src
));
1654 if (imode
== BLKmode
)
1655 src
= assign_stack_temp (GET_MODE (orig_src
), ssize
, 0);
1657 src
= gen_reg_rtx (imode
);
1658 if (imode
!= BLKmode
)
1659 src
= gen_lowpart (GET_MODE (orig_src
), src
);
1660 emit_move_insn (src
, orig_src
);
1661 /* ...and back again. */
1662 if (imode
!= BLKmode
)
1663 src
= gen_lowpart (imode
, src
);
1664 emit_group_load_1 (tmps
, dst
, src
, type
, ssize
);
1668 /* Check for a NULL entry, used to indicate that the parameter goes
1669 both on the stack and in registers. */
1670 if (XEXP (XVECEXP (dst
, 0, 0), 0))
1675 /* Process the pieces. */
1676 for (i
= start
; i
< XVECLEN (dst
, 0); i
++)
1678 enum machine_mode mode
= GET_MODE (XEXP (XVECEXP (dst
, 0, i
), 0));
1679 HOST_WIDE_INT bytepos
= INTVAL (XEXP (XVECEXP (dst
, 0, i
), 1));
1680 unsigned int bytelen
= GET_MODE_SIZE (mode
);
1683 /* Handle trailing fragments that run over the size of the struct. */
1684 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
1686 /* Arrange to shift the fragment to where it belongs.
1687 extract_bit_field loads to the lsb of the reg. */
1689 #ifdef BLOCK_REG_PADDING
1690 BLOCK_REG_PADDING (GET_MODE (orig_src
), type
, i
== start
)
1691 == (BYTES_BIG_ENDIAN
? upward
: downward
)
1696 shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
1697 bytelen
= ssize
- bytepos
;
1698 gcc_assert (bytelen
> 0);
1701 /* If we won't be loading directly from memory, protect the real source
1702 from strange tricks we might play; but make sure that the source can
1703 be loaded directly into the destination. */
1705 if (!MEM_P (orig_src
)
1706 && (!CONSTANT_P (orig_src
)
1707 || (GET_MODE (orig_src
) != mode
1708 && GET_MODE (orig_src
) != VOIDmode
)))
1710 if (GET_MODE (orig_src
) == VOIDmode
)
1711 src
= gen_reg_rtx (mode
);
1713 src
= gen_reg_rtx (GET_MODE (orig_src
));
1715 emit_move_insn (src
, orig_src
);
1718 /* Optimize the access just a bit. */
1720 && (! SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (src
))
1721 || MEM_ALIGN (src
) >= GET_MODE_ALIGNMENT (mode
))
1722 && bytepos
* BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
1723 && bytelen
== GET_MODE_SIZE (mode
))
1725 tmps
[i
] = gen_reg_rtx (mode
);
1726 emit_move_insn (tmps
[i
], adjust_address (src
, mode
, bytepos
));
1728 else if (COMPLEX_MODE_P (mode
)
1729 && GET_MODE (src
) == mode
1730 && bytelen
== GET_MODE_SIZE (mode
))
1731 /* Let emit_move_complex do the bulk of the work. */
1733 else if (GET_CODE (src
) == CONCAT
)
1735 unsigned int slen
= GET_MODE_SIZE (GET_MODE (src
));
1736 unsigned int slen0
= GET_MODE_SIZE (GET_MODE (XEXP (src
, 0)));
1738 if ((bytepos
== 0 && bytelen
== slen0
)
1739 || (bytepos
!= 0 && bytepos
+ bytelen
<= slen
))
1741 /* The following assumes that the concatenated objects all
1742 have the same size. In this case, a simple calculation
1743 can be used to determine the object and the bit field
1745 tmps
[i
] = XEXP (src
, bytepos
/ slen0
);
1746 if (! CONSTANT_P (tmps
[i
])
1747 && (!REG_P (tmps
[i
]) || GET_MODE (tmps
[i
]) != mode
))
1748 tmps
[i
] = extract_bit_field (tmps
[i
], bytelen
* BITS_PER_UNIT
,
1749 (bytepos
% slen0
) * BITS_PER_UNIT
,
1750 1, NULL_RTX
, mode
, mode
);
1756 gcc_assert (!bytepos
);
1757 mem
= assign_stack_temp (GET_MODE (src
), slen
, 0);
1758 emit_move_insn (mem
, src
);
1759 tmps
[i
] = extract_bit_field (mem
, bytelen
* BITS_PER_UNIT
,
1760 0, 1, NULL_RTX
, mode
, mode
);
1763 /* FIXME: A SIMD parallel will eventually lead to a subreg of a
1764 SIMD register, which is currently broken. While we get GCC
1765 to emit proper RTL for these cases, let's dump to memory. */
1766 else if (VECTOR_MODE_P (GET_MODE (dst
))
1769 int slen
= GET_MODE_SIZE (GET_MODE (src
));
1772 mem
= assign_stack_temp (GET_MODE (src
), slen
, 0);
1773 emit_move_insn (mem
, src
);
1774 tmps
[i
] = adjust_address (mem
, mode
, (int) bytepos
);
1776 else if (CONSTANT_P (src
) && GET_MODE (dst
) != BLKmode
1777 && XVECLEN (dst
, 0) > 1)
1778 tmps
[i
] = simplify_gen_subreg (mode
, src
, GET_MODE(dst
), bytepos
);
1779 else if (CONSTANT_P (src
)
1780 || (REG_P (src
) && GET_MODE (src
) == mode
))
1783 tmps
[i
] = extract_bit_field (src
, bytelen
* BITS_PER_UNIT
,
1784 bytepos
* BITS_PER_UNIT
, 1, NULL_RTX
,
1788 tmps
[i
] = expand_shift (LSHIFT_EXPR
, mode
, tmps
[i
],
1789 build_int_cst (NULL_TREE
, shift
), tmps
[i
], 0);
1793 /* Emit code to move a block SRC of type TYPE to a block DST,
1794 where DST is non-consecutive registers represented by a PARALLEL.
1795 SSIZE represents the total size of block ORIG_SRC in bytes, or -1
1799 emit_group_load (rtx dst
, rtx src
, tree type
, int ssize
)
1804 tmps
= alloca (sizeof (rtx
) * XVECLEN (dst
, 0));
1805 emit_group_load_1 (tmps
, dst
, src
, type
, ssize
);
1807 /* Copy the extracted pieces into the proper (probable) hard regs. */
1808 for (i
= 0; i
< XVECLEN (dst
, 0); i
++)
1810 rtx d
= XEXP (XVECEXP (dst
, 0, i
), 0);
1813 emit_move_insn (d
, tmps
[i
]);
1817 /* Similar, but load SRC into new pseudos in a format that looks like
1818 PARALLEL. This can later be fed to emit_group_move to get things
1819 in the right place. */
1822 emit_group_load_into_temps (rtx parallel
, rtx src
, tree type
, int ssize
)
1827 vec
= rtvec_alloc (XVECLEN (parallel
, 0));
1828 emit_group_load_1 (&RTVEC_ELT (vec
, 0), parallel
, src
, type
, ssize
);
1830 /* Convert the vector to look just like the original PARALLEL, except
1831 with the computed values. */
1832 for (i
= 0; i
< XVECLEN (parallel
, 0); i
++)
1834 rtx e
= XVECEXP (parallel
, 0, i
);
1835 rtx d
= XEXP (e
, 0);
1839 d
= force_reg (GET_MODE (d
), RTVEC_ELT (vec
, i
));
1840 e
= alloc_EXPR_LIST (REG_NOTE_KIND (e
), d
, XEXP (e
, 1));
1842 RTVEC_ELT (vec
, i
) = e
;
1845 return gen_rtx_PARALLEL (GET_MODE (parallel
), vec
);
1848 /* Emit code to move a block SRC to block DST, where SRC and DST are
1849 non-consecutive groups of registers, each represented by a PARALLEL. */
1852 emit_group_move (rtx dst
, rtx src
)
1856 gcc_assert (GET_CODE (src
) == PARALLEL
1857 && GET_CODE (dst
) == PARALLEL
1858 && XVECLEN (src
, 0) == XVECLEN (dst
, 0));
1860 /* Skip first entry if NULL. */
1861 for (i
= XEXP (XVECEXP (src
, 0, 0), 0) ? 0 : 1; i
< XVECLEN (src
, 0); i
++)
1862 emit_move_insn (XEXP (XVECEXP (dst
, 0, i
), 0),
1863 XEXP (XVECEXP (src
, 0, i
), 0));
1866 /* Move a group of registers represented by a PARALLEL into pseudos. */
1869 emit_group_move_into_temps (rtx src
)
1871 rtvec vec
= rtvec_alloc (XVECLEN (src
, 0));
1874 for (i
= 0; i
< XVECLEN (src
, 0); i
++)
1876 rtx e
= XVECEXP (src
, 0, i
);
1877 rtx d
= XEXP (e
, 0);
1880 e
= alloc_EXPR_LIST (REG_NOTE_KIND (e
), copy_to_reg (d
), XEXP (e
, 1));
1881 RTVEC_ELT (vec
, i
) = e
;
1884 return gen_rtx_PARALLEL (GET_MODE (src
), vec
);
1887 /* Emit code to move a block SRC to a block ORIG_DST of type TYPE,
1888 where SRC is non-consecutive registers represented by a PARALLEL.
1889 SSIZE represents the total size of block ORIG_DST, or -1 if not
1893 emit_group_store (rtx orig_dst
, rtx src
, tree type ATTRIBUTE_UNUSED
, int ssize
)
1896 int start
, finish
, i
;
1897 enum machine_mode m
= GET_MODE (orig_dst
);
1899 gcc_assert (GET_CODE (src
) == PARALLEL
);
1901 if (!SCALAR_INT_MODE_P (m
)
1902 && !MEM_P (orig_dst
) && GET_CODE (orig_dst
) != CONCAT
)
1904 enum machine_mode imode
= int_mode_for_mode (GET_MODE (orig_dst
));
1905 if (imode
== BLKmode
)
1906 dst
= assign_stack_temp (GET_MODE (orig_dst
), ssize
, 0);
1908 dst
= gen_reg_rtx (imode
);
1909 emit_group_store (dst
, src
, type
, ssize
);
1910 if (imode
!= BLKmode
)
1911 dst
= gen_lowpart (GET_MODE (orig_dst
), dst
);
1912 emit_move_insn (orig_dst
, dst
);
1916 /* Check for a NULL entry, used to indicate that the parameter goes
1917 both on the stack and in registers. */
1918 if (XEXP (XVECEXP (src
, 0, 0), 0))
1922 finish
= XVECLEN (src
, 0);
1924 tmps
= alloca (sizeof (rtx
) * finish
);
1926 /* Copy the (probable) hard regs into pseudos. */
1927 for (i
= start
; i
< finish
; i
++)
1929 rtx reg
= XEXP (XVECEXP (src
, 0, i
), 0);
1930 if (!REG_P (reg
) || REGNO (reg
) < FIRST_PSEUDO_REGISTER
)
1932 tmps
[i
] = gen_reg_rtx (GET_MODE (reg
));
1933 emit_move_insn (tmps
[i
], reg
);
1939 /* If we won't be storing directly into memory, protect the real destination
1940 from strange tricks we might play. */
1942 if (GET_CODE (dst
) == PARALLEL
)
1946 /* We can get a PARALLEL dst if there is a conditional expression in
1947 a return statement. In that case, the dst and src are the same,
1948 so no action is necessary. */
1949 if (rtx_equal_p (dst
, src
))
1952 /* It is unclear if we can ever reach here, but we may as well handle
1953 it. Allocate a temporary, and split this into a store/load to/from
1956 temp
= assign_stack_temp (GET_MODE (dst
), ssize
, 0);
1957 emit_group_store (temp
, src
, type
, ssize
);
1958 emit_group_load (dst
, temp
, type
, ssize
);
1961 else if (!MEM_P (dst
) && GET_CODE (dst
) != CONCAT
)
1963 enum machine_mode outer
= GET_MODE (dst
);
1964 enum machine_mode inner
;
1965 HOST_WIDE_INT bytepos
;
1969 if (!REG_P (dst
) || REGNO (dst
) < FIRST_PSEUDO_REGISTER
)
1970 dst
= gen_reg_rtx (outer
);
1972 /* Make life a bit easier for combine. */
1973 /* If the first element of the vector is the low part
1974 of the destination mode, use a paradoxical subreg to
1975 initialize the destination. */
1978 inner
= GET_MODE (tmps
[start
]);
1979 bytepos
= subreg_lowpart_offset (inner
, outer
);
1980 if (INTVAL (XEXP (XVECEXP (src
, 0, start
), 1)) == bytepos
)
1982 temp
= simplify_gen_subreg (outer
, tmps
[start
],
1986 emit_move_insn (dst
, temp
);
1993 /* If the first element wasn't the low part, try the last. */
1995 && start
< finish
- 1)
1997 inner
= GET_MODE (tmps
[finish
- 1]);
1998 bytepos
= subreg_lowpart_offset (inner
, outer
);
1999 if (INTVAL (XEXP (XVECEXP (src
, 0, finish
- 1), 1)) == bytepos
)
2001 temp
= simplify_gen_subreg (outer
, tmps
[finish
- 1],
2005 emit_move_insn (dst
, temp
);
2012 /* Otherwise, simply initialize the result to zero. */
2014 emit_move_insn (dst
, CONST0_RTX (outer
));
2017 /* Process the pieces. */
2018 for (i
= start
; i
< finish
; i
++)
2020 HOST_WIDE_INT bytepos
= INTVAL (XEXP (XVECEXP (src
, 0, i
), 1));
2021 enum machine_mode mode
= GET_MODE (tmps
[i
]);
2022 unsigned int bytelen
= GET_MODE_SIZE (mode
);
2025 /* Handle trailing fragments that run over the size of the struct. */
2026 if (ssize
>= 0 && bytepos
+ (HOST_WIDE_INT
) bytelen
> ssize
)
2028 /* store_bit_field always takes its value from the lsb.
2029 Move the fragment to the lsb if it's not already there. */
2031 #ifdef BLOCK_REG_PADDING
2032 BLOCK_REG_PADDING (GET_MODE (orig_dst
), type
, i
== start
)
2033 == (BYTES_BIG_ENDIAN
? upward
: downward
)
2039 int shift
= (bytelen
- (ssize
- bytepos
)) * BITS_PER_UNIT
;
2040 tmps
[i
] = expand_shift (RSHIFT_EXPR
, mode
, tmps
[i
],
2041 build_int_cst (NULL_TREE
, shift
),
2044 bytelen
= ssize
- bytepos
;
2047 if (GET_CODE (dst
) == CONCAT
)
2049 if (bytepos
+ bytelen
<= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0))))
2050 dest
= XEXP (dst
, 0);
2051 else if (bytepos
>= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0))))
2053 bytepos
-= GET_MODE_SIZE (GET_MODE (XEXP (dst
, 0)));
2054 dest
= XEXP (dst
, 1);
2058 gcc_assert (bytepos
== 0 && XVECLEN (src
, 0));
2059 dest
= assign_stack_temp (GET_MODE (dest
),
2060 GET_MODE_SIZE (GET_MODE (dest
)), 0);
2061 emit_move_insn (adjust_address (dest
, GET_MODE (tmps
[i
]), bytepos
),
2068 /* Optimize the access just a bit. */
2070 && (! SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (dest
))
2071 || MEM_ALIGN (dest
) >= GET_MODE_ALIGNMENT (mode
))
2072 && bytepos
* BITS_PER_UNIT
% GET_MODE_ALIGNMENT (mode
) == 0
2073 && bytelen
== GET_MODE_SIZE (mode
))
2074 emit_move_insn (adjust_address (dest
, mode
, bytepos
), tmps
[i
]);
2076 store_bit_field (dest
, bytelen
* BITS_PER_UNIT
, bytepos
* BITS_PER_UNIT
,
2080 /* Copy from the pseudo into the (probable) hard reg. */
2081 if (orig_dst
!= dst
)
2082 emit_move_insn (orig_dst
, dst
);
2085 /* Generate code to copy a BLKmode object of TYPE out of a
2086 set of registers starting with SRCREG into TGTBLK. If TGTBLK
2087 is null, a stack temporary is created. TGTBLK is returned.
2089 The purpose of this routine is to handle functions that return
2090 BLKmode structures in registers. Some machines (the PA for example)
2091 want to return all small structures in registers regardless of the
2092 structure's alignment. */
2095 copy_blkmode_from_reg (rtx tgtblk
, rtx srcreg
, tree type
)
2097 unsigned HOST_WIDE_INT bytes
= int_size_in_bytes (type
);
2098 rtx src
= NULL
, dst
= NULL
;
2099 unsigned HOST_WIDE_INT bitsize
= MIN (TYPE_ALIGN (type
), BITS_PER_WORD
);
2100 unsigned HOST_WIDE_INT bitpos
, xbitpos
, padding_correction
= 0;
2104 tgtblk
= assign_temp (build_qualified_type (type
,
2106 | TYPE_QUAL_CONST
)),
2108 preserve_temp_slots (tgtblk
);
2111 /* This code assumes srcreg is at least a full word. If it isn't, copy it
2112 into a new pseudo which is a full word. */
2114 if (GET_MODE (srcreg
) != BLKmode
2115 && GET_MODE_SIZE (GET_MODE (srcreg
)) < UNITS_PER_WORD
)
2116 srcreg
= convert_to_mode (word_mode
, srcreg
, TYPE_UNSIGNED (type
));
2118 /* If the structure doesn't take up a whole number of words, see whether
2119 SRCREG is padded on the left or on the right. If it's on the left,
2120 set PADDING_CORRECTION to the number of bits to skip.
2122 In most ABIs, the structure will be returned at the least end of
2123 the register, which translates to right padding on little-endian
2124 targets and left padding on big-endian targets. The opposite
2125 holds if the structure is returned at the most significant
2126 end of the register. */
2127 if (bytes
% UNITS_PER_WORD
!= 0
2128 && (targetm
.calls
.return_in_msb (type
)
2130 : BYTES_BIG_ENDIAN
))
2132 = (BITS_PER_WORD
- ((bytes
% UNITS_PER_WORD
) * BITS_PER_UNIT
));
2134 /* Copy the structure BITSIZE bites at a time.
2136 We could probably emit more efficient code for machines which do not use
2137 strict alignment, but it doesn't seem worth the effort at the current
2139 for (bitpos
= 0, xbitpos
= padding_correction
;
2140 bitpos
< bytes
* BITS_PER_UNIT
;
2141 bitpos
+= bitsize
, xbitpos
+= bitsize
)
2143 /* We need a new source operand each time xbitpos is on a
2144 word boundary and when xbitpos == padding_correction
2145 (the first time through). */
2146 if (xbitpos
% BITS_PER_WORD
== 0
2147 || xbitpos
== padding_correction
)
2148 src
= operand_subword_force (srcreg
, xbitpos
/ BITS_PER_WORD
,
2151 /* We need a new destination operand each time bitpos is on
2153 if (bitpos
% BITS_PER_WORD
== 0)
2154 dst
= operand_subword (tgtblk
, bitpos
/ BITS_PER_WORD
, 1, BLKmode
);
2156 /* Use xbitpos for the source extraction (right justified) and
2157 xbitpos for the destination store (left justified). */
2158 store_bit_field (dst
, bitsize
, bitpos
% BITS_PER_WORD
, word_mode
,
2159 extract_bit_field (src
, bitsize
,
2160 xbitpos
% BITS_PER_WORD
, 1,
2161 NULL_RTX
, word_mode
, word_mode
));
2167 /* Add a USE expression for REG to the (possibly empty) list pointed
2168 to by CALL_FUSAGE. REG must denote a hard register. */
2171 use_reg (rtx
*call_fusage
, rtx reg
)
2173 gcc_assert (REG_P (reg
) && REGNO (reg
) < FIRST_PSEUDO_REGISTER
);
2176 = gen_rtx_EXPR_LIST (VOIDmode
,
2177 gen_rtx_USE (VOIDmode
, reg
), *call_fusage
);
2180 /* Add USE expressions to *CALL_FUSAGE for each of NREGS consecutive regs,
2181 starting at REGNO. All of these registers must be hard registers. */
2184 use_regs (rtx
*call_fusage
, int regno
, int nregs
)
2188 gcc_assert (regno
+ nregs
<= FIRST_PSEUDO_REGISTER
);
2190 for (i
= 0; i
< nregs
; i
++)
2191 use_reg (call_fusage
, regno_reg_rtx
[regno
+ i
]);
2194 /* Add USE expressions to *CALL_FUSAGE for each REG contained in the
2195 PARALLEL REGS. This is for calls that pass values in multiple
2196 non-contiguous locations. The Irix 6 ABI has examples of this. */
2199 use_group_regs (rtx
*call_fusage
, rtx regs
)
2203 for (i
= 0; i
< XVECLEN (regs
, 0); i
++)
2205 rtx reg
= XEXP (XVECEXP (regs
, 0, i
), 0);
2207 /* A NULL entry means the parameter goes both on the stack and in
2208 registers. This can also be a MEM for targets that pass values
2209 partially on the stack and partially in registers. */
2210 if (reg
!= 0 && REG_P (reg
))
2211 use_reg (call_fusage
, reg
);
2216 /* Determine whether the LEN bytes generated by CONSTFUN can be
2217 stored to memory using several move instructions. CONSTFUNDATA is
2218 a pointer which will be passed as argument in every CONSTFUN call.
2219 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2220 a memset operation and false if it's a copy of a constant string.
2221 Return nonzero if a call to store_by_pieces should succeed. */
2224 can_store_by_pieces (unsigned HOST_WIDE_INT len
,
2225 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
),
2226 void *constfundata
, unsigned int align
, bool memsetp
)
2228 unsigned HOST_WIDE_INT l
;
2229 unsigned int max_size
;
2230 HOST_WIDE_INT offset
= 0;
2231 enum machine_mode mode
, tmode
;
2232 enum insn_code icode
;
2240 ? SET_BY_PIECES_P (len
, align
)
2241 : STORE_BY_PIECES_P (len
, align
)))
2244 tmode
= mode_for_size (STORE_MAX_PIECES
* BITS_PER_UNIT
, MODE_INT
, 1);
2245 if (align
>= GET_MODE_ALIGNMENT (tmode
))
2246 align
= GET_MODE_ALIGNMENT (tmode
);
2249 enum machine_mode xmode
;
2251 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
), xmode
= tmode
;
2253 xmode
= tmode
, tmode
= GET_MODE_WIDER_MODE (tmode
))
2254 if (GET_MODE_SIZE (tmode
) > STORE_MAX_PIECES
2255 || SLOW_UNALIGNED_ACCESS (tmode
, align
))
2258 align
= MAX (align
, GET_MODE_ALIGNMENT (xmode
));
2261 /* We would first store what we can in the largest integer mode, then go to
2262 successively smaller modes. */
2265 reverse
<= (HAVE_PRE_DECREMENT
|| HAVE_POST_DECREMENT
);
2270 max_size
= STORE_MAX_PIECES
+ 1;
2271 while (max_size
> 1)
2273 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2274 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
2275 if (GET_MODE_SIZE (tmode
) < max_size
)
2278 if (mode
== VOIDmode
)
2281 icode
= optab_handler (mov_optab
, mode
)->insn_code
;
2282 if (icode
!= CODE_FOR_nothing
2283 && align
>= GET_MODE_ALIGNMENT (mode
))
2285 unsigned int size
= GET_MODE_SIZE (mode
);
2292 cst
= (*constfun
) (constfundata
, offset
, mode
);
2293 if (!LEGITIMATE_CONSTANT_P (cst
))
2303 max_size
= GET_MODE_SIZE (mode
);
2306 /* The code above should have handled everything. */
2313 /* Generate several move instructions to store LEN bytes generated by
2314 CONSTFUN to block TO. (A MEM rtx with BLKmode). CONSTFUNDATA is a
2315 pointer which will be passed as argument in every CONSTFUN call.
2316 ALIGN is maximum alignment we can assume. MEMSETP is true if this is
2317 a memset operation and false if it's a copy of a constant string.
2318 If ENDP is 0 return to, if ENDP is 1 return memory at the end ala
2319 mempcpy, and if ENDP is 2 return memory the end minus one byte ala
2323 store_by_pieces (rtx to
, unsigned HOST_WIDE_INT len
,
2324 rtx (*constfun
) (void *, HOST_WIDE_INT
, enum machine_mode
),
2325 void *constfundata
, unsigned int align
, bool memsetp
, int endp
)
2327 struct store_by_pieces data
;
2331 gcc_assert (endp
!= 2);
2336 ? SET_BY_PIECES_P (len
, align
)
2337 : STORE_BY_PIECES_P (len
, align
));
2338 data
.constfun
= constfun
;
2339 data
.constfundata
= constfundata
;
2342 store_by_pieces_1 (&data
, align
);
2347 gcc_assert (!data
.reverse
);
2352 if (HAVE_POST_INCREMENT
&& data
.explicit_inc_to
> 0)
2353 emit_insn (gen_add2_insn (data
.to_addr
, constm1_rtx
));
2355 data
.to_addr
= copy_addr_to_reg (plus_constant (data
.to_addr
,
2358 to1
= adjust_automodify_address (data
.to
, QImode
, data
.to_addr
,
2365 to1
= adjust_address (data
.to
, QImode
, data
.offset
);
2373 /* Generate several move instructions to clear LEN bytes of block TO. (A MEM
2374 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2377 clear_by_pieces (rtx to
, unsigned HOST_WIDE_INT len
, unsigned int align
)
2379 struct store_by_pieces data
;
2384 data
.constfun
= clear_by_pieces_1
;
2385 data
.constfundata
= NULL
;
2388 store_by_pieces_1 (&data
, align
);
2391 /* Callback routine for clear_by_pieces.
2392 Return const0_rtx unconditionally. */
2395 clear_by_pieces_1 (void *data ATTRIBUTE_UNUSED
,
2396 HOST_WIDE_INT offset ATTRIBUTE_UNUSED
,
2397 enum machine_mode mode ATTRIBUTE_UNUSED
)
2402 /* Subroutine of clear_by_pieces and store_by_pieces.
2403 Generate several move instructions to store LEN bytes of block TO. (A MEM
2404 rtx with BLKmode). ALIGN is maximum alignment we can assume. */
2407 store_by_pieces_1 (struct store_by_pieces
*data ATTRIBUTE_UNUSED
,
2408 unsigned int align ATTRIBUTE_UNUSED
)
2410 rtx to_addr
= XEXP (data
->to
, 0);
2411 unsigned int max_size
= STORE_MAX_PIECES
+ 1;
2412 enum machine_mode mode
= VOIDmode
, tmode
;
2413 enum insn_code icode
;
2416 data
->to_addr
= to_addr
;
2418 = (GET_CODE (to_addr
) == PRE_INC
|| GET_CODE (to_addr
) == PRE_DEC
2419 || GET_CODE (to_addr
) == POST_INC
|| GET_CODE (to_addr
) == POST_DEC
);
2421 data
->explicit_inc_to
= 0;
2423 = (GET_CODE (to_addr
) == PRE_DEC
|| GET_CODE (to_addr
) == POST_DEC
);
2425 data
->offset
= data
->len
;
2427 /* If storing requires more than two move insns,
2428 copy addresses to registers (to make displacements shorter)
2429 and use post-increment if available. */
2430 if (!data
->autinc_to
2431 && move_by_pieces_ninsns (data
->len
, align
, max_size
) > 2)
2433 /* Determine the main mode we'll be using. */
2434 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2435 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
2436 if (GET_MODE_SIZE (tmode
) < max_size
)
2439 if (USE_STORE_PRE_DECREMENT (mode
) && data
->reverse
&& ! data
->autinc_to
)
2441 data
->to_addr
= copy_addr_to_reg (plus_constant (to_addr
, data
->len
));
2442 data
->autinc_to
= 1;
2443 data
->explicit_inc_to
= -1;
2446 if (USE_STORE_POST_INCREMENT (mode
) && ! data
->reverse
2447 && ! data
->autinc_to
)
2449 data
->to_addr
= copy_addr_to_reg (to_addr
);
2450 data
->autinc_to
= 1;
2451 data
->explicit_inc_to
= 1;
2454 if ( !data
->autinc_to
&& CONSTANT_P (to_addr
))
2455 data
->to_addr
= copy_addr_to_reg (to_addr
);
2458 tmode
= mode_for_size (STORE_MAX_PIECES
* BITS_PER_UNIT
, MODE_INT
, 1);
2459 if (align
>= GET_MODE_ALIGNMENT (tmode
))
2460 align
= GET_MODE_ALIGNMENT (tmode
);
2463 enum machine_mode xmode
;
2465 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
), xmode
= tmode
;
2467 xmode
= tmode
, tmode
= GET_MODE_WIDER_MODE (tmode
))
2468 if (GET_MODE_SIZE (tmode
) > STORE_MAX_PIECES
2469 || SLOW_UNALIGNED_ACCESS (tmode
, align
))
2472 align
= MAX (align
, GET_MODE_ALIGNMENT (xmode
));
2475 /* First store what we can in the largest integer mode, then go to
2476 successively smaller modes. */
2478 while (max_size
> 1)
2480 for (tmode
= GET_CLASS_NARROWEST_MODE (MODE_INT
);
2481 tmode
!= VOIDmode
; tmode
= GET_MODE_WIDER_MODE (tmode
))
2482 if (GET_MODE_SIZE (tmode
) < max_size
)
2485 if (mode
== VOIDmode
)
2488 icode
= optab_handler (mov_optab
, mode
)->insn_code
;
2489 if (icode
!= CODE_FOR_nothing
&& align
>= GET_MODE_ALIGNMENT (mode
))
2490 store_by_pieces_2 (GEN_FCN (icode
), mode
, data
);
2492 max_size
= GET_MODE_SIZE (mode
);
2495 /* The code above should have handled everything. */
2496 gcc_assert (!data
->len
);
2499 /* Subroutine of store_by_pieces_1. Store as many bytes as appropriate
2500 with move instructions for mode MODE. GENFUN is the gen_... function
2501 to make a move insn for that mode. DATA has all the other info. */
2504 store_by_pieces_2 (rtx (*genfun
) (rtx
, ...), enum machine_mode mode
,
2505 struct store_by_pieces
*data
)
2507 unsigned int size
= GET_MODE_SIZE (mode
);
2510 while (data
->len
>= size
)
2513 data
->offset
-= size
;
2515 if (data
->autinc_to
)
2516 to1
= adjust_automodify_address (data
->to
, mode
, data
->to_addr
,
2519 to1
= adjust_address (data
->to
, mode
, data
->offset
);
2521 if (HAVE_PRE_DECREMENT
&& data
->explicit_inc_to
< 0)
2522 emit_insn (gen_add2_insn (data
->to_addr
,
2523 GEN_INT (-(HOST_WIDE_INT
) size
)));
2525 cst
= (*data
->constfun
) (data
->constfundata
, data
->offset
, mode
);
2526 emit_insn ((*genfun
) (to1
, cst
));
2528 if (HAVE_POST_INCREMENT
&& data
->explicit_inc_to
> 0)
2529 emit_insn (gen_add2_insn (data
->to_addr
, GEN_INT (size
)));
2531 if (! data
->reverse
)
2532 data
->offset
+= size
;
2538 /* Write zeros through the storage of OBJECT. If OBJECT has BLKmode, SIZE is
2539 its length in bytes. */
2542 clear_storage_hints (rtx object
, rtx size
, enum block_op_methods method
,
2543 unsigned int expected_align
, HOST_WIDE_INT expected_size
)
2545 enum machine_mode mode
= GET_MODE (object
);
2548 gcc_assert (method
== BLOCK_OP_NORMAL
|| method
== BLOCK_OP_TAILCALL
);
2550 /* If OBJECT is not BLKmode and SIZE is the same size as its mode,
2551 just move a zero. Otherwise, do this a piece at a time. */
2553 && GET_CODE (size
) == CONST_INT
2554 && INTVAL (size
) == (HOST_WIDE_INT
) GET_MODE_SIZE (mode
))
2556 rtx zero
= CONST0_RTX (mode
);
2559 emit_move_insn (object
, zero
);
2563 if (COMPLEX_MODE_P (mode
))
2565 zero
= CONST0_RTX (GET_MODE_INNER (mode
));
2568 write_complex_part (object
, zero
, 0);
2569 write_complex_part (object
, zero
, 1);
2575 if (size
== const0_rtx
)
2578 align
= MEM_ALIGN (object
);
2580 if (GET_CODE (size
) == CONST_INT
2581 && CLEAR_BY_PIECES_P (INTVAL (size
), align
))
2582 clear_by_pieces (object
, INTVAL (size
), align
);
2583 else if (set_storage_via_setmem (object
, size
, const0_rtx
, align
,
2584 expected_align
, expected_size
))
2587 return set_storage_via_libcall (object
, size
, const0_rtx
,
2588 method
== BLOCK_OP_TAILCALL
);
2594 clear_storage (rtx object
, rtx size
, enum block_op_methods method
)
2596 return clear_storage_hints (object
, size
, method
, 0, -1);
2600 /* A subroutine of clear_storage. Expand a call to memset.
2601 Return the return value of memset, 0 otherwise. */
2604 set_storage_via_libcall (rtx object
, rtx size
, rtx val
, bool tailcall
)
2606 tree call_expr
, fn
, object_tree
, size_tree
, val_tree
;
2607 enum machine_mode size_mode
;
2610 /* Emit code to copy OBJECT and SIZE into new pseudos. We can then
2611 place those into new pseudos into a VAR_DECL and use them later. */
2613 object
= copy_to_mode_reg (Pmode
, XEXP (object
, 0));
2615 size_mode
= TYPE_MODE (sizetype
);
2616 size
= convert_to_mode (size_mode
, size
, 1);
2617 size
= copy_to_mode_reg (size_mode
, size
);
2619 /* It is incorrect to use the libcall calling conventions to call
2620 memset in this context. This could be a user call to memset and
2621 the user may wish to examine the return value from memset. For
2622 targets where libcalls and normal calls have different conventions
2623 for returning pointers, we could end up generating incorrect code. */
2625 object_tree
= make_tree (ptr_type_node
, object
);
2626 if (GET_CODE (val
) != CONST_INT
)
2627 val
= convert_to_mode (TYPE_MODE (integer_type_node
), val
, 1);
2628 size_tree
= make_tree (sizetype
, size
);
2629 val_tree
= make_tree (integer_type_node
, val
);
2631 fn
= clear_storage_libcall_fn (true);
2632 call_expr
= build_call_expr (fn
, 3,
2633 object_tree
, integer_zero_node
, size_tree
);
2634 CALL_EXPR_TAILCALL (call_expr
) = tailcall
;
2636 retval
= expand_normal (call_expr
);
2641 /* A subroutine of set_storage_via_libcall. Create the tree node
2642 for the function we use for block clears. The first time FOR_CALL
2643 is true, we call assemble_external. */
2645 static GTY(()) tree block_clear_fn
;
2648 init_block_clear_fn (const char *asmspec
)
2650 if (!block_clear_fn
)
2654 fn
= get_identifier ("memset");
2655 args
= build_function_type_list (ptr_type_node
, ptr_type_node
,
2656 integer_type_node
, sizetype
,
2659 fn
= build_decl (FUNCTION_DECL
, fn
, args
);
2660 DECL_EXTERNAL (fn
) = 1;
2661 TREE_PUBLIC (fn
) = 1;
2662 DECL_ARTIFICIAL (fn
) = 1;
2663 TREE_NOTHROW (fn
) = 1;
2664 DECL_VISIBILITY (fn
) = VISIBILITY_DEFAULT
;
2665 DECL_VISIBILITY_SPECIFIED (fn
) = 1;
2667 block_clear_fn
= fn
;
2671 set_user_assembler_name (block_clear_fn
, asmspec
);
2675 clear_storage_libcall_fn (int for_call
)
2677 static bool emitted_extern
;
2679 if (!block_clear_fn
)
2680 init_block_clear_fn (NULL
);
2682 if (for_call
&& !emitted_extern
)
2684 emitted_extern
= true;
2685 make_decl_rtl (block_clear_fn
);
2686 assemble_external (block_clear_fn
);
2689 return block_clear_fn
;
2692 /* Expand a setmem pattern; return true if successful. */
2695 set_storage_via_setmem (rtx object
, rtx size
, rtx val
, unsigned int align
,
2696 unsigned int expected_align
, HOST_WIDE_INT expected_size
)
2698 /* Try the most limited insn first, because there's no point
2699 including more than one in the machine description unless
2700 the more limited one has some advantage. */
2702 rtx opalign
= GEN_INT (align
/ BITS_PER_UNIT
);
2703 enum machine_mode mode
;
2705 if (expected_align
< align
)
2706 expected_align
= align
;
2708 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_INT
); mode
!= VOIDmode
;
2709 mode
= GET_MODE_WIDER_MODE (mode
))
2711 enum insn_code code
= setmem_optab
[(int) mode
];
2712 insn_operand_predicate_fn pred
;
2714 if (code
!= CODE_FOR_nothing
2715 /* We don't need MODE to be narrower than
2716 BITS_PER_HOST_WIDE_INT here because if SIZE is less than
2717 the mode mask, as it is returned by the macro, it will
2718 definitely be less than the actual mode mask. */
2719 && ((GET_CODE (size
) == CONST_INT
2720 && ((unsigned HOST_WIDE_INT
) INTVAL (size
)
2721 <= (GET_MODE_MASK (mode
) >> 1)))
2722 || GET_MODE_BITSIZE (mode
) >= BITS_PER_WORD
)
2723 && ((pred
= insn_data
[(int) code
].operand
[0].predicate
) == 0
2724 || (*pred
) (object
, BLKmode
))
2725 && ((pred
= insn_data
[(int) code
].operand
[3].predicate
) == 0
2726 || (*pred
) (opalign
, VOIDmode
)))
2729 enum machine_mode char_mode
;
2730 rtx last
= get_last_insn ();
2733 opsize
= convert_to_mode (mode
, size
, 1);
2734 pred
= insn_data
[(int) code
].operand
[1].predicate
;
2735 if (pred
!= 0 && ! (*pred
) (opsize
, mode
))
2736 opsize
= copy_to_mode_reg (mode
, opsize
);
2739 char_mode
= insn_data
[(int) code
].operand
[2].mode
;
2740 if (char_mode
!= VOIDmode
)
2742 opchar
= convert_to_mode (char_mode
, opchar
, 1);
2743 pred
= insn_data
[(int) code
].operand
[2].predicate
;
2744 if (pred
!= 0 && ! (*pred
) (opchar
, char_mode
))
2745 opchar
= copy_to_mode_reg (char_mode
, opchar
);
2748 if (insn_data
[(int) code
].n_operands
== 4)
2749 pat
= GEN_FCN ((int) code
) (object
, opsize
, opchar
, opalign
);
2751 pat
= GEN_FCN ((int) code
) (object
, opsize
, opchar
, opalign
,
2752 GEN_INT (expected_align
),
2753 GEN_INT (expected_size
));
2760 delete_insns_since (last
);
2768 /* Write to one of the components of the complex value CPLX. Write VAL to
2769 the real part if IMAG_P is false, and the imaginary part if its true. */
2772 write_complex_part (rtx cplx
, rtx val
, bool imag_p
)
2774 enum machine_mode cmode
;
2775 enum machine_mode imode
;
2778 if (GET_CODE (cplx
) == CONCAT
)
2780 emit_move_insn (XEXP (cplx
, imag_p
), val
);
2784 cmode
= GET_MODE (cplx
);
2785 imode
= GET_MODE_INNER (cmode
);
2786 ibitsize
= GET_MODE_BITSIZE (imode
);
2788 /* For MEMs simplify_gen_subreg may generate an invalid new address
2789 because, e.g., the original address is considered mode-dependent
2790 by the target, which restricts simplify_subreg from invoking
2791 adjust_address_nv. Instead of preparing fallback support for an
2792 invalid address, we call adjust_address_nv directly. */
2795 emit_move_insn (adjust_address_nv (cplx
, imode
,
2796 imag_p
? GET_MODE_SIZE (imode
) : 0),
2801 /* If the sub-object is at least word sized, then we know that subregging
2802 will work. This special case is important, since store_bit_field
2803 wants to operate on integer modes, and there's rarely an OImode to
2804 correspond to TCmode. */
2805 if (ibitsize
>= BITS_PER_WORD
2806 /* For hard regs we have exact predicates. Assume we can split
2807 the original object if it spans an even number of hard regs.
2808 This special case is important for SCmode on 64-bit platforms
2809 where the natural size of floating-point regs is 32-bit. */
2811 && REGNO (cplx
) < FIRST_PSEUDO_REGISTER
2812 && hard_regno_nregs
[REGNO (cplx
)][cmode
] % 2 == 0))
2814 rtx part
= simplify_gen_subreg (imode
, cplx
, cmode
,
2815 imag_p
? GET_MODE_SIZE (imode
) : 0);
2818 emit_move_insn (part
, val
);
2822 /* simplify_gen_subreg may fail for sub-word MEMs. */
2823 gcc_assert (MEM_P (cplx
) && ibitsize
< BITS_PER_WORD
);
2826 store_bit_field (cplx
, ibitsize
, imag_p
? ibitsize
: 0, imode
, val
);
2829 /* Extract one of the components of the complex value CPLX. Extract the
2830 real part if IMAG_P is false, and the imaginary part if it's true. */
2833 read_complex_part (rtx cplx
, bool imag_p
)
2835 enum machine_mode cmode
, imode
;
2838 if (GET_CODE (cplx
) == CONCAT
)
2839 return XEXP (cplx
, imag_p
);
2841 cmode
= GET_MODE (cplx
);
2842 imode
= GET_MODE_INNER (cmode
);
2843 ibitsize
= GET_MODE_BITSIZE (imode
);
2845 /* Special case reads from complex constants that got spilled to memory. */
2846 if (MEM_P (cplx
) && GET_CODE (XEXP (cplx
, 0)) == SYMBOL_REF
)
2848 tree decl
= SYMBOL_REF_DECL (XEXP (cplx
, 0));
2849 if (decl
&& TREE_CODE (decl
) == COMPLEX_CST
)
2851 tree part
= imag_p
? TREE_IMAGPART (decl
) : TREE_REALPART (decl
);
2852 if (CONSTANT_CLASS_P (part
))
2853 return expand_expr (part
, NULL_RTX
, imode
, EXPAND_NORMAL
);
2857 /* For MEMs simplify_gen_subreg may generate an invalid new address
2858 because, e.g., the original address is considered mode-dependent
2859 by the target, which restricts simplify_subreg from invoking
2860 adjust_address_nv. Instead of preparing fallback support for an
2861 invalid address, we call adjust_address_nv directly. */
2863 return adjust_address_nv (cplx
, imode
,
2864 imag_p
? GET_MODE_SIZE (imode
) : 0);
2866 /* If the sub-object is at least word sized, then we know that subregging
2867 will work. This special case is important, since extract_bit_field
2868 wants to operate on integer modes, and there's rarely an OImode to
2869 correspond to TCmode. */
2870 if (ibitsize
>= BITS_PER_WORD
2871 /* For hard regs we have exact predicates. Assume we can split
2872 the original object if it spans an even number of hard regs.
2873 This special case is important for SCmode on 64-bit platforms
2874 where the natural size of floating-point regs is 32-bit. */
2876 && REGNO (cplx
) < FIRST_PSEUDO_REGISTER
2877 && hard_regno_nregs
[REGNO (cplx
)][cmode
] % 2 == 0))
2879 rtx ret
= simplify_gen_subreg (imode
, cplx
, cmode
,
2880 imag_p
? GET_MODE_SIZE (imode
) : 0);
2884 /* simplify_gen_subreg may fail for sub-word MEMs. */
2885 gcc_assert (MEM_P (cplx
) && ibitsize
< BITS_PER_WORD
);
2888 return extract_bit_field (cplx
, ibitsize
, imag_p
? ibitsize
: 0,
2889 true, NULL_RTX
, imode
, imode
);
2892 /* A subroutine of emit_move_insn_1. Yet another lowpart generator.
2893 NEW_MODE and OLD_MODE are the same size. Return NULL if X cannot be
2894 represented in NEW_MODE. If FORCE is true, this will never happen, as
2895 we'll force-create a SUBREG if needed. */
2898 emit_move_change_mode (enum machine_mode new_mode
,
2899 enum machine_mode old_mode
, rtx x
, bool force
)
2903 if (push_operand (x
, GET_MODE (x
)))
2905 ret
= gen_rtx_MEM (new_mode
, XEXP (x
, 0));
2906 MEM_COPY_ATTRIBUTES (ret
, x
);
2910 /* We don't have to worry about changing the address since the
2911 size in bytes is supposed to be the same. */
2912 if (reload_in_progress
)
2914 /* Copy the MEM to change the mode and move any
2915 substitutions from the old MEM to the new one. */
2916 ret
= adjust_address_nv (x
, new_mode
, 0);
2917 copy_replacements (x
, ret
);
2920 ret
= adjust_address (x
, new_mode
, 0);
2924 /* Note that we do want simplify_subreg's behavior of validating
2925 that the new mode is ok for a hard register. If we were to use
2926 simplify_gen_subreg, we would create the subreg, but would
2927 probably run into the target not being able to implement it. */
2928 /* Except, of course, when FORCE is true, when this is exactly what
2929 we want. Which is needed for CCmodes on some targets. */
2931 ret
= simplify_gen_subreg (new_mode
, x
, old_mode
, 0);
2933 ret
= simplify_subreg (new_mode
, x
, old_mode
, 0);
2939 /* A subroutine of emit_move_insn_1. Generate a move from Y into X using
2940 an integer mode of the same size as MODE. Returns the instruction
2941 emitted, or NULL if such a move could not be generated. */
2944 emit_move_via_integer (enum machine_mode mode
, rtx x
, rtx y
, bool force
)
2946 enum machine_mode imode
;
2947 enum insn_code code
;
2949 /* There must exist a mode of the exact size we require. */
2950 imode
= int_mode_for_mode (mode
);
2951 if (imode
== BLKmode
)
2954 /* The target must support moves in this mode. */
2955 code
= optab_handler (mov_optab
, imode
)->insn_code
;
2956 if (code
== CODE_FOR_nothing
)
2959 x
= emit_move_change_mode (imode
, mode
, x
, force
);
2962 y
= emit_move_change_mode (imode
, mode
, y
, force
);
2965 return emit_insn (GEN_FCN (code
) (x
, y
));
2968 /* A subroutine of emit_move_insn_1. X is a push_operand in MODE.
2969 Return an equivalent MEM that does not use an auto-increment. */
2972 emit_move_resolve_push (enum machine_mode mode
, rtx x
)
2974 enum rtx_code code
= GET_CODE (XEXP (x
, 0));
2975 HOST_WIDE_INT adjust
;
2978 adjust
= GET_MODE_SIZE (mode
);
2979 #ifdef PUSH_ROUNDING
2980 adjust
= PUSH_ROUNDING (adjust
);
2982 if (code
== PRE_DEC
|| code
== POST_DEC
)
2984 else if (code
== PRE_MODIFY
|| code
== POST_MODIFY
)
2986 rtx expr
= XEXP (XEXP (x
, 0), 1);
2989 gcc_assert (GET_CODE (expr
) == PLUS
|| GET_CODE (expr
) == MINUS
);
2990 gcc_assert (GET_CODE (XEXP (expr
, 1)) == CONST_INT
);
2991 val
= INTVAL (XEXP (expr
, 1));
2992 if (GET_CODE (expr
) == MINUS
)
2994 gcc_assert (adjust
== val
|| adjust
== -val
);
2998 /* Do not use anti_adjust_stack, since we don't want to update
2999 stack_pointer_delta. */
3000 temp
= expand_simple_binop (Pmode
, PLUS
, stack_pointer_rtx
,
3001 GEN_INT (adjust
), stack_pointer_rtx
,
3002 0, OPTAB_LIB_WIDEN
);
3003 if (temp
!= stack_pointer_rtx
)
3004 emit_move_insn (stack_pointer_rtx
, temp
);
3011 temp
= stack_pointer_rtx
;
3016 temp
= plus_constant (stack_pointer_rtx
, -adjust
);
3022 return replace_equiv_address (x
, temp
);
3025 /* A subroutine of emit_move_complex. Generate a move from Y into X.
3026 X is known to satisfy push_operand, and MODE is known to be complex.
3027 Returns the last instruction emitted. */
3030 emit_move_complex_push (enum machine_mode mode
, rtx x
, rtx y
)
3032 enum machine_mode submode
= GET_MODE_INNER (mode
);
3035 #ifdef PUSH_ROUNDING
3036 unsigned int submodesize
= GET_MODE_SIZE (submode
);
3038 /* In case we output to the stack, but the size is smaller than the
3039 machine can push exactly, we need to use move instructions. */
3040 if (PUSH_ROUNDING (submodesize
) != submodesize
)
3042 x
= emit_move_resolve_push (mode
, x
);
3043 return emit_move_insn (x
, y
);
3047 /* Note that the real part always precedes the imag part in memory
3048 regardless of machine's endianness. */
3049 switch (GET_CODE (XEXP (x
, 0)))
3063 emit_move_insn (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3064 read_complex_part (y
, imag_first
));
3065 return emit_move_insn (gen_rtx_MEM (submode
, XEXP (x
, 0)),
3066 read_complex_part (y
, !imag_first
));
3069 /* A subroutine of emit_move_complex. Perform the move from Y to X
3070 via two moves of the parts. Returns the last instruction emitted. */
3073 emit_move_complex_parts (rtx x
, rtx y
)
3075 /* Show the output dies here. This is necessary for SUBREGs
3076 of pseudos since we cannot track their lifetimes correctly;
3077 hard regs shouldn't appear here except as return values. */
3078 if (!reload_completed
&& !reload_in_progress
3079 && REG_P (x
) && !reg_overlap_mentioned_p (x
, y
))
3080 emit_insn (gen_rtx_CLOBBER (VOIDmode
, x
));
3082 write_complex_part (x
, read_complex_part (y
, false), false);
3083 write_complex_part (x
, read_complex_part (y
, true), true);
3085 return get_last_insn ();
3088 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3089 MODE is known to be complex. Returns the last instruction emitted. */
3092 emit_move_complex (enum machine_mode mode
, rtx x
, rtx y
)
3096 /* Need to take special care for pushes, to maintain proper ordering
3097 of the data, and possibly extra padding. */
3098 if (push_operand (x
, mode
))
3099 return emit_move_complex_push (mode
, x
, y
);
3101 /* See if we can coerce the target into moving both values at once. */
3103 /* Move floating point as parts. */
3104 if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
3105 && optab_handler (mov_optab
, GET_MODE_INNER (mode
))->insn_code
!= CODE_FOR_nothing
)
3107 /* Not possible if the values are inherently not adjacent. */
3108 else if (GET_CODE (x
) == CONCAT
|| GET_CODE (y
) == CONCAT
)
3110 /* Is possible if both are registers (or subregs of registers). */
3111 else if (register_operand (x
, mode
) && register_operand (y
, mode
))
3113 /* If one of the operands is a memory, and alignment constraints
3114 are friendly enough, we may be able to do combined memory operations.
3115 We do not attempt this if Y is a constant because that combination is
3116 usually better with the by-parts thing below. */
3117 else if ((MEM_P (x
) ? !CONSTANT_P (y
) : MEM_P (y
))
3118 && (!STRICT_ALIGNMENT
3119 || get_mode_alignment (mode
) == BIGGEST_ALIGNMENT
))
3128 /* For memory to memory moves, optimal behavior can be had with the
3129 existing block move logic. */
3130 if (MEM_P (x
) && MEM_P (y
))
3132 emit_block_move (x
, y
, GEN_INT (GET_MODE_SIZE (mode
)),
3133 BLOCK_OP_NO_LIBCALL
);
3134 return get_last_insn ();
3137 ret
= emit_move_via_integer (mode
, x
, y
, true);
3142 return emit_move_complex_parts (x
, y
);
3145 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3146 MODE is known to be MODE_CC. Returns the last instruction emitted. */
3149 emit_move_ccmode (enum machine_mode mode
, rtx x
, rtx y
)
3153 /* Assume all MODE_CC modes are equivalent; if we have movcc, use it. */
3156 enum insn_code code
= optab_handler (mov_optab
, CCmode
)->insn_code
;
3157 if (code
!= CODE_FOR_nothing
)
3159 x
= emit_move_change_mode (CCmode
, mode
, x
, true);
3160 y
= emit_move_change_mode (CCmode
, mode
, y
, true);
3161 return emit_insn (GEN_FCN (code
) (x
, y
));
3165 /* Otherwise, find the MODE_INT mode of the same width. */
3166 ret
= emit_move_via_integer (mode
, x
, y
, false);
3167 gcc_assert (ret
!= NULL
);
3171 /* Return true if word I of OP lies entirely in the
3172 undefined bits of a paradoxical subreg. */
3175 undefined_operand_subword_p (const_rtx op
, int i
)
3177 enum machine_mode innermode
, innermostmode
;
3179 if (GET_CODE (op
) != SUBREG
)
3181 innermode
= GET_MODE (op
);
3182 innermostmode
= GET_MODE (SUBREG_REG (op
));
3183 offset
= i
* UNITS_PER_WORD
+ SUBREG_BYTE (op
);
3184 /* The SUBREG_BYTE represents offset, as if the value were stored in
3185 memory, except for a paradoxical subreg where we define
3186 SUBREG_BYTE to be 0; undo this exception as in
3188 if (SUBREG_BYTE (op
) == 0
3189 && GET_MODE_SIZE (innermostmode
) < GET_MODE_SIZE (innermode
))
3191 int difference
= (GET_MODE_SIZE (innermostmode
) - GET_MODE_SIZE (innermode
));
3192 if (WORDS_BIG_ENDIAN
)
3193 offset
+= (difference
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3194 if (BYTES_BIG_ENDIAN
)
3195 offset
+= difference
% UNITS_PER_WORD
;
3197 if (offset
>= GET_MODE_SIZE (innermostmode
)
3198 || offset
<= -GET_MODE_SIZE (word_mode
))
3203 /* A subroutine of emit_move_insn_1. Generate a move from Y into X.
3204 MODE is any multi-word or full-word mode that lacks a move_insn
3205 pattern. Note that you will get better code if you define such
3206 patterns, even if they must turn into multiple assembler instructions. */
3209 emit_move_multi_word (enum machine_mode mode
, rtx x
, rtx y
)
3216 gcc_assert (GET_MODE_SIZE (mode
) >= UNITS_PER_WORD
);
3218 /* If X is a push on the stack, do the push now and replace
3219 X with a reference to the stack pointer. */
3220 if (push_operand (x
, mode
))
3221 x
= emit_move_resolve_push (mode
, x
);
3223 /* If we are in reload, see if either operand is a MEM whose address
3224 is scheduled for replacement. */
3225 if (reload_in_progress
&& MEM_P (x
)
3226 && (inner
= find_replacement (&XEXP (x
, 0))) != XEXP (x
, 0))
3227 x
= replace_equiv_address_nv (x
, inner
);
3228 if (reload_in_progress
&& MEM_P (y
)
3229 && (inner
= find_replacement (&XEXP (y
, 0))) != XEXP (y
, 0))
3230 y
= replace_equiv_address_nv (y
, inner
);
3234 need_clobber
= false;
3236 i
< (GET_MODE_SIZE (mode
) + (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
3239 rtx xpart
= operand_subword (x
, i
, 1, mode
);
3242 /* Do not generate code for a move if it would come entirely
3243 from the undefined bits of a paradoxical subreg. */
3244 if (undefined_operand_subword_p (y
, i
))
3247 ypart
= operand_subword (y
, i
, 1, mode
);
3249 /* If we can't get a part of Y, put Y into memory if it is a
3250 constant. Otherwise, force it into a register. Then we must
3251 be able to get a part of Y. */
3252 if (ypart
== 0 && CONSTANT_P (y
))
3254 y
= use_anchored_address (force_const_mem (mode
, y
));
3255 ypart
= operand_subword (y
, i
, 1, mode
);
3257 else if (ypart
== 0)
3258 ypart
= operand_subword_force (y
, i
, mode
);
3260 gcc_assert (xpart
&& ypart
);
3262 need_clobber
|= (GET_CODE (xpart
) == SUBREG
);
3264 last_insn
= emit_move_insn (xpart
, ypart
);
3270 /* Show the output dies here. This is necessary for SUBREGs
3271 of pseudos since we cannot track their lifetimes correctly;
3272 hard regs shouldn't appear here except as return values.
3273 We never want to emit such a clobber after reload. */
3275 && ! (reload_in_progress
|| reload_completed
)
3276 && need_clobber
!= 0)
3277 emit_insn (gen_rtx_CLOBBER (VOIDmode
, x
));
3284 /* Low level part of emit_move_insn.
3285 Called just like emit_move_insn, but assumes X and Y
3286 are basically valid. */
3289 emit_move_insn_1 (rtx x
, rtx y
)
3291 enum machine_mode mode
= GET_MODE (x
);
3292 enum insn_code code
;
3294 gcc_assert ((unsigned int) mode
< (unsigned int) MAX_MACHINE_MODE
);
3296 code
= optab_handler (mov_optab
, mode
)->insn_code
;
3297 if (code
!= CODE_FOR_nothing
)
3298 return emit_insn (GEN_FCN (code
) (x
, y
));
3300 /* Expand complex moves by moving real part and imag part. */
3301 if (COMPLEX_MODE_P (mode
))
3302 return emit_move_complex (mode
, x
, y
);
3304 if (GET_MODE_CLASS (mode
) == MODE_DECIMAL_FLOAT
3305 || ALL_FIXED_POINT_MODE_P (mode
))
3307 rtx result
= emit_move_via_integer (mode
, x
, y
, true);
3309 /* If we can't find an integer mode, use multi words. */
3313 return emit_move_multi_word (mode
, x
, y
);
3316 if (GET_MODE_CLASS (mode
) == MODE_CC
)
3317 return emit_move_ccmode (mode
, x
, y
);
3319 /* Try using a move pattern for the corresponding integer mode. This is
3320 only safe when simplify_subreg can convert MODE constants into integer
3321 constants. At present, it can only do this reliably if the value
3322 fits within a HOST_WIDE_INT. */
3323 if (!CONSTANT_P (y
) || GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
)
3325 rtx ret
= emit_move_via_integer (mode
, x
, y
, false);
3330 return emit_move_multi_word (mode
, x
, y
);
3333 /* Generate code to copy Y into X.
3334 Both Y and X must have the same mode, except that
3335 Y can be a constant with VOIDmode.
3336 This mode cannot be BLKmode; use emit_block_move for that.
3338 Return the last instruction emitted. */
3341 emit_move_insn (rtx x
, rtx y
)
3343 enum machine_mode mode
= GET_MODE (x
);
3344 rtx y_cst
= NULL_RTX
;
3347 gcc_assert (mode
!= BLKmode
3348 && (GET_MODE (y
) == mode
|| GET_MODE (y
) == VOIDmode
));
3353 && SCALAR_FLOAT_MODE_P (GET_MODE (x
))
3354 && (last_insn
= compress_float_constant (x
, y
)))
3359 if (!LEGITIMATE_CONSTANT_P (y
))
3361 y
= force_const_mem (mode
, y
);
3363 /* If the target's cannot_force_const_mem prevented the spill,
3364 assume that the target's move expanders will also take care
3365 of the non-legitimate constant. */
3369 y
= use_anchored_address (y
);
3373 /* If X or Y are memory references, verify that their addresses are valid
3376 && ((! memory_address_p (GET_MODE (x
), XEXP (x
, 0))
3377 && ! push_operand (x
, GET_MODE (x
)))
3379 && CONSTANT_ADDRESS_P (XEXP (x
, 0)))))
3380 x
= validize_mem (x
);
3383 && (! memory_address_p (GET_MODE (y
), XEXP (y
, 0))
3385 && CONSTANT_ADDRESS_P (XEXP (y
, 0)))))
3386 y
= validize_mem (y
);
3388 gcc_assert (mode
!= BLKmode
);
3390 last_insn
= emit_move_insn_1 (x
, y
);
3392 if (y_cst
&& REG_P (x
)
3393 && (set
= single_set (last_insn
)) != NULL_RTX
3394 && SET_DEST (set
) == x
3395 && ! rtx_equal_p (y_cst
, SET_SRC (set
)))
3396 set_unique_reg_note (last_insn
, REG_EQUAL
, y_cst
);
3401 /* If Y is representable exactly in a narrower mode, and the target can
3402 perform the extension directly from constant or memory, then emit the
3403 move as an extension. */
3406 compress_float_constant (rtx x
, rtx y
)
3408 enum machine_mode dstmode
= GET_MODE (x
);
3409 enum machine_mode orig_srcmode
= GET_MODE (y
);
3410 enum machine_mode srcmode
;
3412 int oldcost
, newcost
;
3414 REAL_VALUE_FROM_CONST_DOUBLE (r
, y
);
3416 if (LEGITIMATE_CONSTANT_P (y
))
3417 oldcost
= rtx_cost (y
, SET
);
3419 oldcost
= rtx_cost (force_const_mem (dstmode
, y
), SET
);
3421 for (srcmode
= GET_CLASS_NARROWEST_MODE (GET_MODE_CLASS (orig_srcmode
));
3422 srcmode
!= orig_srcmode
;
3423 srcmode
= GET_MODE_WIDER_MODE (srcmode
))
3426 rtx trunc_y
, last_insn
;
3428 /* Skip if the target can't extend this way. */
3429 ic
= can_extend_p (dstmode
, srcmode
, 0);
3430 if (ic
== CODE_FOR_nothing
)
3433 /* Skip if the narrowed value isn't exact. */
3434 if (! exact_real_truncate (srcmode
, &r
))
3437 trunc_y
= CONST_DOUBLE_FROM_REAL_VALUE (r
, srcmode
);
3439 if (LEGITIMATE_CONSTANT_P (trunc_y
))
3441 /* Skip if the target needs extra instructions to perform
3443 if (! (*insn_data
[ic
].operand
[1].predicate
) (trunc_y
, srcmode
))
3445 /* This is valid, but may not be cheaper than the original. */
3446 newcost
= rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode
, trunc_y
), SET
);
3447 if (oldcost
< newcost
)
3450 else if (float_extend_from_mem
[dstmode
][srcmode
])
3452 trunc_y
= force_const_mem (srcmode
, trunc_y
);
3453 /* This is valid, but may not be cheaper than the original. */
3454 newcost
= rtx_cost (gen_rtx_FLOAT_EXTEND (dstmode
, trunc_y
), SET
);
3455 if (oldcost
< newcost
)
3457 trunc_y
= validize_mem (trunc_y
);
3462 /* For CSE's benefit, force the compressed constant pool entry
3463 into a new pseudo. This constant may be used in different modes,
3464 and if not, combine will put things back together for us. */
3465 trunc_y
= force_reg (srcmode
, trunc_y
);
3466 emit_unop_insn (ic
, x
, trunc_y
, UNKNOWN
);
3467 last_insn
= get_last_insn ();
3470 set_unique_reg_note (last_insn
, REG_EQUAL
, y
);
3478 /* Pushing data onto the stack. */
3480 /* Push a block of length SIZE (perhaps variable)
3481 and return an rtx to address the beginning of the block.
3482 The value may be virtual_outgoing_args_rtx.
3484 EXTRA is the number of bytes of padding to push in addition to SIZE.
3485 BELOW nonzero means this padding comes at low addresses;
3486 otherwise, the padding comes at high addresses. */
3489 push_block (rtx size
, int extra
, int below
)
3493 size
= convert_modes (Pmode
, ptr_mode
, size
, 1);
3494 if (CONSTANT_P (size
))
3495 anti_adjust_stack (plus_constant (size
, extra
));
3496 else if (REG_P (size
) && extra
== 0)
3497 anti_adjust_stack (size
);
3500 temp
= copy_to_mode_reg (Pmode
, size
);
3502 temp
= expand_binop (Pmode
, add_optab
, temp
, GEN_INT (extra
),
3503 temp
, 0, OPTAB_LIB_WIDEN
);
3504 anti_adjust_stack (temp
);
3507 #ifndef STACK_GROWS_DOWNWARD
3513 temp
= virtual_outgoing_args_rtx
;
3514 if (extra
!= 0 && below
)
3515 temp
= plus_constant (temp
, extra
);
3519 if (GET_CODE (size
) == CONST_INT
)
3520 temp
= plus_constant (virtual_outgoing_args_rtx
,
3521 -INTVAL (size
) - (below
? 0 : extra
));
3522 else if (extra
!= 0 && !below
)
3523 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
3524 negate_rtx (Pmode
, plus_constant (size
, extra
)));
3526 temp
= gen_rtx_PLUS (Pmode
, virtual_outgoing_args_rtx
,
3527 negate_rtx (Pmode
, size
));
3530 return memory_address (GET_CLASS_NARROWEST_MODE (MODE_INT
), temp
);
3533 #ifdef PUSH_ROUNDING
3535 /* Emit single push insn. */
3538 emit_single_push_insn (enum machine_mode mode
, rtx x
, tree type
)
3541 unsigned rounded_size
= PUSH_ROUNDING (GET_MODE_SIZE (mode
));
3543 enum insn_code icode
;
3544 insn_operand_predicate_fn pred
;
3546 stack_pointer_delta
+= PUSH_ROUNDING (GET_MODE_SIZE (mode
));
3547 /* If there is push pattern, use it. Otherwise try old way of throwing
3548 MEM representing push operation to move expander. */
3549 icode
= optab_handler (push_optab
, mode
)->insn_code
;
3550 if (icode
!= CODE_FOR_nothing
)
3552 if (((pred
= insn_data
[(int) icode
].operand
[0].predicate
)
3553 && !((*pred
) (x
, mode
))))
3554 x
= force_reg (mode
, x
);
3555 emit_insn (GEN_FCN (icode
) (x
));
3558 if (GET_MODE_SIZE (mode
) == rounded_size
)
3559 dest_addr
= gen_rtx_fmt_e (STACK_PUSH_CODE
, Pmode
, stack_pointer_rtx
);
3560 /* If we are to pad downward, adjust the stack pointer first and
3561 then store X into the stack location using an offset. This is
3562 because emit_move_insn does not know how to pad; it does not have
3564 else if (FUNCTION_ARG_PADDING (mode
, type
) == downward
)
3566 unsigned padding_size
= rounded_size
- GET_MODE_SIZE (mode
);
3567 HOST_WIDE_INT offset
;
3569 emit_move_insn (stack_pointer_rtx
,
3570 expand_binop (Pmode
,
3571 #ifdef STACK_GROWS_DOWNWARD
3577 GEN_INT (rounded_size
),
3578 NULL_RTX
, 0, OPTAB_LIB_WIDEN
));
3580 offset
= (HOST_WIDE_INT
) padding_size
;
3581 #ifdef STACK_GROWS_DOWNWARD
3582 if (STACK_PUSH_CODE
== POST_DEC
)
3583 /* We have already decremented the stack pointer, so get the
3585 offset
+= (HOST_WIDE_INT
) rounded_size
;
3587 if (STACK_PUSH_CODE
== POST_INC
)
3588 /* We have already incremented the stack pointer, so get the
3590 offset
-= (HOST_WIDE_INT
) rounded_size
;
3592 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
, GEN_INT (offset
));
3596 #ifdef STACK_GROWS_DOWNWARD
3597 /* ??? This seems wrong if STACK_PUSH_CODE == POST_DEC. */
3598 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
3599 GEN_INT (-(HOST_WIDE_INT
) rounded_size
));
3601 /* ??? This seems wrong if STACK_PUSH_CODE == POST_INC. */
3602 dest_addr
= gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
3603 GEN_INT (rounded_size
));
3605 dest_addr
= gen_rtx_PRE_MODIFY (Pmode
, stack_pointer_rtx
, dest_addr
);
3608 dest
= gen_rtx_MEM (mode
, dest_addr
);
3612 set_mem_attributes (dest
, type
, 1);
3614 if (flag_optimize_sibling_calls
)
3615 /* Function incoming arguments may overlap with sibling call
3616 outgoing arguments and we cannot allow reordering of reads
3617 from function arguments with stores to outgoing arguments
3618 of sibling calls. */
3619 set_mem_alias_set (dest
, 0);
3621 emit_move_insn (dest
, x
);
3625 /* Generate code to push X onto the stack, assuming it has mode MODE and
3627 MODE is redundant except when X is a CONST_INT (since they don't
3629 SIZE is an rtx for the size of data to be copied (in bytes),
3630 needed only if X is BLKmode.
3632 ALIGN (in bits) is maximum alignment we can assume.
3634 If PARTIAL and REG are both nonzero, then copy that many of the first
3635 bytes of X into registers starting with REG, and push the rest of X.
3636 The amount of space pushed is decreased by PARTIAL bytes.
3637 REG must be a hard register in this case.
3638 If REG is zero but PARTIAL is not, take any all others actions for an
3639 argument partially in registers, but do not actually load any
3642 EXTRA is the amount in bytes of extra space to leave next to this arg.
3643 This is ignored if an argument block has already been allocated.
3645 On a machine that lacks real push insns, ARGS_ADDR is the address of
3646 the bottom of the argument block for this call. We use indexing off there
3647 to store the arg. On machines with push insns, ARGS_ADDR is 0 when a
3648 argument block has not been preallocated.
3650 ARGS_SO_FAR is the size of args previously pushed for this call.
3652 REG_PARM_STACK_SPACE is nonzero if functions require stack space
3653 for arguments passed in registers. If nonzero, it will be the number
3654 of bytes required. */
3657 emit_push_insn (rtx x
, enum machine_mode mode
, tree type
, rtx size
,
3658 unsigned int align
, int partial
, rtx reg
, int extra
,
3659 rtx args_addr
, rtx args_so_far
, int reg_parm_stack_space
,
3663 enum direction stack_direction
3664 #ifdef STACK_GROWS_DOWNWARD
3670 /* Decide where to pad the argument: `downward' for below,
3671 `upward' for above, or `none' for don't pad it.
3672 Default is below for small data on big-endian machines; else above. */
3673 enum direction where_pad
= FUNCTION_ARG_PADDING (mode
, type
);
3675 /* Invert direction if stack is post-decrement.
3677 if (STACK_PUSH_CODE
== POST_DEC
)
3678 if (where_pad
!= none
)
3679 where_pad
= (where_pad
== downward
? upward
: downward
);
3684 || (STRICT_ALIGNMENT
&& align
< GET_MODE_ALIGNMENT (mode
)))
3686 /* Copy a block into the stack, entirely or partially. */
3693 offset
= partial
% (PARM_BOUNDARY
/ BITS_PER_UNIT
);
3694 used
= partial
- offset
;
3696 if (mode
!= BLKmode
)
3698 /* A value is to be stored in an insufficiently aligned
3699 stack slot; copy via a suitably aligned slot if
3701 size
= GEN_INT (GET_MODE_SIZE (mode
));
3702 if (!MEM_P (xinner
))
3704 temp
= assign_temp (type
, 0, 1, 1);
3705 emit_move_insn (temp
, xinner
);
3712 /* USED is now the # of bytes we need not copy to the stack
3713 because registers will take care of them. */
3716 xinner
= adjust_address (xinner
, BLKmode
, used
);
3718 /* If the partial register-part of the arg counts in its stack size,
3719 skip the part of stack space corresponding to the registers.
3720 Otherwise, start copying to the beginning of the stack space,
3721 by setting SKIP to 0. */
3722 skip
= (reg_parm_stack_space
== 0) ? 0 : used
;
3724 #ifdef PUSH_ROUNDING
3725 /* Do it with several push insns if that doesn't take lots of insns
3726 and if there is no difficulty with push insns that skip bytes
3727 on the stack for alignment purposes. */
3730 && GET_CODE (size
) == CONST_INT
3732 && MEM_ALIGN (xinner
) >= align
3733 && (MOVE_BY_PIECES_P ((unsigned) INTVAL (size
) - used
, align
))
3734 /* Here we avoid the case of a structure whose weak alignment
3735 forces many pushes of a small amount of data,
3736 and such small pushes do rounding that causes trouble. */
3737 && ((! SLOW_UNALIGNED_ACCESS (word_mode
, align
))
3738 || align
>= BIGGEST_ALIGNMENT
3739 || (PUSH_ROUNDING (align
/ BITS_PER_UNIT
)
3740 == (align
/ BITS_PER_UNIT
)))
3741 && PUSH_ROUNDING (INTVAL (size
)) == INTVAL (size
))
3743 /* Push padding now if padding above and stack grows down,
3744 or if padding below and stack grows up.
3745 But if space already allocated, this has already been done. */
3746 if (extra
&& args_addr
== 0
3747 && where_pad
!= none
&& where_pad
!= stack_direction
)
3748 anti_adjust_stack (GEN_INT (extra
));
3750 move_by_pieces (NULL
, xinner
, INTVAL (size
) - used
, align
, 0);
3753 #endif /* PUSH_ROUNDING */
3757 /* Otherwise make space on the stack and copy the data
3758 to the address of that space. */
3760 /* Deduct words put into registers from the size we must copy. */
3763 if (GET_CODE (size
) == CONST_INT
)
3764 size
= GEN_INT (INTVAL (size
) - used
);
3766 size
= expand_binop (GET_MODE (size
), sub_optab
, size
,
3767 GEN_INT (used
), NULL_RTX
, 0,
3771 /* Get the address of the stack space.
3772 In this case, we do not deal with EXTRA separately.
3773 A single stack adjust will do. */
3776 temp
= push_block (size
, extra
, where_pad
== downward
);
3779 else if (GET_CODE (args_so_far
) == CONST_INT
)
3780 temp
= memory_address (BLKmode
,
3781 plus_constant (args_addr
,
3782 skip
+ INTVAL (args_so_far
)));
3784 temp
= memory_address (BLKmode
,
3785 plus_constant (gen_rtx_PLUS (Pmode
,
3790 if (!ACCUMULATE_OUTGOING_ARGS
)
3792 /* If the source is referenced relative to the stack pointer,
3793 copy it to another register to stabilize it. We do not need
3794 to do this if we know that we won't be changing sp. */
3796 if (reg_mentioned_p (virtual_stack_dynamic_rtx
, temp
)
3797 || reg_mentioned_p (virtual_outgoing_args_rtx
, temp
))
3798 temp
= copy_to_reg (temp
);
3801 target
= gen_rtx_MEM (BLKmode
, temp
);
3803 /* We do *not* set_mem_attributes here, because incoming arguments
3804 may overlap with sibling call outgoing arguments and we cannot
3805 allow reordering of reads from function arguments with stores
3806 to outgoing arguments of sibling calls. We do, however, want
3807 to record the alignment of the stack slot. */
3808 /* ALIGN may well be better aligned than TYPE, e.g. due to
3809 PARM_BOUNDARY. Assume the caller isn't lying. */
3810 set_mem_align (target
, align
);
3812 emit_block_move (target
, xinner
, size
, BLOCK_OP_CALL_PARM
);
3815 else if (partial
> 0)
3817 /* Scalar partly in registers. */
3819 int size
= GET_MODE_SIZE (mode
) / UNITS_PER_WORD
;
3822 /* # bytes of start of argument
3823 that we must make space for but need not store. */
3824 int offset
= partial
% (PARM_BOUNDARY
/ BITS_PER_UNIT
);
3825 int args_offset
= INTVAL (args_so_far
);
3828 /* Push padding now if padding above and stack grows down,
3829 or if padding below and stack grows up.
3830 But if space already allocated, this has already been done. */
3831 if (extra
&& args_addr
== 0
3832 && where_pad
!= none
&& where_pad
!= stack_direction
)
3833 anti_adjust_stack (GEN_INT (extra
));
3835 /* If we make space by pushing it, we might as well push
3836 the real data. Otherwise, we can leave OFFSET nonzero
3837 and leave the space uninitialized. */
3841 /* Now NOT_STACK gets the number of words that we don't need to
3842 allocate on the stack. Convert OFFSET to words too. */
3843 not_stack
= (partial
- offset
) / UNITS_PER_WORD
;
3844 offset
/= UNITS_PER_WORD
;
3846 /* If the partial register-part of the arg counts in its stack size,
3847 skip the part of stack space corresponding to the registers.
3848 Otherwise, start copying to the beginning of the stack space,
3849 by setting SKIP to 0. */
3850 skip
= (reg_parm_stack_space
== 0) ? 0 : not_stack
;
3852 if (CONSTANT_P (x
) && ! LEGITIMATE_CONSTANT_P (x
))
3853 x
= validize_mem (force_const_mem (mode
, x
));
3855 /* If X is a hard register in a non-integer mode, copy it into a pseudo;
3856 SUBREGs of such registers are not allowed. */
3857 if ((REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
3858 && GET_MODE_CLASS (GET_MODE (x
)) != MODE_INT
))
3859 x
= copy_to_reg (x
);
3861 /* Loop over all the words allocated on the stack for this arg. */
3862 /* We can do it by words, because any scalar bigger than a word
3863 has a size a multiple of a word. */
3864 #ifndef PUSH_ARGS_REVERSED
3865 for (i
= not_stack
; i
< size
; i
++)
3867 for (i
= size
- 1; i
>= not_stack
; i
--)
3869 if (i
>= not_stack
+ offset
)
3870 emit_push_insn (operand_subword_force (x
, i
, mode
),
3871 word_mode
, NULL_TREE
, NULL_RTX
, align
, 0, NULL_RTX
,
3873 GEN_INT (args_offset
+ ((i
- not_stack
+ skip
)
3875 reg_parm_stack_space
, alignment_pad
);
3882 /* Push padding now if padding above and stack grows down,
3883 or if padding below and stack grows up.
3884 But if space already allocated, this has already been done. */
3885 if (extra
&& args_addr
== 0
3886 && where_pad
!= none
&& where_pad
!= stack_direction
)
3887 anti_adjust_stack (GEN_INT (extra
));
3889 #ifdef PUSH_ROUNDING
3890 if (args_addr
== 0 && PUSH_ARGS
)
3891 emit_single_push_insn (mode
, x
, type
);
3895 if (GET_CODE (args_so_far
) == CONST_INT
)
3897 = memory_address (mode
,
3898 plus_constant (args_addr
,
3899 INTVAL (args_so_far
)));
3901 addr
= memory_address (mode
, gen_rtx_PLUS (Pmode
, args_addr
,
3903 dest
= gen_rtx_MEM (mode
, addr
);
3905 /* We do *not* set_mem_attributes here, because incoming arguments
3906 may overlap with sibling call outgoing arguments and we cannot
3907 allow reordering of reads from function arguments with stores
3908 to outgoing arguments of sibling calls. We do, however, want
3909 to record the alignment of the stack slot. */
3910 /* ALIGN may well be better aligned than TYPE, e.g. due to
3911 PARM_BOUNDARY. Assume the caller isn't lying. */
3912 set_mem_align (dest
, align
);
3914 emit_move_insn (dest
, x
);
3918 /* If part should go in registers, copy that part
3919 into the appropriate registers. Do this now, at the end,
3920 since mem-to-mem copies above may do function calls. */
3921 if (partial
> 0 && reg
!= 0)
3923 /* Handle calls that pass values in multiple non-contiguous locations.
3924 The Irix 6 ABI has examples of this. */
3925 if (GET_CODE (reg
) == PARALLEL
)
3926 emit_group_load (reg
, x
, type
, -1);
3929 gcc_assert (partial
% UNITS_PER_WORD
== 0);
3930 move_block_to_reg (REGNO (reg
), x
, partial
/ UNITS_PER_WORD
, mode
);
3934 if (extra
&& args_addr
== 0 && where_pad
== stack_direction
)
3935 anti_adjust_stack (GEN_INT (extra
));
3937 if (alignment_pad
&& args_addr
== 0)
3938 anti_adjust_stack (alignment_pad
);
3941 /* Return X if X can be used as a subtarget in a sequence of arithmetic
3945 get_subtarget (rtx x
)
3949 /* Only registers can be subtargets. */
3951 /* Don't use hard regs to avoid extending their life. */
3952 || REGNO (x
) < FIRST_PSEUDO_REGISTER
3956 /* A subroutine of expand_assignment. Optimize FIELD op= VAL, where
3957 FIELD is a bitfield. Returns true if the optimization was successful,
3958 and there's nothing else to do. */
3961 optimize_bitfield_assignment_op (unsigned HOST_WIDE_INT bitsize
,
3962 unsigned HOST_WIDE_INT bitpos
,
3963 enum machine_mode mode1
, rtx str_rtx
,
3966 enum machine_mode str_mode
= GET_MODE (str_rtx
);
3967 unsigned int str_bitsize
= GET_MODE_BITSIZE (str_mode
);
3972 if (mode1
!= VOIDmode
3973 || bitsize
>= BITS_PER_WORD
3974 || str_bitsize
> BITS_PER_WORD
3975 || TREE_SIDE_EFFECTS (to
)
3976 || TREE_THIS_VOLATILE (to
))
3980 if (!BINARY_CLASS_P (src
)
3981 || TREE_CODE (TREE_TYPE (src
)) != INTEGER_TYPE
)
3984 op0
= TREE_OPERAND (src
, 0);
3985 op1
= TREE_OPERAND (src
, 1);
3988 if (!operand_equal_p (to
, op0
, 0))
3991 if (MEM_P (str_rtx
))
3993 unsigned HOST_WIDE_INT offset1
;
3995 if (str_bitsize
== 0 || str_bitsize
> BITS_PER_WORD
)
3996 str_mode
= word_mode
;
3997 str_mode
= get_best_mode (bitsize
, bitpos
,
3998 MEM_ALIGN (str_rtx
), str_mode
, 0);
3999 if (str_mode
== VOIDmode
)
4001 str_bitsize
= GET_MODE_BITSIZE (str_mode
);
4004 bitpos
%= str_bitsize
;
4005 offset1
= (offset1
- bitpos
) / BITS_PER_UNIT
;
4006 str_rtx
= adjust_address (str_rtx
, str_mode
, offset1
);
4008 else if (!REG_P (str_rtx
) && GET_CODE (str_rtx
) != SUBREG
)
4011 /* If the bit field covers the whole REG/MEM, store_field
4012 will likely generate better code. */
4013 if (bitsize
>= str_bitsize
)
4016 /* We can't handle fields split across multiple entities. */
4017 if (bitpos
+ bitsize
> str_bitsize
)
4020 if (BYTES_BIG_ENDIAN
)
4021 bitpos
= str_bitsize
- bitpos
- bitsize
;
4023 switch (TREE_CODE (src
))
4027 /* For now, just optimize the case of the topmost bitfield
4028 where we don't need to do any masking and also
4029 1 bit bitfields where xor can be used.
4030 We might win by one instruction for the other bitfields
4031 too if insv/extv instructions aren't used, so that
4032 can be added later. */
4033 if (bitpos
+ bitsize
!= str_bitsize
4034 && (bitsize
!= 1 || TREE_CODE (op1
) != INTEGER_CST
))
4037 value
= expand_expr (op1
, NULL_RTX
, str_mode
, EXPAND_NORMAL
);
4038 value
= convert_modes (str_mode
,
4039 TYPE_MODE (TREE_TYPE (op1
)), value
,
4040 TYPE_UNSIGNED (TREE_TYPE (op1
)));
4042 /* We may be accessing data outside the field, which means
4043 we can alias adjacent data. */
4044 if (MEM_P (str_rtx
))
4046 str_rtx
= shallow_copy_rtx (str_rtx
);
4047 set_mem_alias_set (str_rtx
, 0);
4048 set_mem_expr (str_rtx
, 0);
4051 binop
= TREE_CODE (src
) == PLUS_EXPR
? add_optab
: sub_optab
;
4052 if (bitsize
== 1 && bitpos
+ bitsize
!= str_bitsize
)
4054 value
= expand_and (str_mode
, value
, const1_rtx
, NULL
);
4057 value
= expand_shift (LSHIFT_EXPR
, str_mode
, value
,
4058 build_int_cst (NULL_TREE
, bitpos
),
4060 result
= expand_binop (str_mode
, binop
, str_rtx
,
4061 value
, str_rtx
, 1, OPTAB_WIDEN
);
4062 if (result
!= str_rtx
)
4063 emit_move_insn (str_rtx
, result
);
4068 if (TREE_CODE (op1
) != INTEGER_CST
)
4070 value
= expand_expr (op1
, NULL_RTX
, GET_MODE (str_rtx
), EXPAND_NORMAL
);
4071 value
= convert_modes (GET_MODE (str_rtx
),
4072 TYPE_MODE (TREE_TYPE (op1
)), value
,
4073 TYPE_UNSIGNED (TREE_TYPE (op1
)));
4075 /* We may be accessing data outside the field, which means
4076 we can alias adjacent data. */
4077 if (MEM_P (str_rtx
))
4079 str_rtx
= shallow_copy_rtx (str_rtx
);
4080 set_mem_alias_set (str_rtx
, 0);
4081 set_mem_expr (str_rtx
, 0);
4084 binop
= TREE_CODE (src
) == BIT_IOR_EXPR
? ior_optab
: xor_optab
;
4085 if (bitpos
+ bitsize
!= GET_MODE_BITSIZE (GET_MODE (str_rtx
)))
4087 rtx mask
= GEN_INT (((unsigned HOST_WIDE_INT
) 1 << bitsize
)
4089 value
= expand_and (GET_MODE (str_rtx
), value
, mask
,
4092 value
= expand_shift (LSHIFT_EXPR
, GET_MODE (str_rtx
), value
,
4093 build_int_cst (NULL_TREE
, bitpos
),
4095 result
= expand_binop (GET_MODE (str_rtx
), binop
, str_rtx
,
4096 value
, str_rtx
, 1, OPTAB_WIDEN
);
4097 if (result
!= str_rtx
)
4098 emit_move_insn (str_rtx
, result
);
4109 /* Expand an assignment that stores the value of FROM into TO. If NONTEMPORAL
4110 is true, try generating a nontemporal store. */
4113 expand_assignment (tree to
, tree from
, bool nontemporal
)
4118 /* Don't crash if the lhs of the assignment was erroneous. */
4119 if (TREE_CODE (to
) == ERROR_MARK
)
4121 result
= expand_normal (from
);
4125 /* Optimize away no-op moves without side-effects. */
4126 if (operand_equal_p (to
, from
, 0))
4129 /* Assignment of a structure component needs special treatment
4130 if the structure component's rtx is not simply a MEM.
4131 Assignment of an array element at a constant index, and assignment of
4132 an array element in an unaligned packed structure field, has the same
4134 if (handled_component_p (to
)
4135 || TREE_CODE (TREE_TYPE (to
)) == ARRAY_TYPE
)
4137 enum machine_mode mode1
;
4138 HOST_WIDE_INT bitsize
, bitpos
;
4145 tem
= get_inner_reference (to
, &bitsize
, &bitpos
, &offset
, &mode1
,
4146 &unsignedp
, &volatilep
, true);
4148 /* If we are going to use store_bit_field and extract_bit_field,
4149 make sure to_rtx will be safe for multiple use. */
4151 to_rtx
= expand_normal (tem
);
4157 if (!MEM_P (to_rtx
))
4159 /* We can get constant negative offsets into arrays with broken
4160 user code. Translate this to a trap instead of ICEing. */
4161 gcc_assert (TREE_CODE (offset
) == INTEGER_CST
);
4162 expand_builtin_trap ();
4163 to_rtx
= gen_rtx_MEM (BLKmode
, const0_rtx
);
4166 offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
4167 #ifdef POINTERS_EXTEND_UNSIGNED
4168 if (GET_MODE (offset_rtx
) != Pmode
)
4169 offset_rtx
= convert_to_mode (Pmode
, offset_rtx
, 0);
4171 if (GET_MODE (offset_rtx
) != ptr_mode
)
4172 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
4175 /* A constant address in TO_RTX can have VOIDmode, we must not try
4176 to call force_reg for that case. Avoid that case. */
4178 && GET_MODE (to_rtx
) == BLKmode
4179 && GET_MODE (XEXP (to_rtx
, 0)) != VOIDmode
4181 && (bitpos
% bitsize
) == 0
4182 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
4183 && MEM_ALIGN (to_rtx
) == GET_MODE_ALIGNMENT (mode1
))
4185 to_rtx
= adjust_address (to_rtx
, mode1
, bitpos
/ BITS_PER_UNIT
);
4189 to_rtx
= offset_address (to_rtx
, offset_rtx
,
4190 highest_pow2_factor_for_target (to
,
4194 /* Handle expand_expr of a complex value returning a CONCAT. */
4195 if (GET_CODE (to_rtx
) == CONCAT
)
4197 if (TREE_CODE (TREE_TYPE (from
)) == COMPLEX_TYPE
)
4199 gcc_assert (bitpos
== 0);
4200 result
= store_expr (from
, to_rtx
, false, nontemporal
);
4204 gcc_assert (bitpos
== 0 || bitpos
== GET_MODE_BITSIZE (mode1
));
4205 result
= store_expr (from
, XEXP (to_rtx
, bitpos
!= 0), false,
4213 /* If the field is at offset zero, we could have been given the
4214 DECL_RTX of the parent struct. Don't munge it. */
4215 to_rtx
= shallow_copy_rtx (to_rtx
);
4217 set_mem_attributes_minus_bitpos (to_rtx
, to
, 0, bitpos
);
4219 /* Deal with volatile and readonly fields. The former is only
4220 done for MEM. Also set MEM_KEEP_ALIAS_SET_P if needed. */
4222 MEM_VOLATILE_P (to_rtx
) = 1;
4223 if (component_uses_parent_alias_set (to
))
4224 MEM_KEEP_ALIAS_SET_P (to_rtx
) = 1;
4227 if (optimize_bitfield_assignment_op (bitsize
, bitpos
, mode1
,
4231 result
= store_field (to_rtx
, bitsize
, bitpos
, mode1
, from
,
4232 TREE_TYPE (tem
), get_alias_set (to
),
4237 preserve_temp_slots (result
);
4243 /* If the rhs is a function call and its value is not an aggregate,
4244 call the function before we start to compute the lhs.
4245 This is needed for correct code for cases such as
4246 val = setjmp (buf) on machines where reference to val
4247 requires loading up part of an address in a separate insn.
4249 Don't do this if TO is a VAR_DECL or PARM_DECL whose DECL_RTL is REG
4250 since it might be a promoted variable where the zero- or sign- extension
4251 needs to be done. Handling this in the normal way is safe because no
4252 computation is done before the call. */
4253 if (TREE_CODE (from
) == CALL_EXPR
&& ! aggregate_value_p (from
, from
)
4254 && TREE_CODE (TYPE_SIZE (TREE_TYPE (from
))) == INTEGER_CST
4255 && ! ((TREE_CODE (to
) == VAR_DECL
|| TREE_CODE (to
) == PARM_DECL
)
4256 && REG_P (DECL_RTL (to
))))
4261 value
= expand_normal (from
);
4263 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4265 /* Handle calls that return values in multiple non-contiguous locations.
4266 The Irix 6 ABI has examples of this. */
4267 if (GET_CODE (to_rtx
) == PARALLEL
)
4268 emit_group_load (to_rtx
, value
, TREE_TYPE (from
),
4269 int_size_in_bytes (TREE_TYPE (from
)));
4270 else if (GET_MODE (to_rtx
) == BLKmode
)
4271 emit_block_move (to_rtx
, value
, expr_size (from
), BLOCK_OP_NORMAL
);
4274 if (POINTER_TYPE_P (TREE_TYPE (to
)))
4275 value
= convert_memory_address (GET_MODE (to_rtx
), value
);
4276 emit_move_insn (to_rtx
, value
);
4278 preserve_temp_slots (to_rtx
);
4284 /* Ordinary treatment. Expand TO to get a REG or MEM rtx.
4285 Don't re-expand if it was expanded already (in COMPONENT_REF case). */
4288 to_rtx
= expand_expr (to
, NULL_RTX
, VOIDmode
, EXPAND_WRITE
);
4290 /* Don't move directly into a return register. */
4291 if (TREE_CODE (to
) == RESULT_DECL
4292 && (REG_P (to_rtx
) || GET_CODE (to_rtx
) == PARALLEL
))
4297 temp
= expand_expr (from
, NULL_RTX
, GET_MODE (to_rtx
), EXPAND_NORMAL
);
4299 if (GET_CODE (to_rtx
) == PARALLEL
)
4300 emit_group_load (to_rtx
, temp
, TREE_TYPE (from
),
4301 int_size_in_bytes (TREE_TYPE (from
)));
4303 emit_move_insn (to_rtx
, temp
);
4305 preserve_temp_slots (to_rtx
);
4311 /* In case we are returning the contents of an object which overlaps
4312 the place the value is being stored, use a safe function when copying
4313 a value through a pointer into a structure value return block. */
4314 if (TREE_CODE (to
) == RESULT_DECL
&& TREE_CODE (from
) == INDIRECT_REF
4315 && current_function_returns_struct
4316 && !current_function_returns_pcc_struct
)
4321 size
= expr_size (from
);
4322 from_rtx
= expand_normal (from
);
4324 emit_library_call (memmove_libfunc
, LCT_NORMAL
,
4325 VOIDmode
, 3, XEXP (to_rtx
, 0), Pmode
,
4326 XEXP (from_rtx
, 0), Pmode
,
4327 convert_to_mode (TYPE_MODE (sizetype
),
4328 size
, TYPE_UNSIGNED (sizetype
)),
4329 TYPE_MODE (sizetype
));
4331 preserve_temp_slots (to_rtx
);
4337 /* Compute FROM and store the value in the rtx we got. */
4340 result
= store_expr (from
, to_rtx
, 0, nontemporal
);
4341 preserve_temp_slots (result
);
4347 /* Emits nontemporal store insn that moves FROM to TO. Returns true if this
4348 succeeded, false otherwise. */
4351 emit_storent_insn (rtx to
, rtx from
)
4353 enum machine_mode mode
= GET_MODE (to
), imode
;
4354 enum insn_code code
= optab_handler (storent_optab
, mode
)->insn_code
;
4357 if (code
== CODE_FOR_nothing
)
4360 imode
= insn_data
[code
].operand
[0].mode
;
4361 if (!insn_data
[code
].operand
[0].predicate (to
, imode
))
4364 imode
= insn_data
[code
].operand
[1].mode
;
4365 if (!insn_data
[code
].operand
[1].predicate (from
, imode
))
4367 from
= copy_to_mode_reg (imode
, from
);
4368 if (!insn_data
[code
].operand
[1].predicate (from
, imode
))
4372 pattern
= GEN_FCN (code
) (to
, from
);
4373 if (pattern
== NULL_RTX
)
4376 emit_insn (pattern
);
4380 /* Generate code for computing expression EXP,
4381 and storing the value into TARGET.
4383 If the mode is BLKmode then we may return TARGET itself.
4384 It turns out that in BLKmode it doesn't cause a problem.
4385 because C has no operators that could combine two different
4386 assignments into the same BLKmode object with different values
4387 with no sequence point. Will other languages need this to
4390 If CALL_PARAM_P is nonzero, this is a store into a call param on the
4391 stack, and block moves may need to be treated specially.
4393 If NONTEMPORAL is true, try using a nontemporal store instruction. */
4396 store_expr (tree exp
, rtx target
, int call_param_p
, bool nontemporal
)
4399 rtx alt_rtl
= NULL_RTX
;
4400 int dont_return_target
= 0;
4402 if (VOID_TYPE_P (TREE_TYPE (exp
)))
4404 /* C++ can generate ?: expressions with a throw expression in one
4405 branch and an rvalue in the other. Here, we resolve attempts to
4406 store the throw expression's nonexistent result. */
4407 gcc_assert (!call_param_p
);
4408 expand_expr (exp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
4411 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
4413 /* Perform first part of compound expression, then assign from second
4415 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
4416 call_param_p
? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
4417 return store_expr (TREE_OPERAND (exp
, 1), target
, call_param_p
,
4420 else if (TREE_CODE (exp
) == COND_EXPR
&& GET_MODE (target
) == BLKmode
)
4422 /* For conditional expression, get safe form of the target. Then
4423 test the condition, doing the appropriate assignment on either
4424 side. This avoids the creation of unnecessary temporaries.
4425 For non-BLKmode, it is more efficient not to do this. */
4427 rtx lab1
= gen_label_rtx (), lab2
= gen_label_rtx ();
4429 do_pending_stack_adjust ();
4431 jumpifnot (TREE_OPERAND (exp
, 0), lab1
);
4432 store_expr (TREE_OPERAND (exp
, 1), target
, call_param_p
,
4434 emit_jump_insn (gen_jump (lab2
));
4437 store_expr (TREE_OPERAND (exp
, 2), target
, call_param_p
,
4444 else if (GET_CODE (target
) == SUBREG
&& SUBREG_PROMOTED_VAR_P (target
))
4445 /* If this is a scalar in a register that is stored in a wider mode
4446 than the declared mode, compute the result into its declared mode
4447 and then convert to the wider mode. Our value is the computed
4450 rtx inner_target
= 0;
4452 /* We can do the conversion inside EXP, which will often result
4453 in some optimizations. Do the conversion in two steps: first
4454 change the signedness, if needed, then the extend. But don't
4455 do this if the type of EXP is a subtype of something else
4456 since then the conversion might involve more than just
4457 converting modes. */
4458 if (INTEGRAL_TYPE_P (TREE_TYPE (exp
))
4459 && TREE_TYPE (TREE_TYPE (exp
)) == 0
4460 && (!lang_hooks
.reduce_bit_field_operations
4461 || (GET_MODE_PRECISION (GET_MODE (target
))
4462 == TYPE_PRECISION (TREE_TYPE (exp
)))))
4464 if (TYPE_UNSIGNED (TREE_TYPE (exp
))
4465 != SUBREG_PROMOTED_UNSIGNED_P (target
))
4467 /* Some types, e.g. Fortran's logical*4, won't have a signed
4468 version, so use the mode instead. */
4470 = (signed_or_unsigned_type_for
4471 (SUBREG_PROMOTED_UNSIGNED_P (target
), TREE_TYPE (exp
)));
4473 ntype
= lang_hooks
.types
.type_for_mode
4474 (TYPE_MODE (TREE_TYPE (exp
)),
4475 SUBREG_PROMOTED_UNSIGNED_P (target
));
4477 exp
= fold_convert (ntype
, exp
);
4480 exp
= fold_convert (lang_hooks
.types
.type_for_mode
4481 (GET_MODE (SUBREG_REG (target
)),
4482 SUBREG_PROMOTED_UNSIGNED_P (target
)),
4485 inner_target
= SUBREG_REG (target
);
4488 temp
= expand_expr (exp
, inner_target
, VOIDmode
,
4489 call_param_p
? EXPAND_STACK_PARM
: EXPAND_NORMAL
);
4491 /* If TEMP is a VOIDmode constant, use convert_modes to make
4492 sure that we properly convert it. */
4493 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
)
4495 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
4496 temp
, SUBREG_PROMOTED_UNSIGNED_P (target
));
4497 temp
= convert_modes (GET_MODE (SUBREG_REG (target
)),
4498 GET_MODE (target
), temp
,
4499 SUBREG_PROMOTED_UNSIGNED_P (target
));
4502 convert_move (SUBREG_REG (target
), temp
,
4503 SUBREG_PROMOTED_UNSIGNED_P (target
));
4507 else if (TREE_CODE (exp
) == STRING_CST
4508 && !nontemporal
&& !call_param_p
4509 && TREE_STRING_LENGTH (exp
) > 0
4510 && TYPE_MODE (TREE_TYPE (exp
)) == BLKmode
)
4512 /* Optimize initialization of an array with a STRING_CST. */
4513 HOST_WIDE_INT exp_len
, str_copy_len
;
4516 exp_len
= int_expr_size (exp
);
4520 str_copy_len
= strlen (TREE_STRING_POINTER (exp
));
4521 if (str_copy_len
< TREE_STRING_LENGTH (exp
) - 1)
4524 str_copy_len
= TREE_STRING_LENGTH (exp
);
4525 if ((STORE_MAX_PIECES
& (STORE_MAX_PIECES
- 1)) == 0)
4527 str_copy_len
+= STORE_MAX_PIECES
- 1;
4528 str_copy_len
&= ~(STORE_MAX_PIECES
- 1);
4530 str_copy_len
= MIN (str_copy_len
, exp_len
);
4531 if (!can_store_by_pieces (str_copy_len
, builtin_strncpy_read_str
,
4532 (void *) TREE_STRING_POINTER (exp
),
4533 MEM_ALIGN (target
), false))
4538 dest_mem
= store_by_pieces (dest_mem
,
4539 str_copy_len
, builtin_strncpy_read_str
,
4540 (void *) TREE_STRING_POINTER (exp
),
4541 MEM_ALIGN (target
), false,
4542 exp_len
> str_copy_len
? 1 : 0);
4543 if (exp_len
> str_copy_len
)
4544 clear_storage (adjust_address (dest_mem
, BLKmode
, 0),
4545 GEN_INT (exp_len
- str_copy_len
),
4554 /* If we want to use a nontemporal store, force the value to
4556 tmp_target
= nontemporal
? NULL_RTX
: target
;
4557 temp
= expand_expr_real (exp
, tmp_target
, GET_MODE (target
),
4559 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
),
4561 /* Return TARGET if it's a specified hardware register.
4562 If TARGET is a volatile mem ref, either return TARGET
4563 or return a reg copied *from* TARGET; ANSI requires this.
4565 Otherwise, if TEMP is not TARGET, return TEMP
4566 if it is constant (for efficiency),
4567 or if we really want the correct value. */
4568 if (!(target
&& REG_P (target
)
4569 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)
4570 && !(MEM_P (target
) && MEM_VOLATILE_P (target
))
4571 && ! rtx_equal_p (temp
, target
)
4572 && CONSTANT_P (temp
))
4573 dont_return_target
= 1;
4576 /* If TEMP is a VOIDmode constant and the mode of the type of EXP is not
4577 the same as that of TARGET, adjust the constant. This is needed, for
4578 example, in case it is a CONST_DOUBLE and we want only a word-sized
4580 if (CONSTANT_P (temp
) && GET_MODE (temp
) == VOIDmode
4581 && TREE_CODE (exp
) != ERROR_MARK
4582 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
4583 temp
= convert_modes (GET_MODE (target
), TYPE_MODE (TREE_TYPE (exp
)),
4584 temp
, TYPE_UNSIGNED (TREE_TYPE (exp
)));
4586 /* If value was not generated in the target, store it there.
4587 Convert the value to TARGET's type first if necessary and emit the
4588 pending incrementations that have been queued when expanding EXP.
4589 Note that we cannot emit the whole queue blindly because this will
4590 effectively disable the POST_INC optimization later.
4592 If TEMP and TARGET compare equal according to rtx_equal_p, but
4593 one or both of them are volatile memory refs, we have to distinguish
4595 - expand_expr has used TARGET. In this case, we must not generate
4596 another copy. This can be detected by TARGET being equal according
4598 - expand_expr has not used TARGET - that means that the source just
4599 happens to have the same RTX form. Since temp will have been created
4600 by expand_expr, it will compare unequal according to == .
4601 We must generate a copy in this case, to reach the correct number
4602 of volatile memory references. */
4604 if ((! rtx_equal_p (temp
, target
)
4605 || (temp
!= target
&& (side_effects_p (temp
)
4606 || side_effects_p (target
))))
4607 && TREE_CODE (exp
) != ERROR_MARK
4608 /* If store_expr stores a DECL whose DECL_RTL(exp) == TARGET,
4609 but TARGET is not valid memory reference, TEMP will differ
4610 from TARGET although it is really the same location. */
4611 && !(alt_rtl
&& rtx_equal_p (alt_rtl
, target
))
4612 /* If there's nothing to copy, don't bother. Don't call
4613 expr_size unless necessary, because some front-ends (C++)
4614 expr_size-hook must not be given objects that are not
4615 supposed to be bit-copied or bit-initialized. */
4616 && expr_size (exp
) != const0_rtx
)
4618 if (GET_MODE (temp
) != GET_MODE (target
)
4619 && GET_MODE (temp
) != VOIDmode
)
4621 int unsignedp
= TYPE_UNSIGNED (TREE_TYPE (exp
));
4622 if (dont_return_target
)
4624 /* In this case, we will return TEMP,
4625 so make sure it has the proper mode.
4626 But don't forget to store the value into TARGET. */
4627 temp
= convert_to_mode (GET_MODE (target
), temp
, unsignedp
);
4628 emit_move_insn (target
, temp
);
4630 else if (GET_MODE (target
) == BLKmode
)
4631 emit_block_move (target
, temp
, expr_size (exp
),
4633 ? BLOCK_OP_CALL_PARM
4634 : BLOCK_OP_NORMAL
));
4636 convert_move (target
, temp
, unsignedp
);
4639 else if (GET_MODE (temp
) == BLKmode
&& TREE_CODE (exp
) == STRING_CST
)
4641 /* Handle copying a string constant into an array. The string
4642 constant may be shorter than the array. So copy just the string's
4643 actual length, and clear the rest. First get the size of the data
4644 type of the string, which is actually the size of the target. */
4645 rtx size
= expr_size (exp
);
4647 if (GET_CODE (size
) == CONST_INT
4648 && INTVAL (size
) < TREE_STRING_LENGTH (exp
))
4649 emit_block_move (target
, temp
, size
,
4651 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
4654 /* Compute the size of the data to copy from the string. */
4656 = size_binop (MIN_EXPR
,
4657 make_tree (sizetype
, size
),
4658 size_int (TREE_STRING_LENGTH (exp
)));
4660 = expand_expr (copy_size
, NULL_RTX
, VOIDmode
,
4662 ? EXPAND_STACK_PARM
: EXPAND_NORMAL
));
4665 /* Copy that much. */
4666 copy_size_rtx
= convert_to_mode (ptr_mode
, copy_size_rtx
,
4667 TYPE_UNSIGNED (sizetype
));
4668 emit_block_move (target
, temp
, copy_size_rtx
,
4670 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
4672 /* Figure out how much is left in TARGET that we have to clear.
4673 Do all calculations in ptr_mode. */
4674 if (GET_CODE (copy_size_rtx
) == CONST_INT
)
4676 size
= plus_constant (size
, -INTVAL (copy_size_rtx
));
4677 target
= adjust_address (target
, BLKmode
,
4678 INTVAL (copy_size_rtx
));
4682 size
= expand_binop (TYPE_MODE (sizetype
), sub_optab
, size
,
4683 copy_size_rtx
, NULL_RTX
, 0,
4686 #ifdef POINTERS_EXTEND_UNSIGNED
4687 if (GET_MODE (copy_size_rtx
) != Pmode
)
4688 copy_size_rtx
= convert_to_mode (Pmode
, copy_size_rtx
,
4689 TYPE_UNSIGNED (sizetype
));
4692 target
= offset_address (target
, copy_size_rtx
,
4693 highest_pow2_factor (copy_size
));
4694 label
= gen_label_rtx ();
4695 emit_cmp_and_jump_insns (size
, const0_rtx
, LT
, NULL_RTX
,
4696 GET_MODE (size
), 0, label
);
4699 if (size
!= const0_rtx
)
4700 clear_storage (target
, size
, BLOCK_OP_NORMAL
);
4706 /* Handle calls that return values in multiple non-contiguous locations.
4707 The Irix 6 ABI has examples of this. */
4708 else if (GET_CODE (target
) == PARALLEL
)
4709 emit_group_load (target
, temp
, TREE_TYPE (exp
),
4710 int_size_in_bytes (TREE_TYPE (exp
)));
4711 else if (GET_MODE (temp
) == BLKmode
)
4712 emit_block_move (target
, temp
, expr_size (exp
),
4714 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
4715 else if (nontemporal
4716 && emit_storent_insn (target
, temp
))
4717 /* If we managed to emit a nontemporal store, there is nothing else to
4722 temp
= force_operand (temp
, target
);
4724 emit_move_insn (target
, temp
);
4731 /* Helper for categorize_ctor_elements. Identical interface. */
4734 categorize_ctor_elements_1 (const_tree ctor
, HOST_WIDE_INT
*p_nz_elts
,
4735 HOST_WIDE_INT
*p_elt_count
,
4738 unsigned HOST_WIDE_INT idx
;
4739 HOST_WIDE_INT nz_elts
, elt_count
;
4740 tree value
, purpose
;
4742 /* Whether CTOR is a valid constant initializer, in accordance with what
4743 initializer_constant_valid_p does. If inferred from the constructor
4744 elements, true until proven otherwise. */
4745 bool const_from_elts_p
= constructor_static_from_elts_p (ctor
);
4746 bool const_p
= const_from_elts_p
? true : TREE_STATIC (ctor
);
4751 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), idx
, purpose
, value
)
4756 if (TREE_CODE (purpose
) == RANGE_EXPR
)
4758 tree lo_index
= TREE_OPERAND (purpose
, 0);
4759 tree hi_index
= TREE_OPERAND (purpose
, 1);
4761 if (host_integerp (lo_index
, 1) && host_integerp (hi_index
, 1))
4762 mult
= (tree_low_cst (hi_index
, 1)
4763 - tree_low_cst (lo_index
, 1) + 1);
4766 switch (TREE_CODE (value
))
4770 HOST_WIDE_INT nz
= 0, ic
= 0;
4773 = categorize_ctor_elements_1 (value
, &nz
, &ic
, p_must_clear
);
4775 nz_elts
+= mult
* nz
;
4776 elt_count
+= mult
* ic
;
4778 if (const_from_elts_p
&& const_p
)
4779 const_p
= const_elt_p
;
4786 if (!initializer_zerop (value
))
4792 nz_elts
+= mult
* TREE_STRING_LENGTH (value
);
4793 elt_count
+= mult
* TREE_STRING_LENGTH (value
);
4797 if (!initializer_zerop (TREE_REALPART (value
)))
4799 if (!initializer_zerop (TREE_IMAGPART (value
)))
4807 for (v
= TREE_VECTOR_CST_ELTS (value
); v
; v
= TREE_CHAIN (v
))
4809 if (!initializer_zerop (TREE_VALUE (v
)))
4820 if (const_from_elts_p
&& const_p
)
4821 const_p
= initializer_constant_valid_p (value
, TREE_TYPE (value
))
4828 && (TREE_CODE (TREE_TYPE (ctor
)) == UNION_TYPE
4829 || TREE_CODE (TREE_TYPE (ctor
)) == QUAL_UNION_TYPE
))
4832 bool clear_this
= true;
4834 if (!VEC_empty (constructor_elt
, CONSTRUCTOR_ELTS (ctor
)))
4836 /* We don't expect more than one element of the union to be
4837 initialized. Not sure what we should do otherwise... */
4838 gcc_assert (VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (ctor
))
4841 init_sub_type
= TREE_TYPE (VEC_index (constructor_elt
,
4842 CONSTRUCTOR_ELTS (ctor
),
4845 /* ??? We could look at each element of the union, and find the
4846 largest element. Which would avoid comparing the size of the
4847 initialized element against any tail padding in the union.
4848 Doesn't seem worth the effort... */
4849 if (simple_cst_equal (TYPE_SIZE (TREE_TYPE (ctor
)),
4850 TYPE_SIZE (init_sub_type
)) == 1)
4852 /* And now we have to find out if the element itself is fully
4853 constructed. E.g. for union { struct { int a, b; } s; } u
4854 = { .s = { .a = 1 } }. */
4855 if (elt_count
== count_type_elements (init_sub_type
, false))
4860 *p_must_clear
= clear_this
;
4863 *p_nz_elts
+= nz_elts
;
4864 *p_elt_count
+= elt_count
;
4869 /* Examine CTOR to discover:
4870 * how many scalar fields are set to nonzero values,
4871 and place it in *P_NZ_ELTS;
4872 * how many scalar fields in total are in CTOR,
4873 and place it in *P_ELT_COUNT.
4874 * if a type is a union, and the initializer from the constructor
4875 is not the largest element in the union, then set *p_must_clear.
4877 Return whether or not CTOR is a valid static constant initializer, the same
4878 as "initializer_constant_valid_p (CTOR, TREE_TYPE (CTOR)) != 0". */
4881 categorize_ctor_elements (const_tree ctor
, HOST_WIDE_INT
*p_nz_elts
,
4882 HOST_WIDE_INT
*p_elt_count
,
4887 *p_must_clear
= false;
4890 categorize_ctor_elements_1 (ctor
, p_nz_elts
, p_elt_count
, p_must_clear
);
4893 /* Count the number of scalars in TYPE. Return -1 on overflow or
4894 variable-sized. If ALLOW_FLEXARR is true, don't count flexible
4895 array member at the end of the structure. */
4898 count_type_elements (const_tree type
, bool allow_flexarr
)
4900 const HOST_WIDE_INT max
= ~((HOST_WIDE_INT
)1 << (HOST_BITS_PER_WIDE_INT
-1));
4901 switch (TREE_CODE (type
))
4905 tree telts
= array_type_nelts (type
);
4906 if (telts
&& host_integerp (telts
, 1))
4908 HOST_WIDE_INT n
= tree_low_cst (telts
, 1) + 1;
4909 HOST_WIDE_INT m
= count_type_elements (TREE_TYPE (type
), false);
4912 else if (max
/ n
> m
)
4920 HOST_WIDE_INT n
= 0, t
;
4923 for (f
= TYPE_FIELDS (type
); f
; f
= TREE_CHAIN (f
))
4924 if (TREE_CODE (f
) == FIELD_DECL
)
4926 t
= count_type_elements (TREE_TYPE (f
), false);
4929 /* Check for structures with flexible array member. */
4930 tree tf
= TREE_TYPE (f
);
4932 && TREE_CHAIN (f
) == NULL
4933 && TREE_CODE (tf
) == ARRAY_TYPE
4935 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf
))
4936 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf
)))
4937 && !TYPE_MAX_VALUE (TYPE_DOMAIN (tf
))
4938 && int_size_in_bytes (type
) >= 0)
4950 case QUAL_UNION_TYPE
:
4952 /* Ho hum. How in the world do we guess here? Clearly it isn't
4953 right to count the fields. Guess based on the number of words. */
4954 HOST_WIDE_INT n
= int_size_in_bytes (type
);
4957 return n
/ UNITS_PER_WORD
;
4964 return TYPE_VECTOR_SUBPARTS (type
);
4968 case FIXED_POINT_TYPE
:
4973 case REFERENCE_TYPE
:
4985 /* Return 1 if EXP contains mostly (3/4) zeros. */
4988 mostly_zeros_p (const_tree exp
)
4990 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4993 HOST_WIDE_INT nz_elts
, count
, elts
;
4996 categorize_ctor_elements (exp
, &nz_elts
, &count
, &must_clear
);
5000 elts
= count_type_elements (TREE_TYPE (exp
), false);
5002 return nz_elts
< elts
/ 4;
5005 return initializer_zerop (exp
);
5008 /* Return 1 if EXP contains all zeros. */
5011 all_zeros_p (const_tree exp
)
5013 if (TREE_CODE (exp
) == CONSTRUCTOR
)
5016 HOST_WIDE_INT nz_elts
, count
;
5019 categorize_ctor_elements (exp
, &nz_elts
, &count
, &must_clear
);
5020 return nz_elts
== 0;
5023 return initializer_zerop (exp
);
5026 /* Helper function for store_constructor.
5027 TARGET, BITSIZE, BITPOS, MODE, EXP are as for store_field.
5028 TYPE is the type of the CONSTRUCTOR, not the element type.
5029 CLEARED is as for store_constructor.
5030 ALIAS_SET is the alias set to use for any stores.
5032 This provides a recursive shortcut back to store_constructor when it isn't
5033 necessary to go through store_field. This is so that we can pass through
5034 the cleared field to let store_constructor know that we may not have to
5035 clear a substructure if the outer structure has already been cleared. */
5038 store_constructor_field (rtx target
, unsigned HOST_WIDE_INT bitsize
,
5039 HOST_WIDE_INT bitpos
, enum machine_mode mode
,
5040 tree exp
, tree type
, int cleared
,
5041 alias_set_type alias_set
)
5043 if (TREE_CODE (exp
) == CONSTRUCTOR
5044 /* We can only call store_constructor recursively if the size and
5045 bit position are on a byte boundary. */
5046 && bitpos
% BITS_PER_UNIT
== 0
5047 && (bitsize
> 0 && bitsize
% BITS_PER_UNIT
== 0)
5048 /* If we have a nonzero bitpos for a register target, then we just
5049 let store_field do the bitfield handling. This is unlikely to
5050 generate unnecessary clear instructions anyways. */
5051 && (bitpos
== 0 || MEM_P (target
)))
5055 = adjust_address (target
,
5056 GET_MODE (target
) == BLKmode
5058 % GET_MODE_ALIGNMENT (GET_MODE (target
)))
5059 ? BLKmode
: VOIDmode
, bitpos
/ BITS_PER_UNIT
);
5062 /* Update the alias set, if required. */
5063 if (MEM_P (target
) && ! MEM_KEEP_ALIAS_SET_P (target
)
5064 && MEM_ALIAS_SET (target
) != 0)
5066 target
= copy_rtx (target
);
5067 set_mem_alias_set (target
, alias_set
);
5070 store_constructor (exp
, target
, cleared
, bitsize
/ BITS_PER_UNIT
);
5073 store_field (target
, bitsize
, bitpos
, mode
, exp
, type
, alias_set
, false);
5076 /* Store the value of constructor EXP into the rtx TARGET.
5077 TARGET is either a REG or a MEM; we know it cannot conflict, since
5078 safe_from_p has been called.
5079 CLEARED is true if TARGET is known to have been zero'd.
5080 SIZE is the number of bytes of TARGET we are allowed to modify: this
5081 may not be the same as the size of EXP if we are assigning to a field
5082 which has been packed to exclude padding bits. */
5085 store_constructor (tree exp
, rtx target
, int cleared
, HOST_WIDE_INT size
)
5087 tree type
= TREE_TYPE (exp
);
5088 #ifdef WORD_REGISTER_OPERATIONS
5089 HOST_WIDE_INT exp_size
= int_size_in_bytes (type
);
5092 switch (TREE_CODE (type
))
5096 case QUAL_UNION_TYPE
:
5098 unsigned HOST_WIDE_INT idx
;
5101 /* If size is zero or the target is already cleared, do nothing. */
5102 if (size
== 0 || cleared
)
5104 /* We either clear the aggregate or indicate the value is dead. */
5105 else if ((TREE_CODE (type
) == UNION_TYPE
5106 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
5107 && ! CONSTRUCTOR_ELTS (exp
))
5108 /* If the constructor is empty, clear the union. */
5110 clear_storage (target
, expr_size (exp
), BLOCK_OP_NORMAL
);
5114 /* If we are building a static constructor into a register,
5115 set the initial value as zero so we can fold the value into
5116 a constant. But if more than one register is involved,
5117 this probably loses. */
5118 else if (REG_P (target
) && TREE_STATIC (exp
)
5119 && GET_MODE_SIZE (GET_MODE (target
)) <= UNITS_PER_WORD
)
5121 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
5125 /* If the constructor has fewer fields than the structure or
5126 if we are initializing the structure to mostly zeros, clear
5127 the whole structure first. Don't do this if TARGET is a
5128 register whose mode size isn't equal to SIZE since
5129 clear_storage can't handle this case. */
5131 && (((int)VEC_length (constructor_elt
, CONSTRUCTOR_ELTS (exp
))
5132 != fields_length (type
))
5133 || mostly_zeros_p (exp
))
5135 || ((HOST_WIDE_INT
) GET_MODE_SIZE (GET_MODE (target
))
5138 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
5142 if (REG_P (target
) && !cleared
)
5143 emit_insn (gen_rtx_CLOBBER (VOIDmode
, target
));
5145 /* Store each element of the constructor into the
5146 corresponding field of TARGET. */
5147 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), idx
, field
, value
)
5149 enum machine_mode mode
;
5150 HOST_WIDE_INT bitsize
;
5151 HOST_WIDE_INT bitpos
= 0;
5153 rtx to_rtx
= target
;
5155 /* Just ignore missing fields. We cleared the whole
5156 structure, above, if any fields are missing. */
5160 if (cleared
&& initializer_zerop (value
))
5163 if (host_integerp (DECL_SIZE (field
), 1))
5164 bitsize
= tree_low_cst (DECL_SIZE (field
), 1);
5168 mode
= DECL_MODE (field
);
5169 if (DECL_BIT_FIELD (field
))
5172 offset
= DECL_FIELD_OFFSET (field
);
5173 if (host_integerp (offset
, 0)
5174 && host_integerp (bit_position (field
), 0))
5176 bitpos
= int_bit_position (field
);
5180 bitpos
= tree_low_cst (DECL_FIELD_BIT_OFFSET (field
), 0);
5187 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (offset
,
5188 make_tree (TREE_TYPE (exp
),
5191 offset_rtx
= expand_normal (offset
);
5192 gcc_assert (MEM_P (to_rtx
));
5194 #ifdef POINTERS_EXTEND_UNSIGNED
5195 if (GET_MODE (offset_rtx
) != Pmode
)
5196 offset_rtx
= convert_to_mode (Pmode
, offset_rtx
, 0);
5198 if (GET_MODE (offset_rtx
) != ptr_mode
)
5199 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
5202 to_rtx
= offset_address (to_rtx
, offset_rtx
,
5203 highest_pow2_factor (offset
));
5206 #ifdef WORD_REGISTER_OPERATIONS
5207 /* If this initializes a field that is smaller than a
5208 word, at the start of a word, try to widen it to a full
5209 word. This special case allows us to output C++ member
5210 function initializations in a form that the optimizers
5213 && bitsize
< BITS_PER_WORD
5214 && bitpos
% BITS_PER_WORD
== 0
5215 && GET_MODE_CLASS (mode
) == MODE_INT
5216 && TREE_CODE (value
) == INTEGER_CST
5218 && bitpos
+ BITS_PER_WORD
<= exp_size
* BITS_PER_UNIT
)
5220 tree type
= TREE_TYPE (value
);
5222 if (TYPE_PRECISION (type
) < BITS_PER_WORD
)
5224 type
= lang_hooks
.types
.type_for_size
5225 (BITS_PER_WORD
, TYPE_UNSIGNED (type
));
5226 value
= fold_convert (type
, value
);
5229 if (BYTES_BIG_ENDIAN
)
5231 = fold_build2 (LSHIFT_EXPR
, type
, value
,
5232 build_int_cst (type
,
5233 BITS_PER_WORD
- bitsize
));
5234 bitsize
= BITS_PER_WORD
;
5239 if (MEM_P (to_rtx
) && !MEM_KEEP_ALIAS_SET_P (to_rtx
)
5240 && DECL_NONADDRESSABLE_P (field
))
5242 to_rtx
= copy_rtx (to_rtx
);
5243 MEM_KEEP_ALIAS_SET_P (to_rtx
) = 1;
5246 store_constructor_field (to_rtx
, bitsize
, bitpos
, mode
,
5247 value
, type
, cleared
,
5248 get_alias_set (TREE_TYPE (field
)));
5255 unsigned HOST_WIDE_INT i
;
5258 tree elttype
= TREE_TYPE (type
);
5260 HOST_WIDE_INT minelt
= 0;
5261 HOST_WIDE_INT maxelt
= 0;
5263 domain
= TYPE_DOMAIN (type
);
5264 const_bounds_p
= (TYPE_MIN_VALUE (domain
)
5265 && TYPE_MAX_VALUE (domain
)
5266 && host_integerp (TYPE_MIN_VALUE (domain
), 0)
5267 && host_integerp (TYPE_MAX_VALUE (domain
), 0));
5269 /* If we have constant bounds for the range of the type, get them. */
5272 minelt
= tree_low_cst (TYPE_MIN_VALUE (domain
), 0);
5273 maxelt
= tree_low_cst (TYPE_MAX_VALUE (domain
), 0);
5276 /* If the constructor has fewer elements than the array, clear
5277 the whole array first. Similarly if this is static
5278 constructor of a non-BLKmode object. */
5281 else if (REG_P (target
) && TREE_STATIC (exp
))
5285 unsigned HOST_WIDE_INT idx
;
5287 HOST_WIDE_INT count
= 0, zero_count
= 0;
5288 need_to_clear
= ! const_bounds_p
;
5290 /* This loop is a more accurate version of the loop in
5291 mostly_zeros_p (it handles RANGE_EXPR in an index). It
5292 is also needed to check for missing elements. */
5293 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), idx
, index
, value
)
5295 HOST_WIDE_INT this_node_count
;
5300 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
5302 tree lo_index
= TREE_OPERAND (index
, 0);
5303 tree hi_index
= TREE_OPERAND (index
, 1);
5305 if (! host_integerp (lo_index
, 1)
5306 || ! host_integerp (hi_index
, 1))
5312 this_node_count
= (tree_low_cst (hi_index
, 1)
5313 - tree_low_cst (lo_index
, 1) + 1);
5316 this_node_count
= 1;
5318 count
+= this_node_count
;
5319 if (mostly_zeros_p (value
))
5320 zero_count
+= this_node_count
;
5323 /* Clear the entire array first if there are any missing
5324 elements, or if the incidence of zero elements is >=
5327 && (count
< maxelt
- minelt
+ 1
5328 || 4 * zero_count
>= 3 * count
))
5332 if (need_to_clear
&& size
> 0)
5335 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
5337 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
5341 if (!cleared
&& REG_P (target
))
5342 /* Inform later passes that the old value is dead. */
5343 emit_insn (gen_rtx_CLOBBER (VOIDmode
, target
));
5345 /* Store each element of the constructor into the
5346 corresponding element of TARGET, determined by counting the
5348 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp
), i
, index
, value
)
5350 enum machine_mode mode
;
5351 HOST_WIDE_INT bitsize
;
5352 HOST_WIDE_INT bitpos
;
5354 rtx xtarget
= target
;
5356 if (cleared
&& initializer_zerop (value
))
5359 unsignedp
= TYPE_UNSIGNED (elttype
);
5360 mode
= TYPE_MODE (elttype
);
5361 if (mode
== BLKmode
)
5362 bitsize
= (host_integerp (TYPE_SIZE (elttype
), 1)
5363 ? tree_low_cst (TYPE_SIZE (elttype
), 1)
5366 bitsize
= GET_MODE_BITSIZE (mode
);
5368 if (index
!= NULL_TREE
&& TREE_CODE (index
) == RANGE_EXPR
)
5370 tree lo_index
= TREE_OPERAND (index
, 0);
5371 tree hi_index
= TREE_OPERAND (index
, 1);
5372 rtx index_r
, pos_rtx
;
5373 HOST_WIDE_INT lo
, hi
, count
;
5376 /* If the range is constant and "small", unroll the loop. */
5378 && host_integerp (lo_index
, 0)
5379 && host_integerp (hi_index
, 0)
5380 && (lo
= tree_low_cst (lo_index
, 0),
5381 hi
= tree_low_cst (hi_index
, 0),
5382 count
= hi
- lo
+ 1,
5385 || (host_integerp (TYPE_SIZE (elttype
), 1)
5386 && (tree_low_cst (TYPE_SIZE (elttype
), 1) * count
5389 lo
-= minelt
; hi
-= minelt
;
5390 for (; lo
<= hi
; lo
++)
5392 bitpos
= lo
* tree_low_cst (TYPE_SIZE (elttype
), 0);
5395 && !MEM_KEEP_ALIAS_SET_P (target
)
5396 && TREE_CODE (type
) == ARRAY_TYPE
5397 && TYPE_NONALIASED_COMPONENT (type
))
5399 target
= copy_rtx (target
);
5400 MEM_KEEP_ALIAS_SET_P (target
) = 1;
5403 store_constructor_field
5404 (target
, bitsize
, bitpos
, mode
, value
, type
, cleared
,
5405 get_alias_set (elttype
));
5410 rtx loop_start
= gen_label_rtx ();
5411 rtx loop_end
= gen_label_rtx ();
5414 expand_normal (hi_index
);
5415 unsignedp
= TYPE_UNSIGNED (domain
);
5417 index
= build_decl (VAR_DECL
, NULL_TREE
, domain
);
5420 = gen_reg_rtx (promote_mode (domain
, DECL_MODE (index
),
5422 SET_DECL_RTL (index
, index_r
);
5423 store_expr (lo_index
, index_r
, 0, false);
5425 /* Build the head of the loop. */
5426 do_pending_stack_adjust ();
5427 emit_label (loop_start
);
5429 /* Assign value to element index. */
5431 fold_convert (ssizetype
,
5432 fold_build2 (MINUS_EXPR
,
5435 TYPE_MIN_VALUE (domain
)));
5438 size_binop (MULT_EXPR
, position
,
5439 fold_convert (ssizetype
,
5440 TYPE_SIZE_UNIT (elttype
)));
5442 pos_rtx
= expand_normal (position
);
5443 xtarget
= offset_address (target
, pos_rtx
,
5444 highest_pow2_factor (position
));
5445 xtarget
= adjust_address (xtarget
, mode
, 0);
5446 if (TREE_CODE (value
) == CONSTRUCTOR
)
5447 store_constructor (value
, xtarget
, cleared
,
5448 bitsize
/ BITS_PER_UNIT
);
5450 store_expr (value
, xtarget
, 0, false);
5452 /* Generate a conditional jump to exit the loop. */
5453 exit_cond
= build2 (LT_EXPR
, integer_type_node
,
5455 jumpif (exit_cond
, loop_end
);
5457 /* Update the loop counter, and jump to the head of
5459 expand_assignment (index
,
5460 build2 (PLUS_EXPR
, TREE_TYPE (index
),
5461 index
, integer_one_node
),
5464 emit_jump (loop_start
);
5466 /* Build the end of the loop. */
5467 emit_label (loop_end
);
5470 else if ((index
!= 0 && ! host_integerp (index
, 0))
5471 || ! host_integerp (TYPE_SIZE (elttype
), 1))
5476 index
= ssize_int (1);
5479 index
= fold_convert (ssizetype
,
5480 fold_build2 (MINUS_EXPR
,
5483 TYPE_MIN_VALUE (domain
)));
5486 size_binop (MULT_EXPR
, index
,
5487 fold_convert (ssizetype
,
5488 TYPE_SIZE_UNIT (elttype
)));
5489 xtarget
= offset_address (target
,
5490 expand_normal (position
),
5491 highest_pow2_factor (position
));
5492 xtarget
= adjust_address (xtarget
, mode
, 0);
5493 store_expr (value
, xtarget
, 0, false);
5498 bitpos
= ((tree_low_cst (index
, 0) - minelt
)
5499 * tree_low_cst (TYPE_SIZE (elttype
), 1));
5501 bitpos
= (i
* tree_low_cst (TYPE_SIZE (elttype
), 1));
5503 if (MEM_P (target
) && !MEM_KEEP_ALIAS_SET_P (target
)
5504 && TREE_CODE (type
) == ARRAY_TYPE
5505 && TYPE_NONALIASED_COMPONENT (type
))
5507 target
= copy_rtx (target
);
5508 MEM_KEEP_ALIAS_SET_P (target
) = 1;
5510 store_constructor_field (target
, bitsize
, bitpos
, mode
, value
,
5511 type
, cleared
, get_alias_set (elttype
));
5519 unsigned HOST_WIDE_INT idx
;
5520 constructor_elt
*ce
;
5524 tree elttype
= TREE_TYPE (type
);
5525 int elt_size
= tree_low_cst (TYPE_SIZE (elttype
), 1);
5526 enum machine_mode eltmode
= TYPE_MODE (elttype
);
5527 HOST_WIDE_INT bitsize
;
5528 HOST_WIDE_INT bitpos
;
5529 rtvec vector
= NULL
;
5532 gcc_assert (eltmode
!= BLKmode
);
5534 n_elts
= TYPE_VECTOR_SUBPARTS (type
);
5535 if (REG_P (target
) && VECTOR_MODE_P (GET_MODE (target
)))
5537 enum machine_mode mode
= GET_MODE (target
);
5539 icode
= (int) optab_handler (vec_init_optab
, mode
)->insn_code
;
5540 if (icode
!= CODE_FOR_nothing
)
5544 vector
= rtvec_alloc (n_elts
);
5545 for (i
= 0; i
< n_elts
; i
++)
5546 RTVEC_ELT (vector
, i
) = CONST0_RTX (GET_MODE_INNER (mode
));
5550 /* If the constructor has fewer elements than the vector,
5551 clear the whole array first. Similarly if this is static
5552 constructor of a non-BLKmode object. */
5555 else if (REG_P (target
) && TREE_STATIC (exp
))
5559 unsigned HOST_WIDE_INT count
= 0, zero_count
= 0;
5562 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
5564 int n_elts_here
= tree_low_cst
5565 (int_const_binop (TRUNC_DIV_EXPR
,
5566 TYPE_SIZE (TREE_TYPE (value
)),
5567 TYPE_SIZE (elttype
), 0), 1);
5569 count
+= n_elts_here
;
5570 if (mostly_zeros_p (value
))
5571 zero_count
+= n_elts_here
;
5574 /* Clear the entire vector first if there are any missing elements,
5575 or if the incidence of zero elements is >= 75%. */
5576 need_to_clear
= (count
< n_elts
|| 4 * zero_count
>= 3 * count
);
5579 if (need_to_clear
&& size
> 0 && !vector
)
5582 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
5584 clear_storage (target
, GEN_INT (size
), BLOCK_OP_NORMAL
);
5588 /* Inform later passes that the old value is dead. */
5589 if (!cleared
&& !vector
&& REG_P (target
))
5590 emit_move_insn (target
, CONST0_RTX (GET_MODE (target
)));
5592 /* Store each element of the constructor into the corresponding
5593 element of TARGET, determined by counting the elements. */
5594 for (idx
= 0, i
= 0;
5595 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (exp
), idx
, ce
);
5596 idx
++, i
+= bitsize
/ elt_size
)
5598 HOST_WIDE_INT eltpos
;
5599 tree value
= ce
->value
;
5601 bitsize
= tree_low_cst (TYPE_SIZE (TREE_TYPE (value
)), 1);
5602 if (cleared
&& initializer_zerop (value
))
5606 eltpos
= tree_low_cst (ce
->index
, 1);
5612 /* Vector CONSTRUCTORs should only be built from smaller
5613 vectors in the case of BLKmode vectors. */
5614 gcc_assert (TREE_CODE (TREE_TYPE (value
)) != VECTOR_TYPE
);
5615 RTVEC_ELT (vector
, eltpos
)
5616 = expand_normal (value
);
5620 enum machine_mode value_mode
=
5621 TREE_CODE (TREE_TYPE (value
)) == VECTOR_TYPE
5622 ? TYPE_MODE (TREE_TYPE (value
))
5624 bitpos
= eltpos
* elt_size
;
5625 store_constructor_field (target
, bitsize
, bitpos
,
5626 value_mode
, value
, type
,
5627 cleared
, get_alias_set (elttype
));
5632 emit_insn (GEN_FCN (icode
)
5634 gen_rtx_PARALLEL (GET_MODE (target
), vector
)));
5643 /* Store the value of EXP (an expression tree)
5644 into a subfield of TARGET which has mode MODE and occupies
5645 BITSIZE bits, starting BITPOS bits from the start of TARGET.
5646 If MODE is VOIDmode, it means that we are storing into a bit-field.
5648 Always return const0_rtx unless we have something particular to
5651 TYPE is the type of the underlying object,
5653 ALIAS_SET is the alias set for the destination. This value will
5654 (in general) be different from that for TARGET, since TARGET is a
5655 reference to the containing structure.
5657 If NONTEMPORAL is true, try generating a nontemporal store. */
5660 store_field (rtx target
, HOST_WIDE_INT bitsize
, HOST_WIDE_INT bitpos
,
5661 enum machine_mode mode
, tree exp
, tree type
,
5662 alias_set_type alias_set
, bool nontemporal
)
5664 HOST_WIDE_INT width_mask
= 0;
5666 if (TREE_CODE (exp
) == ERROR_MARK
)
5669 /* If we have nothing to store, do nothing unless the expression has
5672 return expand_expr (exp
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
5673 else if (bitsize
>= 0 && bitsize
< HOST_BITS_PER_WIDE_INT
)
5674 width_mask
= ((HOST_WIDE_INT
) 1 << bitsize
) - 1;
5676 /* If we are storing into an unaligned field of an aligned union that is
5677 in a register, we may have the mode of TARGET being an integer mode but
5678 MODE == BLKmode. In that case, get an aligned object whose size and
5679 alignment are the same as TARGET and store TARGET into it (we can avoid
5680 the store if the field being stored is the entire width of TARGET). Then
5681 call ourselves recursively to store the field into a BLKmode version of
5682 that object. Finally, load from the object into TARGET. This is not
5683 very efficient in general, but should only be slightly more expensive
5684 than the otherwise-required unaligned accesses. Perhaps this can be
5685 cleaned up later. It's tempting to make OBJECT readonly, but it's set
5686 twice, once with emit_move_insn and once via store_field. */
5689 && (REG_P (target
) || GET_CODE (target
) == SUBREG
))
5691 rtx object
= assign_temp (type
, 0, 1, 1);
5692 rtx blk_object
= adjust_address (object
, BLKmode
, 0);
5694 if (bitsize
!= (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (target
)))
5695 emit_move_insn (object
, target
);
5697 store_field (blk_object
, bitsize
, bitpos
, mode
, exp
, type
, alias_set
,
5700 emit_move_insn (target
, object
);
5702 /* We want to return the BLKmode version of the data. */
5706 if (GET_CODE (target
) == CONCAT
)
5708 /* We're storing into a struct containing a single __complex. */
5710 gcc_assert (!bitpos
);
5711 return store_expr (exp
, target
, 0, nontemporal
);
5714 /* If the structure is in a register or if the component
5715 is a bit field, we cannot use addressing to access it.
5716 Use bit-field techniques or SUBREG to store in it. */
5718 if (mode
== VOIDmode
5719 || (mode
!= BLKmode
&& ! direct_store
[(int) mode
]
5720 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
5721 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
)
5723 || GET_CODE (target
) == SUBREG
5724 /* If the field isn't aligned enough to store as an ordinary memref,
5725 store it as a bit field. */
5727 && ((((MEM_ALIGN (target
) < GET_MODE_ALIGNMENT (mode
))
5728 || bitpos
% GET_MODE_ALIGNMENT (mode
))
5729 && SLOW_UNALIGNED_ACCESS (mode
, MEM_ALIGN (target
)))
5730 || (bitpos
% BITS_PER_UNIT
!= 0)))
5731 /* If the RHS and field are a constant size and the size of the
5732 RHS isn't the same size as the bitfield, we must use bitfield
5735 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
5736 && compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)), bitsize
) != 0))
5740 /* If EXP is a NOP_EXPR of precision less than its mode, then that
5741 implies a mask operation. If the precision is the same size as
5742 the field we're storing into, that mask is redundant. This is
5743 particularly common with bit field assignments generated by the
5745 if (TREE_CODE (exp
) == NOP_EXPR
)
5747 tree type
= TREE_TYPE (exp
);
5748 if (INTEGRAL_TYPE_P (type
)
5749 && TYPE_PRECISION (type
) < GET_MODE_BITSIZE (TYPE_MODE (type
))
5750 && bitsize
== TYPE_PRECISION (type
))
5752 type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
5753 if (INTEGRAL_TYPE_P (type
) && TYPE_PRECISION (type
) >= bitsize
)
5754 exp
= TREE_OPERAND (exp
, 0);
5758 temp
= expand_normal (exp
);
5760 /* If BITSIZE is narrower than the size of the type of EXP
5761 we will be narrowing TEMP. Normally, what's wanted are the
5762 low-order bits. However, if EXP's type is a record and this is
5763 big-endian machine, we want the upper BITSIZE bits. */
5764 if (BYTES_BIG_ENDIAN
&& GET_MODE_CLASS (GET_MODE (temp
)) == MODE_INT
5765 && bitsize
< (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (temp
))
5766 && TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
5767 temp
= expand_shift (RSHIFT_EXPR
, GET_MODE (temp
), temp
,
5768 size_int (GET_MODE_BITSIZE (GET_MODE (temp
))
5772 /* Unless MODE is VOIDmode or BLKmode, convert TEMP to
5774 if (mode
!= VOIDmode
&& mode
!= BLKmode
5775 && mode
!= TYPE_MODE (TREE_TYPE (exp
)))
5776 temp
= convert_modes (mode
, TYPE_MODE (TREE_TYPE (exp
)), temp
, 1);
5778 /* If the modes of TARGET and TEMP are both BLKmode, both
5779 must be in memory and BITPOS must be aligned on a byte
5780 boundary. If so, we simply do a block copy. */
5781 if (GET_MODE (target
) == BLKmode
&& GET_MODE (temp
) == BLKmode
)
5783 gcc_assert (MEM_P (target
) && MEM_P (temp
)
5784 && !(bitpos
% BITS_PER_UNIT
));
5786 target
= adjust_address (target
, VOIDmode
, bitpos
/ BITS_PER_UNIT
);
5787 emit_block_move (target
, temp
,
5788 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
5795 /* Store the value in the bitfield. */
5796 store_bit_field (target
, bitsize
, bitpos
, mode
, temp
);
5802 /* Now build a reference to just the desired component. */
5803 rtx to_rtx
= adjust_address (target
, mode
, bitpos
/ BITS_PER_UNIT
);
5805 if (to_rtx
== target
)
5806 to_rtx
= copy_rtx (to_rtx
);
5808 MEM_SET_IN_STRUCT_P (to_rtx
, 1);
5809 if (!MEM_KEEP_ALIAS_SET_P (to_rtx
) && MEM_ALIAS_SET (to_rtx
) != 0)
5810 set_mem_alias_set (to_rtx
, alias_set
);
5812 return store_expr (exp
, to_rtx
, 0, nontemporal
);
5816 /* Given an expression EXP that may be a COMPONENT_REF, a BIT_FIELD_REF,
5817 an ARRAY_REF, or an ARRAY_RANGE_REF, look for nested operations of these
5818 codes and find the ultimate containing object, which we return.
5820 We set *PBITSIZE to the size in bits that we want, *PBITPOS to the
5821 bit position, and *PUNSIGNEDP to the signedness of the field.
5822 If the position of the field is variable, we store a tree
5823 giving the variable offset (in units) in *POFFSET.
5824 This offset is in addition to the bit position.
5825 If the position is not variable, we store 0 in *POFFSET.
5827 If any of the extraction expressions is volatile,
5828 we store 1 in *PVOLATILEP. Otherwise we don't change that.
5830 If the field is a bit-field, *PMODE is set to VOIDmode. Otherwise, it
5831 is a mode that can be used to access the field. In that case, *PBITSIZE
5834 If the field describes a variable-sized object, *PMODE is set to
5835 VOIDmode and *PBITSIZE is set to -1. An access cannot be made in
5836 this case, but the address of the object can be found.
5838 If KEEP_ALIGNING is true and the target is STRICT_ALIGNMENT, we don't
5839 look through nodes that serve as markers of a greater alignment than
5840 the one that can be deduced from the expression. These nodes make it
5841 possible for front-ends to prevent temporaries from being created by
5842 the middle-end on alignment considerations. For that purpose, the
5843 normal operating mode at high-level is to always pass FALSE so that
5844 the ultimate containing object is really returned; moreover, the
5845 associated predicate handled_component_p will always return TRUE
5846 on these nodes, thus indicating that they are essentially handled
5847 by get_inner_reference. TRUE should only be passed when the caller
5848 is scanning the expression in order to build another representation
5849 and specifically knows how to handle these nodes; as such, this is
5850 the normal operating mode in the RTL expanders. */
5853 get_inner_reference (tree exp
, HOST_WIDE_INT
*pbitsize
,
5854 HOST_WIDE_INT
*pbitpos
, tree
*poffset
,
5855 enum machine_mode
*pmode
, int *punsignedp
,
5856 int *pvolatilep
, bool keep_aligning
)
5859 enum machine_mode mode
= VOIDmode
;
5860 tree offset
= size_zero_node
;
5861 tree bit_offset
= bitsize_zero_node
;
5863 /* First get the mode, signedness, and size. We do this from just the
5864 outermost expression. */
5865 if (TREE_CODE (exp
) == COMPONENT_REF
)
5867 size_tree
= DECL_SIZE (TREE_OPERAND (exp
, 1));
5868 if (! DECL_BIT_FIELD (TREE_OPERAND (exp
, 1)))
5869 mode
= DECL_MODE (TREE_OPERAND (exp
, 1));
5871 *punsignedp
= DECL_UNSIGNED (TREE_OPERAND (exp
, 1));
5873 else if (TREE_CODE (exp
) == BIT_FIELD_REF
)
5875 size_tree
= TREE_OPERAND (exp
, 1);
5876 *punsignedp
= BIT_FIELD_REF_UNSIGNED (exp
);
5878 /* For vector types, with the correct size of access, use the mode of
5880 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == VECTOR_TYPE
5881 && TREE_TYPE (exp
) == TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)))
5882 && tree_int_cst_equal (size_tree
, TYPE_SIZE (TREE_TYPE (exp
))))
5883 mode
= TYPE_MODE (TREE_TYPE (exp
));
5887 mode
= TYPE_MODE (TREE_TYPE (exp
));
5888 *punsignedp
= TYPE_UNSIGNED (TREE_TYPE (exp
));
5890 if (mode
== BLKmode
)
5891 size_tree
= TYPE_SIZE (TREE_TYPE (exp
));
5893 *pbitsize
= GET_MODE_BITSIZE (mode
);
5898 if (! host_integerp (size_tree
, 1))
5899 mode
= BLKmode
, *pbitsize
= -1;
5901 *pbitsize
= tree_low_cst (size_tree
, 1);
5906 /* Compute cumulative bit-offset for nested component-refs and array-refs,
5907 and find the ultimate containing object. */
5910 switch (TREE_CODE (exp
))
5913 bit_offset
= size_binop (PLUS_EXPR
, bit_offset
,
5914 TREE_OPERAND (exp
, 2));
5919 tree field
= TREE_OPERAND (exp
, 1);
5920 tree this_offset
= component_ref_field_offset (exp
);
5922 /* If this field hasn't been filled in yet, don't go past it.
5923 This should only happen when folding expressions made during
5924 type construction. */
5925 if (this_offset
== 0)
5928 offset
= size_binop (PLUS_EXPR
, offset
, this_offset
);
5929 bit_offset
= size_binop (PLUS_EXPR
, bit_offset
,
5930 DECL_FIELD_BIT_OFFSET (field
));
5932 /* ??? Right now we don't do anything with DECL_OFFSET_ALIGN. */
5937 case ARRAY_RANGE_REF
:
5939 tree index
= TREE_OPERAND (exp
, 1);
5940 tree low_bound
= array_ref_low_bound (exp
);
5941 tree unit_size
= array_ref_element_size (exp
);
5943 /* We assume all arrays have sizes that are a multiple of a byte.
5944 First subtract the lower bound, if any, in the type of the
5945 index, then convert to sizetype and multiply by the size of
5946 the array element. */
5947 if (! integer_zerop (low_bound
))
5948 index
= fold_build2 (MINUS_EXPR
, TREE_TYPE (index
),
5951 offset
= size_binop (PLUS_EXPR
, offset
,
5952 size_binop (MULT_EXPR
,
5953 fold_convert (sizetype
, index
),
5962 bit_offset
= size_binop (PLUS_EXPR
, bit_offset
,
5963 bitsize_int (*pbitsize
));
5966 case VIEW_CONVERT_EXPR
:
5967 if (keep_aligning
&& STRICT_ALIGNMENT
5968 && (TYPE_ALIGN (TREE_TYPE (exp
))
5969 > TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp
, 0))))
5970 && (TYPE_ALIGN (TREE_TYPE (TREE_OPERAND (exp
, 0)))
5971 < BIGGEST_ALIGNMENT
)
5972 && (TYPE_ALIGN_OK (TREE_TYPE (exp
))
5973 || TYPE_ALIGN_OK (TREE_TYPE (TREE_OPERAND (exp
, 0)))))
5981 /* If any reference in the chain is volatile, the effect is volatile. */
5982 if (TREE_THIS_VOLATILE (exp
))
5985 exp
= TREE_OPERAND (exp
, 0);
5989 /* If OFFSET is constant, see if we can return the whole thing as a
5990 constant bit position. Make sure to handle overflow during
5992 if (host_integerp (offset
, 0))
5994 double_int tem
= double_int_mul (tree_to_double_int (offset
),
5995 uhwi_to_double_int (BITS_PER_UNIT
));
5996 tem
= double_int_add (tem
, tree_to_double_int (bit_offset
));
5997 if (double_int_fits_in_shwi_p (tem
))
5999 *pbitpos
= double_int_to_shwi (tem
);
6000 *poffset
= NULL_TREE
;
6005 /* Otherwise, split it up. */
6006 *pbitpos
= tree_low_cst (bit_offset
, 0);
6012 /* Given an expression EXP that may be a COMPONENT_REF or an ARRAY_REF,
6013 look for whether EXP or any nested component-refs within EXP is marked
6017 contains_packed_reference (const_tree exp
)
6019 bool packed_p
= false;
6023 switch (TREE_CODE (exp
))
6027 tree field
= TREE_OPERAND (exp
, 1);
6028 packed_p
= DECL_PACKED (field
)
6029 || TYPE_PACKED (TREE_TYPE (field
))
6030 || TYPE_PACKED (TREE_TYPE (exp
));
6038 case ARRAY_RANGE_REF
:
6041 case VIEW_CONVERT_EXPR
:
6047 exp
= TREE_OPERAND (exp
, 0);
6053 /* Return a tree of sizetype representing the size, in bytes, of the element
6054 of EXP, an ARRAY_REF. */
6057 array_ref_element_size (tree exp
)
6059 tree aligned_size
= TREE_OPERAND (exp
, 3);
6060 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6062 /* If a size was specified in the ARRAY_REF, it's the size measured
6063 in alignment units of the element type. So multiply by that value. */
6066 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6067 sizetype from another type of the same width and signedness. */
6068 if (TREE_TYPE (aligned_size
) != sizetype
)
6069 aligned_size
= fold_convert (sizetype
, aligned_size
);
6070 return size_binop (MULT_EXPR
, aligned_size
,
6071 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
6074 /* Otherwise, take the size from that of the element type. Substitute
6075 any PLACEHOLDER_EXPR that we have. */
6077 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
6080 /* Return a tree representing the lower bound of the array mentioned in
6081 EXP, an ARRAY_REF. */
6084 array_ref_low_bound (tree exp
)
6086 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6088 /* If a lower bound is specified in EXP, use it. */
6089 if (TREE_OPERAND (exp
, 2))
6090 return TREE_OPERAND (exp
, 2);
6092 /* Otherwise, if there is a domain type and it has a lower bound, use it,
6093 substituting for a PLACEHOLDER_EXPR as needed. */
6094 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
6095 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
6097 /* Otherwise, return a zero of the appropriate type. */
6098 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
6101 /* Return a tree representing the upper bound of the array mentioned in
6102 EXP, an ARRAY_REF. */
6105 array_ref_up_bound (tree exp
)
6107 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
6109 /* If there is a domain type and it has an upper bound, use it, substituting
6110 for a PLACEHOLDER_EXPR as needed. */
6111 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
6112 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
6114 /* Otherwise fail. */
6118 /* Return a tree representing the offset, in bytes, of the field referenced
6119 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
6122 component_ref_field_offset (tree exp
)
6124 tree aligned_offset
= TREE_OPERAND (exp
, 2);
6125 tree field
= TREE_OPERAND (exp
, 1);
6127 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
6128 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
6132 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
6133 sizetype from another type of the same width and signedness. */
6134 if (TREE_TYPE (aligned_offset
) != sizetype
)
6135 aligned_offset
= fold_convert (sizetype
, aligned_offset
);
6136 return size_binop (MULT_EXPR
, aligned_offset
,
6137 size_int (DECL_OFFSET_ALIGN (field
) / BITS_PER_UNIT
));
6140 /* Otherwise, take the offset from that of the field. Substitute
6141 any PLACEHOLDER_EXPR that we have. */
6143 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
6146 /* Return 1 if T is an expression that get_inner_reference handles. */
6149 handled_component_p (const_tree t
)
6151 switch (TREE_CODE (t
))
6156 case ARRAY_RANGE_REF
:
6157 case VIEW_CONVERT_EXPR
:
6167 /* Given an rtx VALUE that may contain additions and multiplications, return
6168 an equivalent value that just refers to a register, memory, or constant.
6169 This is done by generating instructions to perform the arithmetic and
6170 returning a pseudo-register containing the value.
6172 The returned value may be a REG, SUBREG, MEM or constant. */
6175 force_operand (rtx value
, rtx target
)
6178 /* Use subtarget as the target for operand 0 of a binary operation. */
6179 rtx subtarget
= get_subtarget (target
);
6180 enum rtx_code code
= GET_CODE (value
);
6182 /* Check for subreg applied to an expression produced by loop optimizer. */
6184 && !REG_P (SUBREG_REG (value
))
6185 && !MEM_P (SUBREG_REG (value
)))
6188 = simplify_gen_subreg (GET_MODE (value
),
6189 force_reg (GET_MODE (SUBREG_REG (value
)),
6190 force_operand (SUBREG_REG (value
),
6192 GET_MODE (SUBREG_REG (value
)),
6193 SUBREG_BYTE (value
));
6194 code
= GET_CODE (value
);
6197 /* Check for a PIC address load. */
6198 if ((code
== PLUS
|| code
== MINUS
)
6199 && XEXP (value
, 0) == pic_offset_table_rtx
6200 && (GET_CODE (XEXP (value
, 1)) == SYMBOL_REF
6201 || GET_CODE (XEXP (value
, 1)) == LABEL_REF
6202 || GET_CODE (XEXP (value
, 1)) == CONST
))
6205 subtarget
= gen_reg_rtx (GET_MODE (value
));
6206 emit_move_insn (subtarget
, value
);
6210 if (ARITHMETIC_P (value
))
6212 op2
= XEXP (value
, 1);
6213 if (!CONSTANT_P (op2
) && !(REG_P (op2
) && op2
!= subtarget
))
6215 if (code
== MINUS
&& GET_CODE (op2
) == CONST_INT
)
6218 op2
= negate_rtx (GET_MODE (value
), op2
);
6221 /* Check for an addition with OP2 a constant integer and our first
6222 operand a PLUS of a virtual register and something else. In that
6223 case, we want to emit the sum of the virtual register and the
6224 constant first and then add the other value. This allows virtual
6225 register instantiation to simply modify the constant rather than
6226 creating another one around this addition. */
6227 if (code
== PLUS
&& GET_CODE (op2
) == CONST_INT
6228 && GET_CODE (XEXP (value
, 0)) == PLUS
6229 && REG_P (XEXP (XEXP (value
, 0), 0))
6230 && REGNO (XEXP (XEXP (value
, 0), 0)) >= FIRST_VIRTUAL_REGISTER
6231 && REGNO (XEXP (XEXP (value
, 0), 0)) <= LAST_VIRTUAL_REGISTER
)
6233 rtx temp
= expand_simple_binop (GET_MODE (value
), code
,
6234 XEXP (XEXP (value
, 0), 0), op2
,
6235 subtarget
, 0, OPTAB_LIB_WIDEN
);
6236 return expand_simple_binop (GET_MODE (value
), code
, temp
,
6237 force_operand (XEXP (XEXP (value
,
6239 target
, 0, OPTAB_LIB_WIDEN
);
6242 op1
= force_operand (XEXP (value
, 0), subtarget
);
6243 op2
= force_operand (op2
, NULL_RTX
);
6247 return expand_mult (GET_MODE (value
), op1
, op2
, target
, 1);
6249 if (!INTEGRAL_MODE_P (GET_MODE (value
)))
6250 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
6251 target
, 1, OPTAB_LIB_WIDEN
);
6253 return expand_divmod (0,
6254 FLOAT_MODE_P (GET_MODE (value
))
6255 ? RDIV_EXPR
: TRUNC_DIV_EXPR
,
6256 GET_MODE (value
), op1
, op2
, target
, 0);
6258 return expand_divmod (1, TRUNC_MOD_EXPR
, GET_MODE (value
), op1
, op2
,
6261 return expand_divmod (0, TRUNC_DIV_EXPR
, GET_MODE (value
), op1
, op2
,
6264 return expand_divmod (1, TRUNC_MOD_EXPR
, GET_MODE (value
), op1
, op2
,
6267 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
6268 target
, 0, OPTAB_LIB_WIDEN
);
6270 return expand_simple_binop (GET_MODE (value
), code
, op1
, op2
,
6271 target
, 1, OPTAB_LIB_WIDEN
);
6274 if (UNARY_P (value
))
6277 target
= gen_reg_rtx (GET_MODE (value
));
6278 op1
= force_operand (XEXP (value
, 0), NULL_RTX
);
6285 case FLOAT_TRUNCATE
:
6286 convert_move (target
, op1
, code
== ZERO_EXTEND
);
6291 expand_fix (target
, op1
, code
== UNSIGNED_FIX
);
6295 case UNSIGNED_FLOAT
:
6296 expand_float (target
, op1
, code
== UNSIGNED_FLOAT
);
6300 return expand_simple_unop (GET_MODE (value
), code
, op1
, target
, 0);
6304 #ifdef INSN_SCHEDULING
6305 /* On machines that have insn scheduling, we want all memory reference to be
6306 explicit, so we need to deal with such paradoxical SUBREGs. */
6307 if (GET_CODE (value
) == SUBREG
&& MEM_P (SUBREG_REG (value
))
6308 && (GET_MODE_SIZE (GET_MODE (value
))
6309 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (value
)))))
6311 = simplify_gen_subreg (GET_MODE (value
),
6312 force_reg (GET_MODE (SUBREG_REG (value
)),
6313 force_operand (SUBREG_REG (value
),
6315 GET_MODE (SUBREG_REG (value
)),
6316 SUBREG_BYTE (value
));
6322 /* Subroutine of expand_expr: return nonzero iff there is no way that
6323 EXP can reference X, which is being modified. TOP_P is nonzero if this
6324 call is going to be used to determine whether we need a temporary
6325 for EXP, as opposed to a recursive call to this function.
6327 It is always safe for this routine to return zero since it merely
6328 searches for optimization opportunities. */
6331 safe_from_p (const_rtx x
, tree exp
, int top_p
)
6337 /* If EXP has varying size, we MUST use a target since we currently
6338 have no way of allocating temporaries of variable size
6339 (except for arrays that have TYPE_ARRAY_MAX_SIZE set).
6340 So we assume here that something at a higher level has prevented a
6341 clash. This is somewhat bogus, but the best we can do. Only
6342 do this when X is BLKmode and when we are at the top level. */
6343 || (top_p
&& TREE_TYPE (exp
) != 0 && COMPLETE_TYPE_P (TREE_TYPE (exp
))
6344 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) != INTEGER_CST
6345 && (TREE_CODE (TREE_TYPE (exp
)) != ARRAY_TYPE
6346 || TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)) == NULL_TREE
6347 || TREE_CODE (TYPE_ARRAY_MAX_SIZE (TREE_TYPE (exp
)))
6349 && GET_MODE (x
) == BLKmode
)
6350 /* If X is in the outgoing argument area, it is always safe. */
6352 && (XEXP (x
, 0) == virtual_outgoing_args_rtx
6353 || (GET_CODE (XEXP (x
, 0)) == PLUS
6354 && XEXP (XEXP (x
, 0), 0) == virtual_outgoing_args_rtx
))))
6357 /* If this is a subreg of a hard register, declare it unsafe, otherwise,
6358 find the underlying pseudo. */
6359 if (GET_CODE (x
) == SUBREG
)
6362 if (REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
6366 /* Now look at our tree code and possibly recurse. */
6367 switch (TREE_CODE_CLASS (TREE_CODE (exp
)))
6369 case tcc_declaration
:
6370 exp_rtl
= DECL_RTL_IF_SET (exp
);
6376 case tcc_exceptional
:
6377 if (TREE_CODE (exp
) == TREE_LIST
)
6381 if (TREE_VALUE (exp
) && !safe_from_p (x
, TREE_VALUE (exp
), 0))
6383 exp
= TREE_CHAIN (exp
);
6386 if (TREE_CODE (exp
) != TREE_LIST
)
6387 return safe_from_p (x
, exp
, 0);
6390 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
6392 constructor_elt
*ce
;
6393 unsigned HOST_WIDE_INT idx
;
6396 VEC_iterate (constructor_elt
, CONSTRUCTOR_ELTS (exp
), idx
, ce
);
6398 if ((ce
->index
!= NULL_TREE
&& !safe_from_p (x
, ce
->index
, 0))
6399 || !safe_from_p (x
, ce
->value
, 0))
6403 else if (TREE_CODE (exp
) == ERROR_MARK
)
6404 return 1; /* An already-visited SAVE_EXPR? */
6409 /* The only case we look at here is the DECL_INITIAL inside a
6411 return (TREE_CODE (exp
) != DECL_EXPR
6412 || TREE_CODE (DECL_EXPR_DECL (exp
)) != VAR_DECL
6413 || !DECL_INITIAL (DECL_EXPR_DECL (exp
))
6414 || safe_from_p (x
, DECL_INITIAL (DECL_EXPR_DECL (exp
)), 0));
6417 case tcc_comparison
:
6418 if (!safe_from_p (x
, TREE_OPERAND (exp
, 1), 0))
6423 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
6425 case tcc_expression
:
6428 /* Now do code-specific tests. EXP_RTL is set to any rtx we find in
6429 the expression. If it is set, we conflict iff we are that rtx or
6430 both are in memory. Otherwise, we check all operands of the
6431 expression recursively. */
6433 switch (TREE_CODE (exp
))
6436 /* If the operand is static or we are static, we can't conflict.
6437 Likewise if we don't conflict with the operand at all. */
6438 if (staticp (TREE_OPERAND (exp
, 0))
6439 || TREE_STATIC (exp
)
6440 || safe_from_p (x
, TREE_OPERAND (exp
, 0), 0))
6443 /* Otherwise, the only way this can conflict is if we are taking
6444 the address of a DECL a that address if part of X, which is
6446 exp
= TREE_OPERAND (exp
, 0);
6449 if (!DECL_RTL_SET_P (exp
)
6450 || !MEM_P (DECL_RTL (exp
)))
6453 exp_rtl
= XEXP (DECL_RTL (exp
), 0);
6457 case MISALIGNED_INDIRECT_REF
:
6458 case ALIGN_INDIRECT_REF
:
6461 && alias_sets_conflict_p (MEM_ALIAS_SET (x
),
6462 get_alias_set (exp
)))
6467 /* Assume that the call will clobber all hard registers and
6469 if ((REG_P (x
) && REGNO (x
) < FIRST_PSEUDO_REGISTER
)
6474 case WITH_CLEANUP_EXPR
:
6475 case CLEANUP_POINT_EXPR
:
6476 /* Lowered by gimplify.c. */
6480 return safe_from_p (x
, TREE_OPERAND (exp
, 0), 0);
6486 /* If we have an rtx, we do not need to scan our operands. */
6490 nops
= TREE_OPERAND_LENGTH (exp
);
6491 for (i
= 0; i
< nops
; i
++)
6492 if (TREE_OPERAND (exp
, i
) != 0
6493 && ! safe_from_p (x
, TREE_OPERAND (exp
, i
), 0))
6499 /* Should never get a type here. */
6502 case tcc_gimple_stmt
:
6506 /* If we have an rtl, find any enclosed object. Then see if we conflict
6510 if (GET_CODE (exp_rtl
) == SUBREG
)
6512 exp_rtl
= SUBREG_REG (exp_rtl
);
6514 && REGNO (exp_rtl
) < FIRST_PSEUDO_REGISTER
)
6518 /* If the rtl is X, then it is not safe. Otherwise, it is unless both
6519 are memory and they conflict. */
6520 return ! (rtx_equal_p (x
, exp_rtl
)
6521 || (MEM_P (x
) && MEM_P (exp_rtl
)
6522 && true_dependence (exp_rtl
, VOIDmode
, x
,
6523 rtx_addr_varies_p
)));
6526 /* If we reach here, it is safe. */
6531 /* Return the highest power of two that EXP is known to be a multiple of.
6532 This is used in updating alignment of MEMs in array references. */
6534 unsigned HOST_WIDE_INT
6535 highest_pow2_factor (const_tree exp
)
6537 unsigned HOST_WIDE_INT c0
, c1
;
6539 switch (TREE_CODE (exp
))
6542 /* We can find the lowest bit that's a one. If the low
6543 HOST_BITS_PER_WIDE_INT bits are zero, return BIGGEST_ALIGNMENT.
6544 We need to handle this case since we can find it in a COND_EXPR,
6545 a MIN_EXPR, or a MAX_EXPR. If the constant overflows, we have an
6546 erroneous program, so return BIGGEST_ALIGNMENT to avoid any
6548 if (TREE_OVERFLOW (exp
))
6549 return BIGGEST_ALIGNMENT
;
6552 /* Note: tree_low_cst is intentionally not used here,
6553 we don't care about the upper bits. */
6554 c0
= TREE_INT_CST_LOW (exp
);
6556 return c0
? c0
: BIGGEST_ALIGNMENT
;
6560 case PLUS_EXPR
: case MINUS_EXPR
: case MIN_EXPR
: case MAX_EXPR
:
6561 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
6562 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
6563 return MIN (c0
, c1
);
6566 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
6567 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
6570 case ROUND_DIV_EXPR
: case TRUNC_DIV_EXPR
: case FLOOR_DIV_EXPR
:
6572 if (integer_pow2p (TREE_OPERAND (exp
, 1))
6573 && host_integerp (TREE_OPERAND (exp
, 1), 1))
6575 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 0));
6576 c1
= tree_low_cst (TREE_OPERAND (exp
, 1), 1);
6577 return MAX (1, c0
/ c1
);
6581 case NON_LVALUE_EXPR
: case NOP_EXPR
: case CONVERT_EXPR
:
6583 return highest_pow2_factor (TREE_OPERAND (exp
, 0));
6586 return highest_pow2_factor (TREE_OPERAND (exp
, 1));
6589 c0
= highest_pow2_factor (TREE_OPERAND (exp
, 1));
6590 c1
= highest_pow2_factor (TREE_OPERAND (exp
, 2));
6591 return MIN (c0
, c1
);
6600 /* Similar, except that the alignment requirements of TARGET are
6601 taken into account. Assume it is at least as aligned as its
6602 type, unless it is a COMPONENT_REF in which case the layout of
6603 the structure gives the alignment. */
6605 static unsigned HOST_WIDE_INT
6606 highest_pow2_factor_for_target (const_tree target
, const_tree exp
)
6608 unsigned HOST_WIDE_INT target_align
, factor
;
6610 factor
= highest_pow2_factor (exp
);
6611 if (TREE_CODE (target
) == COMPONENT_REF
)
6612 target_align
= DECL_ALIGN_UNIT (TREE_OPERAND (target
, 1));
6614 target_align
= TYPE_ALIGN_UNIT (TREE_TYPE (target
));
6615 return MAX (factor
, target_align
);
6618 /* Return &VAR expression for emulated thread local VAR. */
6621 emutls_var_address (tree var
)
6623 tree emuvar
= emutls_decl (var
);
6624 tree fn
= built_in_decls
[BUILT_IN_EMUTLS_GET_ADDRESS
];
6625 tree arg
= build_fold_addr_expr_with_type (emuvar
, ptr_type_node
);
6626 tree arglist
= build_tree_list (NULL_TREE
, arg
);
6627 tree call
= build_function_call_expr (fn
, arglist
);
6628 return fold_convert (build_pointer_type (TREE_TYPE (var
)), call
);
6631 /* Expands variable VAR. */
6634 expand_var (tree var
)
6636 if (DECL_EXTERNAL (var
))
6639 if (TREE_STATIC (var
))
6640 /* If this is an inlined copy of a static local variable,
6641 look up the original decl. */
6642 var
= DECL_ORIGIN (var
);
6644 if (TREE_STATIC (var
)
6645 ? !TREE_ASM_WRITTEN (var
)
6646 : !DECL_RTL_SET_P (var
))
6648 if (TREE_CODE (var
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (var
))
6649 /* Should be ignored. */;
6650 else if (lang_hooks
.expand_decl (var
))
6652 else if (TREE_CODE (var
) == VAR_DECL
&& !TREE_STATIC (var
))
6654 else if (TREE_CODE (var
) == VAR_DECL
&& TREE_STATIC (var
))
6655 rest_of_decl_compilation (var
, 0, 0);
6657 /* No expansion needed. */
6658 gcc_assert (TREE_CODE (var
) == TYPE_DECL
6659 || TREE_CODE (var
) == CONST_DECL
6660 || TREE_CODE (var
) == FUNCTION_DECL
6661 || TREE_CODE (var
) == LABEL_DECL
);
6665 /* Subroutine of expand_expr. Expand the two operands of a binary
6666 expression EXP0 and EXP1 placing the results in OP0 and OP1.
6667 The value may be stored in TARGET if TARGET is nonzero. The
6668 MODIFIER argument is as documented by expand_expr. */
6671 expand_operands (tree exp0
, tree exp1
, rtx target
, rtx
*op0
, rtx
*op1
,
6672 enum expand_modifier modifier
)
6674 if (! safe_from_p (target
, exp1
, 1))
6676 if (operand_equal_p (exp0
, exp1
, 0))
6678 *op0
= expand_expr (exp0
, target
, VOIDmode
, modifier
);
6679 *op1
= copy_rtx (*op0
);
6683 /* If we need to preserve evaluation order, copy exp0 into its own
6684 temporary variable so that it can't be clobbered by exp1. */
6685 if (flag_evaluation_order
&& TREE_SIDE_EFFECTS (exp1
))
6686 exp0
= save_expr (exp0
);
6687 *op0
= expand_expr (exp0
, target
, VOIDmode
, modifier
);
6688 *op1
= expand_expr (exp1
, NULL_RTX
, VOIDmode
, modifier
);
6693 /* Return a MEM that contains constant EXP. DEFER is as for
6694 output_constant_def and MODIFIER is as for expand_expr. */
6697 expand_expr_constant (tree exp
, int defer
, enum expand_modifier modifier
)
6701 mem
= output_constant_def (exp
, defer
);
6702 if (modifier
!= EXPAND_INITIALIZER
)
6703 mem
= use_anchored_address (mem
);
6707 /* A subroutine of expand_expr_addr_expr. Evaluate the address of EXP.
6708 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6711 expand_expr_addr_expr_1 (tree exp
, rtx target
, enum machine_mode tmode
,
6712 enum expand_modifier modifier
)
6714 rtx result
, subtarget
;
6716 HOST_WIDE_INT bitsize
, bitpos
;
6717 int volatilep
, unsignedp
;
6718 enum machine_mode mode1
;
6720 /* If we are taking the address of a constant and are at the top level,
6721 we have to use output_constant_def since we can't call force_const_mem
6723 /* ??? This should be considered a front-end bug. We should not be
6724 generating ADDR_EXPR of something that isn't an LVALUE. The only
6725 exception here is STRING_CST. */
6726 if (TREE_CODE (exp
) == CONSTRUCTOR
6727 || CONSTANT_CLASS_P (exp
))
6728 return XEXP (expand_expr_constant (exp
, 0, modifier
), 0);
6730 /* Everything must be something allowed by is_gimple_addressable. */
6731 switch (TREE_CODE (exp
))
6734 /* This case will happen via recursion for &a->b. */
6735 return expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
, modifier
);
6738 /* Recurse and make the output_constant_def clause above handle this. */
6739 return expand_expr_addr_expr_1 (DECL_INITIAL (exp
), target
,
6743 /* The real part of the complex number is always first, therefore
6744 the address is the same as the address of the parent object. */
6747 inner
= TREE_OPERAND (exp
, 0);
6751 /* The imaginary part of the complex number is always second.
6752 The expression is therefore always offset by the size of the
6755 bitpos
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (exp
)));
6756 inner
= TREE_OPERAND (exp
, 0);
6760 /* TLS emulation hook - replace __thread VAR's &VAR with
6761 __emutls_get_address (&_emutls.VAR). */
6762 if (! targetm
.have_tls
6763 && TREE_CODE (exp
) == VAR_DECL
6764 && DECL_THREAD_LOCAL_P (exp
))
6766 exp
= emutls_var_address (exp
);
6767 return expand_expr (exp
, target
, tmode
, modifier
);
6772 /* If the object is a DECL, then expand it for its rtl. Don't bypass
6773 expand_expr, as that can have various side effects; LABEL_DECLs for
6774 example, may not have their DECL_RTL set yet. Assume language
6775 specific tree nodes can be expanded in some interesting way. */
6777 || TREE_CODE (exp
) >= LAST_AND_UNUSED_TREE_CODE
)
6779 result
= expand_expr (exp
, target
, tmode
,
6780 modifier
== EXPAND_INITIALIZER
6781 ? EXPAND_INITIALIZER
: EXPAND_CONST_ADDRESS
);
6783 /* If the DECL isn't in memory, then the DECL wasn't properly
6784 marked TREE_ADDRESSABLE, which will be either a front-end
6785 or a tree optimizer bug. */
6786 gcc_assert (MEM_P (result
));
6787 result
= XEXP (result
, 0);
6789 /* ??? Is this needed anymore? */
6790 if (DECL_P (exp
) && !TREE_USED (exp
) == 0)
6792 assemble_external (exp
);
6793 TREE_USED (exp
) = 1;
6796 if (modifier
!= EXPAND_INITIALIZER
6797 && modifier
!= EXPAND_CONST_ADDRESS
)
6798 result
= force_operand (result
, target
);
6802 /* Pass FALSE as the last argument to get_inner_reference although
6803 we are expanding to RTL. The rationale is that we know how to
6804 handle "aligning nodes" here: we can just bypass them because
6805 they won't change the final object whose address will be returned
6806 (they actually exist only for that purpose). */
6807 inner
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
6808 &mode1
, &unsignedp
, &volatilep
, false);
6812 /* We must have made progress. */
6813 gcc_assert (inner
!= exp
);
6815 subtarget
= offset
|| bitpos
? NULL_RTX
: target
;
6816 result
= expand_expr_addr_expr_1 (inner
, subtarget
, tmode
, modifier
);
6822 if (modifier
!= EXPAND_NORMAL
)
6823 result
= force_operand (result
, NULL
);
6824 tmp
= expand_expr (offset
, NULL_RTX
, tmode
,
6825 modifier
== EXPAND_INITIALIZER
6826 ? EXPAND_INITIALIZER
: EXPAND_NORMAL
);
6828 result
= convert_memory_address (tmode
, result
);
6829 tmp
= convert_memory_address (tmode
, tmp
);
6831 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
6832 result
= gen_rtx_PLUS (tmode
, result
, tmp
);
6835 subtarget
= bitpos
? NULL_RTX
: target
;
6836 result
= expand_simple_binop (tmode
, PLUS
, result
, tmp
, subtarget
,
6837 1, OPTAB_LIB_WIDEN
);
6843 /* Someone beforehand should have rejected taking the address
6844 of such an object. */
6845 gcc_assert ((bitpos
% BITS_PER_UNIT
) == 0);
6847 result
= plus_constant (result
, bitpos
/ BITS_PER_UNIT
);
6848 if (modifier
< EXPAND_SUM
)
6849 result
= force_operand (result
, target
);
6855 /* A subroutine of expand_expr. Evaluate EXP, which is an ADDR_EXPR.
6856 The TARGET, TMODE and MODIFIER arguments are as for expand_expr. */
6859 expand_expr_addr_expr (tree exp
, rtx target
, enum machine_mode tmode
,
6860 enum expand_modifier modifier
)
6862 enum machine_mode rmode
;
6865 /* Target mode of VOIDmode says "whatever's natural". */
6866 if (tmode
== VOIDmode
)
6867 tmode
= TYPE_MODE (TREE_TYPE (exp
));
6869 /* We can get called with some Weird Things if the user does silliness
6870 like "(short) &a". In that case, convert_memory_address won't do
6871 the right thing, so ignore the given target mode. */
6872 if (tmode
!= Pmode
&& tmode
!= ptr_mode
)
6875 result
= expand_expr_addr_expr_1 (TREE_OPERAND (exp
, 0), target
,
6878 /* Despite expand_expr claims concerning ignoring TMODE when not
6879 strictly convenient, stuff breaks if we don't honor it. Note
6880 that combined with the above, we only do this for pointer modes. */
6881 rmode
= GET_MODE (result
);
6882 if (rmode
== VOIDmode
)
6885 result
= convert_memory_address (tmode
, result
);
6891 /* expand_expr: generate code for computing expression EXP.
6892 An rtx for the computed value is returned. The value is never null.
6893 In the case of a void EXP, const0_rtx is returned.
6895 The value may be stored in TARGET if TARGET is nonzero.
6896 TARGET is just a suggestion; callers must assume that
6897 the rtx returned may not be the same as TARGET.
6899 If TARGET is CONST0_RTX, it means that the value will be ignored.
6901 If TMODE is not VOIDmode, it suggests generating the
6902 result in mode TMODE. But this is done only when convenient.
6903 Otherwise, TMODE is ignored and the value generated in its natural mode.
6904 TMODE is just a suggestion; callers must assume that
6905 the rtx returned may not have mode TMODE.
6907 Note that TARGET may have neither TMODE nor MODE. In that case, it
6908 probably will not be used.
6910 If MODIFIER is EXPAND_SUM then when EXP is an addition
6911 we can return an rtx of the form (MULT (REG ...) (CONST_INT ...))
6912 or a nest of (PLUS ...) and (MINUS ...) where the terms are
6913 products as above, or REG or MEM, or constant.
6914 Ordinarily in such cases we would output mul or add instructions
6915 and then return a pseudo reg containing the sum.
6917 EXPAND_INITIALIZER is much like EXPAND_SUM except that
6918 it also marks a label as absolutely required (it can't be dead).
6919 It also makes a ZERO_EXTEND or SIGN_EXTEND instead of emitting extend insns.
6920 This is used for outputting expressions used in initializers.
6922 EXPAND_CONST_ADDRESS says that it is okay to return a MEM
6923 with a constant address even if that address is not normally legitimate.
6924 EXPAND_INITIALIZER and EXPAND_SUM also have this effect.
6926 EXPAND_STACK_PARM is used when expanding to a TARGET on the stack for
6927 a call parameter. Such targets require special care as we haven't yet
6928 marked TARGET so that it's safe from being trashed by libcalls. We
6929 don't want to use TARGET for anything but the final result;
6930 Intermediate values must go elsewhere. Additionally, calls to
6931 emit_block_move will be flagged with BLOCK_OP_CALL_PARM.
6933 If EXP is a VAR_DECL whose DECL_RTL was a MEM with an invalid
6934 address, and ALT_RTL is non-NULL, then *ALT_RTL is set to the
6935 DECL_RTL of the VAR_DECL. *ALT_RTL is also set if EXP is a
6936 COMPOUND_EXPR whose second argument is such a VAR_DECL, and so on
6939 static rtx
expand_expr_real_1 (tree
, rtx
, enum machine_mode
,
6940 enum expand_modifier
, rtx
*);
6943 expand_expr_real (tree exp
, rtx target
, enum machine_mode tmode
,
6944 enum expand_modifier modifier
, rtx
*alt_rtl
)
6947 rtx ret
, last
= NULL
;
6949 /* Handle ERROR_MARK before anybody tries to access its type. */
6950 if (TREE_CODE (exp
) == ERROR_MARK
6951 || (!GIMPLE_TUPLE_P (exp
) && TREE_CODE (TREE_TYPE (exp
)) == ERROR_MARK
))
6953 ret
= CONST0_RTX (tmode
);
6954 return ret
? ret
: const0_rtx
;
6957 if (flag_non_call_exceptions
)
6959 rn
= lookup_stmt_eh_region (exp
);
6960 /* If rn < 0, then either (1) tree-ssa not used or (2) doesn't throw. */
6962 last
= get_last_insn ();
6965 /* If this is an expression of some kind and it has an associated line
6966 number, then emit the line number before expanding the expression.
6968 We need to save and restore the file and line information so that
6969 errors discovered during expansion are emitted with the right
6970 information. It would be better of the diagnostic routines
6971 used the file/line information embedded in the tree nodes rather
6973 if (cfun
&& EXPR_HAS_LOCATION (exp
))
6975 location_t saved_location
= input_location
;
6976 input_location
= EXPR_LOCATION (exp
);
6977 set_curr_insn_source_location (input_location
);
6979 /* Record where the insns produced belong. */
6980 set_curr_insn_block (TREE_BLOCK (exp
));
6982 ret
= expand_expr_real_1 (exp
, target
, tmode
, modifier
, alt_rtl
);
6984 input_location
= saved_location
;
6988 ret
= expand_expr_real_1 (exp
, target
, tmode
, modifier
, alt_rtl
);
6991 /* If using non-call exceptions, mark all insns that may trap.
6992 expand_call() will mark CALL_INSNs before we get to this code,
6993 but it doesn't handle libcalls, and these may trap. */
6997 for (insn
= next_real_insn (last
); insn
;
6998 insn
= next_real_insn (insn
))
7000 if (! find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
)
7001 /* If we want exceptions for non-call insns, any
7002 may_trap_p instruction may throw. */
7003 && GET_CODE (PATTERN (insn
)) != CLOBBER
7004 && GET_CODE (PATTERN (insn
)) != USE
7005 && (CALL_P (insn
) || may_trap_p (PATTERN (insn
))))
7007 REG_NOTES (insn
) = alloc_EXPR_LIST (REG_EH_REGION
, GEN_INT (rn
),
7017 expand_expr_real_1 (tree exp
, rtx target
, enum machine_mode tmode
,
7018 enum expand_modifier modifier
, rtx
*alt_rtl
)
7020 rtx op0
, op1
, op2
, temp
, decl_rtl
;
7023 enum machine_mode mode
;
7024 enum tree_code code
= TREE_CODE (exp
);
7026 rtx subtarget
, original_target
;
7028 tree context
, subexp0
, subexp1
;
7029 bool reduce_bit_field
= false;
7030 #define REDUCE_BIT_FIELD(expr) (reduce_bit_field && !ignore \
7031 ? reduce_to_bit_field_precision ((expr), \
7036 if (GIMPLE_STMT_P (exp
))
7038 type
= void_type_node
;
7044 type
= TREE_TYPE (exp
);
7045 mode
= TYPE_MODE (type
);
7046 unsignedp
= TYPE_UNSIGNED (type
);
7048 if (lang_hooks
.reduce_bit_field_operations
7049 && TREE_CODE (type
) == INTEGER_TYPE
7050 && GET_MODE_PRECISION (mode
) > TYPE_PRECISION (type
))
7052 /* An operation in what may be a bit-field type needs the
7053 result to be reduced to the precision of the bit-field type,
7054 which is narrower than that of the type's mode. */
7055 reduce_bit_field
= true;
7056 if (modifier
== EXPAND_STACK_PARM
)
7060 /* Use subtarget as the target for operand 0 of a binary operation. */
7061 subtarget
= get_subtarget (target
);
7062 original_target
= target
;
7063 ignore
= (target
== const0_rtx
7064 || ((code
== NON_LVALUE_EXPR
|| code
== NOP_EXPR
7065 || code
== CONVERT_EXPR
|| code
== COND_EXPR
7066 || code
== VIEW_CONVERT_EXPR
)
7067 && TREE_CODE (type
) == VOID_TYPE
));
7069 /* If we are going to ignore this result, we need only do something
7070 if there is a side-effect somewhere in the expression. If there
7071 is, short-circuit the most common cases here. Note that we must
7072 not call expand_expr with anything but const0_rtx in case this
7073 is an initial expansion of a size that contains a PLACEHOLDER_EXPR. */
7077 if (! TREE_SIDE_EFFECTS (exp
))
7080 /* Ensure we reference a volatile object even if value is ignored, but
7081 don't do this if all we are doing is taking its address. */
7082 if (TREE_THIS_VOLATILE (exp
)
7083 && TREE_CODE (exp
) != FUNCTION_DECL
7084 && mode
!= VOIDmode
&& mode
!= BLKmode
7085 && modifier
!= EXPAND_CONST_ADDRESS
)
7087 temp
= expand_expr (exp
, NULL_RTX
, VOIDmode
, modifier
);
7089 temp
= copy_to_reg (temp
);
7093 if (TREE_CODE_CLASS (code
) == tcc_unary
7094 || code
== COMPONENT_REF
|| code
== INDIRECT_REF
)
7095 return expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
,
7098 else if (TREE_CODE_CLASS (code
) == tcc_binary
7099 || TREE_CODE_CLASS (code
) == tcc_comparison
7100 || code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
7102 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, modifier
);
7103 expand_expr (TREE_OPERAND (exp
, 1), const0_rtx
, VOIDmode
, modifier
);
7106 else if (code
== BIT_FIELD_REF
)
7108 expand_expr (TREE_OPERAND (exp
, 0), const0_rtx
, VOIDmode
, modifier
);
7109 expand_expr (TREE_OPERAND (exp
, 1), const0_rtx
, VOIDmode
, modifier
);
7110 expand_expr (TREE_OPERAND (exp
, 2), const0_rtx
, VOIDmode
, modifier
);
7122 tree function
= decl_function_context (exp
);
7124 temp
= label_rtx (exp
);
7125 temp
= gen_rtx_LABEL_REF (Pmode
, temp
);
7127 if (function
!= current_function_decl
7129 LABEL_REF_NONLOCAL_P (temp
) = 1;
7131 temp
= gen_rtx_MEM (FUNCTION_MODE
, temp
);
7136 return expand_expr_real_1 (SSA_NAME_VAR (exp
), target
, tmode
, modifier
,
7141 /* If a static var's type was incomplete when the decl was written,
7142 but the type is complete now, lay out the decl now. */
7143 if (DECL_SIZE (exp
) == 0
7144 && COMPLETE_OR_UNBOUND_ARRAY_TYPE_P (TREE_TYPE (exp
))
7145 && (TREE_STATIC (exp
) || DECL_EXTERNAL (exp
)))
7146 layout_decl (exp
, 0);
7148 /* TLS emulation hook - replace __thread vars with
7149 *__emutls_get_address (&_emutls.var). */
7150 if (! targetm
.have_tls
7151 && TREE_CODE (exp
) == VAR_DECL
7152 && DECL_THREAD_LOCAL_P (exp
))
7154 exp
= build_fold_indirect_ref (emutls_var_address (exp
));
7155 return expand_expr_real_1 (exp
, target
, tmode
, modifier
, NULL
);
7158 /* ... fall through ... */
7162 decl_rtl
= DECL_RTL (exp
);
7163 gcc_assert (decl_rtl
);
7164 decl_rtl
= copy_rtx (decl_rtl
);
7166 /* Ensure variable marked as used even if it doesn't go through
7167 a parser. If it hasn't be used yet, write out an external
7169 if (! TREE_USED (exp
))
7171 assemble_external (exp
);
7172 TREE_USED (exp
) = 1;
7175 /* Show we haven't gotten RTL for this yet. */
7178 /* Variables inherited from containing functions should have
7179 been lowered by this point. */
7180 context
= decl_function_context (exp
);
7181 gcc_assert (!context
7182 || context
== current_function_decl
7183 || TREE_STATIC (exp
)
7184 /* ??? C++ creates functions that are not TREE_STATIC. */
7185 || TREE_CODE (exp
) == FUNCTION_DECL
);
7187 /* This is the case of an array whose size is to be determined
7188 from its initializer, while the initializer is still being parsed.
7191 if (MEM_P (decl_rtl
) && REG_P (XEXP (decl_rtl
, 0)))
7192 temp
= validize_mem (decl_rtl
);
7194 /* If DECL_RTL is memory, we are in the normal case and either
7195 the address is not valid or it is not a register and -fforce-addr
7196 is specified, get the address into a register. */
7198 else if (MEM_P (decl_rtl
) && modifier
!= EXPAND_INITIALIZER
)
7201 *alt_rtl
= decl_rtl
;
7202 decl_rtl
= use_anchored_address (decl_rtl
);
7203 if (modifier
!= EXPAND_CONST_ADDRESS
7204 && modifier
!= EXPAND_SUM
7205 && (!memory_address_p (DECL_MODE (exp
), XEXP (decl_rtl
, 0))
7206 || (flag_force_addr
&& !REG_P (XEXP (decl_rtl
, 0)))))
7207 temp
= replace_equiv_address (decl_rtl
,
7208 copy_rtx (XEXP (decl_rtl
, 0)));
7211 /* If we got something, return it. But first, set the alignment
7212 if the address is a register. */
7215 if (MEM_P (temp
) && REG_P (XEXP (temp
, 0)))
7216 mark_reg_pointer (XEXP (temp
, 0), DECL_ALIGN (exp
));
7221 /* If the mode of DECL_RTL does not match that of the decl, it
7222 must be a promoted value. We return a SUBREG of the wanted mode,
7223 but mark it so that we know that it was already extended. */
7225 if (REG_P (decl_rtl
)
7226 && GET_MODE (decl_rtl
) != DECL_MODE (exp
))
7228 enum machine_mode pmode
;
7230 /* Get the signedness used for this variable. Ensure we get the
7231 same mode we got when the variable was declared. */
7232 pmode
= promote_mode (type
, DECL_MODE (exp
), &unsignedp
,
7233 (TREE_CODE (exp
) == RESULT_DECL
7234 || TREE_CODE (exp
) == PARM_DECL
) ? 1 : 0);
7235 gcc_assert (GET_MODE (decl_rtl
) == pmode
);
7237 temp
= gen_lowpart_SUBREG (mode
, decl_rtl
);
7238 SUBREG_PROMOTED_VAR_P (temp
) = 1;
7239 SUBREG_PROMOTED_UNSIGNED_SET (temp
, unsignedp
);
7246 temp
= immed_double_const (TREE_INT_CST_LOW (exp
),
7247 TREE_INT_CST_HIGH (exp
), mode
);
7253 tree tmp
= NULL_TREE
;
7254 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_INT
7255 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FLOAT
7256 || GET_MODE_CLASS (mode
) == MODE_VECTOR_FRACT
7257 || GET_MODE_CLASS (mode
) == MODE_VECTOR_UFRACT
7258 || GET_MODE_CLASS (mode
) == MODE_VECTOR_ACCUM
7259 || GET_MODE_CLASS (mode
) == MODE_VECTOR_UACCUM
)
7260 return const_vector_from_tree (exp
);
7261 if (GET_MODE_CLASS (mode
) == MODE_INT
)
7263 tree type_for_mode
= lang_hooks
.types
.type_for_mode (mode
, 1);
7265 tmp
= fold_unary (VIEW_CONVERT_EXPR
, type_for_mode
, exp
);
7268 tmp
= build_constructor_from_list (type
,
7269 TREE_VECTOR_CST_ELTS (exp
));
7270 return expand_expr (tmp
, ignore
? const0_rtx
: target
,
7275 return expand_expr (DECL_INITIAL (exp
), target
, VOIDmode
, modifier
);
7278 /* If optimized, generate immediate CONST_DOUBLE
7279 which will be turned into memory by reload if necessary.
7281 We used to force a register so that loop.c could see it. But
7282 this does not allow gen_* patterns to perform optimizations with
7283 the constants. It also produces two insns in cases like "x = 1.0;".
7284 On most machines, floating-point constants are not permitted in
7285 many insns, so we'd end up copying it to a register in any case.
7287 Now, we do the copying in expand_binop, if appropriate. */
7288 return CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (exp
),
7289 TYPE_MODE (TREE_TYPE (exp
)));
7292 return CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (exp
),
7293 TYPE_MODE (TREE_TYPE (exp
)));
7296 /* Handle evaluating a complex constant in a CONCAT target. */
7297 if (original_target
&& GET_CODE (original_target
) == CONCAT
)
7299 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (TREE_TYPE (exp
)));
7302 rtarg
= XEXP (original_target
, 0);
7303 itarg
= XEXP (original_target
, 1);
7305 /* Move the real and imaginary parts separately. */
7306 op0
= expand_expr (TREE_REALPART (exp
), rtarg
, mode
, EXPAND_NORMAL
);
7307 op1
= expand_expr (TREE_IMAGPART (exp
), itarg
, mode
, EXPAND_NORMAL
);
7310 emit_move_insn (rtarg
, op0
);
7312 emit_move_insn (itarg
, op1
);
7314 return original_target
;
7317 /* ... fall through ... */
7320 temp
= expand_expr_constant (exp
, 1, modifier
);
7322 /* temp contains a constant address.
7323 On RISC machines where a constant address isn't valid,
7324 make some insns to get that address into a register. */
7325 if (modifier
!= EXPAND_CONST_ADDRESS
7326 && modifier
!= EXPAND_INITIALIZER
7327 && modifier
!= EXPAND_SUM
7328 && (! memory_address_p (mode
, XEXP (temp
, 0))
7329 || flag_force_addr
))
7330 return replace_equiv_address (temp
,
7331 copy_rtx (XEXP (temp
, 0)));
7336 tree val
= TREE_OPERAND (exp
, 0);
7337 rtx ret
= expand_expr_real_1 (val
, target
, tmode
, modifier
, alt_rtl
);
7339 if (!SAVE_EXPR_RESOLVED_P (exp
))
7341 /* We can indeed still hit this case, typically via builtin
7342 expanders calling save_expr immediately before expanding
7343 something. Assume this means that we only have to deal
7344 with non-BLKmode values. */
7345 gcc_assert (GET_MODE (ret
) != BLKmode
);
7347 val
= build_decl (VAR_DECL
, NULL
, TREE_TYPE (exp
));
7348 DECL_ARTIFICIAL (val
) = 1;
7349 DECL_IGNORED_P (val
) = 1;
7350 TREE_OPERAND (exp
, 0) = val
;
7351 SAVE_EXPR_RESOLVED_P (exp
) = 1;
7353 if (!CONSTANT_P (ret
))
7354 ret
= copy_to_reg (ret
);
7355 SET_DECL_RTL (val
, ret
);
7362 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == LABEL_DECL
)
7363 expand_goto (TREE_OPERAND (exp
, 0));
7365 expand_computed_goto (TREE_OPERAND (exp
, 0));
7369 /* If we don't need the result, just ensure we evaluate any
7373 unsigned HOST_WIDE_INT idx
;
7376 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp
), idx
, value
)
7377 expand_expr (value
, const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
7382 /* Try to avoid creating a temporary at all. This is possible
7383 if all of the initializer is zero.
7384 FIXME: try to handle all [0..255] initializers we can handle
7386 else if (TREE_STATIC (exp
)
7387 && !TREE_ADDRESSABLE (exp
)
7388 && target
!= 0 && mode
== BLKmode
7389 && all_zeros_p (exp
))
7391 clear_storage (target
, expr_size (exp
), BLOCK_OP_NORMAL
);
7395 /* All elts simple constants => refer to a constant in memory. But
7396 if this is a non-BLKmode mode, let it store a field at a time
7397 since that should make a CONST_INT or CONST_DOUBLE when we
7398 fold. Likewise, if we have a target we can use, it is best to
7399 store directly into the target unless the type is large enough
7400 that memcpy will be used. If we are making an initializer and
7401 all operands are constant, put it in memory as well.
7403 FIXME: Avoid trying to fill vector constructors piece-meal.
7404 Output them with output_constant_def below unless we're sure
7405 they're zeros. This should go away when vector initializers
7406 are treated like VECTOR_CST instead of arrays.
7408 else if ((TREE_STATIC (exp
)
7409 && ((mode
== BLKmode
7410 && ! (target
!= 0 && safe_from_p (target
, exp
, 1)))
7411 || TREE_ADDRESSABLE (exp
)
7412 || (host_integerp (TYPE_SIZE_UNIT (type
), 1)
7413 && (! MOVE_BY_PIECES_P
7414 (tree_low_cst (TYPE_SIZE_UNIT (type
), 1),
7416 && ! mostly_zeros_p (exp
))))
7417 || ((modifier
== EXPAND_INITIALIZER
7418 || modifier
== EXPAND_CONST_ADDRESS
)
7419 && TREE_CONSTANT (exp
)))
7421 rtx constructor
= expand_expr_constant (exp
, 1, modifier
);
7423 if (modifier
!= EXPAND_CONST_ADDRESS
7424 && modifier
!= EXPAND_INITIALIZER
7425 && modifier
!= EXPAND_SUM
)
7426 constructor
= validize_mem (constructor
);
7432 /* Handle calls that pass values in multiple non-contiguous
7433 locations. The Irix 6 ABI has examples of this. */
7434 if (target
== 0 || ! safe_from_p (target
, exp
, 1)
7435 || GET_CODE (target
) == PARALLEL
7436 || modifier
== EXPAND_STACK_PARM
)
7438 = assign_temp (build_qualified_type (type
,
7440 | (TREE_READONLY (exp
)
7441 * TYPE_QUAL_CONST
))),
7442 0, TREE_ADDRESSABLE (exp
), 1);
7444 store_constructor (exp
, target
, 0, int_expr_size (exp
));
7448 case MISALIGNED_INDIRECT_REF
:
7449 case ALIGN_INDIRECT_REF
:
7452 tree exp1
= TREE_OPERAND (exp
, 0);
7454 if (modifier
!= EXPAND_WRITE
)
7458 t
= fold_read_from_constant_string (exp
);
7460 return expand_expr (t
, target
, tmode
, modifier
);
7463 op0
= expand_expr (exp1
, NULL_RTX
, VOIDmode
, EXPAND_SUM
);
7464 op0
= memory_address (mode
, op0
);
7466 if (code
== ALIGN_INDIRECT_REF
)
7468 int align
= TYPE_ALIGN_UNIT (type
);
7469 op0
= gen_rtx_AND (Pmode
, op0
, GEN_INT (-align
));
7470 op0
= memory_address (mode
, op0
);
7473 temp
= gen_rtx_MEM (mode
, op0
);
7475 set_mem_attributes (temp
, exp
, 0);
7477 /* Resolve the misalignment now, so that we don't have to remember
7478 to resolve it later. Of course, this only works for reads. */
7479 /* ??? When we get around to supporting writes, we'll have to handle
7480 this in store_expr directly. The vectorizer isn't generating
7481 those yet, however. */
7482 if (code
== MISALIGNED_INDIRECT_REF
)
7487 gcc_assert (modifier
== EXPAND_NORMAL
7488 || modifier
== EXPAND_STACK_PARM
);
7490 /* The vectorizer should have already checked the mode. */
7491 icode
= optab_handler (movmisalign_optab
, mode
)->insn_code
;
7492 gcc_assert (icode
!= CODE_FOR_nothing
);
7494 /* We've already validated the memory, and we're creating a
7495 new pseudo destination. The predicates really can't fail. */
7496 reg
= gen_reg_rtx (mode
);
7498 /* Nor can the insn generator. */
7499 insn
= GEN_FCN (icode
) (reg
, temp
);
7508 case TARGET_MEM_REF
:
7510 struct mem_address addr
;
7512 get_address_description (exp
, &addr
);
7513 op0
= addr_for_mem_ref (&addr
, true);
7514 op0
= memory_address (mode
, op0
);
7515 temp
= gen_rtx_MEM (mode
, op0
);
7516 set_mem_attributes (temp
, TMR_ORIGINAL (exp
), 0);
7523 tree array
= TREE_OPERAND (exp
, 0);
7524 tree index
= TREE_OPERAND (exp
, 1);
7526 /* Fold an expression like: "foo"[2].
7527 This is not done in fold so it won't happen inside &.
7528 Don't fold if this is for wide characters since it's too
7529 difficult to do correctly and this is a very rare case. */
7531 if (modifier
!= EXPAND_CONST_ADDRESS
7532 && modifier
!= EXPAND_INITIALIZER
7533 && modifier
!= EXPAND_MEMORY
)
7535 tree t
= fold_read_from_constant_string (exp
);
7538 return expand_expr (t
, target
, tmode
, modifier
);
7541 /* If this is a constant index into a constant array,
7542 just get the value from the array. Handle both the cases when
7543 we have an explicit constructor and when our operand is a variable
7544 that was declared const. */
7546 if (modifier
!= EXPAND_CONST_ADDRESS
7547 && modifier
!= EXPAND_INITIALIZER
7548 && modifier
!= EXPAND_MEMORY
7549 && TREE_CODE (array
) == CONSTRUCTOR
7550 && ! TREE_SIDE_EFFECTS (array
)
7551 && TREE_CODE (index
) == INTEGER_CST
)
7553 unsigned HOST_WIDE_INT ix
;
7556 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (array
), ix
,
7558 if (tree_int_cst_equal (field
, index
))
7560 if (!TREE_SIDE_EFFECTS (value
))
7561 return expand_expr (fold (value
), target
, tmode
, modifier
);
7566 else if (optimize
>= 1
7567 && modifier
!= EXPAND_CONST_ADDRESS
7568 && modifier
!= EXPAND_INITIALIZER
7569 && modifier
!= EXPAND_MEMORY
7570 && TREE_READONLY (array
) && ! TREE_SIDE_EFFECTS (array
)
7571 && TREE_CODE (array
) == VAR_DECL
&& DECL_INITIAL (array
)
7572 && TREE_CODE (DECL_INITIAL (array
)) != ERROR_MARK
7573 && targetm
.binds_local_p (array
))
7575 if (TREE_CODE (index
) == INTEGER_CST
)
7577 tree init
= DECL_INITIAL (array
);
7579 if (TREE_CODE (init
) == CONSTRUCTOR
)
7581 unsigned HOST_WIDE_INT ix
;
7584 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), ix
,
7586 if (tree_int_cst_equal (field
, index
))
7588 if (!TREE_SIDE_EFFECTS (value
))
7589 return expand_expr (fold (value
), target
, tmode
,
7594 else if(TREE_CODE (init
) == STRING_CST
)
7596 tree index1
= index
;
7597 tree low_bound
= array_ref_low_bound (exp
);
7598 index1
= fold_convert (sizetype
, TREE_OPERAND (exp
, 1));
7600 /* Optimize the special-case of a zero lower bound.
7602 We convert the low_bound to sizetype to avoid some problems
7603 with constant folding. (E.g. suppose the lower bound is 1,
7604 and its mode is QI. Without the conversion,l (ARRAY
7605 +(INDEX-(unsigned char)1)) becomes ((ARRAY+(-(unsigned char)1))
7606 +INDEX), which becomes (ARRAY+255+INDEX). Opps!) */
7608 if (! integer_zerop (low_bound
))
7609 index1
= size_diffop (index1
, fold_convert (sizetype
,
7612 if (0 > compare_tree_int (index1
,
7613 TREE_STRING_LENGTH (init
)))
7615 tree type
= TREE_TYPE (TREE_TYPE (init
));
7616 enum machine_mode mode
= TYPE_MODE (type
);
7618 if (GET_MODE_CLASS (mode
) == MODE_INT
7619 && GET_MODE_SIZE (mode
) == 1)
7620 return gen_int_mode (TREE_STRING_POINTER (init
)
7621 [TREE_INT_CST_LOW (index1
)],
7628 goto normal_inner_ref
;
7631 /* If the operand is a CONSTRUCTOR, we can just extract the
7632 appropriate field if it is present. */
7633 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == CONSTRUCTOR
)
7635 unsigned HOST_WIDE_INT idx
;
7638 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (TREE_OPERAND (exp
, 0)),
7640 if (field
== TREE_OPERAND (exp
, 1)
7641 /* We can normally use the value of the field in the
7642 CONSTRUCTOR. However, if this is a bitfield in
7643 an integral mode that we can fit in a HOST_WIDE_INT,
7644 we must mask only the number of bits in the bitfield,
7645 since this is done implicitly by the constructor. If
7646 the bitfield does not meet either of those conditions,
7647 we can't do this optimization. */
7648 && (! DECL_BIT_FIELD (field
)
7649 || ((GET_MODE_CLASS (DECL_MODE (field
)) == MODE_INT
)
7650 && (GET_MODE_BITSIZE (DECL_MODE (field
))
7651 <= HOST_BITS_PER_WIDE_INT
))))
7653 if (DECL_BIT_FIELD (field
)
7654 && modifier
== EXPAND_STACK_PARM
)
7656 op0
= expand_expr (value
, target
, tmode
, modifier
);
7657 if (DECL_BIT_FIELD (field
))
7659 HOST_WIDE_INT bitsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
7660 enum machine_mode imode
= TYPE_MODE (TREE_TYPE (field
));
7662 if (TYPE_UNSIGNED (TREE_TYPE (field
)))
7664 op1
= GEN_INT (((HOST_WIDE_INT
) 1 << bitsize
) - 1);
7665 op0
= expand_and (imode
, op0
, op1
, target
);
7670 = build_int_cst (NULL_TREE
,
7671 GET_MODE_BITSIZE (imode
) - bitsize
);
7673 op0
= expand_shift (LSHIFT_EXPR
, imode
, op0
, count
,
7675 op0
= expand_shift (RSHIFT_EXPR
, imode
, op0
, count
,
7683 goto normal_inner_ref
;
7686 case ARRAY_RANGE_REF
:
7689 enum machine_mode mode1
;
7690 HOST_WIDE_INT bitsize
, bitpos
;
7693 tree tem
= get_inner_reference (exp
, &bitsize
, &bitpos
, &offset
,
7694 &mode1
, &unsignedp
, &volatilep
, true);
7697 /* If we got back the original object, something is wrong. Perhaps
7698 we are evaluating an expression too early. In any event, don't
7699 infinitely recurse. */
7700 gcc_assert (tem
!= exp
);
7702 /* If TEM's type is a union of variable size, pass TARGET to the inner
7703 computation, since it will need a temporary and TARGET is known
7704 to have to do. This occurs in unchecked conversion in Ada. */
7708 (TREE_CODE (TREE_TYPE (tem
)) == UNION_TYPE
7709 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (tem
)))
7711 && modifier
!= EXPAND_STACK_PARM
7712 ? target
: NULL_RTX
),
7714 (modifier
== EXPAND_INITIALIZER
7715 || modifier
== EXPAND_CONST_ADDRESS
7716 || modifier
== EXPAND_STACK_PARM
)
7717 ? modifier
: EXPAND_NORMAL
);
7719 /* If this is a constant, put it into a register if it is a legitimate
7720 constant, OFFSET is 0, and we won't try to extract outside the
7721 register (in case we were passed a partially uninitialized object
7722 or a view_conversion to a larger size). Force the constant to
7723 memory otherwise. */
7724 if (CONSTANT_P (op0
))
7726 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (tem
));
7727 if (mode
!= BLKmode
&& LEGITIMATE_CONSTANT_P (op0
)
7729 && bitpos
+ bitsize
<= GET_MODE_BITSIZE (mode
))
7730 op0
= force_reg (mode
, op0
);
7732 op0
= validize_mem (force_const_mem (mode
, op0
));
7735 /* Otherwise, if this object not in memory and we either have an
7736 offset, a BLKmode result, or a reference outside the object, put it
7737 there. Such cases can occur in Ada if we have unchecked conversion
7738 of an expression from a scalar type to an array or record type or
7739 for an ARRAY_RANGE_REF whose type is BLKmode. */
7740 else if (!MEM_P (op0
)
7742 || (bitpos
+ bitsize
> GET_MODE_BITSIZE (GET_MODE (op0
)))
7743 || (code
== ARRAY_RANGE_REF
&& mode
== BLKmode
)))
7745 tree nt
= build_qualified_type (TREE_TYPE (tem
),
7746 (TYPE_QUALS (TREE_TYPE (tem
))
7747 | TYPE_QUAL_CONST
));
7748 rtx memloc
= assign_temp (nt
, 1, 1, 1);
7750 emit_move_insn (memloc
, op0
);
7756 rtx offset_rtx
= expand_expr (offset
, NULL_RTX
, VOIDmode
,
7759 gcc_assert (MEM_P (op0
));
7761 #ifdef POINTERS_EXTEND_UNSIGNED
7762 if (GET_MODE (offset_rtx
) != Pmode
)
7763 offset_rtx
= convert_to_mode (Pmode
, offset_rtx
, 0);
7765 if (GET_MODE (offset_rtx
) != ptr_mode
)
7766 offset_rtx
= convert_to_mode (ptr_mode
, offset_rtx
, 0);
7769 if (GET_MODE (op0
) == BLKmode
7770 /* A constant address in OP0 can have VOIDmode, we must
7771 not try to call force_reg in that case. */
7772 && GET_MODE (XEXP (op0
, 0)) != VOIDmode
7774 && (bitpos
% bitsize
) == 0
7775 && (bitsize
% GET_MODE_ALIGNMENT (mode1
)) == 0
7776 && MEM_ALIGN (op0
) == GET_MODE_ALIGNMENT (mode1
))
7778 op0
= adjust_address (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
7782 op0
= offset_address (op0
, offset_rtx
,
7783 highest_pow2_factor (offset
));
7786 /* If OFFSET is making OP0 more aligned than BIGGEST_ALIGNMENT,
7787 record its alignment as BIGGEST_ALIGNMENT. */
7788 if (MEM_P (op0
) && bitpos
== 0 && offset
!= 0
7789 && is_aligning_offset (offset
, tem
))
7790 set_mem_align (op0
, BIGGEST_ALIGNMENT
);
7792 /* Don't forget about volatility even if this is a bitfield. */
7793 if (MEM_P (op0
) && volatilep
&& ! MEM_VOLATILE_P (op0
))
7795 if (op0
== orig_op0
)
7796 op0
= copy_rtx (op0
);
7798 MEM_VOLATILE_P (op0
) = 1;
7801 /* The following code doesn't handle CONCAT.
7802 Assume only bitpos == 0 can be used for CONCAT, due to
7803 one element arrays having the same mode as its element. */
7804 if (GET_CODE (op0
) == CONCAT
)
7806 gcc_assert (bitpos
== 0
7807 && bitsize
== GET_MODE_BITSIZE (GET_MODE (op0
)));
7811 /* In cases where an aligned union has an unaligned object
7812 as a field, we might be extracting a BLKmode value from
7813 an integer-mode (e.g., SImode) object. Handle this case
7814 by doing the extract into an object as wide as the field
7815 (which we know to be the width of a basic mode), then
7816 storing into memory, and changing the mode to BLKmode. */
7817 if (mode1
== VOIDmode
7818 || REG_P (op0
) || GET_CODE (op0
) == SUBREG
7819 || (mode1
!= BLKmode
&& ! direct_load
[(int) mode1
]
7820 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
7821 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
7822 && modifier
!= EXPAND_CONST_ADDRESS
7823 && modifier
!= EXPAND_INITIALIZER
)
7824 /* If the field isn't aligned enough to fetch as a memref,
7825 fetch it as a bit field. */
7826 || (mode1
!= BLKmode
7827 && (((TYPE_ALIGN (TREE_TYPE (tem
)) < GET_MODE_ALIGNMENT (mode
)
7828 || (bitpos
% GET_MODE_ALIGNMENT (mode
) != 0)
7830 && (MEM_ALIGN (op0
) < GET_MODE_ALIGNMENT (mode1
)
7831 || (bitpos
% GET_MODE_ALIGNMENT (mode1
) != 0))))
7832 && ((modifier
== EXPAND_CONST_ADDRESS
7833 || modifier
== EXPAND_INITIALIZER
)
7835 : SLOW_UNALIGNED_ACCESS (mode1
, MEM_ALIGN (op0
))))
7836 || (bitpos
% BITS_PER_UNIT
!= 0)))
7837 /* If the type and the field are a constant size and the
7838 size of the type isn't the same size as the bitfield,
7839 we must use bitfield operations. */
7841 && TYPE_SIZE (TREE_TYPE (exp
))
7842 && TREE_CODE (TYPE_SIZE (TREE_TYPE (exp
))) == INTEGER_CST
7843 && 0 != compare_tree_int (TYPE_SIZE (TREE_TYPE (exp
)),
7846 enum machine_mode ext_mode
= mode
;
7848 if (ext_mode
== BLKmode
7849 && ! (target
!= 0 && MEM_P (op0
)
7851 && bitpos
% BITS_PER_UNIT
== 0))
7852 ext_mode
= mode_for_size (bitsize
, MODE_INT
, 1);
7854 if (ext_mode
== BLKmode
)
7857 target
= assign_temp (type
, 0, 1, 1);
7862 /* In this case, BITPOS must start at a byte boundary and
7863 TARGET, if specified, must be a MEM. */
7864 gcc_assert (MEM_P (op0
)
7865 && (!target
|| MEM_P (target
))
7866 && !(bitpos
% BITS_PER_UNIT
));
7868 emit_block_move (target
,
7869 adjust_address (op0
, VOIDmode
,
7870 bitpos
/ BITS_PER_UNIT
),
7871 GEN_INT ((bitsize
+ BITS_PER_UNIT
- 1)
7873 (modifier
== EXPAND_STACK_PARM
7874 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
7879 op0
= validize_mem (op0
);
7881 if (MEM_P (op0
) && REG_P (XEXP (op0
, 0)))
7882 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
7884 op0
= extract_bit_field (op0
, bitsize
, bitpos
, unsignedp
,
7885 (modifier
== EXPAND_STACK_PARM
7886 ? NULL_RTX
: target
),
7887 ext_mode
, ext_mode
);
7889 /* If the result is a record type and BITSIZE is narrower than
7890 the mode of OP0, an integral mode, and this is a big endian
7891 machine, we must put the field into the high-order bits. */
7892 if (TREE_CODE (type
) == RECORD_TYPE
&& BYTES_BIG_ENDIAN
7893 && GET_MODE_CLASS (GET_MODE (op0
)) == MODE_INT
7894 && bitsize
< (HOST_WIDE_INT
) GET_MODE_BITSIZE (GET_MODE (op0
)))
7895 op0
= expand_shift (LSHIFT_EXPR
, GET_MODE (op0
), op0
,
7896 size_int (GET_MODE_BITSIZE (GET_MODE (op0
))
7900 /* If the result type is BLKmode, store the data into a temporary
7901 of the appropriate type, but with the mode corresponding to the
7902 mode for the data we have (op0's mode). It's tempting to make
7903 this a constant type, since we know it's only being stored once,
7904 but that can cause problems if we are taking the address of this
7905 COMPONENT_REF because the MEM of any reference via that address
7906 will have flags corresponding to the type, which will not
7907 necessarily be constant. */
7908 if (mode
== BLKmode
)
7910 HOST_WIDE_INT size
= GET_MODE_BITSIZE (ext_mode
);
7913 /* If the reference doesn't use the alias set of its type,
7914 we cannot create the temporary using that type. */
7915 if (component_uses_parent_alias_set (exp
))
7917 new = assign_stack_local (ext_mode
, size
, 0);
7918 set_mem_alias_set (new, get_alias_set (exp
));
7921 new = assign_stack_temp_for_type (ext_mode
, size
, 0, type
);
7923 emit_move_insn (new, op0
);
7924 op0
= copy_rtx (new);
7925 PUT_MODE (op0
, BLKmode
);
7926 set_mem_attributes (op0
, exp
, 1);
7932 /* If the result is BLKmode, use that to access the object
7934 if (mode
== BLKmode
)
7937 /* Get a reference to just this component. */
7938 if (modifier
== EXPAND_CONST_ADDRESS
7939 || modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
7940 op0
= adjust_address_nv (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
7942 op0
= adjust_address (op0
, mode1
, bitpos
/ BITS_PER_UNIT
);
7944 if (op0
== orig_op0
)
7945 op0
= copy_rtx (op0
);
7947 set_mem_attributes (op0
, exp
, 0);
7948 if (REG_P (XEXP (op0
, 0)))
7949 mark_reg_pointer (XEXP (op0
, 0), MEM_ALIGN (op0
));
7951 MEM_VOLATILE_P (op0
) |= volatilep
;
7952 if (mode
== mode1
|| mode1
== BLKmode
|| mode1
== tmode
7953 || modifier
== EXPAND_CONST_ADDRESS
7954 || modifier
== EXPAND_INITIALIZER
)
7956 else if (target
== 0)
7957 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
7959 convert_move (target
, op0
, unsignedp
);
7964 return expand_expr (OBJ_TYPE_REF_EXPR (exp
), target
, tmode
, modifier
);
7967 /* All valid uses of __builtin_va_arg_pack () are removed during
7969 if (CALL_EXPR_VA_ARG_PACK (exp
))
7970 error ("invalid use of %<__builtin_va_arg_pack ()%>");
7971 /* Check for a built-in function. */
7972 if (TREE_CODE (CALL_EXPR_FN (exp
)) == ADDR_EXPR
7973 && (TREE_CODE (TREE_OPERAND (CALL_EXPR_FN (exp
), 0))
7975 && DECL_BUILT_IN (TREE_OPERAND (CALL_EXPR_FN (exp
), 0)))
7977 if (DECL_BUILT_IN_CLASS (TREE_OPERAND (CALL_EXPR_FN (exp
), 0))
7978 == BUILT_IN_FRONTEND
)
7979 return lang_hooks
.expand_expr (exp
, original_target
,
7983 return expand_builtin (exp
, target
, subtarget
, tmode
, ignore
);
7986 return expand_call (exp
, target
, ignore
);
7988 case NON_LVALUE_EXPR
:
7991 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
7994 if (TREE_CODE (type
) == UNION_TYPE
)
7996 tree valtype
= TREE_TYPE (TREE_OPERAND (exp
, 0));
7998 /* If both input and output are BLKmode, this conversion isn't doing
7999 anything except possibly changing memory attribute. */
8000 if (mode
== BLKmode
&& TYPE_MODE (valtype
) == BLKmode
)
8002 rtx result
= expand_expr (TREE_OPERAND (exp
, 0), target
, tmode
,
8005 result
= copy_rtx (result
);
8006 set_mem_attributes (result
, exp
, 0);
8012 if (TYPE_MODE (type
) != BLKmode
)
8013 target
= gen_reg_rtx (TYPE_MODE (type
));
8015 target
= assign_temp (type
, 0, 1, 1);
8019 /* Store data into beginning of memory target. */
8020 store_expr (TREE_OPERAND (exp
, 0),
8021 adjust_address (target
, TYPE_MODE (valtype
), 0),
8022 modifier
== EXPAND_STACK_PARM
,
8027 gcc_assert (REG_P (target
));
8029 /* Store this field into a union of the proper type. */
8030 store_field (target
,
8031 MIN ((int_size_in_bytes (TREE_TYPE
8032 (TREE_OPERAND (exp
, 0)))
8034 (HOST_WIDE_INT
) GET_MODE_BITSIZE (mode
)),
8035 0, TYPE_MODE (valtype
), TREE_OPERAND (exp
, 0),
8039 /* Return the entire union. */
8043 if (mode
== TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
8045 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
, VOIDmode
,
8048 /* If the signedness of the conversion differs and OP0 is
8049 a promoted SUBREG, clear that indication since we now
8050 have to do the proper extension. */
8051 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))) != unsignedp
8052 && GET_CODE (op0
) == SUBREG
)
8053 SUBREG_PROMOTED_VAR_P (op0
) = 0;
8055 return REDUCE_BIT_FIELD (op0
);
8058 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, mode
,
8059 modifier
== EXPAND_SUM
? EXPAND_NORMAL
: modifier
);
8060 if (GET_MODE (op0
) == mode
)
8063 /* If OP0 is a constant, just convert it into the proper mode. */
8064 else if (CONSTANT_P (op0
))
8066 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
8067 enum machine_mode inner_mode
= TYPE_MODE (inner_type
);
8069 if (modifier
== EXPAND_INITIALIZER
)
8070 op0
= simplify_gen_subreg (mode
, op0
, inner_mode
,
8071 subreg_lowpart_offset (mode
,
8074 op0
= convert_modes (mode
, inner_mode
, op0
,
8075 TYPE_UNSIGNED (inner_type
));
8078 else if (modifier
== EXPAND_INITIALIZER
)
8079 op0
= gen_rtx_fmt_e (unsignedp
? ZERO_EXTEND
: SIGN_EXTEND
, mode
, op0
);
8081 else if (target
== 0)
8082 op0
= convert_to_mode (mode
, op0
,
8083 TYPE_UNSIGNED (TREE_TYPE
8084 (TREE_OPERAND (exp
, 0))));
8087 convert_move (target
, op0
,
8088 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
8092 return REDUCE_BIT_FIELD (op0
);
8094 case VIEW_CONVERT_EXPR
:
8095 op0
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, mode
, modifier
);
8097 /* If the input and output modes are both the same, we are done. */
8098 if (TYPE_MODE (type
) == GET_MODE (op0
))
8100 /* If neither mode is BLKmode, and both modes are the same size
8101 then we can use gen_lowpart. */
8102 else if (TYPE_MODE (type
) != BLKmode
&& GET_MODE (op0
) != BLKmode
8103 && GET_MODE_SIZE (TYPE_MODE (type
))
8104 == GET_MODE_SIZE (GET_MODE (op0
)))
8106 if (GET_CODE (op0
) == SUBREG
)
8107 op0
= force_reg (GET_MODE (op0
), op0
);
8108 op0
= gen_lowpart (TYPE_MODE (type
), op0
);
8110 /* If both modes are integral, then we can convert from one to the
8112 else if (SCALAR_INT_MODE_P (GET_MODE (op0
))
8113 && SCALAR_INT_MODE_P (TYPE_MODE (type
)))
8114 op0
= convert_modes (TYPE_MODE (type
), GET_MODE (op0
), op0
,
8115 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
8116 /* As a last resort, spill op0 to memory, and reload it in a
8118 else if (!MEM_P (op0
))
8120 /* If the operand is not a MEM, force it into memory. Since we
8121 are going to be changing the mode of the MEM, don't call
8122 force_const_mem for constants because we don't allow pool
8123 constants to change mode. */
8124 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
8126 gcc_assert (!TREE_ADDRESSABLE (exp
));
8128 if (target
== 0 || GET_MODE (target
) != TYPE_MODE (inner_type
))
8130 = assign_stack_temp_for_type
8131 (TYPE_MODE (inner_type
),
8132 GET_MODE_SIZE (TYPE_MODE (inner_type
)), 0, inner_type
);
8134 emit_move_insn (target
, op0
);
8138 /* At this point, OP0 is in the correct mode. If the output type is such
8139 that the operand is known to be aligned, indicate that it is.
8140 Otherwise, we need only be concerned about alignment for non-BLKmode
8144 op0
= copy_rtx (op0
);
8146 if (TYPE_ALIGN_OK (type
))
8147 set_mem_align (op0
, MAX (MEM_ALIGN (op0
), TYPE_ALIGN (type
)));
8148 else if (TYPE_MODE (type
) != BLKmode
&& STRICT_ALIGNMENT
8149 && MEM_ALIGN (op0
) < GET_MODE_ALIGNMENT (TYPE_MODE (type
)))
8151 tree inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
8152 HOST_WIDE_INT temp_size
8153 = MAX (int_size_in_bytes (inner_type
),
8154 (HOST_WIDE_INT
) GET_MODE_SIZE (TYPE_MODE (type
)));
8155 rtx
new = assign_stack_temp_for_type (TYPE_MODE (type
),
8156 temp_size
, 0, type
);
8157 rtx new_with_op0_mode
= adjust_address (new, GET_MODE (op0
), 0);
8159 gcc_assert (!TREE_ADDRESSABLE (exp
));
8161 if (GET_MODE (op0
) == BLKmode
)
8162 emit_block_move (new_with_op0_mode
, op0
,
8163 GEN_INT (GET_MODE_SIZE (TYPE_MODE (type
))),
8164 (modifier
== EXPAND_STACK_PARM
8165 ? BLOCK_OP_CALL_PARM
: BLOCK_OP_NORMAL
));
8167 emit_move_insn (new_with_op0_mode
, op0
);
8172 op0
= adjust_address (op0
, TYPE_MODE (type
), 0);
8177 case POINTER_PLUS_EXPR
:
8178 /* Even though the sizetype mode and the pointer's mode can be different
8179 expand is able to handle this correctly and get the correct result out
8180 of the PLUS_EXPR code. */
8183 /* Check if this is a case for multiplication and addition. */
8184 if ((TREE_CODE (type
) == INTEGER_TYPE
8185 || TREE_CODE (type
) == FIXED_POINT_TYPE
)
8186 && TREE_CODE (TREE_OPERAND (exp
, 0)) == MULT_EXPR
)
8188 tree subsubexp0
, subsubexp1
;
8189 enum tree_code code0
, code1
, this_code
;
8191 subexp0
= TREE_OPERAND (exp
, 0);
8192 subsubexp0
= TREE_OPERAND (subexp0
, 0);
8193 subsubexp1
= TREE_OPERAND (subexp0
, 1);
8194 code0
= TREE_CODE (subsubexp0
);
8195 code1
= TREE_CODE (subsubexp1
);
8196 this_code
= TREE_CODE (type
) == INTEGER_TYPE
? NOP_EXPR
8197 : FIXED_CONVERT_EXPR
;
8198 if (code0
== this_code
&& code1
== this_code
8199 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subsubexp0
, 0)))
8200 < TYPE_PRECISION (TREE_TYPE (subsubexp0
)))
8201 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subsubexp0
, 0)))
8202 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subsubexp1
, 0))))
8203 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (subsubexp0
, 0)))
8204 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (subsubexp1
, 0)))))
8206 tree op0type
= TREE_TYPE (TREE_OPERAND (subsubexp0
, 0));
8207 enum machine_mode innermode
= TYPE_MODE (op0type
);
8208 bool zextend_p
= TYPE_UNSIGNED (op0type
);
8209 bool sat_p
= TYPE_SATURATING (TREE_TYPE (subsubexp0
));
8211 this_optab
= zextend_p
? umadd_widen_optab
: smadd_widen_optab
;
8213 this_optab
= zextend_p
? usmadd_widen_optab
8214 : ssmadd_widen_optab
;
8215 if (mode
== GET_MODE_2XWIDER_MODE (innermode
)
8216 && (optab_handler (this_optab
, mode
)->insn_code
8217 != CODE_FOR_nothing
))
8219 expand_operands (TREE_OPERAND (subsubexp0
, 0),
8220 TREE_OPERAND (subsubexp1
, 0),
8221 NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8222 op2
= expand_expr (TREE_OPERAND (exp
, 1), subtarget
,
8223 VOIDmode
, EXPAND_NORMAL
);
8224 temp
= expand_ternary_op (mode
, this_optab
, op0
, op1
, op2
,
8227 return REDUCE_BIT_FIELD (temp
);
8232 /* If we are adding a constant, a VAR_DECL that is sp, fp, or ap, and
8233 something else, make sure we add the register to the constant and
8234 then to the other thing. This case can occur during strength
8235 reduction and doing it this way will produce better code if the
8236 frame pointer or argument pointer is eliminated.
8238 fold-const.c will ensure that the constant is always in the inner
8239 PLUS_EXPR, so the only case we need to do anything about is if
8240 sp, ap, or fp is our second argument, in which case we must swap
8241 the innermost first argument and our second argument. */
8243 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == PLUS_EXPR
8244 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 1)) == INTEGER_CST
8245 && TREE_CODE (TREE_OPERAND (exp
, 1)) == VAR_DECL
8246 && (DECL_RTL (TREE_OPERAND (exp
, 1)) == frame_pointer_rtx
8247 || DECL_RTL (TREE_OPERAND (exp
, 1)) == stack_pointer_rtx
8248 || DECL_RTL (TREE_OPERAND (exp
, 1)) == arg_pointer_rtx
))
8250 tree t
= TREE_OPERAND (exp
, 1);
8252 TREE_OPERAND (exp
, 1) = TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
8253 TREE_OPERAND (TREE_OPERAND (exp
, 0), 0) = t
;
8256 /* If the result is to be ptr_mode and we are adding an integer to
8257 something, we might be forming a constant. So try to use
8258 plus_constant. If it produces a sum and we can't accept it,
8259 use force_operand. This allows P = &ARR[const] to generate
8260 efficient code on machines where a SYMBOL_REF is not a valid
8263 If this is an EXPAND_SUM call, always return the sum. */
8264 if (modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
8265 || (mode
== ptr_mode
&& (unsignedp
|| ! flag_trapv
)))
8267 if (modifier
== EXPAND_STACK_PARM
)
8269 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == INTEGER_CST
8270 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
8271 && TREE_CONSTANT (TREE_OPERAND (exp
, 1)))
8275 op1
= expand_expr (TREE_OPERAND (exp
, 1), subtarget
, VOIDmode
,
8277 /* Use immed_double_const to ensure that the constant is
8278 truncated according to the mode of OP1, then sign extended
8279 to a HOST_WIDE_INT. Using the constant directly can result
8280 in non-canonical RTL in a 64x32 cross compile. */
8282 = immed_double_const (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 0)),
8284 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1))));
8285 op1
= plus_constant (op1
, INTVAL (constant_part
));
8286 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8287 op1
= force_operand (op1
, target
);
8288 return REDUCE_BIT_FIELD (op1
);
8291 else if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
8292 && GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
8293 && TREE_CONSTANT (TREE_OPERAND (exp
, 0)))
8297 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
,
8298 (modifier
== EXPAND_INITIALIZER
8299 ? EXPAND_INITIALIZER
: EXPAND_SUM
));
8300 if (! CONSTANT_P (op0
))
8302 op1
= expand_expr (TREE_OPERAND (exp
, 1), NULL_RTX
,
8303 VOIDmode
, modifier
);
8304 /* Return a PLUS if modifier says it's OK. */
8305 if (modifier
== EXPAND_SUM
8306 || modifier
== EXPAND_INITIALIZER
)
8307 return simplify_gen_binary (PLUS
, mode
, op0
, op1
);
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 (TREE_OPERAND (exp
, 1)),
8317 TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))));
8318 op0
= plus_constant (op0
, INTVAL (constant_part
));
8319 if (modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8320 op0
= force_operand (op0
, target
);
8321 return REDUCE_BIT_FIELD (op0
);
8325 /* No sense saving up arithmetic to be done
8326 if it's all in the wrong mode to form part of an address.
8327 And force_operand won't know whether to sign-extend or
8329 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8330 || mode
!= ptr_mode
)
8332 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
8333 subtarget
, &op0
, &op1
, 0);
8334 if (op0
== const0_rtx
)
8336 if (op1
== const0_rtx
)
8341 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
8342 subtarget
, &op0
, &op1
, modifier
);
8343 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS
, mode
, op0
, op1
));
8346 /* Check if this is a case for multiplication and subtraction. */
8347 if ((TREE_CODE (type
) == INTEGER_TYPE
8348 || TREE_CODE (type
) == FIXED_POINT_TYPE
)
8349 && TREE_CODE (TREE_OPERAND (exp
, 1)) == MULT_EXPR
)
8351 tree subsubexp0
, subsubexp1
;
8352 enum tree_code code0
, code1
, this_code
;
8354 subexp1
= TREE_OPERAND (exp
, 1);
8355 subsubexp0
= TREE_OPERAND (subexp1
, 0);
8356 subsubexp1
= TREE_OPERAND (subexp1
, 1);
8357 code0
= TREE_CODE (subsubexp0
);
8358 code1
= TREE_CODE (subsubexp1
);
8359 this_code
= TREE_CODE (type
) == INTEGER_TYPE
? NOP_EXPR
8360 : FIXED_CONVERT_EXPR
;
8361 if (code0
== this_code
&& code1
== this_code
8362 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subsubexp0
, 0)))
8363 < TYPE_PRECISION (TREE_TYPE (subsubexp0
)))
8364 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subsubexp0
, 0)))
8365 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subsubexp1
, 0))))
8366 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (subsubexp0
, 0)))
8367 == TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (subsubexp1
, 0)))))
8369 tree op0type
= TREE_TYPE (TREE_OPERAND (subsubexp0
, 0));
8370 enum machine_mode innermode
= TYPE_MODE (op0type
);
8371 bool zextend_p
= TYPE_UNSIGNED (op0type
);
8372 bool sat_p
= TYPE_SATURATING (TREE_TYPE (subsubexp0
));
8374 this_optab
= zextend_p
? umsub_widen_optab
: smsub_widen_optab
;
8376 this_optab
= zextend_p
? usmsub_widen_optab
8377 : ssmsub_widen_optab
;
8378 if (mode
== GET_MODE_2XWIDER_MODE (innermode
)
8379 && (optab_handler (this_optab
, mode
)->insn_code
8380 != CODE_FOR_nothing
))
8382 expand_operands (TREE_OPERAND (subsubexp0
, 0),
8383 TREE_OPERAND (subsubexp1
, 0),
8384 NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8385 op2
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
,
8386 VOIDmode
, EXPAND_NORMAL
);
8387 temp
= expand_ternary_op (mode
, this_optab
, op0
, op1
, op2
,
8390 return REDUCE_BIT_FIELD (temp
);
8395 /* For initializers, we are allowed to return a MINUS of two
8396 symbolic constants. Here we handle all cases when both operands
8398 /* Handle difference of two symbolic constants,
8399 for the sake of an initializer. */
8400 if ((modifier
== EXPAND_SUM
|| modifier
== EXPAND_INITIALIZER
)
8401 && really_constant_p (TREE_OPERAND (exp
, 0))
8402 && really_constant_p (TREE_OPERAND (exp
, 1)))
8404 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
8405 NULL_RTX
, &op0
, &op1
, modifier
);
8407 /* If the last operand is a CONST_INT, use plus_constant of
8408 the negated constant. Else make the MINUS. */
8409 if (GET_CODE (op1
) == CONST_INT
)
8410 return REDUCE_BIT_FIELD (plus_constant (op0
, - INTVAL (op1
)));
8412 return REDUCE_BIT_FIELD (gen_rtx_MINUS (mode
, op0
, op1
));
8415 /* No sense saving up arithmetic to be done
8416 if it's all in the wrong mode to form part of an address.
8417 And force_operand won't know whether to sign-extend or
8419 if ((modifier
!= EXPAND_SUM
&& modifier
!= EXPAND_INITIALIZER
)
8420 || mode
!= ptr_mode
)
8423 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
8424 subtarget
, &op0
, &op1
, modifier
);
8426 /* Convert A - const to A + (-const). */
8427 if (GET_CODE (op1
) == CONST_INT
)
8429 op1
= negate_rtx (mode
, op1
);
8430 return REDUCE_BIT_FIELD (simplify_gen_binary (PLUS
, mode
, op0
, op1
));
8436 /* If this is a fixed-point operation, then we cannot use the code
8437 below because "expand_mult" doesn't support sat/no-sat fixed-point
8439 if (ALL_FIXED_POINT_MODE_P (mode
))
8442 /* If first operand is constant, swap them.
8443 Thus the following special case checks need only
8444 check the second operand. */
8445 if (TREE_CODE (TREE_OPERAND (exp
, 0)) == INTEGER_CST
)
8447 tree t1
= TREE_OPERAND (exp
, 0);
8448 TREE_OPERAND (exp
, 0) = TREE_OPERAND (exp
, 1);
8449 TREE_OPERAND (exp
, 1) = t1
;
8452 /* Attempt to return something suitable for generating an
8453 indexed address, for machines that support that. */
8455 if (modifier
== EXPAND_SUM
&& mode
== ptr_mode
8456 && host_integerp (TREE_OPERAND (exp
, 1), 0))
8458 tree exp1
= TREE_OPERAND (exp
, 1);
8460 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
, VOIDmode
,
8464 op0
= force_operand (op0
, NULL_RTX
);
8466 op0
= copy_to_mode_reg (mode
, op0
);
8468 return REDUCE_BIT_FIELD (gen_rtx_MULT (mode
, op0
,
8469 gen_int_mode (tree_low_cst (exp1
, 0),
8470 TYPE_MODE (TREE_TYPE (exp1
)))));
8473 if (modifier
== EXPAND_STACK_PARM
)
8476 /* Check for multiplying things that have been extended
8477 from a narrower type. If this machine supports multiplying
8478 in that narrower type with a result in the desired type,
8479 do it that way, and avoid the explicit type-conversion. */
8481 subexp0
= TREE_OPERAND (exp
, 0);
8482 subexp1
= TREE_OPERAND (exp
, 1);
8483 /* First, check if we have a multiplication of one signed and one
8484 unsigned operand. */
8485 if (TREE_CODE (subexp0
) == NOP_EXPR
8486 && TREE_CODE (subexp1
) == NOP_EXPR
8487 && TREE_CODE (type
) == INTEGER_TYPE
8488 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subexp0
, 0)))
8489 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))))
8490 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subexp0
, 0)))
8491 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (subexp1
, 0))))
8492 && (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (subexp0
, 0)))
8493 != TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (subexp1
, 0)))))
8495 enum machine_mode innermode
8496 = TYPE_MODE (TREE_TYPE (TREE_OPERAND (subexp0
, 0)));
8497 this_optab
= usmul_widen_optab
;
8498 if (mode
== GET_MODE_WIDER_MODE (innermode
))
8500 if (optab_handler (this_optab
, mode
)->insn_code
!= CODE_FOR_nothing
)
8502 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (subexp0
, 0))))
8503 expand_operands (TREE_OPERAND (subexp0
, 0),
8504 TREE_OPERAND (subexp1
, 0),
8505 NULL_RTX
, &op0
, &op1
, 0);
8507 expand_operands (TREE_OPERAND (subexp0
, 0),
8508 TREE_OPERAND (subexp1
, 0),
8509 NULL_RTX
, &op1
, &op0
, 0);
8515 /* Check for a multiplication with matching signedness. */
8516 else if (TREE_CODE (TREE_OPERAND (exp
, 0)) == NOP_EXPR
8517 && TREE_CODE (type
) == INTEGER_TYPE
8518 && (TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
8519 < TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (exp
, 0))))
8520 && ((TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
8521 && int_fits_type_p (TREE_OPERAND (exp
, 1),
8522 TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0)))
8523 /* Don't use a widening multiply if a shift will do. */
8524 && ((GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 1))))
8525 > HOST_BITS_PER_WIDE_INT
)
8526 || exact_log2 (TREE_INT_CST_LOW (TREE_OPERAND (exp
, 1))) < 0))
8528 (TREE_CODE (TREE_OPERAND (exp
, 1)) == NOP_EXPR
8529 && (TYPE_PRECISION (TREE_TYPE
8530 (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0)))
8531 == TYPE_PRECISION (TREE_TYPE
8533 (TREE_OPERAND (exp
, 0), 0))))
8534 /* If both operands are extended, they must either both
8535 be zero-extended or both be sign-extended. */
8536 && (TYPE_UNSIGNED (TREE_TYPE
8537 (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0)))
8538 == TYPE_UNSIGNED (TREE_TYPE
8540 (TREE_OPERAND (exp
, 0), 0)))))))
8542 tree op0type
= TREE_TYPE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0));
8543 enum machine_mode innermode
= TYPE_MODE (op0type
);
8544 bool zextend_p
= TYPE_UNSIGNED (op0type
);
8545 optab other_optab
= zextend_p
? smul_widen_optab
: umul_widen_optab
;
8546 this_optab
= zextend_p
? umul_widen_optab
: smul_widen_optab
;
8548 if (mode
== GET_MODE_2XWIDER_MODE (innermode
))
8550 if (optab_handler (this_optab
, mode
)->insn_code
!= CODE_FOR_nothing
)
8552 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
)
8553 expand_operands (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
8554 TREE_OPERAND (exp
, 1),
8555 NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8557 expand_operands (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
8558 TREE_OPERAND (TREE_OPERAND (exp
, 1), 0),
8559 NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
8562 else if (optab_handler (other_optab
, mode
)->insn_code
!= CODE_FOR_nothing
8563 && innermode
== word_mode
)
8566 op0
= expand_normal (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0));
8567 if (TREE_CODE (TREE_OPERAND (exp
, 1)) == INTEGER_CST
)
8568 op1
= convert_modes (innermode
, mode
,
8569 expand_normal (TREE_OPERAND (exp
, 1)),
8572 op1
= expand_normal (TREE_OPERAND (TREE_OPERAND (exp
, 1), 0));
8573 temp
= expand_binop (mode
, other_optab
, op0
, op1
, target
,
8574 unsignedp
, OPTAB_LIB_WIDEN
);
8575 hipart
= gen_highpart (innermode
, temp
);
8576 htem
= expand_mult_highpart_adjust (innermode
, hipart
,
8580 emit_move_insn (hipart
, htem
);
8581 return REDUCE_BIT_FIELD (temp
);
8585 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
8586 subtarget
, &op0
, &op1
, 0);
8587 return REDUCE_BIT_FIELD (expand_mult (mode
, op0
, op1
, target
, unsignedp
));
8589 case TRUNC_DIV_EXPR
:
8590 case FLOOR_DIV_EXPR
:
8592 case ROUND_DIV_EXPR
:
8593 case EXACT_DIV_EXPR
:
8594 /* If this is a fixed-point operation, then we cannot use the code
8595 below because "expand_divmod" doesn't support sat/no-sat fixed-point
8597 if (ALL_FIXED_POINT_MODE_P (mode
))
8600 if (modifier
== EXPAND_STACK_PARM
)
8602 /* Possible optimization: compute the dividend with EXPAND_SUM
8603 then if the divisor is constant can optimize the case
8604 where some terms of the dividend have coeffs divisible by it. */
8605 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
8606 subtarget
, &op0
, &op1
, 0);
8607 return expand_divmod (0, code
, mode
, op0
, op1
, target
, unsignedp
);
8612 case TRUNC_MOD_EXPR
:
8613 case FLOOR_MOD_EXPR
:
8615 case ROUND_MOD_EXPR
:
8616 if (modifier
== EXPAND_STACK_PARM
)
8618 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
8619 subtarget
, &op0
, &op1
, 0);
8620 return expand_divmod (1, code
, mode
, op0
, op1
, target
, unsignedp
);
8622 case FIXED_CONVERT_EXPR
:
8623 op0
= expand_normal (TREE_OPERAND (exp
, 0));
8624 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8625 target
= gen_reg_rtx (mode
);
8627 if ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == INTEGER_TYPE
8628 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))))
8629 || (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
)))
8630 expand_fixed_convert (target
, op0
, 1, TYPE_SATURATING (type
));
8632 expand_fixed_convert (target
, op0
, 0, TYPE_SATURATING (type
));
8635 case FIX_TRUNC_EXPR
:
8636 op0
= expand_normal (TREE_OPERAND (exp
, 0));
8637 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8638 target
= gen_reg_rtx (mode
);
8639 expand_fix (target
, op0
, unsignedp
);
8643 op0
= expand_normal (TREE_OPERAND (exp
, 0));
8644 if (target
== 0 || modifier
== EXPAND_STACK_PARM
)
8645 target
= gen_reg_rtx (mode
);
8646 /* expand_float can't figure out what to do if FROM has VOIDmode.
8647 So give it the correct mode. With -O, cse will optimize this. */
8648 if (GET_MODE (op0
) == VOIDmode
)
8649 op0
= copy_to_mode_reg (TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0))),
8651 expand_float (target
, op0
,
8652 TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
8656 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
,
8657 VOIDmode
, EXPAND_NORMAL
);
8658 if (modifier
== EXPAND_STACK_PARM
)
8660 temp
= expand_unop (mode
,
8661 optab_for_tree_code (NEGATE_EXPR
, type
),
8664 return REDUCE_BIT_FIELD (temp
);
8667 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
,
8668 VOIDmode
, EXPAND_NORMAL
);
8669 if (modifier
== EXPAND_STACK_PARM
)
8672 /* ABS_EXPR is not valid for complex arguments. */
8673 gcc_assert (GET_MODE_CLASS (mode
) != MODE_COMPLEX_INT
8674 && GET_MODE_CLASS (mode
) != MODE_COMPLEX_FLOAT
);
8676 /* Unsigned abs is simply the operand. Testing here means we don't
8677 risk generating incorrect code below. */
8678 if (TYPE_UNSIGNED (type
))
8681 return expand_abs (mode
, op0
, target
, unsignedp
,
8682 safe_from_p (target
, TREE_OPERAND (exp
, 0), 1));
8686 target
= original_target
;
8688 || modifier
== EXPAND_STACK_PARM
8689 || (MEM_P (target
) && MEM_VOLATILE_P (target
))
8690 || GET_MODE (target
) != mode
8692 && REGNO (target
) < FIRST_PSEUDO_REGISTER
))
8693 target
= gen_reg_rtx (mode
);
8694 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
8695 target
, &op0
, &op1
, 0);
8697 /* First try to do it with a special MIN or MAX instruction.
8698 If that does not win, use a conditional jump to select the proper
8700 this_optab
= optab_for_tree_code (code
, type
);
8701 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
, unsignedp
,
8706 /* At this point, a MEM target is no longer useful; we will get better
8709 if (! REG_P (target
))
8710 target
= gen_reg_rtx (mode
);
8712 /* If op1 was placed in target, swap op0 and op1. */
8713 if (target
!= op0
&& target
== op1
)
8720 /* We generate better code and avoid problems with op1 mentioning
8721 target by forcing op1 into a pseudo if it isn't a constant. */
8722 if (! CONSTANT_P (op1
))
8723 op1
= force_reg (mode
, op1
);
8726 enum rtx_code comparison_code
;
8729 if (code
== MAX_EXPR
)
8730 comparison_code
= unsignedp
? GEU
: GE
;
8732 comparison_code
= unsignedp
? LEU
: LE
;
8734 /* Canonicalize to comparisons against 0. */
8735 if (op1
== const1_rtx
)
8737 /* Converting (a >= 1 ? a : 1) into (a > 0 ? a : 1)
8738 or (a != 0 ? a : 1) for unsigned.
8739 For MIN we are safe converting (a <= 1 ? a : 1)
8740 into (a <= 0 ? a : 1) */
8741 cmpop1
= const0_rtx
;
8742 if (code
== MAX_EXPR
)
8743 comparison_code
= unsignedp
? NE
: GT
;
8745 if (op1
== constm1_rtx
&& !unsignedp
)
8747 /* Converting (a >= -1 ? a : -1) into (a >= 0 ? a : -1)
8748 and (a <= -1 ? a : -1) into (a < 0 ? a : -1) */
8749 cmpop1
= const0_rtx
;
8750 if (code
== MIN_EXPR
)
8751 comparison_code
= LT
;
8753 #ifdef HAVE_conditional_move
8754 /* Use a conditional move if possible. */
8755 if (can_conditionally_move_p (mode
))
8759 /* ??? Same problem as in expmed.c: emit_conditional_move
8760 forces a stack adjustment via compare_from_rtx, and we
8761 lose the stack adjustment if the sequence we are about
8762 to create is discarded. */
8763 do_pending_stack_adjust ();
8767 /* Try to emit the conditional move. */
8768 insn
= emit_conditional_move (target
, comparison_code
,
8773 /* If we could do the conditional move, emit the sequence,
8777 rtx seq
= get_insns ();
8783 /* Otherwise discard the sequence and fall back to code with
8789 emit_move_insn (target
, op0
);
8791 temp
= gen_label_rtx ();
8792 do_compare_rtx_and_jump (target
, cmpop1
, comparison_code
,
8793 unsignedp
, mode
, NULL_RTX
, NULL_RTX
, temp
);
8795 emit_move_insn (target
, op1
);
8800 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
,
8801 VOIDmode
, EXPAND_NORMAL
);
8802 if (modifier
== EXPAND_STACK_PARM
)
8804 temp
= expand_unop (mode
, one_cmpl_optab
, op0
, target
, 1);
8808 /* ??? Can optimize bitwise operations with one arg constant.
8809 Can optimize (a bitwise1 n) bitwise2 (a bitwise3 b)
8810 and (a bitwise1 b) bitwise2 b (etc)
8811 but that is probably not worth while. */
8813 /* BIT_AND_EXPR is for bitwise anding. TRUTH_AND_EXPR is for anding two
8814 boolean values when we want in all cases to compute both of them. In
8815 general it is fastest to do TRUTH_AND_EXPR by computing both operands
8816 as actual zero-or-1 values and then bitwise anding. In cases where
8817 there cannot be any side effects, better code would be made by
8818 treating TRUTH_AND_EXPR like TRUTH_ANDIF_EXPR; but the question is
8819 how to recognize those cases. */
8821 case TRUTH_AND_EXPR
:
8822 code
= BIT_AND_EXPR
;
8827 code
= BIT_IOR_EXPR
;
8831 case TRUTH_XOR_EXPR
:
8832 code
= BIT_XOR_EXPR
;
8840 /* If this is a fixed-point operation, then we cannot use the code
8841 below because "expand_shift" doesn't support sat/no-sat fixed-point
8843 if (ALL_FIXED_POINT_MODE_P (mode
))
8846 if (! safe_from_p (subtarget
, TREE_OPERAND (exp
, 1), 1))
8848 if (modifier
== EXPAND_STACK_PARM
)
8850 op0
= expand_expr (TREE_OPERAND (exp
, 0), subtarget
,
8851 VOIDmode
, EXPAND_NORMAL
);
8852 return expand_shift (code
, mode
, op0
, TREE_OPERAND (exp
, 1), target
,
8855 /* Could determine the answer when only additive constants differ. Also,
8856 the addition of one can be handled by changing the condition. */
8863 case UNORDERED_EXPR
:
8871 temp
= do_store_flag (exp
,
8872 modifier
!= EXPAND_STACK_PARM
? target
: NULL_RTX
,
8873 tmode
!= VOIDmode
? tmode
: mode
, 0);
8877 /* For foo != 0, load foo, and if it is nonzero load 1 instead. */
8878 if (code
== NE_EXPR
&& integer_zerop (TREE_OPERAND (exp
, 1))
8880 && REG_P (original_target
)
8881 && (GET_MODE (original_target
)
8882 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)))))
8884 temp
= expand_expr (TREE_OPERAND (exp
, 0), original_target
,
8885 VOIDmode
, EXPAND_NORMAL
);
8887 /* If temp is constant, we can just compute the result. */
8888 if (GET_CODE (temp
) == CONST_INT
)
8890 if (INTVAL (temp
) != 0)
8891 emit_move_insn (target
, const1_rtx
);
8893 emit_move_insn (target
, const0_rtx
);
8898 if (temp
!= original_target
)
8900 enum machine_mode mode1
= GET_MODE (temp
);
8901 if (mode1
== VOIDmode
)
8902 mode1
= tmode
!= VOIDmode
? tmode
: mode
;
8904 temp
= copy_to_mode_reg (mode1
, temp
);
8907 op1
= gen_label_rtx ();
8908 emit_cmp_and_jump_insns (temp
, const0_rtx
, EQ
, NULL_RTX
,
8909 GET_MODE (temp
), unsignedp
, op1
);
8910 emit_move_insn (temp
, const1_rtx
);
8915 /* If no set-flag instruction, must generate a conditional store
8916 into a temporary variable. Drop through and handle this
8921 || modifier
== EXPAND_STACK_PARM
8922 || ! safe_from_p (target
, exp
, 1)
8923 /* Make sure we don't have a hard reg (such as function's return
8924 value) live across basic blocks, if not optimizing. */
8925 || (!optimize
&& REG_P (target
)
8926 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)))
8927 target
= gen_reg_rtx (tmode
!= VOIDmode
? tmode
: mode
);
8930 emit_move_insn (target
, const0_rtx
);
8932 op1
= gen_label_rtx ();
8933 jumpifnot (exp
, op1
);
8936 emit_move_insn (target
, const1_rtx
);
8939 return ignore
? const0_rtx
: target
;
8941 case TRUTH_NOT_EXPR
:
8942 if (modifier
== EXPAND_STACK_PARM
)
8944 op0
= expand_expr (TREE_OPERAND (exp
, 0), target
,
8945 VOIDmode
, EXPAND_NORMAL
);
8946 /* The parser is careful to generate TRUTH_NOT_EXPR
8947 only with operands that are always zero or one. */
8948 temp
= expand_binop (mode
, xor_optab
, op0
, const1_rtx
,
8949 target
, 1, OPTAB_LIB_WIDEN
);
8953 case STATEMENT_LIST
:
8955 tree_stmt_iterator iter
;
8957 gcc_assert (ignore
);
8959 for (iter
= tsi_start (exp
); !tsi_end_p (iter
); tsi_next (&iter
))
8960 expand_expr (tsi_stmt (iter
), const0_rtx
, VOIDmode
, modifier
);
8965 /* A COND_EXPR with its type being VOID_TYPE represents a
8966 conditional jump and is handled in
8967 expand_gimple_cond_expr. */
8968 gcc_assert (!VOID_TYPE_P (TREE_TYPE (exp
)));
8970 /* Note that COND_EXPRs whose type is a structure or union
8971 are required to be constructed to contain assignments of
8972 a temporary variable, so that we can evaluate them here
8973 for side effect only. If type is void, we must do likewise. */
8975 gcc_assert (!TREE_ADDRESSABLE (type
)
8977 && TREE_TYPE (TREE_OPERAND (exp
, 1)) != void_type_node
8978 && TREE_TYPE (TREE_OPERAND (exp
, 2)) != void_type_node
);
8980 /* If we are not to produce a result, we have no target. Otherwise,
8981 if a target was specified use it; it will not be used as an
8982 intermediate target unless it is safe. If no target, use a
8985 if (modifier
!= EXPAND_STACK_PARM
8987 && safe_from_p (original_target
, TREE_OPERAND (exp
, 0), 1)
8988 && GET_MODE (original_target
) == mode
8989 #ifdef HAVE_conditional_move
8990 && (! can_conditionally_move_p (mode
)
8991 || REG_P (original_target
))
8993 && !MEM_P (original_target
))
8994 temp
= original_target
;
8996 temp
= assign_temp (type
, 0, 0, 1);
8998 do_pending_stack_adjust ();
9000 op0
= gen_label_rtx ();
9001 op1
= gen_label_rtx ();
9002 jumpifnot (TREE_OPERAND (exp
, 0), op0
);
9003 store_expr (TREE_OPERAND (exp
, 1), temp
,
9004 modifier
== EXPAND_STACK_PARM
,
9007 emit_jump_insn (gen_jump (op1
));
9010 store_expr (TREE_OPERAND (exp
, 2), temp
,
9011 modifier
== EXPAND_STACK_PARM
,
9019 target
= expand_vec_cond_expr (exp
, target
);
9024 tree lhs
= TREE_OPERAND (exp
, 0);
9025 tree rhs
= TREE_OPERAND (exp
, 1);
9026 gcc_assert (ignore
);
9027 expand_assignment (lhs
, rhs
, false);
9031 case GIMPLE_MODIFY_STMT
:
9033 tree lhs
= GIMPLE_STMT_OPERAND (exp
, 0);
9034 tree rhs
= GIMPLE_STMT_OPERAND (exp
, 1);
9036 gcc_assert (ignore
);
9038 /* Check for |= or &= of a bitfield of size one into another bitfield
9039 of size 1. In this case, (unless we need the result of the
9040 assignment) we can do this more efficiently with a
9041 test followed by an assignment, if necessary.
9043 ??? At this point, we can't get a BIT_FIELD_REF here. But if
9044 things change so we do, this code should be enhanced to
9046 if (TREE_CODE (lhs
) == COMPONENT_REF
9047 && (TREE_CODE (rhs
) == BIT_IOR_EXPR
9048 || TREE_CODE (rhs
) == BIT_AND_EXPR
)
9049 && TREE_OPERAND (rhs
, 0) == lhs
9050 && TREE_CODE (TREE_OPERAND (rhs
, 1)) == COMPONENT_REF
9051 && integer_onep (DECL_SIZE (TREE_OPERAND (lhs
, 1)))
9052 && integer_onep (DECL_SIZE (TREE_OPERAND (TREE_OPERAND (rhs
, 1), 1))))
9054 rtx label
= gen_label_rtx ();
9055 int value
= TREE_CODE (rhs
) == BIT_IOR_EXPR
;
9056 do_jump (TREE_OPERAND (rhs
, 1),
9059 expand_assignment (lhs
, build_int_cst (TREE_TYPE (rhs
), value
),
9060 MOVE_NONTEMPORAL (exp
));
9061 do_pending_stack_adjust ();
9066 expand_assignment (lhs
, rhs
, MOVE_NONTEMPORAL (exp
));
9071 if (!TREE_OPERAND (exp
, 0))
9072 expand_null_return ();
9074 expand_return (TREE_OPERAND (exp
, 0));
9078 return expand_expr_addr_expr (exp
, target
, tmode
, modifier
);
9081 /* Get the rtx code of the operands. */
9082 op0
= expand_normal (TREE_OPERAND (exp
, 0));
9083 op1
= expand_normal (TREE_OPERAND (exp
, 1));
9086 target
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp
)));
9088 /* Move the real (op0) and imaginary (op1) parts to their location. */
9089 write_complex_part (target
, op0
, false);
9090 write_complex_part (target
, op1
, true);
9095 op0
= expand_normal (TREE_OPERAND (exp
, 0));
9096 return read_complex_part (op0
, false);
9099 op0
= expand_normal (TREE_OPERAND (exp
, 0));
9100 return read_complex_part (op0
, true);
9103 expand_resx_expr (exp
);
9106 case TRY_CATCH_EXPR
:
9108 case EH_FILTER_EXPR
:
9109 case TRY_FINALLY_EXPR
:
9110 /* Lowered by tree-eh.c. */
9113 case WITH_CLEANUP_EXPR
:
9114 case CLEANUP_POINT_EXPR
:
9116 case CASE_LABEL_EXPR
:
9122 case PREINCREMENT_EXPR
:
9123 case PREDECREMENT_EXPR
:
9124 case POSTINCREMENT_EXPR
:
9125 case POSTDECREMENT_EXPR
:
9128 case TRUTH_ANDIF_EXPR
:
9129 case TRUTH_ORIF_EXPR
:
9130 /* Lowered by gimplify.c. */
9133 case CHANGE_DYNAMIC_TYPE_EXPR
:
9134 /* This is ignored at the RTL level. The tree level set
9135 DECL_POINTER_ALIAS_SET of any variable to be 0, which is
9136 overkill for the RTL layer but is all that we can
9141 return get_exception_pointer (cfun
);
9144 return get_exception_filter (cfun
);
9147 /* Function descriptors are not valid except for as
9148 initialization constants, and should not be expanded. */
9156 expand_label (TREE_OPERAND (exp
, 0));
9160 expand_asm_expr (exp
);
9163 case WITH_SIZE_EXPR
:
9164 /* WITH_SIZE_EXPR expands to its first argument. The caller should
9165 have pulled out the size to use in whatever context it needed. */
9166 return expand_expr_real (TREE_OPERAND (exp
, 0), original_target
, tmode
,
9169 case REALIGN_LOAD_EXPR
:
9171 tree oprnd0
= TREE_OPERAND (exp
, 0);
9172 tree oprnd1
= TREE_OPERAND (exp
, 1);
9173 tree oprnd2
= TREE_OPERAND (exp
, 2);
9176 this_optab
= optab_for_tree_code (code
, type
);
9177 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
9178 op2
= expand_normal (oprnd2
);
9179 temp
= expand_ternary_op (mode
, this_optab
, op0
, op1
, op2
,
9187 tree oprnd0
= TREE_OPERAND (exp
, 0);
9188 tree oprnd1
= TREE_OPERAND (exp
, 1);
9189 tree oprnd2
= TREE_OPERAND (exp
, 2);
9192 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, EXPAND_NORMAL
);
9193 op2
= expand_normal (oprnd2
);
9194 target
= expand_widen_pattern_expr (exp
, op0
, op1
, op2
,
9199 case WIDEN_SUM_EXPR
:
9201 tree oprnd0
= TREE_OPERAND (exp
, 0);
9202 tree oprnd1
= TREE_OPERAND (exp
, 1);
9204 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, 0);
9205 target
= expand_widen_pattern_expr (exp
, op0
, NULL_RTX
, op1
,
9210 case REDUC_MAX_EXPR
:
9211 case REDUC_MIN_EXPR
:
9212 case REDUC_PLUS_EXPR
:
9214 op0
= expand_normal (TREE_OPERAND (exp
, 0));
9215 this_optab
= optab_for_tree_code (code
, type
);
9216 temp
= expand_unop (mode
, this_optab
, op0
, target
, unsignedp
);
9221 case VEC_EXTRACT_EVEN_EXPR
:
9222 case VEC_EXTRACT_ODD_EXPR
:
9224 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
9225 NULL_RTX
, &op0
, &op1
, 0);
9226 this_optab
= optab_for_tree_code (code
, type
);
9227 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
, unsignedp
,
9233 case VEC_INTERLEAVE_HIGH_EXPR
:
9234 case VEC_INTERLEAVE_LOW_EXPR
:
9236 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
9237 NULL_RTX
, &op0
, &op1
, 0);
9238 this_optab
= optab_for_tree_code (code
, type
);
9239 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
, unsignedp
,
9245 case VEC_LSHIFT_EXPR
:
9246 case VEC_RSHIFT_EXPR
:
9248 target
= expand_vec_shift_expr (exp
, target
);
9252 case VEC_UNPACK_HI_EXPR
:
9253 case VEC_UNPACK_LO_EXPR
:
9255 op0
= expand_normal (TREE_OPERAND (exp
, 0));
9256 this_optab
= optab_for_tree_code (code
, type
);
9257 temp
= expand_widen_pattern_expr (exp
, op0
, NULL_RTX
, NULL_RTX
,
9263 case VEC_UNPACK_FLOAT_HI_EXPR
:
9264 case VEC_UNPACK_FLOAT_LO_EXPR
:
9266 op0
= expand_normal (TREE_OPERAND (exp
, 0));
9267 /* The signedness is determined from input operand. */
9268 this_optab
= optab_for_tree_code (code
,
9269 TREE_TYPE (TREE_OPERAND (exp
, 0)));
9270 temp
= expand_widen_pattern_expr
9271 (exp
, op0
, NULL_RTX
, NULL_RTX
,
9272 target
, TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (exp
, 0))));
9278 case VEC_WIDEN_MULT_HI_EXPR
:
9279 case VEC_WIDEN_MULT_LO_EXPR
:
9281 tree oprnd0
= TREE_OPERAND (exp
, 0);
9282 tree oprnd1
= TREE_OPERAND (exp
, 1);
9284 expand_operands (oprnd0
, oprnd1
, NULL_RTX
, &op0
, &op1
, 0);
9285 target
= expand_widen_pattern_expr (exp
, op0
, op1
, NULL_RTX
,
9287 gcc_assert (target
);
9291 case VEC_PACK_TRUNC_EXPR
:
9292 case VEC_PACK_SAT_EXPR
:
9293 case VEC_PACK_FIX_TRUNC_EXPR
:
9295 mode
= TYPE_MODE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
9300 return lang_hooks
.expand_expr (exp
, original_target
, tmode
,
9304 /* Here to do an ordinary binary operator. */
9306 expand_operands (TREE_OPERAND (exp
, 0), TREE_OPERAND (exp
, 1),
9307 subtarget
, &op0
, &op1
, 0);
9309 this_optab
= optab_for_tree_code (code
, type
);
9311 if (modifier
== EXPAND_STACK_PARM
)
9313 temp
= expand_binop (mode
, this_optab
, op0
, op1
, target
,
9314 unsignedp
, OPTAB_LIB_WIDEN
);
9316 return REDUCE_BIT_FIELD (temp
);
9318 #undef REDUCE_BIT_FIELD
9320 /* Subroutine of above: reduce EXP to the precision of TYPE (in the
9321 signedness of TYPE), possibly returning the result in TARGET. */
9323 reduce_to_bit_field_precision (rtx exp
, rtx target
, tree type
)
9325 HOST_WIDE_INT prec
= TYPE_PRECISION (type
);
9326 if (target
&& GET_MODE (target
) != GET_MODE (exp
))
9328 /* For constant values, reduce using build_int_cst_type. */
9329 if (GET_CODE (exp
) == CONST_INT
)
9331 HOST_WIDE_INT value
= INTVAL (exp
);
9332 tree t
= build_int_cst_type (type
, value
);
9333 return expand_expr (t
, target
, VOIDmode
, EXPAND_NORMAL
);
9335 else if (TYPE_UNSIGNED (type
))
9338 if (prec
< HOST_BITS_PER_WIDE_INT
)
9339 mask
= immed_double_const (((unsigned HOST_WIDE_INT
) 1 << prec
) - 1, 0,
9342 mask
= immed_double_const ((unsigned HOST_WIDE_INT
) -1,
9343 ((unsigned HOST_WIDE_INT
) 1
9344 << (prec
- HOST_BITS_PER_WIDE_INT
)) - 1,
9346 return expand_and (GET_MODE (exp
), exp
, mask
, target
);
9350 tree count
= build_int_cst (NULL_TREE
,
9351 GET_MODE_BITSIZE (GET_MODE (exp
)) - prec
);
9352 exp
= expand_shift (LSHIFT_EXPR
, GET_MODE (exp
), exp
, count
, target
, 0);
9353 return expand_shift (RSHIFT_EXPR
, GET_MODE (exp
), exp
, count
, target
, 0);
9357 /* Subroutine of above: returns 1 if OFFSET corresponds to an offset that
9358 when applied to the address of EXP produces an address known to be
9359 aligned more than BIGGEST_ALIGNMENT. */
9362 is_aligning_offset (const_tree offset
, const_tree exp
)
9364 /* Strip off any conversions. */
9365 while (TREE_CODE (offset
) == NON_LVALUE_EXPR
9366 || TREE_CODE (offset
) == NOP_EXPR
9367 || TREE_CODE (offset
) == CONVERT_EXPR
)
9368 offset
= TREE_OPERAND (offset
, 0);
9370 /* We must now have a BIT_AND_EXPR with a constant that is one less than
9371 power of 2 and which is larger than BIGGEST_ALIGNMENT. */
9372 if (TREE_CODE (offset
) != BIT_AND_EXPR
9373 || !host_integerp (TREE_OPERAND (offset
, 1), 1)
9374 || compare_tree_int (TREE_OPERAND (offset
, 1),
9375 BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) <= 0
9376 || !exact_log2 (tree_low_cst (TREE_OPERAND (offset
, 1), 1) + 1) < 0)
9379 /* Look at the first operand of BIT_AND_EXPR and strip any conversion.
9380 It must be NEGATE_EXPR. Then strip any more conversions. */
9381 offset
= TREE_OPERAND (offset
, 0);
9382 while (TREE_CODE (offset
) == NON_LVALUE_EXPR
9383 || TREE_CODE (offset
) == NOP_EXPR
9384 || TREE_CODE (offset
) == CONVERT_EXPR
)
9385 offset
= TREE_OPERAND (offset
, 0);
9387 if (TREE_CODE (offset
) != NEGATE_EXPR
)
9390 offset
= TREE_OPERAND (offset
, 0);
9391 while (TREE_CODE (offset
) == NON_LVALUE_EXPR
9392 || TREE_CODE (offset
) == NOP_EXPR
9393 || TREE_CODE (offset
) == CONVERT_EXPR
)
9394 offset
= TREE_OPERAND (offset
, 0);
9396 /* This must now be the address of EXP. */
9397 return TREE_CODE (offset
) == ADDR_EXPR
&& TREE_OPERAND (offset
, 0) == exp
;
9400 /* Return the tree node if an ARG corresponds to a string constant or zero
9401 if it doesn't. If we return nonzero, set *PTR_OFFSET to the offset
9402 in bytes within the string that ARG is accessing. The type of the
9403 offset will be `sizetype'. */
9406 string_constant (tree arg
, tree
*ptr_offset
)
9408 tree array
, offset
, lower_bound
;
9411 if (TREE_CODE (arg
) == ADDR_EXPR
)
9413 if (TREE_CODE (TREE_OPERAND (arg
, 0)) == STRING_CST
)
9415 *ptr_offset
= size_zero_node
;
9416 return TREE_OPERAND (arg
, 0);
9418 else if (TREE_CODE (TREE_OPERAND (arg
, 0)) == VAR_DECL
)
9420 array
= TREE_OPERAND (arg
, 0);
9421 offset
= size_zero_node
;
9423 else if (TREE_CODE (TREE_OPERAND (arg
, 0)) == ARRAY_REF
)
9425 array
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 0);
9426 offset
= TREE_OPERAND (TREE_OPERAND (arg
, 0), 1);
9427 if (TREE_CODE (array
) != STRING_CST
9428 && TREE_CODE (array
) != VAR_DECL
)
9431 /* Check if the array has a nonzero lower bound. */
9432 lower_bound
= array_ref_low_bound (TREE_OPERAND (arg
, 0));
9433 if (!integer_zerop (lower_bound
))
9435 /* If the offset and base aren't both constants, return 0. */
9436 if (TREE_CODE (lower_bound
) != INTEGER_CST
)
9438 if (TREE_CODE (offset
) != INTEGER_CST
)
9440 /* Adjust offset by the lower bound. */
9441 offset
= size_diffop (fold_convert (sizetype
, offset
),
9442 fold_convert (sizetype
, lower_bound
));
9448 else if (TREE_CODE (arg
) == PLUS_EXPR
|| TREE_CODE (arg
) == POINTER_PLUS_EXPR
)
9450 tree arg0
= TREE_OPERAND (arg
, 0);
9451 tree arg1
= TREE_OPERAND (arg
, 1);
9456 if (TREE_CODE (arg0
) == ADDR_EXPR
9457 && (TREE_CODE (TREE_OPERAND (arg0
, 0)) == STRING_CST
9458 || TREE_CODE (TREE_OPERAND (arg0
, 0)) == VAR_DECL
))
9460 array
= TREE_OPERAND (arg0
, 0);
9463 else if (TREE_CODE (arg1
) == ADDR_EXPR
9464 && (TREE_CODE (TREE_OPERAND (arg1
, 0)) == STRING_CST
9465 || TREE_CODE (TREE_OPERAND (arg1
, 0)) == VAR_DECL
))
9467 array
= TREE_OPERAND (arg1
, 0);
9476 if (TREE_CODE (array
) == STRING_CST
)
9478 *ptr_offset
= fold_convert (sizetype
, offset
);
9481 else if (TREE_CODE (array
) == VAR_DECL
)
9485 /* Variables initialized to string literals can be handled too. */
9486 if (DECL_INITIAL (array
) == NULL_TREE
9487 || TREE_CODE (DECL_INITIAL (array
)) != STRING_CST
)
9490 /* If they are read-only, non-volatile and bind locally. */
9491 if (! TREE_READONLY (array
)
9492 || TREE_SIDE_EFFECTS (array
)
9493 || ! targetm
.binds_local_p (array
))
9496 /* Avoid const char foo[4] = "abcde"; */
9497 if (DECL_SIZE_UNIT (array
) == NULL_TREE
9498 || TREE_CODE (DECL_SIZE_UNIT (array
)) != INTEGER_CST
9499 || (length
= TREE_STRING_LENGTH (DECL_INITIAL (array
))) <= 0
9500 || compare_tree_int (DECL_SIZE_UNIT (array
), length
) < 0)
9503 /* If variable is bigger than the string literal, OFFSET must be constant
9504 and inside of the bounds of the string literal. */
9505 offset
= fold_convert (sizetype
, offset
);
9506 if (compare_tree_int (DECL_SIZE_UNIT (array
), length
) > 0
9507 && (! host_integerp (offset
, 1)
9508 || compare_tree_int (offset
, length
) >= 0))
9511 *ptr_offset
= offset
;
9512 return DECL_INITIAL (array
);
9518 /* Generate code to calculate EXP using a store-flag instruction
9519 and return an rtx for the result. EXP is either a comparison
9520 or a TRUTH_NOT_EXPR whose operand is a comparison.
9522 If TARGET is nonzero, store the result there if convenient.
9524 If ONLY_CHEAP is nonzero, only do this if it is likely to be very
9527 Return zero if there is no suitable set-flag instruction
9528 available on this machine.
9530 Once expand_expr has been called on the arguments of the comparison,
9531 we are committed to doing the store flag, since it is not safe to
9532 re-evaluate the expression. We emit the store-flag insn by calling
9533 emit_store_flag, but only expand the arguments if we have a reason
9534 to believe that emit_store_flag will be successful. If we think that
9535 it will, but it isn't, we have to simulate the store-flag with a
9536 set/jump/set sequence. */
9539 do_store_flag (tree exp
, rtx target
, enum machine_mode mode
, int only_cheap
)
9542 tree arg0
, arg1
, type
;
9544 enum machine_mode operand_mode
;
9548 enum insn_code icode
;
9549 rtx subtarget
= target
;
9552 /* If this is a TRUTH_NOT_EXPR, set a flag indicating we must invert the
9553 result at the end. We can't simply invert the test since it would
9554 have already been inverted if it were valid. This case occurs for
9555 some floating-point comparisons. */
9557 if (TREE_CODE (exp
) == TRUTH_NOT_EXPR
)
9558 invert
= 1, exp
= TREE_OPERAND (exp
, 0);
9560 arg0
= TREE_OPERAND (exp
, 0);
9561 arg1
= TREE_OPERAND (exp
, 1);
9563 /* Don't crash if the comparison was erroneous. */
9564 if (arg0
== error_mark_node
|| arg1
== error_mark_node
)
9567 type
= TREE_TYPE (arg0
);
9568 operand_mode
= TYPE_MODE (type
);
9569 unsignedp
= TYPE_UNSIGNED (type
);
9571 /* We won't bother with BLKmode store-flag operations because it would mean
9572 passing a lot of information to emit_store_flag. */
9573 if (operand_mode
== BLKmode
)
9576 /* We won't bother with store-flag operations involving function pointers
9577 when function pointers must be canonicalized before comparisons. */
9578 #ifdef HAVE_canonicalize_funcptr_for_compare
9579 if (HAVE_canonicalize_funcptr_for_compare
9580 && ((TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == POINTER_TYPE
9581 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
9583 || (TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 1))) == POINTER_TYPE
9584 && (TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 1))))
9585 == FUNCTION_TYPE
))))
9592 /* Get the rtx comparison code to use. We know that EXP is a comparison
9593 operation of some type. Some comparisons against 1 and -1 can be
9594 converted to comparisons with zero. Do so here so that the tests
9595 below will be aware that we have a comparison with zero. These
9596 tests will not catch constants in the first operand, but constants
9597 are rarely passed as the first operand. */
9599 switch (TREE_CODE (exp
))
9608 if (integer_onep (arg1
))
9609 arg1
= integer_zero_node
, code
= unsignedp
? LEU
: LE
;
9611 code
= unsignedp
? LTU
: LT
;
9614 if (! unsignedp
&& integer_all_onesp (arg1
))
9615 arg1
= integer_zero_node
, code
= LT
;
9617 code
= unsignedp
? LEU
: LE
;
9620 if (! unsignedp
&& integer_all_onesp (arg1
))
9621 arg1
= integer_zero_node
, code
= GE
;
9623 code
= unsignedp
? GTU
: GT
;
9626 if (integer_onep (arg1
))
9627 arg1
= integer_zero_node
, code
= unsignedp
? GTU
: GT
;
9629 code
= unsignedp
? GEU
: GE
;
9632 case UNORDERED_EXPR
:
9661 /* Put a constant second. */
9662 if (TREE_CODE (arg0
) == REAL_CST
|| TREE_CODE (arg0
) == INTEGER_CST
9663 || TREE_CODE (arg0
) == FIXED_CST
)
9665 tem
= arg0
; arg0
= arg1
; arg1
= tem
;
9666 code
= swap_condition (code
);
9669 /* If this is an equality or inequality test of a single bit, we can
9670 do this by shifting the bit being tested to the low-order bit and
9671 masking the result with the constant 1. If the condition was EQ,
9672 we xor it with 1. This does not require an scc insn and is faster
9673 than an scc insn even if we have it.
9675 The code to make this transformation was moved into fold_single_bit_test,
9676 so we just call into the folder and expand its result. */
9678 if ((code
== NE
|| code
== EQ
)
9679 && TREE_CODE (arg0
) == BIT_AND_EXPR
&& integer_zerop (arg1
)
9680 && integer_pow2p (TREE_OPERAND (arg0
, 1)))
9682 tree type
= lang_hooks
.types
.type_for_mode (mode
, unsignedp
);
9683 return expand_expr (fold_single_bit_test (code
== NE
? NE_EXPR
: EQ_EXPR
,
9685 target
, VOIDmode
, EXPAND_NORMAL
);
9688 /* Now see if we are likely to be able to do this. Return if not. */
9689 if (! can_compare_p (code
, operand_mode
, ccp_store_flag
))
9692 icode
= setcc_gen_code
[(int) code
];
9694 if (icode
== CODE_FOR_nothing
)
9696 enum machine_mode wmode
;
9698 for (wmode
= operand_mode
;
9699 icode
== CODE_FOR_nothing
&& wmode
!= VOIDmode
;
9700 wmode
= GET_MODE_WIDER_MODE (wmode
))
9701 icode
= optab_handler (cstore_optab
, wmode
)->insn_code
;
9704 if (icode
== CODE_FOR_nothing
9705 || (only_cheap
&& insn_data
[(int) icode
].operand
[0].mode
!= mode
))
9707 /* We can only do this if it is one of the special cases that
9708 can be handled without an scc insn. */
9709 if ((code
== LT
&& integer_zerop (arg1
))
9710 || (! only_cheap
&& code
== GE
&& integer_zerop (arg1
)))
9712 else if (! only_cheap
&& (code
== NE
|| code
== EQ
)
9713 && TREE_CODE (type
) != REAL_TYPE
9714 && ((optab_handler (abs_optab
, operand_mode
)->insn_code
9715 != CODE_FOR_nothing
)
9716 || (optab_handler (ffs_optab
, operand_mode
)->insn_code
9717 != CODE_FOR_nothing
)))
9723 if (! get_subtarget (target
)
9724 || GET_MODE (subtarget
) != operand_mode
)
9727 expand_operands (arg0
, arg1
, subtarget
, &op0
, &op1
, 0);
9730 target
= gen_reg_rtx (mode
);
9732 result
= emit_store_flag (target
, code
, op0
, op1
,
9733 operand_mode
, unsignedp
, 1);
9738 result
= expand_binop (mode
, xor_optab
, result
, const1_rtx
,
9739 result
, 0, OPTAB_LIB_WIDEN
);
9743 /* If this failed, we have to do this with set/compare/jump/set code. */
9745 || reg_mentioned_p (target
, op0
) || reg_mentioned_p (target
, op1
))
9746 target
= gen_reg_rtx (GET_MODE (target
));
9748 emit_move_insn (target
, invert
? const0_rtx
: const1_rtx
);
9749 label
= gen_label_rtx ();
9750 do_compare_rtx_and_jump (op0
, op1
, code
, unsignedp
, operand_mode
, NULL_RTX
,
9753 emit_move_insn (target
, invert
? const1_rtx
: const0_rtx
);
9760 /* Stubs in case we haven't got a casesi insn. */
9762 # define HAVE_casesi 0
9763 # define gen_casesi(a, b, c, d, e) (0)
9764 # define CODE_FOR_casesi CODE_FOR_nothing
9767 /* If the machine does not have a case insn that compares the bounds,
9768 this means extra overhead for dispatch tables, which raises the
9769 threshold for using them. */
9770 #ifndef CASE_VALUES_THRESHOLD
9771 #define CASE_VALUES_THRESHOLD (HAVE_casesi ? 4 : 5)
9772 #endif /* CASE_VALUES_THRESHOLD */
9775 case_values_threshold (void)
9777 return CASE_VALUES_THRESHOLD
;
9780 /* Attempt to generate a casesi instruction. Returns 1 if successful,
9781 0 otherwise (i.e. if there is no casesi instruction). */
9783 try_casesi (tree index_type
, tree index_expr
, tree minval
, tree range
,
9784 rtx table_label ATTRIBUTE_UNUSED
, rtx default_label
)
9786 enum machine_mode index_mode
= SImode
;
9787 int index_bits
= GET_MODE_BITSIZE (index_mode
);
9788 rtx op1
, op2
, index
;
9789 enum machine_mode op_mode
;
9794 /* Convert the index to SImode. */
9795 if (GET_MODE_BITSIZE (TYPE_MODE (index_type
)) > GET_MODE_BITSIZE (index_mode
))
9797 enum machine_mode omode
= TYPE_MODE (index_type
);
9798 rtx rangertx
= expand_normal (range
);
9800 /* We must handle the endpoints in the original mode. */
9801 index_expr
= build2 (MINUS_EXPR
, index_type
,
9802 index_expr
, minval
);
9803 minval
= integer_zero_node
;
9804 index
= expand_normal (index_expr
);
9805 emit_cmp_and_jump_insns (rangertx
, index
, LTU
, NULL_RTX
,
9806 omode
, 1, default_label
);
9807 /* Now we can safely truncate. */
9808 index
= convert_to_mode (index_mode
, index
, 0);
9812 if (TYPE_MODE (index_type
) != index_mode
)
9814 index_type
= lang_hooks
.types
.type_for_size (index_bits
, 0);
9815 index_expr
= fold_convert (index_type
, index_expr
);
9818 index
= expand_normal (index_expr
);
9821 do_pending_stack_adjust ();
9823 op_mode
= insn_data
[(int) CODE_FOR_casesi
].operand
[0].mode
;
9824 if (! (*insn_data
[(int) CODE_FOR_casesi
].operand
[0].predicate
)
9826 index
= copy_to_mode_reg (op_mode
, index
);
9828 op1
= expand_normal (minval
);
9830 op_mode
= insn_data
[(int) CODE_FOR_casesi
].operand
[1].mode
;
9831 op1
= convert_modes (op_mode
, TYPE_MODE (TREE_TYPE (minval
)),
9832 op1
, TYPE_UNSIGNED (TREE_TYPE (minval
)));
9833 if (! (*insn_data
[(int) CODE_FOR_casesi
].operand
[1].predicate
)
9835 op1
= copy_to_mode_reg (op_mode
, op1
);
9837 op2
= expand_normal (range
);
9839 op_mode
= insn_data
[(int) CODE_FOR_casesi
].operand
[2].mode
;
9840 op2
= convert_modes (op_mode
, TYPE_MODE (TREE_TYPE (range
)),
9841 op2
, TYPE_UNSIGNED (TREE_TYPE (range
)));
9842 if (! (*insn_data
[(int) CODE_FOR_casesi
].operand
[2].predicate
)
9844 op2
= copy_to_mode_reg (op_mode
, op2
);
9846 emit_jump_insn (gen_casesi (index
, op1
, op2
,
9847 table_label
, default_label
));
9851 /* Attempt to generate a tablejump instruction; same concept. */
9852 #ifndef HAVE_tablejump
9853 #define HAVE_tablejump 0
9854 #define gen_tablejump(x, y) (0)
9857 /* Subroutine of the next function.
9859 INDEX is the value being switched on, with the lowest value
9860 in the table already subtracted.
9861 MODE is its expected mode (needed if INDEX is constant).
9862 RANGE is the length of the jump table.
9863 TABLE_LABEL is a CODE_LABEL rtx for the table itself.
9865 DEFAULT_LABEL is a CODE_LABEL rtx to jump to if the
9866 index value is out of range. */
9869 do_tablejump (rtx index
, enum machine_mode mode
, rtx range
, rtx table_label
,
9874 if (INTVAL (range
) > cfun
->max_jumptable_ents
)
9875 cfun
->max_jumptable_ents
= INTVAL (range
);
9877 /* Do an unsigned comparison (in the proper mode) between the index
9878 expression and the value which represents the length of the range.
9879 Since we just finished subtracting the lower bound of the range
9880 from the index expression, this comparison allows us to simultaneously
9881 check that the original index expression value is both greater than
9882 or equal to the minimum value of the range and less than or equal to
9883 the maximum value of the range. */
9885 emit_cmp_and_jump_insns (index
, range
, GTU
, NULL_RTX
, mode
, 1,
9888 /* If index is in range, it must fit in Pmode.
9889 Convert to Pmode so we can index with it. */
9891 index
= convert_to_mode (Pmode
, index
, 1);
9893 /* Don't let a MEM slip through, because then INDEX that comes
9894 out of PIC_CASE_VECTOR_ADDRESS won't be a valid address,
9895 and break_out_memory_refs will go to work on it and mess it up. */
9896 #ifdef PIC_CASE_VECTOR_ADDRESS
9897 if (flag_pic
&& !REG_P (index
))
9898 index
= copy_to_mode_reg (Pmode
, index
);
9901 /* If flag_force_addr were to affect this address
9902 it could interfere with the tricky assumptions made
9903 about addresses that contain label-refs,
9904 which may be valid only very near the tablejump itself. */
9905 /* ??? The only correct use of CASE_VECTOR_MODE is the one inside the
9906 GET_MODE_SIZE, because this indicates how large insns are. The other
9907 uses should all be Pmode, because they are addresses. This code
9908 could fail if addresses and insns are not the same size. */
9909 index
= gen_rtx_PLUS (Pmode
,
9910 gen_rtx_MULT (Pmode
, index
,
9911 GEN_INT (GET_MODE_SIZE (CASE_VECTOR_MODE
))),
9912 gen_rtx_LABEL_REF (Pmode
, table_label
));
9913 #ifdef PIC_CASE_VECTOR_ADDRESS
9915 index
= PIC_CASE_VECTOR_ADDRESS (index
);
9918 index
= memory_address_noforce (CASE_VECTOR_MODE
, index
);
9919 temp
= gen_reg_rtx (CASE_VECTOR_MODE
);
9920 vector
= gen_const_mem (CASE_VECTOR_MODE
, index
);
9921 convert_move (temp
, vector
, 0);
9923 emit_jump_insn (gen_tablejump (temp
, table_label
));
9925 /* If we are generating PIC code or if the table is PC-relative, the
9926 table and JUMP_INSN must be adjacent, so don't output a BARRIER. */
9927 if (! CASE_VECTOR_PC_RELATIVE
&& ! flag_pic
)
9932 try_tablejump (tree index_type
, tree index_expr
, tree minval
, tree range
,
9933 rtx table_label
, rtx default_label
)
9937 if (! HAVE_tablejump
)
9940 index_expr
= fold_build2 (MINUS_EXPR
, index_type
,
9941 fold_convert (index_type
, index_expr
),
9942 fold_convert (index_type
, minval
));
9943 index
= expand_normal (index_expr
);
9944 do_pending_stack_adjust ();
9946 do_tablejump (index
, TYPE_MODE (index_type
),
9947 convert_modes (TYPE_MODE (index_type
),
9948 TYPE_MODE (TREE_TYPE (range
)),
9949 expand_normal (range
),
9950 TYPE_UNSIGNED (TREE_TYPE (range
))),
9951 table_label
, default_label
);
9955 /* Nonzero if the mode is a valid vector mode for this architecture.
9956 This returns nonzero even if there is no hardware support for the
9957 vector mode, but we can emulate with narrower modes. */
9960 vector_mode_valid_p (enum machine_mode mode
)
9962 enum mode_class
class = GET_MODE_CLASS (mode
);
9963 enum machine_mode innermode
;
9965 /* Doh! What's going on? */
9966 if (class != MODE_VECTOR_INT
9967 && class != MODE_VECTOR_FLOAT
9968 && class != MODE_VECTOR_FRACT
9969 && class != MODE_VECTOR_UFRACT
9970 && class != MODE_VECTOR_ACCUM
9971 && class != MODE_VECTOR_UACCUM
)
9974 /* Hardware support. Woo hoo! */
9975 if (targetm
.vector_mode_supported_p (mode
))
9978 innermode
= GET_MODE_INNER (mode
);
9980 /* We should probably return 1 if requesting V4DI and we have no DI,
9981 but we have V2DI, but this is probably very unlikely. */
9983 /* If we have support for the inner mode, we can safely emulate it.
9984 We may not have V2DI, but me can emulate with a pair of DIs. */
9985 return targetm
.scalar_mode_supported_p (innermode
);
9988 /* Return a CONST_VECTOR rtx for a VECTOR_CST tree. */
9990 const_vector_from_tree (tree exp
)
9995 enum machine_mode inner
, mode
;
9997 mode
= TYPE_MODE (TREE_TYPE (exp
));
9999 if (initializer_zerop (exp
))
10000 return CONST0_RTX (mode
);
10002 units
= GET_MODE_NUNITS (mode
);
10003 inner
= GET_MODE_INNER (mode
);
10005 v
= rtvec_alloc (units
);
10007 link
= TREE_VECTOR_CST_ELTS (exp
);
10008 for (i
= 0; link
; link
= TREE_CHAIN (link
), ++i
)
10010 elt
= TREE_VALUE (link
);
10012 if (TREE_CODE (elt
) == REAL_CST
)
10013 RTVEC_ELT (v
, i
) = CONST_DOUBLE_FROM_REAL_VALUE (TREE_REAL_CST (elt
),
10015 else if (TREE_CODE (elt
) == FIXED_CST
)
10016 RTVEC_ELT (v
, i
) = CONST_FIXED_FROM_FIXED_VALUE (TREE_FIXED_CST (elt
),
10019 RTVEC_ELT (v
, i
) = immed_double_const (TREE_INT_CST_LOW (elt
),
10020 TREE_INT_CST_HIGH (elt
),
10024 /* Initialize remaining elements to 0. */
10025 for (; i
< units
; ++i
)
10026 RTVEC_ELT (v
, i
) = CONST0_RTX (inner
);
10028 return gen_rtx_CONST_VECTOR (mode
, v
);
10030 #include "gt-expr.h"